A Computational Algebraic Approach to Latin Grammar

In the paper we present a type theoretic analysis of Latin grammar, which pays as much attention to inflectional morphology as to syntax. We assign different types to the finite forms of Latin verbs as well as to their infinitives. The rich repertory of agreement information exhibited by Latin is accounted for by a system of numerical indexes (superscripts and subscripts) attached to the types. Agreement coherence and control of sentencehood for strings of words is to be guaranteed by calculations performed on the corresponding strings of types, in accordance with the “pregroup” grammar developed as a refinement of classical bilinear logic (Lambek 1999, Casadio & Lambek 2002). KEY WORDS: type grammar, pregroup, formal analysis of natural language, Latin, computation