Explaining the lazy Krivine machine using explicit substitution and addresses

Authors:
Frédéric Lang
Affiliations:
INRIA Rhône-Alpes, Montbonnot, France 38 330
Venue:
Higher-Order and Symbolic Computation
Year:
2007

Citing 14
Cited 0

TIM: A simple, lazy abstract machine to execute supercombinators

Proc. of a conference on Functional programming languages and computer architecture
An abstract frame work for environment machines

Theoretical Computer Science
The lazy lambda calculus

Research topics in functional programming
A natural semantics for lazy evaluation

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Confluence properties of weak and strong calculi of explicit substitutions

Journal of the ACM (JACM)
Functional back-ends within the lambda-sigma calculus

Proceedings of the first ACM SIGPLAN international conference on Functional programming
The spineless tagless G-machine, naturally

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Efficient compilation of lazy evaluation

SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
Functional Programming

Functional Programming
Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution

PLILP '96 Proceedings of the 8th International Symposium on Programming Languages: Implementations, Logics, and Programs
A Framework for Defining Object-Calculi

FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Explicit Cyclic Substitutions

CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Deriving a lazy abstract machine

Journal of Functional Programming
The call-by-need lambda calculus

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a previous paper, Benaissa, Lescanne, and Rose, have extended the weak lambda-calculus of explicit substitution 驴驴 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 驴驴 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.