On π-conversion in the λ-cube and the combination with abbreviations

Annals of Pure and Applied Logic

Volumn 97, Issue 1-3, 1999, Pages 27-45

  Kamareddine, Fairouz ^a   Bloo, Roel ^b   Nederpelt, Rob ^b  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Normalisation; Subject reduction; Calculus; reduction

Indexed keywords

EID: 0033590741     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(98)00019-0     Document Type: Article

References (17)

1. Z.M. Ariola, M. Felleisen, J. Maraist, M. Odersky, P. Wadler, A call-by-need lambda calculus, in: Conf. Rec. 22nd Ann. ACM Symp. Principles Programming Languages, 1995.
2. H. Barendregt, Lambda Calculus: Its Syntax and Semantics, North-Holland, Amsterdam, 1984.
3. H. Barendregt, Lambda calculi with types, Handbook of Logic in Computer Science, II, Eds. S. Abramsky, D.M. Gabbay, T.S.E. Maibaum, Oxford University Press, Oxford, 1992, pp. 118-414.
4. Z. Benaissa, P. Lescanne, K. Rose, Modeling sharing and recursion for weak reduction strategies using explicit substitution, PLILP96, Lecture Notes in Computer Science, vol. 1140, Springer, Berlin, 1996.
5. R. Bloo, F. Kamareddine, R.P. Nederpelt, The Barendregt Cube with Definitions and Generalised Reduction, Inform, and Comput. 126 (2) (1996) 123-143.
6. R. Constable et al., Implementing Mathematics with the NUPRL Development System, Prentice-Hall, Englewood Cliffs, NJ, 1986.
7. G. Dowek, et al., The Coq Proof Assistant Version 5.6, Users Guide, rapport de recherche 134, INRIA, 1991.
8. H. Geuvers, A short and flexible proof of strong normalization for the calculus of constructions, in: P. Dybjer, B. Nordström, J. Smith (Eds.), Types for Proofs and Programs, International Workshop TYPES '94, Lecture Notes Computer Science, vol. 996, Springer, Berlin, 1995, pp. 14-38.
9. Z. Luo, R. Pollack, LEGO Proof Development System: User's Manual, Technical report ECS-LFCS-92-211, LFCS, University of Edinburgh, 1992.
10. F. Kamareddine, R.P. Nederpelt, Refining reduction in the λ-calculus, Functional Programming 5 (4) (1995) 637-651.
11. F. Kamareddine, R.P. Nederpelt, Canonical typing and π-conversion in the Barendregt cube, Functional Programming 6 (2) (1996) 245-267.
12. R.P. Nederpelt, J.H. Geuvers, R.C. De Vrijer (Eds.), Selected Papers on AUTOMATH, North-Holland, Amsterdam, 1994.
13. S. Peyton Jones, Compilation by transformation: A report from the trenches, in European Symposium on Programming (ESop'96), Lecture Notes in Computer Science, vol. 1058, Springer, Berlin, 1996.
14. S. Peyton Jones, E. Meijer, Henk: A typed intermediate language, Types In Compilations Workshop, 1997.
15. P. Severi, E. Poll, Pure type systems with definitions, Computing Science Note 93/24, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1993.
16. Z. Shao, A.W. Appel, A type-based compiler for standard ML, in: SIGPLAN Symp. on Programming Language Design and Implementation (PLDI'95), La Jolla, ACM, New York, 1995.
17. D. Tarditi, G. Morrisett, P. Cheng, C. Stone, R. Harper, P. Lee, TIL: A type-directed optimizing compiler for ML, in: SIGPLAN Symposium on Programming Language Design and Implementation (PLDI'96), Philadelphia, ACM, New York, 1996.