The Mixtus approach to automatic partial evaluation of full Prolog
Proceedings of the 1990 North American conference on Logic programming
Unfold/fold transformation of stratified programs
Theoretical Computer Science
A meta-environment for generating programming environments
ACM Transactions on Software Engineering and Methodology (TOSEM)
Online partial deduction of logic programs
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Generation of formatters for context-free languages
ACM Transactions on Software Engineering and Methodology (TOSEM)
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Language Prototyping: An Algebraic Specification Approach: Vol. V
Language Prototyping: An Algebraic Specification Approach: Vol. V
Spes: A System for Logic Program Transformation
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
A Transformation Tool for Pure Prolog Programs
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
Conjunctive Partial Deduction in Practice
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
| Hi-index | 0.00 |
The paper reports about a case study in algebraic specification. It describes TransLog, a transformation tool for pure Prolog programs. TransLog supports the interactive transformation of (a part of) a program. Six transformation steps are supported: unfolding, folding, goal definition, argument permutation (an instance of goal replacement), goal switching and definition elimination. As much as possible, pure Prolog semantics are preserved. The tool is equipped with navigation options, which allow the user to switch from the current program to another program in a transformation sequence. TransLog has been implemented with the ASF+SDF Meta-environment. The paper focuses on the algebraic specification of the tool, not on the underlying theory of (logic) program transformation. The specification is presented at a global level, only the specification of the unfold and fold step is discussed more in depth.