Constraint Categorial Grammars
<|reference_start|>Constraint Categorial Grammars: Although unification can be used to implement a weak form of $\beta$-reduction, several linguistic phenomena are better handled by using some form of $\lambda$-calculus. In this paper we present a higher order feature description calculus based on a typed $\lambda$-calculus. We show how the techniques used in \CLG for resolving complex feature constraints can be efficiently extended. \CCLG is a simple formalism, based on categorial grammars, designed to test the practical feasibility of such a calculus.<|reference_end|>
@article{damas1995constraint,
    title={Constraint Categorial Grammars},
    author={Luis Damas, Nelma Moreira},
    journal={arXiv preprint arXiv:cmp-lg/9507001},
    year={1995},
    archivePrefix={arXiv},
    eprint={cmp-lg/9507001},
    primaryClass={cmp-lg cs.CL}
}