Mon, 04 Oct 2010 22:01:34 +0200 added "Meson" theory to Makefile
blanchet [Mon, 04 Oct 2010 22:01:34 +0200] rev 39945
added "Meson" theory to Makefile
Mon, 04 Oct 2010 21:57:23 +0200 update authors
blanchet [Mon, 04 Oct 2010 21:57:23 +0200] rev 39944
update authors
Mon, 04 Oct 2010 21:55:54 +0200 remove Meson from Hilbert_Choice
blanchet [Mon, 04 Oct 2010 21:55:54 +0200] rev 39943
remove Meson from Hilbert_Choice
Mon, 04 Oct 2010 21:50:32 +0200 remove Meson from Sledgehammer
blanchet [Mon, 04 Oct 2010 21:50:32 +0200] rev 39942
remove Meson from Sledgehammer
Mon, 04 Oct 2010 21:49:07 +0200 move Meson to Plain
blanchet [Mon, 04 Oct 2010 21:49:07 +0200] rev 39941
move Meson to Plain
Mon, 04 Oct 2010 21:37:42 +0200 move MESON files together
blanchet [Mon, 04 Oct 2010 21:37:42 +0200] rev 39940
move MESON files together
Mon, 04 Oct 2010 20:55:55 +0200 paramify new skolems just like old ones (cf. reveal_old_skolem_terms)
blanchet [Mon, 04 Oct 2010 20:55:55 +0200] rev 39939
paramify new skolems just like old ones (cf. reveal_old_skolem_terms)
Mon, 04 Oct 2010 18:31:34 +0200 fixed two bugs in new skolemizer: instantiations now take types into consideration, and rotate_tac is given the proper offset
blanchet [Mon, 04 Oct 2010 18:31:34 +0200] rev 39938
fixed two bugs in new skolemizer: instantiations now take types into consideration, and rotate_tac is given the proper offset
Mon, 04 Oct 2010 17:30:34 +0200 correctly handle multiple copies of the same axiom with the same types
blanchet [Mon, 04 Oct 2010 17:30:34 +0200] rev 39937
correctly handle multiple copies of the same axiom with the same types
Mon, 04 Oct 2010 16:36:20 +0200 put two operations in the right order
blanchet [Mon, 04 Oct 2010 16:36:20 +0200] rev 39936
put two operations in the right order
Mon, 04 Oct 2010 16:24:53 +0200 reintroduce old "unify_prem_with_concl" code to avoid reaching unification bound + primitive handling for polymorphism
blanchet [Mon, 04 Oct 2010 16:24:53 +0200] rev 39935
reintroduce old "unify_prem_with_concl" code to avoid reaching unification bound + primitive handling for polymorphism
Mon, 04 Oct 2010 15:05:19 +0200 apply "assume_tac" directly on the right assumption, using "rotate_tac" -- this ensures that the desired unifications are performed
blanchet [Mon, 04 Oct 2010 15:05:19 +0200] rev 39934
apply "assume_tac" directly on the right assumption, using "rotate_tac" -- this ensures that the desired unifications are performed
Mon, 04 Oct 2010 14:36:18 +0200 instantiate foralls and release exists in the order described by the topological order
blanchet [Mon, 04 Oct 2010 14:36:18 +0200] rev 39933
instantiate foralls and release exists in the order described by the topological order
Mon, 04 Oct 2010 14:34:15 +0200 reverted 0bfaaa81fc62, since "Thm.rename_boundvars" can't be relied upon to give unique names to bound variables
blanchet [Mon, 04 Oct 2010 14:34:15 +0200] rev 39932
reverted 0bfaaa81fc62, since "Thm.rename_boundvars" can't be relied upon to give unique names to bound variables
Mon, 04 Oct 2010 09:08:46 +0200 renamed internal function
blanchet [Mon, 04 Oct 2010 09:08:46 +0200] rev 39931
renamed internal function
Mon, 04 Oct 2010 09:05:15 +0200 hack in MESON to make it less likely that variables (e.g. "x") get renamed (e.g. "xa") when resolving
blanchet [Mon, 04 Oct 2010 09:05:15 +0200] rev 39930
hack in MESON to make it less likely that variables (e.g. "x") get renamed (e.g. "xa") when resolving
Wed, 06 Oct 2010 13:48:12 +0200 tuned header
haftmann [Wed, 06 Oct 2010 13:48:12 +0200] rev 39929
tuned header
Tue, 05 Oct 2010 18:09:31 +0200 tuned
krauss [Tue, 05 Oct 2010 18:09:31 +0200] rev 39928
tuned
Tue, 05 Oct 2010 18:09:29 +0200 force less agressively
krauss [Tue, 05 Oct 2010 18:09:29 +0200] rev 39927
force less agressively
Tue, 05 Oct 2010 16:33:16 +0200 lexicographic_order: replace parallel map with laziness to avoid wasting cycles on proofs that are not needed
krauss [Tue, 05 Oct 2010 16:33:16 +0200] rev 39926
lexicographic_order: replace parallel map with laziness to avoid wasting cycles on proofs that are not needed
Tue, 05 Oct 2010 14:19:43 +0200 removed complicated (and rarely helpful) error reporting
krauss [Tue, 05 Oct 2010 14:19:43 +0200] rev 39925
removed complicated (and rarely helpful) error reporting
Tue, 05 Oct 2010 14:19:40 +0200 discontinued continuations to simplify control flow; dropped optimization in scnp
krauss [Tue, 05 Oct 2010 14:19:40 +0200] rev 39924
discontinued continuations to simplify control flow; dropped optimization in scnp
Tue, 05 Oct 2010 14:19:38 +0200 use Cache structure instead of passing tables around explicitly
krauss [Tue, 05 Oct 2010 14:19:38 +0200] rev 39923
use Cache structure instead of passing tables around explicitly
Tue, 05 Oct 2010 11:45:16 +0200 merged
haftmann [Tue, 05 Oct 2010 11:45:16 +0200] rev 39922
merged
Tue, 05 Oct 2010 11:37:42 +0200 lemmas fold_commute and fold_commute_apply
haftmann [Tue, 05 Oct 2010 11:37:42 +0200] rev 39921
lemmas fold_commute and fold_commute_apply
Fri, 07 May 2010 15:36:03 +0200 spelling
krauss [Fri, 07 May 2010 15:36:03 +0200] rev 39920
spelling
Mon, 04 Oct 2010 14:46:49 +0200 adjusted to inductive characterization of sorted
haftmann [Mon, 04 Oct 2010 14:46:49 +0200] rev 39919
adjusted to inductive characterization of sorted
Mon, 04 Oct 2010 14:46:49 +0200 tuned whitespace
haftmann [Mon, 04 Oct 2010 14:46:49 +0200] rev 39918
tuned whitespace
Mon, 04 Oct 2010 14:46:48 +0200 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann [Mon, 04 Oct 2010 14:46:48 +0200] rev 39917
turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
Mon, 04 Oct 2010 14:46:48 +0200 turned distinct and sorted into inductive predicates: yields nice induction principles for free
haftmann [Mon, 04 Oct 2010 14:46:48 +0200] rev 39916
turned distinct and sorted into inductive predicates: yields nice induction principles for free
Mon, 04 Oct 2010 12:22:58 +0200 turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann [Mon, 04 Oct 2010 12:22:58 +0200] rev 39915
turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
Sat, 02 Oct 2010 12:32:31 +0200 some Poly/ML-specific debugging code escaped in the wild -- comment it out
blanchet [Sat, 02 Oct 2010 12:32:31 +0200] rev 39914
some Poly/ML-specific debugging code escaped in the wild -- comment it out
Fri, 01 Oct 2010 22:44:36 +0200 merged
haftmann [Fri, 01 Oct 2010 22:44:36 +0200] rev 39913
merged
Fri, 01 Oct 2010 17:06:49 +0200 avoid antiquotation processing for code_reflect; moved ML_Context.value to Code_Runtime
haftmann [Fri, 01 Oct 2010 17:06:49 +0200] rev 39912
avoid antiquotation processing for code_reflect; moved ML_Context.value to Code_Runtime
Fri, 01 Oct 2010 17:06:49 +0200 moved ML_Context.value to Code_Runtime
haftmann [Fri, 01 Oct 2010 17:06:49 +0200] rev 39911
moved ML_Context.value to Code_Runtime
Fri, 01 Oct 2010 16:05:25 +0200 constant `contents` renamed to `the_elem`
haftmann [Fri, 01 Oct 2010 16:05:25 +0200] rev 39910
constant `contents` renamed to `the_elem`
Fri, 01 Oct 2010 18:49:09 +0200 merged
blanchet [Fri, 01 Oct 2010 18:49:09 +0200] rev 39909
merged
Fri, 01 Oct 2010 18:48:37 +0200 tune whitespace
blanchet [Fri, 01 Oct 2010 18:48:37 +0200] rev 39908
tune whitespace
Fri, 01 Oct 2010 17:56:32 +0200 rename bound variables after skolemizing, if the axiom of choice is available
blanchet [Fri, 01 Oct 2010 17:56:32 +0200] rev 39907
rename bound variables after skolemizing, if the axiom of choice is available
Fri, 01 Oct 2010 17:52:20 +0200 tuning
blanchet [Fri, 01 Oct 2010 17:52:20 +0200] rev 39906
tuning
Fri, 01 Oct 2010 17:41:59 +0200 rename quantified variables earlier in the new skolemizer, to ensure consistent naming later (in the absence of the choice axiom)
blanchet [Fri, 01 Oct 2010 17:41:59 +0200] rev 39905
rename quantified variables earlier in the new skolemizer, to ensure consistent naming later (in the absence of the choice axiom)
Fri, 01 Oct 2010 16:58:56 +0200 tune bound names
blanchet [Fri, 01 Oct 2010 16:58:56 +0200] rev 39904
tune bound names
Fri, 01 Oct 2010 16:13:28 +0200 merged
blanchet [Fri, 01 Oct 2010 16:13:28 +0200] rev 39903
merged
Fri, 01 Oct 2010 15:45:56 +0200 avoid dependency on "int"
blanchet [Fri, 01 Oct 2010 15:45:56 +0200] rev 39902
avoid dependency on "int"
Fri, 01 Oct 2010 15:34:09 +0200 make "cnf_axiom" work (after a fashion) in the absence of the axiom of choice
blanchet [Fri, 01 Oct 2010 15:34:09 +0200] rev 39901
make "cnf_axiom" work (after a fashion) in the absence of the axiom of choice
Fri, 01 Oct 2010 14:01:29 +0200 added "meson_choice" attribute as a step towards making (less powerful versions of) Meson/Metis/Sledgehammer work without the axiom of choice
blanchet [Fri, 01 Oct 2010 14:01:29 +0200] rev 39900
added "meson_choice" attribute as a step towards making (less powerful versions of) Meson/Metis/Sledgehammer work without the axiom of choice
Fri, 01 Oct 2010 12:01:07 +0200 compute quantifier dependency graph in new skolemizer
blanchet [Fri, 01 Oct 2010 12:01:07 +0200] rev 39899
compute quantifier dependency graph in new skolemizer
Fri, 01 Oct 2010 10:58:01 +0200 tuning
blanchet [Fri, 01 Oct 2010 10:58:01 +0200] rev 39898
tuning
Fri, 01 Oct 2010 10:39:51 +0200 compute substitutions in new skolemizer
blanchet [Fri, 01 Oct 2010 10:39:51 +0200] rev 39897
compute substitutions in new skolemizer
Thu, 30 Sep 2010 20:44:53 +0200 encode axiom number and cluster number in all zapped quantifiers to help discharging new skolemizer assumptions
blanchet [Thu, 30 Sep 2010 20:44:53 +0200] rev 39896
encode axiom number and cluster number in all zapped quantifiers to help discharging new skolemizer assumptions
Thu, 30 Sep 2010 19:15:47 +0200 reintroduced code that keeps track of whether the Isabelle and Metis proofs are in sync -- generalized to work with the new skolemizer
blanchet [Thu, 30 Sep 2010 19:15:47 +0200] rev 39895
reintroduced code that keeps track of whether the Isabelle and Metis proofs are in sync -- generalized to work with the new skolemizer
Thu, 30 Sep 2010 18:59:37 +0200 encode number of skolem assumptions in them, for more efficient retrieval later
blanchet [Thu, 30 Sep 2010 18:59:37 +0200] rev 39894
encode number of skolem assumptions in them, for more efficient retrieval later
Thu, 30 Sep 2010 00:29:37 +0200 move functions closer to where they're used
blanchet [Thu, 30 Sep 2010 00:29:37 +0200] rev 39893
move functions closer to where they're used
Thu, 30 Sep 2010 00:12:11 +0200 Skolemizer tweaking
blanchet [Thu, 30 Sep 2010 00:12:11 +0200] rev 39892
Skolemizer tweaking
Wed, 29 Sep 2010 23:55:14 +0200 "meson_new_skolemizer" -> "metis_new_skolemizer" option (since Meson doesn't support the new skolemizer (yet))
blanchet [Wed, 29 Sep 2010 23:55:14 +0200] rev 39891
"meson_new_skolemizer" -> "metis_new_skolemizer" option (since Meson doesn't support the new skolemizer (yet))
Wed, 29 Sep 2010 23:30:10 +0200 finished renaming file and module
blanchet [Wed, 29 Sep 2010 23:30:10 +0200] rev 39890
finished renaming file and module
Wed, 29 Sep 2010 23:26:39 +0200 rename file
blanchet [Wed, 29 Sep 2010 23:26:39 +0200] rev 39889
rename file
Wed, 29 Sep 2010 23:24:31 +0200 ignore Skolem assumption (if any)
blanchet [Wed, 29 Sep 2010 23:24:31 +0200] rev 39888
ignore Skolem assumption (if any)
Wed, 29 Sep 2010 23:06:02 +0200 second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
blanchet [Wed, 29 Sep 2010 23:06:02 +0200] rev 39887
second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions
Wed, 29 Sep 2010 22:23:27 +0200 first step towards a new skolemizer that doesn't require "Eps"
blanchet [Wed, 29 Sep 2010 22:23:27 +0200] rev 39886
first step towards a new skolemizer that doesn't require "Eps"
(0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip