10 search results - page 1 / 2 » rta 2004 |
RTA
2004
Springer
14 years 24 days ago
2004
Springer
RTA
2004
Springer
14 years 24 days ago
2004
Springer
RTA
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. In this paper we present some new refinements of the dependency pair method for automatically proving the termination of term rewrite systems. These refinements are ver...
RTA
2004
Springer
14 years 24 days ago
2004
Springer
Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent type...
RTA
2004
Springer
14 years 24 days ago
2004
Springer
The problem of selecting nodes in unranked trees is the most basic querying problem for XML. We propose stepwise tree automata for querying unranked trees. Stepwise tree automata c...