Mon, 18 Feb 2013 12:16:27 +0100 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: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
Mon, 18 Feb 2013 12:16:02 +0100 simplified byline, isar_qualifier
smolkas [Mon, 18 Feb 2013 12:16:02 +0100] rev 51178
simplified byline, isar_qualifier
Mon, 18 Feb 2013 11:33:43 +0100 tuned code: factored out parent computation
blanchet [Mon, 18 Feb 2013 11:33:43 +0100] rev 51177
tuned code: factored out parent computation
Mon, 18 Feb 2013 10:43:36 +0100 tuned code
blanchet [Mon, 18 Feb 2013 10:43:36 +0100] rev 51176
tuned code
Mon, 18 Feb 2013 08:52:23 +0100 simplify definition as sort constraints ensure finiteness (thanks to Jesus Aransay)
Andreas Lochbihler [Mon, 18 Feb 2013 08:52:23 +0100] rev 51175
simplify definition as sort constraints ensure finiteness (thanks to Jesus Aransay)
Sun, 17 Feb 2013 22:56:54 +0100 fundamentals about discrete logarithm and square root
haftmann [Sun, 17 Feb 2013 22:56:54 +0100] rev 51174
fundamentals about discrete logarithm and square root
Sun, 17 Feb 2013 21:29:30 +0100 Sieve of Eratosthenes
haftmann [Sun, 17 Feb 2013 21:29:30 +0100] rev 51173
Sieve of Eratosthenes
Sun, 17 Feb 2013 20:45:49 +0100 note on parallel computation
haftmann [Sun, 17 Feb 2013 20:45:49 +0100] rev 51172
note on parallel computation
Sun, 17 Feb 2013 19:39:00 +0100 corrected and clarified Code_Binary_Nat vs. Code_Target_Nat
haftmann [Sun, 17 Feb 2013 19:39:00 +0100] rev 51171
corrected and clarified Code_Binary_Nat vs. Code_Target_Nat
Sun, 17 Feb 2013 11:34:40 +0100 simplified construction of upto_aux
haftmann [Sun, 17 Feb 2013 11:34:40 +0100] rev 51170
simplified construction of upto_aux
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 tip