A formalised first-order confluence proof for the λ-calculus using one-sorted variable names

Information and Computation

Volumn 183, Issue 2, 2003, Pages 212-244

  Vestergaard, René ^a   Brotherston, James ^b  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Barendregt's variable convention; Confluence; Structural induction and recursion; Theorem proving; calculus

Indexed keywords

AUTOMATA THEORY; EQUIVALENCE CLASSES; PROBLEM SOLVING; RECURSIVE FUNCTIONS;

BARENDREGT VARIABLE CONVENTION; CONFLUENCE;

THEOREM PROVING;

EID: 0038746768     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00023-3     Document Type: Article

References (42)

1. H. Barendregt, The Lambda Calculus - Its Syntax and Semantics (Revised Edition), North-Holland, Amsterdam, 1984.
2. J. Brotherston, Formalizing proofs in Isabelle/HOL of equational properties for the λ-calculus using one-sorted variable names, Honours Dissertation, University of Edinburgh; available from the author's homepage, 2001.
3. R. Burstall, Proving properties of programs by structural induction, Comput. J. 12 (1967).
4. A. Church, J.B. Rosser, Some properties of conversion, Trans. Am. Math. Soc. 39 (1936).
5. H.B. Curry, R. Feys, Combinatory Logic, North-Holland, Amsterdam, 1958.
6. N.G. de Bruijn, λ Calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem, Indag. Math. 34 (1972) 381-392.
7. J. Despeyroux, A. Hirschowitz, Higher-order abstract syntax with induction in Coq, In: F. Pfenning (Ed.), Proceedings of LPAR-5, LNAI, vol. 822, Springer, Berlin, 1994.
8. J. Despeyroux, F. Pfenning, C. Schürmann, Primitive recursion for higher-order abstract syntax, in: P. De Groote, J. Roger Hindley (Eds.), Proceedings of TLCA-3, LNCS, vol. 1210, Springer, Berlin, 1997.
9. M. Fiore, G. Plotkin, G. Turi, Abstract syntax and variable binding, in: Longo [27], pp. 193-202.
10. J. Ford, I. Mason, Operational techniques in PVS-a preliminary evaluation, in: C. Fidge (Ed.), Proceedings of CATS-7, Electronic Notes in Theoretical Computer Science, vol. 42, Elsevier, Amsterdam, 2001.
11. M.J. Gabbay, A.M. Pitts, A new approach to abstract syntax with variable binding, Formal Aspects of Computing, Special issue in honour of Rod Burstall 13 (2001) 341-363.
12. M.J. Gabbay, A.M. Pitts, A new approach to abstract syntax involving binders, in: Longo [27], pp. 214-224.
13. J.-Y. Girard, Locus solum: from the rules of logic to the logic of rules, MSCS 11 (2001).
14. A.D. Gordon, T. Melham, Five axioms of α-conversion, in: J. Von Wright, J. Grundy, J. Harrison (Eds.), Proceedings of TPHOL-9, LNCS, vol. 1125, Springer, Berlin, 1996.
15. A. Gordon, A mechanisation of name-carrying syntax up to α-conversion, in: J. Joyce, C.-J. Seger (Eds.), Proceedings of TPHOL/HUG-6, LNCS, vol. 780, Springer, Berlin, 1993.
16. D. Hilbert, W. Ackermann, Principles of Mathematical Logic, Chelsea Publishing Company, 1950; AMS, 1999, English translationo of the 2nd ed., 1938 of [16].
17. J. Roger Hindley, The Church-Rosser property and a result in combinatory logic, Ph.D. Thesis, University of Newcastle upon Tyne, 1964.
18. M. Hofmann, Semantical analysis of higher-order abstract syntax, in: Longo [27], pp. 204-213.
19. P. Homeier, A proof of the Church-Rosser theorem for the λ calculus in higher order logic, Category B paper at TPHOL-14, 2001.
20. G. Huet, Residual theory in λ-calculus: A formal development, J. Funct. Program. 4 (3) (1994) 371-394.
21. J.-P. Jouannaud, H. Kirchner, Completion of a set of rules modulo a set of equations, SIAM 15 (1986) 1155-1194.
22. J.W. Klop, Combinatory Reduction Systems, Mathematical Centre Tracts 127, Mathematisch Centrum, Amsterdam, 1980.
23. J.-L. Krivine, Lambda-Calculus, Types and Models, Ellis Horwood Series in Computers and Their Applications, Masson, Paris, and Ellis Horwood, Hemel Hempstead, 1993, Translation from French ([24]) by René Cori.
24. J.-J. Lévy, An algebraic interpretation of the λβκ-calculus; and an application of a labelled λ-calculus, Theoret. Comput. Sci. 2 (1) (1976) 97-114.
25. J. McKinna, R. Pollack, Some λ calculus and type theory formalized, J. Automat. Reason. 23 (3-4) (1999).
26. P.-A. Melliès, Axiomatic rewriting theory I, II, III, IV, V, VI, VII, JCL 10(3)-2000, CTCS'97, LICS'98, RTA13, in preparation.
27. T. Nipkow, More Church-Rosser proofs (in Isabelle/HOL), J. Automat. Reason. 26 (2001) 51-66.
28. E. Ohlebusch, Church-Rosser theorems for abstract reduction modulo an equivalence relation, in: Proceedings of RTA-9, LNCS, vol. 1379, Springer, Berlin, 1998.
29. F. Pfenning, A proof of the Church-Rosser theorem and its representation in a logical framework, Technical Report CMU-CS-92-186, Carnegie Mellon University, Pittsburgh, Pennsylvania, September 1992.
30. F. Pfenning, C. Schürmann, System description: Twelf-a meta-logical framework for deductive systems, in: H. Ganzinger (Ed.), Proceedings of CADE-16, LNAI, vol. 1632, Springer, Berlin, 1999.
31. K. Rose, Explicit substitutions-tutorial and survey, Technical Report LS-96-13, BRICS, Aarhus University, Denmark, September 1996.
32. J.J.M.M. Rutten, A calculus of transition systems (towards universal coalgebra), Technical Report CS-R9503, CWI - Centrum voor Wiskunde en Informatica, January 13, 1995.
33. D.E. Schroer, The Church-Rosser theorem, Ph.D. Thesis, Cornell, June 1965.
34. C. Schürmann, Automating the meta theory of deductive systems, Ph.D. Thesis, Carnegie Mellon University, 2000.
35. N. Shankar, A mechanical proof of the Church-Rosser theorem, J. ACM 35 (3) (1988) 475-522.
36. A. Stoughton, Substitution revisited, Theoret. Comput. Sci. 59 (3) (1988) 317-325.
37. M. Takahashi, Parallel reductions in λ-calculus, Inform. Comput. 118 (1995) 120-127.
38. V. van Oostrom, Advanced orthogonality, in: Term Rewriting Systems, Terese, Cambridge University Press, 2003.
39. R. Vestergaard, The primitive proof theory of the λ-calculus, Ph.D. Thesis, Heriot-Watt University, 2003.
40. R. Vestergaard, J. Brotherston, A formalised first-order confluence proof for the λ-calculus using one-sorted variable names (Barendregt was right after all ... almost), Springer, Berlin, Proceedings of RTA-12, LNCS, vol. 2051, in: A. Middeldorp (Ed.), 2001.
41. R. Vestergaard, J. Brotherston, The mechanisation of Barendregt-style equational proofs (the residual perspective), Electron. Notes Theoret. Comput. Sci. 58 (1) (2001).
42. J. Wells, R. Vestergaard, Equational reasoning for linking with first-class primitive modules, in: G. Smolka (Ed.), Proceedings of ESOP-9, LNCS, vol. 1782, 2000.