Linear λμ is CP (more or less)

In this paper we compare Wadler’s CP calculus for classical linear processes to a linear version of Parigot’s λμ calculus for classical logic. We conclude that linear λμ is “more or less” CP, in that it equationally corresponds to a polarized version of CP. The comparison is made by extending a technique from Melliès and Tabareau’s tensor logic that correlates negation with polarization. The polarized CP, which is written CP± and pronounced “CP more or less,” is an interesting bridge in the landscape of Curry-Howard interpretations of logic.

[1]  S. Zdancewic,et al.  Linear Temporal Type Theory for Event-based Reactive Programming , 2016 .

[2]  Philip Wadler,et al.  Call-by-Value Is Dual to Call-by-Name - Reloaded , 2005, RTA.

[3]  Vasco Thudichum Vasconcelos,et al.  Language Primitives and Type Discipline for Structured Communication-Based Programming Revisited: Two Systems for Higher-Order Session Communication , 1998, SecReT@ICALP.

[4]  Matthias Felleisen,et al.  The theory and practice of first-class prompts , 1988, POPL '88.

[5]  Philippe de Groote,et al.  On the Relation between the λ μ-Calculus and the Syntactic Theory of Sequential Control , 2007 .

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

[7]  Vasco Thudichum Vasconcelos,et al.  Linear type theory for asynchronous session types , 2009, Journal of Functional Programming.

[8]  Frank Pfenning,et al.  Polarized Substructural Session Types , 2015, FoSSaCS.

[9]  Bernardo Toninho,et al.  Linear logical relations and observational equivalences for session-based concurrency , 2014, Inf. Comput..

[10]  Emmanuel Beffara,et al.  A Concurrent Model for Linear Logic , 2006, MFPS.

[11]  Kohei Honda,et al.  Types for Dyadic Interaction , 1993, CONCUR.

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

[13]  Andrew M. Pitts,et al.  Foundations of Software Science and Computation Structures , 2015, Lecture Notes in Computer Science.

[14]  Noam Zeilberger.  On the unity of duality , 2008, Ann. Pure Appl. Log..

[15]  Philip Wadler.  Propositions as sessions , 2014, J. Funct. Program..

[16]  Michel Parigot,et al.  Lambda-Mu-Calculus: An Algorithmic Interpretation of Classical Natural Deduction , 1992, LPAR.

[17]  Jean-Philippe Bernardy,et al.  Compiling Linear Logic using Continuations , 2014 .

[18]  Hugo Herbelin,et al.  The duality of computation , 2000, ICFP '00.

[19]  Nicolas Tabareau,et al.  Resource modalities in tensor logic , 2010, Ann. Pure Appl. Log..

[20]  Sam Lindley,et al.  A Semantics for Propositions as Sessions , 2015, ESOP.

[21]  Sam Lindley,et al.  Sessions as Propositions , 2014, PLACES.

[22]  Timothy G. Griffin,et al.  A formulae-as-type notion of control , 1989, POPL '90.

[23]  Olivier Laurent,et al.  About translations of classical logic into polarized linear logic , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[24]  Jean-Yves Girard,et al.  A new constructive logic: classic logic , 1991, Mathematical Structures in Computer Science.

[25]  Philip Wadler.  Call-by-Value Is Dual to Call-by-Name - Reloaded , 2005, RTA.

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

[27]  Peter Selinger,et al.  Control categories and duality: on the categorical semantics of the lambda-mu calculus , 2001, Mathematical Structures in Computer Science.

[28]  Steve Zdancewic,et al.  Lolliproc: to concurrency from classical linear logic via curry-howard and control , 2010, ICFP '10.

[29]  Frank Pfenning,et al.  Session Types as Intuitionistic Linear Propositions , 2010, CONCUR.