https://hal.inria.fr/inria-00536804Bodirsky, ManuelManuelBodirskyProgramming Systems Lab [Saarland] - Saarland University [Saarbrücken]Erk, KatrinKatrinErkProgramming Systems Lab [Saarland] - Saarland University [Saarbrücken]Koller, AlexanderAlexanderKollerAllgemeine Linguistik - Allgemeine Linguistik Computational Linguistics and phonetics - Saarland University [Saarbrücken]Niehren, JoachimJoachimNiehrenProgramming Systems Lab [Saarland] - Saarland University [Saarbrücken]Beta Reduction ConstraintsHAL CCSD2001[INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO][INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL]Niehren, JoachimAart Middeldorp2010-11-16 23:09:222020-10-23 16:52:212010-11-18 16:41:33enConference papersapplication/pdf1The 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.