Advertisement

Locales A Sectioning Concept for Isabelle

  • Florian Kammüller
  • Markus Wenzel
  • Lawrence C. Paulson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1690)

Abstract

Locales are a means to define local scopes for the interactive proving process of the theorem prover Isabelle. They delimit a range in which fixed assumption are made, and theorems are proved that depend on these assumptions. A locale may also contain constants defined locally and associated with pretty printing syntax.

Locales can be seen as a simple form of modules. They are similar to sections as in AUTOMATH or Coq. Locales are used to enhance abstract reasoning and similar applications of theorem provers. This paper motivates the concept of locales by examples from abstract algebraic reasoning. It also discusses some implementation issues.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [CCF+96]
    C. Cornes, J. Courant, J.-C. Filliâtre, G. Huet, P. Manoury, and C. Muñoz. The Coq Proof Assistant User’s Guide, version 6.1. INRIARocquencourt et CNRS-ENS Lyon, 1996.Google Scholar
  2. [Chu40]
    A. Church. A Formulation of the Simple Theory of Types. Journal of Symbolic Logic, pages 56–68, 1940.Google Scholar
  3. [CM88]
    K. Mani Chandi and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.Google Scholar
  4. [dB80]
    N. G. de Bruijn. A Survey of the Project AUTOMATH. In J.P. Seldin and J.R. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Academic Press Limited, pages 579–606. 1980.Google Scholar
  5. [Dow90]
    G. Dowek. Naming and Scoping in a Mathematical Vernacular. Technical Report 1283, INRIA, Rocquencourt, 1990.Google Scholar
  6. [FGT93]
    W. M. Farmer, J. D. Guttman, and F. J. Thayer. IMPS: an Interactive Mathematical Proof System. Journal of Automated Reasoning, 11:213–248, 1993.CrossRefzbMATHGoogle Scholar
  7. [GH93]
    John V. Guttag and James J. Horning, editors. Larch: Languages and Tools for Formal Specification. Texts and Monographs in Computer Science. Springer-Verlag, 1993. With Stephen J. Garland, Kevin D. Jones, Andrés Modet, and Jeannette M. Wing.Google Scholar
  8. [GM93]
    M. J. C. Gordon and T. F. Melham. Introduction to HOL, a Theorem Proving Environment for Higher Order Logic. Cambridge University Press, 1993.Google Scholar
  9. [Kam99a]
    F. Kammüller. Modular Reasoning in Isabelle. PhD thesis, University of Cambridge, 1999. submitted.Google Scholar
  10. [Kam99b]
    F. Kammüller. Modular Structures as Dependent Types in Isabelle. In Types for Proofs and Programs: TYPES’ 98, LNCS. Springer-Verlag, 1999. Selected papers. To appear.Google Scholar
  11. [KP99]
    F. Kammüller and L. C. Paulson. A Formal Proof of Sylow’s First Theorem — An Experiment in Abstract Algebra with Isabelle HOL. Journal of Automated Reasoning, 1999. To appear.Google Scholar
  12. [NW98]
    W. Naraschewski and M. Wenzel. Object-oriented Verification based on Record Subtyping in Higher-Order Logic. In 11th International Conference on Theorem Proving in Higher Order Logics, volume 1479 of LNCS, ANU, Canberra, Australia, 1998. Springer-Verlag.Google Scholar
  13. [ORR+96]_S. Owre, S. Rajan, J. M. Rushby, N. Shankar, and M. Srivas. PVS: Combining specification, proof checking, and model checking. In R. Alur and T. A. Henzinger, editors, Computer Aided Verification, volume 1102 of LNCS. Springer, 1996.CrossRefGoogle Scholar
  14. [OSRSC98]
    S. Owre, N. Shankar, J.M. Rushby, and D.W.J. Stringer-Calvert. PVS Language Reference. Part of the PVS Manual. Available on the Web as http://www.csl.sri.com/pvsweb/manuals.html, September 1998.
  15. [Pau94]
    L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of LNCS. Springer, 1994.CrossRefzbMATHGoogle Scholar
  16. [Win93]
    P. J. Windley. Abstract Theories in HOL. In L. Claesen and M. Gordon, editors, Higher Order Logic Theorem Proving and its Applications, IFIP Transactions A-20, pages 197–210. North-Holland, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Florian Kammüller
    • 1
  • Markus Wenzel
    • 2
  • Lawrence C. Paulson
    • 1
  1. 1.Computer LaboratoryUniversity of CambridgeUSA
  2. 2.Institut für InformatikTechnische Universität MünchenUSA

Personalised recommendations