Free compact 2-categories

  title={Free compact 2-categories},
  author={Anne Preller and Joachim Lambek},
  journal={Mathematical Structures in Computer Science},
  pages={309 - 340}
  • A. Preller, J. Lambek
  • Published 1 April 2007
  • Computer Science, Mathematics
  • Mathematical Structures in Computer Science
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… 
Compact Monoidal Categories from Linguistics to Physics
This is largely an expository paper, revisiting some ideas about compact 2-categories, in which each 1-cell has both a left and a right adjoint. In the special case with only one 0-cell (where the
Toward discourse representation via pregroup grammars
  • A. Preller
  • Computer Science, Mathematics
    J. Log. Lang. Inf.
  • 2007
Every pregroup grammar is shown to be strongly equivalent to one which uses basic types and left and right adjoints of basic types only. Therefore, a semantical interpretation is independent of the
Toward Discourse Representation via Pregroup
Every pregroup grammar is shown to be strongly equivalent to one which uses basic types and left and right adjoints of basic types only. Therefore a semantical interpretation is independent of the
Complexity of Grammar Induction for Quantum Types
It is shown that for a variety of type systems, including pivotal and compact closed categories, the grammar induction problem is NP-complete, and could be extended to linguistic type systems such as autonomous or bi-closed categories.
Pregroup Grammars and Context-free Grammars
Pregroup grammars were introduced by Lambek [20] as a new formalism of type-logical grammars. They are weakly equivalent to context-free grammars [8]. The proof in one direction uses the fact that
Agreement and Cliticization in Italian: A Pregroup Analysis
This paper presents an analysis of features specification and agreement based on the parallel computations of a type calculus involving two pregroups grammars: the free pregroup of syntactic types
Cyclic pregroups and natural language: a computational algebraic analysis
This paper proposes an extension of the calculus of pregroups by introducing appropriate cyclic rules that will allow the grammar to formally analyze and compute word order and movement phenomena in different languages such as Persian, French, Italian, Dutch and Hungarian.
Clitic Movement in Pregroup Grammar: A Cross-Linguistic Approach
This paper proposes an extension of the calculus of pregroups including two cyclic rules and uses them to formally analyze movement of clitic clusters in Persian, French, and Italian.
Autonomization of Monoidal Categories
It is shown that contrary to common belief in the DisCoCat community, a monoidal category is all that is needed to define a categorical compositional model of natural language, and the applications of this principle to various distributional models of meaning are illustrated.
Towards functorial language-games
This work compositionally build game-theoretic semantics of sentences by taking the semantic category to be the category whose morphisms are open games, which requires some modifications to the grammar category to compensate for the failure of open games to form a compact closed category.


Type Grammar Revisited
  • J. Lambek
  • Mathematics, Computer Science
  • 1997
This work explores the assignment of elements of a free protogroup to English words as an aid for checking which strings of words are well-formed sentences, though ultimately the requirement of freeness may have to relax.
Coherence for compact closed categories
It gives us great pleasure to honour, on the occasion of his seventieth birthday, our friend and mentor Saunders MacLane; and to acknowledge that our interest in coherence problems stems from his
Efficiency of Pregroups and the French Noun Phrase
An algorithm of complexity n3 to solve the reduction problem in an arbitrary free pregroup as well as recognition by a pregroup grammar is presented and specified to run in linear time.
Nonsymmetric *-Autonomous Categories
  • M. Barr
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 1995
This paper provides the definition of ∗ -autonomous categories and develops some equivalent forms of the definition and gives a nonsymmetric version of the Chu construction, which has proven so useful in the past.
Automata, languages, and machines. A
  • S. Eilenberg
  • Computer Science
    Pure and applied mathematics
  • 1974
This book attempts to provide a comprehensive textbook for undergraduate and postgraduate mathematicians with an interest in formal languages and automata, written by Professor Ian Chiswell.
Trends in Logic
This chapter describes the dynamics of model theory and some threats of set theory, which provides universe and semantics more relevant than the set-theoretic ones, and the topological structure of definable sets.
Cut Elimination in Categories
Preface. Introduction. 1. Categories. 2. Functors. 3. Natural Transformations. 4. Adjunctions. 5. Comonads. 6. Cartesian Categories. Conclusion. References. Index.
Bicategories in algebra and linguistics
  • Artificial Intelligence
  • 2004
in: A
  • Lecomte et al., (eds), Logical Aspects of Computational Linguistics, Springer, LNAI 1582, pp. 1-27,
  • 1999
Cut elimination for the Lambek calculus of adjoints
  • 2002