Skip to Main content Skip to Navigation
Reports

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 :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00073659
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 1:26:03 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: : Sunday, April 4, 2010 - 9:20:46 PM

Identifiers

  • HAL Id : inria-00073659, version 1

Collections

Citation

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

Share

Metrics

Record views

218

Files downloads

447