isabelle: Graph

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 tip

merged 'reconstructors' and 'proof methods'
2014-02-03, by blanchet
added 'smt' as a proof method
2014-02-03, by blanchet
when merging, don't try methods that failed or timed out for either of the steps for the combined step
2014-02-03, by blanchet
tuning
2014-02-03, by blanchet
refactor relabeling code
2014-02-03, by blanchet
tuned data structure
2014-02-03, by blanchet
tuned data structure
2014-02-03, by blanchet
more flexible compression, choosing whichever proof method works
2014-02-03, by blanchet
reduced preplaying timeout, since (1) Isar proofs are getting better and better as alternatives; (2) the same timeout is used for each step in an Isar proof, where a lower timeout makes more sense
2014-02-03, by blanchet
made SML/NJ happier
2014-02-03, by blanchet
less aggressive evaluation
2014-02-03, by blanchet
added a new version of 'metis' to the mix
2014-02-03, by blanchet
implemented new 'try0_isar' semantics
2014-02-03, by blanchet
tuning
2014-02-03, by blanchet
better time slack, to account for ultra-quick proof methods
2014-02-03, by blanchet
crucial fix: use right version of the step
2014-02-03, by blanchet
more thorough, hybrid compression
2014-02-03, by blanchet
tuning
2014-02-03, by blanchet
got rid of 'try0' step that is now redundant
2014-02-03, by blanchet
centralize more preplaying
2014-02-03, by blanchet
tuning
2014-02-03, by blanchet
centralize preplaying
2014-02-03, by blanchet
tuned
2014-02-03, by blanchet
fixed indentation
2014-02-03, by paulson
new lemmas involving phi from Lehmer AFP entry
2014-02-02, by paulson
more data structure rationalization
2014-02-02, by blanchet
tuning
2014-02-02, by blanchet
more data structure rationalization
2014-02-02, by blanchet
rationalized threading of 'metis' arguments
2014-02-02, by blanchet
refactored data structure (step 3)
2014-02-02, by blanchet
refactoring of data structure (step 2)
2014-02-02, by blanchet
'primitive' is not an adverb
2014-02-02, by blanchet
unform treatment of preplay_timeout = 0 and > 0
2014-02-02, by blanchet
refactor data structure (step 1)
2014-02-02, by blanchet
tuned code
2014-02-02, by blanchet
tuned factor
2014-02-02, by blanchet
tuning
2014-02-02, by blanchet
made SML/NJ happier
2014-02-02, by blanchet
take intersection rather than union of methods when merging steps -- more efficient and natural
2014-02-02, by blanchet
merge proof methods
2014-02-02, by blanchet
use Skolem proof methods appropriately
2014-02-02, by blanchet
simplified data structure -- eliminated distinction between 'first-class' and 'second-class' proof methods
2014-02-02, by blanchet
reset timing information after changes
2014-02-02, by blanchet
Number_Theory: prime is no longer overloaded, but only for nat. Automatic coercion to int enabled.
2014-02-02, by paulson
merged
2014-02-01, by wenzelm
proper config options;
2014-02-01, by wenzelm
more standard file/module names;
2014-02-01, by wenzelm
Added material from Old_Number_Theory related to the Chinese Remainder Theorem
2014-02-01, by paulson
prefer top-down rewriting for output (i.e. uncheck), in accordance to term abbreviations (see 5d2fe4e09354) and AST translations;
2014-02-01, by wenzelm
proper context for printing;
2014-02-01, by wenzelm
more explicit low-level exception;
2014-02-01, by wenzelm
unused;
2014-02-01, by wenzelm
method_setup "lem";
2014-02-01, by wenzelm
lazy_pack is default context for ILL;
2014-02-01, by wenzelm
unused;
2014-02-01, by wenzelm
proper Simplifier method setup;
2014-02-01, by wenzelm
simplified sessions;
2014-02-01, by wenzelm
misc tuning and modernization;
2014-02-01, by wenzelm
version of Fermat's Theorem for type nat
2014-02-01, by paulson
merged
2014-01-31, by wenzelm

less more | (0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 tip

isabelle