Thu, 13 Apr 1995 16:55:14 +0200 ABP: Alternating bit protocol example
nipkow [Thu, 13 Apr 1995 16:55:14 +0200] rev 1050
ABP: Alternating bit protocol example
Thu, 13 Apr 1995 16:53:15 +0200 New ROOT file.
nipkow [Thu, 13 Apr 1995 16:53:15 +0200] rev 1049
New ROOT file.
Thu, 13 Apr 1995 15:38:07 +0200 New example by Ole Rasmussen
lcp [Thu, 13 Apr 1995 15:38:07 +0200] rev 1048
New example by Ole Rasmussen
Thu, 13 Apr 1995 15:13:27 +0200 Simplified some proofs and made them work for new hyp_subst_tac.
lcp [Thu, 13 Apr 1995 15:13:27 +0200] rev 1047
Simplified some proofs and made them work for new hyp_subst_tac.
Thu, 13 Apr 1995 15:08:39 +0200 expandshort
lcp [Thu, 13 Apr 1995 15:08:39 +0200] rev 1046
expandshort
Thu, 13 Apr 1995 15:06:25 +0200 Deleted some useless things and made proofs of
lcp [Thu, 13 Apr 1995 15:06:25 +0200] rev 1045
Deleted some useless things and made proofs of refl_comp_subset and comp_equivI more like the versions in ZF/EquivClass.ML
Thu, 13 Apr 1995 15:03:07 +0200 Simplified using pattern replacements.
lcp [Thu, 13 Apr 1995 15:03:07 +0200] rev 1044
Simplified using pattern replacements.
Thu, 13 Apr 1995 14:25:45 +0200 adjusted HOLCF for new hyp_subst_tac
regensbu [Thu, 13 Apr 1995 14:25:45 +0200] rev 1043
adjusted HOLCF for new hyp_subst_tac
Thu, 13 Apr 1995 14:18:22 +0200 Defined vv1 using let. Introduced gg1, gg2.
lcp [Thu, 13 Apr 1995 14:18:22 +0200] rev 1042
Defined vv1 using let. Introduced gg1, gg2.
Thu, 13 Apr 1995 14:15:36 +0200 Deleted subset_imp_Un_Diff_eq, as it is identical to
lcp [Thu, 13 Apr 1995 14:15:36 +0200] rev 1041
Deleted subset_imp_Un_Diff_eq, as it is identical to Diff_partition. Used split_tac (sometimes via simplifier) to apply expand_if. Replaced lt_oadd_disj1 by lt_oadd_odiff_disj, using ordinal difference instead of a description. Removed the outer quantifier from all_sum_lepoll_m, all_sum_lepoll_m_2. Changed all "lesspoll succ(m)" to "lepoll m" and simplified proofs. Changed definitions of vv1 and ww1 to use lepoll instead of lesspoll; therefore vv1(f,b,succ(m)) becomes vv1(f,b,m). Moved proof of vv1_not_0 into the body of the proof using this result. Renamed variable aa to s. Simplified lemma_iv using addss. Renamed some theorems; combined some proofs.
(0) -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip