Five axioms of alpha-conversion

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

Volumn 1125, Issue , 1996, Pages 173-190

  Gordon, Andrew D ^a   Melham, Tom ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; FORMAL LOGIC;

ALPHA-CONVERSION; BOUND VARIABLES; CONSERVATIVE EXTENSIONS; FREE VARIABLE; LAMBDA ABSTRACTION; LAMBDA TERMS; LENGTH FUNCTIONS; STRUCTURAL INDUCTION;

THEOREM PROVING;

EID: 84956854832     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0105404     Document Type: Conference Paper

References (22)

1. Barendregt, H. P. (1984). The Lambda Calculus: Its Syntax and Semantics (Revised ed.), Volume 103 of Studies in logic and the foundations of mathematics. North-Holland.
2. Boulton, R., A. Gordon, M. Gordon, J. Harrison, J. Herbert, and J. Van Tassel (1992). Experience with embedding hardware description languages in HOL. In V. Stavridou, T. F. Melham, and R. T. Boute (Eds.), Theorem Provers in Circuit Design: Theory, Practice and Experience: Proceedings of the IFIP TC10/WG 10.2 International Conference, Nijmegen, June 1992, IFIP Transactions A-10, pp. 129-156. North-Holland.
3. Church, A. (1941). The Calculi of Lambda-Conversion. Princeton University Press.
4. Curry, H. B. and R. Feys (1958). Combinatory Logic, Volume 1. North-Holland.
5. de Bruijn, N. G. (1972). Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagationes Mathematicae 34, 381-392.
6. Despeyroux, J. and A. Hirschowitz (1994, July). Higher-order abstract syntax with induction in Coq. In F. Pfenning (Ed.), Fifth International Conference on Logic Programming and Automated Reasoning (LPAR'94), Kiev, Volume 882 of LNAI, pp. 159-173. Springer-Verlag.
7. Gordon, A. D. (1994). A mechanisation of name-carrying syntax up to alpha-conversion. In J. J. Joyce and C.-J. H. Seger (Eds.), Higher Order Logic Theorem Proving and its Applications. Proceedings, 1993, Number 780 in Lecture Notes in Computer Science, pp. 414-426. Springer-Verlag.
8. Gordon, M. J. C. and T. F. Melham (Eds.) (1993). Introduction to HOL: A theorem-proving environment for higher-order logic. Cambridge University Press.
9. Hindley, J. R. and J. P. Seldin (1986). Introduction to Combinators and the X-calculus. Cambridge University Press.
10. Lambek, J. and P. J. Scott (1986). Introduction to higher order categorical logic. Cambridge University Press.
11. Landin, P. J. (1964, January). The mechanical evaluation of expressions. Computer Journal 6, 308-320.
12. Matthews, S. (1995, September). Implementing FSq in Isabelle: adding structure at the metalevel. In L. C. Paulson (Ed.), Proceedings of the First Isabelle Users Workshop. Available as Technical Report 379, University of Cambridge Computer Laboratory.
13. McKinna, J. and R. Pollack (1993). Pure Type Systems formalized. In TLCA '93 International Conference on Typed Lambda Calculi and Applications, Utrecht, 16-18 March 1993, Volume 664 of Lecture Notes in Computer Science, pp. 289-305. Springer-Verlag.
14. Melham, T. F. (1994). A mechanized theory of the 7r-calculus in HOL. Nordic Journal of Computing 1, 50-76.
15. Milner, R., J. Parrow, and D. Walker (1992). A calculus of mobile processes, parts I and II. Information and Computation 100, 1-40 and 41-77.
16. Nordstrom, B., K. Petersson, and J. M. Smith (1990). Programming in Martin-Lof's Type Theory. Clarendon Press, Oxford.
17. Owens, C. (1995, September). Coding binding and substitution explicitly in Isabelle. In L. C. Paulson (Ed.), Proceedings of the First Isabelle Users Workshop. Available as Technical Report 379, University of Cambridge Computer Laboratory.
18. Paulson, L. C. (1994). Isabelle: A Generic Theorem Prover, Volume 828 of Lecture Notes in Computer Science. Springer-Verlag.
19. Pfenning, F. and C. Elliott (1988, June). Higher-order abstract syntax. In Proceedings of the ACM SIGPLAN '88 Symposium on Language Design and Implementation, pp. 199-208.
20. Pollack, R. (1994). The Theory of LEGO. Ph. D. thesis, University of Edinburgh.
21. Stoughton, A. (1988). Substitution revisited. Theoretical Computer Science 59, 317-325.
22. Talcott, C. L. (1993). A theory of binding structures and applications to rewriting. Theoretical Computer Science 112, 99-143.