Conditional narrowing modulo a set of equations (Q1261194): Difference between revisions
From MaRDI portal
Latest revision as of 10:13, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Conditional narrowing modulo a set of equations |
scientific article |
Statements
Conditional narrowing modulo a set of equations (English)
0 references
31 August 1993
0 references
Narrowing is a universal unification procedure for equational theories given by a canonical term rewrite system. We introduce conditional narrowing modulo a set of conditional equations and give a full proof of its correctness and completeness for equational conditional rewrite systems \(R\), \(E\) without extravariables where \(E\) is regular and \(R\), \(E\) is Church-Rosser modulo \(E\) and decreasing modulo \(E\). This result can be seen as the theoretical foundation of a special form of constraint logic and functional programming.
0 references
constraint logic programming
0 references
conditional rewriting
0 references
\(E\)-unification
0 references
functional programming
0 references
0 references