Pages that link to "Item:Q1035697"
From MaRDI portal
The following pages link to Termination of narrowing revisited (Q1035697):
Displaying 9 items.
- A compact fixpoint semantics for term rewriting systems (Q987981) (← links)
- Constant runtime complexity of term rewriting is semi-decidable (Q1799562) (← links)
- Modular Termination of Basic Narrowing (Q3522005) (← links)
- Variant-Based Satisfiability in Initial Algebras (Q4686604) (← links)
- (Q5020553) (← links)
- (Q5020960) (← links)
- Termination of Narrowing Using Dependency Pairs (Q5504664) (← links)
- A Non-Deterministic Multiset Query Language (Q5862341) (← links)
- Symbolic Specialization of Rewriting Logic Theories with <tt>Presto</tt> (Q6063888) (← links)
