src/HOL/Main.thy
2004-05-26 webertj 2004-05-26 new default parameters for refute
2004-03-26 webertj 2004-03-26 satsolver=dpll
2004-03-10 webertj 2004-03-10 changed default values for refute
2004-03-08 paulson 2004-03-08 generic theorems about exponentials; general tidying up
2004-01-10 webertj 2004-01-10 Adding 'refute' to HOL.
2003-09-22 berghofe 2003-09-22 Improved efficiency of code generated for < predicate on natural numbers.
2003-07-11 berghofe 2003-07-11 - Installed specific code generator for equality enforcing that arguments do not have function types, which would result in an error message during compilation. - Added test case generators for basic types.
2003-05-27 berghofe 2003-05-27 Added term_of function for product type.
2002-12-16 berghofe 2002-12-16 Added mk_int and mk_list.
2002-07-21 berghofe 2002-07-21 Added theory for setting up program extraction.
2002-07-16 wenzelm 2002-07-16 moved stuff to List.thy;
2002-04-19 berghofe 2002-04-19 code generator: wfrec combinator is now implemented by ML function wf_rec.
2001-12-20 berghofe 2001-12-20 Declared characteristic equations for < on nat for code generation.
2001-12-10 berghofe 2001-12-10 Tuned code generator setup.
2001-11-03 wenzelm 2001-11-03 moved String into Main;
2001-08-31 berghofe 2001-08-31 Added code generator setup.
2001-08-08 paulson 2001-08-08 Hilbert_Choice is needed only in Main itself
2000-11-24 nipkow 2000-11-24 hide many names from Datatype_Universe.
2000-11-03 wenzelm 2000-11-03 provide case names for rev_induct, rev_cases;
2000-10-18 wenzelm 2000-10-18 tuned declarations;
2000-09-06 wenzelm 2000-09-06 tuned;
2000-09-05 wenzelm 2000-09-05 lemmas [recdef_cong] = map_cong;
2000-09-01 wenzelm 2000-09-01 lemmas [mono] = lists_mono;
2000-08-18 wenzelm 2000-08-18 Main now new-style theory; added Main.ML for compatibility;
2000-08-17 wenzelm 2000-08-17 fixed deps;
2000-07-26 nipkow 2000-07-26 *** empty log message ***
2000-03-16 wenzelm 2000-03-16 added HOL/PreLIst.thy;
1999-08-02 paulson 1999-08-02 the SVC link-up
1999-07-19 paulson 1999-07-19 NatBin: binary arithmetic for the naturals
1999-07-08 paulson 1999-07-08 new theory IntDiv.thy
1999-06-04 wenzelm 1999-06-04 Calculation.thy: Setup transitivity rules for calculational proofs.
1999-01-05 nipkow 1999-01-05 In Main: moved Bin to the left to preserve the solver in its simpset.
1998-09-09 oheimb 1998-09-09 changed order of included theories
1998-08-12 oheimb 1998-08-12 cleanup for Fun.thy: merged Update.{thy|ML} into Fun.{thy|ML} moved o_def from HOL.thy to Fun.thy added Id_def to Fun.thy moved image_compose from Set.ML to Fun.ML moved o_apply and o_assoc from simpdata.ML to Fun.ML moved fun_upd_same and fun_upd_other (from Map.ML) to Fun.ML added fun_upd_twist to Fun.ML
1998-07-03 wenzelm 1998-07-03 theory Main includes everything;
1998-07-03 wenzelm 1998-07-03 stepping stones;