CJO - Abstract - Free compact 2-categories

Cambridge Journals Online

Cambridge Journals Online
Mathematical Structures in Computer Science (2007), 17 : 309-340 Cambridge University Press
doi:10.1017/S0960129506005901 (About doi)
Published online by Cambridge University Press 18 Jan 2007
Cambridge Journals Online - CUP Full-Text Page
Mathematical Structures in Computer Science (2007), 17:309-340 Cambridge University Press
Copyright © Cambridge University Press 2007
doi:10.1017/S0960129506005901

Paper

Free compact 2-categories


ANNE PRELLERa1 and JOACHIM LAMBEKa2

a1 LIRMM/CNRS Montpellier, France Email: preller@lirmm.fr
a2 McGill University Montréal, QC, Canada Email: lambek@math.mcgill.ca
Article author query
preller a Google Scholar
lambek j Google Scholar

Before one can attach a meaning to a sentence, one must distinguish different ways of parsing it. When analysing 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 describe its 2-cells as labelled transition systems. In particular, we obtain a decision procedure for the equality of 2-cells in the free compact 2-category.

(Received October 10 2005)

(Revised May 15 2006)


Cambridge University Press