The following pages link to Advanced topics in term rewriting (Q2783416):
Displaying 40 items.
- Transformation for refining unraveled conditional term rewriting systems (Q2866802) (← links)
- Improving the context-sensitive dependency graph (Q2867962) (← links)
- Proving termination of context-sensitive rewriting with MU-TERM (Q2867963) (← links)
- Layer Systems for Proving Confluence (Q2946770) (← links)
- Formalizing Soundness and Completeness of Unravelings (Q2964466) (← links)
- (Q2980968) (← links)
- Transformations of Conditional Rewrite Systems Revisited (Q3184732) (← links)
- A Finite Representation of the Narrowing Space (Q3453648) (← links)
- Confluence Competition 2015 (Q3454083) (← links)
- Reducing Relative Termination to Dependency Pair Problems (Q3454090) (← links)
- Modular Termination of Basic Narrowing (Q3522005) (← links)
- Usable Rules for Context-Sensitive Rewrite Systems (Q3522013) (← links)
- Confluence by Decreasing Diagrams (Q3522026) (← links)
- MTT: The Maude Termination Tool (System Description) (Q3541712) (← links)
- Modularity of Confluence (Q3541716) (← links)
- Proving Confluence of Term Rewriting Systems Automatically (Q3636821) (← links)
- Local Termination (Q3636830) (← links)
- From Outermost to Context-Sensitive Rewriting (Q3636831) (← links)
- A Fully Abstract Semantics for Constructor Systems (Q3636832) (← links)
- Termination Modulo Combinations of Equational Theories (Q3655204) (← links)
- Averaging algebras, rewriting systems and Gröbner–Shirshov bases (Q4566066) (← links)
- Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems (Q4993358) (← links)
- Automatically Proving and Disproving Feasibility Conditions (Q5049020) (← links)
- mu-term: Verify Termination Properties Automatically (System Description) (Q5049021) (← links)
- Semi-inversion of Conditional Constructor Term Rewriting Systems (Q5097640) (← links)
- Initial Conflicts for Transformation Rules with Nested Application Conditions (Q5100729) (← links)
- Completion after Program Inversion of Injective Functions (Q5170160) (← links)
- Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures (Q5170162) (← links)
- Operational Termination of Membership Equational Programs: the Order-Sorted Way (Q5179140) (← links)
- On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs (Q5200103) (← links)
- Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems (Q5240131) (← links)
- Inverse Unfold Problem and Its Heuristic Solving (Q5240134) (← links)
- On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings (Q5240136) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
- Incremental Proofs of Termination, Confluence and Sufficient Completeness of OBJ Specifications (Q5403069) (← links)
- Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting (Q6052950) (← links)
- Local confluence of conditional and generalized term rewriting systems (Q6151615) (← links)
- Proving confluence in the confluence framework with confident (Q6622001) (← links)
- Disproving termination of non-erasing sole combinatory calculus with tree automata (Q6666803) (← links)
- Transforming concurrent programs with semaphores into logically constrained term rewrite systems (Q6671788) (← links)
