Transformation of left terminating programs: The reordering problem
Authors:
- 1 January 1996
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 33-45
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Transforming acyclic programsACM Transactions on Programming Languages and Systems, 1994
- Norms on terms and their use in proving universal termination of a logic programTheoretical Computer Science, 1994
- A transformation system for definite programs based on termination analysisLecture Notes in Computer Science, 1994
- Reasoning about Termination of Pure Prolog ProgramsInformation and Computation, 1993
- Semantics preserving transformation rules for Prolog1991
- Preservation of stronger equivalence in unfold/fold logic program transformationTheoretical Computer Science, 1990
- Studies in Pure Prolog: Termination1990
- Foundations of Logic Programming1987
- Derivation of Logic ProgramsJournal of the ACM, 1981
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977