author | wenzelm |
Mon, 29 Nov 1999 15:52:49 +0100 | |
changeset 8039 | a901bafe4578 |
parent 5183 | 89f162de39cf |
child 8791 | 50b650d19641 |
permissions | -rw-r--r-- |
(* Title: HOL/Hoare/Arith2.thy ID: $Id$ Author: Norbert Galm Copyright 1995 TUM More arithmetic. Much of this duplicates ex/Primes. *) Arith2 = Power + constdefs cd :: [nat, nat, nat] => bool "cd x m n == x dvd m & x dvd n" gcd :: [nat, nat] => nat "gcd m n == @x.(cd x m n) & (!y.(cd y m n) --> y<=x)" consts fac :: nat => nat primrec "fac 0 = Suc 0" "fac(Suc n) = (Suc n)*fac(n)" end