Continuation Semantics in Typed Lambda-Calculi (1985)

Cached

Download Links

by Albert R. Meyer , Mitchell Wand
Venue:Logics of Programs
Citations:67 - 1 self

Documents Related by Co-Citation

240 A Formulae-as-Types Notion of Control – Timothy G. Griffin - 1990
300 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
625 Compiling With Continuations – A W Appel - 1992
46 On the relation between direct and continuation semantics – J C Reynolds - 1974
35 Polymorphic type assignment and CPS conversion – Robert Harper, Mark Lillibridge - 1993
161 Reasoning about Programs in Continuation-Passing Style – Amr Sabry Sabry, Matthias Felleisen
730 Notions of Computation and Monads – Eugenio Moggi - 1991
65 Extracting constructive content from classical proofs – C R Murthy - 1990
1565 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
220 Call-by-name, call-by-value and the -calculus – G D Plotkin - 1975
87 A Generic Account of Continuation-Passing Styles – John Hatcliff, Olivier Danvy - 1994
101 Lambda-Calculus Schemata – Michael J. Fischer - 1993
201 Call-by-name, call-by-value and the λ-calculus – G Plotkin, D - 1975
110 Continuations: A Mathematical Semantics for Handling Full Jumps – Christopher Strachey - 1974
93 Typing First-Class Continuations in ML – Robert Harper, Bruce F. Duba, David Macqueen - 1992
105 Danvy and Andrzej Filinski. Representing control: A study of the CPS transformation – Olivier - 1992
130 Representing Monads – Andrzej Filinski - 1994
171 Call-by-name, call-by-value, and the lambda calculus – Gordon Plotkin - 1975
51 Back to Direct Style II: First-Class Continuations – Olivier Danvy, Julia L. Lawall - 1996