Explicit substitutions

Journal of Functional Programming

Volumn 1, Issue 4, 1991, Pages 375-416

  Levy J J ^a  

^a HEWLETT PACKARD COMPANY   (United States)

^b ECOLE NORMALE SUPÉRIEURE   (France)

^c INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84974356026     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796800000186     Document Type: Article

References (18)

1. Barendregt, H. P. 1985. The Lambda Calculus: Its Syntax and Semantics. North Holland.
2. De Bruijn, N. 1972. Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation. Indag. Mat. 34: 381–92.
3. Cardelli, L. 1989. Typeful Programming, SRC Report No. 45. Digital Equipment Corporation.
4. Curien, P.-L. 1986. Categorical Combinators, Sequential Algorithms and Functional Programming. Pitman.
5. Curien, P.-L. 1988. The λp-calculi: an Abstract Framework for Closures, unpublished (preliminary version printed as LIENS report).
6. Curien, P.-L., Hardin, T. and Lévy, J.-J. 1991a. Confluence properties of weak and strong calculi of explicit substitutions (draft).
7. Curien, P.-L., Hardin, T. and Ríos, A. 1991b. Normalisation forte des substitutions (draft).
8. Curien, P.-L. and Ríos, A. 1991. Un Résultat de Complétude pour les Substitutions Explicites.
9. Comptes Rendus de l'Académie des Sciences de Paris, t. 312, Série I, pp. 471–76.
10. Curry, H. P. and Feys, R. 1958. Combinatory Logic, vol. 1. North Holland.
11. Field, J. 1990. On laziness and optimality in lambda interpreters: tools for specification and analysis. In 17th Annual ACM Symposium on Principles of Programming Languages, San Francisco, USA, January, pp. 1–15.
12. Hardin, T. 1989. Confluence results for the pure strong categorical combinatory logic CCL: λ-calculi as subsystems of CCL, Theor. Comput. Sci. 65: 291–342.
13. Hardin, T. and Laville, A. 1986. Proof of termination of rewriting system SUBST on CCL. Theor. Comput. Sci. 46: 305–12.
14. Hardin, T. and Lévy, J.-J. 1989. A confluent calculus of substitutions. In France-Japan Artificial Intelligence and Computer Science Symposium, Izu, Japan, December.
15. Huet, G. and Oppen, D. C. 1980. Equations and rewrite rules: a survey. In R. Book (editor), Formal Languages Theory: Perspectives and Open Problems, pp. 349–93. Academic Press.
16. Klop, J. W. 1980. Combinatory Reduction Systems. Mathematical Center Tracts 129, Amsterdam.
17. Martin-Löf, P. 1984. Intuitionistic Type Theory, notes by G. Sambin of a series of lectures given in Padova in 1980. Bibliopolis.
18. Wadsworth, C. P. 1971. Semantics and Pragmatics of the Lambda Calculus, Dissertation, Oxford University.