Name
Abstract | ||
|---|---|---|
Orthogonal term rewriting systems (OTRSs) provide a well-known description of functional languages and their implementation. This paper describes some ways of transforming such systems into systems having simpler left-hand sides, the goal being to transform them into flat OTRSs, which have a particularly simple form. A class of systems, the transformable OTRSs, is defined which allow such a transformation. This class lies between the strongly sequential constructor systems and the strongly sequential systems. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1007/3-540-60688-2_36 | ASIAN |
Keywords | Field | DocType |
orthogonal term rewriting systems,functional language | Transformation (function),Algebra,Functional programming,Arithmetic,Confluence,Rewriting,Equivalence class,Mathematics | Conference |
ISBN | Citations | PageRank |
3-540-60688-2 | 1 | 0.39 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sugwoo Byun | 1 | 2 | 0.75 |
| Richard Kennaway | 2 | 435 | 47.65 |
| M. Ronan Sleep | 3 | 178 | 31.24 |