Using Higher-Order Logic Programming for Semantic Interpretation of Coordinate Constructs
<|reference_start|>Using Higher-Order Logic Programming for Semantic Interpretation of Coordinate Constructs: 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.<|reference_end|>
@article{kulick1995using,
    title={Using Higher-Order Logic Programming for Semantic Interpretation of
  Coordinate Constructs},
    author={Seth Kulick (University of Pennsylvania)},
    journal={arXiv preprint arXiv:cmp-lg/9506004},
    year={1995},
    archivePrefix={arXiv},
    eprint={cmp-lg/9506004},
    primaryClass={cmp-lg cs.CL}
}