Compilation of extended recursion in call-by-value functional languages - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Higher-Order and Symbolic Computation Année : 2009

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

Résumé

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.
Fichier principal
Vignette du fichier
letrec.pdf (470.75 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00359213 , version 1 (06-02-2009)

Identifiants

Citer

Tom Hirschowitz, Xavier Leroy, J. B. Wells. Compilation of extended recursion in call-by-value functional languages. Higher-Order and Symbolic Computation, 2009, 22 (1), pp.3-66. ⟨10.1007/s10990-009-9042-z⟩. ⟨hal-00359213⟩
200 Consultations
209 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More