ABSTRACT
A number of models of linear logic are based on or closely related to linear algebra, in the sense that morphisms are “matrices” over appropriate coefficient sets. Examples include models based on coherence spaces, finiteness spaces and probabilistic coherence spaces, as well as the relational and weighted relational models. This paper introduces a unified framework based on module theory, making the linear algebraic aspect of the above models more explicit. Specifically we consider modules over Σ-semirings R, which are ring-like structures with partially-defined countable sums, and show that morphisms in the above models are actually R-linear maps in the standard algebraic sense for appropriate R. An advantage of our algebraic treatment is that the category of R-modules is locally presentable, from which it easily follows that this category becomes a model of intuitionistic linear logic with the cofree exponential. We then discuss constructions of classical models and show that the above-mentioned models are examples of our constructions.
- J. Adamek and J. Rosicky. 1994. Locally Presentable and Accessible Categories. Cambridge University Press. https://doi.org/10.1017/CBO9780511600579Google Scholar
- Michael Barr. 1991. Accessible categories and models of linear logic. Journal of Pure and Applied Algebra 69, 3 (1991), 219–232. https://doi.org/10.1016/0022-4049(91)90020-3Google ScholarCross Ref
- Raphaëlle Crubillé, Thomas Ehrhard, Michele Pagani, and Christine Tasson. 2017. The Free Exponential Modality of Probabilistic Coherence Spaces. In FoSSaCS, Vol. 7794. 20–35. https://doi.org/10.1007/978-3-662-54458-7_2Google ScholarDigital Library
- Vincent Danos and Thomas Ehrhard. 2011. Probabilistic coherence spaces as a model of higher-order probabilistic computation. Information and Computation 209, 6 (2011), 966–991. https://doi.org/10.1016/j.ic.2011.02.001Google ScholarDigital Library
- Thomas Ehrhard. 2002. On Köthe sequence spaces and linear logic. Mathematical Structures in Computer Science 12, 05 (2002), 579–623. https://doi.org/10.1017/S0960129502003729Google ScholarDigital Library
- Thomas Ehrhard. 2005. Finiteness spaces. Mathematical Structures in Computer Science 15, 4 (2005), 615–646. https://doi.org/10.1017/S0960129504004645Google ScholarDigital Library
- Thomas Ehrhard. 2012. The Scott model of linear logic is the extensional collapse of its relational model. Theoretical Computer Science 424 (2012), 20–45. https://doi.org/10.1016/j.tcs.2011.11.027Google ScholarDigital Library
- Thomas Ehrhard and Laurent Regnier. 2008. Uniformity and the Taylor expansion of ordinary lambda-terms. Theoretical Computer Science 403, 2-3 (2008), 347–372. https://doi.org/10.1016/j.tcs.2008.06.001Google ScholarDigital Library
- Thomas Ehrhard, Christine Tasson, and Michele Pagani. 2014. Probabilistic coherence spaces are fully abstract for probabilistic PCF. Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL ’14(2014), 309–320. https://doi.org/10.1145/2535838.2535865Google ScholarDigital Library
- Jean-Yves Girard. 1987. Linear Logic. Theoretical Computer Science 50, 1 (1987), 1–102. https://doi.org/10.1016/0304-3975(87)90045-4Google ScholarDigital Library
- Jean-Yves Girard. 1989. Towards a geometry of interaction. In Categories in Computer Science and Logic. 69–108. https://doi.org/10.1090/conm/092/1003197Google Scholar
- J.-Y. Girard. 1995. Linear Logic: its syntax and semantics. In Advances in Linear Logic, Jean-Yves Girard, Yves Lafont, and Laurent Regnier (Eds.). Cambridge University Press, Cambridge, 1–42. https://doi.org/10.1017/CBO9780511629150.002Google Scholar
- Jean-Yves Girard. 2004. Between Logic and Quantic: a Tract. Linear Logic in Computer Science(2004), 346–381. https://doi.org/10.1017/cbo9780511550850.011Google Scholar
- Esfandiar Haghverdi. 2000. Unique decomposition categories, Geometry of Interaction and combinatory logic. Mathematical Structures in Computer Science 10, 2 (2000), 205–230. https://doi.org/10.1017/S0960129599003035Google ScholarDigital Library
- Esfandiar Haghverdi. 2001. Partially Additive Categories and Fully Complete Models of Linear Logic. Typed Lambda Calculi and Applications(2001), 197–216. https://doi.org/10.1007/3-540-45413-6_18Google Scholar
- P Hines and P Scott. 2007. Conditional quantum iteration from categorical traces. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.174.4399&rep=rep1&type=pdfGoogle Scholar
- Naohiko Hoshino. 2012. A representation theorem for unique decomposition categories. Electronic Notes in Theoretical Computer Science 286 (2012), 213–227. https://doi.org/10.1016/j.entcs.2012.08.014Google ScholarDigital Library
- Martin Hyland and Andrea Schalk. 2003. Glueing and orthogonality for models of linear logic. Theoretical Computer Science 294, 1-2 (2003), 183–231. https://doi.org/10.1016/S0304-3975(01)00241-9Google ScholarDigital Library
- Bart Jacobs. 1994. Semantics of weakening and contraction. Annals of Pure and Applied Logic 69, 1 (1994), 73–106. https://doi.org/10.1016/0168-0072(94)90020-5Google ScholarCross Ref
- James Laird. 2016. Fixed Points In Quantitative Semantics. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. ACM, New York, NY, USA, 347–356. https://doi.org/10.1145/2933575.2934569Google ScholarDigital Library
- Jim Laird, Giulio Manzonetto, Guy McCusker, and Michele Pagani. 2013. Weighted Relational Models of Typed Lambda-Calculi. 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (2013), 301–310. https://doi.org/10.1109/LICS.2013.36Google ScholarDigital Library
- François Lamarche. 1992. Quantitative domains and infinitary algebras. Theoretical Computer Science 94, 1 (1992), 37–62. https://doi.org/10.1016/0304-3975(92)90323-8Google ScholarDigital Library
- R. Loader. 1994. Linear logic, totality and full completeness. Proceedings - Symposium on Logic in Computer Science (1994), 292–298. https://doi.org/10.1109/lics.1994.316060Google ScholarCross Ref
- Ernest G. Manes and Michael A. Arbib. 1986. Algebraic Approaches to Program Semantics. Springer New York, New York, NY. https://doi.org/10.1007/978-1-4612-4962-7Google Scholar
- Paul-André Melliès. 2003. Categorical models of linear logic revisited. July (2003). http://hal.archives-ouvertes.fr/hal-00154229%5Cnhttp://www.pps.univ-paris-diderot.fr/$$mellies/papers/catmodels.psGoogle Scholar
- Paul-André Melliès, Nicolas Tabareau, and Christine Tasson. 2009. An Explicit Formula for the Free Exponential Modality of Linear Logic. In ICALP, Vol. 28. 247–260. https://doi.org/10.1007/978-3-642-02930-1_21Google ScholarDigital Library
- Paul André Melliès, Nicolas Tabareau, and Christine Tasson. 2018. An explicit formula for the free exponential modality of linear logic. Mathematical Structures in Computer Science 28, 7 (2018), 1253–1286. https://doi.org/10.1017/S0960129516000426Google ScholarCross Ref
- Sara Negri. 2002. Continuous Domains as Formal Spaces. Math. Struct. Comput. Sci. 12, 1 (2002), 19–52. https://doi.org/10.1017/S0960129501003450Google ScholarDigital Library
- Michele Pagani, Peter Selinger, and Benoît Valiron. 2014. Applying quantitative semantics to higher-order quantum computing. Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL ’14(2014), 647–658. https://doi.org/10.1145/2535838.2535879 arxiv:1311.2290Google ScholarDigital Library
- E. Palmgren and S. J. Vickers. 2007. Partial Horn logic and cartesian categories. Annals of Pure and Applied Logic 145, 3 (2007), 314–353. https://doi.org/10.1016/j.apal.2006.10.001Google ScholarCross Ref
- Hans E. Porst. 2008. On categories of monoids, comonoids, and bimonoids. Quaestiones Mathematicae 31, 2 (2008), 127–139. https://doi.org/10.2989/QM.2008.31.2.2.474Google ScholarCross Ref
- Peter Selinger. 2004. Towards a quantum programming language. Mathematical Structures in Computer Science 14, 4 (2004), 56. https://doi.org/10.1017/S0960129504004256Google ScholarDigital Library
- Takeshi Tsukada and Kazuyuki Asada. 2022. Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings. CoRR abs/2204.10589(2022). https://doi.org/10.48550/arXiv.2204.10589 arXiv:2204.10589Google Scholar
- Takeshi Tsukada, Kazuyuki Asada, and C.-H. Luke Ong. 2017. Generalised species of rigid resource terms. Proceedings - Symposium on Logic in Computer Science (2017), 1–12. https://doi.org/10.1109/LICS.2017.8005093Google ScholarCross Ref
- Takeshi Tsukada, Kazuyuki Asada, and C.-H. Luke Ong. 2018. Species, profunctors and Taylor expansion weighted by SMCC: A unified framework for modelling nondeterministic, probabilistic and quantum programs. Proceedings - Symposium on Logic in Computer Science (2018), 889–898. https://doi.org/10.1145/3209108.3209157Google ScholarDigital Library
- Glynn Winskel. 2004. Linearity and Nonlinearity in Distributed Computation. In Linear Logic in Computer Science. Cambridge University Press, 151–188. https://doi.org/10.1017/CBO9780511550850.005Google Scholar
Recommendations
A theory of effects and resources: adjunction models and polarised calculi
POPL '16We 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 ...
Categories of algebraic contexts equivalent to idempotent semirings and domain semirings
RAMiCS'12: Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer ScienceA categorical equivalence between algebraic contexts with relational morphisms and join-semilattices with homomorphisms is presented and extended to idempotent semirings and domain semirings. These contexts are the Kripke structures for idempotent ...
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 ...
Comments