A Rational Deconstruction of Landin's SECD Machine

Danvy, Olivier

doi:10.7146/brics.v10i33.21801

Cited by 19 publications

(10 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Inlining the abstraction layer provided by the monad yields the evaluator of Figure 3. Dynamic continuation-passing style therefore fits the functional correspondence between evaluators and abstract machines advocated by the first two authors [1,2,13]. Furthermore, and as has been observed before for other CPS transformations and for the continuation monad [27,43], the dynamic CPS transformation itself can be factored through Moggi's monadic metalanguage and the monad above.…”

Section: A Monad For Dynamic Continuation-passing Stylesupporting

confidence: 59%

A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations

Biernacki¹,

Danvy²,

Millikin³

2005

BRICS

Self Cite

View full text Add to dashboard Cite

We present a new abstract machine that accounts for dynamic delimited continuations. We prove the correctness of this new abstract machine with respect to a pre-existing, definitional abstract machine. Unlike this definitional abstract machine, the new abstract machine is in defunctionalized form, which makes it possible to state the corresponding higher-order evaluator. This evaluator is in continuation+state passing style and threads a trail of delimited continuations and a meta-continuation. Since this style accounts for dynamic delimited continuations, we refer to it as `dynamic continuation-passing style.'<br /> <br /> We show that the new machine operates more efficiently than the definitional one and that the notion of computation induced by the corresponding evaluator takes the form of a monad. We also present new examples and a new simulation of dynamic delimited continuations in terms of static ones.

show abstract

Section: A Monad For Dynamic Continuation-passing Stylesupporting

confidence: 59%

A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations

Biernacki¹,

Danvy²,

Millikin³

2005

BRICS

Self Cite

View full text Add to dashboard Cite

show abstract

“…As we have already observed in previous work [2,6,9,11,12], the evaluation contexts, together with the cont transition function, are the defunctionalized counterpart of a continuation. We can therefore "refunctionalize" this continuation and then write the evaluator in direct style.…”

Section: Stack Inspection As a Lifted State Monadmentioning

confidence: 64%

“…Diehl, Hartel, and Sestoft's overview of abstract machines for programming-language implementation [14] concluded on the need to develop a theory of abstract machines. In previous work [2,9], we have attempted to contribute to this theory by identifying a correspondence between interpreters (i.e., evaluation functions in the sense of denotational semantics) and abstract machines (i.e., transition functions in the sense of operational semantics). The correspondence builds on the observation that defunctionalized continuation-passing evaluators are abstract machines.…”

Section: Introductionmentioning

confidence: 99%

“…These two machines have been independently developed and-to the best of our knowledge-have never been associated with defunctionalization, CPS transformation, and closure conversion. The correspondence has also let us reveal the evaluators underlying Landin's SECD machine, Schmidt's VEC machine, Hannan and Miller's CLS machine, and Curien et al's Categorical Abstract Machine [2,9].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A functional correspondence between monadic evaluators and abstract machines for languages with computational effects

Ager

Danvy

Midtgaard

2005

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

We show how to derive new abstract machines from monadic evaluators for the computational λ-calculus. Starting from (1) a generic evaluator parameterized by a monad and (2) a monad specifying a computational effect, we inline the components of the monad in the generic evaluator to obtain an evaluator written in a style that is specific to this computational effect. We then derive the corresponding abstract machine by closure-converting, CPS-transforming, and defunctionalizing this specific evaluator. We illustrate the construction with the identity monad, obtaining yet again the CEK machine, and with a lifted state monad, obtaining a variant of the CEK machine with error and state.In addition, we characterize the tail-recursive stack inspection presented by Clements and Felleisen at ESOP 2003 as a lifted state monad. This enables us to combine the stackinspection monad with other monads and to construct abstract machines for languages with properly tail-recursive stack inspection and other computational effects. The construction scales to other monads-including one more properly dedicated to stack inspection than the lifted state monad-and other monadic evaluators.

show abstract

“…Obtaining staged abstract machines was one of the goals of Hardin, Maranget, and Pagano's study of functional runtime systems using explicit substitutions [26]; these machines arise mechanically here. As investigated by Danvy and his students in their study of the functional correspondence between compositional evaluation functions and abstract machines [4][5][6]16], the eval/apply machines are in defunctionalized form [17,35] and they can be 'refunctionalized' into a continuation-passing evaluation function which itself can be written in direct style [14] and implements a big-step operational semantics. (Because of the closures, the result is again in defunctionalized form and can be refunctionalized into a compositional evaluation function implementing the valuation function of a denotational semantics.…”

Section: A Derivational Taxonomy Of Abstract Machinesmentioning

confidence: 99%

A Concrete Framework for Environment Machines

Biernacka¹,

Danvy²

2005

BRICS

Self Cite

View full text Add to dashboard Cite

We materialize the common belief that calculi with explicit substitutions provide an intermediate step between an abstract specification of substitution in the λ-calculus and its concrete implementations. To this end, we go back to Curien's original calculus of closures (an early calculus with explicit substitutions), we extend it minimally so that it can also express one-step reduction strategies, and we methodically derive a series of environment machines from the specification of two one-step reduction strategies for the λ-calculus: normal order and applicative order. The derivation extends Danvy and Nielsen's refocusing-based construction of abstract machines with two new steps: one for coalescing two successive transitions into one, and the other for unfolding a closure into a term and an environment in the resulting abstract machine. The resulting environment machines include both the idealized and the original versions of Krivine's machine, Felleisen et al.'s CEK machine, and Leroy's Zinc abstract machine.

show abstract

A Rational Deconstruction of Landin's SECD Machine

Cited by 19 publications

References 24 publications

A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations

A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations

A functional correspondence between monadic evaluators and abstract machines for languages with computational effects

A Concrete Framework for Environment Machines

Contact Info

Product

Resources

About