Linearly Used Effects: Monadic and CPS Transformations into the Linear Lambda Calculus

We propose a semantic and syntactic framework for modelling linearly used effects, by giving the monadic transforms of the computational lambda calculus (considered as the core calculus of typed call-by-value programming languages) into the linear lambda calculus. As an instance Berdine et al.'s work on linearly used continuations can be put in this general picture. As a technical result we show the full completeness of the CPS transform into the linear lambda calculus.

[1]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

[2]  J. Robin B. Cockett,et al.  ! and ? – Storage as tensorial strength , 1996, Mathematical Structures in Computer Science.

[3]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[4]  Amr Sabry,et al.  Reasoning about programs in continuation-passing style , 1992, LFP '92.

[5]  Philip Wadler,et al.  Linear logic, monads and the lambda calculus , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[6]  Gavin M. Bierman.  What is a Categorical Model of Intuitionistic Linear Logic? , 1995, TLCA.

[7]  Robin Milner,et al.  Functions as processes , 1990, Mathematical Structures in Computer Science.

[8]  Masahito Hasegawa,et al.  Axioms for Recursion in Call-by-Value (Extended Abstract) , 2001 .

[9]  Claudio V. Russo,et al.  Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion , 2001, HOOTS.

[10]  Peter W. O'Hearn,et al.  Linearly Used Continuations , 2000 .

[11]  Eugenio Moggi,et al.  Computational lambda-calculus and monads , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[12]  Masahito Hasegawa.  Girard translation and logical predicates , 2000, J. Funct. Program..

[13]  Gordon D. Plotkin,et al.  Complete axioms for categorical fixed-point operators , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[14]  Masahito Hasegawa,et al.  Axioms for Recursion in Call-by-Value , 2001, FoSSaCS.

[15]  Peter W. O'Hearn,et al.  On Affine Typing and Completeness of CPS , 2001 .