Functional back-ends within the lambda-sigma calculus

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 31, Issue 6, 1996, Pages 25-33

  Hardin, Thérèse ^a,b   Maranget, Luc ^b   Pagano, Bruno ^a,b  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17144412215     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/232629.232632     Document Type: Article

References (25)

1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy, "Explicit Substitutions", POPL'90.
2. A. W. Appel, "Compiling with Continuations", Cambridge University Press, 1992.
3. Z. Ariola, M. Feleisen. J. Maraist, M. Odersky, and P. Wadler, "A call-by-need lambda-calculus". POPL'95.
4. A. Asperti, "A Categorical Understanding of Environment Machines", JFP, 2(1), 1992.
5. L. Augustsson, "A Compiler For Lazy ML", LFP'84.
6. L. Cardelli, "Compiling a Functional Language", LFP'84.
7. G. Cousineau, P.-L. Curien and M. Mauny, "The Categorical Abstract Machine", FPCA'85.
8. P. Crégut, "An Abstract Machine for the Normalization of Lambda-terms", LFP'90.
9. P.-L. Curien, "An Abstract Framework for Environment Machines", TCS. 82, 1991.
10. P.-L. Curien, T. Hardin and J.-J. Levy, "Confluence Properties of Weak and Strong Calculi of Explict Substitutions", INRIA Research Report No 1617, 1992. Also to appear in JACM in april 1996.
11. P.-L. Curien, T. Hardin and J.-J. Levy, "Confluence Properties of Weak and Strong Calculi of Explict Substitutions", INRIA Research Report No 1617, 1992. Also to appear in JACM in april 1996.
12. R. Douence and P. Fradet, "Towards a Taxonomy of Functional Language Implementations". PILP'95.
13. G. Dowek, T. Hardin and C. Kirchner, "Higher-Order Unification via explicit Substitutions", LICS'95.
14. J. Fairbairn and S. Wray, "Tim: A Simple, Lazy Abstract Machine to Execute Supercombinators", FPCA'87.
15. J. Hannan, D. Miller, "From Operational Semantics to Abstract Machines", Journal of Mathematical Structures in Computer Science , 2(4):415-459, 1992
16. H. Herbelin, "A λ-Calculus Structure Isomorphic to Sequent Calculus Structure", CSL'94.
17. P. J. Landin, "The Mechanical Evaluation of Expressions", Computer Journal, Vol 6, No 4, 1964.
18. J. Launchbury, "A Natural Semantics for Lazy Evaluation", POPL'93.
19. X. Leroy, "The ZINC Experiment: An Economical Implementation of the ML Language", INRIA Technical Report 117, 1990.
20. P. Lescanne, "From λσ to λσ: a Journey through Calculi of Explicit Substitutions", POPL'94.
21. L. Maranget, "Optimal derivation in Orthogonal Rewriting Systems and in Weak Lambda Calculi", POPL'91.
22. B. Pagano, "Bi-simulation de machines abstraites en lambda-sigma-calcul", Journées Francophone des Langages Applicatifs 1995, INRIA Éditions (In french).
23. G.D. Plotkin, "LCF Considered as a Programming Language". TCS, 5:225-255, 1977.
24. S. L. Peyton Jones, "The implementation of Functional Programming Languages", Prentice-Hall, 1987.
25. M. Rittri, "Proving the Correctness of a Virtual Machine by a Bisimulation", Phd thesis, University of Göteborg and Chalmers University of Technology, 1988.