isabelle: Graph

adding postprocessing for sets in term construction of quickcheck
2010-12-15, by bulwahn
merged
2010-12-15, by boehmes
fixed trigger inference: testing if a theorem already has a trigger was too strict;
2010-12-15, by boehmes
fixed checking and translation of weights (previously, weights occurring in terms were rejected, and weight numbers were unintended translated into Vars)
2010-12-15, by boehmes
the functions term_of and prop_of are also needed in earlier stages, not only for Z3 proof reconstruction, so they really belong in SMT_Utils
2010-12-15, by boehmes
facilitate debugging
2010-12-15, by blanchet
merged
2010-12-15, by wenzelm
clean up fudge factors a little bit
2010-12-15, by blanchet
added weights to SMT problems
2010-12-15, by blanchet
move facts supplied with "add:" to the front, so that they get a better weight (SMT)
2010-12-15, by blanchet
beautify MacLaurin proofs; make better use of DERIV_intros
2010-12-15, by hoelzl
workaround for bug in weight handling -- sometimes numerals got replaced by Vars and this confused the weight extractor
2010-12-15, by blanchet
avoid ML structure aliases (especially single-letter abbreviations);
2010-12-15, by wenzelm
eliminated dead code;
2010-12-15, by wenzelm
more correct ML snippets that are unchecked;
2010-12-15, by wenzelm
merged
2010-12-15, by paulson
Added two theorems about the concept of range. Tidied up the comments.
2010-12-15, by paulson
honor "overlord" option for SMT solvers as well and don't pass "ext" to them
2010-12-15, by blanchet
make Sledgehammer's relevance filter include the "ext" rule when appropriate
2010-12-15, by blanchet
tuning
2010-12-15, by blanchet
tuning
2010-12-15, by blanchet
added support for "type_sys" option to Mirabelle
2010-12-15, by blanchet
honor "metisFT" in Mirabelle
2010-12-15, by blanchet
make "full_types" take precedence over "type_sys"
2010-12-15, by blanchet
crank up Metis's timeout for SMT solvers, since users love Metis
2010-12-15, by blanchet
generate a "using [[smt_solver = ...]]" command if a proof is found by another SMT solver than the current one, to ensure it's also used for reconstruction
2010-12-15, by blanchet
make sure first-order occurrences of "False" and "True" are handled correctly -- this broke when adding proper support for higher-order occurrences
2010-12-15, by blanchet
consider "finite" overloaded in "precise_overloaded_args" mode
2010-12-15, by blanchet
added timeout max for remote server invocation
2010-12-15, by blanchet
fix translation of higher-order equality ("fequal") if "precise_overloaded_args" is "true"
2010-12-15, by blanchet
fix Vampire parsing problem
2010-12-15, by blanchet
improve partially tagged encoding by adding a helper fact that coalesces consecutive "ti" tags
2010-12-15, by blanchet
example tuning
2010-12-15, by blanchet
remove at most one double negation -- any other double negations are part of some higher-order reasoning and should be left alone, cf. "HO_Reas.thy"
2010-12-15, by blanchet
weaken the "expect" flag so that it doesn't trigger errors if a prover is not installed
2010-12-15, by blanchet
added example to exercise higher-order reasoning with Sledgehammer and Metis
2010-12-15, by blanchet
added Sledgehammer support for higher-order propositional reasoning
2010-12-15, by blanchet
add Metis support for higher-order propositional reasoning
2010-12-15, by blanchet
implemented partially-typed "tags" type encoding
2010-12-15, by blanchet
implemented "no_types" encoding, which is too unsound to be useful but can come in handy for evaluations
2010-12-15, by blanchet
implemented new type system encoding "overload_args", which is more lightweight than "const_args" (the unsound default) and hopefully almost as sound
2010-12-15, by blanchet
tuning: unused var
2010-12-15, by blanchet
added "type_sys" option to Sledgehammer
2010-12-15, by blanchet
merged
2010-12-15, by boehmes
updated SMT certificates
2010-12-15, by boehmes
fixed proof reconstruction for lambda-lifted problems (which broke when the lambda-lifting code was changed to operate on terms instead of on theorems)
2010-12-15, by boehmes
adapted the Z3 proof parser to recent changes in Z3's proof format;
2010-12-15, by boehmes
also show function definitions for higher-order free variables in Z3 models
2010-12-15, by boehmes
always add pair rules and function update rules automatically (Boogie provides pairs and function update as built-in concepts and does not generate background axioms for them)
2010-12-15, by boehmes
re-implemented eta-expansion, lambda-lifting, and explicit application on terms (exploiting the control over the term structure);
2010-12-15, by boehmes
re-ordered SMT normalization code (eta-normalization, lambda abstractions and partial functions will be dealt with on the term level);
2010-12-15, by boehmes
added option to enable trigger inference;
2010-12-15, by boehmes
moved SMT classes and dictionary functions to SMT_Utils
2010-12-15, by boehmes
tuned
2010-12-15, by boehmes
rewrite Z3 model equations one-by-one (the previous approach led to loss of information)
2010-12-15, by boehmes
added option to modify the random seed of SMT solvers
2010-12-15, by boehmes
adding an Isar version of the MacLaurin theorem from some students' work in 2005
2010-12-15, by bulwahn
Admin/contributed_components tries to formalize compatibility with external components (for use e.g. by testing tools), guessing from the content of TUM contrib_devel directory
2010-12-14, by krauss
separated dictionary weakning into separate type
2010-12-13, by haftmann
eliminated dest_all_all_ctx
2010-12-13, by krauss
private term variant of Variable.focus
2010-12-13, by krauss
adding an executable THE operator on finite types
2010-12-13, by bulwahn
tuned headers
2010-12-12, by krauss
added signature;
2010-12-12, by krauss
add HOLCF library theories with cpo/predomain instances for HOL types
2010-12-11, by huffman
xsymbol notation for powerdomain types
2010-12-11, by huffman
new powerdomain lemmas
2010-12-11, by huffman
made smlnj happy
2010-12-11, by krauss
merged
2010-12-10, by haftmann
moved most fundamental lemmas upwards
2010-12-10, by haftmann
setting finite_type_size to 1 in mutabelle_extra
2010-12-10, by bulwahn
adding check_all instances for a few more finite types in smallcheck
2010-12-10, by bulwahn
removing unneccassary sort constraints
2010-12-10, by bulwahn
made smlnj happy
2010-12-10, by krauss
merged
2010-12-09, by haftmann
tuned names
2010-12-09, by haftmann
dictionary constants must permit explicit weakening of classes;
2010-12-09, by haftmann
tracing of term to be evaluated
2010-12-09, by haftmann
merged
2010-12-09, by hoelzl
use SUPR_ and INFI_apply instead of SUPR_, INFI_fun_expand
2010-12-08, by hoelzl
integral over setprod
2010-12-08, by hoelzl
cleanup bijectivity btw. product spaces and pairs
2010-12-08, by hoelzl
compile
2010-12-09, by blanchet
lower fudge factor
2010-12-08, by blanchet
reword error message
2010-12-08, by blanchet
implicitly call the minimizer for SMT solvers that don't return an unsat core
2010-12-08, by blanchet
renamings
2010-12-08, by blanchet
moved function to later module
2010-12-08, by blanchet
clarified terminology
2010-12-08, by blanchet
split "Sledgehammer" module into two parts, to resolve forthcoming dependency problems
2010-12-08, by blanchet
if only finite types and no real datatypes occur in the quantifiers only enumerate cardinality not size in quickcheck
2010-12-08, by bulwahn
adding a smarter enumeration scheme for finite functions
2010-12-08, by bulwahn
merged
2010-12-08, by haftmann
work around problems with eta-expansion of equations
2010-12-08, by haftmann
bot comes before top, inf before sup etc.
2010-12-08, by haftmann
tuned
2010-12-08, by haftmann
nice syntax for lattice INFI, SUPR;
2010-12-08, by haftmann
NEWS
2010-12-08, by haftmann
adding more efficient implementations for quantifiers in Enum
2010-12-08, by bulwahn
improving the mutabelle script
2010-12-08, by bulwahn
primitive definitions of bot/top/inf/sup for bool and fun are named with canonical suffix `_def` rather than `_eq`;
2010-12-08, by haftmann
primitive definitions of bot/top/inf/sup for bool and fun are named with canonical suffix `_def` rather than `_eq`
2010-12-08, by haftmann
hide popular names R and B
2010-12-08, by haftmann
built-in numbers are also built-in terms
2010-12-08, by boehmes
be more flexible: store SMT built-in symbols in generic contexts (not in theory contexts)
2010-12-08, by boehmes
merged
2010-12-07, by haftmann
more concise case names; proved extensionality
2010-12-07, by haftmann
name filter operation just filter (c.f. List.filter and list comprehension syntax)
2010-12-07, by haftmann
tuned whitespace
2010-12-07, by haftmann
eliminated some hard tabulators (deprecated);
2010-12-07, by wenzelm
pass constant arguments to the built-in check function, cf. d2b1fc1b8e19
2010-12-07, by blanchet
merged
2010-12-07, by boehmes
updated SMT certificates
2010-12-07, by boehmes
reduced unnecessary complexity; improved documentation; tuned
2010-12-07, by boehmes
tuned
2010-12-07, by boehmes
centralized handling of built-in types and constants for bitvectors
2010-12-07, by boehmes
moved smt_word.ML into the directory of the Word library
2010-12-07, by boehmes
centralized handling of built-in types and constants;
2010-12-07, by boehmes
more aggressive unfolding of unknowns in Z3 models
2010-12-06, by boehmes
tuned
2010-12-06, by boehmes