Reference. Nonsymmetric *-autonomous categories

Cite

Cite as @barr1995-nonsymmetric-star-autonomous (helia, typst) · \cite{barr1995-nonsymmetric-star-autonomous} (LaTeX)
BibTeX
bibtex · 12 lines
@article{barr1995-nonsymmetric-star-autonomous,
 title = {Nonsymmetric *-autonomous categories},
 author = {Barr, Michael},
 year = {1995},
 journal = {Theoretical Computer Science},
 volume = {139},
 number = {1--2},
 pages = {115--130},
 doi = {10.1016/0304-3975(94)00089-2},
 url = {https://doi.org/10.1016/0304-3975(94)00089-2},
 publisher = {Elsevier}
}
hayagriva YAML (typst)
yaml · 15 lines
barr1995-nonsymmetric-star-autonomous:
  type: article
  title: Nonsymmetric *-autonomous categories
  author: Barr, Michael
  date: 1995
  page-range: 115-130
  url: https://doi.org/10.1016/0304-3975(94)00089-2
  serial-number:
    doi: 10.1016/0304-3975(94)00089-2
  parent:
    type: periodical
    title: Theoretical Computer Science
    publisher: Elsevier
    issue: 1–2
    volume: 139
Cites 10 works (3 here)
With notes (3)

Linear logic, *-autonomous categories and cofree coalgebras seely89

DOI

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
External (7)
barr1995-nonsymmetric-star-autonomous reference entries/refs/barr1995-nonsymmetric-star-autonomous/barr1995-nonsymmetric-star-autonomous.hel