From Control Effects to Typed Continuation Passing (2003)

Cached

Download Links

by Hayo Thielecke
Venue:In 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL’03
Citations:19 - 2 self

Documents Related by Co-Citation

94 Abstracting Control – Olivier Danvy, Andrzej Filinski - 1990
130 Representing Monads – Andrzej Filinski - 1994
66 A Functional Abstraction of Typed Contexts – Olivier Danvy, Andrzej Filinski - 1989
439 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
110 Continuations: A Mathematical Semantics for Handling Full Jumps – Christopher Strachey - 1974
81 Representing control: a study of the CPS transformation – Olivier Danvy, Andrzej Filinski - 1992
19 Polymorphic Delimited Continuations – Kenichi Asai, Yukiyoshi Kameyama - 2007
201 Call-by-name, call-by-value and the λ-calculus – G Plotkin, D - 1975
9 Answer type polymorphism in call-by-name continuation passing – Hayo Thielecke - 2004
55 Representing Layered Monads – Andrzej Filinski - 1999
150 The theory and practice of first-class prompts – M Felleisen - 1988
730 Notions of Computation and Monads – Eugenio Moggi - 1991
26 Control Operators, Hierarchies, and Pseudo-Classical Type Systems: A-Translation at Work – C Murthy - 1992
49 Controlling Effects – Andrzej Filinski - 1996
25 A Sound and Complete Axiomatization of Delimited Continuations – Yukiyoshi Kameyama, Masahito Hasegawa - 2003
58 Abstract continuations: A mathematical semantics for handling full functional jumps – M Felleisen, M Wand, D P Friedman, B F Duba - 1988
326 Theorems for free! – Philip Wadler - 1989
24 A type-theoretic foundation of continuations and prompts – Zena M Ariola, Hugo Herbelin, Amr Sabry - 2004
39 Control delimiters and their hierarchies – Dorai Sitaram, Matthias Felleisen - 1990