isabelle: Graph

added markers in proofs identifying origin of proofs, in eval driver
2013-02-08, by blanchet
added option to use SNoW as machine learning algo
2013-02-08, by blanchet
more robustness in Isar proof reconstruction (cf. bug report by Ondrej)
2013-02-07, by blanchet
more precise error message
2013-02-07, by blanchet
killed deadcode
2013-02-07, by blanchet
more robustness w.r.t. 0
2013-02-07, by blanchet
hide "ext" name, but keep "HOL.ext", to ensure consistency in naming when "ext" is used by LEO-II or Satallax implicitly
2013-02-07, by blanchet
tuned indent
2013-02-07, by blanchet
drop needless .0s
2013-02-07, by blanchet
distinguish MeSh and smart -- with smart, allow combinations of MaSh, MeSh, and MePo in different slices -- and use MaSh also with SMT solvers, based on evaluation
2013-02-07, by blanchet
infix syntax for streams (reflecting the one for lists)
2013-02-07, by traytel
replace open_interval with the rule open_tendstoI; generalize Liminf/Limsup rules
2013-02-06, by hoelzl
check alpha equality after applying beta and eta conversion in let-simproc, otherwise the simplifier may loop
2013-02-06, by hoelzl
removed spurious trimming
2013-02-05, by blanchet
tuned
2013-02-04, by nipkow
tuned slicing (E-MaLeS and E-Par)
2013-02-03, by blanchet
tune slices further
2013-02-02, by blanchet
tweak ATP slices further
2013-02-02, by blanchet
compile
2013-01-31, by blanchet
also have SMT solvers alternate fact filter
2013-01-31, by blanchet
use the right filter in each slice
2013-01-31, by blanchet
tuned slices
2013-01-31, by blanchet
store fact filter along with ATP slice
2013-01-31, by blanchet
tuned data structure
2013-01-31, by blanchet
thread through fact triple component from which used facts come, for accurate index output
2013-01-31, by blanchet
more precise output of selected facts
2013-01-31, by blanchet
thread fact triple (MeSh, MePo, MaSh) to allow different filters in different slices
2013-01-31, by blanchet
simplified SMT solver code in Sledgehammer
2013-01-31, by blanchet
eliminated needless speed optimization -- and simplified code quite a bit
2013-01-31, by blanchet
distinguish raw and non-raw facts, using raw for 10 000s of facts and non-raw after selection of some hundreds
2013-01-31, by blanchet
report (MeSh, MePo, MaSh) triple, to be able to use different filters in different slices
2013-01-31, by blanchet
remove unnecessary assumption from real_normed_vector
2013-01-31, by hoelzl
adapted to new MaSh interface
2013-01-31, by blanchet
use order topology for extended reals
2013-01-31, by hoelzl
introduce order topology
2013-01-31, by hoelzl
simplify heine_borel type class
2013-01-31, by hoelzl
compute proper weight for "p proves p" in MaSh
2013-01-31, by blanchet
restore code equations for List.set in RBT_Set; make Scala happy according to 7.1 in the code generator manual
2013-01-15, by kuncar
tuned
2013-01-25, by nipkow
back to post-release mode -- after fork point;
2013-01-20, by wenzelm
updated for release;
2013-01-20, by wenzelm
merged
2013-01-20, by wenzelm
misc tuning for release;
2013-01-20, by wenzelm
tuned;
2013-01-20, by wenzelm
accomodate scala-2.9.2;
2013-01-20, by wenzelm
afford parallel proof terms;
2013-01-19, by wenzelm
always close derivation at the bottom of forked proofs (despite increased non-determinism of proof terms) -- improve parallel performance by avoiding dynamic dependency within large Isar proofs, e.g. Slicing/JinjaVM/SemanticsWF.thy in AFP/bf9b14cbc707;
2013-01-19, by wenzelm
simplified proofs
2013-01-19, by nipkow
tuning
2013-01-19, by blanchet
misc cleanup;
2013-01-19, by wenzelm
tuned signature;
2013-01-19, by wenzelm
use inlined session name as title for charts;
2013-01-18, by wenzelm
tuned signature;
2013-01-18, by wenzelm
charts for future task runtime statistics;
2013-01-18, by wenzelm
merged
2013-01-18, by wenzelm
more uniform permissions;
2013-01-18, by wenzelm
more generous C stack size as in Linux and Mac OS X, to reduce chance of Cygwin-specific crashes;
2013-01-18, by wenzelm
tuned proof -- much faster;
2013-01-18, by wenzelm
more systematic task statistics;
2013-01-18, by wenzelm
added "tasks_proof" statistics, via slighly odd global reference Future.forked_proofs (NB: Future.report_status is intertwined with scheduler thread);
2013-01-18, by wenzelm
generalized diameter from real_normed_vector to metric_space
2013-01-18, by hoelzl
tuned proof
2013-01-18, by hoelzl
tune prove compact_eq_totally_bounded
2013-01-18, by hoelzl
generalized theorem edelstein_fix to class metric_space
2013-01-17, by huffman
tuning
2013-01-18, by blanchet
pass correct index to "Sign.typ_unify" -- this is important to avoid what appears to be an infinite loop in the unifier
2013-01-18, by blanchet
optimization -- evaluate conversion to table only once
2013-01-18, by blanchet
MeSh prover generation
2013-01-17, by blanchet
use correct weights in MeSh driver
2013-01-17, by blanchet
use precomputed MaSh/MePo data whenever available
2013-01-17, by blanchet
merged
2013-01-17, by wenzelm
merged
2013-01-17, by wenzelm
copy Cygwin-Latex-Setup.bat;
2013-01-17, by wenzelm
more formal Cygwin-Latex-Setup (excluding bulky texlive-collection-fontsextra, which would be required for eulervm.sty);
2013-01-17, by wenzelm
updated to cygwin-20130117;
2013-01-17, by wenzelm
proper permissions;
2013-01-17, by wenzelm
tuned;
2013-01-17, by wenzelm
updated to jdk-7u11;
2013-01-17, by wenzelm
simplify proof of compact_imp_bounded
2013-01-17, by huffman
added step to skip some queries
2013-01-17, by blanchet
provide a means to skip a method
2013-01-17, by blanchet
evaluate more cases (cf. paper)
2013-01-17, by blanchet
updated MaSh
2013-01-17, by blanchet
make SPASS more configurable, for experiments
2013-01-17, by blanchet
generalize more topology lemmas
2013-01-15, by huffman
generalize topology lemmas; simplify proofs
2013-01-15, by huffman
merged
2013-01-17, by wenzelm
tuned signature (again) -- keep Properties more generic;
2013-01-17, by wenzelm
tuned proofs;
2013-01-17, by wenzelm
simplified prove of compact_imp_bounded
2013-01-17, by hoelzl
use accumulation point characterization (avoids t1_space restriction for equivalence of countable and sequential compactness); remove heine_borel_lemma
2013-01-17, by hoelzl
move auxiliary lemma to top
2013-01-17, by hoelzl
add countable compacteness; replace finite_range_imp_infinite_repeats by pigeonhole_infinite
2013-01-17, by hoelzl
group compactness-eq-seq-compactness lemmas together
2013-01-17, by hoelzl
replace convergent_imp_cauchy by LIMSEQ_imp_Cauchy
2013-01-17, by hoelzl
tuned
2013-01-17, by hoelzl
removed subseq_bigger (replaced by seq_suble)
2013-01-17, by hoelzl
countablility of finite subsets and rational numbers
2013-01-17, by hoelzl
generalize compact_path_image to topological_space
2013-01-17, by hoelzl
re-generated components.sha1;
2013-01-17, by wenzelm
merged
2013-01-17, by wenzelm
more system-independent order of components.sha1 to keep changes monotonic;
2013-01-17, by wenzelm
clarified Future.error_msg: slightly more robust id check, actually suppress displaced messages;
2013-01-17, by wenzelm
delay to give users a chance to see what was happening, even with auto_close enabled;
2013-01-17, by wenzelm
updated docs
2013-01-17, by blanchet
updated component again, as there was an issue with hard-coded paths in "runepar.pl"
2013-01-17, by blanchet
added E-Par support
2013-01-17, by blanchet
updated E component
2013-01-17, by blanchet
tweaked defaults
2013-01-17, by blanchet
changed type of preplay time; tuned preplaying
2013-01-17, by smolkas
move preplaying to own structure
2013-01-17, by smolkas
register SHA1 for Haskabelle-2013 component
2013-01-17, by noschinl
register Haskabelle as a component
2013-01-17, by noschinl
merged
2013-01-16, by wenzelm
tuned proofs;
2013-01-16, by wenzelm
tuned proofs;
2013-01-16, by wenzelm
tuned signature;
2013-01-16, by wenzelm
proper runtime position (cf. fe4714886d92 and Toplevel.error_msg) -- to make error messages actually appear in the document;
2013-01-16, by wenzelm
close tooltip after Active.action, to make it look more interactive (notably due to lack of dynamic update);
2013-01-16, by wenzelm
identify future results more carefully, to avoid odd duplication of error messages, notably from forked goals;
2013-01-16, by wenzelm