Combining continuations with other effects

We consider the combination of continuations with other effects, starting from Eugenio Moggi’s monadic framework. It turns out that the usual combinations can be analysed in one of three distinct ways: sum, tensor, and by applying the continuations monad transformer C(−), and each such way has a natural universal characterisation. Mathematically this requires delicate considerations on large categories; conceptually it remains unclear why the combinations are computationally correct.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  Gordon D. Plotkin,et al.  Combining effects: Sum and tensor , 2006, Theor. Comput. Sci..

[3]  Pietro Cenciarelli,et al.  A Syntactic Approach to Modularity in Denotational Semantics , 1993 .

[4]  Hayo Thielecke,et al.  On the call-by-value CPS transform and its semantics , 2004, Inf. Comput..

[5]  Paul Blain Levy,et al.  Call-by-push-value , 2022, ACM SIGLOG News.

[6]  Christoph Lüth,et al.  Composing monads using coproducts , 2002, ICFP '02.

[7]  Matthias Felleisen,et al.  A Syntactic Theory of Sequential Control , 1987, Theor. Comput. Sci..

[8]  Gordon D. Plotkin,et al.  Notions of Computation Determine Monads , 2002, FoSSaCS.

[9]  G. Kelly.  A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on , 1980, Bulletin of the Australian Mathematical Society.

[10]  Hayo Thielecke.  Comparing Control Constructs by Double-barrelled {CPS} Transforms , 2001, MFPS.

[11]  James Laird,et al.  Exceptions, Continuations and Macro-expressiveness , 2002, ESOP.

[12]  I. Stark,et al.  Domains and Denotational Semantics History Accomplishments and Open Problems , 1996 .

[13]  Nick Benton,et al.  Monads and Effects , 2000, APPSEM.

[14]  G. M. Kelly,et al.  Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads , 1993 .

[15]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[16]  Hayo Thielecke,et al.  Contrasting Exceptions and Continuations , 2001 .

[17]  Martin Hofmann,et al.  Sound and complete axiomatisations of call-by-value control operators , 1995, Mathematical Structures in Computer Science.

[18]  Robert Hieb,et al.  Revised 5 Report on the Algorithmic Language , 1999 .

[19]  Hayo Thielecke,et al.  Comparing Control Constructs by Double-Barrelled CPS , 2002, High. Order Symb. Comput..