Interpretation of locales in isabelle: Theories and proof contexts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4108 LNAI, Issue , 2006, Pages 31-43

  Ballarin, Clemens ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL ARITHMETIC; SPECIFICATIONS; TOPOLOGY;

NATURAL DEDUCTION PROOFS; PROOF ASSISTANT ISABELLE; SPECIFICATION CONTEXTS;

THEOREM PROVING;

EID: 33749582048     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11812289_4     Document Type: Conference Paper

References (18)

1. S. Autexier, D. Hutter, T. Mossakowski, and A. Schairer. The development graph manager Maya. In H. Kirchner and C. Ringeissen, editors, Algebraic Methodology and Software Technology, AMAST 2002, Saint-Gilles-les-Bains, Reunion Island, France, LNCS 2422, pages 495-501. Springer, 2002.
2. C. Ballarin. Locales and locale expressions in Isabelle/Isar. In Berardi et al. [4], pages 34-50.
3. C. Ballarin. Interpretation of locales in Isabelle: Managing dependencies between locales. Technical Report TUM-I0607, Technische Universität München, 2006.
4. S. Berardi, M. Coppo, and F. Damiani, editors. Types for Proofs and Programs, TYPES 2003, Torino, Italy, LNCS 3085, Springer, 2004.
5. J. Chrzaszcz. Modules in Coq are and will be correct. In Berardi et al. [4], pages 130-136.
6. W. M. Farmer, J. D. Guttman, and F. J. Thayer. Little theories. In D. Kapur, editor, Automated deduction, CADE-11: Saratoga Springs, NY, USA, LNCS 607, pages 567-581. Springer-Verlag, 1992.
7. D. Hutter. Management of change in structured verification. In Automated Software Engineering, ASE 2000, Grenoble, France, pages 23-31. IEEE Computer Society, 2000.
8. F. Kammüller. Modular Reasoning in Isabelle. PhD thesis, University of Cambridge, Computer Laboratory, Aug. 1999. Also Technical Report No. 470.
9. F. Kammüller, M. Wenzel, and L. C. Paulson. Locales: A sectioning concept for Isabelle. In Y. Bertot, G. Dowek, A. Hirschowitz, C. Paulin, and L. Théry, editors, Theorem Proving in Higher Order Logics: TPHOLs'99, Nice, France, LNCS 1690, pages 149-165. Springer, 1999.
10. T. Nipkow. Functional unification of higher-order patterns. In Eighth Annual IEEE Symposium on Logic in Computer Science, pages 64-74, 1993.
11. T. Nipkow. Structured proofs in Isar/HOL. In H. Geuvers and F. Wiedijk, editors, Types for Proofs and Programs (TYPES 2002), LNCS 2646, pages 259-278. Springer, 2003.
12. T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL: A Proof Assistant for Higher-Order Logic. LNCS 2283. Springer, 2002.
13. S. Owre and N. Shankar. Theory interpretation in PVS. Technical Report CSL-01-01, SRI, Apr. 2001.
14. L. C. Paulson. The foundation of a generic theorem prover. Journal of Automated Reasoning, 5(3):363-397, 1989.
15. M. Wenzel. The IsabelleAsar reference manual. Part of the Isabelle distribution, available at http://isabelle.in.tum.de.
16. M. Wenzel. Type classes and overloading in higher-order logic. In E. L. Gunter and A. Felty, editors, Theorem proving in higher order logics: 10th International Conference, TPHOLs '97, Murray Hill, NJ, USA, August 19-22, 1997: proceedings, LNCS 1275, pages 307-322. Springer, 1997.
17. M. Wenzel. Isabelle/Isar - a versatile environment for human-readable formal proof documents. PhD thesis, Technische Universität München, 2002. Internet publication, http://tumbl.biblio.tu-muenchen.de/publ/diss/in/ 2002/wenzel.html.
18. M. Wenzel. Structured induction proofs in Isabelle/Isar. MKM, 2006.