Skip to main content
SpringerLink
Log in

Idempotent Relations in Isabelle/HOL

  • Conference paper
Theoretical Aspects of Computing - ICTAC 2004 (ICTAC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3407))

Included in the following conference series:

  • 452 Accesses

Abstract

A characterization of idempotent relations is presented first as a paper-style proof, then by its formalization in Isabelle/HOL. The novel characterization gives rise to the construction of idempotent relations by an abstract algorithm. This algorithm is rigorously developed inside Isabelle/HOL using primitive recursive function definitions. Whilst the characterisation and algorithm appear to be new, we regard this as an interesting demonstration of the interplay between mathematical reasoning and program development, in particular using Isabelle/HOL.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Burghardt, J., Kammüller, F., Sanders, J.W.: On the Antisymmetry of Galois Embeddings. Information Processing Letters 79(2) (2001)

    Google Scholar 

  2. Berghofer, S., Nipkow, T.: Executing higher order logic. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R. (eds.) TYPES 2000. LNCS, vol. 2277, p. 24. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Clifford, A.H., Preston, G.B.: The Algebraic Theory of Semigroups. Mathematical Surveys 1(7) (1961)

    Google Scholar 

  4. Curtis, C.W., Reiner, I.: Representation Theory of Finite Groups and Associative Algebras. Interscience Publishers, John Wiley (1966)

    Google Scholar 

  5. Davey, R.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)

    MATH  Google Scholar 

  6. Dunford, N., Schwartz, J.T.: Linear Operators. Part I: General Theory. Interscience Publishers, John Wiley (1958)

    Google Scholar 

  7. Naraschewski, W., Wenzel, M.: Object-oriented verification based on record subtyping in higher-order logic. In: Grundy, J., Newey, M. (eds.) TPHOLs 1998. LNCS, vol. 1479, pp. 349–366. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  8. Paulson, L.C.: Isabelle. LNCS, vol. 828. Springer, Heidelberg (1994)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Software Engineering and Theoretical Computer Science, Technische Universität Berlin,  

    Florian Kammüller & J. W. Sanders

  2. Computing Laboratory, University of Oxford,  

    Florian Kammüller & J. W. Sanders

Authors
  1. Florian Kammüller
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. W. Sanders
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. International Institute of Software Technology, United Nations University, Macau, China

    Zhiming Liu

  2. Department of Computer Science and Communication Engineering, Graduate School of Information Science and Electrical Engineering, Kyushu University, 6-10-1-Hakozaki, Higashi-ku, 812-8581, Fukuoka, Japan

    Keijiro Araki

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kammüller, F., Sanders, J.W. (2005). Idempotent Relations in Isabelle/HOL. In: Liu, Z., Araki, K. (eds) Theoretical Aspects of Computing - ICTAC 2004. ICTAC 2004. Lecture Notes in Computer Science, vol 3407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31862-0_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31862-0_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25304-4

  • Online ISBN: 978-3-540-31862-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation