Abstract
Using the programming-language concept of continuations, we propose a new, multimodal analysis of quantification in Type Logical Grammar. Our approach provides a geometric view of in-situ quantification in terms of graphs, and motivates the limited use of empty antecedents in derivations. Just as continuations are the tool of choice for reasoning about evaluation order and side effects in programming languages, our system provides a principled, type-logical way to model evaluation order and side effects in natural language. We illustrate with an improved account of quantificational binding, weak crossover, wh-questions, superiority, and polarity licensing.
Original language | English (US) |
---|---|
Pages (from-to) | 331-370 |
Number of pages | 40 |
Journal | Journal of Logic, Language and Information |
Volume | 15 |
Issue number | 4 |
DOIs | |
State | Published - Nov 2006 |
Keywords
- Binding
- Continuations
- Delimited continuations
- Evaluation order
- Polarity licensing
- Quantification
- Resource sensitivity
- Staging
- Superiority
- Type-logical grammar
ASJC Scopus subject areas
- Computer Science (miscellaneous)
- Philosophy
- Linguistics and Language