Closed reductions in the λ -calculus (Extended abstract)

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

Volumn 1683, Issue , 1999, Pages 220-234

  Fernandez, Maribel ^a   Mackie, Ian ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER CIRCUITS; DIFFERENTIATION (CALCULUS);

CALL-BY-NEED; EXPLICIT SUBSTITUTIONS; EXTENDED ABSTRACTS; INTERESTING POINTS; LAMBDA CALCULUS; WEAK FORM;

CALCULATIONS;

EID: 84890259203     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48168-0_16     Document Type: Conference Paper

References (13)

1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Levy. Explicit substitutions. Journal of Functional Programming, 1(4):375-416, 1991.
2. Z. M. Ariola, M. Felleisen, J. Maraist, M. Odersky, and P. Wadler. A call-by-need lambda calculus. In Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL'95), pages 233-246. ACM Press, 1995.
3. P.-L. Curien, T. Hardin, and J.-J. Levy. Confluence properties of weak and strong calculi of explicit substitutions. Journal ofthe ACM, 43(2):362-397, 1996.
4. J.-Y. Girard. Geometry of interaction 1: Interpretation of System F. In R. Ferro, C. Bonotto, S. Valentini, and A. Zanardo, eds, Logic Colloquium 88, Studies in Logic and the Foundations of Mathematics. North Holland Publishing Company, 1989.
5. T. Hardin, L. Maranget, and B. Pagano. Functional back-ends within the lambda-sigma calculus. Journal ofFunctional Programming, 8(2):131-172, 1998.
6. J. Kennaway and M. Sleep. Director strings as combinators. ACM Transactions on Programming Languages and Systems, 10:602-626, 1988.
7. P. Lescanne and J. Rouyer-Degli. The calculus of explicit substitutions lambdaupsilon. Technical Report RR-2222, INRIA, 1995.
8. I. Mackie. YALE: Yet another lambda evaluator based on interaction nets. In Proceedings of the 3rd ACM SIGPLAN International Conference on Functional Programming (ICFP'98), pages 117-128. ACM Press, 1998.
9. P.-A. Mellies. Typed lambda-calculi with explicit substitutions may not terminate. In Proceedings of the Second International Conference on Typed Lambda Calculi and Applications, number 902 in Lecture Notes in Computer Science, pages 328334. Springer-Verlag, 1995.
10. C. Munoz. 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, New Brunswick, New Jersey. IEEE Computer Society Press, 1996.
11. G. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5(3):223-256, 1977.
12. K. H. Rose. Explicit substitution - tutorial and survey. Lecture Series LS-96-3, BRICS, Dept. of Computer Science, University of Aarhus, Denmark, 1996.
13. N. Yoshida. Optimal reduction in weak lambda-calculus with shared environments. Journal of Computer Software, 11(6):3-18, 1994.