Using Higher-Order Logic Programming for Semantic Interpretation of Coordinate Constructs
| dc.creator | Kulick, Seth | |
| dc.date | 1995-06-06 | |
| dc.date.accessioned | 2026-07-07T09:09:54Z | |
| dc.date.available | 2026-07-07T09:09:54Z | |
| dc.description | Many theories of semantic interpretation use lambda-term manipulation to compositionally compute the meaning of a sentence. These theories are usually implemented in a language such as Prolog that can simulate lambda-term operations with first-order unification. However, for some interesting cases, such as a Combinatory Categorial Grammar account of coordination constructs, this can only be done by obscuring the underlying linguistic theory with the ``tricks'' needed for implementation. This paper shows how the use of abstract syntax permitted by higher-order logic programming allows an elegant implementation of the semantics of Combinatory Categorial Grammar, including its handling of coordination constructs. | |
| dc.description | 7 pages, ACL-95, uses aclap.sty | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9506004 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9506004 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151201 | |
| dc.subject | Computation and Language | |
| dc.title | Using Higher-Order Logic Programming for Semantic Interpretation of Coordinate Constructs | |
| dc.type | text |