Name
Abstract | ||
|---|---|---|
In this paper we define Bohm-like trees for term rewriting systems (TRSs). The definition is based on the similarities between the Bohm trees, the Levy-Longo trees, and the Berarducci trees. That is, the similarities between the Bohm-like trees of the A-calculus. Given a term t a tree partially represents the root-stable part of t as created in each maximal fair reduction of t. In addition to defining Bohm-like trees for TRSs we define a subclass of Bohm-like trees whose members are monotone and continuous. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-25979-4_17 | Lecture Notes in Computer Science |
DocType | Volume | ISSN |
Conference | 3091 | 0302-9743 |
Citations | PageRank | References |
3 | 0.42 | 8 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jeroen Ketema | 1 | 160 | 13.52 |