Please use this identifier to cite or link to this item: doi:10.22028/D291-25775
Title: The constraint language for lambda structures
Author(s): Egg, Markus
Koller, Alexander
Niehren, Joachim
Language: English
Year of Publication: 2001
OPUS Source: Journal of Logic, Language, and Information Vol 10 (4), 2001, pp.457-485
SWD key words: Lambda-Kalkül ; Constraint-logische Programmierung
Free key words: Constraint language for Kambda Structures ; CLLS
DDC notations: 004 Computer science, internet
Publikation type: Journal Article
Abstract: This paper presents the Constraint Language for Lambda Structures (CLLS), a first-order language for semantic underspecification that conservatively extends dominance constraints. It is interpreted over lambda structures, tree-like structures that encode lambda-terms. Based on CLLS, we present an underspecified, uniform analysis of scope, ellipsis, anaphora, and their interactions. CLLS solves a variable capturing problem that is omnipresent in scope underspecification and can be processed efficiently.
Link to this record: urn:nbn:de:bsz:291-scidok-2932
Date of registration: 12-Jul-2004
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
clls2000.pdf320,47 kBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.