blanchet [Wed, 20 Feb 2013 08:44:24 +0100] rev 51192
slacker comparison for Skolems, to avoid trivial equations
blanchet [Wed, 20 Feb 2013 08:44:24 +0100] rev 51191
auto-minimizer should respect "isar_proofs = true"
blanchet [Wed, 20 Feb 2013 08:44:24 +0100] rev 51190
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
blanchet [Wed, 20 Feb 2013 08:44:24 +0100] rev 51189
alias for people like me
haftmann [Tue, 19 Feb 2013 19:44:10 +0100] rev 51188
dropped spurious left-over from 0a2371e7ced3
blanchet [Tue, 19 Feb 2013 17:01:06 +0100] rev 51187
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
blanchet [Tue, 19 Feb 2013 15:37:42 +0100] rev 51186
interpret "max_facts" argument in a slice-dependent fashion, instead of forcing the same number of facts to all slices
kuncar [Tue, 19 Feb 2013 15:03:36 +0100] rev 51185
delete also predicates on relations when hiding an implementation of an abstract type
blanchet [Tue, 19 Feb 2013 13:37:07 +0100] rev 51184
reintroduced crucial sorting accidentally lost in 962190eab40d
blanchet [Tue, 19 Feb 2013 13:27:33 +0100] rev 51183
compile
blanchet [Tue, 19 Feb 2013 13:21:49 +0100] rev 51182
provide two modes for MaSh driver: linearized or real visibility
blanchet [Mon, 18 Feb 2013 18:34:55 +0100] rev 51181
implement (more) accurate computation of parents
blanchet [Mon, 18 Feb 2013 18:34:54 +0100] rev 51180
tuning
smolkas [Mon, 18 Feb 2013 12:16:27 +0100] rev 51179
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
smolkas [Mon, 18 Feb 2013 12:16:02 +0100] rev 51178
simplified byline, isar_qualifier
blanchet [Mon, 18 Feb 2013 11:33:43 +0100] rev 51177
tuned code: factored out parent computation
blanchet [Mon, 18 Feb 2013 10:43:36 +0100] rev 51176
tuned code
Andreas Lochbihler [Mon, 18 Feb 2013 08:52:23 +0100] rev 51175
simplify definition as sort constraints ensure finiteness (thanks to Jesus Aransay)
haftmann [Sun, 17 Feb 2013 22:56:54 +0100] rev 51174
fundamentals about discrete logarithm and square root
haftmann [Sun, 17 Feb 2013 21:29:30 +0100] rev 51173
Sieve of Eratosthenes
haftmann [Sun, 17 Feb 2013 20:45:49 +0100] rev 51172
note on parallel computation
haftmann [Sun, 17 Feb 2013 19:39:00 +0100] rev 51171
corrected and clarified Code_Binary_Nat vs. Code_Target_Nat
haftmann [Sun, 17 Feb 2013 11:34:40 +0100] rev 51170
simplified construction of upto_aux
haftmann [Sun, 17 Feb 2013 11:06:10 +0100] rev 51169
merged
haftmann [Sat, 16 Feb 2013 08:21:08 +0100] rev 51168
restored proper order of NEWS entries (lost due too long-waiting patches)
haftmann [Sun, 17 Feb 2013 10:40:53 +0100] rev 51167
CONTRIBUTORS
nipkow [Sat, 16 Feb 2013 15:27:10 +0100] rev 51166
tail recursive code for function "upto"
blanchet [Fri, 15 Feb 2013 16:53:39 +0100] rev 51165
tuning
blanchet [Fri, 15 Feb 2013 16:40:39 +0100] rev 51164
repaired collateral damage from 4f0147ed8bcb
traytel [Fri, 15 Feb 2013 16:17:05 +0100] rev 51163
Backed out changeset: 3fe7242f8346,
many proofs (e.g. in Extended_Real and Approximation) rely on coercions not being lifted over sets