Name
Abstract | ||
|---|---|---|
Extending the infinitary rewriting definition of Böhm-like trees to infinitary Combinatory Reduction Systems (iCRSs), we show that each Böhm-like tree defined by means of infinitary rewriting can also be defined by means of a direct approximant function. In addition, we show that counterexamples exists to the reverse implication. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-02348-4_17 | RTA |
Keywords | Field | DocType |
hm-like trees,hm-like tree,reverse implication,combinatory reduction systems,direct approximant function | Discrete mathematics,Lambda calculus,Algorithm,Rewriting,Counterexample,Mathematics | Conference |
Citations | PageRank | References |
4 | 0.46 | 13 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jeroen Ketema | 1 | 160 | 13.52 |