| Wed, 06 Nov 2013 10:35:30 +0100 |
blanchet |
take out even less aggressive generalization -- it's still too aggressive
|
changeset |
files
|
| Wed, 06 Nov 2013 01:57:22 +0100 |
blanchet |
reverted too aggressive 7cb8442298f0
|
changeset |
files
|
| Wed, 06 Nov 2013 01:06:01 +0100 |
blanchet |
generalize more aggressively
|
changeset |
files
|
| Tue, 05 Nov 2013 16:53:40 +0100 |
blanchet |
avoid subtle failure in the presence of top sort
|
changeset |
files
|
| Tue, 05 Nov 2013 16:47:10 +0100 |
blanchet |
tuning
|
changeset |
files
|
| Tue, 05 Nov 2013 16:47:10 +0100 |
blanchet |
get mutually recursive maps as well
|
changeset |
files
|
| Tue, 05 Nov 2013 15:10:59 +0100 |
hoelzl |
tuned proofs in Approximation
|
changeset |
files
|
| Tue, 05 Nov 2013 13:23:27 +0100 |
blanchet |
fixed subtle name shadowing bug
|
changeset |
files
|
| Tue, 05 Nov 2013 12:40:58 +0100 |
blanchet |
use right permutation in 'map2'
|
changeset |
files
|
| Tue, 05 Nov 2013 11:55:45 +0100 |
blanchet |
stronger normalization, to increase n2m cache effectiveness
|
changeset |
files
|
| Tue, 05 Nov 2013 11:17:42 +0100 |
blanchet |
make local theory operations non-pervasive (makes more intuitive sense)
|
changeset |
files
|
| Tue, 05 Nov 2013 09:45:03 +0100 |
hoelzl |
NEWS
|
changeset |
files
|
| Tue, 05 Nov 2013 09:45:02 +0100 |
hoelzl |
move Lubs from HOL to HOL-Library (replaced by conditionally complete lattices)
|
changeset |
files
|
| Tue, 05 Nov 2013 09:45:00 +0100 |
hoelzl |
generalize bdd_above/below_uminus to ordered_ab_group_add
|
changeset |
files
|
| Tue, 05 Nov 2013 09:45:00 +0100 |
hoelzl |
restrict Limsup and Liminf to complete lattices
|
changeset |
files
|
| Tue, 05 Nov 2013 09:44:59 +0100 |
hoelzl |
use INF and SUP on conditionally complete lattices in multivariate analysis
|
changeset |
files
|
| Tue, 05 Nov 2013 09:44:59 +0100 |
hoelzl |
add SUP and INF for conditionally complete lattices
|
changeset |
files
|
| Tue, 05 Nov 2013 09:44:58 +0100 |
hoelzl |
use bdd_above and bdd_below for conditionally complete lattices
|
changeset |
files
|
| Tue, 05 Nov 2013 09:44:57 +0100 |
hoelzl |
generalize SUP and INF to the syntactic type classes Sup and Inf
|
changeset |
files
|
| Tue, 05 Nov 2013 05:48:08 +0100 |
blanchet |
added some N2M caching
|
changeset |
files
|
| Tue, 05 Nov 2013 05:48:08 +0100 |
blanchet |
also generalize fixed types
|
changeset |
files
|
| Tue, 05 Nov 2013 05:48:08 +0100 |
blanchet |
generalize types when synthetizing n2m (co)recursors, to facilitate reuse
|
changeset |
files
|
| Tue, 05 Nov 2013 05:48:08 +0100 |
blanchet |
nicer error message in case of duplicates
|
changeset |
files
|
| Tue, 05 Nov 2013 15:30:53 +1100 |
kleing |
use int example like in the rest of IMP (instead of nat)
|
changeset |
files
|
| Mon, 04 Nov 2013 20:10:10 +0100 |
haftmann |
dropped dead code
|
changeset |
files
|
| Mon, 04 Nov 2013 20:10:09 +0100 |
haftmann |
fact generalization and name consolidation
|
changeset |
files
|
| Mon, 04 Nov 2013 20:10:06 +0100 |
haftmann |
streamlined setup of linear arithmetic
|
changeset |
files
|
| Mon, 04 Nov 2013 18:08:47 +0100 |
blanchet |
make 'try0' return faster when invoked as part of 'try'
|
changeset |
files
|
| Mon, 04 Nov 2013 17:25:36 +0100 |
blanchet |
careful with lists of different lengths
|
changeset |
files
|
| Mon, 04 Nov 2013 16:53:43 +0100 |
blanchet |
split 'primrec_new' and 'primcorec' code (to ease bootstrapping, e.g. dependency on datatype 'String' in 'primcorec')
|
changeset |
files
|
| Mon, 04 Nov 2013 15:44:43 +0100 |
blanchet |
better error handling
|
changeset |
files
|
| Mon, 04 Nov 2013 14:54:29 +0100 |
traytel |
more robust treatment of dead variables in n2m
|
changeset |
files
|
| Mon, 04 Nov 2013 14:46:38 +0100 |
blanchet |
more robust n2m w.r.t. 'let's
|
changeset |
files
|
| Mon, 04 Nov 2013 12:40:28 +0100 |
blanchet |
tuning
|
changeset |
files
|
| Mon, 04 Nov 2013 11:59:08 +0100 |
blanchet |
strengthened tactic
|
changeset |
files
|
| Mon, 04 Nov 2013 11:03:13 +0100 |
blanchet |
made n2m code more robust w.r.t. advanced constructs (e.g. lambdas)
|
changeset |
files
|
| Mon, 04 Nov 2013 10:52:41 +0100 |
blanchet |
handle constructor syntax in n2m primcorec
|
changeset |
files
|
| Mon, 04 Nov 2013 10:52:41 +0100 |
blanchet |
typo
|
changeset |
files
|
| Mon, 04 Nov 2013 10:52:41 +0100 |
blanchet |
made sugared 'coinduct' theorem construction n2m-proof
|
changeset |
files
|
| Mon, 04 Nov 2013 10:52:41 +0100 |
blanchet |
moved code around
|
changeset |
files
|
| Mon, 04 Nov 2013 10:52:41 +0100 |
blanchet |
tuning
|
changeset |
files
|
| Mon, 04 Nov 2013 10:52:41 +0100 |
blanchet |
make code more robust w.r.t. applied/unapplied map (primrec vs. primcorec)
|
changeset |
files
|
| Mon, 04 Nov 2013 10:52:41 +0100 |
blanchet |
conceal definition
|
changeset |
files
|
| Sat, 02 Nov 2013 17:50:28 +0100 |
nipkow |
more exercises
|
changeset |
files
|
| Sat, 02 Nov 2013 17:19:34 +0100 |
nipkow |
more exercises
|
changeset |
files
|
| Fri, 01 Nov 2013 18:51:14 +0100 |
haftmann |
more simplification rules on unary and binary minus
|
changeset |
files
|
| Thu, 31 Oct 2013 16:54:22 +0100 |
blanchet |
generate stable names for axioms
|
changeset |
files
|
| Thu, 31 Oct 2013 11:44:20 +0100 |
haftmann |
purely algebraic foundation for even/odd
|
changeset |
files
|
| Thu, 31 Oct 2013 11:44:20 +0100 |
haftmann |
moving generic lemmas out of theory parity, disregarding some unused auxiliary lemmas;
|
changeset |
files
|
| Thu, 31 Oct 2013 11:44:20 +0100 |
haftmann |
explicit type class for modelling even/odd parity
|
changeset |
files
|
| Thu, 31 Oct 2013 11:44:20 +0100 |
haftmann |
generalized of_bool conversion
|
changeset |
files
|
| Thu, 31 Oct 2013 11:44:20 +0100 |
haftmann |
separated bit operations on type bit from generic syntactic bit operations
|
changeset |
files
|
| Thu, 31 Oct 2013 11:44:20 +0100 |
haftmann |
restructed
|
changeset |
files
|
| Thu, 31 Oct 2013 11:44:20 +0100 |
haftmann |
generalised lemma
|
changeset |
files
|
| Thu, 31 Oct 2013 11:44:20 +0100 |
haftmann |
more lemmas on division
|
changeset |
files
|
| Thu, 31 Oct 2013 11:44:20 +0100 |
haftmann |
more convenient place for a theory in solitariness
|
changeset |
files
|
| Thu, 31 Oct 2013 11:44:20 +0100 |
haftmann |
consolidated clone theory
|
changeset |
files
|
| Thu, 31 Oct 2013 11:48:45 +0100 |
nipkow |
more exercises
|
changeset |
files
|
| Wed, 30 Oct 2013 17:20:59 +0100 |
nipkow |
tuned text
|
changeset |
files
|
| Tue, 29 Oct 2013 13:48:18 +0100 |
berghofe |
inst_lift now fully instantiates context to avoid problems with loose bound variables
|
changeset |
files
|
| Tue, 29 Oct 2013 12:13:00 +0100 |
panny |
include corecursive functions' arguments in callssss
|
changeset |
files
|
| Tue, 29 Oct 2013 08:06:08 +0100 |
nipkow |
more exercises
|
changeset |
files
|
| Mon, 28 Oct 2013 10:29:56 +0100 |
nipkow |
merged
|
changeset |
files
|
| Mon, 28 Oct 2013 10:29:43 +0100 |
nipkow |
more exercises
|
changeset |
files
|
| Sun, 27 Oct 2013 19:02:26 +0100 |
blanchet |
commented out vaporware
|
changeset |
files
|
| Sat, 26 Oct 2013 23:06:40 +0200 |
nipkow |
more exercises
|
changeset |
files
|
| Sat, 26 Oct 2013 13:01:41 +0200 |
blanchet |
tuning
|
changeset |
files
|
| Sat, 26 Oct 2013 13:00:55 +0200 |
blanchet |
tuning
|
changeset |
files
|
| Sat, 26 Oct 2013 12:57:17 +0200 |
blanchet |
tuned names (to make them independent from temporary naming convention used in characteristic theorems)
|
changeset |
files
|
| Sat, 26 Oct 2013 12:54:57 +0200 |
blanchet |
align 'primrec_new' on 'primcorec' (+ got rid of one more 'dummyT')
|
changeset |
files
|
| Sat, 26 Oct 2013 12:54:39 +0200 |
blanchet |
convenience: handle composition gracefully in map in 'primcorec', analogously to 'primrec_new'
|
changeset |
files
|
| Sat, 26 Oct 2013 12:54:21 +0200 |
blanchet |
tuned error message
|
changeset |
files
|
| Fri, 25 Oct 2013 16:20:54 +0200 |
nipkow |
more exercises
|
changeset |
files
|
| Thu, 24 Oct 2013 19:43:21 +0200 |
blanchet |
handle applied ctor arguments gracefully when computing 'callssss' (for recursion through functions)
|
changeset |
files
|
| Thu, 24 Oct 2013 18:50:59 +0200 |
blanchet |
tuning
|
changeset |
files
|
| Thu, 24 Oct 2013 18:37:54 +0200 |
blanchet |
more correct (!) types for recursive calls
|
changeset |
files
|
| Thu, 24 Oct 2013 15:56:03 +0200 |
blanchet |
watch out for 'case' constant canditates whose general type is 'a (e.g. 'undefined')
|
changeset |
files
|
| Thu, 24 Oct 2013 15:32:34 +0200 |
blanchet |
got rid of annoying duplicate rewrite rule warnings
|
changeset |
files
|
| Thu, 24 Oct 2013 12:43:33 +0200 |
blanchet |
use definitions for LEO-II as well -- this simplifies the code and matches some users' expectations
|
changeset |
files
|
| Thu, 24 Oct 2013 10:03:20 +0200 |
traytel |
refactored rtrancl_while; prove termination for finite rtrancl
|
changeset |
files
|
| Wed, 23 Oct 2013 21:12:20 +0200 |
nipkow |
more exercises
|
changeset |
files
|
| Wed, 23 Oct 2013 18:04:43 +0200 |
nipkow |
added exercises
|
changeset |
files
|
| Wed, 23 Oct 2013 14:53:36 +0200 |
blanchet |
added 'primcorec' examples
|
changeset |
files
|
| Wed, 23 Oct 2013 09:58:30 +0200 |
nipkow |
tuned
|
changeset |
files
|
| Tue, 22 Oct 2013 16:07:09 +0200 |
traytel |
removed junk
|
changeset |
files
|
| Tue, 22 Oct 2013 14:22:06 +0200 |
traytel |
update doc according to c0186a0d8cb3
|
changeset |
files
|
| Tue, 22 Oct 2013 14:17:12 +0200 |
traytel |
define a trivial nonemptiness witness if none is provided
|
changeset |
files
|
| Mon, 21 Oct 2013 23:45:27 +0200 |
blanchet |
made lower-level function available
|
changeset |
files
|
| Mon, 21 Oct 2013 23:35:57 +0200 |
blanchet |
more doc -- feedback from Andrei P.
|
changeset |
files
|
| Mon, 21 Oct 2013 21:06:19 +0200 |
nipkow |
added exercise
|
changeset |
files
|
| Mon, 21 Oct 2013 10:49:02 +0200 |
blanchet |
more docs
|
changeset |
files
|
| Mon, 21 Oct 2013 10:38:21 +0200 |
blanchet |
more docs
|
changeset |
files
|
| Mon, 21 Oct 2013 10:31:31 +0200 |
blanchet |
more docs
|
changeset |
files
|
| Mon, 21 Oct 2013 10:19:57 +0200 |
blanchet |
expand doc a bit
|
changeset |
files
|
| Mon, 21 Oct 2013 09:35:18 +0200 |
blanchet |
updated doc
|
changeset |
files
|
| Mon, 21 Oct 2013 09:31:19 +0200 |
blanchet |
tuning
|
changeset |
files
|
| Mon, 21 Oct 2013 09:14:05 +0200 |
blanchet |
warn about incompatible recursor signature
|
changeset |
files
|
| Mon, 21 Oct 2013 08:27:51 +0200 |
blanchet |
more informative abort
|
changeset |
files
|
| Mon, 21 Oct 2013 07:50:32 +0200 |
blanchet |
tuning
|
changeset |
files
|
| Mon, 21 Oct 2013 07:24:18 +0200 |
blanchet |
systematically close derivations in BNF package
|
changeset |
files
|
| Sun, 20 Oct 2013 23:36:18 +0200 |
blanchet |
removed temporary error handling
|
changeset |
files
|
| Sun, 20 Oct 2013 23:29:49 +0200 |
blanchet |
strengthened tactic
|
changeset |
files
|
| Sun, 20 Oct 2013 22:51:21 +0200 |
blanchet |
tuning
|
changeset |
files
|
| Sun, 20 Oct 2013 22:39:40 +0200 |
blanchet |
reintroduced parts of 07a8145aaeba that a22ded8a7f7d wrongly took out
|
changeset |
files
|
| Sun, 20 Oct 2013 21:59:08 +0200 |
blanchet |
tuning
|
changeset |
files
|
| Sun, 20 Oct 2013 19:23:28 +0200 |
blanchet |
gracefully handle case where a nested recursive variable appears directly on the rhs of a primcorec equation
|
changeset |
files
|
| Sun, 20 Oct 2013 19:20:08 +0200 |
blanchet |
tuning
|
changeset |
files
|
| Sun, 20 Oct 2013 19:20:08 +0200 |
blanchet |
tuning
|
changeset |
files
|
| Sun, 20 Oct 2013 19:20:08 +0200 |
blanchet |
tuning
|
changeset |
files
|
| Sun, 20 Oct 2013 19:20:08 +0200 |
blanchet |
tuning
|
changeset |
files
|
| Sun, 20 Oct 2013 18:22:59 +0200 |
blanchet |
simplify code
|
changeset |
files
|
| Sun, 20 Oct 2013 17:45:54 +0200 |
blanchet |
avoid tactic failure for equations that contain an unapplied 'id'
|
changeset |
files
|
| Sat, 19 Oct 2013 00:00:50 +0200 |
blanchet |
improve support for recursion through functions
|
changeset |
files
|
| Fri, 18 Oct 2013 20:26:46 +0200 |
blanchet |
handle composition for multiple arguments correctly
|
changeset |
files
|
| Fri, 18 Oct 2013 19:18:32 +0200 |
panny |
merge
|
changeset |
files
|
| Fri, 18 Oct 2013 19:03:39 +0200 |
panny |
generate callssss
|
changeset |
files
|
| Fri, 18 Oct 2013 18:58:46 +0200 |
blanchet |
set stage for more flexible 'primrec' syntax for recursion through functions
|
changeset |
files
|
| Fri, 18 Oct 2013 17:47:25 +0200 |
blanchet |
don't print BNF constants
|
changeset |
files
|
| Fri, 18 Oct 2013 16:02:07 +0200 |
blanchet |
tuning
|
changeset |
files
|
| Fri, 18 Oct 2013 15:42:55 +0200 |
blanchet |
conceal even more ugly constructions
|
changeset |
files
|
| Fri, 18 Oct 2013 15:25:39 +0200 |
blanchet |
conceal more ugly constructions
|
changeset |
files
|
| Fri, 18 Oct 2013 15:19:21 +0200 |
blanchet |
conceal prim(co)rec definitions
|
changeset |
files
|
| Fri, 18 Oct 2013 15:12:04 +0200 |
blanchet |
avoid 'co_' prefix with underscore meaning 'co', since it is our only possible identifier representation of '(co)'
|
changeset |
files
|
| Fri, 18 Oct 2013 15:00:40 +0200 |
blanchet |
updated docs
|
changeset |
files
|
| Fri, 18 Oct 2013 14:58:02 +0200 |
blanchet |
set code attribute on discriminator equations
|
changeset |
files
|
| Fri, 18 Oct 2013 13:38:55 +0200 |
blanchet |
MaSh error handling
|
changeset |
files
|
| Fri, 18 Oct 2013 13:30:09 +0200 |
blanchet |
repair invariant in MaSh when learning new proofs
|
changeset |
files
|
| Fri, 18 Oct 2013 10:43:21 +0200 |
blanchet |
killed more "no_atp"s
|
changeset |
files
|
| Fri, 18 Oct 2013 10:43:20 +0200 |
blanchet |
killed most "no_atp", to make Sledgehammer more complete
|
changeset |
files
|
| Fri, 18 Oct 2013 10:35:57 +0200 |
blanchet |
doc fixes suggested by Andreas L.
|
changeset |
files
|
| Fri, 18 Oct 2013 10:35:56 +0200 |
blanchet |
make sure that registered code equations are actually equations
|
changeset |
files
|
| Fri, 18 Oct 2013 10:35:55 +0200 |
blanchet |
accept very long lines in MaSh
|
changeset |
files
|
| Fri, 18 Oct 2013 00:05:31 +0200 |
blanchet |
make sure add: doesn't add duplicates, and works for [no_atp] facts
|
changeset |
files
|
| Thu, 17 Oct 2013 23:41:00 +0200 |
blanchet |
no fact subsumption -- this only confuses later code, e.g. 'add:'
|
changeset |
files
|
| Thu, 17 Oct 2013 20:49:19 +0200 |
blanchet |
generate a comment storing the goal nickname in "learn_prover"
|
changeset |
files
|
| Thu, 17 Oct 2013 20:20:53 +0200 |
blanchet |
clarified message
|
changeset |
files
|
| Thu, 17 Oct 2013 20:03:37 +0200 |
blanchet |
added thread-safety warnings
|
changeset |
files
|
| Thu, 17 Oct 2013 18:53:00 +0200 |
blanchet |
avoid confusion between outer ifs and inner ifs, that caused tactic to go berserk
|
changeset |
files
|
| Thu, 17 Oct 2013 18:53:00 +0200 |
blanchet |
handle nested tuples in 'let's
|
changeset |
files
|
| Thu, 17 Oct 2013 16:45:54 +0200 |
nipkow |
more exercises
|
changeset |
files
|
| Thu, 17 Oct 2013 13:37:13 +0200 |
blanchet |
also unfold let (_, _) = ... syntax
|
changeset |
files
|
| Thu, 17 Oct 2013 11:27:53 +0200 |
blanchet |
added helper function (that solves chicken-and-egg problem w.r.t. "callssss")
|
changeset |
files
|
| Thu, 17 Oct 2013 10:29:28 +0200 |
blanchet |
graceful handling of abort
|
changeset |
files
|
| Thu, 17 Oct 2013 10:06:48 +0200 |
panny |
generalized interface
|
changeset |
files
|
| Thu, 17 Oct 2013 02:29:49 +0200 |
blanchet |
choose facts to reprove more randomly, to avoid getting stuck with impossible problems at first
|
changeset |
files
|
| Thu, 17 Oct 2013 02:22:54 +0200 |
blanchet |
thread the goal through instead of relying on unreliable (possibly fake) state
|
changeset |
files
|
| Thu, 17 Oct 2013 01:34:34 +0200 |
blanchet |
added comment
|
changeset |
files
|
| Thu, 17 Oct 2013 01:22:15 +0200 |
blanchet |
tuning
|
changeset |
files
|
| Thu, 17 Oct 2013 01:20:40 +0200 |
blanchet |
verbose minimization when learning from ATP proofs
|
changeset |
files
|
| Thu, 17 Oct 2013 01:10:08 +0200 |
blanchet |
if slicing is disabled, pick the maximum number of facts, not the number of facts in the last slice
|
changeset |
files
|
| Thu, 17 Oct 2013 01:04:00 +0200 |
blanchet |
if slicing is disabled, don't enforce last slice's "max_facts", but rather the maximum "max_facts"
|
changeset |
files
|
| Thu, 17 Oct 2013 01:03:59 +0200 |
blanchet |
fast track -- avoid domain error in 0 case
|
changeset |
files
|
| Thu, 17 Oct 2013 01:03:59 +0200 |
blanchet |
remove overloading of "max_facts" -- it already controls the number of facts passed to ATPs for 'learn_prover'
|
changeset |
files
|
| Wed, 16 Oct 2013 21:45:15 +0200 |
nipkow |
merged
|
changeset |
files
|
| Wed, 16 Oct 2013 21:44:56 +0200 |
nipkow |
tuned exercises
|
changeset |
files
|
| Wed, 16 Oct 2013 20:44:33 +0200 |
panny |
use Code.abort instead of undefined in auto-generated equations
|
changeset |
files
|
| Wed, 16 Oct 2013 19:55:23 +0200 |
blanchet |
have MaSh minimize
|
changeset |
files
|
| Tue, 15 Oct 2013 23:00:46 +0200 |
blanchet |
tweaked signature
|
changeset |
files
|
| Tue, 15 Oct 2013 22:55:01 +0200 |
blanchet |
strengthened tactic to deal with 'False ==> ...'
|
changeset |
files
|
| Tue, 15 Oct 2013 17:21:16 +0200 |
blanchet |
made theorem extraction code not delve too far when looking at local fact, by relying on 'strip_thm' instead of (wrongly) reverse-engineering proof terms
|
changeset |
files
|
| Tue, 15 Oct 2013 16:14:52 +0200 |
blanchet |
improved duplicate detection in "build_name_tables" by ensuring that the earliest occurrence of a duplicate (if it exists) gets picked as the canonical instance
|
changeset |
files
|
| Tue, 15 Oct 2013 15:31:32 +0200 |
blanchet |
updated S/H docs
|
changeset |
files
|
| Tue, 15 Oct 2013 15:31:18 +0200 |
blanchet |
use MePo with Auto Sledgehammer, because it's lighter than MaSh and always available
|
changeset |
files
|
| Tue, 15 Oct 2013 15:26:58 +0200 |
blanchet |
drop only real duplicates, not subsumed facts -- this confuses MaSh
|
changeset |
files
|
| Tue, 15 Oct 2013 11:49:39 +0100 |
paulson |
renamed relcomp_def to relcomp_unfold
|
changeset |
files
|
| Tue, 15 Oct 2013 12:25:45 +0200 |
nipkow |
fixed thm names
|
changeset |
files
|
| Tue, 15 Oct 2013 10:59:34 +0200 |
blanchet |
addressed rare case where the same symbol would be treated alternately as a function and as a predicate -- adding "top2I top_boolI" to a problem that didn't talk about "top" was a way to trigger the issue
|
changeset |
files
|
| Mon, 14 Oct 2013 11:14:14 +0200 |
blanchet |
added Nitpick limitations to docs
|
changeset |
files
|
| Mon, 14 Oct 2013 11:07:59 +0200 |
blanchet |
more defensive Nitpick setup -- exotic types of recursion are not supported yet in the model finder
|
changeset |
files
|
| Mon, 14 Oct 2013 10:55:49 +0200 |
blanchet |
keep temporary error handling in there until code equations are properly generated
|
changeset |
files
|
| Mon, 14 Oct 2013 10:50:44 +0200 |
blanchet |
tuning (simplified parts of 92c5bd3b342d)
|
changeset |
files
|
| Mon, 14 Oct 2013 10:27:16 +0200 |
blanchet |
tuning
|
changeset |
files
|
| Mon, 14 Oct 2013 10:06:03 +0200 |
blanchet |
stengthened tactic to cope with abort cases
|
changeset |
files
|
| Mon, 14 Oct 2013 09:31:42 +0200 |
blanchet |
tuned names
|
changeset |
files
|
| Mon, 14 Oct 2013 09:17:04 +0200 |
blanchet |
strengthened tactic w.r.t. "let"
|
changeset |
files
|
| Sun, 13 Oct 2013 21:36:26 +0200 |
blanchet |
more prominent MaSh errors
|
changeset |
files
|
| Fri, 11 Oct 2013 23:15:30 +0200 |
panny |
compile -- fix typo introduced in 07a8145aaeba
|
changeset |
files
|
| Fri, 11 Oct 2013 20:47:37 +0200 |
panny |
pass the right theorems to tactic
|
changeset |
files
|
| Fri, 11 Oct 2013 16:31:23 +0200 |
panny |
prove user-supplied equations for ctr and code reductions, preserving "let"s, "case"s etc.;
|
changeset |
files
|
| Thu, 10 Oct 2013 08:23:57 +0200 |
blanchet |
repaired confusion between the stated and effective fact filter -- the mismatch could result in "Match" exceptions
|
changeset |
files
|
| Thu, 10 Oct 2013 01:17:37 +0200 |
blanchet |
simplify fudge factor code
|
changeset |
files
|
| Wed, 09 Oct 2013 17:21:28 +0200 |
blanchet |
cleanup SMT-related config options
|
changeset |
files
|
| Wed, 09 Oct 2013 16:40:03 +0200 |
blanchet |
no isar proofs if preplay was not attempted
|
changeset |
files
|
| Wed, 09 Oct 2013 16:38:48 +0200 |
blanchet |
normalize more equalities
|
changeset |
files
|
| Wed, 09 Oct 2013 16:07:33 +0200 |
blanchet |
parallelize MeSh
|
changeset |
files
|
| Wed, 09 Oct 2013 15:58:02 +0200 |
blanchet |
run relevance filter only once for ATPs and SMT solvers, since it should now yield the same results anyway
|
changeset |
files
|
| Wed, 09 Oct 2013 15:39:34 +0200 |
blanchet |
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
|
changeset |
files
|
| Wed, 09 Oct 2013 10:47:43 +0200 |
blanchet |
minor performance tuning
|
changeset |
files
|
| Wed, 09 Oct 2013 09:53:18 +0200 |
blanchet |
use plain types instead of dedicated type pattern
|
changeset |
files
|
| Wed, 09 Oct 2013 09:51:24 +0200 |
blanchet |
duplicate term and type patterns
|
changeset |
files
|
| Wed, 09 Oct 2013 09:47:59 +0200 |
blanchet |
optimized built-in const check
|
changeset |
files
|
| Wed, 09 Oct 2013 08:28:36 +0200 |
blanchet |
added TODO
|
changeset |
files
|
| Wed, 09 Oct 2013 08:12:53 +0200 |
blanchet |
crank up limit a bit -- truly huge background theories are still nearly 3 times larger
|
changeset |
files
|
| Tue, 08 Oct 2013 22:33:05 +0200 |
blanchet |
higher minimum relevance threshold, to prevent Sledgehammer from taking too long on "lemma False"
|
changeset |
files
|
| Tue, 08 Oct 2013 21:19:46 +0200 |
blanchet |
minor fact filter speedups
|
changeset |
files
|
| Tue, 08 Oct 2013 20:56:35 +0200 |
blanchet |
more gracefully handle huge theories in relevance filters
|
changeset |
files
|
| Tue, 08 Oct 2013 20:53:37 +0200 |
blanchet |
handle huge MaSh requests gracefully
|
changeset |
files
|
| Tue, 08 Oct 2013 16:40:03 +0200 |
blanchet |
further optimization in relevance filter
|
changeset |
files
|
| Tue, 08 Oct 2013 14:53:33 +0200 |
blanchet |
further speed up duplicate elimination
|
changeset |
files
|
| Tue, 08 Oct 2013 14:41:25 +0200 |
blanchet |
more efficient theorem variable normalization
|
changeset |
files
|
| Mon, 07 Oct 2013 23:44:53 +0200 |
blanchet |
strengthened constructor-view tactic to deal with 'let's
|
changeset |
files
|
| Mon, 07 Oct 2013 23:38:57 +0200 |
blanchet |
allow 'let's around constructors in constructor view
|
changeset |
files
|
| Mon, 07 Oct 2013 20:54:55 +0200 |
blanchet |
reword abstract
|
changeset |
files
|
| Mon, 07 Oct 2013 20:34:16 +0200 |
blanchet |
more primcorec docs
|
changeset |
files
|
| Mon, 07 Oct 2013 20:34:14 +0200 |
blanchet |
minor doc fix
|
changeset |
files
|
| Mon, 07 Oct 2013 08:39:50 -0700 |
huffman |
new topological lemmas; tuned proofs
|
changeset |
files
|
| Sun, 06 Oct 2013 20:54:28 +0200 |
blanchet |
strengthen the tactics to bring them in sync with the simplifications taking place in the code (and weaken the simplifications a bit -- let's not deal with implies)
|
changeset |
files
|
| Sun, 06 Oct 2013 20:24:06 +0200 |
blanchet |
generate optimized DNF formula
|
changeset |
files
|
| Sun, 06 Oct 2013 20:24:05 +0200 |
blanchet |
rationalized negation code
|
changeset |
files
|
| Sat, 05 Oct 2013 11:06:07 +0200 |
blanchet |
honor externally set MASH_PORT
|
changeset |
files
|
| Fri, 04 Oct 2013 18:27:07 +0200 |
panny |
process code-style inputs
|
changeset |
files
|
| Fri, 04 Oct 2013 17:00:35 +0200 |
blanchet |
more tracing
|
changeset |
files
|
| Fri, 04 Oct 2013 16:51:26 +0200 |
blanchet |
more thorough spying
|
changeset |
files
|
| Fri, 04 Oct 2013 16:11:19 +0200 |
blanchet |
more Sledgehammer spying -- record fact indices
|
changeset |
files
|
| Fri, 04 Oct 2013 14:35:00 +0200 |
blanchet |
prevent explosion in monomorphizer (e.g. when the facts typerep_int_def typerep_num_def typerep_option_def typerep_node_def are selected)
|
changeset |
files
|
| Fri, 04 Oct 2013 12:59:18 +0200 |
blanchet |
removed pointless special case
|
changeset |
files
|
| Fri, 04 Oct 2013 11:52:10 +0200 |
blanchet |
run fewer provers in "try" mode
|
changeset |
files
|
| Fri, 04 Oct 2013 11:28:28 +0200 |
blanchet |
count remote threads as well when balancing CPU usage -- otherwise jEdit users and other users of the "blocking" mode may have to wait for 2 * timeout if they e.g. have 4 cores and 5 provers (the typical situation)
|
changeset |
files
|
| Fri, 04 Oct 2013 11:12:28 +0200 |
blanchet |
more parallelism in blocking mode
|
changeset |
files
|
| Fri, 04 Oct 2013 09:46:08 +0200 |
blanchet |
more robustness in MaSh
|
changeset |
files
|
| Thu, 03 Oct 2013 19:01:10 +0200 |
wenzelm |
back to post-release mode -- after fork point;
|
changeset |
files
|
| Thu, 03 Oct 2013 16:32:33 +0200 |
wenzelm |
tuned;
|
changeset |
files
|
| Thu, 03 Oct 2013 16:25:40 +0200 |
wenzelm |
tuned;
|
changeset |
files
|
| Thu, 03 Oct 2013 16:15:47 +0200 |
wenzelm |
more notes;
|
changeset |
files
|