Wed, 28 Apr 2010 11:13:11 +0200 wenzelm more systematic naming of tsig operations;
Wed, 28 Apr 2010 11:09:19 +0200 wenzelm modernized/simplified Sign.set_defsort;
Wed, 28 Apr 2010 10:51:34 +0200 wenzelm get_sort: minimize sorts given in the text, while keeping those from the context unchanged (the latter are preferred);
Wed, 28 Apr 2010 10:43:08 +0200 wenzelm export Type.minimize_sort;
Wed, 28 Apr 2010 08:25:02 +0200 haftmann term_typ: print styled term
Tue, 27 Apr 2010 22:23:12 +0200 wenzelm merged
Tue, 27 Apr 2010 11:17:50 -0700 huffman merged
Tue, 27 Apr 2010 11:03:04 -0700 huffman generalize types of path operations
Tue, 27 Apr 2010 10:54:24 -0700 huffman generalize more continuity lemmas
Tue, 27 Apr 2010 10:39:52 -0700 huffman generalized many lemmas about continuity
Mon, 26 Apr 2010 22:21:03 -0700 huffman simplify definition of continuous_on; generalize some lemmas
Mon, 26 Apr 2010 20:03:01 -0700 huffman move intervals section heading
Mon, 26 Apr 2010 19:58:51 -0700 huffman remove unused, redundant constant inv_on
Mon, 26 Apr 2010 19:55:50 -0700 huffman reorganize subsection headings
Mon, 26 Apr 2010 17:56:39 -0700 huffman remove redundant lemma
Mon, 26 Apr 2010 16:28:58 -0700 huffman more lemmas to Vec1.thy
Mon, 26 Apr 2010 15:51:10 -0700 huffman simplify proof
Mon, 26 Apr 2010 15:44:54 -0700 huffman move more lemmas into Vec1.thy
Mon, 26 Apr 2010 15:22:03 -0700 huffman move proof of Fashoda meet theorem into separate file
Mon, 26 Apr 2010 12:19:57 -0700 huffman move definitions and theorems for type real^1 to separate theory file
Tue, 27 Apr 2010 21:53:55 +0200 wenzelm removed obsolete sanity check -- Sign.certify_sort is stable;
Tue, 27 Apr 2010 21:46:10 +0200 wenzelm monotonic sort certification: sorts are no longer minimized at the kernel boundary, only when reading input from the end-user;
Tue, 27 Apr 2010 21:34:22 +0200 wenzelm really minimize sorts after certification -- looks like this is intended here;
Tue, 27 Apr 2010 19:44:04 +0200 wenzelm tuned signature;
Tue, 27 Apr 2010 16:24:57 +0200 wenzelm merged
Tue, 27 Apr 2010 12:20:17 +0200 haftmann tuned whitespace
Tue, 27 Apr 2010 12:20:09 +0200 haftmann got rid of [simplified]
Tue, 27 Apr 2010 11:52:41 +0200 haftmann got rid of [simplified]
Tue, 27 Apr 2010 10:51:39 +0200 blanchet fix SML/NJ compilation (I hope)
Tue, 27 Apr 2010 16:09:15 +0200 wenzelm tuned classrel completion -- bypass composition with reflexive edges;
Tue, 27 Apr 2010 15:23:05 +0200 wenzelm tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
Tue, 27 Apr 2010 15:03:19 +0200 wenzelm tuned aritiy completion -- slightly less intermediate data structures;
Tue, 27 Apr 2010 14:41:27 +0200 wenzelm clarified proven results: store thm only and retrieve proof later via Thm.proof_of (this may also impact parallelism, because internal join_proofs is deferred);
Tue, 27 Apr 2010 14:19:47 +0200 wenzelm misc tuning and simplification;
Tue, 27 Apr 2010 10:42:41 +0200 haftmann NEWS and CONTRIBUTORS
Tue, 27 Apr 2010 09:49:40 +0200 haftmann explicit is better than implicit
Tue, 27 Apr 2010 09:49:36 +0200 haftmann tuned class linordered_field_inverse_zero
Tue, 27 Apr 2010 08:18:25 +0200 haftmann merged
Tue, 27 Apr 2010 08:17:40 +0200 haftmann instances for *_inverse_zero classes
Tue, 27 Apr 2010 08:17:39 +0200 haftmann canonical import
Mon, 26 Apr 2010 15:38:14 +0200 haftmann merged
Mon, 26 Apr 2010 15:37:50 +0200 haftmann use new classes (linordered_)field_inverse_zero
Mon, 26 Apr 2010 23:46:45 +0200 blanchet merged
Mon, 26 Apr 2010 23:45:51 +0200 blanchet renamed option
Mon, 26 Apr 2010 23:45:32 +0200 blanchet fixes 2a5c6e7b55cb;
Mon, 26 Apr 2010 21:50:36 +0200 blanchet compile
Mon, 26 Apr 2010 21:41:54 +0200 blanchet make compile (and not just load dynamically)
Mon, 26 Apr 2010 21:25:32 +0200 blanchet merge
Mon, 26 Apr 2010 21:20:43 +0200 blanchet introduced direct proof reconstruction code, eliminating the need for the "neg_clausify" method;
Mon, 26 Apr 2010 21:18:20 +0200 blanchet adapt code to reflect new signature of "neg_clausify"
Mon, 26 Apr 2010 21:17:41 +0200 blanchet rename options and keep track of conjecture shape (to facilitate proof reconstruction)
Mon, 26 Apr 2010 21:17:04 +0200 blanchet rename options
Mon, 26 Apr 2010 21:16:35 +0200 blanchet make "neg_clausify" return a list of lists of clauses, so that it's possible to see which clause comes from which theorem
Mon, 26 Apr 2010 21:14:28 +0200 blanchet remove needless code that was copy-pasted from Quickcheck (where it made sense)
Sun, 25 Apr 2010 15:30:33 +0200 blanchet cosmetics
Sun, 25 Apr 2010 15:04:20 +0200 blanchet cosmetics
Sun, 25 Apr 2010 14:40:36 +0200 blanchet move "neg_clausify" method and "clausify" attribute to "sledgehammer_isar.ML"
Sun, 25 Apr 2010 11:38:46 +0200 blanchet support readable names even when Isar proof reconstruction is enabled -- useful for debugging
Sun, 25 Apr 2010 10:22:31 +0200 blanchet cosmetics: rename internal functions
Sun, 25 Apr 2010 00:33:26 +0200 blanchet cosmetics
(0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip