Sat, 20 May 2006 23:36:55 +0200 List.partition;
wenzelm [Sat, 20 May 2006 23:36:55 +0200] rev 19686
List.partition;
Sat, 20 May 2006 23:36:53 +0200 ax_derivs: precise typing;
wenzelm [Sat, 20 May 2006 23:36:53 +0200] rev 19685
ax_derivs: precise typing;
Sat, 20 May 2006 23:36:51 +0200 pow: unchecked;
wenzelm [Sat, 20 May 2006 23:36:51 +0200] rev 19684
pow: unchecked;
Sat, 20 May 2006 23:36:49 +0200 removed obsolete 'finalconsts';
wenzelm [Sat, 20 May 2006 23:36:49 +0200] rev 19683
removed obsolete 'finalconsts';
Wed, 17 May 2006 22:36:08 +0200 * Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm [Wed, 17 May 2006 22:36:08 +0200] rev 19682
* Pure: syntax 'CONST name' produces a fully internalized constant; tuned;
Wed, 17 May 2006 22:34:52 +0200 added CONST syntax;
wenzelm [Wed, 17 May 2006 22:34:52 +0200] rev 19681
added CONST syntax; tuned interfaces;
Wed, 17 May 2006 22:34:50 +0200 export generic term_syntax;
wenzelm [Wed, 17 May 2006 22:34:50 +0200] rev 19680
export generic term_syntax;
Wed, 17 May 2006 22:34:49 +0200 consts: replaced early'' flag by inverted authentic'';
wenzelm [Wed, 17 May 2006 22:34:49 +0200] rev 19679
consts: replaced early'' flag by inverted authentic''; tuned interfaces;
Wed, 17 May 2006 22:34:47 +0200 added mapping;
wenzelm [Wed, 17 May 2006 22:34:47 +0200] rev 19678
added mapping;
Wed, 17 May 2006 22:34:45 +0200 replaced early'' flag by inverted authentic'';
wenzelm [Wed, 17 May 2006 22:34:45 +0200] rev 19677
replaced early'' flag by inverted authentic'';
Wed, 17 May 2006 22:34:44 +0200 renamed CONST to CONSTANT;
wenzelm [Wed, 17 May 2006 22:34:44 +0200] rev 19676
renamed CONST to CONSTANT;
Wed, 17 May 2006 12:28:47 +0200 removing the string array from the result of get_clasimp_atp_lemmas
paulson [Wed, 17 May 2006 12:28:47 +0200] rev 19675
removing the string array from the result of get_clasimp_atp_lemmas
Wed, 17 May 2006 01:23:48 +0200 const_syntax;
wenzelm [Wed, 17 May 2006 01:23:48 +0200] rev 19674
const_syntax;
Wed, 17 May 2006 01:23:46 +0200 always preserve authentic consts -- removed Syntax.mixfix_const;
wenzelm [Wed, 17 May 2006 01:23:46 +0200] rev 19673
always preserve authentic consts -- removed Syntax.mixfix_const;
Wed, 17 May 2006 01:23:44 +0200 tuned;
wenzelm [Wed, 17 May 2006 01:23:44 +0200] rev 19672
tuned;
Wed, 17 May 2006 01:23:43 +0200 removed outdated/redundant comments;
wenzelm [Wed, 17 May 2006 01:23:43 +0200] rev 19671
removed outdated/redundant comments;
Wed, 17 May 2006 01:23:41 +0200 prefer 'definition' over low-level defs;
wenzelm [Wed, 17 May 2006 01:23:41 +0200] rev 19670
prefer 'definition' over low-level defs; tuned source/document;
Wed, 17 May 2006 01:23:40 +0200 tuned source/document;
wenzelm [Wed, 17 May 2006 01:23:40 +0200] rev 19669
tuned source/document;
Tue, 16 May 2006 21:34:06 +0200 hide const subst;
wenzelm [Tue, 16 May 2006 21:34:06 +0200] rev 19668
hide const subst;
Tue, 16 May 2006 21:33:26 +0200 tuned;
wenzelm [Tue, 16 May 2006 21:33:26 +0200] rev 19667
tuned;
Tue, 16 May 2006 21:33:24 +0200 const_syntax;
wenzelm [Tue, 16 May 2006 21:33:24 +0200] rev 19666
const_syntax;
Tue, 16 May 2006 21:33:23 +0200 * Isar/locale: 'const_syntax';
wenzelm [Tue, 16 May 2006 21:33:23 +0200] rev 19665
* Isar/locale: 'const_syntax';
Tue, 16 May 2006 21:33:21 +0200 added const_syntax(_i);
wenzelm [Tue, 16 May 2006 21:33:21 +0200] rev 19664
added const_syntax(_i);
Tue, 16 May 2006 21:33:18 +0200 export consts_of;
wenzelm [Tue, 16 May 2006 21:33:18 +0200] rev 19663
export consts_of; added add_const_syntax; tuned interface;
Tue, 16 May 2006 21:33:16 +0200 replaced abbrevs by term_syntax, which is both simpler and more general;
wenzelm [Tue, 16 May 2006 21:33:16 +0200] rev 19662
replaced abbrevs by term_syntax, which is both simpler and more general;
Tue, 16 May 2006 21:33:14 +0200 added syntax interface;
wenzelm [Tue, 16 May 2006 21:33:14 +0200] rev 19661
added syntax interface; tuned interface;
Tue, 16 May 2006 21:33:11 +0200 added add_modesyntax;
wenzelm [Tue, 16 May 2006 21:33:11 +0200] rev 19660
added add_modesyntax; tuned;
Tue, 16 May 2006 21:33:09 +0200 added 'const_syntax';
wenzelm [Tue, 16 May 2006 21:33:09 +0200] rev 19659
added 'const_syntax';
Tue, 16 May 2006 21:33:07 +0200 added add_const_syntax, add_consts_authentic;
wenzelm [Tue, 16 May 2006 21:33:07 +0200] rev 19658
added add_const_syntax, add_consts_authentic; tuned interface;
Tue, 16 May 2006 21:33:05 +0200 added syntax interface;
wenzelm [Tue, 16 May 2006 21:33:05 +0200] rev 19657
added syntax interface;
Tue, 16 May 2006 21:33:01 +0200 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm [Tue, 16 May 2006 21:33:01 +0200] rev 19656
tuned concrete syntax -- abbreviation/const_syntax;
Tue, 16 May 2006 21:32:56 +0200 updated;
wenzelm [Tue, 16 May 2006 21:32:56 +0200] rev 19655
updated;
Tue, 16 May 2006 20:28:02 +0200 updated;
wenzelm [Tue, 16 May 2006 20:28:02 +0200] rev 19654
updated;
Tue, 16 May 2006 18:31:46 +0200 * Pure/library: divide_and_conquer;
wenzelm [Tue, 16 May 2006 18:31:46 +0200] rev 19653
* Pure/library: divide_and_conquer; * Theory Real: new method ferrack;
Tue, 16 May 2006 18:20:26 +0200 replaced references to the robot by the mailing list page
paulson [Tue, 16 May 2006 18:20:26 +0200] rev 19652
replaced references to the robot by the mailing list page
Tue, 16 May 2006 14:11:39 +0200 added a much simpler proof for the iteration and
urbanc [Tue, 16 May 2006 14:11:39 +0200] rev 19651
added a much simpler proof for the iteration and recursion combinator - this also fixes a bug which prevented the nightly build from being build (sorry)
Tue, 16 May 2006 13:05:37 +0200 Amine Chaieb: Ferrante and Rackoff Algorithm;
wenzelm [Tue, 16 May 2006 13:05:37 +0200] rev 19650
Amine Chaieb: Ferrante and Rackoff Algorithm;
Tue, 16 May 2006 13:05:14 +0200 Sign.certify_sort;
wenzelm [Tue, 16 May 2006 13:05:14 +0200] rev 19649
Sign.certify_sort;
Tue, 16 May 2006 13:01:31 +0200 tuned;
wenzelm [Tue, 16 May 2006 13:01:31 +0200] rev 19648
tuned;
Tue, 16 May 2006 13:01:30 +0200 removed low-level str_of_sort/typ/term (use Display.raw_string_of_sort/typ/term instead, or even PolyML.print -- for debugging purposes);
wenzelm [Tue, 16 May 2006 13:01:30 +0200] rev 19647
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 avoid low-level Term.str_of_term;
wenzelm [Tue, 16 May 2006 13:01:29 +0200] rev 19646
avoid low-level Term.str_of_term;
Tue, 16 May 2006 13:01:28 +0200 abstract interfaces for type algebra;
wenzelm [Tue, 16 May 2006 13:01:28 +0200] rev 19645
abstract interfaces for type algebra; tuned;
Tue, 16 May 2006 13:01:27 +0200 added divide_and_conquer combinator (by Amine Chaieb);
wenzelm [Tue, 16 May 2006 13:01:27 +0200] rev 19644
added divide_and_conquer combinator (by Amine Chaieb); removed remains of old option type; removed obsolete eq_opt; removed obsolete string_of_bool (use Bool.toString instead); tuned;
Tue, 16 May 2006 13:01:26 +0200 added low-level string_of_term (back again from term.ML) -- should avoid this altogether;
wenzelm [Tue, 16 May 2006 13:01:26 +0200] rev 19643
added low-level string_of_term (back again from term.ML) -- should avoid this altogether;
Tue, 16 May 2006 13:01:24 +0200 more abstract interface to classes/arities;
wenzelm [Tue, 16 May 2006 13:01:24 +0200] rev 19642
more abstract interface to classes/arities;
Tue, 16 May 2006 13:01:23 +0200 replaced low-level Term.str_of by Display.raw_string_of_term (should actually use Display.string_of_term);
wenzelm [Tue, 16 May 2006 13:01:23 +0200] rev 19641
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 added Ferrante and Rackoff Algorithm -- by Amine Chaieb;
wenzelm [Tue, 16 May 2006 13:01:22 +0200] rev 19640
added Ferrante and Rackoff Algorithm -- by Amine Chaieb;
Tue, 16 May 2006 09:19:12 +0200 fixed handling of absolute urls
haftmann [Tue, 16 May 2006 09:19:12 +0200] rev 19639
fixed handling of absolute urls
Mon, 15 May 2006 19:40:17 +0200 added the lemmas pt_fresh_aux and pt_fresh_aux_ineq
urbanc [Mon, 15 May 2006 19:40:17 +0200] rev 19638
added the lemmas pt_fresh_aux and pt_fresh_aux_ineq (they are used in the proof of the strong induction principle) added code to nominal_atoms to collect these lemmas in "fresh_aux" instantiated for each atom type deleted the fresh_fun_eqvt from nominal_atoms, since fresh_fun is not used anymore in the recursion combinator
Sat, 13 May 2006 21:13:25 +0200 reactivated translations for less/less_eq;
wenzelm [Sat, 13 May 2006 21:13:25 +0200] rev 19637
reactivated translations for less/less_eq;
Sat, 13 May 2006 02:51:49 +0200 added add_primrec_unchecked_i;
wenzelm [Sat, 13 May 2006 02:51:49 +0200] rev 19636
added add_primrec_unchecked_i;
Sat, 13 May 2006 02:51:48 +0200 unchecked definitions;
wenzelm [Sat, 13 May 2006 02:51:48 +0200] rev 19635
unchecked definitions;
Sat, 13 May 2006 02:51:47 +0200 defs (unchecked overloaded), including former primrec;
wenzelm [Sat, 13 May 2006 02:51:47 +0200] rev 19634
defs (unchecked overloaded), including former primrec; tuned;
Sat, 13 May 2006 02:51:46 +0200 updated;
wenzelm [Sat, 13 May 2006 02:51:46 +0200] rev 19633
updated;
Sat, 13 May 2006 02:51:45 +0200 add_defs: unchecked flag;
wenzelm [Sat, 13 May 2006 02:51:45 +0200] rev 19632
add_defs: unchecked flag; tuned;
Sat, 13 May 2006 02:51:43 +0200 'defs': unchecked flag;
wenzelm [Sat, 13 May 2006 02:51:43 +0200] rev 19631
'defs': unchecked flag;
Sat, 13 May 2006 02:51:42 +0200 Theory.add_defs(_i): added unchecked flag;
wenzelm [Sat, 13 May 2006 02:51:42 +0200] rev 19630
Theory.add_defs(_i): added unchecked flag;
Sat, 13 May 2006 02:51:40 +0200 added add_defs_unchecked(_i);
wenzelm [Sat, 13 May 2006 02:51:40 +0200] rev 19629
added add_defs_unchecked(_i);
Sat, 13 May 2006 02:51:37 +0200 actually reject malformed defs;
wenzelm [Sat, 13 May 2006 02:51:37 +0200] rev 19628
actually reject malformed defs; added unchecked flag; tuned;
Sat, 13 May 2006 02:51:35 +0200 moved defs explanation to isar-ref;
wenzelm [Sat, 13 May 2006 02:51:35 +0200] rev 19627
moved defs explanation to isar-ref;
(0) -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip