Continuations, Functions and Jumps (1999)
by
Jon G. Riecke
,
Hayo Thielecke
BibTeX
@MISC{Riecke99continuations,functions,
author = {Jon G. Riecke and Hayo Thielecke},
title = {Continuations, Functions and Jumps},
year = {1999}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this article, therefore, is to help the reader uncompress the CPS transform by way of a rational reconstruction from jumps.
Citations
| 1128 | The C Programming Language - Kernighan, Ritchie - 1988 |
| 595 | Compiling with Continuations - Appel - 1992 |
| 290 | Functions as processes - Milner - 1992 |
| 267 | The Polyadic ?-calculus: A Tutorial - Milner - 1993 |
| 263 | Definitional interpreters for higher-order programming languages - Reynolds - 1972 |
| 219 | Call-by-name, call-by-value, and the -calculus - Plotkin - 1975 |
| 206 | A formulae-as-types notion of control - Griffin - 1990 |
| 119 | Rabbit: A compiler for Scheme - Steele - 1978 |
| 101 | The discoveries of continuations - Reynolds - 1993 |
| 97 | C.P.: Continuations: A mathematical semantics for handling full jumps - Strachey, Wadsworth - 1974 |
| 62 | The -calculus in Direct Style - Boudol - 1997 |
| 60 | Categorical Structure of Continuation Passing Style - Thielecke - 1997 |
| 30 | A Generalization of Jumps and Labels - Landin - 1965 |
| 13 | Recursive definition of syntax and semantics - Wijngaarden - 1966 |
| 8 | and Hayo Thielecke. Typed exceptions and continuations cannot macro-express each other - Riecke - 1999 |
