Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2837614.2837652acmconferencesArticle/Chapter ViewAbstractPublication PagespoplConference Proceedingsconference-collections
research-article

A theory of effects and resources: adjunction models and polarised calculi

Published: 11 January 2016 Publication History
  • Get Citation Alerts
  • 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.

    References

    [1]
    Jean-Marc Andreoli, Logic Programming with Focusing Proof in Linear Logic, Journal of Logic and Computation 2 (1992), no. 3, 297–347.
    [2]
    Zena M. Ariola, Hugo Herbelin, and Amr Sabry, A Type-Theoretic Foundation of Continuations and Prompts, Proc. ICFP, ACM, 2004, pp. 40–53.
    [3]
    Hendrik Pieter Barendregt, Handbook of Logic in Computer Science, vol. 2, ch. Lambda Calculi with Types, Oxford University Press, 1993.
    [4]
    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.
    [5]
    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.
    [6]
    Nick Benton and Andrew Kennedy, Exceptional Syntax, Journal of Functional Programming 11 (2001), no. 4, 395–410.
    [7]
    Nick Benton and Philip Wadler, Linear Logic, Monads, and the Lambda Calculus, Proc. LICS, IEEE Computer Society Press, 1996.
    [8]
    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.
    [9]
    J Robin B Cockett and Craig A Pastro, A language for multiplicativeadditive linear logic, Elec. Not. in Theor. Comp. Sci. 122 (2005), 23– 65.
    [10]
    Pierre-Louis Curien and Hugo Herbelin, The duality of computation, ACM SIGPLAN Notices 35 (2000), 233–243.
    [11]
    Pierre-Louis Curien and Guillaume Munch-Maccagnoni, The duality of computation under focus, Proc. IFIP TCS, 2010, Extended version.
    [12]
    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.
    [13]
    , A New Deconstructive Logic: Linear Logic, Journal of Symbolic Logic 62 (3) (1997), 755–807.
    [14]
    Brian Day, On closed categories of functors, Lecture Notes in Mathematics (1970), no. 137, 1–38.
    [15]
    Brian Day and Stephen Lack, Limits of small functors, Journal of Pure and Applied Algebra (2007), no. 210, 651–663.
    [16]
    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.
    [17]
    Andrzej Filinski, Linear Continuations, Proc. POPL, 1992, pp. 27–38.
    [18]
    Marcelo Fiore, Linearising Call-By-Push-Value, Note, July 2011.
    [19]
    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.
    [20]
    Cormac Flanagan, Amr Sabry, Bruce F. Duba, and Matthias Felleisen, The Essence of Compiling with Continuations, Proc. PLDI, 1993, pp. 237–247.
    [21]
    Carsten Führmann, Direct Models for the Computational Lambda Calculus, Electr. Notes Theor. Comput. Sci. 20 (1999), 245–292.
    [22]
    Jean-Yves Girard, Linear Logic, Theoretical Computer Science 50 (1987), 1–102.
    [23]
    , A new constructive logic: Classical logic, Math. Struct. Comp. Sci. 1 (1991), no. 3, 255–296.
    [24]
    , The Blind Spot: Lectures on Logic, European Mathematical Society, 2011.
    [25]
    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.
    [26]
    G. Max Kelly, Doctrinal adjunction, Lecture Notes in Mathematics (1974), no. 420, 257–280.
    [27]
    , 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.
    [28]
    Andrew Kennedy, Compiling with continuations, continued, ICFP, 2007, pp. 177–190.
    [29]
    Yves Lafont, B. Reus, and Thomas Streicher, Continuation Semantics or Expressing Implication by Negation, Tech. report, University of Munich, 1993.
    [30]
    Olivier Laurent, Etude de la polarisation en logique, Thèse de doctorat, Université Aix-Marseille II, mar 2002.
    [31]
    Paul Blain Levy, Call-By-Push-Value: A Functional/Imperative Synthesis, Semantic Structures in Computation, vol. 2, Springer, 2004.
    [32]
    , Adjunction models for Call-by-Push-Value with stacks, Theory and Applications of Categories 14 (2005), no. 5, 75–110.
    [33]
    Paul-André Melliès and Nicolas Tabareau, Resource modalities in tensor logic, Annals of Pure and Applied Logic 5 (2010), no. 161, 632– 653.
    [34]
    Eugenio Moggi, Computational lambda-calculus and monads, Proc. LICS, IEEE Computer Society Press, June 1989, pp. 14–23.
    [35]
    Eugenio Moggi, Notions of computation and monads, Inf. Comput. 93 (1991), no. 1, 55–92.
    [36]
    Guillaume Munch-Maccagnoni, Focalisation and Classical Realisability, Proc. CSL, LNCS, Springer-Verlag, 2009.
    [37]
    , Syntax and Models of a non-Associative Composition of Programs and Proofs, Ph.D. thesis, Univ. Paris Diderot, 2013.
    [38]
    , Formulae-as-Types for an Involutive Negation, Proc. CSLLICS, 2014, To appear.
    [39]
    , Models of a Non-Associative Composition, Proc. FoSSaCS (A. Muscholl, ed.), LNCS, vol. 8412, Springer, 2014, pp. 397–412.
    [40]
    Guillaume Munch-Maccagnoni and Gabriel Scherer, Polarised Intermediate Representation of Lambda Calculus with Sums, Proc. LICS 2015, 2015.
    [41]
    Chetan R. Murthy, A Computational Analysis of Girard’s Translation and LC, Proc. LICS, 1992, pp. 90–101.
    [42]
    A. John Power and Edmund Robinson, Premonoidal categories and notions of computation, Mathematical Structures in Computer Science 5 (1997), no. 7, 453–468.
    [43]
    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.
    [44]
    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.
    [45]
    Philip Wadler, There’s no substitute for linear logic, 8’th International Workshop on the Mathematical Foundations of Programming Semantics (1992).
    [46]
    , A syntax for linear logic, Proc. MFPS, LNCS, no. 802, Springer, 1993, pp. 513–529.
    [47]
    , Call-by-value is dual to call-by-name, SIGPLAN Not. 38 (2003), no. 9, 189–201.
    [48]
    Noam Zeilberger, On the unity of duality, Ann. Pure and App. Logic 153:1 (2008).
    [49]
    , The logical basis of evaluation order, Ph.D. thesis, Carnegie Mellon University, 2009.

    Cited By

    View all
    • (2024)Oxidizing OCaml with Modal Memory ManagementProceedings of the ACM on Programming Languages10.1145/36746428:ICFP(485-514)Online publication date: 15-Aug-2024
    • (2024)Effectful semantics in bicategories: strong, commutative, and concurrent pseudomonadsProceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662130(1-15)Online publication date: 8-Jul-2024
    • (2023)A Reusable Machine-Calculus for Automated Resource AnalysesLogic-Based Program Synthesis and Transformation10.1007/978-3-031-45784-5_5(61-79)Online publication date: 16-Oct-2023
    • Show More Cited By

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    POPL '16: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
    January 2016
    815 pages
    ISBN:9781450335492
    DOI:10.1145/2837614
    • cover image ACM SIGPLAN Notices
      ACM SIGPLAN Notices  Volume 51, Issue 1
      POPL '16
      January 2016
      815 pages
      ISSN:0362-1340
      EISSN:1558-1160
      DOI:10.1145/2914770
      • Editor:
      • Andy Gill
      Issue’s Table of Contents
    Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of a national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.

    Sponsors

    In-Cooperation

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 11 January 2016

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Adjunction models
    2. Categorical semantics
    3. Computational effects
    4. Curry-Howard-Lambek correspondence
    5. Intuitionistic logic
    6. Linear logic
    7. Polarised calculi
    8. Resource modalities

    Qualifiers

    • Research-article

    Conference

    POPL '16
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 824 of 4,130 submissions, 20%

    Upcoming Conference

    POPL '25

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)40
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 11 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Oxidizing OCaml with Modal Memory ManagementProceedings of the ACM on Programming Languages10.1145/36746428:ICFP(485-514)Online publication date: 15-Aug-2024
    • (2024)Effectful semantics in bicategories: strong, commutative, and concurrent pseudomonadsProceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662130(1-15)Online publication date: 8-Jul-2024
    • (2023)A Reusable Machine-Calculus for Automated Resource AnalysesLogic-Based Program Synthesis and Transformation10.1007/978-3-031-45784-5_5(61-79)Online publication date: 16-Oct-2023
    • (2022)Exponentials as Substitutions and the Cost of Cut Elimination in Linear LogicProceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3531130.3532445(1-15)Online publication date: 2-Aug-2022
    • (2022)Back to futuresJournal of Functional Programming10.1017/S095679682200001632Online publication date: 28-Feb-2022
    • (2021)Categorical models of Linear Logic with fixed points of formulas2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)10.1109/LICS52264.2021.9470664(1-13)Online publication date: 29-Jun-2021
    • (2020)Graded Algebraic TheoriesFoundations of Software Science and Computation Structures10.1007/978-3-030-45231-5_21(401-421)Online publication date: 17-Apr-2020
    • (2019)Modalities, cohesion, and information flowProceedings of the ACM on Programming Languages10.1145/32903333:POPL(1-29)Online publication date: 2-Jan-2019
    • (2019)Abstracting extensible data types: or, rows by any other nameProceedings of the ACM on Programming Languages10.1145/32903253:POPL(1-28)Online publication date: 2-Jan-2019
    • (2019)Principality and approximation under dimensional boundProceedings of the ACM on Programming Languages10.1145/32903213:POPL(1-29)Online publication date: 2-Jan-2019
    • Show More Cited By

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media