Abstract
We consider the Curry-Howard-Lambek correspondence for effectful computation and resource management, specifically proposing polarised calculi together with presheaf-enriched adjunction models as the starting point for a comprehensive semantic theory relating logical systems, typed calculi, and categorical models in this context. Our thesis is that the combination of effects and resources should be considered orthogonally. Model theoretically, this leads to an understanding of our categorical models from two complementary perspectives: (i) as a linearisation of CBPV (Call-by-Push-Value) adjunction models, and (ii) as an extension of linear/non-linear adjunction models with an adjoint resolution of computational effects. When the linear structure is cartesian and the resource structure is trivial we recover Levy’s notion of CBPV adjunction model, while when the effect structure is trivial we have Benton’s linear/non-linear adjunction models. Further instances of our model theory include the dialogue categories with a resource modality of Melliès and Tabareau, and the [E]EC ([Enriched] Effect Calculus) models of Egger, Møgelberg and Simpson. Our development substantiates the approach by providing a lifting theorem of linear models into cartesian ones. To each of our categorical models we systematically associate a typed term calculus, each of which corresponds to a variant of the sequent calculi LJ (Intuitionistic Logic) or ILL (Intuitionistic Linear Logic). The adjoint resolution of effects corresponds to polarisation whereby, syntactically, types locally determine a strict or lazy evaluation order and, semantically, the associativity of cuts is relaxed. In particular, our results show that polarisation provides a computational interpretation of CBPV in direct style. Further, we characterise depolarised models: those where the cut is associative, and where the evaluation order is unimportant. We explain possible advantages of this style of calculi for the operational semantics of effects.
- Jean-Marc Andreoli, Logic Programming with Focusing Proof in Linear Logic, Journal of Logic and Computation 2 (1992), no. 3, 297–347.Google Scholar
Cross Ref
- Zena M. Ariola, Hugo Herbelin, and Amr Sabry, A Type-Theoretic Foundation of Continuations and Prompts, Proc. ICFP, ACM, 2004, pp. 40–53. Google Scholar
Digital Library
- Hendrik Pieter Barendregt, Handbook of Logic in Computer Science, vol. 2, ch. Lambda Calculi with Types, Oxford University Press, 1993.Google Scholar
- Nick Benton, A mixed linear and non-linear logic: proofs, terms and models, Proc. CSL, Lecture Notes in Computer Science, vol. 933, Springer-Verlag, 1994. Google Scholar
Digital Library
- Nick Benton, Gavin Bierman, Valeria de Paiva, and Martin Hyland, A term calculus for Intuitionistic Linear Logic, Proc. TLCA, Lecture Notes in Computer Science, vol. 664, 1993, pp. 75–90. Google Scholar
Digital Library
- Nick Benton and Andrew Kennedy, Exceptional Syntax, Journal of Functional Programming 11 (2001), no. 4, 395–410. Google Scholar
Digital Library
- Nick Benton and Philip Wadler, Linear Logic, Monads, and the Lambda Calculus, Proc. LICS, IEEE Computer Society Press, 1996. Google Scholar
Digital Library
- Gavin Bierman, What is a categorical model of Intuitionistic Linear Logic?, Proc. TLCA, Lecture Notes in Computer Science, vol. 902, Springer-Verlag, 1995, pp. 78–93. Google Scholar
Digital Library
- J Robin B Cockett and Craig A Pastro, A language for multiplicativeadditive linear logic, Elec. Not. in Theor. Comp. Sci. 122 (2005), 23– 65. Google Scholar
Digital Library
- Pierre-Louis Curien and Hugo Herbelin, The duality of computation, ACM SIGPLAN Notices 35 (2000), 233–243. Google Scholar
Digital Library
- Pierre-Louis Curien and Guillaume Munch-Maccagnoni, The duality of computation under focus, Proc. IFIP TCS, 2010, Extended version.Google Scholar
Cross Ref
- Vincent Danos, Jean-Baptiste Joinet, and Harold Schellinx, LKQ and LKT: sequent calculi for second order logic based upon dual linear decompositions of the classical implication, London Mathematical Society Lecture Notes 1 (1995), 222.Google Scholar
- , A New Deconstructive Logic: Linear Logic, Journal of Symbolic Logic 62 (3) (1997), 755–807.Google Scholar
Cross Ref
- Brian Day, On closed categories of functors, Lecture Notes in Mathematics (1970), no. 137, 1–38.Google Scholar
- Brian Day and Stephen Lack, Limits of small functors, Journal of Pure and Applied Algebra (2007), no. 210, 651–663.Google Scholar
- Jeff Egger, Rasmus Møgelberg, and Alex Simpson, The enriched effect calculus: syntax and semantics, Journal of Logic and Computation 24 (2014), no. 3, 615–654.Google Scholar
Cross Ref
- Andrzej Filinski, Linear Continuations, Proc. POPL, 1992, pp. 27–38. Google Scholar
Digital Library
- Marcelo Fiore, Linearising Call-By-Push-Value, Note, July 2011.Google Scholar
- Marcelo Fiore, Roberto Di Cosmo, and Vincent Balat, Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types, Proc. LICS, IEEE Computer Society Press, 2002, pp. 147–156. Google Scholar
Digital Library
- Cormac Flanagan, Amr Sabry, Bruce F. Duba, and Matthias Felleisen, The Essence of Compiling with Continuations, Proc. PLDI, 1993, pp. 237–247. Google Scholar
Digital Library
- Carsten Führmann, Direct Models for the Computational Lambda Calculus, Electr. Notes Theor. Comput. Sci. 20 (1999), 245–292.Google Scholar
Cross Ref
- Jean-Yves Girard, Linear Logic, Theoretical Computer Science 50 (1987), 1–102. Google Scholar
Digital Library
- , A new constructive logic: Classical logic, Math. Struct. Comp. Sci. 1 (1991), no. 3, 255–296.Google Scholar
Cross Ref
- , The Blind Spot: Lectures on Logic, European Mathematical Society, 2011.Google Scholar
- Geun Bin Im and G. Max Kelly, A universal property of the convolution monoidal structure, Journal of Pure and Applied Algebra (1986), no. 43, 75–88.Google Scholar
- G. Max Kelly, Doctrinal adjunction, Lecture Notes in Mathematics (1974), no. 420, 257–280.Google Scholar
- , Basic Concepts of Enriched Category Theory, Lecture Notes in Mathematics 64, Cambridge University Press, 1982, Republished in: Reprints in Theory and Applications of Categories, No. 10 (2005) pp. 1–136.Google Scholar
- Andrew Kennedy, Compiling with continuations, continued, ICFP, 2007, pp. 177–190. Google Scholar
Digital Library
- Yves Lafont, B. Reus, and Thomas Streicher, Continuation Semantics or Expressing Implication by Negation, Tech. report, University of Munich, 1993.Google Scholar
- Olivier Laurent, Etude de la polarisation en logique, Thèse de doctorat, Université Aix-Marseille II, mar 2002.Google Scholar
- Paul Blain Levy, Call-By-Push-Value: A Functional/Imperative Synthesis, Semantic Structures in Computation, vol. 2, Springer, 2004.Google Scholar
- , Adjunction models for Call-by-Push-Value with stacks, Theory and Applications of Categories 14 (2005), no. 5, 75–110.Google Scholar
- Paul-André Melliès and Nicolas Tabareau, Resource modalities in tensor logic, Annals of Pure and Applied Logic 5 (2010), no. 161, 632– 653.Google Scholar
- Eugenio Moggi, Computational lambda-calculus and monads, Proc. LICS, IEEE Computer Society Press, June 1989, pp. 14–23. Google Scholar
Digital Library
- Eugenio Moggi, Notions of computation and monads, Inf. Comput. 93 (1991), no. 1, 55–92. Google Scholar
Digital Library
- Guillaume Munch-Maccagnoni, Focalisation and Classical Realisability, Proc. CSL, LNCS, Springer-Verlag, 2009. Google Scholar
Digital Library
- , Syntax and Models of a non-Associative Composition of Programs and Proofs, Ph.D. thesis, Univ. Paris Diderot, 2013.Google Scholar
- , Formulae-as-Types for an Involutive Negation, Proc. CSLLICS, 2014, To appear. Google Scholar
Digital Library
- , Models of a Non-Associative Composition, Proc. FoSSaCS (A. Muscholl, ed.), LNCS, vol. 8412, Springer, 2014, pp. 397–412.Google Scholar
- Guillaume Munch-Maccagnoni and Gabriel Scherer, Polarised Intermediate Representation of Lambda Calculus with Sums, Proc. LICS 2015, 2015.Google Scholar
- Chetan R. Murthy, A Computational Analysis of Girard’s Translation and LC, Proc. LICS, 1992, pp. 90–101.Google Scholar
- A. John Power and Edmund Robinson, Premonoidal categories and notions of computation, Mathematical Structures in Computer Science 5 (1997), no. 7, 453–468. Google Scholar
Digital Library
- Robert Seely, Linear logic, *-autonomous categories and cofree algebras, Conference on Categories in Computer Science and Logic, AMS Contemporary Mathematics, vol. 92, 1989, pp. 371–382.Google Scholar
- Peter Selinger, Control Categories and Duality: On the Categorical Semantics of the Lambda-Mu Calculus, Math. Struct in Comp. Sci. 11 (2001), no. 2, 207–260. Google Scholar
Digital Library
- Philip Wadler, There’s no substitute for linear logic, 8’th International Workshop on the Mathematical Foundations of Programming Semantics (1992).Google Scholar
- , A syntax for linear logic, Proc. MFPS, LNCS, no. 802, Springer, 1993, pp. 513–529. Google Scholar
Digital Library
- , Call-by-value is dual to call-by-name, SIGPLAN Not. 38 (2003), no. 9, 189–201. Google Scholar
Digital Library
- Noam Zeilberger, On the unity of duality, Ann. Pure and App. Logic 153:1 (2008).Google Scholar
Cross Ref
- , The logical basis of evaluation order, Ph.D. thesis, Carnegie Mellon University, 2009.Google Scholar
Index Terms
A theory of effects and resources: adjunction models and polarised calculi
Recommendations
A theory of effects and resources: adjunction models and polarised calculi
POPL '16: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesWe consider the Curry-Howard-Lambek correspondence for effectful computation and resource management, specifically proposing polarised calculi together with presheaf-enriched adjunction models as the starting point for a comprehensive semantic theory ...
Hypersequent Calculi for Modal Logics Extending S4
New Frontiers in Artificial IntelligenceAbstractIn this paper, we introduce hypersequent calculi for some modal logics extending S4 modal logic. In particular, we uniformly characterize hypersequent calculi for S4, S4.2, S4.3, S5 in terms of what are called “external modal structural rules” for ...
Terminating Calculi and Countermodels for Constructive Modal Logics
Automated Reasoning with Analytic Tableaux and Related MethodsAbstractWe investigate terminating sequent calculi for constructive modal logics and in the style of Dyckhoff’s calculi for intuitionistic logic. We first present strictly terminating calculi for these logics. Our calculi provide immediately a ...






Comments