Loading...
Please wait, while we are loading the content...
Similar Documents
Conditional Directed Narrowing (1996)
| Content Provider | CiteSeerX |
|---|---|
| Author | Limet, Sébastien Réty, Pierre |
| Abstract | We extend the directed narrowing to the conditional framework, and prove soundness and completeness for two classes of conditional term rewrite systems : confluent and decreasing in one hand, level-confluent and terminating in the other hand. We show that conditional directed narrowing terminates more often than conditional basic narrowing. Then, we add LSE tests as constraints in our procedure, prove completeness for confluent and decreasing rewrite systems, and show that it terminates more often than conditional LSE narrowing. Moreover it is minimal, i.e. no solution is computed twice. Keywords : unification, rewriting, narrowing, functional-logic programming. Contents 1 Introduction 3 2 Preliminaries 5 3 The graph of terms 6 3.1 The construction of the graph : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 6 3.2 Properties of the graph of terms : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 4 The conditional directed narrowing 7 4.1 The procedure ... |
| File Format | |
| Publisher Date | 1996-01-01 |
| Access Restriction | Open |
| Subject Keyword | Conditional Basic Narrowing Directed Narrowing Conditional Directed Narrowing Conditional Lse Narrowing Functional-logic Programming Conditional Term Rewrite System Rewrite System Conditional Framework Lse Test |
| Content Type | Text |
