More church-rosser proofs (in Isabelle/HOL)

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

Volumn 1104, Issue , 1996, Pages 733-747

  Nipkow, Tobias ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; CALCULATIONS; DIFFERENTIATION (CALCULUS); FORMAL LOGIC;

BETA-REDUCTION; CHURCH-ROSSER THEOREM; ETA-REDUCTION; GENERAL THEORY; HIGHER ORDER LOGIC; ISABELLE/HOL; THEOREM PROVERS; UNTYPED LAMBDA CALCULUS;

THEOREM PROVING;

EID: 84957702937     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61511-3_125     Document Type: Conference Paper

References (14)

1. H. P. Barendregt. The Lambda Calculus, its Syntax and Semantics. North Holland, 2nd edition, 1984.
2. D. Briaud. An explicit Eta rewrite rule. In M. Dezani-Ciancaglini and G. Plotkin, editors, Typed Lambda Calculi and Applications, volume 902 of Led. Notes in Comp. Set., pages 94-108. Springer-Verlag, 1995.
3. N. G. de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagationes Mathematicae, 34:381-392, 1972.
4. M. Gordon and T. Melham. Introduction to HOL: a theorem-proving environment for higher-order logic. Cambridge University Press, 1993.
5. T. Hardin. Eta-conversion for the language of explicit substitutions. In H. Kirchner and G. Levi, editors, Algebraic and Logic Programming, volume 632 of Lect. Notes in Comp. Sci., pages 306-321. Springer-Verlag, 1992.
6. G. Huet. Residual theory in λ-calculus: A formal development. J. Functional Programming, 4:371-394, 1994.
7. J. McKinna and R. Pollack. Pure type systems formalized. In M. Bezem and J. Groote, editors, Typed Lambda Calculi and Applications, volume 664 of Lect. Notes in Comp. Sci., pages 289-305. Springer-Verlag, 1993.
8. L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lect. Notes in Comp. Sci. Springer-Verlag, 1994.
9. F. Pfenning. A proof of the Church-Rosser theorem and its representation in a logical framework. J. Automated Reasoning, 1999 To appear.
10. R. Pollack. The Theory of LEGO: A Proof Checker for the Extended Calculus of Constructions. PhD thesis, University of Edinburgh, 1994.
11. R. Pollack. Polishing up the Tait-Martin-Löf proof of the Church-Rosser theorem. Unpublished manuscript, Jan, 1995.
12. O. Rasmussen. The Church-Rosser theorem in Isabelle: A proof porting experiment. Technical Report 364, University of Cambridge, Computer Laboratory, May 1995.
13. N. Shankar. Metamathematics, Machines, and Gödel's Proof. Cambridge University Press, 1994.
14. M. Takahashi. Parallel reductions in λ-calculus. Information and Computation, 118:120-127, 1995.