The idea behind type grammars (or categorial grammars) is to assign one or more types to each word in the dictionary, so that one can decide by a computation whether a string of words is a grammatical sentence. The types may be taken as elements of an algebra or as terms of a substructural logic. Some researchers have also begun to incorporate lattice (additive) operations to strengthen the generating power of the grammars, and others have looked at relations with Montague semantics, Chomsky's minimalist program, and general logical systems. This workshop gathers mathematical linguists from around the world to discuss the state of the art in type grammars and their role in mathematical linguistics.
Speakers |
So far the list of participants includes:
D. Bargelli (McGill)
R. Bernardi (Bolzano)
W. Buszkowski (Mickiewicz University)
K. Cardinal (McGill)
C. Casadio (Chieti)
C. Fox (Essex)
F. Lamarche (Nancy)
J. Lambek (McGill)
M. Moortgat (Utrecht)
G. Morrill (Barcelona)
R. Oehrle (Berkeley)
A. Preller (Montpellier)
Preliminary Program |
Organizer:
J.
Lambek
Contact Person:
P.J. Scott
Forms:
Workshop
Registration
Accommodations Registration
Workshops:
June 15-16: Quantum
June 17: Games
June 18-19: Linguistics
June 19-20: Concurrency
Related Events in Ottawa:
May 30-June 1: FMCS'03
June 2-20: Fields'03
June 21-27: LICS'03