Computer Science – Programming Languages
Scientific paper
2009-02-07
Higher-Order and Symbolic Computation 22, 1 (2009) 3-66
Computer Science
Programming Languages
62 pages, uses pic
Scientific paper
10.1007/s10990-009-9042-z
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.
Hirschowitz Tom
Leroy Xavier
Wells Bruce J.
No associations
LandOfFree
Compilation of extended recursion in call-by-value functional languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Compilation of extended recursion in call-by-value functional languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compilation of extended recursion in call-by-value functional languages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-312185