krauss [Wed, 05 Mar 2008 12:24:52 +0100] rev 26196
Use conversions instead of simplifier. tuned
urbanc [Tue, 04 Mar 2008 13:35:45 +0100] rev 26195
added new example
haftmann [Mon, 03 Mar 2008 15:37:16 +0100] rev 26194
tuned
haftmann [Mon, 03 Mar 2008 15:37:14 +0100] rev 26193
continued localization
krauss [Mon, 03 Mar 2008 14:03:19 +0100] rev 26192
new theory of red-black trees, an efficient implementation of finite maps.
nipkow [Sun, 02 Mar 2008 15:02:06 +0100] rev 26191
Generalized Zorn and added well-ordering theorem
wenzelm [Sat, 01 Mar 2008 15:01:03 +0100] rev 26190
tuned ML code, more antiquotations;
wenzelm [Sat, 01 Mar 2008 14:10:15 +0100] rev 26189
misc cleanup of embedded ML code;
use more antiquotations;
tuned;
wenzelm [Sat, 01 Mar 2008 14:10:14 +0100] rev 26188
added @{const} antiquotation;
wenzelm [Sat, 01 Mar 2008 14:10:13 +0100] rev 26187
use more antiquotations;
wenzelm [Thu, 28 Feb 2008 18:59:22 +0100] rev 26186
unused_thms: print via official context (ProofContext.pretty_fact),
not just the theory certificate (Display.pretty_thm);
tuned;
berghofe [Thu, 28 Feb 2008 17:34:15 +0100] rev 26185
Added function for finding unused theorems.
berghofe [Thu, 28 Feb 2008 17:33:35 +0100] rev 26184
Added unused_thms command.
haftmann [Thu, 28 Feb 2008 16:54:56 +0100] rev 26183
import all 'special code' types
haftmann [Thu, 28 Feb 2008 16:50:52 +0100] rev 26182
added code generator setup
wenzelm [Thu, 28 Feb 2008 15:55:33 +0100] rev 26181
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm [Thu, 28 Feb 2008 15:55:04 +0100] rev 26180
Transitive_Closure: induct and cases rules now declare proper case_names;
tuned;
wenzelm [Thu, 28 Feb 2008 15:54:37 +0100] rev 26179
rtranclp_induct, tranclp_induct: added case_names;
tuned proofs;
nipkow [Thu, 28 Feb 2008 14:04:29 +0100] rev 26178
tuned
wenzelm [Thu, 28 Feb 2008 12:56:33 +0100] rev 26177
removed legacy ML bindings;
wenzelm [Thu, 28 Feb 2008 12:56:31 +0100] rev 26176
tuned syntax declaration;
wenzelm [Thu, 28 Feb 2008 12:56:30 +0100] rev 26175
wf_trancl: structured proof;
tuned proofs;
removed legacy ML bindings;
wenzelm [Thu, 28 Feb 2008 12:56:28 +0100] rev 26174
rtranclE, tranclE: tuned statement, added case_names;
wenzelm [Thu, 28 Feb 2008 00:11:28 +0100] rev 26173
renamed ListSpace to ListVector;
wenzelm [Thu, 28 Feb 2008 00:04:47 +0100] rev 26172
added HOL-Library;
wenzelm [Wed, 27 Feb 2008 21:46:13 +0100] rev 26171
more precise handling of "group" for termination;
haftmann [Wed, 27 Feb 2008 21:41:08 +0100] rev 26170
added theories for imperative HOL
haftmann [Wed, 27 Feb 2008 21:41:07 +0100] rev 26169
added theory for countable types
haftmann [Wed, 27 Feb 2008 21:41:06 +0100] rev 26168
added theory for reflected types
haftmann [Wed, 27 Feb 2008 21:41:05 +0100] rev 26167
proper merge of base sorts
nipkow [Wed, 27 Feb 2008 18:01:10 +0100] rev 26166
Renamed ListSpace to ListVector
chaieb [Wed, 27 Feb 2008 16:41:36 +0100] rev 26165
Fixed dependency on Dense_Linear_Order
schirmer [Wed, 27 Feb 2008 16:07:55 +0100] rev 26164
removed some debugging output from trace
chaieb [Wed, 27 Feb 2008 15:35:43 +0100] rev 26163
Loads Dense_Linear_Order (needed dlo_simps)
chaieb [Wed, 27 Feb 2008 15:35:42 +0100] rev 26162
Fixed dependencies for proofs -- ferrack needed
chaieb [Wed, 27 Feb 2008 14:39:58 +0100] rev 26161
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.
chaieb [Wed, 27 Feb 2008 14:39:56 +0100] rev 26160
fixed dependencies
chaieb [Wed, 27 Feb 2008 14:39:54 +0100] rev 26159
Removed theorems from default simpset
chaieb [Wed, 27 Feb 2008 14:39:52 +0100] rev 26158
Fixed proofs
chaieb [Wed, 27 Feb 2008 14:39:51 +0100] rev 26157
Loads Dense_Linear_Order.thy
chaieb [Wed, 27 Feb 2008 14:39:50 +0100] rev 26156
loads Tools/Qelim/qelim.ML
chaieb [Wed, 27 Feb 2008 14:39:49 +0100] rev 26155
HOL/Dense_Linear_Order.thy moved to Library ; resulting dependencies updated
chaieb [Wed, 27 Feb 2008 14:39:48 +0100] rev 26154
Installation of Quantifier elimination for ordered fields moved to Library/Dense_Linear_Order.thy
haftmann [Tue, 26 Feb 2008 20:38:18 +0100] rev 26153
other UNIV lemmas
haftmann [Tue, 26 Feb 2008 20:38:17 +0100] rev 26152
some more primrec
haftmann [Tue, 26 Feb 2008 20:38:16 +0100] rev 26151
class itself works around a problem with class interpretation in class finite
haftmann [Tue, 26 Feb 2008 20:38:15 +0100] rev 26150
moved some set lemmas from Set.thy here
haftmann [Tue, 26 Feb 2008 20:38:14 +0100] rev 26149
tuned heading
haftmann [Tue, 26 Feb 2008 20:38:13 +0100] rev 26148
char and nibble are finite
haftmann [Tue, 26 Feb 2008 20:38:12 +0100] rev 26147
moved some set lemmas to Set.thy
haftmann [Tue, 26 Feb 2008 20:38:10 +0100] rev 26146
tuned proofs
wenzelm [Tue, 26 Feb 2008 16:10:54 +0100] rev 26145
tuned document;
tuned proofs;
wenzelm [Tue, 26 Feb 2008 16:10:54 +0100] rev 26144
tuned document;
bulwahn [Tue, 26 Feb 2008 11:18:43 +0100] rev 26143
Added useful general lemmas from the work with the HeapMonad
haftmann [Tue, 26 Feb 2008 07:59:59 +0100] rev 26142
some steps towards automated generators
haftmann [Tue, 26 Feb 2008 07:59:58 +0100] rev 26141
operation collapse
haftmann [Tue, 26 Feb 2008 07:59:57 +0100] rev 26140
Zero/Suc recursion combinator for type index
haftmann [Tue, 26 Feb 2008 07:59:56 +0100] rev 26139
added accidental omissions
wenzelm [Mon, 25 Feb 2008 19:48:06 +0100] rev 26138
thm_deps: sort result;
wenzelm [Mon, 25 Feb 2008 19:38:48 +0100] rev 26137
tuned msg;