 |
|
|
|
| HAL: hal-00310121, version 1 |
| DOI: 10.1145/888251.888267 |
| Detailed view |  Export this paper |
|
|
| PPDP '03, Uppsala : Sweden (2003) |
|
|
|
|
| Compilation of extended recursion in call-by-value functional languages |
|
|
Tom Hirschowitz 1Xavier Leroy 1 |
|
|
| (2003) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | CRISTAL (INRIA Rocquencourt) |
|
|
|
INRIA |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Programming Languages |
|
|
| Functional programming – letrec – compilation |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00310121, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00310121 | |
| oai:hal.archives-ouvertes.fr:hal-00310121 | |
| From: Tom Hirschowitz | |
| Submitted on: Friday, 8 August 2008 08:59:31 | |
| Updated on: Wednesday, 20 January 2010 11:31:54 | |
