Compilation of extended recursion in call-by-value functional languages

Abstract : This paper formalizes and proves correct a compilation scheme for mutually-recursive definitions in call-by-value functional languages. This scheme supports a wider range of recursive definitions than previous methods. We formalize our technique as a translation scheme to a lambda-calculus featuring in-place update of memory blocks, and prove the translation to be correct.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [32 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00359213
Contributor : Tom Hirschowitz <>
Submitted on : Friday, February 6, 2009 - 12:17:14 PM
Last modification on : Friday, May 25, 2018 - 12:02:07 PM
Document(s) archivé(s) le : Tuesday, June 8, 2010 - 9:58:21 PM

Files

letrec.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Tom Hirschowitz, Xavier Leroy, J. B. Wells. Compilation of extended recursion in call-by-value functional languages. Higher-Order and Symbolic Computation, Springer Verlag, 2009, 22 (1), pp.3-66. ⟨10.1007/s10990-009-9042-z⟩. ⟨hal-00359213⟩

Share

Metrics

Record views

426

Files downloads

325