Search

• < Previous
• 1
• Next >

---

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

Olivier Danvy ; Kevin Millikin.

Landin's SECD machine was the first abstract machine for applicative expressions, i.e., functional programs. Landin's J operator was the first control operator for functional languages, and was specified by an extension of the SECD machine. We present a family of evaluation functions corresponding&nbsp;[&hellip;]

---

An Operational Foundation for Delimited Continuations in the CPS Hierarchy

Malgorzata Biernacka ; Dariusz Biernacki ; Olivier Danvy.

We present an abstract machine and a reduction semantics for the lambda-calculus extended with control operators that give access to delimited continuations in the CPS hierarchy. The abstract machine is derived from an evaluator in continuation-passing style (CPS); the reduction semantics (i.e., a&nbsp;[&hellip;]

---