Types as graphs: Continuations in type logical grammar

Chris Barker; Chung Chieh Shan

doi:10.1007/s10849-006-0541-6

Types as graphs: Continuations in type logical grammar

Chris Barker, Chung Chieh Shan

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.1007/s10849-006-0541-6
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

Access to Document

10.1007/s10849-006-0541-6

Cite this

@article{07bf7b34ecac4586a165393182b57618,

title = "Types as graphs: Continuations in type logical grammar",

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.",

keywords = "Binding, Continuations, Delimited continuations, Evaluation order, Polarity licensing, Quantification, Resource sensitivity, Staging, Superiority, Type-logical grammar",

author = "Chris Barker and Shan, {Chung Chieh}",

note = "Funding Information: We would not have undertaken this project without the encouragement of Bob Carpenter and David Dowty. Nor would we have gotten anywhere without many patient explanations from Philippe de Groote, the topological insights of Dylan Thurston, and Richard Moot{\textquoteright}s theorem prover for multimodal TLG analysis, made accessible through Dick Oehrle{\textquoteright}s web interface. We also gratefully acknowledge comments and suggestions from David Dowty, Gerhard J{\"a}ger, and Richard Moot. The second author performed this research while at Harvard University, supported by the United States National Science Foundation Grant BCS-0236592.",

year = "2006",

month = nov,

doi = "10.1007/s10849-006-0541-6",

language = "English (US)",

volume = "15",

pages = "331--370",

journal = "Journal of Logic, Language and Information",

issn = "0925-8531",

publisher = "Springer Netherlands",

number = "4",

}

TY - JOUR

T1 - Types as graphs

T2 - Continuations in type logical grammar

AU - Barker, Chris

AU - Shan, Chung Chieh

N1 - Funding Information: We would not have undertaken this project without the encouragement of Bob Carpenter and David Dowty. Nor would we have gotten anywhere without many patient explanations from Philippe de Groote, the topological insights of Dylan Thurston, and Richard Moot’s theorem prover for multimodal TLG analysis, made accessible through Dick Oehrle’s web interface. We also gratefully acknowledge comments and suggestions from David Dowty, Gerhard Jäger, and Richard Moot. The second author performed this research while at Harvard University, supported by the United States National Science Foundation Grant BCS-0236592.

PY - 2006/11

Y1 - 2006/11

N2 - 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.

AB - 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.

KW - Binding

KW - Continuations

KW - Delimited continuations

KW - Evaluation order

KW - Polarity licensing

KW - Quantification

KW - Resource sensitivity

KW - Staging

KW - Superiority

KW - Type-logical grammar

UR - http://www.scopus.com/inward/record.url?scp=33751510942&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33751510942&partnerID=8YFLogxK

U2 - 10.1007/s10849-006-0541-6

DO - 10.1007/s10849-006-0541-6

M3 - Article

AN - SCOPUS:33751510942

SN - 0925-8531

VL - 15

SP - 331

EP - 370

JO - Journal of Logic, Language and Information

JF - Journal of Logic, Language and Information

IS - 4

ER -

Types as graphs: Continuations in type logical grammar

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this