HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Functional Back-Ends within the Lambda-Sigma Calculus

Thérèse Hardin 1 Luc Maranget 1 Bruno Pagano
1 PARA - Parallélisme
Inria Paris-Rocquencourt
Abstract : We define a weak lambda-calculus, lambda-sigma-w, as a subsystem of the full lambda-calculus with explicit substitutions lambda-sigma-lift. We claim that lambda-sigma-w could be the archetypal output language of functional compilers, just as the lambda-calculus is their universal input language. Furthermore, lambda-sigma-lift could be the adequate theory to establish the correctness of simplified functional compilers. Here, we illustrate these claims by proving the correctness of four simplified compilers and runtime systems modeled as abstract machines. The four machines we prove are the Krivine machine, the SECD, the FAM and the CAM. Thereby, we give the first formal proofs of Cardelli's FAM and of its compiler.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 1:26:03 PM
Last modification on : Thursday, February 3, 2022 - 11:18:58 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:20:46 PM


  • HAL Id : inria-00073659, version 1



Thérèse Hardin, Luc Maranget, Bruno Pagano. Functional Back-Ends within the Lambda-Sigma Calculus. [Research Report] RR-3034, INRIA. 1996. ⟨inria-00073659⟩



Record views


Files downloads