Please use this identifier to cite or link to this item:
doi:10.22028/D291-25779 | Title: | Beta reduction constraints |
| Author(s): | Bodirsky, Manuel Erk, Katrin Koller, Alexander Niehren, Joachim |
| Language: | English |
| Year of Publication: | 2001 |
| OPUS Source: | 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 |
| SWD key words: | Constraint-logische Programmierung |
| Free key words: | Beta Constraints |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Conference Paper |
| Abstract: | 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. |
| Link to this record: | urn:nbn:de:bsz:291-scidok-2981 hdl:20.500.11880/25835 http://dx.doi.org/10.22028/D291-25779 |
| Date of registration: | 12-Jul-2004 |
| Faculty: | MI - Fakultät für Mathematik und Informatik |
| Department: | MI - Informatik |
| Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.