Skip to Main content Skip to Navigation
Conference papers

Beta Reduction Constraints

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.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Joachim Niehren Connect in order to contact the contributor
Submitted on : Tuesday, November 16, 2010 - 11:09:22 PM
Last modification on : Friday, October 23, 2020 - 4:52:21 PM
Long-term archiving on: : Thursday, February 17, 2011 - 3:13:37 AM


Files produced by the author(s)


  • HAL Id : inria-00536804, version 1


Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren. Beta Reduction Constraints. International Conference on Rewriting Techniques and Applications, 2001, Utrecht, Netherlands. pp.31-46. ⟨inria-00536804⟩



Record views


Files downloads