Compiling with Continuations
By Andrew W. Appel. 1991
Subfields: Automated Theorem Proving & Formal Methods
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Automated Theorem Proving & Formal Methods
Citations in the corpus
- Language-based information-flow security (2003, unknown): “branches at the machine-code level [120].”
- The New C Standard (Excerpted material) An Economic and Cultural Commentary (2008, unknown): “[188] References for the implementation of languages that have significant differences from C include APL,[55] functional languages,[347] and ML.[18]”
- Equality saturation: a new approach to optimization (2009, methodology): “The overhead of using intermediate variables is also why we chose to represent effects with an effect token rather than using the techniques from the functional languages community such as monads [56, 57, 58] or continuation-passing style [6, 35, 30, 25, 8], both of which introduce indirection throu”
- A Selective CPS Transformation (2001, methodology): “CPS transformations are used in many places, but primarily in compilers to give an intermediate representation [1, 21] and as a way to simplify the language of a program before applying other transformations or analyzes to it [4].”
- C3: Lightweight Incrementalized MCMC for Probabilistic Programs using Continuations and Callsite Caching (2015, background): “CPS re-organizes a program to make all data and control flow explicit—instead of returning, functions invoke a ‘continuation’ function which represents the remaining computation to be performed [11].”