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)
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;