Fri, 02 May 2014 13:52:45 +0200 more frugal access to theory text via Reader, reduced costs for I/O text decoding;
wenzelm [Fri, 02 May 2014 13:52:45 +0200] rev 56823
more frugal access to theory text via Reader, reduced costs for I/O text decoding; prefer non-strict Symbol.decode, since Reader[Char] may present symbols in either way;
Fri, 02 May 2014 12:27:40 +0200 support URLs as well;
wenzelm [Fri, 02 May 2014 12:27:40 +0200] rev 56822
support URLs as well;
Fri, 02 May 2014 12:09:02 +0200 reclaimed Byte_Reader from 51560e392e1b;
wenzelm [Fri, 02 May 2014 12:09:02 +0200] rev 56821
reclaimed Byte_Reader from 51560e392e1b;
Fri, 02 May 2014 07:54:23 +0200 new documentation: How to Prove it
nipkow [Fri, 02 May 2014 07:54:23 +0200] rev 56820
new documentation: How to Prove it
Thu, 01 May 2014 23:04:07 +0200 disable bad Z3 proof
boehmes [Thu, 01 May 2014 23:04:07 +0200] rev 56819
disable bad Z3 proof
Thu, 01 May 2014 22:57:38 +0200 use SMT2 for Boogie examples
boehmes [Thu, 01 May 2014 22:57:38 +0200] rev 56818
use SMT2 for Boogie examples
Thu, 01 May 2014 22:57:36 +0200 less verbose SAT tactic
boehmes [Thu, 01 May 2014 22:57:36 +0200] rev 56817
less verbose SAT tactic
Thu, 01 May 2014 22:57:34 +0200 use internal proof-producing SAT solver for more efficient SMT proof replay
boehmes [Thu, 01 May 2014 22:57:34 +0200] rev 56816
use internal proof-producing SAT solver for more efficient SMT proof replay
Thu, 01 May 2014 22:56:59 +0200 added internal proof-producing SAT solver
boehmes [Thu, 01 May 2014 22:56:59 +0200] rev 56815
added internal proof-producing SAT solver
Thu, 01 May 2014 22:41:03 +0200 tuned output;
wenzelm [Thu, 01 May 2014 22:41:03 +0200] rev 56814
tuned output;
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 tip