Some classes of term rewriting systems inferable from positive data
In this paper, we study the inferability of term rewriting systems ( trss, for short) from positive examples alone. Two classes of trss inferable from positive data are presented, namely, simple flat trss and linear-bounded trss. These classes of trss are rich enough to include many divide-and-conqu...
Saved in:
| Published in | Theoretical computer science Vol. 397; no. 1; pp. 129 - 149 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
20.05.2008
|
| Online Access | Get full text |
Cover
Loading…
| Summary: | In this paper, we study the inferability of term rewriting systems (
trss, for short) from positive examples alone. Two classes of
trss
inferable from positive data are presented, namely, simple flat
trss and linear-bounded
trss. These classes of
trss are rich enough to include many divide-and-conquer programs
1
1
We use ‘programs’ and ‘systems’ interchangeably as
trss are very similar to functional programs. In fact, the
trss considered in this paper follow the so called constructor discipline and are essentially functional programs.
like addition, doubling, logarithm, tree-count, list-count, split, append, reverse, etc. The classes of simple flat
trss and linear-bounded
trss are incomparable, i.e., there are functions that can be computed by simple flat
trss but not by linear-bounded
trss and vice versa. |
|---|---|
| ISSN: | 0304-3975 1879-2294 |
| DOI: | 10.1016/j.tcs.2008.02.027 |