Wed, 17 May 2000 17:16:21 +0200 export generic_simp_tac;
wenzelm [Wed, 17 May 2000 17:16:21 +0200] rev 8879
export generic_simp_tac;
Tue, 16 May 2000 14:07:49 +0200 changed to cope with the rewriting of #2+n to Suc(Suc n)
paulson [Tue, 16 May 2000 14:07:49 +0200] rev 8878
changed to cope with the rewriting of #2+n to Suc(Suc n)
Tue, 16 May 2000 14:07:06 +0200 new policy to simplify the use of numerals:
paulson [Tue, 16 May 2000 14:07:06 +0200] rev 8877
new policy to simplify the use of numerals: #0 -> 0 #1 -> 1 #2 + n -> Suc (Suc n) similarly for n + #2
Tue, 16 May 2000 14:04:29 +0200 reverted to old proof of dominoes_tile_row, given new treatment of #2+...
paulson [Tue, 16 May 2000 14:04:29 +0200] rev 8876
reverted to old proof of dominoes_tile_row, given new treatment of #2+...
Mon, 15 May 2000 17:34:05 +0200 Replaced some definitions involving epsilon by more readable primrec
berghofe [Mon, 15 May 2000 17:34:05 +0200] rev 8875
Replaced some definitions involving epsilon by more readable primrec definitions.
Mon, 15 May 2000 17:32:39 +0200 alist_rec and assoc are now defined using primrec and thus no longer
berghofe [Mon, 15 May 2000 17:32:39 +0200] rev 8874
alist_rec and assoc are now defined using primrec and thus no longer refer to the recursion combinator list_rec, which should be considered internal.
Mon, 15 May 2000 17:30:19 +0200 Removed unnecessary primrec equations of hd and last involving arbitrary.
berghofe [Mon, 15 May 2000 17:30:19 +0200] rev 8873
Removed unnecessary primrec equations of hd and last involving arbitrary.
Mon, 15 May 2000 10:34:51 +0200 collected three proofs into rename_client_map_tac
paulson [Mon, 15 May 2000 10:34:51 +0200] rev 8872
collected three proofs into rename_client_map_tac
Mon, 15 May 2000 10:33:32 +0200 added the dummy theory Integ/NatSimprocs.thy
paulson [Mon, 15 May 2000 10:33:32 +0200] rev 8871
added the dummy theory Integ/NatSimprocs.thy
Fri, 12 May 2000 15:21:58 +0200 updated
paulson [Fri, 12 May 2000 15:21:58 +0200] rev 8870
updated
(0) -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip