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 Herbrand model semantics and the Computed Answer Substitution semantics. Seki extended the method to normal programs and specialized it in order to preserve also the finite failure set. The resulting system is correct wrt nearly all the declarative semantics for normal programs. An exception is Fitting's model semantics. In this paper we consider a slight variation of Seki's method and we study its correctness wrt Fitting's semantics. We define an applicability condition for the fold operation and we show that it ensures the preservation of the considered semantics through the transformation.
|Number of pages||21|
|Publication status||Published - 1994|
|Event||4th Int. Workshop on Meta Programming in Logic (META) - Pisa, Italy|
Duration: 1 Jan 1994 → 1 Jan 1994
|Workshop||4th Int. Workshop on Meta Programming in Logic (META)|
|Period||1/01/94 → 1/01/94|