<?xml version="1.0" standalone="yes"?>
<Paper uid="P95-1029">
  <Title>Using Higher-Order Logic Programming for Semantic Interpretation of Coordinate Constructs</Title>
  <Section position="8" start_page="217" end_page="217" type="concl">
    <SectionTitle>
5 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have shown how higher-order logic programming can be used to elegantly implement the semantic theory of CCG, including the previously difficult case of its handling of coordination constructs. The techniques used here should allow similar advantages for a variety of such theories.</Paragraph>
    <Paragraph position="1"> An argument can be made that the approach taken here relies on a formalism that entails implementation issues that are more difficult than for the other solutions and inherently not as efficient.</Paragraph>
    <Paragraph position="2"> However, the implementation issues, although more complex, are also well-understood and it can be expected that future work will bring further improvements. For example, it is a straightforward matter to transform the ,XProlog code into a logic called L~ (Miller, 1990) which requires only a restricted form of unification that is decidable in linear time and space. Also, the declarative nature of ~Prolog programs opens up the possibility for applications of program transformations such as partial evaluation.</Paragraph>
  </Section>
class="xml-element"></Paper>