Hostname: page-component-8448b6f56d-m8qmq Total loading time: 0 Render date: 2024-04-24T20:53:28.212Z Has data issue: false hasContentIssue false
  • English
  • Français

Residual theory in λ-calculus: a formal development*

Published online by Cambridge University Press:  07 November 2008

Gérard Huet
Gérard Huet
Affiliation:
INRIA Rocquencourt, B.P. 105-78153 Le Chesnay Cedex, France
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We present the complete development, in Gallina, of the residual theory of β-reduction in pure λ-calculus. The main result is the Prism Theorem, and its corollary Lévy's Cube Lemma, a strong form of the parallel-moves lemma, itself a key step towards the confluence theorem and its usual corollaries (Church-Rosser, uniqueness of normal forms). Gallina is the specification language of the Coq Proof Assistant (Dowek et al., 1991; Huet 1992b). It is a specific concrete syntax for its abstract framework, the Calculus of Inductive Constructions (Paulin-Mohring, 1993). It may be thought of as a smooth mixture of higher-order predicate calculus with recursive definitions, inductively defined data types and inductive predicate definitions reminiscent of logic programming. The development presented here was fully checked in the current distribution version Coq V5.8. We just state the lemmas in the order in which they are proved, omitting the proof justifications. The full transcript is available as a standard library in the distribution of Coq.

Type
Research Article
Information
Journal of Functional Programming , Volume 4 , Issue 3 , July 1994 , pp. 371 - 394
Copyright
Copyright © Cambridge University Press 1994

References

Altenkirch, T. (1993) A formalisation of the strong normalization proof for System F in LEGO. Proceedings of the International Conference on Typed Lambda Calculi and Applications, TLCA '93,Utrecht,Netherlands,March.Google Scholar
Berardi, S. (1991) Girard's normalization proof in LEGO. Unpublished draft note.Google Scholar
Barendregt, H. (1984) The Lambda-calculus: Its Syntax and Semantics. North-Holland.Google Scholar
Barendregt, H. (1992) Lambda-calculus with types. In: Handbook of Logic in Computer Science, Vol. II, Abramsky, S.Gabbay, D. and T., Maibaum (eds.), pp. 117–309. Oxford University Press.Google Scholar
de Bruijn, N.G. (1972) Lambda-Calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indag. Math. 34 (5), 381–392.CrossRefGoogle Scholar
Coquand, C. (1992) A proof of normalization for simply typed lambda calculus written in ALF. Proceedings Workshop on Types for Proofs and Programs, Nordström, B.K., Petersson and G., Plotkin (eds.). (Available by anonymous ftp from animal.cs.chalmers.se.)Google Scholar
Dowek, G., Felty, A., Herbelin, H., Huet, G., Paulin, C. and Werner, B. (1991) The Coq Proof Assistant User's Guide Version 5.6. INRIA Technical Report 134, 12.Google Scholar
Farmer, W.M., Guttman, J.D. and Thayer, F.J. (1991) IMPS: an Interactive Mathematical Proof System. Technical Report M90-19, MITRE Corporation.CrossRefGoogle Scholar
Huet, G. (1988) Initiation á la calculabilité. Notes de Cours, DEA Université Paris 7, 01.Google Scholar
Huet, G. (1992a) Constructive Computation Theory, Part I. Course Notes, DEA Informatique, Mathématiques et Applications, Paris, 10.Google Scholar
Huet, G. (1992b) The Gallina specification language: A case study. Proceedings 12th FST/TCS Conference,New Delhi, India.Shyamasundar, R. (ed.), pp. 229–240. Springer-Verlag LNCS 652.CrossRefGoogle Scholar
Lévy, J. J. (1978) Réductions correctes et optimales dans le λ-calcul. Thèse d'Etat U. Paris VII.Google Scholar
McKinna, J. and Pollack, R. (1993) Pure type systems formalized. Proceedings International Conference on Typed Lambda Calculi and Applications, TLCA 1993,Utrecht,Netherlands,March.Google Scholar
Narayana, A. (1991) Proof of Church-Rosser Theorem in Calculus of Constructions. MS thesis, IIT Kanpur, India, 04.Google Scholar
Paulin-Mohring, C. (1993) Inductive definitions in the system Coq: Rules and properties. In: Bezem, M. and Groot, J. F. (eds.), Proceedings International Conference on Typed Lambda Calculi and Applications, pp. 328–345, Springer-Verlag LNCS 664,April.CrossRefGoogle Scholar
Pfenning, F. (1992) A Proof of the Church-Rosser Theorem and its Representation in a Logical Framework. Technical Report CMU-CS-92-186, Carnegie Mellon University, 09.Google Scholar
Rudnicki, P. (1992) An overview of the MIZAR project. Proceedings Workshop on Types for Proofs and Programs, Nordström, B.Petersson, K. and Plotkin, G. (eds.). (Available by anonymous ftp from animal.cs.chalmers.se.)Google Scholar
Shankar, N. (1985) A Mechanical Proof of the Church-Rosser Theorem. Technical Report 45, Institute for Computing Science, the University of Texas at Austin, 03.Google Scholar
Submit a response

Discussions

No Discussions have been published for this article.