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

Tom Hirschowitz, Xavier Leroy, J. B. Wells

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)3-66
Number of pages64
JournalHigher-Order and Symbolic Computation
Volume22
Issue number1
DOIs
Publication statusPublished - Mar 2009

Fingerprint

Data storage equipment
Industry

Keywords

  • Compilation
  • Functional languages
  • Recursion
  • Semantics

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. {\circledC} 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 = "3",
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",

}

Compilation of extended recursion in call-by-value functional languages. / Hirschowitz, Tom; Leroy, Xavier; Wells, J. B.

In: Higher-Order and Symbolic Computation, Vol. 22, No. 1, 03.2009, p. 3-66.

Research output: Contribution to journalArticle

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

VL - 22

SP - 3

EP - 66

JO - Higher-Order and Symbolic Computation

JF - Higher-Order and Symbolic Computation

SN - 1388-3690

IS - 1

ER -