Sciweavers

3 search results - page 1 / 1
» lopstr 1994
Sort
View
LOPSTR
1994
Springer
13 years 9 months ago
Using Call/Exit Analysis for Logic Program Transformation
A technique for transformation of definite logic programs is presented. A first phase performs an analysis of the extended call/exit patterns of the source program. It is shown tha...
Dmitri Boulanger, Maurice Bruynooghe
LOPSTR
1994
Springer
13 years 9 months ago
More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics
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...
Annalisa Bossi, Sandro Etalle
LOPSTR
1994
Springer
13 years 9 months ago
A Transformation System for Definite Programs Based on Termination Analysis
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...
J. Cook, John P. Gallagher