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

Tom Hirschowitz 1 Xavier Leroy 1, * J. B. Wells
* Corresponding author
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 standard call-by-value recursive definitions. 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 faithful.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00310121
Contributor : Tom Hirschowitz <>
Submitted on : Friday, August 8, 2008 - 8:59:31 AM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on : Thursday, June 3, 2010 - 6:04:35 PM

File

compil-recursion.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

Tom Hirschowitz, Xavier Leroy, J. B. Wells. Compilation of extended recursion in call-by-value functional languages. PPDP '03, 2003, Uppsala, Sweden. pp.160--171, ⟨10.1145/888251.888267⟩. ⟨hal-00310121⟩

Share

Metrics

Record views

244

Files downloads

210