Abstract
The Replacement is a very powerful transformation operation which - both within the functional paradigm as well as within the logic programming one - can micic the most common transformation operations such as unfold, fold, switching, distribution. Because of this flexibility , it can be incorrect if used without specific applicability conditions. In this paper we show that, under these conditions, the replacement generalizes both the unfolding operation as well as a restricted form of folding operation.
Original language | Undefined |
---|---|
Pages | 441-454 |
Publication status | Published - 1999 |
Event | Joint Conference on Declarative Programming, AGP - L'Aquila, Italy Duration: 6 Sep 1999 → 9 Sep 1999 |
Conference
Conference | Joint Conference on Declarative Programming, AGP |
---|---|
Period | 6/09/99 → 9/09/99 |
Other | September 6-9, 1999 |
Keywords
- IR-56187