Nominal techniques in Isabelle/HOL

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

Volumn 3632 LNAI, Issue , 2005, Pages 38-53

  Urban, Christian ^a   Tasson, Christine ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Lambda calculus; Nominal logic; Structural induction; Theorem assistants

Indexed keywords

COMPUTATIONAL METHODS; FORMAL LOGIC; THEOREM PROVING;

LAMBDA CALCULUS; NOMINAL LOGIC; STRUCTURAL INDUCTION; THEOREM ASSISTANTS;

SET THEORY;

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

References (20)

1. T. Altenkirch. A Forrnalization of the Strong Normalisation Proof for System F in LEGO. In Proc. of TLCA, volume 664 of LNCS, pages 13-28, 1993.
2. B. E. Aydemir, A. Bohannon, M. Fairbairn, J. N. Foster, B. C. Pierce, P. Sewell, D. Vytiniotis, G. Washburn, S. Weirich, and S. Zdancewic. Mechanized Metatheory for the Masses: The PoplMark Challenge, accepted at tphol 05.
3. H. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, 1981.
4. J. Despeyroux, A. Felty, and A. Hirschowitz. Higher-Order Abstract Syntax in Coq. In Proc. of TLCA, volume 902 of LNCS, pages 124-138, 1995.
5. M. J. Gabbay. A Theory of Inductive Definitions With α-equivalence. PhD thesis, University of Cambridge, 2000.
6. M. J. Gabbay and A. M. Pitts. A New Approach to Abstract Syntax with Variable Binding. Formal Aspects of Computing, 13:341-363, 2001.
7. J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types, volume 7 of Cambridge 7\ncts in Theoretical Computer Science. Cambridge University Press, 1989.
8. A. D. Gordon. A Mechanisation of Name-Carrying Syntax up to Alpha-Conversion. In Proc. of Higher-order logic theorem proving and its applications, volume 780 of LNCS, pages 414-426, 1993.
9. A. D. Gordon and T. Melham. Five Axioms of Alpha-Conversion. In Proc. of TPHOL, volume 1125 of LNCS, pages 173-190, 1996.
10. D. Hirschkoff. A Full Formalisation of π-Calculus Theory in the Calculus of Constructions. In Proc. of TPHOL, volume 1275 of LNCS, pages 153-169, 1997.
11. T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle HOL: A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer-Verlag, 2002.
12. M. Norrish. Mechanising λ-calculus using a Classical First Order Theory of Terms with Permutations, forthcoming.
13. M. Norrish. Recursive Function Definition for Types with Binders. In Proc. of TPHOL, volume 3223 of LNCS, pages 241-256, 2004.
14. L. Paulson. Defining Functions on Equivalence Classes. To appear in ACM Transactions on Computational Logic.
15. F. Pfenning and C. Elliott. Higher-Order Abstract Syntax. In Proc. of the ACM SIGPLAN Conference PLDI, pages 199-208. ACM Press, 1989.
16. A. M. Pitts. Nominal Logic, A First Order Theory of Names and Binding. Information and Computation, 186:165-193, 2003.
17. A. S. Troelstra and H. Schwichtenberg. Basic Proof Theory, volume 43 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2000.
18. C. Urban, A. M. Pitts, and M. J. Gabbay. Nominal Unification. Theoretical Computer Science, 323(1-2):473-497, 2004.
19. M. Vanlnwegen. The Machine-Assisted Proof of Programming Language Properties. PhD thesis, University of Pennsylvania, 1996. Available as MS-CIS-96-31.
20. M. Wenzel. Using Axiomatic Type Classes in Isabelle. Manual in the Isabelle distribution.