<?xml version="1.0" standalone="yes"?>
<Paper uid="C94-2144">
  <Title>amp;quot;YD/2---A Type Description Language for Constraint-Based Grammars</Title>
  <Section position="4" start_page="0" end_page="0" type="intro">
    <SectionTitle>
* I,~FFI('IENT I'I{,OCI,'SSIN(I
</SectionTitle>
    <Paragraph position="0"> Certain I,yl)e eonsLrainl,s (;all I)e (:ompih~d iltl,o el: ficient represenl,al;ious like. bit veeLors \[I\], where a (l\[,l/ (grcgd;esL h)wer bOUlld), L \[Jl~, (leaM; Ul)p(~r I),mnd), or a, ~ (Lyl,e s,d)SUml)liot 0 eOmlml;m, iot~ reduces to low-h'vel bit Inanilmlatio,i ; see Seel,iou 3.2. Moreover, types release mltyt)ed uniliei~tio.</Paragraph>
    <Paragraph position="1"> fi'om eXlmnSive COmlmI.M;iou through lhe i)ossi bility to declare them incoml)al;ilde, lu iuhligi(m, working with t.yf)e ua.mes only or with partiMly expanded l;ypes minimizes the costs of copying sl, ruet;ures during processing. 'Phis can only be a.ccomplished i\[' the sysLent m~ukes at Uleeh;LILiSln for type exlmnsion available; see Se(:l,ion ;L4.</Paragraph>
  </Section>
class="xml-element"></Paper>