doc-src/Tutorial/Recdef/gcd

simplified thanks to the arithmetic prover

recdef gcd "measure ((%(m,n).n))"
  simpset "simpset() addsimps [mod_less_divisor]"
  "gcd (m, n) = (if n=0 then m else gcd(n, m mod n))"