Wed, 17 May 2006 01:23:40 +0200 wenzelm tuned source/document;
Tue, 16 May 2006 21:34:06 +0200 wenzelm hide const subst;
Tue, 16 May 2006 21:33:26 +0200 wenzelm tuned;
Tue, 16 May 2006 21:33:24 +0200 wenzelm const_syntax;
Tue, 16 May 2006 21:33:23 +0200 wenzelm * Isar/locale: 'const_syntax';
Tue, 16 May 2006 21:33:21 +0200 wenzelm added const_syntax(_i);
Tue, 16 May 2006 21:33:18 +0200 wenzelm export consts_of;
Tue, 16 May 2006 21:33:16 +0200 wenzelm replaced abbrevs by term_syntax, which is both simpler and more general;
Tue, 16 May 2006 21:33:14 +0200 wenzelm added syntax interface;
Tue, 16 May 2006 21:33:11 +0200 wenzelm added add_modesyntax;
Tue, 16 May 2006 21:33:09 +0200 wenzelm added 'const_syntax';
Tue, 16 May 2006 21:33:07 +0200 wenzelm added add_const_syntax, add_consts_authentic;
Tue, 16 May 2006 21:33:05 +0200 wenzelm added syntax interface;
Tue, 16 May 2006 21:33:01 +0200 wenzelm tuned concrete syntax -- abbreviation/const_syntax;
Tue, 16 May 2006 21:32:56 +0200 wenzelm updated;
Tue, 16 May 2006 20:28:02 +0200 wenzelm updated;
Tue, 16 May 2006 18:31:46 +0200 wenzelm * Pure/library: divide_and_conquer;
Tue, 16 May 2006 18:20:26 +0200 paulson replaced references to the robot by the mailing list page
Tue, 16 May 2006 14:11:39 +0200 urbanc added a much simpler proof for the iteration and
Tue, 16 May 2006 13:05:37 +0200 wenzelm Amine Chaieb: Ferrante and Rackoff Algorithm;
Tue, 16 May 2006 13:05:14 +0200 wenzelm Sign.certify_sort;
Tue, 16 May 2006 13:01:31 +0200 wenzelm tuned;
Tue, 16 May 2006 13:01:30 +0200 wenzelm removed low-level str_of_sort/typ/term (use Display.raw_string_of_sort/typ/term instead, or even PolyML.print -- for debugging purposes);
Tue, 16 May 2006 13:01:29 +0200 wenzelm avoid low-level Term.str_of_term;
Tue, 16 May 2006 13:01:28 +0200 wenzelm abstract interfaces for type algebra;
Tue, 16 May 2006 13:01:27 +0200 wenzelm added divide_and_conquer combinator (by Amine Chaieb);
Tue, 16 May 2006 13:01:26 +0200 wenzelm added low-level string_of_term (back again from term.ML) -- should avoid this altogether;
Tue, 16 May 2006 13:01:24 +0200 wenzelm more abstract interface to classes/arities;
Tue, 16 May 2006 13:01:23 +0200 wenzelm replaced low-level Term.str_of by Display.raw_string_of_term (should actually use Display.string_of_term);
Tue, 16 May 2006 13:01:22 +0200 wenzelm added Ferrante and Rackoff Algorithm -- by Amine Chaieb;
Tue, 16 May 2006 09:19:12 +0200 haftmann fixed handling of absolute urls
Mon, 15 May 2006 19:40:17 +0200 urbanc added the lemmas pt_fresh_aux and pt_fresh_aux_ineq
Sat, 13 May 2006 21:13:25 +0200 wenzelm reactivated translations for less/less_eq;
Sat, 13 May 2006 02:51:49 +0200 wenzelm added add_primrec_unchecked_i;
Sat, 13 May 2006 02:51:48 +0200 wenzelm unchecked definitions;
Sat, 13 May 2006 02:51:47 +0200 wenzelm defs (unchecked overloaded), including former primrec;
Sat, 13 May 2006 02:51:46 +0200 wenzelm updated;
Sat, 13 May 2006 02:51:45 +0200 wenzelm add_defs: unchecked flag;
Sat, 13 May 2006 02:51:43 +0200 wenzelm 'defs': unchecked flag;
Sat, 13 May 2006 02:51:42 +0200 wenzelm Theory.add_defs(_i): added unchecked flag;
Sat, 13 May 2006 02:51:40 +0200 wenzelm added add_defs_unchecked(_i);
Sat, 13 May 2006 02:51:37 +0200 wenzelm actually reject malformed defs;
Sat, 13 May 2006 02:51:35 +0200 wenzelm moved defs explanation to isar-ref;
Sat, 13 May 2006 02:51:33 +0200 wenzelm added defs (unchecked)'';
Sat, 13 May 2006 02:51:30 +0200 wenzelm * Pure: overloaded definitions are now actually checked for acyclic dependencies;
Fri, 12 May 2006 18:11:09 +0200 wenzelm tuned;
Fri, 12 May 2006 11:19:41 +0200 nipkow added lemma in_measure
Fri, 12 May 2006 10:38:00 +0200 haftmann fixed silly bug in function serializer for ML
Fri, 12 May 2006 04:20:02 +0200 huffman add new finite chain theorems
Fri, 12 May 2006 01:01:08 +0200 wenzelm improved propagate_deps;
Thu, 11 May 2006 21:46:17 +0200 wenzelm check result against certified prop, i.e. admit non-normal statements;
Thu, 11 May 2006 19:19:33 +0200 wenzelm tuned;
Thu, 11 May 2006 19:19:31 +0200 wenzelm avoid raw equality on type thm;
Thu, 11 May 2006 19:15:16 +0200 wenzelm replaced Graph.fold_nodes by general Graph.fold;
Thu, 11 May 2006 19:15:15 +0200 wenzelm added fold;
Thu, 11 May 2006 19:15:14 +0200 wenzelm tuned Defs.merge;
Thu, 11 May 2006 19:15:13 +0200 wenzelm allow dependencies of disjoint collections of instances;
Thu, 11 May 2006 19:15:12 +0200 wenzelm use IntGraph from Pure;
Thu, 11 May 2006 15:46:40 +0200 krauss Function Package: Quick-and-dirty-fixed strange "Proved a different theorem bug"
Thu, 11 May 2006 11:11:05 +0200 krauss Fix: Auto term must apply wf-intro rules repeatedly.
(0) -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip