Mercurial
Mercurial
>
repos
>
isabelle
/ graph
summary
|
shortlog
|
changelog
| graph |
tags
|
bookmarks
|
branches
|
files
|
gz
|
help
less
more
|
(0)
-30000
-10000
-3000
-1000
-300
-100
-50
-30
+30
+50
+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.
honor linearization option also in the evaluation driver
2013-02-20, by blanchet
got rid of rump support for Vampire definitions
2013-02-20, by blanchet
optimize Isar output some more
2013-02-20, by blanchet
turn off more evil Vampire options to facilitate Isar proof generation
2013-02-20, by blanchet
fixed typo in option name
2013-02-20, by blanchet
tuning
2013-02-20, by blanchet
use new skolemizer only if some skolems have two or more arguments -- otherwise the old skolemizer cannot get the arg order wrong
2013-02-20, by blanchet
slacker comparison for Skolems, to avoid trivial equations
2013-02-20, by blanchet
auto-minimizer should respect "isar_proofs = true"
2013-02-20, by blanchet
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
2013-02-20, by blanchet
alias for people like me
2013-02-20, by blanchet
dropped spurious left-over from 0a2371e7ced3
2013-02-19, by haftmann
avoid using "smt" for minimization -- better use the prover itself, since then Sledgehammer gets to try metis again and gives the opportunity to output an Isar proof -- and show Isar proof as fallback for SMT proofs
2013-02-19, by blanchet
interpret "max_facts" argument in a slice-dependent fashion, instead of forcing the same number of facts to all slices
2013-02-19, by blanchet
delete also predicates on relations when hiding an implementation of an abstract type
2013-02-19, by kuncar
reintroduced crucial sorting accidentally lost in 962190eab40d
2013-02-19, by blanchet
compile
2013-02-19, by blanchet
provide two modes for MaSh driver: linearized or real visibility
2013-02-19, by blanchet
implement (more) accurate computation of parents
2013-02-18, by blanchet
tuning
2013-02-18, by blanchet
split isar_step into isar_step, fix, assms; made isar_proof explicit; register fixed variables in ctxt and auto_fix terms to avoid superfluous annotations
2013-02-18, by smolkas
simplified byline, isar_qualifier
2013-02-18, by smolkas
tuned code: factored out parent computation
2013-02-18, by blanchet
tuned code
2013-02-18, by blanchet
simplify definition as sort constraints ensure finiteness (thanks to Jesus Aransay)
2013-02-18, by Andreas Lochbihler
fundamentals about discrete logarithm and square root
2013-02-17, by haftmann
Sieve of Eratosthenes
2013-02-17, by haftmann
note on parallel computation
2013-02-17, by haftmann
corrected and clarified Code_Binary_Nat vs. Code_Target_Nat
2013-02-17, by haftmann
simplified construction of upto_aux
2013-02-17, by haftmann
less
more
|
(0)
-30000
-10000
-3000
-1000
-300
-100
-50
-30
+30
+50
+100
+300
+1000
+3000
+10000
+30000
tip