Transformation of Left Terminating Programs: the Reordering Problem

@inproceedings{Bossi1995TransformationOL,
  title={Transformation of Left Terminating Programs: the Reordering Problem},
  author={Annalisa Bossi and Nicoletta Cocco and Sandro Etalle},
  booktitle={LOPSTR},
  year={1995}
}
A b s t r a c t . An Unfold/Fold transformation system is a source-to-source rewriting methodology devised to improve the efficiency of a program. Any such transformation should preserve the main properties of the initial program: among them, termination. When dealing with logic programs such as PROLOG programs, one is particularly interested in preserving left termination i.e. termination wrt the leftmost selection rule, which is by far the most widely employed of the search rules… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Predicate logic : a calculus for deriving programs

K. L. Clark, S. Sickel
1994

Transformation of Left Terminating Programs : The Reordering Problem

N. Cocco
1994

editors

K. R. A p t, M. Bezem. Acyclic programs. In D.H.D. Warren, P. Szeredi
Proceedings o/ the Seventh International Con/erence on Logic Programming, pages 6 1 7 - 6 3 3 . T h e M I T Press , • 1990
View 1 Excerpt

Similar Papers

Loading similar papers…