<?xml version="1.0" standalone="yes"?>
<Paper uid="C96-2109">
  <Title>An Evaluation Semantics for DATR Theories</Title>
  <Section position="9" start_page="649" end_page="649" type="concl">
    <SectionTitle>
7 Conclusions
</SectionTitle>
    <Paragraph position="0"> The evaluation semantics presented in this paper constitutes the first fully worked out,, formal system of inference, for DATR theories. This fulfills one of the original objectives of the DATR programme, as set out in (Evans and Gazdar, 1989a; Evans and Gazdar, 1989b), to provide the language with an explMt theory of inference. The inference rules provides a clear picture of the way in which the different constructs of the language work, and should serve as a foundation for future investigations of the mathematical and computational properties of DATR. Although the rules abstract away from particular impleInentational details such as order of evaluation, they can be rea&amp; ily understood in computational terms and may prove useful as a guide to the construction of practical DATR interpreters.</Paragraph>
  </Section>
class="xml-element"></Paper>