Automated termination proofs with measure functions [chapter]

Jürgen Giesl
1995 Lecture Notes in Computer Science  
This paper deals with the automation of termination proofs for recursively de ned algorithms (i.e. algorithms in a pure functional language). Previously developed methods for their termination proofs either had a low degree of automation or they were restricted to one single xed measure function to compare data objects. To overcome these drawbacks we introduce a calculus for automated termination proofs which is able to handle arbitrary measure functions based on polynomial norms.
doi:10.1007/3-540-60343-3_33 fatcat:no3adete5fdb3atqlgu2r6dizi