203 search results - page 27 / 41 » Datatype-Generic Termination Proofs |
CONCUR
2006
Springer
15 years 5 months ago
2006
Springer
Abstract We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields a...
102
click to vote
FSTTCS
2008
Springer
15 years 3 months ago
2008
Springer
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
126
click to vote
PPDP
2007
Springer
15 years 8 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
127
click to vote
BIRTHDAY
2007
Springer
15 years 8 months ago
2007
Springer
Showing termination of the Battle of Hercules and Hydra is a challenge. We present the battle both as a rewrite system and as an arithmetic while program, provide proofs of their t...
108
click to vote
SAS
2004
Springer
15 years 7 months ago
2004
Springer
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...