λ-calculi with explicit substitutions and composition which preserve β-strong normalization

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

Volumn 1139, Issue , 1996, Pages 284-298

  Ferreira, Maria C F ^a   Kesner, Delia ^b   Puel, Laurence ^b  

^a UNIVERSIDADE NOVA DE LISBOA   (Portugal)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BIOMINERALIZATION; COMPUTER CIRCUITS; LOGIC PROGRAMMING; PATHOLOGY; RECONFIGURABLE HARDWARE;

ABSTRACT SIMULATION; COMPOSITION OPERATORS; EXPLICIT SUBSTITUTIONS; LAMBDA-CALCULI; STRONG NORMALIZATION;

CALCULATIONS;

EID: 17044403998     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61735-3_19     Document Type: Conference Paper

References (18)

1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. Journal of Functional Programming, 4(1):375-416, 1991.
2. Z.-EI-A. Benaissa, D. Briaud, P. Lescanne, and J. Rouyer-Degli., λv, a calculus of explicit substitutions which preserves strong normalisation, 1995. Available from http://www.loria.fr/lescanne/publications.html.
3. P.-L. Curien, T. Hardin, and J.-J. Lévy. Confluence properties of weak and strong calculi of explicit substitutions. Technical Report 1617, INRIA Rocquencourt, 1992.
4. P.-L. Curien, T. Hardin, and A. Ríos. Strong normalisation of substitutions. In MFC5’92, number 629 in LNCS, pages 209-218, 1992.
5. N. de Bruijn. Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indag. Mat., 5(35):381-392, 1972.
6. N. de Bruijn. Lambda-calculus notation with namefree formulas involving symbols that represent reference transforming mappings. Indag. Mat., (40):384-356, 1978.
7. T. Ehrhard. Une sémantique catégorique des types dépendants. Application au calcuf des constructions. Thèse de doctorat, Université de Paris VII, 1988.
8. M. C. F. Ferreira, D. Kesner and L. Puel. λ-calculi with explicit substitutions and composition which preserve β-strong normalization, 1996. Available via ftpatftp.lri.fr/LRI/articles/kesner/psn.ps.gz.
9. T. Hardin and J.-J. Lévy. A confluent calculus of substitutions. In France-Japan Artificial Intelligence and Computer Science Symposium, 1989.
10. D. Kesner. Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions, in Proc. of the Seventh Int. Conf. RTA, 1996. To appear.
11. e-calculus via a generalized interpretation method. Technical report TR-1996-19, Dep. of Computing Science, University of Glasgow, 1996.
12. F. Kamareddine and A. Ríos. A λ-calculus à de Bruijn with explicit substitutions. In Proc. of the Int. Symposium on Programming Language Implementation and Logic P rogramming, number 982 in LNCS. Springer-Vedag, 1995.
13. P. Lescanne. Personal Communication. 1996.
14. v, a journey through calculi of explicit substitutions. In Ann. ACM Syrup. POPL, pages 60-69. ACM, 1994.
15. P.-A. Mellies. Four typed-lambda calculi with explicit substitutions may not terminate: the first examples, 1994. Draft.
16. P.-A. Mellies. Typed λ-calculi with explicit substitutions may not terminate. In M. Dezani-Ciancaglini and G. Plotkin, editors, Proc. of Int. Conf. TLCA, number 902 in LNCS, April 1995.
17. C. Muñoz. Confluence and preservation of strong normalisation in an explicit substitutions calculus. In Proc. of the Symposium LICS, 1996 To appear.
18. A. Ríos. Contribution à l’étude des λ-calculus avec substitutions explicites. Thèse de doctorat, Université de Paris VII, 1993