Functional Back-Ends within the Lambda-Sigma Calculus - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 1996

Functional Back-Ends within the Lambda-Sigma Calculus

Thérèse Hardin
  • Fonction : Auteur
Luc Maranget
Bruno Pagano
  • Fonction : Auteur

Résumé

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.
Fichier principal
Vignette du fichier
RR-3034.pdf (518.23 Ko) Télécharger le fichier

Dates et versions

inria-00073659 , version 1 (24-05-2006)

Identifiants

  • HAL Id : inria-00073659 , version 1

Citer

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

Partager

Gmail Facebook X LinkedIn More