Skip to main content
Log in

Explaining Crossover and Superiority as Left-to-right Evaluation

  • Published:
Linguistics and Philosophy Aims and scope Submit manuscript

Abstract

We present a general theory of scope and binding in which both crossover and superiority violations are ruled out by one key assumption: that natural language expressions are normally evaluated (processed) from left to right. Our theory is an extension of Shan’s (2002) account of multiple-wh questions, combining continuations (Barker, 2002) and dynamic type-shifting. Like other continuation-based analyses, but unlike most other treatments of crossover or superiority, our analysis is directly compositional (in the sense of, e.g., Jacobson, 1999). In particular, it does not postulate a level of Logical Form or any other representation distinct from surface syntax. One advantage of using continuations is that they are the standard tool for modeling order-of-evaluation in programming languages. This provides us with a natural and independently motivated characterization of what it means to evaluate expressions from left to right. We give a combinatory categorial grammar that models the syntax and the semantics of quantifier scope and wh-question formation. It allows quantificational binding but not crossover, in-situ wh but not superiority violations. In addition, the analysis automatically accounts for a variety of sentence types involving binding in the presence of pied piping, including reconstruction cases such as Whose criticism of his i mother did each person i resent?

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • C. Barker (2002) ArticleTitle‘Continuations and the Nature of Quantification’ Natural Language Semantics 10 IssueID3 211–242 Occurrence Handle10.1023/A:1022183511876

    Article  Google Scholar 

  • Barker, C. 2004, ‘Continuations in Natural Language’, in Hayo Thielecke (ed.), CW’04: Proceedings of the 4th ACM SIGPLAN Continuations Workshop, pp. 1–11. Tech. Rep. CSR-04-1, School of Computer Science, University of Birmingham.

  • C. Barker (2005) ArticleTitle‘Remark on Jacobson 1999: Crossover as a Local Constraint’ Linguistics and Philosophy 4 447–472 Occurrence Handle10.1007/s10988-004-5327-1

    Article  Google Scholar 

  • Barker, C. and C.-C. Shan in press, ‘Types as Graphs: Continuations in Type Logical Grammar’, Journal of Logic, Language and Information.

  • Bresnan, J. 1994, ‘Linear Order vs. Syntactic Rank: Evidence from Weak Crossover’, in CLS 30-1: The Main Session. Chicago Linguistic Society.

  • J. Bresnan (1998) ‘Morphology Competes with Syntax: Explaining Typological Variation in Weak Crossover Effects’ P. Barbosa D. Fox P. Hagstrom M. McGinnis D. Pesetsky (Eds) Is the Best Good Enough? Optimality and Competition in Syntax MIT Press Cambridge 59–92

    Google Scholar 

  • D. Büring (2001) ‘A Situation Semantics for Binding out of DP R. Hastings B. Jackson Z. Zvolensky (Eds) SALT XI: Semantics and Linguistic Theory Cornell University Press Ithaca 56–75

    Google Scholar 

  • D. Büring (2004) ArticleTitle‘Crossover Situations’ Natural Language Semantics 12 IssueID1 23–62 Occurrence Handle10.1023/B:NALS.0000011144.81075.a8

    Article  Google Scholar 

  • Chierchia G. (1991), ‘Functional WH and Weak crossover’. In: Bates, D. (eds). Proceedings of the 10th West Coast Conference on Formal Linguistics, pp. 75–90. Center for the Study of Language and Information, Stanford, CA.

  • G. Chierchia (1993) ArticleTitle‘Questions with Quantifiers’ Natural Language Semantics 1 IssueID2 181–234 Occurrence Handle10.1007/BF00372562

    Article  Google Scholar 

  • G. Chierchia (1995) The Dynamics of Meaning: Anaphora, Presupposition, and the Theory of Grammar University of Chicago Press Chicago

    Google Scholar 

  • N. Chomsky (1973) ‘Conditions on Transformations’ S. Anderson P. Kiparsky (Eds) A Festschrift for Morris Halle Holt, Rinehart and Winstron New York 232–286

    Google Scholar 

  • Danvy, O. and A. Filinski: 1989, ‘A Functional Abstraction of Typed Contexts’. Tech. Rep. 89/12, DIKU, University of Copenhagen, Denmark. http://www.daimi.au.dk/~danvy/Papers/fatc.ps.gz.

  • Danvy, O. 1990, ‘Abstracting Control’, in Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, pp. 151–160. ACM Press, New York.

  • O. Danvy (1992) ArticleTitle‘Representing Control: A Study of the CPS Transformation’ Mathematical Structures in Computer Science 2 IssueID4 361–391 Occurrence Handle10.1017/S0960129500001535

    Article  Google Scholar 

  • V. Dayal (1996) Locality in WH Quantification: Questions and Relative Clauses in Hindi Kluwer Dordrecht

    Google Scholar 

  • V. Dayal (2003) ‘Multiple WH Questions’ M. Everaert H.C. Riemsdijk Particlevan (Eds) The Blackwell Companion to Syntax Blackwell Oxford

    Google Scholar 

  • Dowty, D.: 1991, ‘Variable-free’ Syntax, Variable-Binding Syntax, the Natural Deduction Lambek Calculus, and the Crossover Constraint, in J. Mead. (ed.), Proceedings of the 11th West Coast Conference on Formal Linguistics, Center for the Study of Language and Information, Stanford, CA.

  • Felleisen, M. 1987, ‘The Calculi of λ v -CS Conversion: A Syntactic Theory of Control and State in Imperative Higher-order Programming Languages’, Ph.D. thesis, Computer Science Department, Indiana University. Also as Tech. Rep. 226.

  • Felleisen, M. 1988, ‘The Theory and Practice of First-Class Prompts’, in POPL ’88: Conference Record of the Annual ACM Symposium on Principles of Programming Languages, pp. 180–190. ACM Press, New York.

  • Griffin, T. G. 1990, ‘A Formulae-as-Types Notion of Control’, in POPL ’90: Conference Record of the Annual ACM Symposium on Principles of Programming Languages, pp. 47–58. ACM Press, New York.

  • de Groote, P. 2001, ‘Type Raising, Continuations, and Classical Logic’, in Robert van Rooy and Martin Stokhof, (eds.), Proceedings of the 13th Amsterdam Colloquium, pp. 97–101. Institute for Logic, Language and Computation, Universiteit van Amsterdam.

  • I. Heim A. Kratzer (1998) Semantics in Generative Grammar Blackwell Oxford

    Google Scholar 

  • Hendriks, H. 1993, ‘Studied Flexibility: Categories and Types in Syntax and Semantics’, Ph.D. thesis, Institute for Logic, Language and Computation, Universiteit van Amsterdam.

  • J. Higginbotham (1980) ArticleTitle‘Pronouns and Bound Variables’ Linguistic Inquiry 11 679–708

    Google Scholar 

  • J.R. Hindley J.P. Seldin (1986) Introduction to Combinators and λ-Calculus Cambridge University Press Cambridge

    Google Scholar 

  • N. Hornstein (1995) Logical Form: From GB to Minimalism Blackwell Oxford

    Google Scholar 

  • P. Jacobson (1999) ArticleTitle‘Towards a Variable-Free Semantics’ Linguistics and Philosophy 22 IssueID2 117–184 Occurrence Handle10.1023/A:1005464228727

    Article  Google Scholar 

  • Jäger, G. 2001, ‘Anaphora and Type Logical Grammar’, Habilitationsschrift, Humboldt University Berlin. UIL-OTS Working Papers 01004-CL/TL, Utrecht Institute of Linguistics (OTS), Utrecht University.

  • S. Kuno J.J. Robinson (1972) ArticleTitle‘Multiple wh Questions’ Linguistic Inquiry 3 463–487

    Google Scholar 

  • H. Lasnik T. Stowell (1991) ArticleTitle‘Weakest Crossover’ Linguistic Inquiry 22 687–720

    Google Scholar 

  • R. May (1985) Logical Form: Its Structure and Derivation MIT Press Cambridge

    Google Scholar 

  • A.R. Meyer M. Wand (1985) ‘Continuation Semantics in Typed Lambda-Calculi (summary) R. Parikh (Eds) Logics of programs Springer-Verlag Berlin 219–224

    Google Scholar 

  • M. Moortgat (1997) ‘Categorial Type Logics’ J.F.A.K. Benthem Particlevan A.G.B. ter Meulen (Eds) Handbook of Logic and Language Elsevier Science Amsterdam

    Google Scholar 

  • J. O’Neil (1993) ‘A unified Analysis of Superiority, Crossover, and Scope’ H. Thráinsson S.D. Epstein S. Kuno (Eds) Harvard working papers in linguistics Harvard University Cambridge 128–136

    Google Scholar 

  • N.S. Papaspyrou (1998) ‘Denotational Semantics of Evaluation Order in Expressions with Side Effects’ N.E. Mastorakis (Eds) Recent Advances in Information Science and Technology: 2nd part of the Proceedings of the 2nd IMACS International Conference on Circuits, Systems and Computers World Scientific Singapore 87–94

    Google Scholar 

  • M. Parigot (1992) ‘λ μ-Calculus: An Algorithmic Interpretation of Classical Natural Deduction’ A. Voronkov (Eds) Proceedings of LPAR ’92: International Conference on Logic Programming and Automated Reasoning. Springer-Verlag Berlin 190–201

    Google Scholar 

  • M. Parigot (1993) ‘Classical Proofs as Programs’ G. Gottlob A. Leitsch D. Mundici (Eds) Proceedings of KGC’93: Computational Logic and Proof Theory, 3rd Kurt Gödel Colloquium Springer-Verlag Berlin 263–276

    Google Scholar 

  • B.H. Partee (1987) ‘Noun Phrase Interpretation and Type-Shifting Principles’ J. Groenendijk D. Jongh Particlede M. Stokhof (Eds) Studies in Discourse Representation Theory and the Theory of Generalized Quantifiers Groningen-Amsterdam Studies in Semantics 8 Foris, Dordrecht 115–143

    Google Scholar 

  • B.H. Partee Mats Rooth (1983) ‘Generalized Conjunction and Type Ambiguity’ R. Bäuerle C. Schwarze A. Stechow Particlevon (Eds) Meaning, Use and Interpretation of Language de Gruyter Berlin 361–383

    Google Scholar 

  • D. Pesetsky (1987) ‘Wh-In-situ: Movement and Unselective Binding’ E.J. Reuland A.G.B. ter Meulen (Eds) The Representation of (In) Definiteness MIT Press Cambridge

    Google Scholar 

  • C. Phillips (2003) ArticleTitle‘Linear Order and Constituency’ Linguistic Inquiry 34 IssueID1 37–90 Occurrence Handle10.1162/002438903763255922

    Article  Google Scholar 

  • G.D. Plotkin (1975) ArticleTitle‘Call-by-Name, Call-by-Value and the λ-Calculus’ Theoretical Computer Science 1 IssueID2 125–159 Occurrence Handle10.1016/0304-3975(75)90017-1

    Article  Google Scholar 

  • P.M. Postal (1971) Cross-over Phenomena Holt, Rinehart and Winston New York

    Google Scholar 

  • P.M. Postal (1993) ArticleTitle‘Remarks on Weak Crossover Effects’ Linguistic Inquiry 24 539–556

    Google Scholar 

  • C. Potts (2001) ArticleTitle‘(Only) Some Crossover Effects Repaired’ Snippets 3 13–14

    Google Scholar 

  • T. Reinhart (1983) Anaphora and Semantic Interpretation Croom Helm London

    Google Scholar 

  • E.G. Ruys (2000) ArticleTitle‘Weak Crossover as a Scope Phenomenon’ Linguistic Inquiry 31 IssueID3 513–539 Occurrence Handle10.1162/002438900554424

    Article  Google Scholar 

  • Chung-chieh Shan (2002) ‘A Continuation Semantics of Interrogatives that Accounts for Baker’s Ambiguity’ B. Jackson (Eds) SALT XII: Semantics and Linguistic Theory Cornell University Press Ithaca 246–265

    Google Scholar 

  • D. Sitaram M. Flleisen (1990) ArticleTitle‘Control Delimiters and Their Hierarchies Lisp and Symbolic Computation 3 IssueID1 67–99 Occurrence Handle10.1007/BF01806126

    Article  Google Scholar 

  • M. Steedman (2000) ‘The Syntactic Process’ MIT Press Cambridge

    Google Scholar 

  • Sternefeld, W. 1997, ‘The Semantics of Reconstruction and Connectivity’, Arbeitspapiere des SFB 340 97, Universität Stuttgart and Tübingen.

  • M.K. Tanenhaus S.M. Garnsey J. Boland (1990) ‘Combinatory Lexical Information and Language Comprehension’ G.T.M. Altmann (Eds) Cognitive Models of Speech Processing: Psycholinguistic and Computational Perspectives MIT Press Cambridge 383–408

    Google Scholar 

  • P.L. Wadler (1992) ArticleTitle‘Comprehending Monads’ Mathematical Structures in Computer Science 2 IssueID4 461–493

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chung-Chieh Shan.

Additional information

Thanks to Daniel Büring, Svetlana Godjevac, Pauline Jacobson, Gerhard Jäger, Chris Potts, Ivan Sag, Philippe Schlenker, Stuart Shieber, and our anonymous referees. We also profited greatly from discussions with audiences at: the Brown Workshop on Direct Compositionality; Rutgers; NYU; and at the 2004 ESSLLI, the Workshop on Syntax, Semantics and Pragmatics of Questions, and the Workshop on Semantic Approaches to Binding. The first author was supported at Harvard University by National Science Foundation Grants IRI-9712068 and BCS-0236592.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shan, CC., Barker, C. Explaining Crossover and Superiority as Left-to-right Evaluation. Linguistics & Philosophy 29, 91–134 (2006). https://doi.org/10.1007/s10988-005-6580-7

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10988-005-6580-7

Keywords

Navigation