Types as graphs: Continuations in type logical grammar

DOI10.1007/s10849-006-0541-6zbMath1162.68716MaRDI QIDQ1006443

Chung-Chieh Shan, Chris Barker

Publication date: 24 March 2009

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10849-006-0541-6

zbMATH Keywords

quantification; type-logical grammar; binding; continuations; staging; resource sensitivity; superiority; delimited continuations; evaluation order; polarity licensing

Mathematics Subject Classification ID

68N15: Theory of programming languages

03B65: Logic of natural languages

68T50: Natural language processing

Related Items

Symmetric categorial grammar, Optionality, scope, and licensing: An application of partially ordered categories

Cites Work

• The lambda calculus, its syntax and semantics
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Revised report on the algorithmic language scheme
• A generalization of jumps and labels
• Definitional interpreters for higher-order programming languages
• Quantifiers, anaphora, and intensionality
• Ways of scope taking
• Display logic
• Untersuchungen über das logische Schliessen. I
• Proof nets for the multimodal Lambek calculus
• Anaphora and type logical grammar
• Environment classifiers
• Weaving a web
• The Mathematics of Sentence Structure
• The Zipper
• Generalized Quantifiers in Declarative and Interrogative Sentences
• Welfare Economics and Robinson Crusoe the Producer
• Über das Verhältnis zwischen intuitionistischer und klassischer Arithmetik
• Dynamic predicate logic
• The next 700 programming languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item