10 search results - page 1 / 2 » Unfold fold Transformations Preserving Termination Propertie... |
LOPSTR
1994
Springer
13 years 8 months ago
1994
Springer
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
PLILP
1992
Springer
13 years 8 months ago
1992
Springer
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
AGP
1997
IEEE
13 years 8 months ago
1997
IEEE
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
LOPSTR
1994
Springer
13 years 8 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
JUCS
2006
13 years 4 months ago
2006
Abstract: Multi-adjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. In this setting, the execution of...