<?xml version="1.0" standalone="yes"?>
<Paper uid="C90-3052">
  <Title>Typed Unification Grammars</Title>
  <Section position="8" start_page="295" end_page="295" type="concl">
    <SectionTitle>
6 Conelusion
</SectionTitle>
    <Paragraph position="0"> 'I'he main characteristics of the formalism we pre-s(.nted are (1, type inheritance which provides a clean way of itetining classes and subclasses of ob-.</Paragraph>
    <Paragraph position="1"> jects, and (2) an evaluation mechanism based on typed unitication which provides a very powerful and semantically (:lear means of specifying and cornputirlg relations between classes of objects.</Paragraph>
    <Paragraph position="2"> 'lThe possibility of defining types as (conditional) ex= pressions of typed FSs encourages a very different approach to grammar specification than integrated CF based approaches like DCG or LFG: the grammar writer has to deline the set of linguistic objects relevant for the problem, define the possible relations between these objects, and specify explicitly the constraints between objects and relations.</Paragraph>
    <Paragraph position="3"> The TFS system has been implemented in Common-Lisp and has been tested on Symbolics, TI Explorer, VAX and Allegro Common-Lisp. Sample grammars have been developed(\[6\], \[18\]) in order to demonstrate the feasibility of the approach.</Paragraph>
  </Section>
class="xml-element"></Paper>