Wed, 03 Sep 2014 22:47:05 +0200 fixed tactic for n-way mutual recursion, n >= 4 (balanced conjunctions confuse the tactic)
blanchet [Wed, 03 Sep 2014 22:47:05 +0200] rev 58170
fixed tactic for n-way mutual recursion, n >= 4 (balanced conjunctions confuse the tactic)
Wed, 03 Sep 2014 22:47:05 +0200 reintroduced more examples
blanchet [Wed, 03 Sep 2014 22:47:05 +0200] rev 58169
reintroduced more examples
Wed, 03 Sep 2014 22:47:05 +0200 improved tactic further
blanchet [Wed, 03 Sep 2014 22:47:05 +0200] rev 58168
improved tactic further
Wed, 03 Sep 2014 22:47:05 +0200 reenabled example
blanchet [Wed, 03 Sep 2014 22:47:05 +0200] rev 58167
reenabled example
Wed, 03 Sep 2014 22:47:05 +0200 improved new countability tactic
blanchet [Wed, 03 Sep 2014 22:47:05 +0200] rev 58166
improved new countability tactic
Wed, 03 Sep 2014 22:47:05 +0200 'prove_sorry' is too dangerous here -- the tactic is sometimes applied to non-theorems
blanchet [Wed, 03 Sep 2014 22:47:05 +0200] rev 58165
'prove_sorry' is too dangerous here -- the tactic is sometimes applied to non-theorems
Wed, 03 Sep 2014 22:47:05 +0200 more robust exception handling
blanchet [Wed, 03 Sep 2014 22:47:05 +0200] rev 58164
more robust exception handling
Wed, 03 Sep 2014 22:46:54 +0200 added tests for new 'countable_datatype' proof method
blanchet [Wed, 03 Sep 2014 22:46:54 +0200] rev 58163
added tests for new 'countable_datatype' proof method
Wed, 03 Sep 2014 12:30:25 +0200 lessen the burden on the caller: sort where necessary in n2m
traytel [Wed, 03 Sep 2014 12:30:25 +0200] rev 58162
lessen the burden on the caller: sort where necessary in n2m
Wed, 03 Sep 2014 09:43:00 +0200 added compatibility function
blanchet [Wed, 03 Sep 2014 09:43:00 +0200] rev 58161
added compatibility function
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 tip