Mercurial
Mercurial
>
repos
>
isabelle
/ graph
summary
|
shortlog
|
changelog
| graph |
tags
|
bookmarks
|
branches
|
files
|
gz
|
help
less
more
|
(0)
-30000
-10000
-3000
-1000
-300
-100
-60
+60
+100
+300
+1000
+3000
+10000
+30000
tip
Find changesets by keywords (author, files, the commit message), revision number or hash, or
revset expression
.
The revision graph only works with JavaScript-enabled browsers.
proper method_setup "split_idle";
2011-05-13, by wenzelm
proper method_setup "enabled";
2011-05-13, by wenzelm
simplified clasimpset declarations -- prefer attributes;
2011-05-13, by wenzelm
reduce the number of mono iterations to prevent the mono code from going berserk
2011-05-13, by blanchet
tuned comment
2011-05-13, by blanchet
optimized a common case
2011-05-13, by blanchet
avoid "UnequalLengths" exception for special constant "fequal" -- and optimize code in the common case where no type arguments are needed
2011-05-13, by blanchet
tweak E slices
2011-05-13, by blanchet
make SML/NJ happy
2011-05-13, by blanchet
fixed off-by-one bug
2011-05-13, by blanchet
added convenience syntax
2011-05-13, by blanchet
prefer Proof.context over old-style claset/simpset;
2011-05-12, by wenzelm
prefer plain simpset operations;
2011-05-12, by wenzelm
removed obsolete old-style cs/css;
2011-05-12, by wenzelm
modernized dead code;
2011-05-12, by wenzelm
eliminated old-style MI_fast_css -- replaced by fast_solver with config option;
2011-05-12, by wenzelm
eliminated obsolete MI_css -- use current context directly;
2011-05-12, by wenzelm
proper method_setup;
2011-05-12, by wenzelm
modernized simproc_setup;
2011-05-12, by wenzelm
prefer Proof.context over old-style clasimpset;
2011-05-12, by wenzelm
modernized dead code;
2011-05-12, by wenzelm
modernized specifications;
2011-05-12, by wenzelm
merged
2011-05-12, by wenzelm
added hints and FAQs
2011-05-12, by blanchet
prove one more lemma using Sledgehammer, with some guidance, and replace clumsy old proof that relied on old extensionality behavior
2011-05-12, by blanchet
fixed several bugs in Isar proof reconstruction, in particular w.r.t. mangled types and hAPP
2011-05-12, by blanchet
another concession to backward compatibility
2011-05-12, by blanchet
no need to use metisFT for Isar proofs -- metis falls back on it anyway
2011-05-12, by blanchet
handle equality proxy in a more backward-compatible way
2011-05-12, by blanchet
remove problematic Isar proof
2011-05-12, by blanchet
added two mildly higher-order examples contributed by TN, removed references to obsoleted type systems, and moved things around
2011-05-12, by blanchet
robustly detect how many type args were passed to the ATP, even if some of them were omitted
2011-05-12, by blanchet
make sure "simple_types_query" and "simple_types_bang" symbols are declared with the proper types
2011-05-12, by blanchet
drop some type arguments to constants in unsound type systems + remove a few type systems that make no sense from the circulation
2011-05-12, by blanchet
tuning
2011-05-12, by blanchet
fixed conjecture resolution bug for Vampire 1.0's TSTP output
2011-05-12, by blanchet
ensure Set.member isn't introduced by Meson's preprocessing if it's supposed to be unfolded
2011-05-12, by blanchet
Metis doesn't find an old proof in acceptable time now that higher-order equality reasoning is supported -- tuned proof script to help it
2011-05-12, by blanchet
drop support for Vampire's native output format -- it has too many undocumented oddities, e.g. "BDD definition:" lines
2011-05-12, by blanchet
use the same code for extensionalization in Metis and Sledgehammer and generalize that code so that it gracefully handles negations (e.g. negated conjecture), formulas of the form (%x. t) = u, etc.
2011-05-12, by blanchet
further lower penalty associated with existentials in Sledgehammer's relevance filter, so that "exhaust" facts are picked up
2011-05-12, by blanchet
reenabled equality proxy in Metis for higher-order reasoning
2011-05-12, by blanchet
added "SMT." qualifier for constant to make it possible to reload "smt_monomorph.ML" from outside the "SMT" theory (for experiments) -- this is also consistent with the other SMT constants mentioned in this source file
2011-05-12, by blanchet
reflect option renaming in doc + do not document the type systems poly_preds? and poly_tags?, since they are virtually identical to the non-? versions
2011-05-12, by blanchet
unfold set constants in Sledgehammer/ATP as well if Metis does it too
2011-05-12, by blanchet
do not pollute relevance filter facts with too many facts about the boring set constants Collect and mem_def, which we might anyway unfold depending on Meson's settings
2011-05-12, by blanchet
renamed "max_mono_instances" to "max_new_mono_instances" and changed its semantics accordingly
2011-05-12, by blanchet
added unfold set constant functionality to Meson/Metis -- disabled by default for now
2011-05-12, by blanchet
remove unused parameter
2011-05-12, by blanchet
reduced penalty associated with existential quantifiers
2011-05-12, by blanchet
ensure that Auto Sledgehammer is run with full type information
2011-05-12, by blanchet
fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
2011-05-12, by blanchet
don't give weights to built-in symbols
2011-05-12, by blanchet
more robust exception handling in Metis (also works if there are several subgoals)
2011-05-12, by blanchet
no penality for constants that appear in chained facts
2011-05-12, by blanchet
gracefully declare fTrue and fFalse proxies' types if the constants only appear in the helpers
2011-05-12, by blanchet
improve detection of quantifications over dangerous types by leveraging "is_type_surely_finite" predicate and added "prop" to the list of surely finite types
2011-05-12, by blanchet
tune whitespace
2011-05-12, by blanchet
added configuration options for experimental features
2011-05-12, by blanchet
ensure type class predicates are generated in symbol declarations (for "poly_preds" and similar)
2011-05-12, by blanchet
less
more
|
(0)
-30000
-10000
-3000
-1000
-300
-100
-60
+60
+100
+300
+1000
+3000
+10000
+30000
tip