• Publications
  • Influence
The essence of compiling with continuations
TLDR
The combined effect of the three phases is equivalent to a source-to-source transformation that simulates the compaction phase and fully developed CPS compilers do not need to employ the CPS transformation but can achieve the same results with a simple source-level transformation. Expand
Hygienic macro expansion
TLDR
A change to the expansion algorithm is proposed so that macros will only violate the binding discipline when it is explicitly intended. Expand
A Syntactic Theory of Sequential Control
TLDR
It is shown that, given a machine semantics, one can derive an algebraic extension of the λ υ -calculus, and that the extended calculus satisfies the diamond property and contains a Church-Rosser subcalculus. Expand
Reasoning with Continuations
Abstract continuations: a mathematical semantics for handling full jumps
TLDR
This work introduces an abstract domain of rests of computations with appropriate operations for continuation semantics in modern Lisp-style languages, which contain advanced control structures like full functional jumps and control delimiters for which continuation semantics is insufficient. Expand
Typing First-Class Continuations in ML
Typing first-class continuations in ML
TLDR
First-class continuations are a powerful tool for implementing sophisticated control constructs like co-routines, processes, backtracking, and asynchronous signals, but it is clear that extensive work is required to integrate continuations fully into the definition of Standard ML. Expand
From Macros to Reusable Generative Programming
TLDR
This paper describes McMicMac, a framework for generative programming that uses tree-transforming macros as language specifications, and enhances them with inherited and synthesized attributes to describe general compilation tasks. Expand
The essence of compiling with continuations (with retrospective)
TLDR
A method using simplex, party-line transmission of electromagnetic signals for distributing and collecting data packet messages is described which, in the case of random failures, automatically seeks out alternate routes. Expand
Call-by-Value Combinatory Logic and the Lambda-Value Calculus
TLDR
Two by-value combinatory logics are presented and their equivalence with the λv-calculus is proved, and laziness to K terms is introduced so that the translation can preserve the structure of functions that do not use their argument. Expand
...
1
2
...