Thu, 22 Apr 2010 10:54:56 +0200 Isar proof reconstruction: type variables introduced by the ATP should be treated as type parameters for type inference purposes;
blanchet [Thu, 22 Apr 2010 10:54:56 +0200] rev 36285
Isar proof reconstruction: type variables introduced by the ATP should be treated as type parameters for type inference purposes; this solves the unification exception that consistently was thrown for Cezary's "FSet3" theory
Thu, 22 Apr 2010 10:13:02 +0200 postprocess ATP output in "overlord" mode to make it more readable
blanchet [Thu, 22 Apr 2010 10:13:02 +0200] rev 36284
postprocess ATP output in "overlord" mode to make it more readable
Wed, 21 Apr 2010 17:06:26 +0200 failure of reconstructing the Isar proof (e.g., exception) should not prevent Sledgehammer from showing the short one-liner proof -- but in "debug" mode we do want to know what the exception is
blanchet [Wed, 21 Apr 2010 17:06:26 +0200] rev 36283
failure of reconstructing the Isar proof (e.g., exception) should not prevent Sledgehammer from showing the short one-liner proof -- but in "debug" mode we do want to know what the exception is
Wed, 21 Apr 2010 16:38:03 +0200 generate command-line in addition to timestamp in ATP output file, for debugging purposes
blanchet [Wed, 21 Apr 2010 16:38:03 +0200] rev 36282
generate command-line in addition to timestamp in ATP output file, for debugging purposes
Wed, 21 Apr 2010 16:21:19 +0200 pass relevant options from "sledgehammer" to "sledgehammer minimize";
blanchet [Wed, 21 Apr 2010 16:21:19 +0200] rev 36281
pass relevant options from "sledgehammer" to "sledgehammer minimize"; one nice side effect of this change is that the "sledgehammer minimize" syntax now only occurs in "sledgehammer_isar.ML", instead of being spread across two files
Fri, 23 Apr 2010 10:00:53 +0200 Finite set theory
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 23 Apr 2010 10:00:53 +0200] rev 36280
Finite set theory
Thu, 22 Apr 2010 22:12:12 +0200 merged
wenzelm [Thu, 22 Apr 2010 22:12:12 +0200] rev 36279
merged
Thu, 22 Apr 2010 20:39:48 +0100 Tidied up using s/l
paulson [Thu, 22 Apr 2010 20:39:48 +0100] rev 36278
Tidied up using s/l
Thu, 22 Apr 2010 22:01:06 +0200 split Class.thy into parts to conserve a bit of memory and increase the chance of making it work on Cygwin with only 2 GB available;
wenzelm [Thu, 22 Apr 2010 22:01:06 +0200] rev 36277
split Class.thy into parts to conserve a bit of memory and increase the chance of making it work on Cygwin with only 2 GB available;
Thu, 22 Apr 2010 11:55:19 +0200 fun_rel introduction and list_rel elimination for quotient package
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 22 Apr 2010 11:55:19 +0200] rev 36276
fun_rel introduction and list_rel elimination for quotient package
Thu, 22 Apr 2010 09:30:39 +0200 lemmas concerning remdups
haftmann [Thu, 22 Apr 2010 09:30:39 +0200] rev 36275
lemmas concerning remdups
Thu, 22 Apr 2010 09:30:36 +0200 lemma dlist_ext
haftmann [Thu, 22 Apr 2010 09:30:36 +0200] rev 36274
lemma dlist_ext
Wed, 21 Apr 2010 21:11:26 +0200 merged
haftmann [Wed, 21 Apr 2010 21:11:26 +0200] rev 36273
merged
Wed, 21 Apr 2010 15:20:59 +0200 optionally ignore errors during translation of equations; tuned representation of abstraction points
haftmann [Wed, 21 Apr 2010 15:20:59 +0200] rev 36272
optionally ignore errors during translation of equations; tuned representation of abstraction points
Wed, 21 Apr 2010 15:20:57 +0200 optionally ignore errors during translation of equations
haftmann [Wed, 21 Apr 2010 15:20:57 +0200] rev 36271
optionally ignore errors during translation of equations
Wed, 21 Apr 2010 15:45:33 +0200 tolerate eta-variants in f_graph.cases (from inductive package); added test case;
krauss [Wed, 21 Apr 2010 15:45:33 +0200] rev 36270
tolerate eta-variants in f_graph.cases (from inductive package); added test case;
(0) -30000 -10000 -3000 -1000 -300 -100 -16 +16 +100 +300 +1000 +3000 +10000 +30000 tip