Kostas Arkoudas

Learn More
Primitive recursion is a well known syntactic restriction on recursive deenitions which guarantees termination. Unfortunately many natural deenitions, such as the most common deenition of Euclid's GCD algorithm, are not primitive recursive. Walther has recently given a proof system for verifying termination of a broader class of deenitions. Although(More)
  • 1