Functional runtime systems within the lambda-sigma calculus

Journal of Functional Programming

Volumn 8, Issue 2, 1998, Pages 131-176

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

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032396220     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0956796898002986     Document Type: Article

References (25)

1. Abadi, M., Cardelli, L., Curien, P.-L. and Lévy, J.-J. (1996) Explicit substitutions. J. Functional Program. 6(2), 299-327.
2. Appel, A. W. (1992) Compiling with Continuations. Cambridge University Press.
3. Ariola, Z., Felleisen, M., Maraist, J., Odersky, M. and Wadler, P. (1995) The call-by-need lambda-calculus. 22nd Symposium on Principles of Programming Languages.
4. Asperti, A. (1992) A categorical understanding of environment machines.J. Functional Program. 2(1), 23-59.
5. Augustsson, L. (1984) A compiler for Lazy ML. 1984 Symposium on Lisp and Functional Programming.
6. Cardelli, L. (1984) Compiling a functional language. 1984 Symposium on Lisp and Functional Programming.
7. Cousineau, G., Curien, P.-L. and Mauny, M. (1985) The Categorical Abstract Machine. Functional Programming and Computer Architecture.
8. Crégut, P. (1990) An abstract machine for the normalization of lambda-terms. 1990 Symposium on Lisp and Functional Programming.
9. Curien, P.-L. (1991) An abstract framework for environment machines. Theor. Comput. Sci. 82(2), 389-402.
10. Curien, P.-L., Hardin, T. and Lévy, J.-J. (1996) Confluence properties of weak and strong calculi of explict substitutions. J. ACM, 43(2), 362-397.
11. Douence, R. and Fradet, P. (1995) Towards a taxonomy of functional language implementations. Symposium on Programming Languages Implementations and Logic Programming.
12. Dowek, G., Hardin, T. and Kirchner, C. (1995) Higher-order unification via explicit substitutions. IEEE Symposium on Logics in Computer Science. IEEE Press.
13. Fairbairn, J. and Wray, S. (1987) Tim: A simple, lazy abstract machine to execute supercombinators. Functional Programming and Computer Architecture: Lecture Notes in Computer Science 274. Springer-Verlag.
14. Hannan, J. and Miller, D. (1992) From operational semantics to abstract machines. J. Mathematical Structures in Comput. Sci., 2(4), 415-459.
15. Herbelin, H. (1994) A lambda-calculus structure isomorphic to sequent calculus structure. Computer Science and Logics: Lecture Notes in Computer Science 933. Springer-Verlag.
16. Landin, P. J. (1964) The mechanical evaluation of expressions. Computer J., 6(4), 308-320.
17. Launchbury, J. (1993) A natural semantics for lazy evaluation. 20th Symposium on Principles of Programming Languages.
18. Leroy, X. (1990) The ZINC Experiment: An Economical Implementation of the ML Language. Technical Report 117, INRIA, France.
19. Lescanne, P. (1994) From lambda-sigma to lambda-upsilon: a journey through calculi of explicit substitutions. 21st Symposium on Principles of Programming Languages.
20. Maranget, L. (1991) Optimal derivation in orthogonal rewriting systems and in weak lambda calculi. 18th Symposium on Principles of Programming Languages.
21. Minamide, Y., Morriset, G. and Harper, R. (1996) Typed closure conversion. 23rd Symposium on Principles of Programming Languages.
22. Pagano, B. (1996) Bi-simulation de machines abstraites en lambda-sigma-calcul. Technique et science informatique, 15(7), 953-975. (Éditions Hermès (In French).)
23. Plotkin, G. D. (1977) LCF Considered as a programming language. Theor. Comput. Sci., 5, 225-255.
24. Peyton Jones, S. L. (1987) The implementation of Functional Programming Languages. Prentice-Hall.
25. Rittri, M. (1988) Proving the Correctness of a Virtual Machine by a Bisimulation. PhD thesis, University of Göteborg and Chalmers University of Technology.