The constraint language for lambda structures

Journal of Logic, Language and Information 10 (4):457-485 (2001)
  Copy   BIBTEX

Abstract

This paper presents the Constraint Language for Lambda Structures(CLLS), a first-order language for semantic underspecification thatconservatively extends dominance constraints. It is interpreted overlambda structures, tree-like structures that encode -terms. Based onCLLS, we present an underspecified, uniform analysis of scope,ellipsis, anaphora, and their interactions. CLLS solves a variablecapturing problem that is omnipresent in scope underspecification andcan be processed efficiently.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,752

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Representing law in partial information structures.Niels Peek - 1997 - Artificial Intelligence and Law 5 (4):263-290.
On regular reduced products.Juliette Kennedy & Saharon Shelah - 2002 - Journal of Symbolic Logic 67 (3):1169-1177.
A rational reconstruction of the domain of feature structures.M. Andrew Moshier - 1995 - Journal of Logic, Language and Information 4 (2):111-143.
Expression, thought, and language.Henry Jackman - 2003 - Philosophia 31 (1-2):33-54.
New directions in type-theoretic grammars.Reinhard Muskens - 2010 - Journal of Logic, Language and Information 19 (2):129-136.
More on Regular Reduced Products.Juliette Cara Kennedy & Saharon Shelah - 2004 - Journal of Symbolic Logic 69 (4):1261 - 1266.
Stationary sets and infinitary logic.Saharon Shelah & Jouko Väänänen - 2000 - Journal of Symbolic Logic 65 (3):1311-1320.

Analytics

Added to PP
2009-01-28

Downloads
37 (#429,504)

6 months
4 (#778,909)

Historical graph of downloads
How can I increase my downloads?