2012-01-07 haftmann 2012-01-07 dropped theory More_Set
2011-12-26 haftmann 2011-12-26 incorporated More_Set and More_List into the Main body -- to be consolidated later
2011-09-13 noschinl 2011-09-13 tune simpset for Complete_Lattices
2011-09-10 haftmann 2011-09-10 renamed theory Complete_Lattice to Complete_Lattices, in accordance with Lattices, Orderings etc.
2011-08-20 haftmann 2011-08-20 compatibility layer
2011-05-05 bulwahn 2011-05-05 adding creation of exhaustive generators for records; simplifying dependencies in Main theory
2011-03-11 bulwahn 2011-03-11 correcting dependencies after renaming
2010-11-08 bulwahn 2010-11-08 adding code and theory for smallvalue generators, but do not setup the interpretation yet
2010-10-26 blanchet 2010-10-26 integrated "smt" proof method with Sledgehammer
2010-10-26 blanchet 2010-10-26 reverted e7a80c6752c9 -- there's not much point in putting a diagnosis tool (as opposed to a proof method) in Plain, but more importantly Sledgehammer must be in Main to use SMT solvers
2010-10-25 haftmann 2010-10-25 moved sledgehammer to Plain; tuned dependencies
2010-08-12 haftmann 2010-08-12 group record-related ML files
2010-05-12 boehmes 2010-05-12 layered SMT setup, adapted SMT clients, added further tests, made Z3 proof abstraction configurable
2010-02-22 blanchet 2010-02-22 enabled Nitpick's support for quotient types + shortened the Nitpick tests a bit
2010-02-19 Cezary Kaliszyk 2010-02-19 Initial version of HOL quotient package.
2010-01-14 blanchet 2010-01-14 reorder Quickcheck and Nitpick, so that Quickcheck gets loaded first and Auto-Quickcheck runs first (since it takes less time)
2009-10-29 blanchet 2009-10-29 readded Predicate_Compile to Main
2009-10-28 blanchet 2009-10-28 merged my Auto Nitpick change with Lukas's Predicate Compiler changes
2009-10-28 blanchet 2009-10-28 introduced Auto Nitpick in addition to Auto Quickcheck; this required generalizing the theorem hook used by Quickcheck, following a suggestion by Florian
2009-10-27 bulwahn 2009-10-27 including the predicate compiler in HOL-Main; added RandomPredicate monad to Quickcheck
2009-10-22 blanchet 2009-10-22 added Nitpick's theory and ML files to Isabelle/HOL; the examples and the documentation are on their way.
2009-05-19 haftmann 2009-05-19 moved Code_Index, Random and Quickcheck before Main
2009-02-13 nipkow 2009-02-13 Moved Nat_Int_Bij into Library
2009-02-06 blanchet 2009-02-06 Rearrange Refute/SAT theory dependencies so as to use even more antiquotations in refute.ML + find/fix Product_Type.{fst,snd}, which are now called simply fst and snd.
2009-01-02 wenzelm 2009-01-02 tuned header and description of boot files;
2008-09-17 wenzelm 2008-09-17 moved global ML bindings to global place;
2008-09-16 haftmann 2008-09-16 evaluation using code generator
2008-09-02 nipkow 2008-09-02 Streamlined parts of Complex/ex/DenumRat and AFP/Integration/Rats and distributed them over Real/ (to do with bijections and density). Library/NatPair became Nat_Int_Bij and made that part of Main.
2008-06-26 haftmann 2008-06-26 added dummy citiation
2008-04-22 haftmann 2008-04-22 dropped theory PreList
2008-01-25 haftmann 2008-01-25 consistent interacitve bootstrap of HOL-Main
2007-10-29 wenzelm 2007-10-29 qualified Proofterm.proofs;
2007-09-27 paulson 2007-09-27 removal of some "ref"s from res_axioms.ML; a side-effect is that the ordering theorems of Nat.thy are hidden by the Ordering.thy versions
2007-09-25 haftmann 2007-09-25 datatype interpretators for size and datatype_realizer
2007-09-19 berghofe 2007-09-19 Enclosed end_theory in text antiquotation to make LaTeX happy.
2007-09-18 paulson 2007-09-18 metis now available in PreList
2007-05-31 wenzelm 2007-05-31 HOL_proofs;
2007-05-06 haftmann 2007-05-06 minimal import
2006-11-08 wenzelm 2006-11-08 incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
2006-08-25 paulson 2006-08-25 replaced skolem declarations by automatic skolemization of everything
2006-08-08 paulson 2006-08-08 skolem declarations for built-in theorems
2006-05-10 wenzelm 2006-05-10 revert accidental text change;
2006-05-09 haftmann 2006-05-09 introduced characters for code generator; some improved code lemmas for some list functions
2005-12-23 paulson 2005-12-23 the "skolem" attribute and better initialization of the clause database
2005-12-01 paulson 2005-12-01 restoring the old status of subset_refl
2005-10-19 mengj 2005-10-19 Added files in order to use external ATPs as oracles and invoke these ATPs by calling Isabelle methods (currently "vampire" and "eprover").
2005-09-29 wenzelm 2005-09-29 explicit dependencies of SAT vs. Refute; moved late refute setup to SAT;
2005-09-23 webertj 2005-09-23 new sat tactic imports resolution proofs from zChaff
2005-09-23 webertj 2005-09-23 header (title/ID) added
2005-09-23 webertj 2005-09-23 typo fixed: rufute -> refute
2005-09-20 wenzelm 2005-09-20 removed Commutative_Ring hacks;
2005-09-17 wenzelm 2005-09-17 minor cleanup, moved stuff in its proper place;
2005-09-15 paulson 2005-09-15 moving Commutative_Ring to the correct theory
2005-09-14 wenzelm 2005-09-14 hide the rather generic names used in theory Commutative_Ring;
2005-09-14 wenzelm 2005-09-14 imports Commutative_Ring;
2005-07-12 berghofe 2005-07-12 Auxiliary functions to be used in generated code are now defined using "attach".
2005-07-01 berghofe 2005-07-01 Moved some code lemmas from Main to Nat.
2005-06-28 paulson 2005-06-28 Constant "If" is now local
2005-05-16 paulson 2005-05-16 Use of instead of int in most numeric simprocs; avoids integer overflow in SML/NJ
2005-04-28 paulson 2005-04-28 fixed treatment of higher-order simprules