The following pages link to Equational abstractions (Q944377):
Displaying 15 items.
- Automatic verification of reduction techniques in higher order logic (Q469363) (← links)
- Termination criteria for tree automata completion (Q730470) (← links)
- Language definitions as rewrite theories (Q730476) (← links)
- Algebraic simulations (Q844884) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories (Q1931906) (← links)
- Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817) (← links)
- Programming and symbolic computation in Maude (Q2291818) (← links)
- Equational formulas and pattern operations in initial order-sorted algebras (Q2628298) (← links)
- Optimization of rewrite theories by equational partial evaluation (Q2667190) (← links)
- Equational Abstractions in Rewriting Logic and Maude (Q2797862) (← links)
- Verifying Reachability-Logic Properties on Rewriting-Logic Specifications (Q2945720) (← links)
- Model Checking TLR* Guarantee Formulas on Infinite Systems (Q5403070) (← links)
- Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs (Q5403086) (← links)
- Symbolic Specialization of Rewriting Logic Theories with <tt>Presto</tt> (Q6063888) (← links)
