Beta reduction constraints

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

Eingang zum Volltext in SciDok

InProceedings (Aufsatz / Paper einer Konferenz etc.) zugänglich unter
URN: urn:nbn:de:bsz:291-scidok-2981
URL: http://scidok.sulb.uni-saarland.de/volltexte/2004/298/

Beta reduction constraints

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

Quelle:

(2001) Proceedings of the 12th International Conference on Rewriting Techniques and Applications, RTA 01, Utrecht, The Netherlands, May 22-24, 2001.- Berlin: Springer, 2001. (Lecture Notes in Computer Science; 2051), pp. 31-46

pdf-Format:

Dokument 1.pdf (572 KB)

SWD-Schlagwörter:		Constraint-logische Programmierung
Freie Schlagwörter (Englisch):		Beta Constraints
Institut:
DDC-Sachgruppe:		Informatik
Dokumentart:		InProceedings (Aufsatz / Paper einer Konferenz etc.)
Sprache:		Englisch
Erstellungsjahr:		2001
Publikationsdatum:		12.07.2004
Kurzfassung auf Englisch:		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.