Conditional rewrite rules: Confluence and termination
Journal of Computer and System Sciences
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Order-sorted completion: the many-sorted way
TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Modularity of simple termination of term rewriting systems with shared constructors
Theoretical Computer Science
Equivalence-preserving first-order unfold/fold transformation systems
Theoretical Computer Science - Selected papers of the Second International Conference on algebraic and logic programming, Nancy, France, October 1–3, 1990
A transformation system for deductive database modules with perfect model semantics
Theoretical Computer Science
Total correctness by local improvement in the transformation of functional programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Rules and strategies for transforming functional and logic programs
ACM Computing Surveys (CSUR)
Transformations of CLP modules
Theoretical Computer Science
Term rewriting and all that
Transforming constraint logic programs
Theoretical Computer Science
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Advanced topics in term rewriting
Advanced topics in term rewriting
InvX: An Automatic Function Inverter
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Unravelings and Ultra-properties
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
Rules + strategies for transforming lazy functional logic programs
Theoretical Computer Science
An unfold/fold transformation framework for definite logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Operational termination of conditional term rewriting systems
Information Processing Letters
Automatic partial inversion of inductively sequential functions
IFL'06 Proceedings of the 18th international conference on Implementation and application of functional languages
Partial inversion of constructor term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
The program inverter LRinv and its structure
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Constraint-based correctness proofs for logic program transformations
Formal Aspects of Computing - Celebrating the 60th Birthday of Carroll Morgan
A Method for Automatic Program Inversion Based on LR(0) Parsing
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
| Hi-index | 5.23 |
This paper discusses determinization of conditional term rewriting systems with oriented constructor rules. We present a rule-based transformation system, which transforms a non-deterministic one into a deterministic one, together with examples of the transformation. We prove that the transformation system is simulation sound and simulation complete. We also prove that the transformation system is complete for some class by introducing a strategy for the transformation system.