On One-Pass CPS Transformations

Danvy, Olivier; Nielsen, Lasse R.

doi:10.7146/brics.v9i3.21722

Cited by 10 publications

(9 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We could as well wrap the remaining code into a stub shift that behaves as identity and then use flatMap. But that would introduce unnecessary "administrative" redexes, which customary CPS-transform algorithms go to great lengths to avoid (Danvy et al 2007 are translated by applying the other rules to the enclosed expression sequence, possibly skipping a prefix of non-CPS terms (SEQ).…”

Section: Type-directed Transformationmentioning

confidence: 99%

Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform

RompfTiark¹,

MaierIngo²,

OderskyMartin³

2009

SIGPLAN Not.

View full text Add to dashboard Cite

We describe the implementation of first-class polymorphic delimited continuations in the programming language Scala. We use Scala's pluggable typing architecture to implement a simple type and effect system, which discriminates expressions with control effects from those without and accurately tracks answer type modification incurred by control effects. To tackle the problem of implementing first-class continuations under the adverse conditions brought upon by the Java VM, we employ a selective CPS transform, which is driven entirely by effect-annotated types and leaves pure code in direct style. Benchmarks indicate that this high-level approach performs competitively.

show abstract

Section: Type-directed Transformationmentioning

confidence: 99%

Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform

RompfTiark¹,

MaierIngo²,

OderskyMartin³

2009

SIGPLAN Not.

View full text Add to dashboard Cite

show abstract

“…Equivalently, such a term can be first transformed into monadic normal form and then translated into the term model of the continuation monad [29]. The CPS transformation is abundantly described in the literature [19,27,47,52]. For example, a term such as λf.λg.λx.f x (g x) is named and sequentialized into λf.λg.λx.let…”

Section: A1 Cps Transformationmentioning

confidence: 99%

A Rational Deconstruction of Landin's SECD Machine

Danvy

2003

BRICS

Self Cite

View full text Add to dashboard Cite

Landin's SECD machine was the first abstract machine for the λ-calculus viewed as a programming language. Both theoretically as a model of computation and practically as an idealized implementation, it has set the tone for the subsequent development of abstract machines for functional programming languages. However, and even though variants of the SECD machine have been presented, derived, and invented, the precise rationale for its architecture and modus operandi has remained elusive. In this article, we deconstruct the SECD machine into a λ-interpreter, i.e., an evaluation function, and we reconstruct λ-interpreters into a variety of SECD-like machines. The deconstruction and reconstructions are transformational: they are based on equational reasoning and on a combination of simple program transformations-mainly closure conversion, transformation into continuation-passing style, and defunctionalization.The evaluation function underlying the SECD machine provides a precise rationale for its architecture: it is an environment-based eval-apply evaluator with a callee-save strategy for the environment, a data stack of intermediate results, and a control delimiter. Each of the components of the SECD machine (stack, environment, control, and dump) is therefore rationalized and so are its transitions.The deconstruction and reconstruction method also applies to other abstract machines and other evaluation functions. It makes it possible to systematically extract the denotational content of an abstract machine in the form of a compositional evaluation function, and the (small-step) operational content of an evaluation function in the form of an abstract machine.

show abstract

“…We can fuse these two functions into an abstract machine. This abstract machine is in defunctionalized form, and we can write its higher-order counterpart, obtaining a traditional one-pass CPS transformer, as we have shown elsewhere [9]. …”

Section: Analysis Of the Refocused Cps Transformersmentioning

confidence: 99%

Refocusing in Reduction Semantics

Danvy¹,

Nielsen²

2004

BRICS

Self Cite

View full text Add to dashboard Cite

The evaluation function of a reduction semantics (i.e., a small-step operational semantics with an explicit representation of the reduction context) is canonically defined as the transitive closure of (1) decomposing a term into a reduction context and a redex, (2) contracting this redex, and (3) plugging the contractum in the context. Directly implementing this evaluation function therefore yields an interpreter with a worst-case overhead, for each step, that is linear in the size of the input term.We present sufficient conditions over the constituents of a reduction semantics to circumvent this overhead, by replacing the composition of (3) plugging and (1) decomposing by a single "refocus" function mapping a contractum and a context into a new context and a new redex, if any. We also show how to construct such a refocus function, we prove the correctness of this construction, and we analyze the complexity of the resulting refocus function.The refocused evaluation function of a reduction semantics implements the transitive closure of the refocus function, i.e., a "pre-abstract machine." Fusing the refocus function with the trampoline function computing the transitive closure gives a state-transition function, i.e., an abstract machine. This abstract machine clearly separates between the transitions implementing the congruence rules of the reduction semantics and the transitions implementing its reduction rules. The construction of a refocus function therefore shows how to mechanically obtain an abstract machine out of a reduction semantics, which was done previously on a case-by-case basis.We illustrate refocusing by mechanically constructing Felleisen et al.'s CK machine from a call-by-value reduction semantics of the lambda-calculus, and by constructing a substitution-based version of Krivine's machine from a call-by-name reduction semantics of the lambda-calculus. We also mechanically construct three one-pass CPS transformers from three quadratic context-based CPS transformers for the lambda-calculus.

show abstract

On One-Pass CPS Transformations

Cited by 10 publications

References 28 publications

Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform

Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform

A Rational Deconstruction of Landin's SECD Machine

Refocusing in Reduction Semantics

Contact Info

Product

Resources

About