2009-01-28 nipkow 2009-01-28 merged - resolving conflics
2009-01-28 nipkow 2009-01-28 Replaced group_ and ring_simps by algebra_simps; removed compare_rls - use algebra_simps now
2009-01-26 haftmann 2009-01-26 stripped Id
2009-01-16 haftmann 2009-01-16 migrated class package to new locale implementation
2008-12-16 ballarin 2008-12-16 More porting to new locales.
2008-12-03 huffman 2008-12-03 fixed proofs due to changes in Int.thy
2008-11-17 haftmann 2008-11-17 tuned unfold_locales invocation
2008-08-29 haftmann 2008-08-29 fixed names of class assumptions
2008-07-25 haftmann 2008-07-25 added class preorder
2008-04-04 haftmann 2008-04-04 tuned
2008-04-02 haftmann 2008-04-02 tuned towards code generation
2008-02-17 huffman 2008-02-17 New simpler representation of numerals, using Bit0 and Bit1 instead of BIT, B0, and B1
2008-01-15 haftmann 2008-01-15 joined theories IntDef, Numeral, IntArith to theory Int
2008-01-02 haftmann 2008-01-02 splitted class uminus from class minus
2007-11-08 wenzelm 2007-11-08 eliminated illegal schematic variables in where/of;
2007-10-21 nipkow 2007-10-21 Eliminated most of the neq0_conv occurrences. As a result, many theorems had to be rephrased with ~= 0 instead of > 0.
2007-10-20 chaieb 2007-10-20 fixed proofs
2007-08-28 huffman 2007-08-28 revert to Word library version from 2007/08/20
2007-08-23 huffman 2007-08-23 new instance proofs
2007-08-22 huffman 2007-08-22 removed Word/Size.thy; replaced len_of TYPE('a) with CARD('a); replaced axclass len with class finite; replaced axclass len0 with class type
2007-08-22 huffman 2007-08-22 move bool list stuff from WordDefinition and WordArith to new WordBoolList theory
2007-08-21 huffman 2007-08-21 simplify proof of word_of_int
2007-08-21 huffman 2007-08-21 move udvd, div and mod stuff from WordDefinition to WordArith
2007-08-21 huffman 2007-08-21 move order-related stuff from WordDefinition to WordArith
2007-08-20 huffman 2007-08-20 remove redundant lemma int_number_of
2007-08-20 huffman 2007-08-20 headers for document generation
2007-08-20 kleing 2007-08-20 * HOL-Word: New extensive library and type for generic, fixed size machine words, with arithemtic, bit-wise, shifting and rotating operations, reflection into int, nat, and bool lists, automation for linear arithmetic (by automatic reflection into nat or int), including lemmas on overflow and monotonicity. Instantiated to all appropriate arithmetic type classes, supporting automatic simplification of numerals on all operations. Jointly developed by NICTA, Galois, and PSU. * still to do: README.html/document + moving some of the generic lemmas to appropriate place in distribution