Classical call-by-need sequent calculi: the unity of semantic artifacts

Authors:
Zena M. Ariola;Paul Downen;Hugo Herbelin;Keiko Nakata;Alexis Saurin
Affiliations:
University of Oregon;University of Oregon;CNRS, PPS UMR 7126, Univ Paris Diderot, Sorbonne Paris Cité, PiR2, INRIA Paris Rocquencourt, Paris, France;Institute of Cybernetics, Tallinn University, Estonia;CNRS, PPS UMR 7126, Univ Paris Diderot, Sorbonne Paris Cité, PiR2, INRIA Paris Rocquencourt, Paris, France
Venue:
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Year:
2012

Citing 9
Cited 3

Call-by-need and continuation-passing style

Lisp and Symbolic Computation
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction

LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
The call-by-need lambda calculus

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

Journal of Functional Programming
Control reduction theories: The benefit of structural substitution

Journal of Functional Programming
Lazy evaluation and delimited control

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From reduction-based to reduction-free normalization

AFP'08 Proceedings of the 6th international conference on Advanced functional programming
Classical call-by-need and duality

TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Defunctionalized interpreters for call-by-need evaluation

FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming

A Constructive Proof of Dependent Choice, Compatible with Classical Logic

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
A synthetic operational account of call-by-need evaluation

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
A logical correspondence between natural semantics and abstract machines

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We systematically derive a classical call-by-need sequent calculus, which does not require an unbounded search for the standard redex, by using the unity of semantic artifacts proposed by Danvy et al. The calculus serves as an intermediate step toward the generation of an environment-based abstract machine. The resulting abstract machine is context-free, so that each step is parametric in all but one component. The context-free machine elegantly leads to an environment-based CPS transformation. This transformation is observationally different from a natural classical extension of the transformation of Okasaki et al. , due to duplication of un-evaluated bindings.