Thu, 16 Oct 1997 14:14:01 +0200 Simplified proof.
nipkow [Thu, 16 Oct 1997 14:14:01 +0200] rev 3898
Simplified proof.
Thu, 16 Oct 1997 14:12:58 +0200 Simplified proof because of better simplifier.
nipkow [Thu, 16 Oct 1997 14:12:58 +0200] rev 3897
Simplified proof because of better simplifier.
Thu, 16 Oct 1997 14:12:15 +0200 Various new lemmas. Improved conversion of equations to rewrite rules:
nipkow [Thu, 16 Oct 1997 14:12:15 +0200] rev 3896
Various new lemmas. Improved conversion of equations to rewrite rules: (s=t becomes (s=t)==True if s=t loops).
Thu, 16 Oct 1997 14:00:20 +0200 added transfer: theory -> thm -> thm;
wenzelm [Thu, 16 Oct 1997 14:00:20 +0200] rev 3895
added transfer: theory -> thm -> thm;
Thu, 16 Oct 1997 13:45:27 +0200 oops;
wenzelm [Thu, 16 Oct 1997 13:45:27 +0200] rev 3894
oops;
Thu, 16 Oct 1997 13:45:16 +0200 The simplifier has been improved a little: equations s=t which used to be
nipkow [Thu, 16 Oct 1997 13:45:16 +0200] rev 3893
The simplifier has been improved a little: equations s=t which used to be rejected because of looping are now treated as (s=t) == True. The latter translation must be done outside of Thm because it involves the object-logic specific True. Therefore the simple loop test has been moved from Thm to Logic.
Thu, 16 Oct 1997 13:43:42 +0200 fixed dependencies;
wenzelm [Thu, 16 Oct 1997 13:43:42 +0200] rev 3892
fixed dependencies;
(0) -3000 -1000 -300 -100 -30 -10 -7 +7 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip