Reference. Dialectica Categories for the Lambek Calculus

Cite

Cite as @depaiva2018-dialectica-lambek (helia, typst) · \cite{depaiva2018-dialectica-lambek} (LaTeX)
BibTeX
bibtex · 14 lines
@inproceedings{depaiva2018-dialectica-lambek,
 title = {Dialectica {Categories} for the {Lambek} {Calculus}},
 author = {de Paiva, Valeria and Eades III, Harley},
 year = {2018},
 eprint = {1801.06883},
 archiveprefix = {arXiv},
 primaryclass = {cs.LO},
 url = {https://arxiv.org/abs/1801.06883},
 booktitle = {Logical Foundations of Computer Science (LFCS 2018)},
 series = {Lecture Notes in Computer Science},
 volume = {10703},
 publisher = {Springer},
 doi = {10.1007/978-3-319-72056-2_16}
}
hayagriva YAML (typst)
yaml · 21 lines
depaiva2018-dialectica-lambek:
  type: article
  title: Dialectica {Categories} for the {Lambek} {Calculus}
  author:
  - name: Paiva
    given-name: Valeria
    prefix: de
  - Eades III, Harley
  date: 2018
  url: https://arxiv.org/abs/1801.06883
  serial-number:
    arxiv: '1801.06883'
    doi: 10.1007/978-3-319-72056-2_16
  parent:
    type: proceedings
    title: Logical Foundations of Computer Science (LFCS 2018)
    publisher: Springer
    volume: 10703
    parent:
      type: proceedings
      title: Lecture Notes in Computer Science
Cited by (1)

On the Lambek Calculus with an Exchange Modality depaiva-eades-jiang-2019-lambek-exchange

DOI · arXiv
Cites 24 works (2 here)
With notes (2)

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
depaiva2018-dialectica-lambek reference entries/refs/depaiva2018-dialectica-lambek/depaiva2018-dialectica-lambek.hel