Automatic Generation of Generalization Lemmas for Proving Properties of Tail-Recursive Definitions


Automatically proving properties of tail-recursive function definitions by induction is known to be challenging. The difficulty arises due to a property of a tail-recursive function definition typically expressed by instantiating the accumulator argument to be a constant only on one side of the property. The application of the induction hypothesis gets… (More)
DOI: 10.1007/10930755_9