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.
Thu, 13 Apr 1995 11:44:37 +0200 New root file
lcp [Thu, 13 Apr 1995 11:44:37 +0200] rev 1040
New root file
Thu, 13 Apr 1995 11:43:01 +0200 Redefined OUnion in a definitional manner
lcp [Thu, 13 Apr 1995 11:43:01 +0200] rev 1039
Redefined OUnion in a definitional manner
Thu, 13 Apr 1995 11:41:34 +0200 Redefined OUnion in a definitional manner, and proved the
lcp [Thu, 13 Apr 1995 11:41:34 +0200] rev 1038
Redefined OUnion in a definitional manner, and proved the rules again. Deleted the rules OUnionI/E as they were not needed. Proved OUN_cong. Extended OrdQuant_ss with oex_cong and defined Ord_atomize to extract rewrite rules from ALL x<i... assumptions.
Thu, 13 Apr 1995 11:40:07 +0200 Deleted lt_oadd_disj1
lcp [Thu, 13 Apr 1995 11:40:07 +0200] rev 1037
Deleted lt_oadd_disj1
Thu, 13 Apr 1995 11:38:48 +0200 Recoded function atomize so that new ways of creating
lcp [Thu, 13 Apr 1995 11:38:48 +0200] rev 1036
Recoded function atomize so that new ways of creating simplification rules can be added easily.
Thu, 13 Apr 1995 11:37:39 +0200 Proved Int_Diff_eq.
lcp [Thu, 13 Apr 1995 11:37:39 +0200] rev 1035
Proved Int_Diff_eq.
Thu, 13 Apr 1995 11:35:24 +0200 fixed typo
lcp [Thu, 13 Apr 1995 11:35:24 +0200] rev 1034
fixed typo
Thu, 13 Apr 1995 11:33:57 +0200 Defined ordinal difference, --
lcp [Thu, 13 Apr 1995 11:33:57 +0200] rev 1033
Defined ordinal difference, --
Thu, 13 Apr 1995 11:32:44 +0200 Proved odiff_oadd_inverse, oadd_lt_cancel2, oadd_lt_iff2,
lcp [Thu, 13 Apr 1995 11:32:44 +0200] rev 1032
Proved odiff_oadd_inverse, oadd_lt_cancel2, oadd_lt_iff2, odiff_lt_mono2. Deleted duplicate copy of oadd_le_mono.
Thu, 13 Apr 1995 11:30:57 +0200 Proved lesspoll_succ_iff.
lcp [Thu, 13 Apr 1995 11:30:57 +0200] rev 1031
Proved lesspoll_succ_iff.
Thu, 13 Apr 1995 10:20:55 +0200 Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow [Thu, 13 Apr 1995 10:20:55 +0200] rev 1030
Completely rewrote split_tac. The old one failed in strange circumstances.
Wed, 12 Apr 1995 13:53:34 +0200 term.ML: add_loose_bnos now returns a list w/o duplicates.
nipkow [Wed, 12 Apr 1995 13:53:34 +0200] rev 1029
term.ML: add_loose_bnos now returns a list w/o duplicates. pattern.ML: replaced null(loose_bnos t) by loose_bvar(t,0)
Tue, 11 Apr 1995 12:01:11 +0200 Added comment to function "loops".
nipkow [Tue, 11 Apr 1995 12:01:11 +0200] rev 1028
Added comment to function "loops".
Tue, 11 Apr 1995 11:20:43 +0200 (binder "Q" p) generates Binder("Q",p,p); it used to be Binder("Q",0,p).
nipkow [Tue, 11 Apr 1995 11:20:43 +0200] rev 1027
(binder "Q" p) generates Binder("Q",p,p); it used to be Binder("Q",0,p).
Mon, 10 Apr 1995 08:49:00 +0200 ROOT.ML: Removed the "exit 1" calls, since now the Makefile does them.
nipkow [Mon, 10 Apr 1995 08:49:00 +0200] rev 1026
ROOT.ML: Removed the "exit 1" calls, since now the Makefile does them. MT.thy: Deleted extra space in clos_mk.
Mon, 10 Apr 1995 08:47:43 +0200 Removed the "exit 1" calls, since now the Makefile does them.
nipkow [Mon, 10 Apr 1995 08:47:43 +0200] rev 1025
Removed the "exit 1" calls, since now the Makefile does them.
Mon, 10 Apr 1995 08:40:58 +0200 ROOT.ML: installed new hyp_subst_tac
nipkow [Mon, 10 Apr 1995 08:40:58 +0200] rev 1024
ROOT.ML: installed new hyp_subst_tac Nat.ML: Changed proof of lessE for new hyp_subst_tac
Mon, 10 Apr 1995 08:13:13 +0200 Fixed bug in the simplifier: added uses of maxidx_of_term to make sure that
nipkow [Mon, 10 Apr 1995 08:13:13 +0200] rev 1023
Fixed bug in the simplifier: added uses of maxidx_of_term to make sure that the maxidx-filed of thms is computed correctly.
Fri, 07 Apr 1995 10:12:01 +0200 Local version of (original) hypsubst: needs no simplifier
lcp [Fri, 07 Apr 1995 10:12:01 +0200] rev 1022
Local version of (original) hypsubst: needs no simplifier
Thu, 06 Apr 1995 12:24:56 +0200 Modified proofs for new hyp_subst_tac.
lcp [Thu, 06 Apr 1995 12:24:56 +0200] rev 1021
Modified proofs for new hyp_subst_tac.
(0) -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 +3000 +10000 +30000 tip