Functional runtime systems within the lambda-sigma calculus - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Functional Programming Année : 1998

Functional runtime systems within the lambda-sigma calculus

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

Résumé

We define a weak $\lambda$-calculus, $\lambda\sigma_w$, as a subsystem of the full $\lambda$-calculus with explicit substitutions $\lambda\sigma_\Uparrow$. 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_\Uparrow$ could be the adequate theory to establish the correctness of functional compilers. Here we illustrate these claims by proving the correctness of four simplified compilers and runtime systems modelled as abstract machines. The four machines we prove are the Krivine machine, the SECD, the FAM and the CAM. Thus, we give the first formal proofs of Cardelli's FAM and of its compiler.
Fichier non déposé

Dates et versions

hal-01199543 , version 1 (15-09-2015)

Identifiants

  • HAL Id : hal-01199543 , version 1

Citer

Thérèse Hardin, Luc Maranget, Bruno Pagano. Functional runtime systems within the lambda-sigma calculus. Journal of Functional Programming, 1998, 8 (2), pp.131-176. ⟨hal-01199543⟩
60 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More