| 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
|