Pages that link to "Item:Q2643544"
From MaRDI portal
The following pages link to Modular and incremental proofs of AC-termination (Q2643544):
Displaying 12 items.
- Elimination transformations for associative-commutative rewriting systems (Q877834) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- Stability of termination and sufficient-completeness under pushouts via amalgamation (Q2215962) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← links)
- Relative termination via dependency pairs (Q2360875) (← links)
- Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908) (← links)
- Automating the dependency pair method (Q2486583) (← links)
- Modular and incremental automated termination proofs (Q2583289) (← links)
- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures (Q3522011) (← links)
- AC-KBO revisited (Q4593023) (← links)
- AC Completion with Termination Tools (Q5200044) (← links)
- Incremental Proofs of Termination, Confluence and Sufficient Completeness of OBJ Specifications (Q5403069) (← links)
