Constraint Categorial Grammars
Abstract
Although unification can be used to implement a weak form of β-reduction, several linguistic phenomena are better handled by using some form of λ-calculus. In this paper we present a higher order feature description calculus based on a typed λ-calculus. We show how the techniques used in for resolving complex feature constraints can be efficiently extended. is a simple formalism, based on categorial grammars, designed to test the practical feasibility of such a calculus.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.