Compilation of Extended Recursion in Call-by-Value Functional Languages

Tom Hirschowitz, Xavier Leroy, J. B. Wells

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 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 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.

Original languageEnglish
Title of host publicationProceedings of the Fifth ACM SIGPLAN Conference on Principle and Practice of Declarative Programming, (PPDP 03)
Pages160-171
Number of pages12
Volume5
Publication statusPublished - 2003
Event2003 ACM SIGPLAN Workshop on Erlang - Uppsala, Sweden
Duration: 29 Aug 200329 Aug 2003

Conference

Conference2003 ACM SIGPLAN Workshop on Erlang
Abbreviated titleERLANG '03
CountrySweden
CityUppsala
Period29/08/0329/08/03

Keywords

  • Compilation
  • Functional languages
  • Recursion
  • Semantics

Cite this