Explaining the lazy Krivine machine using explicit substitution and addressesReport as inadecuate




Explaining the lazy Krivine machine using explicit substitution and addresses - Download this document for free, or read online. Document in PDF available to download.

1 VASY - System validation - Research and applications Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d-Informatique de Grenoble

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.





Author: Frederic Lang -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents