Explaining the lazy Krivine machine using explicit substitution and addresses - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Higher-Order and Symbolic Computation Year : 2007

Explaining the lazy Krivine machine using explicit substitution and addresses

Frederic Lang

Abstract

In a previous paper, Benaissa, Lescanne, and Rose, have extended the weak lambda-calculus of explicit substitution lambda-sigma-w with addresses, so that it gives an account of the sharing implemented by lazy functional language interpreters. We show in this paper that their calculus, called lambda-sigma-w-a, fits well to the lazy Krivine machine, which describes the core of a lazy (call-by-need) functional programming language implementation. The lazy Krivine machine implements term evaluation sharing, that is essential for efficiency of such languages. The originality of our proof is that it gives a very detailed account of the implemented strategy.
Fichier principal
Vignette du fichier
Lang-07.pdf (184.54 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00198756 , version 1 (17-12-2007)

Identifiers

  • HAL Id : inria-00198756 , version 1

Cite

Frederic Lang. Explaining the lazy Krivine machine using explicit substitution and addresses. Higher-Order and Symbolic Computation, 2007. ⟨inria-00198756⟩
460 View
676 Download

Share

Gmail Facebook X LinkedIn More