Pages that link to "Item:Q5505589"
From MaRDI portal
The following pages link to Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation (Q5505589):
Displaying 4 items.
- Equational approximations for tree automata completion (Q968530) (← links)
- Proving semantic properties as first-order satisfiability (Q2289018) (← links)
- Horn clauses as an intermediate representation for program analysis and transformation (Q4592995) (← links)
- A Human-Oriented Term Rewriting System (Q6488090) (← links)