Fri, 29 Aug 2014 14:36:51 +0200 generate 'disc_transfer' for (co)datatypes
desharna [Fri, 29 Aug 2014 14:36:51 +0200] rev 58095
generate 'disc_transfer' for (co)datatypes
Fri, 29 Aug 2014 14:21:25 +0200 document 'case_transfer'
desharna [Fri, 29 Aug 2014 14:21:25 +0200] rev 58094
document 'case_transfer'
Fri, 29 Aug 2014 14:21:24 +0200 generate 'case_transfer' for (co)datatypes
desharna [Fri, 29 Aug 2014 14:21:24 +0200] rev 58093
generate 'case_transfer' for (co)datatypes
Thu, 28 Aug 2014 23:57:26 +0200 renamed 'skolem' to 'moura' (to suggest Z3-style skolemization); reintroduced 'fastforce' to the mix of tested proof methods
blanchet [Thu, 28 Aug 2014 23:57:26 +0200] rev 58092
renamed 'skolem' to 'moura' (to suggest Z3-style skolemization); reintroduced 'fastforce' to the mix of tested proof methods
Thu, 28 Aug 2014 23:48:46 +0200 reworked unskolemization for SPASS
blanchet [Thu, 28 Aug 2014 23:48:46 +0200] rev 58091
reworked unskolemization for SPASS
Thu, 28 Aug 2014 20:06:59 +0200 clarified docs
blanchet [Thu, 28 Aug 2014 20:06:59 +0200] rev 58090
clarified docs
Thu, 28 Aug 2014 20:05:39 +0200 gracefully reconstruct Isar proofs in scenarios such as 'using f unfolding g', where backticks can't be used to refer to the unfolded version of 'f' (for some reason)
blanchet [Thu, 28 Aug 2014 20:05:39 +0200] rev 58089
gracefully reconstruct Isar proofs in scenarios such as 'using f unfolding g', where backticks can't be used to refer to the unfolded version of 'f' (for some reason)
Thu, 28 Aug 2014 19:07:10 +0200 prefer '0.2 ms' to '249 \<mu>s'
blanchet [Thu, 28 Aug 2014 19:07:10 +0200] rev 58088
prefer '0.2 ms' to '249 \<mu>s'
Thu, 28 Aug 2014 19:02:37 +0200 use 'thesis' only if it expands to the right thing (it won't after an 'unfolding', for example)
blanchet [Thu, 28 Aug 2014 19:02:37 +0200] rev 58087
use 'thesis' only if it expands to the right thing (it won't after an 'unfolding', for example)
Thu, 28 Aug 2014 17:25:56 +0200 fixed second computations
blanchet [Thu, 28 Aug 2014 17:25:56 +0200] rev 58086
fixed second computations
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 tip