2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/151216Although 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 \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.12 pages, 5 Postscript figures, uses llncs.sty and epsfig.sty. To appear in Proceedings of EPIA'95, 7th Portuguese Conference on Artificial Intelligence, Funchal- Madeira Island, Portugal 3-6 October , 1995Computation and Languagetext