Abstract

Continuations are variously understood as representations of the current evaluation context and as representations of the rest of the computation, but these understandings contradict each other: plugging an expression in a context yields a new expression whereas sending an intermediate result to a continuation yields the final answer. We show that continuations-as-evaluation-contexts are the defunctionalized representation of the continuation of a singlestep reduction function and that continuations-as-the-rest-of-thecomputation are the continuation of an evaluation function. Furthermore, we show that defunctionalizing the continuation of an evaluator gives rise to the same evaluation contexts as in the singlestep reducer. The only difference is how these evaluation contexts are interpreted: a `plug' interpretation yields one-step reduction, whereas a `refocus' interpretation yields evaluation.

Citations

595	Compiling with Continuations - Appel - 1992
107	Continuation-passing, closure-passing style - Appel, Jim - 1989
52	A functional correspondence between evaluators and abstract machines - Ager, Biernacki, et al. - 2003
34	A functional correspondence between monadic evaluators and abstract machines for languages with computational effects - Ager, Danvy, et al. - 2005
32	A functional correspondence between callby-need evaluators and lazy abstract machines - Ager, Danvy, et al. - 2004
23	From interpreter to compiler and virtual machine: a functional derivation - Ager, Biernacki, et al. - 2003
22	Design and correctness of program transformations based on controlflow analysis - Banerjee, Heintze, et al.