Pages that link to "Item:Q1328184"
From MaRDI portal
The following pages link to Completeness results for basic narrowing (Q1328184):
Displayed 11 items.
- A compositional semantic basis for the analysis of equational Horn programs (Q671509) (← links)
- Lazy narrowing: strong completeness and eager variable elimination (Q671677) (← links)
- Complete symbolic reachability analysis using back-and-forth narrowing (Q860885) (← links)
- A new generic scheme for functional logic programming with constraints (Q880985) (← links)
- Conditional narrowing modulo a set of equations (Q1261194) (← links)
- Incremental constraint satisfaction for equational logic programming (Q1367535) (← links)
- Higher order unification via explicit substitutions (Q1854337) (← links)
- Logicality of conditional rewrite systems (Q1978646) (← links)
- Shallow confluence of conditional term rewriting systems (Q2518609) (← links)
- Modular Termination of Basic Narrowing (Q3522005) (← links)
- Implementing conditional term rewriting by graph rewriting (Q5958126) (← links)