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
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
Tue, 19 Feb 2013 15:03:36 +0100 kuncar delete also predicates on relations when hiding an implementation of an abstract type
Tue, 19 Feb 2013 13:37:07 +0100 blanchet reintroduced crucial sorting accidentally lost in 962190eab40d
Tue, 19 Feb 2013 13:27:33 +0100 blanchet compile
Tue, 19 Feb 2013 13:21:49 +0100 blanchet provide two modes for MaSh driver: linearized or real visibility
Mon, 18 Feb 2013 18:34:55 +0100 blanchet implement (more) accurate computation of parents
Mon, 18 Feb 2013 18:34:54 +0100 blanchet tuning
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
Mon, 18 Feb 2013 12:16:02 +0100 smolkas simplified byline, isar_qualifier
Mon, 18 Feb 2013 11:33:43 +0100 blanchet tuned code: factored out parent computation
Mon, 18 Feb 2013 10:43:36 +0100 blanchet tuned code
Mon, 18 Feb 2013 08:52:23 +0100 Andreas Lochbihler simplify definition as sort constraints ensure finiteness (thanks to Jesus Aransay)
Sun, 17 Feb 2013 22:56:54 +0100 haftmann fundamentals about discrete logarithm and square root
Sun, 17 Feb 2013 21:29:30 +0100 haftmann Sieve of Eratosthenes
(0) -30000 -10000 -3000 -1000 -300 -100 -15 +15 +100 +300 +1000 +3000 +10000 +30000 tip