| Tue, 19 Feb 2013 19:44:10 +0100 |
haftmann |
dropped spurious left-over from 0a2371e7ced3
|
changeset |
files
|
| Tue, 19 Feb 2013 17:01:06 +0100 |
blanchet |
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
|
changeset |
files
|
| Tue, 19 Feb 2013 15:37:42 +0100 |
blanchet |
interpret "max_facts" argument in a slice-dependent fashion, instead of forcing the same number of facts to all slices
|
changeset |
files
|
| Tue, 19 Feb 2013 15:03:36 +0100 |
kuncar |
delete also predicates on relations when hiding an implementation of an abstract type
|
changeset |
files
|
| Tue, 19 Feb 2013 13:37:07 +0100 |
blanchet |
reintroduced crucial sorting accidentally lost in 962190eab40d
|
changeset |
files
|
| Tue, 19 Feb 2013 13:27:33 +0100 |
blanchet |
compile
|
changeset |
files
|
| Tue, 19 Feb 2013 13:21:49 +0100 |
blanchet |
provide two modes for MaSh driver: linearized or real visibility
|
changeset |
files
|
| Mon, 18 Feb 2013 18:34:55 +0100 |
blanchet |
implement (more) accurate computation of parents
|
changeset |
files
|
| Mon, 18 Feb 2013 18:34:54 +0100 |
blanchet |
tuning
|
changeset |
files
|
| Mon, 18 Feb 2013 12:16:27 +0100 |
smolkas |
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
|
changeset |
files
|
| Mon, 18 Feb 2013 12:16:02 +0100 |
smolkas |
simplified byline, isar_qualifier
|
changeset |
files
|
| Mon, 18 Feb 2013 11:33:43 +0100 |
blanchet |
tuned code: factored out parent computation
|
changeset |
files
|
| Mon, 18 Feb 2013 10:43:36 +0100 |
blanchet |
tuned code
|
changeset |
files
|
| Mon, 18 Feb 2013 08:52:23 +0100 |
Andreas Lochbihler |
simplify definition as sort constraints ensure finiteness (thanks to Jesus Aransay)
|
changeset |
files
|
| Sun, 17 Feb 2013 22:56:54 +0100 |
haftmann |
fundamentals about discrete logarithm and square root
|
changeset |
files
|
| Sun, 17 Feb 2013 21:29:30 +0100 |
haftmann |
Sieve of Eratosthenes
|
changeset |
files
|
| Sun, 17 Feb 2013 20:45:49 +0100 |
haftmann |
note on parallel computation
|
changeset |
files
|
| Sun, 17 Feb 2013 19:39:00 +0100 |
haftmann |
corrected and clarified Code_Binary_Nat vs. Code_Target_Nat
|
changeset |
files
|
| Sun, 17 Feb 2013 11:34:40 +0100 |
haftmann |
simplified construction of upto_aux
|
changeset |
files
|
| Sun, 17 Feb 2013 11:06:10 +0100 |
haftmann |
merged
|
changeset |
files
|
| Sat, 16 Feb 2013 08:21:08 +0100 |
haftmann |
restored proper order of NEWS entries (lost due too long-waiting patches)
|
changeset |
files
|
| Sun, 17 Feb 2013 10:40:53 +0100 |
haftmann |
CONTRIBUTORS
|
changeset |
files
|
| Sat, 16 Feb 2013 15:27:10 +0100 |
nipkow |
tail recursive code for function "upto"
|
changeset |
files
|
| Fri, 15 Feb 2013 16:53:39 +0100 |
blanchet |
tuning
|
changeset |
files
|
| Fri, 15 Feb 2013 16:40:39 +0100 |
blanchet |
repaired collateral damage from 4f0147ed8bcb
|
changeset |
files
|
| Fri, 15 Feb 2013 16:17:05 +0100 |
traytel |
Backed out changeset: 3fe7242f8346,
|
changeset |
files
|
| Fri, 15 Feb 2013 12:48:20 +0100 |
haftmann |
dropped now obsolete hint;
|
changeset |
files
|
| Fri, 15 Feb 2013 11:47:34 +0100 |
haftmann |
attempt to re-establish conventions which theories are loaded into the grand unified library theory;
|
changeset |
files
|
| Fri, 15 Feb 2013 11:47:33 +0100 |
haftmann |
systematic conversions between nat and nibble/char;
|
changeset |
files
|
| Fri, 15 Feb 2013 15:22:16 +0100 |
traytel |
coercions between base types can be lifted to sets
|
changeset |
files
|