wenzelm [Tue, 16 May 2006 13:05:37 +0200] rev 19650
Amine Chaieb: Ferrante and Rackoff Algorithm;
wenzelm [Tue, 16 May 2006 13:05:14 +0200] rev 19649
Sign.certify_sort;
wenzelm [Tue, 16 May 2006 13:01:31 +0200] rev 19648
tuned;
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);
wenzelm [Tue, 16 May 2006 13:01:29 +0200] rev 19646
avoid low-level Term.str_of_term;
wenzelm [Tue, 16 May 2006 13:01:28 +0200] rev 19645
abstract interfaces for type algebra;
tuned;
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;
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;
wenzelm [Tue, 16 May 2006 13:01:24 +0200] rev 19642
more abstract interface to classes/arities;
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);
wenzelm [Tue, 16 May 2006 13:01:22 +0200] rev 19640
added Ferrante and Rackoff Algorithm -- by Amine Chaieb;
haftmann [Tue, 16 May 2006 09:19:12 +0200] rev 19639
fixed handling of absolute urls
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
wenzelm [Sat, 13 May 2006 21:13:25 +0200] rev 19637
reactivated translations for less/less_eq;
wenzelm [Sat, 13 May 2006 02:51:49 +0200] rev 19636
added add_primrec_unchecked_i;
wenzelm [Sat, 13 May 2006 02:51:48 +0200] rev 19635
unchecked definitions;
wenzelm [Sat, 13 May 2006 02:51:47 +0200] rev 19634
defs (unchecked overloaded), including former primrec;
tuned;
wenzelm [Sat, 13 May 2006 02:51:46 +0200] rev 19633
updated;
wenzelm [Sat, 13 May 2006 02:51:45 +0200] rev 19632
add_defs: unchecked flag;
tuned;
wenzelm [Sat, 13 May 2006 02:51:43 +0200] rev 19631
'defs': unchecked flag;
wenzelm [Sat, 13 May 2006 02:51:42 +0200] rev 19630
Theory.add_defs(_i): added unchecked flag;
wenzelm [Sat, 13 May 2006 02:51:40 +0200] rev 19629
added add_defs_unchecked(_i);
wenzelm [Sat, 13 May 2006 02:51:37 +0200] rev 19628
actually reject malformed defs;
added unchecked flag;
tuned;
wenzelm [Sat, 13 May 2006 02:51:35 +0200] rev 19627
moved defs explanation to isar-ref;
wenzelm [Sat, 13 May 2006 02:51:33 +0200] rev 19626
added defs (unchecked)'';
more explanations on well-formednes of defs;
wenzelm [Sat, 13 May 2006 02:51:30 +0200] rev 19625
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm [Fri, 12 May 2006 18:11:09 +0200] rev 19624
tuned;
nipkow [Fri, 12 May 2006 11:19:41 +0200] rev 19623
added lemma in_measure
haftmann [Fri, 12 May 2006 10:38:00 +0200] rev 19622
fixed silly bug in function serializer for ML
huffman [Fri, 12 May 2006 04:20:02 +0200] rev 19621
add new finite chain theorems
wenzelm [Fri, 12 May 2006 01:01:08 +0200] rev 19620
improved propagate_deps;
removed structs_less, which is actually unsound in conjunction with interdependent overloaded consts;
wenzelm [Thu, 11 May 2006 21:46:17 +0200] rev 19619
check result against certified prop, i.e. admit non-normal statements;