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 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.
Domaines
| Origine | Fichiers éditeurs autorisés sur une archive ouverte |
|---|---|
| Licence |
Loading...