A functional correspondence between evaluators and abstract machines

@inproceedings{Ager2003AFC,
  title={A functional correspondence between evaluators and abstract machines},
  author={Mads Sig Ager and Dariusz Biernacki and Olivier Danvy and Jan Midtgaard},
  booktitle={PPDP},
  year={2003}
}
We bridge the gap between functional evaluators and abstract machines for the λ-calculus, using closure conversion, transformation into continuation-passing style, and defunctionalization.We illustrate this approach by deriving Krivine's abstract machine from an ordinary call-by-name evaluator and by deriving an ordinary call-by-value evaluator from Felleisen et al.'s CEK machine. The first derivation is strikingly simpler than what can be found in the literature. The second one is new… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 108 CITATIONS, ESTIMATED 86% COVERAGE

Calculating correct compilers

  • J. Funct. Program.
  • 2015
VIEW 11 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A Rational Deconstruction of Landin's SECD Machine with the J Operator

  • Logical Methods in Computer Science
  • 2008
VIEW 15 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Continuations, Processes, and Sharing

VIEW 7 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Specializing continuations a model for dynamic join points

VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

The Theory and Practice of Programming Languages with Delimited Continuations

VIEW 12 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2003
2019

CITATION STATISTICS

  • 26 Highly Influenced Citations

  • Averaged 3 Citations per year over the last 3 years

References

Publications referenced by this paper.