Thu, 22 Feb 2001 11:47:35 +0100 removed unused function
kleing [Thu, 22 Feb 2001 11:47:35 +0100] rev 11177
removed unused function
Thu, 22 Feb 2001 11:31:31 +0100 a PROPER tidy-up
paulson [Thu, 22 Feb 2001 11:31:31 +0100] rev 11176
a PROPER tidy-up
Thu, 22 Feb 2001 10:18:41 +0100 recoded function iter with the help of the while-combinator.
nipkow [Thu, 22 Feb 2001 10:18:41 +0100] rev 11175
recoded function iter with the help of the while-combinator.
Wed, 21 Feb 2001 15:21:15 +0100 revisions in response to comments by Tobias
paulson [Wed, 21 Feb 2001 15:21:15 +0100] rev 11174
revisions in response to comments by Tobias
Wed, 21 Feb 2001 12:57:55 +0100 revisions in response to comments by Tobias
paulson [Wed, 21 Feb 2001 12:57:55 +0100] rev 11173
revisions in response to comments by Tobias
Wed, 21 Feb 2001 12:07:00 +0100 added split_conv_tac (also to claset()) as an optimization
oheimb [Wed, 21 Feb 2001 12:07:00 +0100] rev 11172
added split_conv_tac (also to claset()) as an optimization
Tue, 20 Feb 2001 18:53:28 +0100 made split_all_tac safe introducing safe_full_simp_tac, EXISTING PROOFS MAY FAIL
oheimb [Tue, 20 Feb 2001 18:53:28 +0100] rev 11171
made split_all_tac safe introducing safe_full_simp_tac, EXISTING PROOFS MAY FAIL
Tue, 20 Feb 2001 18:48:34 +0100 simplified proofs for splitI and splitD, added splitD'
oheimb [Tue, 20 Feb 2001 18:48:34 +0100] rev 11170
simplified proofs for splitI and splitD, added splitD' added split_conv_tac (also to claset()) as an optimization made split_all_tac safe introducing safe_full_simp_tac,EXISTING PROOFS MAY FAIL
(0) -10000 -3000 -1000 -300 -100 -30 -10 -8 +8 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip