Beta Reduction Constraints

Manuel Bodirsky, Katrin Erk, Alexander Koller, and Joachim Niehren

In Proceedings of the 12th International Conference on Rewriting Techniques and Applications (RTA), Utrecht, 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: Download

BibTeX Entry
@InProceedings{beta,
	author = {Manuel Bodirsky and Katrin Erk and Alexander Koller and 
		Joachim Niehren},
	title = {Beta Reduction Constraints},
	year = 2001,
	booktitle = {Proceedings of the 12th International Conference on 
		Rewriting Techniques and Applications (RTA)},
	address = {Utrecht}
}

Back: Publications