Constraint Categorial Grammars
| dc.creator | Damas, Luis | |
| dc.creator | Moreira, Nelma | |
| dc.date | 1995-07-04 | |
| dc.date.accessioned | 2026-07-07T09:09:56Z | |
| dc.date.available | 2026-07-07T09:09:56Z | |
| dc.description | 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 \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. | |
| dc.description | 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 , 1995 | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9507001 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9507001 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151216 | |
| dc.subject | Computation and Language | |
| dc.title | Constraint Categorial Grammars | |
| dc.type | text |