Typed λ-calculi with explicit substitutions may not terminate

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

Volumn 902, Issue , 1995, Pages 328-334

  Mellies, Paul André ^a,b,c  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b INRIA ROCQUENCOURT   (France)

^c FWI ^*  (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; PATHOLOGY;

EXPLICIT SUBSTITUTIONS; LAMBDA TERMS; LAMBDA-CALCULI;

BIOMINERALIZATION;

EID: 84947445610     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0014062     Document Type: Conference Paper

References (8)

1. CP. Wadsworth. Semantics and Pragmatics of the Lambda Calculus. PhD thesis, Oxford Universtity, 1971.
2. M. Abadi, L. Cardelli, P.-L. Curien, J-J. Levy, Explicit substitutions. Journal of Functionnal Programming, 1(4):375-416, 1991.
3. N. De Bruijn. Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation. Indag. Mat., 34:381-392, 1972.
4. T. Hardin A. Laville. Proof of termination of the rewriting system subst on cel. Theoretical Computer Science, 46:305-312, 1986.
5. P.-L. Curien, T. Hardin, A. Ríos. Strong normalization of substitutions. Lecture Notes in Computer Science, 629:209-217, 1992.
6. H. Zantema. Termination of term rewriting by interpretation. Lecture Notes in Computer Science, 656, 1993.
7. P. Lescanne J. Rouyer-Degli. The calculus of explicit substitutions λu. Submitted to the Journal of Functionnal Programming, 1993.
8. T. Hardin, J.-J. Lévy, A Confluent Calculus of Substitutions, France-Japan Artificial Intelligence and Computer Science Symposium, Izu, 1989.