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

Authors:
Tom Hirschowitz;Xavier Leroy;J. B. Wells
Affiliations:
Department of Mathematics, University of Savoie, Le Bourget-du-Lac, France 73376;INRIA Paris-Rocquencourt, Le Chesnay, France 78153;School of Mathematical and Computer Sciences, Heriot-Watt University, Edinburgh, UK EH14 4AS
Venue:
Higher-Order and Symbolic Computation
Year:
2009

Citing 22
Cited 0

A semantics of multiple inheritance.

Proc. of the international symposium on Semantics of data types
ORBIT: an optimizing compiler for scheme

SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
The categorical abstract machine

Science of Computer Programming
Control flow analysis in scheme

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Compiling with continuations

Compiling with continuations
A syntactic approach to type soundness

Information and Computation
What is a recursive module?

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Recursive monadic bindings

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Recursive structures for standard ML

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
The Definition of Standard ML

The Definition of Standard ML
Revised Report on the Algorithmic Language Scheme

Higher-Order and Symbolic Computation
Compilation of extended recursion in call-by-value functional languages

Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
A type system for well-founded recursion

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The recursive record semantics of objects revisited

Journal of Functional Programming
Java(TM) Language Specification, The (3rd Edition) (Java (Addison-Wesley))

Java(TM) Language Specification, The (3rd Edition) (Java (Addison-Wesley))
Mixin modules in a call-by-value setting

ACM Transactions on Programming Languages and Systems (TOPLAS)
Fixing Letrec: A Faithful Yet Efficient Implementation of Scheme's Recursive Binding Construct

Higher-Order and Symbolic Computation
A type system for recursive modules

ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction

Journal of Functional Programming
Unrestricted pure call-by-value recursion

Proceedings of the 2008 ACM SIGPLAN workshop on ML
Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics

Electronic Notes in Theoretical Computer Science (ENTCS)
Initializing Mutually Referential Abstract Objects: The Value Recursion Challenge

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

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.