Free compact 2-categories

  • Authors:
  • Anne Preller;Joachim Lambek

  • Affiliations:
  • LIRMM/CNRS Montpellier, France Email: preller@lirmm.fr;McGill University Montréal, QC, Canada Email: lambek@math.mcgill.ca

  • Venue:
  • Mathematical Structures in Computer Science
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.