Mon, 13 Sep 2010 14:54:02 +0200 print mode for Imperative HOL overview; tuned and more accurate dependencies
haftmann [Mon, 13 Sep 2010 14:54:02 +0200] rev 39306
print mode for Imperative HOL overview; tuned and more accurate dependencies
Mon, 13 Sep 2010 14:53:56 +0200 'class' and 'type' are now antiquoations by default
haftmann [Mon, 13 Sep 2010 14:53:56 +0200] rev 39305
'class' and 'type' are now antiquoations by default
Mon, 13 Sep 2010 13:33:44 +0200 merged
wenzelm [Mon, 13 Sep 2010 13:33:44 +0200] rev 39304
merged
Mon, 13 Sep 2010 11:13:25 +0200 merged
nipkow [Mon, 13 Sep 2010 11:13:25 +0200] rev 39303
merged
Mon, 13 Sep 2010 11:13:15 +0200 renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
nipkow [Mon, 13 Sep 2010 11:13:15 +0200] rev 39302
renamed lemmas: ext_iff -> fun_eq_iff, set_ext_iff -> set_eq_iff, set_ext -> set_eqI
Mon, 13 Sep 2010 08:43:48 +0200 added and renamed lemmas
nipkow [Mon, 13 Sep 2010 08:43:48 +0200] rev 39301
added and renamed lemmas
Mon, 13 Sep 2010 09:29:43 +0200 merged
bulwahn [Mon, 13 Sep 2010 09:29:43 +0200] rev 39300
merged
Fri, 10 Sep 2010 17:53:25 +0200 directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
bulwahn [Fri, 10 Sep 2010 17:53:25 +0200] rev 39299
directly computing the values of interest instead of composing functions in an unintelligent way that causes exponential much garbage; using the latest theory
Mon, 13 Sep 2010 06:02:47 +0200 added preliminary support for SMT datatypes (for now restricted to tuples and lists); only the Z3 interface (in oracle mode) makes use of it, there is especially no Z3 proof reconstruction support for datatypes yet
boehmes [Mon, 13 Sep 2010 06:02:47 +0200] rev 39298
added preliminary support for SMT datatypes (for now restricted to tuples and lists); only the Z3 interface (in oracle mode) makes use of it, there is especially no Z3 proof reconstruction support for datatypes yet
Fri, 10 Sep 2010 23:56:35 +0200 use eta-contracted version for occurrence check (avoids possible non-termination)
krauss [Fri, 10 Sep 2010 23:56:35 +0200] rev 39297
use eta-contracted version for occurrence check (avoids possible non-termination) Test case: lemma "fwrap f = (%v. f v) ==> P f" apply clarify; pointed out by Thomas Sewell
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip