Skip to Main content Skip to Navigation

A Taxonomy of Functional Language Implementations : Part I : Call by Value

Rémi Douence 1 Pascal Fradet 1 
1 Lande - Logiciel : ANalyse et DEveloppement
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : We present a unified framework to describe and compare functional language implementations. We express the compilation process as a succession of program transformations in the common framework. At each step, different transformatio- ns model fundamental choices or optimizations. A benefit of this approach is to structure and decompose the implementation process. The correctness proofs can be tackled independently for each step and amount to proving program transformations in the functional world. It also paves the way to formal comparisons by estimating the complexity of individual transformations or compositions of them. We focus on call-by-value implementations, describe and compare the diverse alternatives and classify well-known abstract machines. This work also aims to open the design space of functional language implementations and we suggest how distinct choices could be mixed to yield efficient hybrid abstract machines.
Document type :
Complete list of metadata
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 2:03:13 PM
Last modification on : Friday, February 4, 2022 - 3:15:29 AM
Long-term archiving on: : Monday, April 5, 2010 - 12:01:33 AM


  • HAL Id : inria-00073908, version 1


Rémi Douence, Pascal Fradet. A Taxonomy of Functional Language Implementations : Part I : Call by Value. [Research Report] RR-2783, INRIA. 1996. ⟨inria-00073908⟩



Record views


Files downloads