Closed reduction: Explicit substitutions without α-conversion

Mathematical Structures in Computer Science

Volumn 15, Issue 2, 2005, Pages 343-381

  Fernandez M ^a   Mackie, I ^a   Sinot, F R ^a,b  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750290549     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129504004633     Document Type: Article

References (24)

1. Abadi, M., Cardelli, L., Curien, P.-L. and Levy, J.-J. (1991) Explicit substitutions. Journal of Functional Programming 1 (4) 375-416.
2. Abramsky, S. (1993) Computational Interpretations of Linear Logic. Theoretical Computer Science 111 3-57.
3. Ariola, Z.M., Felleisen, M., Maraist, J., Odersky, M. and Wadler, P. (1995) A call-by-need lambda calculus. In: Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL'95), ACM Press 233-246.
4. Asperti, A., Giovannetti, C. and Naletto, A. (1996) The Bologna Optimal Higher-order Machine. Journal of Functional Programming 6 (6) 763-810.
5. Barendregt, H. P. (1984) The Lambda Calculus: Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics 103, North-Holland Publishing Company, second, revised edition.
6. Barendregt, H.P. (1992) Lambda calculi with types. In: Abramsky, S., Gabbay, D. and Maibaum, T. S. E. (eds.) Handbook of Logic in Computer Science, Oxford University Press 2 (2) 117-309.
7. Çaǧman, N. and Hindley, J. R. (1998) Combinatory weak reduction in lambda calculus. Theoretical Computer Science 198 (1-2) 239-249.
8. David, R. and Guillaume, B. (2001) A λ-calculus with explicit weakening and explicit substitution. Mathematical Structure in Computer Science 11 (1) 169-206.
9. de Bruijn, N.G. (1972) Lambda calculus notation with nameless dummies. Indagationes Mathematicae 34 381-392.
10. Dowek, G., Hardin, T. and Kirchner, C. (2001) HOL-λσ: an intentional first-order expression of higher-order logic. Mathematical Structures in Computer Science 11 (1) 21-45.
11. Fernández, M. and Mackie, I. (1999) Closed reduction in the λ-calculus. In: Flum, J. and Rodriguez-Artalejo, M. (eds.) Proceedings of Computer Science Logic (CSL'99). Springer-Verlag Lecture Notes in Computer Science 1683 220-234.
12. Girard, J.-Y. (1989) Geometry of interaction 1: Interpretation of System F. In: Ferro, R., Bonotto, C., Valentini, S. and Zanardo, A. (eds.) Logic Colloquium 88. Studies in Logic and the Foundations of Mathematics, North Holland 127 221-260.
13. Hardin, T., Maranget, L. and Pagano, B. (1998) Functional runtime systems within the lambda-sigma calculus. Journal of Functional Programming 8 (2) 131-176.
14. Klop, J.-W. (1980) Combinatory Reduction Systems. Mathematical Centre Tracts 127, Mathematischen Centrum, 413 Kruislaan, Amsterdam.
15. Lescanne, P. and Rouyer-Degli, J. (1995) The calculus of explicit substitutions lambda-upsilon. Technical Report RR-2222, INRIA.
16. Melliès, P.-A. (1995) Typed lambda-calculi with explicit substitutions may not terminate. In: Proceedings of the Second International Conference on Typed Lambda Calculi and Applications. Springer-Verlag Lecture Notes in Computer Science 902 328-334.
17. Muñoz, C. (1996) Confluence and preservation of strong normalisation in an explicit substitutions calculus (extended abstract). In: Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science (LICS'96), IEEE Computer Society Press.
18. Nadathur, G. (1999) A fine-grained notation for lambda terms and its use in intensional operations. Journal of Functional and Logic Programming 1999 (2).
19. Newman, M. (1942) On theories with a combinatorial definition of "equivalence". Annals of Mathematics 43 (2) 223-243.
20. Plotkin, G. (1977) LCF considered as a programming language. Theoretical Computer Science 5 (3) 223-256.
21. Rose, K. (1996) Explicit substitution - tutorial and survey. Lecture Series LS-96-3, BRICS, Dept. of Computer Science, University of Aarhus, Denmark.
22. Rosen, B. (1973) Tree-manipulating systems and Church-Rosser theorems. Journal of the ACM 20 (1) 160-187.
23. Sinot, F.-R., Fernández, M. and Mackie, I. (2003) Efficient reductions with director strings. In: Nieuwenhuis, R. (ed.) Proceedings of Rewriting Techniques and Applications (RTA'03). Springer-Verlag Lecture Notes in Computer Science 2706 46-60.
24. Yoshida, N. (1994) Optimal reduction in weak lambda-calculus with shared environments. Journal of Computer Software 11 (6) 3-18.