<?xml version="1.0" standalone="yes"?>
<Paper uid="P91-1010">
  <Title>TYPE-RAISING AND DIRECTIONALITY IN COMBINATORY GRAMMAR*</Title>
  <Section position="6" start_page="73" end_page="73" type="concl">
    <SectionTitle>
CONCLUSION
</SectionTitle>
    <Paragraph position="0"> We can now safely revert to the original CCG nota- null parser/rccogniscr, using &amp;quot;difference list&amp;quot;-encoding of string position (el. \[41, \[31).</Paragraph>
    <Paragraph position="1"> tion described in the preliminaries to the paper, modified only by the introduction of the general order-preserving type raising rule (26), having established the following results. First, the earlier claims concerning word-order universals follow fTom first principles in a unification-based CCG in which directionality is an attribute of arguments, grounded out in string position. The Principles of Consistency and Inheritance follow as theorems, rather than stipulations. A single general-purpose order-preserving type-raised category can be assigned to arguments, simplifying the grammar and the parser.</Paragraph>
  </Section>
class="xml-element"></Paper>