Removing Redundant Arguments of Functions
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Decidability for Left-Linaer Growing Term Rewriting Systems
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
The Unification Problem for Confluent Right-Ground Term Rewriting Systems
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
The unification problem for confluent right-ground term rewriting systems
Information and Computation - RTA 2001
Reachability and confluence are undecidable for flat term rewriting systems
Information Processing Letters
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
Removing redundant arguments automatically
Theory and Practice of Logic Programming
Information Processing Letters
Confluence of right ground term rewriting systems is decidable
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
The confluence problem for flat TRSs
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
| Hi-index | 0.01 |