Fri, 11 Nov 2011 10:40:36 +0100 increasing values_timeout to avoid failures of isatest with HOL-IMP
bulwahn [Fri, 11 Nov 2011 10:40:36 +0100] rev 45452
increasing values_timeout to avoid failures of isatest with HOL-IMP
Fri, 11 Nov 2011 08:32:48 +0100 renaming example invocations: tester predicate_compile is renamed to smart_exhaustive
bulwahn [Fri, 11 Nov 2011 08:32:48 +0100] rev 45451
renaming example invocations: tester predicate_compile is renamed to smart_exhaustive
Fri, 11 Nov 2011 08:32:45 +0100 adding CPS compilation to predicate compiler;
bulwahn [Fri, 11 Nov 2011 08:32:45 +0100] rev 45450
adding CPS compilation to predicate compiler; removing function_flattening reference; new testers smart_exhaustive and smart_slow_exhaustive; renaming PredicateCompFuns to Predicate_Comp_Funs;
Fri, 11 Nov 2011 08:32:44 +0100 adding option allow_function_inversion to quickcheck options
bulwahn [Fri, 11 Nov 2011 08:32:44 +0100] rev 45449
adding option allow_function_inversion to quickcheck options
Thu, 10 Nov 2011 23:30:50 +0100 more efficient prepare_sorts -- bypass encoded positions;
wenzelm [Thu, 10 Nov 2011 23:30:50 +0100] rev 45448
more efficient prepare_sorts -- bypass encoded positions;
Thu, 10 Nov 2011 22:54:15 +0100 suppress irrelevant positions;
wenzelm [Thu, 10 Nov 2011 22:54:15 +0100] rev 45447
suppress irrelevant positions;
Thu, 10 Nov 2011 22:39:32 +0100 more generous margin;
wenzelm [Thu, 10 Nov 2011 22:39:32 +0100] rev 45446
more generous margin;
Thu, 10 Nov 2011 22:32:10 +0100 pass term positions into check phase, where resulting types are reported accordingly, and eventually shown as tooltips;
wenzelm [Thu, 10 Nov 2011 22:32:10 +0100] rev 45445
pass term positions into check phase, where resulting types are reported accordingly, and eventually shown as tooltips;
Thu, 10 Nov 2011 17:47:25 +0100 tuned signature;
wenzelm [Thu, 10 Nov 2011 17:47:25 +0100] rev 45444
tuned signature;
Thu, 10 Nov 2011 17:41:36 +0100 discontinued unused Thm.compress (again);
wenzelm [Thu, 10 Nov 2011 17:41:36 +0100] rev 45443
discontinued unused Thm.compress (again);
Thu, 10 Nov 2011 17:28:02 +0100 renewed prolog-quickcheck
bulwahn [Thu, 10 Nov 2011 17:28:02 +0100] rev 45442
renewed prolog-quickcheck
Thu, 10 Nov 2011 17:26:17 +0100 adding some test cases for preprocessing and narrowing
bulwahn [Thu, 10 Nov 2011 17:26:17 +0100] rev 45441
adding some test cases for preprocessing and narrowing
Thu, 10 Nov 2011 17:26:15 +0100 adding a minimalistic preprocessing rewriting common boolean operators; tuned
bulwahn [Thu, 10 Nov 2011 17:26:15 +0100] rev 45440
adding a minimalistic preprocessing rewriting common boolean operators; tuned
Thu, 10 Nov 2011 14:46:38 +0100 merged
huffman [Thu, 10 Nov 2011 14:46:38 +0100] rev 45439
merged
Wed, 09 Nov 2011 15:33:34 +0100 merged
huffman [Wed, 09 Nov 2011 15:33:34 +0100] rev 45438
merged
Wed, 09 Nov 2011 15:33:24 +0100 tune post-processing of simproc-generated rules so they won't produce Numeral0 or Numeral1
huffman [Wed, 09 Nov 2011 15:33:24 +0100] rev 45437
tune post-processing of simproc-generated rules so they won't produce Numeral0 or Numeral1
Wed, 09 Nov 2011 11:44:42 +0100 use simproc_setup for some nat_numeral simprocs; add simproc tests
huffman [Wed, 09 Nov 2011 11:44:42 +0100] rev 45436
use simproc_setup for some nat_numeral simprocs; add simproc tests
Wed, 09 Nov 2011 10:58:08 +0100 add ring_char_0 class constraints to several simprocs (internal proofs of #n ~= 0 fail for type
huffman [Wed, 09 Nov 2011 10:58:08 +0100] rev 45435
add ring_char_0 class constraints to several simprocs (internal proofs of #n ~= 0 fail for type s not in this class); test simprocs using most general type classes instead of just int and rat.
Thu, 10 Nov 2011 11:02:06 +0100 simultaneous check;
wenzelm [Thu, 10 Nov 2011 11:02:06 +0100] rev 45434
simultaneous check; tight maxidx;
Wed, 09 Nov 2011 23:16:47 +0100 avoid separate typ_check phases, integrate into main term_check 0 instead (cf. its Syntax.check_typs in Type_Infer_Context.prepare);
wenzelm [Wed, 09 Nov 2011 23:16:47 +0100] rev 45433
avoid separate typ_check phases, integrate into main term_check 0 instead (cf. its Syntax.check_typs in Type_Infer_Context.prepare);
Wed, 09 Nov 2011 22:43:14 +0100 clarified singleton_fixate: intersection with supersort is identity, only replace actual type inference parameters;
wenzelm [Wed, 09 Nov 2011 22:43:14 +0100] rev 45432
clarified singleton_fixate: intersection with supersort is identity, only replace actual type inference parameters; tuned reject_other, after_infer_fixate;
Wed, 09 Nov 2011 21:44:06 +0100 misc tuning and simplification;
wenzelm [Wed, 09 Nov 2011 21:44:06 +0100] rev 45431
misc tuning and simplification;
Wed, 09 Nov 2011 21:36:18 +0100 misc tuning;
wenzelm [Wed, 09 Nov 2011 21:36:18 +0100] rev 45430
misc tuning;
Wed, 09 Nov 2011 20:47:11 +0100 tuned signature;
wenzelm [Wed, 09 Nov 2011 20:47:11 +0100] rev 45429
tuned signature; tuned;
Wed, 09 Nov 2011 19:01:50 +0100 quickcheck invocations in mutabelle must not catch codegenerator errors internally
bulwahn [Wed, 09 Nov 2011 19:01:50 +0100] rev 45428
quickcheck invocations in mutabelle must not catch codegenerator errors internally
Wed, 09 Nov 2011 17:57:42 +0100 sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm [Wed, 09 Nov 2011 17:57:42 +0100] rev 45427
sort assignment before simultaneous term_check, not isolated parse_term; prefer Syntax.read_typ over Syntax.parse_typ, to include check phase for sort assignment; simplified Syntax_Phases.decode_sort/decode_typ; discontinued unused Proof_Context.check_tvar;
Wed, 09 Nov 2011 17:12:26 +0100 tuned;
wenzelm [Wed, 09 Nov 2011 17:12:26 +0100] rev 45426
tuned;
Wed, 09 Nov 2011 17:08:40 +0100 avoid inconsistent sort constraints;
wenzelm [Wed, 09 Nov 2011 17:08:40 +0100] rev 45425
avoid inconsistent sort constraints;
(0) -30000 -10000 -3000 -1000 -300 -100 -50 -28 +28 +50 +100 +300 +1000 +3000 +10000 +30000 tip