On the Computational Content of Termination Proofs [chapter]

Georg Moser, Thomas Powell
2015 Lecture Notes in Computer Science  
Given that a program has been shown to terminate using a particular proof, it is natural to ask what we can infer about its complexity. In this paper we outline a new approach to tackling this question in the context of term rewrite systems and recursive path orders. From an inductive proof that recursive path orders are well-founded, we extract an explicit realiser which bounds the derivational complexity of rewrite systems compatible with these orders. We demonstrate that by analysing our
more » ... iser we are able to derive, in a completely uniform manner, a number of results on the relationship between the strength of path orders and the bounds they induce on complexity.
doi:10.1007/978-3-319-20028-6_28 fatcat:ca2wbwgtg5exlf6fdbuy57ow2m