{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:35Z","timestamp":1761611195897},"reference-count":14,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2007,4,1]],"date-time":"2007-04-01T00:00:00Z","timestamp":1175385600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2007,4]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1017\/s0960129506005901","type":"journal-article","created":{"date-parts":[[2007,1,18]],"date-time":"2007-01-18T09:58:38Z","timestamp":1169114318000},"page":"309-340","source":"Crossref","is-referenced-by-count":25,"title":["Free compact 2-categories"],"prefix":"10.1017","volume":"17","author":[{"given":"ANNE","family":"PRELLER","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JOACHIM","family":"LAMBEK","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2007,4,1]]},"reference":[{"key":"S0960129506005901_N10108","volume-title":"Papers in formal linguistics and logic","author":"Buszkowski","year":"2002"},{"key":"S0960129506005901_N100EB","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00089-2"},{"key":"S0960129506005901_N10201","doi-asserted-by":"crossref","unstructured":"Seely R. (1979) Weak adjointness in proof theory. In: Fourman, M. P., Mulvey, C. J. and Scott, D. S. (eds.) Applications of sheaves. Springer-Verlag Lecture Notes in Mathematics 753 697\u2013710.","DOI":"10.1007\/BFb0061840"},{"key":"S0960129506005901_N100C9","doi-asserted-by":"crossref","unstructured":"Altenkirch T. , Hofman M. and Streicher T. (1995) Categorical reconstruction of a reduction-free normalization proof. In: Pitt, D., Rydeheard, D. E. and Johnstone, P. (eds.) Category Theory and Computer Science. Springer-Verlag Lecture Notes in Computer Science 953 182\u2013199.","DOI":"10.1007\/3-540-60164-3_27"},{"key":"S0960129506005901_N1011F","doi-asserted-by":"crossref","unstructured":"Degeilh S. and Preller A. (2005) Efficiency of pregroups and the French noun phrase. JoLLI.","DOI":"10.1007\/s10849-005-1242-2"},{"key":"S0960129506005901_N101ED","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"S0960129506005901_N1014E","unstructured":"Do\u0161en K. (2002) Simplicial Endomorphisms, Mathematical Institute, SANU (available at http:\/\/arXiv.org\/math.GT\/0301302)."},{"key":"S0960129506005901_N10174","volume-title":"Automata, Languages and Machines","author":"Eilenberg","year":"1972"},{"key":"S0960129506005901_N1018C","volume-title":"Automata, Languages and Machines","author":"Eilenberg","year":"1976"},{"key":"S0960129506005901_N101A4","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(80)90101-2"},{"key":"S0960129506005901_N101C1","doi-asserted-by":"crossref","unstructured":"Lambek J. (1999) Type Grammar revisited. In: Lecomte, A. Lecomte, A., Lamarche, F. and Perrier, G. (eds.) Logical Aspects of Computational Linguistics. Springer-Verlag Lecture Notes in Artificial Intelligence 1582 1\u201327.","DOI":"10.1007\/3-540-48975-4_1"},{"key":"S0960129506005901_N101D7","doi-asserted-by":"crossref","unstructured":"Lambek J. (2004) Bicategories in algebra and linguistics. In: Ehrhard, T., Girard, J.-Y., Ruet, P. and Scott, P. (eds.) Linear logic in computer science, London Mathematical Society Lecture Note Series 316, Cambridge University Press.","DOI":"10.1017\/CBO9780511550850.010"},{"key":"S0960129506005901_N10160","unstructured":"Do\u0161en K. and Petri\u0107 Z. (2004) Proof theoretical coherence, Preprint of Mathematical Institute of the Serbian Academy of Sciences and Arts, Belgrade."},{"key":"S0960129506005901_N10137","volume-title":"Trends in Logic","author":"Do\u0161en","year":"1999"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129506005901","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T20:48:20Z","timestamp":1556052500000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129506005901\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,4]]}},"alternative-id":["S0960129506005901"],"URL":"https:\/\/doi.org\/10.1017\/s0960129506005901","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,4]]}}}