Name
Abstract | ||
|---|---|---|
This paper shows how to express completion with constraints in rewriting logic. In thefirst part, a completion with constraints procedure that gives priority to simplifications isspecified. We define notions of simplification and redundancy especially appropriate for completionwith constraints. In the second part, the process is described using computationalsystems, that are rewrite theories enriched by strategies. Its implementation in ELAN, an interpretorof computational systems, is... |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1007/3-540-59200-8_79 | RTA |
Keywords | Field | DocType |
computational systems,prototyping completion,rewriting logic | Discrete mathematics,Computer science,Algorithm | Conference |
ISBN | Citations | PageRank |
3-540-59200-8 | 15 | 1.41 |
References | Authors | |
7 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hélène Kirchner | 1 | 1655 | 152.66 |
| Pierre-etienne Moreau | 2 | 598 | 40.40 |