1458 search results - page 40 / 292 » Extended Term Rewriting Systems |
IWPC
2003
IEEE
15 years 3 months ago
2003
IEEE
Syntactic and semantic analysis are established topics in the area of compiler construction. Their application to the understanding and restructuring of large software systems rev...
RTA
1997
Springer
15 years 1 months ago
1997
Springer
We present a technique to prove innermost normalisation of term rewriting systems TRSs automatically. In contrast to previous methods, our technique is able to prove innermost n...
CADE
2012
Springer
13 years 4 days ago
2012
Springer
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...
CADE
2012
Springer
13 years 4 days ago
2012
Springer
We introduce a technique to prove non-termination of term rewrite systems automatically. Our technique improves over previous approaches substantially, as it can also detect non-lo...
AML
2006
14 years 9 months ago
2006
We study the formal rst order system Tind in the standard language of Gentzen's LK. Tind extends LK by the purely logical rule of term-induction, that is a restricted inductio...