@InProceedings{Bodirsky_et_al:2001_1,
      AUTHOR = {Bodirsky, Manuel and Erk, Katrin and Koller, Alexander and Niehren, Joachim},
      TITLE = {Underspecified Beta Reduction},
      YEAR = {2001},
      BOOKTITLE = {Proceedings of the 39th Annual Meeting of the Association of Computational Linguistics (ACL'01), July 6-11},
      PAGES = {74-81},
      ADDRESS = {Toulouse, France},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/usp-beta.ps.gz https://www.coli.uni-saarland.de/~koller/papers/usp-beta.ps.gz},
      ABSTRACT = {For ambiguous sentences, traditional semantics construction produces large numbers of higher-order formulas, which must then be beta-reduced individually. Underspecified versions can produce compact descriptions of all readings, but it is not known how to perform beta reduction on these descriptions. We show how to do this using beta reduction constraints in the constraint language for $lambda$-structures (CLLS).},
      ANNOTE = {COLIURL : Bodirski:2001:UBR.pdf Bodirsky:2001:UBR.ps}
}