Mechanising Hankin and Barendregt using the Gordon-Melham axioms

Proceedings of the 2003 ACM SIGPLAN Workshop on Mechanized Reasoning about Languages with Variable Binding, MERLIN 2003

Volumn , Issue , 2003, Pages

  Norrish, Michael ^a  

^a CSIRO   (Australia)

Author keywords

Higher order abstract syntax; Interactive theorem proving

Indexed keywords

CALCULATIONS; MACHINERY;

CALCULUS THEORIES; EASE-OF-USE; EQUATIONAL THEORY; HIGHER-ORDER ABSTRACT SYNTAX; INTERACTIVE THEOREM PROVING; MECHANICAL SUPPORT; MECHANISATION; REDUCTION THEORY;

BINS;

EID: 33747208964     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/976571.976577     Document Type: Conference Paper

References (11)

1. Simon J. Ambler, Roy L. Crole, and Alberto Momigliano. Combining higher order abstract syntax with tactical theorem proving and (co) induction. In V. A. Carreño, C. A. Muñoz, and S. Tahar, editors, Theorem Proving in Higher Order Logics, 15th Internaional Conference, volume 2410 of Lecture Notes in Computer Science, pages 13-30. Springer, 2002.
2. H. P. Barendregt. The Lambda Calculus: its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North Holland, Amsterdam, revised edition, 1984.
3. Jonathan M. Ford and Ian A. Mason. Operational techniques in PVS: a preliminary evaluation. In Colin Fidge, editor, Computing: The Australasian Theory Symposium (CATS 2001), volume 42 of Electronic Notes in Theoretical Computer Science. Elsevier, 2001.
4. A. D. Gordon and T. Melham. Five axioms of alpha conversion. In J. von Wright, J. Grundy, and J. Harrison, editors, Theorem Proving in Higher Order Logics: 9th International Conference, TPHOLs'96, volume 1125 of Lecture Notes in Computer Science, pages 173-190. Springer-Verlag, 1996.
5. Chris Hankin. Lambda Calculi: A Guide for Computer Scientists, volume 3 of Graduate Texts in Computer Science. Clarendon Press, Oxford, 1994.
6. Peter Homeier. A proof of the Church-Rosser theorem for the lambda calculus in higher order logic. In Richard J. Boulton and Paul B. Jackson, editors, TPHOLs 2001: Supplemental Proceedings, pages 207-222. Division of Informatics, University of Edinburgh, September 2001. Available as Informatics Research Report EDI-INF-RR-0046.
7. Gérard P. Huet. Residual theory in lambda-calculus: a formal development. Journal of Functional Programming, 4(3):371-394, 1994.
8. James McKinna and Robert Pollack. Some lambda calculus and type theory formalized. Journal of Automated Reasoning, 23(3-4):373-409, November 1999.
9. A. M. Pitts. Nominal logic: A first order theory of names and binding. In N. Kobayashi and B. C. Pierce, editors, Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001, Sendai, Japan, October 29-31, 2001. Proceedings, volume 2215 of Lecture Notes in Computer Science, pages 219-242. Springer-Verlag, Berlin, 2001.
10. René Vestergaard. The Primitive Proof Theory of the l-Calculus. PhD thesis, School of Mathematical and Computer Sciences, Heriot-Watt University, 2003.
11. René Vestergaard and James Brotherston. The mechanisation of Barendregt-style equational proofs (the residual perspective). Electronic Notes in Theoretical Computer Science, 58(1), 2001.