| author | wenzelm |
| Mon, 04 Mar 2002 19:06:52 +0100 | |
| changeset 13012 | f8bfc61ee1b5 |
| parent 11868 | 56db9f3a6b3e |
| child 13575 | ecb6ecd9af13 |
| permissions | -rw-r--r-- |
(* Title: Integ/Int.thy ID: $Id$ Author: Lawrence C Paulson, Cambridge University Computer Laboratory Copyright 1998 University of Cambridge Type "int" is a linear order *) Int = IntDef + instance int :: order (zle_refl,zle_trans,zle_anti_sym,int_less_le) instance int :: plus_ac0 (zadd_commute,zadd_assoc,zadd_0) instance int :: linorder (zle_linear) constdefs nat :: int => nat "nat(Z) == if neg Z then 0 else (THE m. Z = int m)" defs zabs_def "abs(i::int) == if i < 0 then -i else i" end