Mon, 05 Nov 2007 20:50:43 +0100 TheoryTarget.context;
wenzelm [Mon, 05 Nov 2007 20:50:43 +0100] rev 25290
TheoryTarget.context;
Mon, 05 Nov 2007 20:50:42 +0100 simplified LocalTheory.reinit;
wenzelm [Mon, 05 Nov 2007 20:50:42 +0100] rev 25289
simplified LocalTheory.reinit;
Mon, 05 Nov 2007 20:50:41 +0100 improved error message for missing predicates;
wenzelm [Mon, 05 Nov 2007 20:50:41 +0100] rev 25288
improved error message for missing predicates;
Mon, 05 Nov 2007 18:18:39 +0100 added lemmas
nipkow [Mon, 05 Nov 2007 18:18:39 +0100] rev 25287
added lemmas
Mon, 05 Nov 2007 17:48:51 +0100 Use of export rather than standard in interpretation.
ballarin [Mon, 05 Nov 2007 17:48:51 +0100] rev 25286
Use of export rather than standard in interpretation.
Mon, 05 Nov 2007 17:48:34 +0100 Removed inst_morphism'; satisfy_thm avoids compose.
ballarin [Mon, 05 Nov 2007 17:48:34 +0100] rev 25285
Removed inst_morphism'; satisfy_thm avoids compose.
Mon, 05 Nov 2007 17:48:17 +0100 Interpretation with named equations.
ballarin [Mon, 05 Nov 2007 17:48:17 +0100] rev 25284
Interpretation with named equations.
Mon, 05 Nov 2007 17:48:04 +0100 Type instance of thm mk_left_commute in locales.
ballarin [Mon, 05 Nov 2007 17:48:04 +0100] rev 25283
Type instance of thm mk_left_commute in locales.
Mon, 05 Nov 2007 17:47:52 +0100 Tests enforce proper export behaviour.
ballarin [Mon, 05 Nov 2007 17:47:52 +0100] rev 25282
Tests enforce proper export behaviour.
Mon, 05 Nov 2007 15:37:41 +0100 removed advanced recdef section and replaced it by citation of Alex's tutorial.
nipkow [Mon, 05 Nov 2007 15:37:41 +0100] rev 25281
removed advanced recdef section and replaced it by citation of Alex's tutorial.
Mon, 05 Nov 2007 15:04:19 +0100 fix
nipkow [Mon, 05 Nov 2007 15:04:19 +0100] rev 25280
fix
Mon, 05 Nov 2007 15:01:21 +0100 no Gencode.ML
obua [Mon, 05 Nov 2007 15:01:21 +0100] rev 25279
no Gencode.ML
Mon, 05 Nov 2007 14:26:41 +0100 changed "treemap" example to "mirror"
krauss [Mon, 05 Nov 2007 14:26:41 +0100] rev 25278
changed "treemap" example to "mirror"
Mon, 05 Nov 2007 08:31:12 +0100 added lemmas
nipkow [Mon, 05 Nov 2007 08:31:12 +0100] rev 25277
added lemmas
Sun, 04 Nov 2007 19:17:13 +0100 replaced cc/ld phase by PolyML.SaveState.saveState (potentially more efficient);
wenzelm [Sun, 04 Nov 2007 19:17:13 +0100] rev 25276
replaced cc/ld phase by PolyML.SaveState.saveState (potentially more efficient);
Sun, 04 Nov 2007 17:12:14 +0100 removed obsolete ProofGeneral/parsing.ML;
wenzelm [Sun, 04 Nov 2007 17:12:14 +0100] rev 25275
removed obsolete ProofGeneral/parsing.ML;
Sun, 04 Nov 2007 16:43:31 +0100 activated new script parser;
wenzelm [Sun, 04 Nov 2007 16:43:31 +0100] rev 25274
activated new script parser;
Sun, 04 Nov 2007 16:43:29 +0100 Output.add_mode default prevents escapes from ProofGeneral mode;
wenzelm [Sun, 04 Nov 2007 16:43:29 +0100] rev 25273
Output.add_mode default prevents escapes from ProofGeneral mode;
Sun, 04 Nov 2007 16:43:28 +0100 added ProofGeneral/pgml_isabelle.ML;
wenzelm [Sun, 04 Nov 2007 16:43:28 +0100] rev 25272
added ProofGeneral/pgml_isabelle.ML;
Sun, 04 Nov 2007 16:43:27 +0100 the all-important ML antiquotations are back;
wenzelm [Sun, 04 Nov 2007 16:43:27 +0100] rev 25271
the all-important ML antiquotations are back; tuned;
Fri, 02 Nov 2007 18:53:01 +0100 generic tactic Method.intros_tac
haftmann [Fri, 02 Nov 2007 18:53:01 +0100] rev 25270
generic tactic Method.intros_tac
Fri, 02 Nov 2007 18:53:00 +0100 clarified theory target interface
haftmann [Fri, 02 Nov 2007 18:53:00 +0100] rev 25269
clarified theory target interface
Fri, 02 Nov 2007 18:52:59 +0100 more precise treatment of prove_subclass
haftmann [Fri, 02 Nov 2007 18:52:59 +0100] rev 25268
more precise treatment of prove_subclass
Fri, 02 Nov 2007 18:52:58 +0100 proper reinitialisation after subclass
haftmann [Fri, 02 Nov 2007 18:52:58 +0100] rev 25267
proper reinitialisation after subclass
Fri, 02 Nov 2007 18:52:57 +0100 clarified
haftmann [Fri, 02 Nov 2007 18:52:57 +0100] rev 25266
clarified
Fri, 02 Nov 2007 16:38:37 +0100 tweaked
paulson [Fri, 02 Nov 2007 16:38:37 +0100] rev 25265
tweaked
Fri, 02 Nov 2007 16:38:14 +0100 recdef to fun
paulson [Fri, 02 Nov 2007 16:38:14 +0100] rev 25264
recdef to fun
Fri, 02 Nov 2007 15:56:49 +0100 *** empty log message ***
nipkow [Fri, 02 Nov 2007 15:56:49 +0100] rev 25263
*** empty log message ***
Fri, 02 Nov 2007 12:35:27 +0100 Added reference to Jeremy Dawson's paper on the word library.
kleing [Fri, 02 Nov 2007 12:35:27 +0100] rev 25262
Added reference to Jeremy Dawson's paper on the word library. Added header to remaining word/*.thy files so they show up in toc.
Fri, 02 Nov 2007 08:59:15 +0100 recdef -> fun
nipkow [Fri, 02 Nov 2007 08:59:15 +0100] rev 25261
recdef -> fun
Fri, 02 Nov 2007 08:26:01 +0100 added Fun
nipkow [Fri, 02 Nov 2007 08:26:01 +0100] rev 25260
added Fun
Fri, 02 Nov 2007 08:17:33 +0100 tuned
haftmann [Fri, 02 Nov 2007 08:17:33 +0100] rev 25259
tuned
Thu, 01 Nov 2007 20:20:19 +0100 recdef -> fun
nipkow [Thu, 01 Nov 2007 20:20:19 +0100] rev 25258
recdef -> fun
Thu, 01 Nov 2007 13:44:44 +0100 *** empty log message ***
nipkow [Thu, 01 Nov 2007 13:44:44 +0100] rev 25257
*** empty log message ***
Wed, 31 Oct 2007 15:10:34 +0100 Catch exceptions arising during the abstraction operation.
paulson [Wed, 31 Oct 2007 15:10:34 +0100] rev 25256
Catch exceptions arising during the abstraction operation. Filter out theorems that are "too deep".
Wed, 31 Oct 2007 12:19:45 +0100 Added example for the ideal membership problem solved by algebra
chaieb [Wed, 31 Oct 2007 12:19:45 +0100] rev 25255
Added example for the ideal membership problem solved by algebra
Wed, 31 Oct 2007 12:19:44 +0100 Added field ideal into entry - uses by algebra method to prove the ideal membership problem
chaieb [Wed, 31 Oct 2007 12:19:44 +0100] rev 25254
Added field ideal into entry - uses by algebra method to prove the ideal membership problem
Wed, 31 Oct 2007 12:19:43 +0100 changed signature according to normalizer_data.ML
chaieb [Wed, 31 Oct 2007 12:19:43 +0100] rev 25253
changed signature according to normalizer_data.ML
Wed, 31 Oct 2007 12:19:41 +0100 tuned
chaieb [Wed, 31 Oct 2007 12:19:41 +0100] rev 25252
tuned
Wed, 31 Oct 2007 12:19:37 +0100 (1) signatures updated according to normalizer_data.ML (added field ideal in entry);
chaieb [Wed, 31 Oct 2007 12:19:37 +0100] rev 25251
(1) signatures updated according to normalizer_data.ML (added field ideal in entry); (2) For a theory the conversions returned are now ring_conv (as before, proves a universal statement), simple_ideal proves ideal membership for one polynomial ; multi_ideal solves the more general ideal membership for several existentially quantifier variables involved in several conjunctions; a simpset containing a simproc to turn x = y into p = 0 where p is the normal form of x - y; (3) Added ideal_tac a tactic to prove general ideal membership (cf. John Harrision CADE 2007) ; (4) Added algebra_tac : first tries ring_tac (old algebra) then ideal_tac
Wed, 31 Oct 2007 12:19:35 +0100 (1) added axiom to ringb and theorems to enable algebra to prove the ideal membership problem; (2) Method algebra now calls algebra_tac which first tries to solve a universal formula, then in case of failure trie to solve the ideal membership problem (see HOL/Tools/Groebner_Basis/groebner.ML)
chaieb [Wed, 31 Oct 2007 12:19:35 +0100] rev 25250
(1) added axiom to ringb and theorems to enable algebra to prove the ideal membership problem; (2) Method algebra now calls algebra_tac which first tries to solve a universal formula, then in case of failure trie to solve the ideal membership problem (see HOL/Tools/Groebner_Basis/groebner.ML)
Wed, 31 Oct 2007 12:19:33 +0100 exported field_comp_conv: a numerical conversion over fields
chaieb [Wed, 31 Oct 2007 12:19:33 +0100] rev 25249
exported field_comp_conv: a numerical conversion over fields
Wed, 31 Oct 2007 10:37:14 +0100 dropped AxClass
haftmann [Wed, 31 Oct 2007 10:37:14 +0100] rev 25248
dropped AxClass
Wed, 31 Oct 2007 10:10:50 +0100 tuned
haftmann [Wed, 31 Oct 2007 10:10:50 +0100] rev 25247
tuned
Tue, 30 Oct 2007 17:58:03 +0100 Handle Subscript exception when looking up bound variables.
berghofe [Tue, 30 Oct 2007 17:58:03 +0100] rev 25246
Handle Subscript exception when looking up bound variables.
Tue, 30 Oct 2007 17:56:56 +0100 Added well-formedness check to Abst case in function prf_of.
berghofe [Tue, 30 Oct 2007 17:56:56 +0100] rev 25245
Added well-formedness check to Abst case in function prf_of.
Tue, 30 Oct 2007 16:00:30 +0100 added omission
haftmann [Tue, 30 Oct 2007 16:00:30 +0100] rev 25244
added omission
Tue, 30 Oct 2007 15:28:53 +0100 bugfixes concerning strange theorems
paulson [Tue, 30 Oct 2007 15:28:53 +0100] rev 25243
bugfixes concerning strange theorems
Tue, 30 Oct 2007 15:13:48 +0100 fixed typo
haftmann [Tue, 30 Oct 2007 15:13:48 +0100] rev 25242
fixed typo
Tue, 30 Oct 2007 14:39:37 +0100 const antiquotation clarified
haftmann [Tue, 30 Oct 2007 14:39:37 +0100] rev 25241
const antiquotation clarified
Tue, 30 Oct 2007 14:39:36 +0100 clarified
haftmann [Tue, 30 Oct 2007 14:39:36 +0100] rev 25240
clarified
Tue, 30 Oct 2007 14:39:35 +0100 handling of notation in class target
haftmann [Tue, 30 Oct 2007 14:39:35 +0100] rev 25239
handling of notation in class target
Tue, 30 Oct 2007 12:14:24 +0100 fixed document preparation
haftmann [Tue, 30 Oct 2007 12:14:24 +0100] rev 25238
fixed document preparation
Tue, 30 Oct 2007 12:14:23 +0100 improved website integration
haftmann [Tue, 30 Oct 2007 12:14:23 +0100] rev 25237
improved website integration
Tue, 30 Oct 2007 12:14:22 +0100 adjusted
haftmann [Tue, 30 Oct 2007 12:14:22 +0100] rev 25236
adjusted
Tue, 30 Oct 2007 10:51:35 +0100 split library index into templates
haftmann [Tue, 30 Oct 2007 10:51:35 +0100] rev 25235
split library index into templates
Tue, 30 Oct 2007 10:51:35 +0100 split library index into templates
haftmann [Tue, 30 Oct 2007 10:51:35 +0100] rev 25234
split library index into templates
Tue, 30 Oct 2007 10:41:19 +0100 structured
haftmann [Tue, 30 Oct 2007 10:41:19 +0100] rev 25233
structured
Tue, 30 Oct 2007 10:30:09 +0100 tidied version
haftmann [Tue, 30 Oct 2007 10:30:09 +0100] rev 25232
tidied version
Tue, 30 Oct 2007 08:45:55 +0100 simplified proof
haftmann [Tue, 30 Oct 2007 08:45:55 +0100] rev 25231
simplified proof
(0) -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip