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.
Thu, 06 Apr 1995 12:22:26 +0200 Modified proofs for new hyp_subst_tac, and simplified them.
lcp [Thu, 06 Apr 1995 12:22:26 +0200] rev 1020
Modified proofs for new hyp_subst_tac, and simplified them.
Thu, 06 Apr 1995 12:20:48 +0200 Received some local definitions from AC_Equiv.thy.
lcp [Thu, 06 Apr 1995 12:20:48 +0200] rev 1019
Received some local definitions from AC_Equiv.thy.
Thu, 06 Apr 1995 12:19:34 +0200 Moved some local definitions to WO6_WO1.ML
lcp [Thu, 06 Apr 1995 12:19:34 +0200] rev 1018
Moved some local definitions to WO6_WO1.ML
Thu, 06 Apr 1995 12:17:40 +0200 Proved if_iff and used it to simplify proof of if_type.
lcp [Thu, 06 Apr 1995 12:17:40 +0200] rev 1017
Proved if_iff and used it to simplify proof of if_type.
Thu, 06 Apr 1995 12:15:27 +0200 Now the classical sets include UN_E, to avoid calling hyp_subst_tac
lcp [Thu, 06 Apr 1995 12:15:27 +0200] rev 1016
Now the classical sets include UN_E, to avoid calling hyp_subst_tac
Thu, 06 Apr 1995 12:11:05 +0200 Changed proof of domain_ord_iso_map_subset for new hyp_subst_tac
lcp [Thu, 06 Apr 1995 12:11:05 +0200] rev 1015
Changed proof of domain_ord_iso_map_subset for new hyp_subst_tac
Thu, 06 Apr 1995 12:08:43 +0200 Added Id: line
lcp [Thu, 06 Apr 1995 12:08:43 +0200] rev 1014
Added Id: line
Thu, 06 Apr 1995 12:06:09 +0200 Deleted call to flexflex_tac
lcp [Thu, 06 Apr 1995 12:06:09 +0200] rev 1013
Deleted call to flexflex_tac
Thu, 06 Apr 1995 12:03:01 +0200 Added Id: line
lcp [Thu, 06 Apr 1995 12:03:01 +0200] rev 1012
Added Id: line
Thu, 06 Apr 1995 11:59:34 +0200 Recoded with help from Toby to use rewriting instead of the
lcp [Thu, 06 Apr 1995 11:59:34 +0200] rev 1011
Recoded with help from Toby to use rewriting instead of the subst rule -- the latter was too slow. But it must resort to the subst rule if the equality contains Vars.
(0) -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 +3000 +10000 +30000 tip