<?xml version="1.0" standalone="yes"?>
<Paper uid="C00-1016">
  <Title>Binding Constraints as Instructions of Binding Machines</Title>
  <Section position="5" start_page="108" end_page="108" type="ackno">
    <SectionTitle>
Acknowledgements
</SectionTitle>
    <Paragraph position="0"> I am grateful to Hans Uszkoreit for patient advice and criticism. My thanks go also to Mark Johnson for helpful discussion.</Paragraph>
    <Paragraph position="1">  These constraints are defined on the basis of some auxiliary notions. The notion of local domain involves the partition of sentences and associated grammatical geometry into two zones of greater or less structural proximity with respect to the anaphor. O-command is a partial order under which, in a clause, Subjects o-command Direct Objects, Direct Objects o-command Indirect Objects, and so on, following the usual obliqueness hierarchy of grammatical functions, being that in a multiclausal sentence, the upstairs arguments o-command the embedded arguments, etc. The notion of o-binding is such that x o-binds y iff x o..commands y and x and 3' are coindexed, where coindexation is meant to represent anaphoric links.</Paragraph>
  </Section>
class="xml-element"></Paper>