Types as Graphs: Continuations in Type Logical Grammar

Authors:
Chris Barker;Chung-Chieh Shan
Affiliations:
Department of Linguistics, University of California, San Diego, USA;Department of Computer Science and Center for Cognitive Science, The State University of New Jersey, Rutgers
Venue:
Journal of Logic, Language and Information
Year:
2006

Citing 0
Cited 9

Optionality, Scope, and Licensing: An Application of Partially Ordered Categories

Journal of Logic, Language and Information
Continuation semantics for the Lambek--Grishin calculus

Information and Computation
Continuation semantics for symmetric categorial grammar

WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
A substructural type system for delimited continuations

TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Delimited continuations in operating systems

CONTEXT'07 Proceedings of the 6th international and interdisciplinary conference on Modeling and using context
Inverse scope as metalinguistic quotation in operational semantics

JSAI'07 Proceedings of the 2007 conference on New frontiers in artificial intelligence
A multimodal type logical grammar analysis of Japanese: word order and quantifier scope

JSAI'07 Proceedings of the 2007 conference on New frontiers in artificial intelligence
Representing covert movements by delimited continuations

JSAI-isAI'09 Proceedings of the 2009 international conference on New frontiers in artificial intelligence
Semantically Restricted Argument Dependencies

Journal of Logic, Language and Information

Quantified Score

Hi-index	0.01

Visualization

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.