%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:43:07 +0100 GMT
%    
% Selection : Author: Manuel_Bodirsky
%




@InProceedings{Bodirsky_et_al:2001,
      AUTHOR = {Bodirsky, Manuel and Erk, Katrin and Koller, Alexander and Niehren, Joachim},
      TITLE = {Beta Reduction Constraints},
      YEAR = {2001},
      BOOKTITLE = {12th International Conference on Rewriting Techniques and Applications (RTA'01), May 22-24},
      PAGES = {31-46},
      EDITOR = {Middeldorp, Aart},
      SERIES = {Lecture Notes in Computer Science},
      ADDRESS = {Utrecht, The Netherlands},
      PUBLISHER = {Springer-Verlag},
      URL = {https://www.coli.uni-saarland.de/~koller/papers/beta.ps.gz},
      ABSTRACT = {The constraint language for lambda structures (CLLS) can model lambda terms that are known only partially. In this paper, we introduce beta reduction constraints to describe beta reduction steps between partially known lambda terms. We show that beta reduction constraints can be expressed in an extension of CLLS by group parallelism. We then extend a known semi-decision procedure for CLLS to also deal with group parallelism and thus with beta-reduction constraints.},
      ANNOTE = {COLIURL : Bodirski:2001:BRC.pdf Bodirsky:2001:BRC.ps}
}

@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}
}