2008-03-06 wenzelm removed obsolete THIS_IS_ISABELLE_BUILD/MAKEBIN feature;
2008-03-05 wenzelm renamed test_markup to output_markup;
2008-03-05 wenzelm IsabelleProcess.output_markup;
2008-03-05 wenzelm closeup: minor tuning of term traversal;
2008-03-05 wenzelm ISABELLE_LINE_EDITOR: prefer rlwrap, which passes interrupts properly;
2008-03-05 wenzelm explicit referencing of background facts;
2008-03-05 wenzelm explicit referencing of background facts;
2008-03-05 wenzelm explicit referencing of background facts;
2008-03-05 wenzelm indexing literal facts: exclude background context;
2008-03-05 wenzelm put_thms: do not index facts here (affects prems/this/calculation in particular);
2008-03-05 wenzelm explicit referencing of background facts;
2008-03-05 wenzelm HOL/Library/RBT.thy;
2008-03-05 krauss NEWS: RBTs, renamings in ZF
2008-03-05 krauss Use conversions instead of simplifier. tuned
2008-03-04 urbanc added new example
2008-03-03 haftmann tuned
2008-03-03 haftmann continued localization
2008-03-03 krauss new theory of red-black trees, an efficient implementation of finite maps.
2008-03-02 nipkow Generalized Zorn and added well-ordering theorem
2008-03-01 wenzelm tuned ML code, more antiquotations;
2008-03-01 wenzelm misc cleanup of embedded ML code;
2008-03-01 wenzelm added @{const} antiquotation;
2008-03-01 wenzelm use more antiquotations;
2008-02-28 wenzelm unused_thms: print via official context (ProofContext.pretty_fact),
2008-02-28 berghofe Added function for finding unused theorems.
2008-02-28 berghofe Added unused_thms command.
2008-02-28 haftmann import all 'special code' types
2008-02-28 haftmann added code generator setup
2008-02-28 wenzelm Transitive_Closure: induct and cases rules now declare proper case_names;
2008-02-28 wenzelm Transitive_Closure: induct and cases rules now declare proper case_names;
2008-02-28 wenzelm rtranclp_induct, tranclp_induct: added case_names;
2008-02-28 nipkow tuned
2008-02-28 wenzelm removed legacy ML bindings;
2008-02-28 wenzelm tuned syntax declaration;
2008-02-28 wenzelm wf_trancl: structured proof;
2008-02-28 wenzelm rtranclE, tranclE: tuned statement, added case_names;
2008-02-27 wenzelm renamed ListSpace to ListVector;
2008-02-27 wenzelm added HOL-Library;
2008-02-27 wenzelm more precise handling of "group" for termination;
2008-02-27 haftmann added theories for imperative HOL
2008-02-27 haftmann added theory for countable types
2008-02-27 haftmann added theory for reflected types
2008-02-27 haftmann proper merge of base sorts
2008-02-27 nipkow Renamed ListSpace to ListVector
2008-02-27 chaieb Fixed dependency on Dense_Linear_Order
2008-02-27 schirmer removed some debugging output from trace
2008-02-27 chaieb Loads Dense_Linear_Order (needed dlo_simps)
2008-02-27 chaieb Fixed dependencies for proofs -- ferrack needed
2008-02-27 chaieb Old HOL/Dense_Linear_Order.thy and the setup in Arith_Tools for Ferrante and Rackoff's Quantifier elimination for linear arithmetic over ordered Fields.
2008-02-27 chaieb fixed dependencies
2008-02-27 chaieb Removed theorems from default simpset
2008-02-27 chaieb Fixed proofs
2008-02-27 chaieb Loads Dense_Linear_Order.thy
2008-02-27 chaieb loads Tools/Qelim/qelim.ML
2008-02-27 chaieb HOL/Dense_Linear_Order.thy moved to Library ; resulting dependencies updated
2008-02-27 chaieb Installation of Quantifier elimination for ordered fields moved to Library/Dense_Linear_Order.thy
2008-02-26 haftmann other UNIV lemmas
2008-02-26 haftmann some more primrec
2008-02-26 haftmann class itself works around a problem with class interpretation in class finite
2008-02-26 haftmann moved some set lemmas from Set.thy here
(0) -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip