Beta Reduction Constraints

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.

• Type: Conference
• Year: 2001
• Where: RTA
• Authors: Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren
• Keywords: Beta Reduction Constraints, Beta Reduction Steps, Lambda Terms, RTA 2001, Theoretical Computer Science