Thu, 28 Oct 2010 18:36:34 +0200 merged
bulwahn [Thu, 28 Oct 2010 18:36:34 +0200] rev 40244
merged
Thu, 28 Oct 2010 17:28:45 +0200 adding a simple check to only run with a SWI-Prolog version known to work
bulwahn [Thu, 28 Oct 2010 17:28:45 +0200] rev 40243
adding a simple check to only run with a SWI-Prolog version known to work * * * taking the isabelle platform into account when finding the prolog system
Thu, 28 Oct 2010 23:54:39 +0200 tuned messages;
wenzelm [Thu, 28 Oct 2010 23:54:39 +0200] rev 40242
tuned messages;
Thu, 28 Oct 2010 23:19:52 +0200 discontinued obsolete ML antiquotation @{theory_ref};
wenzelm [Thu, 28 Oct 2010 23:19:52 +0200] rev 40241
discontinued obsolete ML antiquotation @{theory_ref};
Thu, 28 Oct 2010 22:59:33 +0200 tuned;
wenzelm [Thu, 28 Oct 2010 22:59:33 +0200] rev 40240
tuned;
Thu, 28 Oct 2010 22:39:59 +0200 moved FOL/ex/Iff_Oracle.thy to HOL/ex where it is more accessible to most readers of isar-ref;
wenzelm [Thu, 28 Oct 2010 22:39:59 +0200] rev 40239
moved FOL/ex/Iff_Oracle.thy to HOL/ex where it is more accessible to most readers of isar-ref; tuned;
Thu, 28 Oct 2010 22:23:11 +0200 type attribute is derived concept outside the kernel;
wenzelm [Thu, 28 Oct 2010 22:23:11 +0200] rev 40238
type attribute is derived concept outside the kernel;
Thu, 28 Oct 2010 22:12:08 +0200 preserve original source position of exn;
wenzelm [Thu, 28 Oct 2010 22:12:08 +0200] rev 40237
preserve original source position of exn;
Thu, 28 Oct 2010 22:11:06 +0200 handle Type.TYPE_MATCH, not arbitrary exceptions via MATCH_TYPE variable;
wenzelm [Thu, 28 Oct 2010 22:11:06 +0200] rev 40236
handle Type.TYPE_MATCH, not arbitrary exceptions via MATCH_TYPE variable; clarified handle/raise wrt. Quotient_Info.NotFound -- avoid fragile unqualified NotFound depending on "open" scope; added helpful comments;
Thu, 28 Oct 2010 22:04:00 +0200 use Exn.interruptible_capture to keep user-code interruptible (Exn.capture not immediately followed by Exn.release here);
wenzelm [Thu, 28 Oct 2010 22:04:00 +0200] rev 40235
use Exn.interruptible_capture to keep user-code interruptible (Exn.capture not immediately followed by Exn.release here);
Thu, 28 Oct 2010 21:59:01 +0200 added Exn.interruptible_capture, which reraises interrupts as required by user-code (when Exn.capture is not immediately followed by Exn.release);
wenzelm [Thu, 28 Oct 2010 21:59:01 +0200] rev 40234
added Exn.interruptible_capture, which reraises interrupts as required by user-code (when Exn.capture is not immediately followed by Exn.release); refined Exn.is_interrupt: detect nested IO Interrupts; generalized Exn.map_result; more precise dependencies;
Thu, 28 Oct 2010 21:52:33 +0200 eliminated dead code;
wenzelm [Thu, 28 Oct 2010 21:52:33 +0200] rev 40233
eliminated dead code;
Thu, 28 Oct 2010 21:51:34 +0200 tuned white-space;
wenzelm [Thu, 28 Oct 2010 21:51:34 +0200] rev 40232
tuned white-space;
Thu, 28 Oct 2010 17:54:25 +0200 merged
nipkow [Thu, 28 Oct 2010 17:54:25 +0200] rev 40231
merged
Thu, 28 Oct 2010 17:54:09 +0200 added lemmas about listrel(1)
nipkow [Thu, 28 Oct 2010 17:54:09 +0200] rev 40230
added lemmas about listrel(1)
Thu, 28 Oct 2010 17:25:46 +0200 tuned;
wenzelm [Thu, 28 Oct 2010 17:25:46 +0200] rev 40229
tuned;
Thu, 28 Oct 2010 15:10:34 +0200 merged
wenzelm [Thu, 28 Oct 2010 15:10:34 +0200] rev 40228
merged
Thu, 28 Oct 2010 12:33:24 +0200 support non-identifier-like fact names in Sledgehammer (e.g., "my lemma") by quoting them
blanchet [Thu, 28 Oct 2010 12:33:24 +0200] rev 40227
support non-identifier-like fact names in Sledgehammer (e.g., "my lemma") by quoting them
Thu, 28 Oct 2010 10:38:29 +0200 merged
blanchet [Thu, 28 Oct 2010 10:38:29 +0200] rev 40226
merged
Thu, 28 Oct 2010 09:40:57 +0200 clear identification
blanchet [Thu, 28 Oct 2010 09:40:57 +0200] rev 40225
clear identification
Thu, 28 Oct 2010 09:36:51 +0200 clear identification;
blanchet [Thu, 28 Oct 2010 09:36:51 +0200] rev 40224
clear identification; thread "Auto S/H" (vs. manual S/H) setting through SMT
Thu, 28 Oct 2010 09:29:57 +0200 clear identification
blanchet [Thu, 28 Oct 2010 09:29:57 +0200] rev 40223
clear identification
Wed, 27 Oct 2010 19:14:33 +0200 reintroduced Auto Try, but this time really off by default -- and leave some classical+simp reasoners out for Auto Try (but keep them for Try)
blanchet [Wed, 27 Oct 2010 19:14:33 +0200] rev 40222
reintroduced Auto Try, but this time really off by default -- and leave some classical+simp reasoners out for Auto Try (but keep them for Try)
Wed, 27 Oct 2010 16:32:13 +0200 do not let Metis be confused by higher-order reasoning leading to literals of the form "~ ~ p", which are really the same as "p"
blanchet [Wed, 27 Oct 2010 16:32:13 +0200] rev 40221
do not let Metis be confused by higher-order reasoning leading to literals of the form "~ ~ p", which are really the same as "p"
Wed, 27 Oct 2010 09:22:40 +0200 generalize to handle any prover (not just E)
blanchet [Wed, 27 Oct 2010 09:22:40 +0200] rev 40220
generalize to handle any prover (not just E)
Wed, 27 Oct 2010 11:11:35 -0700 merged
huffman [Wed, 27 Oct 2010 11:11:35 -0700] rev 40219
merged
Wed, 27 Oct 2010 11:10:36 -0700 make domain package work with non-cpo argument types
huffman [Wed, 27 Oct 2010 11:10:36 -0700] rev 40218
make domain package work with non-cpo argument types
Wed, 27 Oct 2010 11:06:53 -0700 make op -->> infixr, to match op --->
huffman [Wed, 27 Oct 2010 11:06:53 -0700] rev 40217
make op -->> infixr, to match op --->
Tue, 26 Oct 2010 14:19:59 -0700 use Named_Thms instead of Theory_Data for some domain package theorems
huffman [Tue, 26 Oct 2010 14:19:59 -0700] rev 40216
use Named_Thms instead of Theory_Data for some domain package theorems
Tue, 26 Oct 2010 09:00:07 -0700 change types of ML commands add_domain, add_new_domain to take 'sort' instead of 'string option'
huffman [Tue, 26 Oct 2010 09:00:07 -0700] rev 40215
change types of ML commands add_domain, add_new_domain to take 'sort' instead of 'string option'
Tue, 26 Oct 2010 08:36:52 -0700 use Term.add_tfreesT
huffman [Tue, 26 Oct 2010 08:36:52 -0700] rev 40214
use Term.add_tfreesT
Sun, 24 Oct 2010 15:42:57 -0700 rename case combinators generated by domain package to 'foo_case' instead of 'foo_when'
huffman [Sun, 24 Oct 2010 15:42:57 -0700] rev 40213
rename case combinators generated by domain package to 'foo_case' instead of 'foo_when'
Sun, 24 Oct 2010 15:19:17 -0700 rename constant 'one_when' to 'one_case'
huffman [Sun, 24 Oct 2010 15:19:17 -0700] rev 40212
rename constant 'one_when' to 'one_case'
Wed, 27 Oct 2010 16:40:34 +0200 merged
haftmann [Wed, 27 Oct 2010 16:40:34 +0200] rev 40211
merged
Wed, 27 Oct 2010 16:40:31 +0200 sorting: avoid _key suffix if lemma applies both to simple and generalized variant; generalized insort_insert to insort_insert_key; additional lemmas
haftmann [Wed, 27 Oct 2010 16:40:31 +0200] rev 40210
sorting: avoid _key suffix if lemma applies both to simple and generalized variant; generalized insort_insert to insort_insert_key; additional lemmas
Wed, 27 Oct 2010 13:46:30 +0200 regenerated keyword file
krauss [Wed, 27 Oct 2010 13:46:30 +0200] rev 40209
regenerated keyword file
Wed, 27 Oct 2010 08:58:03 +0200 made SML/NJ happy
boehmes [Wed, 27 Oct 2010 08:58:03 +0200] rev 40208
made SML/NJ happy
Tue, 26 Oct 2010 21:51:04 +0200 adapted SMT solver error handling to reflect latest changes in "SMT_Solver"
blanchet [Tue, 26 Oct 2010 21:51:04 +0200] rev 40207
adapted SMT solver error handling to reflect latest changes in "SMT_Solver"
Tue, 26 Oct 2010 21:43:50 +0200 better list of irrelevant SMT constants
blanchet [Tue, 26 Oct 2010 21:43:50 +0200] rev 40206
better list of irrelevant SMT constants
Tue, 26 Oct 2010 21:34:01 +0200 if "debug" is on, print list of relevant facts (poweruser request);
blanchet [Tue, 26 Oct 2010 21:34:01 +0200] rev 40205
if "debug" is on, print list of relevant facts (poweruser request); internal renaming
Tue, 26 Oct 2010 21:01:28 +0200 standardize on "fact" terminology (vs. "axiom" or "theorem") in Sledgehammer -- but keep "Axiom" in the lower-level "ATP_Problem" module
blanchet [Tue, 26 Oct 2010 21:01:28 +0200] rev 40204
standardize on "fact" terminology (vs. "axiom" or "theorem") in Sledgehammer -- but keep "Axiom" in the lower-level "ATP_Problem" module
Tue, 26 Oct 2010 20:12:33 +0200 "Nitpick" -> "Sledgehammer";
blanchet [Tue, 26 Oct 2010 20:12:33 +0200] rev 40203
"Nitpick" -> "Sledgehammer"; reparagraphing
Tue, 26 Oct 2010 20:09:38 +0200 merge
blanchet [Tue, 26 Oct 2010 20:09:38 +0200] rev 40202
merge
Tue, 26 Oct 2010 16:59:19 +0200 merged
blanchet [Tue, 26 Oct 2010 16:59:19 +0200] rev 40201
merged
Tue, 26 Oct 2010 16:56:54 +0200 remove needless context argument;
blanchet [Tue, 26 Oct 2010 16:56:54 +0200] rev 40200
remove needless context argument; prefer "Proof.context_of" to "#context o Proof.goal", since it considers any "using [[...]]"
Tue, 26 Oct 2010 17:35:54 +0200 use proper context
boehmes [Tue, 26 Oct 2010 17:35:54 +0200] rev 40199
use proper context
Tue, 26 Oct 2010 17:35:52 +0200 trace assumptions before giving them to the SMT solver
boehmes [Tue, 26 Oct 2010 17:35:52 +0200] rev 40198
trace assumptions before giving them to the SMT solver
Tue, 26 Oct 2010 17:35:51 +0200 capture out-of-memory warnings of Z3 and turn them into proper exceptions; be more precise about SMT solver run-time: return NONE instead of ~1
boehmes [Tue, 26 Oct 2010 17:35:51 +0200] rev 40197
capture out-of-memory warnings of Z3 and turn them into proper exceptions; be more precise about SMT solver run-time: return NONE instead of ~1
Tue, 26 Oct 2010 17:35:49 +0200 honor choice of either local or remote SMT solver only for smt_filter and keep default behaviour for the SMT tactic; omit messages when running smt_filter
boehmes [Tue, 26 Oct 2010 17:35:49 +0200] rev 40196
honor choice of either local or remote SMT solver only for smt_filter and keep default behaviour for the SMT tactic; omit messages when running smt_filter
Tue, 26 Oct 2010 16:39:21 +0200 include ATP in theory List -- avoid theory edge by-passing the prominent list theory
haftmann [Tue, 26 Oct 2010 16:39:21 +0200] rev 40195
include ATP in theory List -- avoid theory edge by-passing the prominent list theory
Tue, 26 Oct 2010 15:06:36 +0200 fixed typo
krauss [Tue, 26 Oct 2010 15:06:36 +0200] rev 40194
fixed typo
Tue, 26 Oct 2010 15:01:39 +0200 merged
blanchet [Tue, 26 Oct 2010 15:01:39 +0200] rev 40193
merged
Tue, 26 Oct 2010 15:01:02 +0200 merged
blanchet [Tue, 26 Oct 2010 15:01:02 +0200] rev 40192
merged
Tue, 26 Oct 2010 14:49:48 +0200 put theorems added using "add:" at the beginning of the list returned by the relevance filter, so that they don't get truncated away
blanchet [Tue, 26 Oct 2010 14:49:48 +0200] rev 40191
put theorems added using "add:" at the beginning of the list returned by the relevance filter, so that they don't get truncated away
Tue, 26 Oct 2010 14:48:55 +0200 tuning
blanchet [Tue, 26 Oct 2010 14:48:55 +0200] rev 40190
tuning
Tue, 26 Oct 2010 15:00:57 +0200 merged
haftmann [Tue, 26 Oct 2010 15:00:57 +0200] rev 40189
merged
Tue, 26 Oct 2010 14:06:22 +0200 consider base sorts of superclasses simultaneously during processing of class specification -- avoids clash of different base sorts
haftmann [Tue, 26 Oct 2010 14:06:22 +0200] rev 40188
consider base sorts of superclasses simultaneously during processing of class specification -- avoids clash of different base sorts
Tue, 26 Oct 2010 15:00:42 +0200 more general treatment of type argument in code certificates for operations on abstract types
haftmann [Tue, 26 Oct 2010 15:00:42 +0200] rev 40187
more general treatment of type argument in code certificates for operations on abstract types
Tue, 26 Oct 2010 14:11:34 +0200 partial_function is a declaration command
haftmann [Tue, 26 Oct 2010 14:11:34 +0200] rev 40186
partial_function is a declaration command
Tue, 26 Oct 2010 14:06:21 +0200 merged
blanchet [Tue, 26 Oct 2010 14:06:21 +0200] rev 40185
merged
Tue, 26 Oct 2010 13:50:57 +0200 proper error handling for SMT solvers in Sledgehammer
blanchet [Tue, 26 Oct 2010 13:50:57 +0200] rev 40184
proper error handling for SMT solvers in Sledgehammer
Tue, 26 Oct 2010 13:50:18 +0200 NEWS
krauss [Tue, 26 Oct 2010 13:50:18 +0200] rev 40183
NEWS
Tue, 26 Oct 2010 13:17:37 +0200 merge
blanchet [Tue, 26 Oct 2010 13:17:37 +0200] rev 40182
merge
Tue, 26 Oct 2010 13:16:43 +0200 integrated "smt" proof method with Sledgehammer
blanchet [Tue, 26 Oct 2010 13:16:43 +0200] rev 40181
integrated "smt" proof method with Sledgehammer
Tue, 26 Oct 2010 13:19:31 +0200 fixed confusion introduced in 008dc2d2c395
krauss [Tue, 26 Oct 2010 13:19:31 +0200] rev 40180
fixed confusion introduced in 008dc2d2c395
Tue, 26 Oct 2010 12:23:39 +0200 merged
blanchet [Tue, 26 Oct 2010 12:23:39 +0200] rev 40179
merged
Tue, 26 Oct 2010 12:17:19 +0200 reverted e7a80c6752c9 -- there's not much point in putting a diagnosis tool (as opposed to a proof method) in Plain, but more importantly Sledgehammer must be in Main to use SMT solvers
blanchet [Tue, 26 Oct 2010 12:17:19 +0200] rev 40178
reverted e7a80c6752c9 -- there's not much point in putting a diagnosis tool (as opposed to a proof method) in Plain, but more importantly Sledgehammer must be in Main to use SMT solvers
Tue, 26 Oct 2010 12:19:31 +0200 merged
haftmann [Tue, 26 Oct 2010 12:19:31 +0200] rev 40177
merged
Tue, 26 Oct 2010 12:19:22 +0200 tuned
haftmann [Tue, 26 Oct 2010 12:19:22 +0200] rev 40176
tuned
Tue, 26 Oct 2010 12:21:45 +0200 merged
krauss [Tue, 26 Oct 2010 12:21:45 +0200] rev 40175
merged
Tue, 26 Oct 2010 12:19:02 +0200 use partial_function instead of MREC combinator; curried rev'
krauss [Tue, 26 Oct 2010 12:19:02 +0200] rev 40174
use partial_function instead of MREC combinator; curried rev'
Tue, 26 Oct 2010 12:19:02 +0200 added Heap monad instance of partial_function package
krauss [Tue, 26 Oct 2010 12:19:02 +0200] rev 40173
added Heap monad instance of partial_function package
Tue, 26 Oct 2010 12:19:02 +0200 added Spec_Rule declaration to partial_function
krauss [Tue, 26 Oct 2010 12:19:02 +0200] rev 40172
added Spec_Rule declaration to partial_function
Tue, 26 Oct 2010 12:19:01 +0200 basic documentation for command partial_function
krauss [Tue, 26 Oct 2010 12:19:01 +0200] rev 40171
basic documentation for command partial_function
Tue, 26 Oct 2010 12:19:01 +0200 remove outdated "(otherwise)" syntax from manual
krauss [Tue, 26 Oct 2010 12:19:01 +0200] rev 40170
remove outdated "(otherwise)" syntax from manual
Tue, 26 Oct 2010 12:19:01 +0200 declare recursive equation as ".simps", in accordance with other packages
krauss [Tue, 26 Oct 2010 12:19:01 +0200] rev 40169
declare recursive equation as ".simps", in accordance with other packages
Tue, 26 Oct 2010 12:16:08 +0200 merged
haftmann [Tue, 26 Oct 2010 12:16:08 +0200] rev 40168
merged
Tue, 26 Oct 2010 12:15:55 +0200 dropped accidental doubled computation
haftmann [Tue, 26 Oct 2010 12:15:55 +0200] rev 40167
dropped accidental doubled computation
Tue, 26 Oct 2010 11:51:09 +0200 optionally force the remote version of an SMT solver to be executed
boehmes [Tue, 26 Oct 2010 11:51:09 +0200] rev 40166
optionally force the remote version of an SMT solver to be executed
Tue, 26 Oct 2010 11:49:36 +0200 tuned
boehmes [Tue, 26 Oct 2010 11:49:36 +0200] rev 40165
tuned
Tue, 26 Oct 2010 11:49:23 +0200 added a mode to only filter assumptions used in a Z3 proof (in which no proof reconstruction is performed)
boehmes [Tue, 26 Oct 2010 11:49:23 +0200] rev 40164
added a mode to only filter assumptions used in a Z3 proof (in which no proof reconstruction is performed)
Tue, 26 Oct 2010 11:46:19 +0200 changed SMT configuration options; updated SMT certificates
boehmes [Tue, 26 Oct 2010 11:46:19 +0200] rev 40163
changed SMT configuration options; updated SMT certificates
Tue, 26 Oct 2010 11:45:12 +0200 joined setup of SMT solvers in one place; turned Z3-specific options into SMT options (renamed configuration options from z3_* to smt_*); more detailed SMT exception; improved SMT filter interface
boehmes [Tue, 26 Oct 2010 11:45:12 +0200] rev 40162
joined setup of SMT solvers in one place; turned Z3-specific options into SMT options (renamed configuration options from z3_* to smt_*); more detailed SMT exception; improved SMT filter interface
Tue, 26 Oct 2010 11:39:26 +0200 keep track of theorems initially given to SMT (even if they are rewritten); provide interface to filter theorems necessary for SMT proofs
boehmes [Tue, 26 Oct 2010 11:39:26 +0200] rev 40161
keep track of theorems initially given to SMT (even if they are rewritten); provide interface to filter theorems necessary for SMT proofs
Tue, 26 Oct 2010 11:31:03 +0200 merged
blanchet [Tue, 26 Oct 2010 11:31:03 +0200] rev 40160
merged
Tue, 26 Oct 2010 11:21:08 +0200 merge
blanchet [Tue, 26 Oct 2010 11:21:08 +0200] rev 40159
merge
Tue, 26 Oct 2010 11:11:23 +0200 clearer error messages
blanchet [Tue, 26 Oct 2010 11:11:23 +0200] rev 40158
clearer error messages
Tue, 26 Oct 2010 11:10:00 +0200 renaming
blanchet [Tue, 26 Oct 2010 11:10:00 +0200] rev 40157
renaming
Thu, 28 Oct 2010 15:06:47 +0200 back again to non-Apple font rendering (cf. 4977324373f2);
wenzelm [Thu, 28 Oct 2010 15:06:47 +0200] rev 40156
back again to non-Apple font rendering (cf. 4977324373f2);
Thu, 28 Oct 2010 14:56:14 +0200 dock isabelle-session at bottom (again, cf. 37bdc2220cf8) to ensure that controls are fully visible;
wenzelm [Thu, 28 Oct 2010 14:56:14 +0200] rev 40155
dock isabelle-session at bottom (again, cf. 37bdc2220cf8) to ensure that controls are fully visible;
Tue, 26 Oct 2010 16:56:07 +0200 disable broken popups for now;
wenzelm [Tue, 26 Oct 2010 16:56:07 +0200] rev 40154
disable broken popups for now;
Tue, 26 Oct 2010 15:57:16 +0200 tuned;
wenzelm [Tue, 26 Oct 2010 15:57:16 +0200] rev 40153
tuned;
Tue, 26 Oct 2010 11:31:22 +0200 do not handle arbitrary exceptions;
wenzelm [Tue, 26 Oct 2010 11:31:22 +0200] rev 40152
do not handle arbitrary exceptions;
Tue, 26 Oct 2010 11:23:27 +0200 merged
wenzelm [Tue, 26 Oct 2010 11:23:27 +0200] rev 40151
merged
Tue, 26 Oct 2010 11:20:14 +0200 Code_Runtime.trace
haftmann [Tue, 26 Oct 2010 11:20:14 +0200] rev 40150
Code_Runtime.trace
Tue, 26 Oct 2010 11:22:18 +0200 proper markup of uninterpreted ML text as @{ML_text}, not @{verbatim};
wenzelm [Tue, 26 Oct 2010 11:22:18 +0200] rev 40149
proper markup of uninterpreted ML text as @{ML_text}, not @{verbatim};
(0) -30000 -10000 -3000 -1000 -300 -100 -96 +96 +100 +300 +1000 +3000 +10000 +30000 tip