Compilation of extended recursion in call-by-value functional languages
Programming Languages
2010-02-01 v1
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 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.
Keywords
Cite
@article{arxiv.0902.1257,
title = {Compilation of extended recursion in call-by-value functional languages},
author = {Tom Hirschowitz and Xavier Leroy and J. B. Wells},
journal= {arXiv preprint arXiv:0902.1257},
year = {2010}
}
Comments
62 pages, uses pic