Beta Reduction Constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

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.
Fichier principal
Vignette du fichier
beta.pdf (383.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00536804 , version 1 (16-11-2010)


  • 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⟩
33 View
175 Download


Gmail Facebook Twitter LinkedIn More