Representing isabelle in LF

Electronic Proceedings in Theoretical Computer Science, EPTCS

Volumn 34, Issue , 2010, Pages 85-99

  Rabe, Florian ^a  

^a JACOBS UNIVERSITY BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS;

ISABELLE; LOGICAL FRAMEWORKS; MODULAR STRUCTURES; MODULE SYSTEMS; MORPHISMS; TYPE CLASS;

COMPUTER SCIENCE;

EID: 79961195589     PISSN: 20752180     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4204/EPTCS.34.8     Document Type: Conference Paper

References (21)

1. H. Barendregt. Lambda calculi with types. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, Volume 2. Oxford University Press, 1992.
2. A. Church. A Formulation of the Simple Theory of Types. Journal of Symbolic Logic, 5(1):56-68, 1940.
3. R. Constable, S. Allen, H. Bromley, W. Cleaveland, J. Cremer, R. Harper, D. Howe, T. Knoblock, N. Mendler, P. Panangaden, J. Sasaki, and S. Smith. Implementing Mathematics with the Nuprl Development System. Prentice-Hall, 1986.
4. J. Goguen and R. Burstall. Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery, 39(1):95-146, 1992.
5. F. Haftmann and M. Wenzel. Constructive Type Classes in Isabelle. In T. Altenkirch and C. McBride, editors, TYPES conference, pages 160-174. Springer, 2006.
6. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. Journal of the Association for Computing Machinery, 40(1):143-184, 1993.
7. R. Harper and B. Pierce. Design Issues in Advanced Module Systems. In B. Pierce, editor, Advanced Topics in Types and Programming Languages. MIT Press, 2005.
8. R. Harper, D. Sannella, and A. Tarlecki. Structured presentations and logic representations. Annals of Pure and Applied Logic, 67:113-160, 1994.
9. F. Kammüller, M. Wenzel, and L. Paulson. Locales - a Sectioning Concept for Isabelle. In Y. Bertot, G. Dowek, A. Hirschowitz, C. Paulin, and L. Thery, editors, Theorem Proving in Higher Order Logics, pages 149-166. Springer, 1999.
10. P. Martin-Löf. An Intuitionistic Theory of Types: Predicative Part. In Proceedings of the '73 Logic Colloquium, pages 73-118. North-Holland, 1974.
11. T. Nipkow. Structured Proofs in Isar/HOL. In H. Geuvers and F. Wiedijk, editors, TYPES conference, pages 259-278. Springer, 2002.
12. U. Norell. The Agda WiKi, 2005. http://wiki.portal.chalmers.se/agda.
13. L. Paulson. The Foundation of a Generic Theorem Prover. Journal of Automated Reasoning, 5(3):363-397, 1989.
14. L. Paulson. Isabelle: A Generic Theorem Prover, Volume 828 of Lecture Notes in Computer Science. Springer, 1994.
15. F. Pfenning. Structural cut elimination: I. intuitionistic and classical logic. Information and Computation, 157(1-2):84-141, 2000.
16. F. Pfenning and C. Schürmann. System description: Twelf - a meta-logical framework for deductive systems. Lecture Notes in Computer Science, 1632:202-206, 1999.
17. B. Pientka and J. Dunfield. A Framework for Programming and Reasoning with Deductive Systems (System description). In International Joint Conference on Automated Reasoning, 2010. To appear.
18. F. Rabe and C. Schürmann. A Practical Module System for LF. In J. Cheney and A. Felty, editors, Proceedings of the Workshop on Logical Frameworks: Meta-Theory and Practice (LFMTP), pages 40-48. ACM Press, 2009.
19. F. Rabe and C. Schürmann. A practical module system for LF. In Proceedings of the Workshop on Logical Frameworks Meta-Theory and Practice (LFMTP), 2009.
20. D. Sannella and M. Wirsing. A Kernel Language for Algebraic Specification and Implementation. In M. Karpinski, editor, Fundamentals of Computation Theory, pages 413-427. Springer, 1983.
21. M. Wenzel. The Isabelle/Isar Reference Manual, 2009. http://isabelle.in.tum.de/documentation.html, Dec 3, 2009.