Compilation of Extended Recursion in Call-by-Value Functional Languages

Proceedings of the ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn 5, Issue , 2003, Pages 160-171

  Hirschowitz, Tom ^a   Leroy, Xavier ^a   Wells, J B ^b  

^a INRIA ROCQUENCOURT   (France)

^b HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

Compilation; Functional languages; Recursion; Semantics

Indexed keywords

CODES (SYMBOLS); FORMAL LOGIC; PROGRAM COMPILERS; SEMANTICS;

COMPILATION; FUNCTIONAL LANGUAGES; RECURSION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 1242287818     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/888251.888267     Document Type: Conference Paper

References (15)

1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. J. Func. Progr., 1(4):375-416, 1991.
2. Z. M. Ariola and S. Blom. Skew confluence and the lambda calculus with letrec. Annals of pure and applied logic, 117(1-3):95-178, 2002.
3. Z.-E.-A. Benaissa, P. Lescanne, and K. H. Rose. Modeling sharing and recursion for weak reduction strategies using explicit substitution. In Prog. Lang., Impl., Logics, and Programs, volume 1140 of LNCS, pages 393-407, 1996.
4. G. Boudol. The recursive record semantics of objects revisited. In D. Sands, editor, Europ. Symp. on Progr., volume 2028 of LNCS, pages 269-283. Springer-Verlag, 2001.
5. G. Boudol and P. Zimmer. Recursion in the call-by-value lambda-calculus. Fixed Points in Comp. Sc. 2002.
6. G. Cousineau, P.-L. Curien, and M. Mauny. The categorical abstract machine. Science of Computer Programming, 8(2):173-202, 1987.
7. The Haskell language. http://www.haskell.org.
8. T. Hirschowitz and X. Leroy. Mixin modules in a call-by-value setting. In D. Le Métayer, editor, Europ. Symp. on Progr., volume 2305 of LNCS, pages 6-20, 2002.
9. T. Hirschowitz, X. Leroy, and J. B. Wells. On the implementation of recursion in call-by-value functional languages. Research report RR-4728, INRIA, February 2003.
10. T. Hirschowitz, X. Leroy, and J. B. Wells. A reduction semantics for call-by-value mixin modules. Research report RR-4682, INRIA, January 2003.
11. X. Leroy, D. Doligez, J. Garrigue, D. Rémy, and J. Vouillon. The OCaml 3.06 reference manual, 2002. Available at http://caml.inria.fr/.
12. X. Leroy, D. Doligez, J. Garrigue, and J. Vouillon. The Objective Caml system. Software and documentation available on the Web, http://caml.inria.fr/, 1996-2003.
13. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (revised). The MIT Press, 1997.
14. K. H. Rose. Explicit cyclic substitutions. In M. Rusinowitch and J.-L. Rémy, editors, CTRS '92-3rd International Workshop on Conditional Term Rewriting Systems, volume 656 of LNCS, pages 36-50. Springer-Verlag, 1992.
15. O. Waddell, D. Sarkar, and R. K. Dybvig. Robust and effective transformation of letrec. In Electronic proceedings of the 2002 Scheme Workshop, 2002. http://scheme2002.ccs.neu.edu/.