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"
Fri, 22 Oct 2010 20:57:33 +0100 cumulative update of generated files (since bf164c153d10);
wenzelm [Fri, 22 Oct 2010 20:57:33 +0100] rev 39885
cumulative update of generated files (since bf164c153d10);
Fri, 22 Oct 2010 20:51:45 +0100 removed ML_old.thy, which is largely superseded by ML.thy;
wenzelm [Fri, 22 Oct 2010 20:51:45 +0100] rev 39884
removed ML_old.thy, which is largely superseded by ML.thy;
Fri, 22 Oct 2010 20:43:48 +0100 more on "Canonical argument order";
wenzelm [Fri, 22 Oct 2010 20:43:48 +0100] rev 39883
more on "Canonical argument order"; tuned;
Fri, 22 Oct 2010 19:03:31 +0100 cover @{Isar.state};
wenzelm [Fri, 22 Oct 2010 19:03:31 +0100] rev 39882
cover @{Isar.state};
Fri, 22 Oct 2010 16:57:55 +0100 more on "Style and orthography";
wenzelm [Fri, 22 Oct 2010 16:57:55 +0100] rev 39881
more on "Style and orthography";
Fri, 22 Oct 2010 12:02:00 +0100 more on "Naming conventions";
wenzelm [Fri, 22 Oct 2010 12:02:00 +0100] rev 39880
more on "Naming conventions"; tuned;
Fri, 22 Oct 2010 11:27:05 +0100 tuned;
wenzelm [Fri, 22 Oct 2010 11:27:05 +0100] rev 39879
tuned;
Thu, 21 Oct 2010 21:53:34 +0100 more on "Style and orthography";
wenzelm [Thu, 21 Oct 2010 21:53:34 +0100] rev 39878
more on "Style and orthography";
Thu, 21 Oct 2010 20:06:13 +0100 more refs;
wenzelm [Thu, 21 Oct 2010 20:06:13 +0100] rev 39877
more refs;
Thu, 21 Oct 2010 20:00:46 +0100 preliminary material on "Concrete syntax and type-checking";
wenzelm [Thu, 21 Oct 2010 20:00:46 +0100] rev 39876
preliminary material on "Concrete syntax and type-checking";
Wed, 20 Oct 2010 21:22:56 +0100 more on "Association lists", based on more succinct version of older material;
wenzelm [Wed, 20 Oct 2010 21:22:56 +0100] rev 39875
more on "Association lists", based on more succinct version of older material;
Wed, 20 Oct 2010 20:47:06 +0100 clarified "lists as a set-like container";
wenzelm [Wed, 20 Oct 2010 20:47:06 +0100] rev 39874
clarified "lists as a set-like container";
Tue, 19 Oct 2010 21:13:10 +0100 more robust treatment of "op IDENT";
wenzelm [Tue, 19 Oct 2010 21:13:10 +0100] rev 39873
more robust treatment of "op IDENT";
Tue, 19 Oct 2010 21:01:34 +0100 more on messages;
wenzelm [Tue, 19 Oct 2010 21:01:34 +0100] rev 39872
more on messages;
Tue, 19 Oct 2010 19:46:25 +0100 more on synchronized variables;
wenzelm [Tue, 19 Oct 2010 19:46:25 +0100] rev 39871
more on synchronized variables;
Tue, 19 Oct 2010 19:20:02 +0100 tuned;
wenzelm [Tue, 19 Oct 2010 19:20:02 +0100] rev 39870
tuned;
Tue, 19 Oct 2010 19:16:27 +0100 more robust index_ML antiquotations: guess name from text (affects infixes and type constructors in particular);
wenzelm [Tue, 19 Oct 2010 19:16:27 +0100] rev 39869
more robust index_ML antiquotations: guess name from text (affects infixes and type constructors in particular);
Tue, 19 Oct 2010 18:50:48 +0100 misc tuning;
wenzelm [Tue, 19 Oct 2010 18:50:48 +0100] rev 39868
misc tuning;
Mon, 18 Oct 2010 21:37:26 +0100 somewhat modernized version of "Thread-safe programming";
wenzelm [Mon, 18 Oct 2010 21:37:26 +0100] rev 39867
somewhat modernized version of "Thread-safe programming";
Mon, 18 Oct 2010 19:06:07 +0100 more robust examples: explicit @{assert} instead of unchecked output;
wenzelm [Mon, 18 Oct 2010 19:06:07 +0100] rev 39866
more robust examples: explicit @{assert} instead of unchecked output;
(0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip