| Mon, 27 Feb 2012 10:32:39 +0100 |
berghofe |
Use long prefix rather than short package name to disambiguate constant names
|
changeset |
files
|
| Mon, 27 Feb 2012 23:35:11 +0100 |
wenzelm |
more explicit development graph;
|
changeset |
files
|
| Mon, 27 Feb 2012 23:30:38 +0100 |
wenzelm |
removed dead code (cf. a34d89ce6097);
|
changeset |
files
|
| Mon, 27 Feb 2012 21:07:00 +0100 |
wenzelm |
tuned proofs;
|
changeset |
files
|
| Mon, 27 Feb 2012 20:55:30 +0100 |
wenzelm |
tuned proofs;
|
changeset |
files
|
| Mon, 27 Feb 2012 20:42:09 +0100 |
wenzelm |
removed introiff (cf. b09afce1e54f);
|
changeset |
files
|
| Mon, 27 Feb 2012 20:33:18 +0100 |
wenzelm |
tuned;
|
changeset |
files
|
| Mon, 27 Feb 2012 20:23:57 +0100 |
wenzelm |
removed broken/unused introiff (cf. d452117ba564);
|
changeset |
files
|
| Mon, 27 Feb 2012 19:54:50 +0100 |
wenzelm |
discontinued slightly odd built-in timing (cf. 53fd5cc685b4) -- the Isar toplevel does that already (e.g. via Toplevel.timing or Toplevel.profiling);
|
changeset |
files
|
| Mon, 27 Feb 2012 19:53:34 +0100 |
wenzelm |
tuned;
|
changeset |
files
|
| Mon, 27 Feb 2012 17:40:59 +0100 |
wenzelm |
tuned proofs;
|
changeset |
files
|
| Mon, 27 Feb 2012 17:39:34 +0100 |
wenzelm |
prefer uniform Timing.message -- avoid assumption about sequential execution;
|
changeset |
files
|
| Mon, 27 Feb 2012 17:13:25 +0100 |
wenzelm |
prefer final ADTs -- prevent ooddities;
|
changeset |
files
|
| Mon, 27 Feb 2012 16:56:25 +0100 |
wenzelm |
more explicit Long_Name operations (NB: analyzing qualifiers is inherently fragile);
|
changeset |
files
|
| Mon, 27 Feb 2012 16:53:13 +0100 |
wenzelm |
more standard settings -- refer to COMPONENT at most once;
|
changeset |
files
|
| Mon, 27 Feb 2012 16:05:51 +0100 |
wenzelm |
clarified prems_lin_arith_tac, with subtle change of semantics: structured prems are inserted as well;
|
changeset |
files
|
| Mon, 27 Feb 2012 15:48:02 +0100 |
wenzelm |
prefer cut_tac, where it is clear that the special variants cut_rules_tac or cut_facts_tac are not required;
|
changeset |
files
|
| Mon, 27 Feb 2012 15:42:07 +0100 |
wenzelm |
eliminated odd comment from distant past;
|
changeset |
files
|
| Mon, 27 Feb 2012 15:39:47 +0100 |
wenzelm |
updated cut_tac, without loose references to implementation manual;
|
changeset |
files
|
| Mon, 27 Feb 2012 15:36:24 +0100 |
wenzelm |
updated generated file;
|
changeset |
files
|
| Mon, 27 Feb 2012 15:00:19 +0100 |
wenzelm |
simplified cut_tac (cf. d549b5b0f344);
|
changeset |
files
|
| Mon, 27 Feb 2012 14:07:59 +0100 |
huffman |
merged
|
changeset |
files
|
| Mon, 27 Feb 2012 11:38:56 +0100 |
huffman |
avoid using constant Int.neg
|
changeset |
files
|
| Mon, 27 Feb 2012 12:12:28 +0100 |
wenzelm |
reactivated Find_Unused_Assms_Examples to avoid untested / dead stuff in the repository;
|
changeset |
files
|
| Mon, 27 Feb 2012 11:53:08 +0100 |
nipkow |
merged
|
changeset |
files
|
| Mon, 27 Feb 2012 10:27:21 +0100 |
nipkow |
added lemma
|
changeset |
files
|
| Mon, 27 Feb 2012 09:01:49 +0100 |
nipkow |
converting "set [...]" to "{...}" in evaluation results
|
changeset |
files
|
| Mon, 27 Feb 2012 10:56:36 +0100 |
bulwahn |
removing Find_Unused_Assms_Examples from session as it requires much time
|
changeset |
files
|
| Sun, 26 Feb 2012 21:44:12 +0100 |
haftmann |
restored accidental omission
|
changeset |
files
|
| Sun, 26 Feb 2012 21:43:57 +0100 |
haftmann |
dropped dead code
|
changeset |
files
|
| Sun, 26 Feb 2012 21:26:28 +0100 |
haftmann |
tuned structure
|
changeset |
files
|
| Sun, 26 Feb 2012 21:25:54 +0100 |
haftmann |
retain syntax here
|
changeset |
files
|
| Sun, 26 Feb 2012 20:43:33 +0100 |
haftmann |
tuned structure; dropped already existing syntax declarations
|
changeset |
files
|
| Sun, 26 Feb 2012 20:10:14 +0100 |
haftmann |
tuned syntax declarations; tuned structure
|
changeset |
files
|
| Sun, 26 Feb 2012 20:08:12 +0100 |
wenzelm |
merged
|
changeset |
files
|
| Sun, 26 Feb 2012 15:28:48 +0100 |
haftmann |
marked candidates for rule declarations
|
changeset |
files
|
| Sun, 26 Feb 2012 20:05:14 +0100 |
wenzelm |
include warning messages in node status;
|
changeset |
files
|
| Sun, 26 Feb 2012 19:36:35 +0100 |
wenzelm |
tuned signature (in accordance with ML);
|
changeset |
files
|
| Sun, 26 Feb 2012 19:20:46 +0100 |
wenzelm |
more PIDE modules;
|
changeset |
files
|
| Sun, 26 Feb 2012 18:26:26 +0100 |
wenzelm |
tuned proofs;
|
changeset |
files
|
| Sun, 26 Feb 2012 18:25:28 +0100 |
wenzelm |
more abstract class Document.State;
|
changeset |
files
|
| Sun, 26 Feb 2012 18:19:44 +0100 |
wenzelm |
more abstract class Document.State.Assignment;
|
changeset |
files
|
| Sun, 26 Feb 2012 17:54:35 +0100 |
wenzelm |
tuned signature;
|
changeset |
files
|
| Sun, 26 Feb 2012 17:44:09 +0100 |
wenzelm |
more abstract class Document.Version;
|
changeset |
files
|
| Sun, 26 Feb 2012 17:15:33 +0100 |
wenzelm |
more abstract class Document.Node;
|
changeset |
files
|
| Sun, 26 Feb 2012 16:58:28 +0100 |
wenzelm |
more abstract class Document.History;
|
changeset |
files
|
| Sun, 26 Feb 2012 16:17:57 +0100 |
wenzelm |
more abstract class Document.Change;
|
changeset |
files
|
| Sun, 26 Feb 2012 16:02:53 +0100 |
wenzelm |
tuned;
|
changeset |
files
|
| Sun, 26 Feb 2012 15:18:48 +0100 |
wenzelm |
tuned signature;
|
changeset |
files
|
| Sat, 25 Feb 2012 15:33:36 +0100 |
wenzelm |
merged
|
changeset |
files
|
| Sat, 25 Feb 2012 09:07:53 +0100 |
bulwahn |
slightly changing the enumeration scheme
|
changeset |
files
|
| Sat, 25 Feb 2012 09:07:51 +0100 |
bulwahn |
adding some more test invocations of find_unused_assms
|
changeset |
files
|
| Sat, 25 Feb 2012 09:07:43 +0100 |
bulwahn |
adding an example where random beats exhaustive testing
|
changeset |
files
|
| Sat, 25 Feb 2012 09:07:41 +0100 |
bulwahn |
removing unnecessary assumptions in RComplete;
|
changeset |
files
|
| Sat, 25 Feb 2012 09:07:39 +0100 |
bulwahn |
removing unnecessary assumptions in RealDef;
|
changeset |
files
|
| Sat, 25 Feb 2012 09:07:37 +0100 |
bulwahn |
one general list_all2_update_cong instead of two special ones
|
changeset |
files
|
| Sat, 25 Feb 2012 13:17:38 +0100 |
wenzelm |
tuned comments;
|
changeset |
files
|
| Sat, 25 Feb 2012 13:13:14 +0100 |
wenzelm |
standard Graph instances;
|
changeset |
files
|
| Sat, 25 Feb 2012 13:00:32 +0100 |
wenzelm |
clarified signature -- avoid oddities of Iterable like Iterator.map;
|
changeset |
files
|
| Sat, 25 Feb 2012 12:34:56 +0100 |
wenzelm |
discontinued slightly odd Graph.del_nodes (inefficient due to full Table.map);
|
changeset |
files
|
| Fri, 24 Feb 2012 22:46:44 +0100 |
haftmann |
moved predicate relations and conversion rules between set and predicate relations from Predicate.thy to Relation.thy; moved Predicate.thy upwards in theory hierarchy
|
changeset |
files
|
| Fri, 24 Feb 2012 22:46:16 +0100 |
haftmann |
explicit is better than implicit
|
changeset |
files
|
| Fri, 24 Feb 2012 18:46:01 +0100 |
haftmann |
dropped dead code
|
changeset |
files
|
| Fri, 24 Feb 2012 22:58:13 +0100 |
wenzelm |
prefer sorted Map/Set for canonical order of results -- pass ordering via fresh copy of empty;
|
changeset |
files
|
| Fri, 24 Feb 2012 22:15:19 +0100 |
wenzelm |
tuned imports;
|
changeset |
files
|
| Fri, 24 Feb 2012 21:36:20 +0100 |
wenzelm |
tuned signature;
|
changeset |
files
|
| Fri, 24 Feb 2012 20:37:52 +0100 |
wenzelm |
discontinued obsolete Graph.all_paths (last seen in 1524d69783d3 and AFP/80bbbdbfec62);
|
changeset |
files
|
| Fri, 24 Feb 2012 19:47:11 +0100 |
wenzelm |
merged
|
changeset |
files
|
| Fri, 24 Feb 2012 17:21:24 +0100 |
huffman |
remove ill-formed lemmas word_0_wi_Pls and word_m1_wi_Min
|
changeset |
files
|
| Fri, 24 Feb 2012 16:59:20 +0100 |
huffman |
avoid using Int.succ_def in proofs
|
changeset |
files
|
| Fri, 24 Feb 2012 16:55:29 +0100 |
huffman |
avoid using Int.succ or Int.pred in proofs
|
changeset |
files
|
| Fri, 24 Feb 2012 16:53:59 +0100 |
huffman |
avoid using BIT_simps in proofs;
|
changeset |
files
|
| Fri, 24 Feb 2012 16:46:43 +0100 |
huffman |
avoid using BIT_simps in proofs
|
changeset |
files
|
| Fri, 24 Feb 2012 19:47:00 +0100 |
wenzelm |
updated stats according to src/HOL/IsaMakefile;
|
changeset |
files
|
| Fri, 24 Feb 2012 19:45:10 +0100 |
wenzelm |
more precise clean target;
|
changeset |
files
|
| Fri, 24 Feb 2012 18:14:06 +0100 |
wenzelm |
clarifed name space "type name", which covers logical and non-logical types, and often occurs inside outer syntax "type" markup;
|
changeset |
files
|
| Fri, 24 Feb 2012 13:50:37 +0100 |
huffman |
avoid using Int.Pls_def in proofs
|
changeset |
files
|
| Fri, 24 Feb 2012 13:37:23 +0100 |
huffman |
remove ill-formed lemmas word_pred_0_Min and word_m1_Min
|
changeset |
files
|
| Fri, 24 Feb 2012 13:33:03 +0100 |
huffman |
remove ill-formed lemma of_bl_no; adapt proofs
|
changeset |
files
|
| Fri, 24 Feb 2012 13:25:21 +0100 |
huffman |
adapt lemma mask_lem to respect int/bin distinction
|
changeset |
files
|
| Fri, 24 Feb 2012 11:23:36 +0100 |
blanchet |
rephrase some slow "metis" calls
|
changeset |
files
|
| Fri, 24 Feb 2012 11:23:35 +0100 |
blanchet |
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
|
changeset |
files
|
| Fri, 24 Feb 2012 11:23:34 +0100 |
blanchet |
general solution to the arity bug that occasionally plagues Sledgehammer -- short story, lots of things go kaputt when a polymorphic symbol's arity in the translation is higher than the arity of the fully polymorphic HOL constant
|
changeset |
files
|
| Fri, 24 Feb 2012 11:23:34 +0100 |
blanchet |
renamed 'try_methods' to 'try0'
|
changeset |
files
|
| Fri, 24 Feb 2012 11:23:33 +0100 |
blanchet |
doc fixes (thanks to Nik)
|
changeset |
files
|
| Fri, 24 Feb 2012 11:23:32 +0100 |
blanchet |
fixed arity bug with "If" helpers for "If" that returns a function
|
changeset |
files
|
| Fri, 24 Feb 2012 09:40:02 +0100 |
haftmann |
given up disfruitful branch
|
changeset |
files
|
| Fri, 24 Feb 2012 08:49:36 +0100 |
haftmann |
explicit remove of lattice notation
|
changeset |
files
|
| Fri, 24 Feb 2012 07:30:24 +0100 |
haftmann |
moved predicate relations and conversion rules between set and predicate relations from Predicate.thy to Relation.thy; moved Predicate.thy upwards in theory hierarchy
|
changeset |
files
|
| Thu, 23 Feb 2012 21:25:59 +0100 |
haftmann |
moved predicate relations and conversion rules between set and predicate relations from Predicate.thy to Relation.thy; moved Predicate.thy upwards in theory hierarchy
|
changeset |
files
|
| Thu, 23 Feb 2012 21:16:54 +0100 |
haftmann |
dropped dead code
|
changeset |
files
|
| Thu, 23 Feb 2012 22:07:12 +0100 |
wenzelm |
tuned isatest settings;
|
changeset |
files
|
| Thu, 23 Feb 2012 21:39:11 +0100 |
wenzelm |
merged
|
changeset |
files
|
| Thu, 23 Feb 2012 20:33:35 +0100 |
haftmann |
moved lemmas for orderings and lattices on predicates to corresponding theories, retaining declaration order of classical rules; tuned headings; tuned syntax
|
changeset |
files
|
| Thu, 23 Feb 2012 20:15:59 +0100 |
haftmann |
tuned whitespace
|
changeset |
files
|
| Thu, 23 Feb 2012 20:15:49 +0100 |
haftmann |
tuned proof
|
changeset |
files
|
| Thu, 23 Feb 2012 21:15:11 +0100 |
wenzelm |
prefer actual syntax categories;
|
changeset |
files
|
| Thu, 23 Feb 2012 20:40:20 +0100 |
wenzelm |
avoid trait Addable, which is deprecated in scala-2.9.x;
|
changeset |
files
|
| Thu, 23 Feb 2012 20:24:05 +0100 |
wenzelm |
streamlined abstract datatype;
|
changeset |
files
|
| Thu, 23 Feb 2012 20:23:19 +0100 |
wenzelm |
tuned;
|
changeset |
files
|
| Thu, 23 Feb 2012 19:58:49 +0100 |
wenzelm |
streamlined abstract datatype;
|
changeset |
files
|
| Thu, 23 Feb 2012 19:35:05 +0100 |
wenzelm |
tuned -- avoid copy of empty value;
|
changeset |
files
|
| Thu, 23 Feb 2012 19:34:48 +0100 |
wenzelm |
tuned;
|
changeset |
files
|
| Thu, 23 Feb 2012 18:38:30 +0100 |
wenzelm |
streamlined abstract datatype, eliminating odd representation class;
|
changeset |
files
|
| Thu, 23 Feb 2012 18:14:58 +0100 |
wenzelm |
tuned;
|
changeset |
files
|
| Thu, 23 Feb 2012 17:27:37 +0100 |
huffman |
merged
|
changeset |
files
|
| Thu, 23 Feb 2012 16:09:16 +0100 |
huffman |
make more simp rules respect int/bin distinction
|
changeset |
files
|
| Thu, 23 Feb 2012 15:37:42 +0100 |
huffman |
make bool list functions respect int/bin distinction
|
changeset |
files
|
| Thu, 23 Feb 2012 16:18:19 +0100 |
wenzelm |
merged;
|
changeset |
files
|
| Thu, 23 Feb 2012 16:02:07 +0100 |
wenzelm |
tuned;
|
changeset |
files
|
| Thu, 23 Feb 2012 15:49:40 +0100 |
wenzelm |
clarified Graph.restrict (formerly Graph.subgraph) based on public graph operations;
|
changeset |
files
|
| Thu, 23 Feb 2012 15:15:59 +0100 |
wenzelm |
further graph operations from ML;
|
changeset |
files
|
| Thu, 23 Feb 2012 14:46:38 +0100 |
wenzelm |
removed dead code;
|
changeset |
files
|
| Thu, 23 Feb 2012 14:17:51 +0100 |
wenzelm |
directed graphs (in Scala);
|
changeset |
files
|
| Thu, 23 Feb 2012 15:23:16 +0100 |
huffman |
make uses of bin_split respect int/bin distinction
|
changeset |
files
|
| Thu, 23 Feb 2012 15:19:31 +0100 |
huffman |
remove lemma bin_cat_Pls, which doesn't respect int/bin distinction
|
changeset |
files
|
| Thu, 23 Feb 2012 15:15:48 +0100 |
huffman |
make uses of constant bin_sc respect int/bin distinction
|
changeset |
files
|
| Thu, 23 Feb 2012 15:04:51 +0100 |
huffman |
remove duplicate lemma bintrunc_Suc in favor of bintrunc.Suc
|
changeset |
files
|
| Thu, 23 Feb 2012 14:43:01 +0100 |
huffman |
remove unused lemmas
|
changeset |
files
|
| Thu, 23 Feb 2012 14:29:29 +0100 |
huffman |
simplify proofs
|
changeset |
files
|