CARIBOO
From MaRDI portal
Software:22033
No author found.
Related Items (14)
Mechanically proving termination using polynomial interpretations ⋮ Twenty years of rewriting logic ⋮ Term Rewriting and Applications ⋮ Theoretical Aspects of Computing - ICTAC 2004 ⋮ Unnamed Item ⋮ Proving weak properties of rewriting ⋮ Characterizing and proving operational termination of deterministic conditional term rewriting systems ⋮ Proving operational termination of membership equational programs ⋮ Orderings and Constraints: Theory and Practice of Proving Termination ⋮ Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations ⋮ Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making ⋮ From Outermost to Context-Sensitive Rewriting ⋮ Automated Reasoning ⋮ The size-change principle and dependency pairs for termination of term rewriting
This page was built for software: CARIBOO
