Residual Theory in Calculus: A Formal Development

Journal of Functional Programming

Volumn 4, Issue 3, 1994, Pages 371-394

  Huet, Gerard ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84972270504     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796800001106     Document Type: Article

References (18)

1. 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.
2. Berardi, S. (1991) Girard's normalization proof in LEGO. Unpublished draft note.
3. Barendregt, H. (1984) The Lambda-calculus: Its Syntax and Semantics. North-Holland.
4. Barendregt, H. (1992) Lambda-calculus with types. In: Handbook of Logic in Computer Science, Vol. II S. Abramsky, D. Gabbay and T. Maibaum (eds.), pp. 117–309. Oxford University Press.
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. Indag.Math. 34 (5), 381–392
6. Coquand, C. (1992) A proof of normalization for simply typed lambda calculus written in ALF. Proceedings Workshop on Types for Proofs and Programs, B. Nordstrom, K. Petersson and G. Plotkin (eds.). (Available by anonymous ftp from animal.cs.chalmers.se.)
7. 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, December.
8. Farmer, W.M., Guttman, J.D. and Thayer, F.J. (1991) IMPS: an Interactive Mathematical Proof System. Technical Report M90-19, MITRE Corporation.
9. Huet, G. (1988.) Initiation a la calculabilite. Notes de Cours, DEA Universite Paris 7, January.
10. Huet, G. (1992a) Constructive Computation Theory, Part I. Course Notes, DEA Informatique, Mathematiques et Applications, Paris, October.
11. Huet, G. (1992b) The Gallina specification language: A case study. Proceedings 12th FST/TCS Conference, New Delhi, India.R. Shyamasundar (ed.), pp. 229–240. Springer-Verlag LNCS 652.
12. Levy, J.J. (1978) Reductions correctes et optimales dans le X-calcul. These d’Etat, U. Paris VII.
13. McKinna, J. and Pollack, R. (1993) Pure type systems formalized. Proceedings International Conference on Typed Lambda Calculi and Applications, TLCA ’93, Utrecht, Netherlands, March.
14. Narayana, A. (1991) Proof of Church—Rosser Theorem in Calculus of Constructions. MS thesis, IIT Kanpur, India, April.
15. Paulin-Mohring, C. (1993) Inductive definitions in the system Coq: Rules and properties. In: M. Bezem and J.F. Groot (eds.), Proceedings International Conference on Typed Lambda Calculi and Applications, pp. 328–345, Springer-Verlag LNCS 664, April.
16. 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, September.
17. Rudnicki, P. (1992) An overview of the MIZAR project. Proceedings Workshop on Types for Proofs and Programs, B. Nordstrom, K. Petersson and G. Plotkin (eds.). (Available by anonymous ftp from animal.cs.chalmers.se.)
18. Shankar, N. (1985) A Mechanical Proof of the Church-Rosser Theorem. Technical Report 45, Institute for Computing Science, the University of Texas at Austin, March.