Reference. Bifibrations of Polycategories and Classical Linear Logic

Cite

Cite as @blanco-2020-bifibrations (helia, typst) · \cite{blanco-2020-bifibrations} (LaTeX)
BibTeX
bibtex · 1 line
@article{blanco-2020-bifibrations, title={Bifibrations of Polycategories and Classical Linear Logic}, volume={352}, ISSN={1571-0661}, url={http://dx.doi.org/10.1016/j.entcs.2020.09.003}, DOI={10.1016/j.entcs.2020.09.003}, journal={Electronic Notes in Theoretical Computer Science}, publisher={Elsevier BV}, author={Blanco, Nicolas and Zeilberger, Noam}, year={2020}, month=Oct, pages={29–52} }
hayagriva YAML (typst)
yaml · 17 lines
blanco-2020-bifibrations:
  type: article
  title: Bifibrations of Polycategories and Classical Linear Logic
  author:
  - Blanco, Nicolas
  - Zeilberger, Noam
  date: 2020-10
  page-range: 29-52
  url: http://dx.doi.org/10.1016/j.entcs.2020.09.003
  serial-number:
    doi: 10.1016/j.entcs.2020.09.003
    issn: 1571-0661
  parent:
    type: periodical
    title: Electronic Notes in Theoretical Computer Science
    publisher: Elsevier BV
    volume: 352
Cited by (2)

On Quantifiers for Quantitative Reasoning capucci-2024-on

We explore a kind of first-order predicate logic with intended semantics in the reals. Compared to other approaches in the literature, we work predominantly in the multiplicative reals [0,∞], showing they support three generations of connectives, that we call non-linear, linear additive, and linear multiplicative. Means and harmonic means emerge as natural candidates for bounded existential and universal quantifiers, and in fact we see they behave as expected in relation to the other logical connectives. We explain this fact through the well-known fact that min/max and arithmetic mean/harmonic mean sit at opposite ends of a spectrum, that of p-means. We give syntax and semantics for this quantitative predicate logic, and as example applications, we show how softmax is the quantitative semantics of argmax, and Rényi entropy/Hill numbers are additive/multiplicative semantics of the same formula. Indeed, the additive reals also fit into the story by exploiting the Napierian duality −log⊣1/exp, which highlights a formal distinction between ‘additive’ and ‘multiplicative’ quantities. Finally, we describe two attempts at a categorical semantics via enriched hyperdoctrines. We discuss why hyperdoctrines are in fact probably inadequate for this kind of logic.
DOI · arXiv

LNL polycategories and doctrines of linear logic shulman-2023-lnl

We define and study LNL polycategories, which abstract the judgmental structure of classical linear logic with exponentials. Many existing structures can be represented as LNL polycategories, including LNL adjunctions, linear exponential comonads, LNL multicategories, IL-indexed categories, linearly distributive categories with storage, commutative and strong monads, CBPV-structures, models of polarized calculi, Freyd-categories, and skew multicategories, as well as ordinary cartesian, symmetric, and planar multicategories and monoidal categories, symmetric polycategories, and linearly distributive and *-autonomous categories. To study such classes of structures uniformly, we define a notion of LNL doctrine, such that each of these classes of structures can be identified with the algebras for some such doctrine. We show that free algebras for LNL doctrines can be presented by a sequent calculus, and that every morphism of doctrines induces an adjunction between their 2-categories of algebras.
DOI · arXiv
Cites 26 works (3 here)
With notes (3)

Functors are type refinement systems mellies_zeilberger_2015

The standard reading of type theory through the lens of category theory is based on the idea of viewing a type system as a category of well-typed terms. We propose a basic revision of this reading: rather than interpreting type systems as categories, we describe them as functors from a category of typing derivations to a category of underlying terms. Then, turning this around, we explain how in fact any functor gives rise to a generalized type system, with an abstract notion of typing judgment, typing derivations and typing rules. This leads to a purely categorical reformulation of various natural classes of type systems as natural classes of functors.

The main purpose of this paper is to describe the general framework (which can also be seen as providing a categorical analysis of refinement types), and to present a few applications. As a larger case study, we revisit Reynolds’ paper on “The Meaning of Types” (2000), showing how the paper’s main results may be reconstructed along these lines.

PDF · DOI · pldb

Linear logic girard_linear_1987

The familiar connective of negation is broken into two operations: linear negation which is the purely negative part of negation and the modality “of course” which has the meaning of a reaffirmation. Following this basic discovery, a completely new approach to the whole area between constructive logics and programmation is initiated.
DOI

The mathematics of sentence structure lambek58

DOI
blanco-2020-bifibrations reference entries/refs/blanco-2020-bifibrations/blanco-2020-bifibrations.hel