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

Tom Hirschowitz, Xavier Leroy, J. B. Wells

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


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
Issue number1
Publication statusPublished - Mar 2009


  • Compilation
  • Functional languages
  • Recursion
  • Semantics


Dive into the research topics of 'Compilation of extended recursion in call-by-value functional languages'. Together they form a unique fingerprint.

Cite this