Comparing Control Constructs by Double-barrelled CPS (2002)

Cached

Download Links

by Hayo Thielecke
Venue:Higher-order and Symbolic Computation
Citations:17 - 2 self

Documents Related by Co-Citation

300 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
240 A Formulae-as-Types Notion of Control – Timothy G. Griffin - 1990
730 Notions of Computation and Monads – Eugenio Moggi - 1991
201 Call-by-name, call-by-value and the λ-calculus – G Plotkin, D - 1975
130 Representing Monads – Andrzej Filinski - 1994
328 An algorithmic interpretation of classical natural deduction – M Parigot - 1992
16 An Extended Type System for Exceptions – Juan Carlos Guzm'an - 1994
439 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
24 Shift to control – Chung chieh Shan - 2004
26 Control Operators, Hierarchies, and Pseudo-Classical Type Systems: A-Translation at Work – C Murthy - 1992
8 A Syntactic Approach to Modularity – P Cenciarelli, E Moggi - 1993
3 On the Call-by-Value CPS Transform and its – C Fuhrmann, H Thielecke
3 Adjunctions whose Counits are Coequalizers – G M Kelly, A J Power - 1993
10 Locally Presentable and Accessible – J Adámek, J Rosick´y - 1994
23 Composing Monads Using Coproducts – Christoph Lüth, Neil Ghani - 2002
45 A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so – G M Kelly
18 Sound and Complete Axiomatisations of Call-By-Value Control Operators – Martin Hofmann, Mart I N Hofmann - 1994
19 From Control Effects to Typed Continuation Passing – Hayo Thielecke - 2003
42 A functional theory of exceptions – M Spivey - 1990