Thu, 22 May 1997 15:11:56 +0200 Now the recdef induction rule variables are named u, v, ...
paulson [Thu, 22 May 1997 15:11:56 +0200] rev 3301
Now the recdef induction rule variables are named u, v, ...
Thu, 22 May 1997 15:11:23 +0200 New example of recdef and permutative rewriting
paulson [Thu, 22 May 1997 15:11:23 +0200] rev 3300
New example of recdef and permutative rewriting
Thu, 22 May 1997 15:10:59 +0200 Now uses type option instead of Fail/Subst
paulson [Thu, 22 May 1997 15:10:59 +0200] rev 3299
Now uses type option instead of Fail/Subst No references to wf_rel_prod
Thu, 22 May 1997 15:10:37 +0200 Now uses type option instead of Fail/Subst
paulson [Thu, 22 May 1997 15:10:37 +0200] rev 3298
Now uses type option instead of Fail/Subst
Thu, 22 May 1997 15:10:05 +0200 Uses option_case_tac
paulson [Thu, 22 May 1997 15:10:05 +0200] rev 3297
Uses option_case_tac
Thu, 22 May 1997 15:09:37 +0200 Deleted rprod: lex_prod is (usually?) enough
paulson [Thu, 22 May 1997 15:09:37 +0200] rev 3296
Deleted rprod: lex_prod is (usually?) enough
Thu, 22 May 1997 15:09:09 +0200 Deleted obsolete proofs. But option_case_tac will be obsolete too
paulson [Thu, 22 May 1997 15:09:09 +0200] rev 3295
Deleted obsolete proofs. But option_case_tac will be obsolete too
(0) -3000 -1000 -300 -100 -30 -10 -7 +7 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip