Term rewriting systems with priorities
on Rewriting techniques and applications
Term-rewriting systems with rule priorities
Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
Operational semantics of rewriting with priorities
Theoretical Computer Science
Term rewriting and all that
Semantics and strong sequentiality of priority term rewriting systems
Theoretical Computer Science - Special issue on rewriting techniques and applications
Functional Programming and Parallel Graph Rewriting
Functional Programming and Parallel Graph Rewriting
Priority Rewriting: Semantics, Confluence, and Conditional
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Proving Innermost Normalisation Automatically
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Weaving rewrite-based access control policies
Proceedings of the 2007 ACM workshop on Formal methods in security engineering
Termination of rewriting under strategies
ACM Transactions on Computational Logic (TOCL)
Towards a Strategy Language for Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
A pattern matching compiler for multiple target languages
CC'03 Proceedings of the 12th international conference on Compiler construction
Specifying and reasoning about dynamic access-control policies
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Generalized innermost rewriting
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Analysis of Rewrite-Based Access Control Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting
Fundamenta Informaticae
| Hi-index | 0.00 |
Introducing priorities in rewriting increases the expressive power of rules and helps to limit computations. Priority rewriting is used in rule-based programming as well as in functional programming. Termination of priority rewriting is then important to guarantee that programs give a result. We describe an inductive proof method for termination of priority rewriting, relying on an explicit induction on the termination property and working by generating proof trees, which model the rewriting relation by using abstraction and narrowing.