, Volume 4, Issue 1, pp 21–39 | Cite as

Type Grammars as Pregroups

  • Joachim Lambek


Artificial Intelligence Mathematical Logic Computational Linguistic Theoretical Language Type Grammar 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Buszkowski, W. Generative capacity of nonassociative Lambek calculus, Bulletin of the Polish Academy of Sciences (Mathematics), 34: 507–516, 1986.Google Scholar
  2. Kandulski, M. The equivalence of nonassociative Lambek categorial grammars and context-free grammars, Zeitschrift für mathematische Logik and Grundlagen der Mathematik, 34: 41–52, 1988.Google Scholar
  3. Lambek, J. Type grammar revisited. In A. Lecomte, F. Lamarche and G. Perrier, editors, Logical Aspects of Computational Linguistics, 1–27, Springer LNAI 1582, 1999.Google Scholar
  4. McCawley, J.D. The Syntactic Phenomena of English, vol. 2, The University of Chicago Press, Chicago, 1988.Google Scholar

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Joachim Lambek
    • 1
  1. 1.Department of MathematicsMcGill UniversityMontréalCanada

Personalised recommendations