Advertisement

Continuation Hierarchy and Quantifier Scope

Chapter
Part of the Studies in Linguistics and Philosophy book series (SLAP)

Abstract

We present a directly compositional and type-directed analysis of quantifier ambiguity, scope islands, wide-scope indefinites and inverse linking. It is based on Danvy and Filinski’s continuation hierarchy, with deterministic semantic composition rules that are uniquely determined by the formation rules of the overt syntax. We thus obtain a compositional, uniform and parsimonious treatment of quantifiers in subject, object, embedded-NP and embedded-clause positions without resorting to Logical Forms, Cooper storage, type-shifting and other ad hoc mechanisms. To safely combine the continuation hierarchy with quantification, we give a precise logical meaning to often used informal devices such as picking a variable and binding it off. Type inference determines variable names, banishing “unbound traces”. Quantifier ambiguity arises in our analysis solely because quantifier words are polysemous, or come in several strengths. The continuation hierarchy lets us assign strengths to quantifiers, which determines their scope. Indefinites and universals differ in their scoping behavior because their lexical entries are assigned different strengths. PPs and embedded clauses, like the main clause, delimit the scope of embedded quantifiers. Unlike the main clause, their limit extends only up to a certain hierarchy level, letting higher-level quantifiers escape and take wider scope. This interplay of strength and islands accounts for the complex quantifier scope phenomena. We present an economical “direct style”, or continuation hierarchy on-demand, in which quantifier-free lexical entries and phrases keep their simple, unlifted types.

Keywords

Semantics Continuation semantics Quantifier scope Quantifier ambiguity Continuation hierarchy CPS Delimited continuation Direct compositionality 

Notes

Acknowledgments

We are very grateful to Chris Tancredi for many helpful suggestions and a thought-provoking conversation. We thank anonymous reviewers for their comments.

References

  1. Barker, C. (2002). Continuations and the nature of quantification. Natural Language Semantics, 10(3), 211–242.Google Scholar
  2. Barker, C., & Shan, C.-c. (2006). Types as graphs: Continuations in type logical grammar. Journal of Logic, Language and Information, 15(4), 331–370.Google Scholar
  3. Barker, C., & Shan, C.-c. (2008). Donkey anaphora is in-scope binding. Semantics and Pragmatics 1(1), 1–46.Google Scholar
  4. Bekki, D., & Asai, K. (2009). Representing covert movements by delimited continuations. Proceedings of the \(6{\text{ th }}\) International Workshop on Logic and Engineering of Natural Language Semantics, Japanese Society of, Artificial Intelligence (November 2009).Google Scholar
  5. Bernardi, R., & Moortgat, M. (2010). Continuation semantics for the Lambek-Grishin calculus. Information and Computation, 208(5), 397–416.CrossRefGoogle Scholar
  6. Champollion, L., Tauberer, J., & Romero, M. (2007). The Penn Lambda Calculator: Pedagogical software for natural language semantics. In T. H. King & E. M. Bender (Eds.), Proceedings of the Workshop on Grammar Engineering Across Frameworks (pp. 106–127). Stanford: CA, Center for the Study of Language and Information.Google Scholar
  7. Danvy, O., & Filinski, A. (1990). Abstracting control. Proceedings of the 1990 ACM Conference on Lisp and Functional Programming (pp. 151–160), New York, ACM Press (27–29 June 1990).Google Scholar
  8. de Groote, P. (2001). Type raising, continuations, and classical logic. In R. van Rooy & M. Stokhof (Eds.), Proceedings of the \(13{\text{ th }}\) Amsterdam Colloquium (pp. 97–101). Institute for Logic: Language and Computation, Universiteit van Amsterdam.Google Scholar
  9. Kameyama, Y., Kiselyov, O., & Shan, C.-c. (2011). Computational effects across generated binders: Maintaining future-stage lexical scope. Technical Report CS-TR-11-17, Department of Computer Science, Graduate School of Systems and Information Engineering, University of Tsukuba.Google Scholar
  10. Montague, R. (1974). The proper treatment of quantification in ordinary English. In R. H. Thomason (Ed.), Formal philosophy: Selected papers of Richard Montague (pp. 247–270). New Haven: Yale University Press.Google Scholar
  11. Partee, B. H., & Rooth, M. (1983). Generalized conjunction and type ambiguity. In R. Bäuerle, C. Schwarze, & A. von Stechow (Eds.), Meaning use and interpretation of language (pp. 361–383). Berlin: Walter de Gruyter.Google Scholar
  12. Reinhart, T. (1979). Syntactic domains for semantic rules. In F. Guenthner & S. J. Schmidt (Eds.), Formal semantics and pragmatics for natural languages (pp. 107–130). Dordrecht: Reidel.Google Scholar
  13. Rompf, T., Maier, I., & Odersky, M. (2009). Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform. In G. Hutton & A. P. Tolmach (Eds.), ICFP ’09: Proceedings of the ACM International Conference on Functional Programming (pp. 317–328). New York: ACM Press.Google Scholar
  14. Shan, C.-c. (2004). Delimited continuations in natural language: Quantification and polarity sensitivity. In H. Thielecke (Ed.), CW’04: Proceedings of the \(4{\text{ th }}\) ACM SIGPLAN Continuations Workshop (pp. 55–64). Number CSR-04-1 in Technical Report, School of Computer Science, University of Birmingham.Google Scholar
  15. Shan, C.-c. (2007a). Linguistic side effects. In C. Barker & P. Jacobson (Eds.). Direct compositionality (pp. 132–163). New York: Oxford University Press.Google Scholar
  16. Shan, C.-c. (2007b). Inverse scope as metalinguistic quotation in operational semantics. In: K. Yoshimoto (Ed.), Proceedings of the \(4{\text{ th }}\) International Workshop on Logic and Engineering of Natural Language Semantics (pp. 167–178), Japanese Society of Artificial Intelligence (18–19 June 2007).Google Scholar
  17. Szabolcsi, A. (2000). The syntax of scope. In M. Baltin & C. Collins (Eds.), Handbook of contemporary syntactic theory (pp. 607–634). Oxford: Blackwell.Google Scholar
  18. Szabolcsi, A. (2009). Quantification. Cambridge: Cambridge University Press.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2014

Authors and Affiliations

  1. 1.University of TsukubaTsukubaJapan
  2. 2.School of Informatics and ComputingIndiana UniversityBloomingtonUSA

Personalised recommendations