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

Tom Hirschowitz; Xavier Leroy; J. B. Wells

doi:10.1007/s10990-009-9042-z

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

Tom Hirschowitz, Xavier Leroy, J. B. Wells

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

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. © 2009 Springer Science+Business Media, LLC.

Original language	English
Pages (from-to)	3-66
Number of pages	64
Journal	Higher-Order and Symbolic Computation
Volume	22
Issue number	1
DOIs	https://doi.org/10.1007/s10990-009-9042-z
Publication status	Published - Mar 2009

Keywords

Compilation
Functional languages
Recursion
Semantics

Access to Document

10.1007/s10990-009-9042-z

Cite this

@article{69f9fe5ed3014e03ace8ac15eacb9e99,

title = "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. {\textcopyright} 2009 Springer Science+Business Media, LLC.",

keywords = "Compilation, Functional languages, Recursion, Semantics",

author = "Tom Hirschowitz and Xavier Leroy and Wells, {J. B.}",

year = "2009",

month = mar,

doi = "10.1007/s10990-009-9042-z",

language = "English",

volume = "22",

pages = "3--66",

journal = "Higher-Order and Symbolic Computation",

issn = "1388-3690",

publisher = "Springer",

number = "1",

}

TY - JOUR

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

AU - Hirschowitz, Tom

AU - Leroy, Xavier

AU - Wells, J. B.

PY - 2009/3

Y1 - 2009/3

N2 - 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. © 2009 Springer Science+Business Media, LLC.

AB - 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. © 2009 Springer Science+Business Media, LLC.

KW - Compilation

KW - Functional languages

KW - Recursion

KW - Semantics

UR - http://www.scopus.com/inward/record.url?scp=76749104250&partnerID=8YFLogxK

U2 - 10.1007/s10990-009-9042-z

DO - 10.1007/s10990-009-9042-z

M3 - Article

SN - 1388-3690

VL - 22

SP - 3

EP - 66

JO - Higher-Order and Symbolic Computation

JF - Higher-Order and Symbolic Computation

IS - 1

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this