Free Compact 2-Categories

Abstract : Before one can attach a meaning to a sentence, one must distinguish different ways of parsing it. When analyzing a language with pregroup grammars, we are thus led to replace the free pregroup by a free compact strict monoidal category. Since a strict monoidal category is a 2-category with one 0-cell, we investigate the free compact 2-category generated by a given category, and we describe its 2-cells as labeled transition systems. In particular, we obtain a decision procedure for the equality of 2-cells in the free compact 2-category.
Type de document :
Article dans une revue
Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2007, 17 (doi: 10.1017/S0960129506005901), pp.309-340. 〈10.1017/S0960129506005901〉
Liste complète des métadonnées

Littérature citée [9 références]  Voir  Masquer  Télécharger

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00137681
Contributeur : Anne Preller <>
Soumis le : mardi 30 octobre 2007 - 20:58:28
Dernière modification le : jeudi 11 janvier 2018 - 06:14:31
Document(s) archivé(s) le : vendredi 25 novembre 2016 - 17:06:55

Identifiants

Collections

Citation

Anne Preller, Joachim Lambek. Free Compact 2-Categories. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2007, 17 (doi: 10.1017/S0960129506005901), pp.309-340. 〈10.1017/S0960129506005901〉. 〈lirmm-00137681v2〉

Partager

Métriques

Consultations de la notice

119

Téléchargements de fichiers

249