@TechReport{Egg_et_al:1998_1,
AUTHOR = {Egg, Markus and Koller, Alexander and Niehren, Joachim and Ruhrberg, Peter},
TITLE = {Constraints over Lambda Structures, Antecedent Contained Deletion, and Quantifier Identities},
YEAR = {1998},
ADDRESS = {Saarbrücken},
TYPE = {Technical Report},
INSTITUTION = {Computational Linguistics and Programming Systems Lab, University of the Saarland},
ABSTRACT = {The constraint language for lambda-structures (CLLS) allows for a simple, integrated, and underspecified treatment of scope, ellipses, anaphora, and their interaction. CLLS features constraints for dominance, lambda binding, parallelism, and anaphoric links. In the case of antecedent contained deletion (ACD), the definition of parallelism in the original version of CLLS is slightly too restrictive due to an overly weak notion of quantifier identity. We show how to extend CLLS with an appropriate notion of quantifier identity such that ACD can be naturally analysed. This sheds some light on conflicting requirements on quantifier representations as needed for ACD and Hirschbühler sentences.}}