Name
Abstract | ||
|---|---|---|
-definability of term rewriting systems has been an open question. Berarducci and Böhm show that canonical systems are translated into the -calculus. However, they do not present a theory which can formalize their translation. In this paper, we adapt Böhm's separability theory for -definability. A term rewriting system version of separability, called separable systems, is proposed. Separable systems may includes multiple constructors in the left-hand sides, and canonical systems are a subclass of separable systems. An encoding technique of translating separable systems into the -calculus is presented. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1007/BFb0027784 | ASIAN |
Keywords | Field | DocType |
lambda-definable term | Algebra,Computer science,Algorithm,Separable space,Rewriting,Equivalence class,Lambda,Encoding (memory) | Conference |
ISBN | Citations | PageRank |
3-540-62031-1 | 1 | 0.36 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sugwoo Byun | 1 | 2 | 0.75 |
| Richard Kennaway | 2 | 435 | 47.65 |
| M. Ronan Sleep | 3 | 178 | 31.24 |