Publication details

Programming Systems

Gert Smolka

Publications

Teaching

Software

Formalizations

Beta Reduction Constraints

Manuel Bodirsky, Katrin E. Erk, Alexander Koller, Joachim Niehren

International Conference on Rewriting Techniques and Applications, pp. 31-46, Springer-Verlag, Berlin, May 2001

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.

Download PDF        Show BibTeX               

@INPROCEEDINGS{beta,
  title = {Beta Reduction Constraints},
  author = {Manuel Bodirsky and Katrin E. Erk and Alexander Koller and Joachim Niehren},
  year = {2001},
  month = {may#{ 22--24}},
  editor = {{Aart Middeldorp}},
  publisher = {{Springer-Verlag, Berlin}},
  booktitle = {International Conference on Rewriting Techniques and                   Applications},
  series = {{Lecture Notes in Computer Science}},
  pages = {{31-46}},
  address = {{Utrecht, The Netherlands}},
}

Login to edit