A Functional Correspondence between Monadic Evaluators and Abstract Machines for Languages with Computational Effects

@inproceedings{Ager2003AFC,
  title={A Functional Correspondence between Monadic Evaluators and Abstract Machines for Languages with Computational Effects},
  author={Mads Sig Ager and Olivier Danvy and Jan Midtgaard},
  year={2003}
}
We extend our correspondence between evaluators and abstract machines from the pure setting of the lambda-calculus to the impure setting of the computational lambda-calculus. Specifically, we show how to derive new abstract machines from monadic evaluators for the computational lambda-calculus. Starting from a monadic evaluator and a given monad, we inline the components of the monad in the evaluator and we derive the corresponding abstract machine by closure-converting, CPS-transforming, and… CONTINUE READING

Similar Papers

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 32 CITATIONS

Analytical Approach to Programs as Data Objects

VIEW 10 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Operational Aspects of Full Reduction in Lambda Calculi

Álvaro García Pérez
  • 2014
VIEW 1 EXCERPT
CITES BACKGROUND