The following pages link to CARIBOO (Q22033):
Displayed 14 items.
- Proving weak properties of rewriting (Q554217) (← links)
- Characterizing and proving operational termination of deterministic conditional term rewriting systems (Q710679) (← links)
- Mechanically proving termination using polynomial interpretations (Q851142) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← links)
- The size-change principle and dependency pairs for termination of term rewriting (Q2573795) (← links)
- (Q2851054) (← links)
- Orderings and Constraints: Theory and Practice of Proving Termination (Q3608810) (← links)
- Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations (Q3608811) (← links)
- From Outermost to Context-Sensitive Rewriting (Q3636831) (← links)
- Automated Reasoning (Q5307050) (← links)
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making (Q5463948) (← links)
- Term Rewriting and Applications (Q5703846) (← links)
- Theoretical Aspects of Computing - ICTAC 2004 (Q5709986) (← links)