Wed, 20 Jul 2011 08:16:42 +0200 deactivating quickcheck invocation in this example until the Interrupt issue is understood
bulwahn [Wed, 20 Jul 2011 08:16:42 +0200] rev 43916
deactivating quickcheck invocation in this example until the Interrupt issue is understood
Wed, 20 Jul 2011 08:16:41 +0200 removing inner time limits in quickcheck
bulwahn [Wed, 20 Jul 2011 08:16:41 +0200] rev 43915
removing inner time limits in quickcheck
Wed, 20 Jul 2011 08:16:39 +0200 updating documentation about quickcheck; adding information about try
bulwahn [Wed, 20 Jul 2011 08:16:39 +0200] rev 43914
updating documentation about quickcheck; adding information about try
Wed, 20 Jul 2011 08:16:38 +0200 adapting example in Predicate_Compile_Examples
bulwahn [Wed, 20 Jul 2011 08:16:38 +0200] rev 43913
adapting example in Predicate_Compile_Examples
Wed, 20 Jul 2011 08:16:36 +0200 exporting function in quickcheck; adapting mutabelle script
bulwahn [Wed, 20 Jul 2011 08:16:36 +0200] rev 43912
exporting function in quickcheck; adapting mutabelle script
Wed, 20 Jul 2011 08:16:35 +0200 more information for the user how to deactivate quickcheck_narrowing if he does not want to use it
bulwahn [Wed, 20 Jul 2011 08:16:35 +0200] rev 43911
more information for the user how to deactivate quickcheck_narrowing if he does not want to use it
Wed, 20 Jul 2011 08:16:33 +0200 making messages more informative
bulwahn [Wed, 20 Jul 2011 08:16:33 +0200] rev 43910
making messages more informative
Wed, 20 Jul 2011 08:16:32 +0200 only use exhaustive testing in this quickcheck example
bulwahn [Wed, 20 Jul 2011 08:16:32 +0200] rev 43909
only use exhaustive testing in this quickcheck example
Wed, 20 Jul 2011 00:37:42 +0200 parse equalities correctly in Nitrox parser
blanchet [Wed, 20 Jul 2011 00:37:42 +0200] rev 43908
parse equalities correctly in Nitrox parser
Wed, 20 Jul 2011 00:37:42 +0200 pass type arguments to lambda-lifted Frees, to account for polymorphism
blanchet [Wed, 20 Jul 2011 00:37:42 +0200] rev 43907
pass type arguments to lambda-lifted Frees, to account for polymorphism
Wed, 20 Jul 2011 00:37:42 +0200 generate slightly less type information -- this should be sound since type arguments should keep things cleanly apart
blanchet [Wed, 20 Jul 2011 00:37:42 +0200] rev 43906
generate slightly less type information -- this should be sound since type arguments should keep things cleanly apart
Wed, 20 Jul 2011 00:37:42 +0200 avoid calling "Term.is_first_order" (indirectly) on a term with loose de Bruijns -- this is not necessary anyway because of the Abs check in "simple_translate_lambdas"
blanchet [Wed, 20 Jul 2011 00:37:42 +0200] rev 43905
avoid calling "Term.is_first_order" (indirectly) on a term with loose de Bruijns -- this is not necessary anyway because of the Abs check in "simple_translate_lambdas"
Wed, 20 Jul 2011 00:37:42 +0200 remove offset from Mirabelle output
blanchet [Wed, 20 Jul 2011 00:37:42 +0200] rev 43904
remove offset from Mirabelle output
Tue, 19 Jul 2011 11:15:38 +0200 the HOL4PROOFS setting is actually HOL4_PROOFS
krauss [Tue, 19 Jul 2011 11:15:38 +0200] rev 43903
the HOL4PROOFS setting is actually HOL4_PROOFS
Tue, 19 Jul 2011 07:14:14 +0200 merged
haftmann [Tue, 19 Jul 2011 07:14:14 +0200] rev 43902
merged
Mon, 18 Jul 2011 21:52:34 +0200 proof tuning
haftmann [Mon, 18 Jul 2011 21:52:34 +0200] rev 43901
proof tuning
Mon, 18 Jul 2011 21:49:39 +0200 generalization; various notation and proof tuning
haftmann [Mon, 18 Jul 2011 21:49:39 +0200] rev 43900
generalization; various notation and proof tuning
Mon, 18 Jul 2011 21:34:01 +0200 avoid misunderstandable names
haftmann [Mon, 18 Jul 2011 21:34:01 +0200] rev 43899
avoid misunderstandable names
Mon, 18 Jul 2011 21:15:51 +0200 moved lemmas to appropriate theory
haftmann [Mon, 18 Jul 2011 21:15:51 +0200] rev 43898
moved lemmas to appropriate theory
Tue, 19 Jul 2011 00:16:18 +0200 forgotten qualifier
krauss [Tue, 19 Jul 2011 00:16:18 +0200] rev 43897
forgotten qualifier
Tue, 19 Jul 2011 00:07:21 +0200 values_timeout defaults to 600.0 on SML/NJ -- saves us from cluttering all theories equivalent declarations
krauss [Tue, 19 Jul 2011 00:07:21 +0200] rev 43896
values_timeout defaults to 600.0 on SML/NJ -- saves us from cluttering all theories equivalent declarations
Mon, 18 Jul 2011 23:48:28 +0200 killed use of PolyML.makestring
krauss [Mon, 18 Jul 2011 23:48:28 +0200] rev 43895
killed use of PolyML.makestring
Mon, 18 Jul 2011 23:35:50 +0200 added experimental mira configuration for HOL Light importer
krauss [Mon, 18 Jul 2011 23:35:50 +0200] rev 43894
added experimental mira configuration for HOL Light importer
Mon, 18 Jul 2011 18:52:52 +0200 allow rules with premises to be declared as z3_rule (to circumvent incompleteness of Z3 proof reconstruction)
boehmes [Mon, 18 Jul 2011 18:52:52 +0200] rev 43893
allow rules with premises to be declared as z3_rule (to circumvent incompleteness of Z3 proof reconstruction)
Mon, 18 Jul 2011 13:49:26 +0200 unactivating narrowing-based quickcheck by default
bulwahn [Mon, 18 Jul 2011 13:49:26 +0200] rev 43892
unactivating narrowing-based quickcheck by default
Mon, 18 Jul 2011 13:48:35 +0200 making active configuration public in narrowing-based quickcheck
bulwahn [Mon, 18 Jul 2011 13:48:35 +0200] rev 43891
making active configuration public in narrowing-based quickcheck
Mon, 18 Jul 2011 11:38:14 +0200 declare tester in this quickcheck example
bulwahn [Mon, 18 Jul 2011 11:38:14 +0200] rev 43890
declare tester in this quickcheck example
Mon, 18 Jul 2011 10:34:21 +0200 adding code equations for partial_term_of for rational numbers
bulwahn [Mon, 18 Jul 2011 10:34:21 +0200] rev 43889
adding code equations for partial_term_of for rational numbers
Mon, 18 Jul 2011 10:34:21 +0200 adapting an experimental setup to changes in quickcheck's infrastructure
bulwahn [Mon, 18 Jul 2011 10:34:21 +0200] rev 43888
adapting an experimental setup to changes in quickcheck's infrastructure
Mon, 18 Jul 2011 10:34:21 +0200 adding narrowing instances for real and rational
bulwahn [Mon, 18 Jul 2011 10:34:21 +0200] rev 43887
adding narrowing instances for real and rational
Mon, 18 Jul 2011 10:34:21 +0200 adapting quickcheck based on the analysis of the predicate compiler
bulwahn [Mon, 18 Jul 2011 10:34:21 +0200] rev 43886
adapting quickcheck based on the analysis of the predicate compiler
Mon, 18 Jul 2011 10:34:21 +0200 adapting prolog-based tester
bulwahn [Mon, 18 Jul 2011 10:34:21 +0200] rev 43885
adapting prolog-based tester
Mon, 18 Jul 2011 10:34:21 +0200 quickcheck does not deactivate testers if none are given
bulwahn [Mon, 18 Jul 2011 10:34:21 +0200] rev 43884
quickcheck does not deactivate testers if none are given
Mon, 18 Jul 2011 10:34:21 +0200 adapting mutabelle to latest changes in quickcheck; removing unused code in mutabelle
bulwahn [Mon, 18 Jul 2011 10:34:21 +0200] rev 43883
adapting mutabelle to latest changes in quickcheck; removing unused code in mutabelle
Mon, 18 Jul 2011 10:34:21 +0200 renaming quickcheck_tester to quickcheck_batch_tester; tuned
bulwahn [Mon, 18 Jul 2011 10:34:21 +0200] rev 43882
renaming quickcheck_tester to quickcheck_batch_tester; tuned
Mon, 18 Jul 2011 10:34:21 +0200 changing parser in quickcheck to activate and deactivate the testers
bulwahn [Mon, 18 Jul 2011 10:34:21 +0200] rev 43881
changing parser in quickcheck to activate and deactivate the testers
Mon, 18 Jul 2011 10:34:21 +0200 adapting SML_Quickcheck to new quickcheck infrastructure
bulwahn [Mon, 18 Jul 2011 10:34:21 +0200] rev 43880
adapting SML_Quickcheck to new quickcheck infrastructure
Mon, 18 Jul 2011 10:34:21 +0200 enabling parallel execution of testers but removing more informative quickcheck output
bulwahn [Mon, 18 Jul 2011 10:34:21 +0200] rev 43879
enabling parallel execution of testers but removing more informative quickcheck output
Mon, 18 Jul 2011 10:34:21 +0200 changed every tester to have a configuration in quickcheck; enabling parallel testing of different testers in quickcheck
bulwahn [Mon, 18 Jul 2011 10:34:21 +0200] rev 43878
changed every tester to have a configuration in quickcheck; enabling parallel testing of different testers in quickcheck
Mon, 18 Jul 2011 10:34:21 +0200 removing generator registration
bulwahn [Mon, 18 Jul 2011 10:34:21 +0200] rev 43877
removing generator registration
Mon, 18 Jul 2011 10:34:21 +0200 parametrized test_term functions in quickcheck
bulwahn [Mon, 18 Jul 2011 10:34:21 +0200] rev 43876
parametrized test_term functions in quickcheck
Mon, 18 Jul 2011 10:34:21 +0200 adding random, exhaustive and SML quickcheck as testers
bulwahn [Mon, 18 Jul 2011 10:34:21 +0200] rev 43875
adding random, exhaustive and SML quickcheck as testers
Sun, 17 Jul 2011 22:25:14 +0200 more on complement
haftmann [Sun, 17 Jul 2011 22:25:14 +0200] rev 43874
more on complement
Sun, 17 Jul 2011 22:24:08 +0200 more on complement
haftmann [Sun, 17 Jul 2011 22:24:08 +0200] rev 43873
more on complement
Sun, 17 Jul 2011 20:57:56 +0200 more consistent theorem names
haftmann [Sun, 17 Jul 2011 20:57:56 +0200] rev 43872
more consistent theorem names
Sun, 17 Jul 2011 20:46:51 +0200 more lemmas about SUP
haftmann [Sun, 17 Jul 2011 20:46:51 +0200] rev 43871
more lemmas about SUP
Sun, 17 Jul 2011 20:29:54 +0200 structuring duals together
haftmann [Sun, 17 Jul 2011 20:29:54 +0200] rev 43870
structuring duals together
Sun, 17 Jul 2011 20:23:39 +0200 merged
haftmann [Sun, 17 Jul 2011 20:23:39 +0200] rev 43869
merged
Sun, 17 Jul 2011 20:23:33 +0200 more lemmas about Sup
haftmann [Sun, 17 Jul 2011 20:23:33 +0200] rev 43868
more lemmas about Sup
Sun, 17 Jul 2011 19:55:17 +0200 generalized INT_anti_mono
haftmann [Sun, 17 Jul 2011 19:55:17 +0200] rev 43867
generalized INT_anti_mono
Sun, 17 Jul 2011 19:48:02 +0200 moving UNIV = ... equations to their proper theories
haftmann [Sun, 17 Jul 2011 19:48:02 +0200] rev 43866
moving UNIV = ... equations to their proper theories
Sun, 17 Jul 2011 15:15:58 +0200 further generalization from sets to complete lattices
haftmann [Sun, 17 Jul 2011 15:15:58 +0200] rev 43865
further generalization from sets to complete lattices
Sun, 17 Jul 2011 14:21:19 +0200 fixed lambda-liftg: must ensure the formulas are in close form
blanchet [Sun, 17 Jul 2011 14:21:19 +0200] rev 43864
fixed lambda-liftg: must ensure the formulas are in close form
Sun, 17 Jul 2011 14:12:45 +0200 ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet [Sun, 17 Jul 2011 14:12:45 +0200] rev 43863
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
Sun, 17 Jul 2011 14:11:35 +0200 pass kind to lambda-translation function
blanchet [Sun, 17 Jul 2011 14:11:35 +0200] rev 43862
pass kind to lambda-translation function
Sun, 17 Jul 2011 14:11:35 +0200 more refactoring of preprocessing
blanchet [Sun, 17 Jul 2011 14:11:35 +0200] rev 43861
more refactoring of preprocessing
Sun, 17 Jul 2011 14:11:35 +0200 more refactoring of preprocessing, so as to be able to centralize it
blanchet [Sun, 17 Jul 2011 14:11:35 +0200] rev 43860
more refactoring of preprocessing, so as to be able to centralize it
Sun, 17 Jul 2011 14:11:35 +0200 renamed internal data structure
blanchet [Sun, 17 Jul 2011 14:11:35 +0200] rev 43859
renamed internal data structure
Sun, 17 Jul 2011 14:11:35 +0200 simplify code -- there are no lambdas in helpers anyway
blanchet [Sun, 17 Jul 2011 14:11:35 +0200] rev 43858
simplify code -- there are no lambdas in helpers anyway
Sun, 17 Jul 2011 14:11:35 +0200 added lambda-lifting to Sledgehammer (rough)
blanchet [Sun, 17 Jul 2011 14:11:35 +0200] rev 43857
added lambda-lifting to Sledgehammer (rough)
(0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip