lcp [Tue, 21 Dec 1993 13:58:12 +0100] rev 198
new section for equality properties
nipkow [Tue, 14 Dec 1993 14:02:52 +0100] rev 197
Updated read_insts to approximate simultaneous type checking of substitution
pairs.
lcp [Mon, 13 Dec 1993 18:50:03 +0100] rev 196
added isabelle-users paragraph
lcp [Mon, 13 Dec 1993 18:48:47 +0100] rev 195
added mention of simplifier, splitter, hypsubst
lcp [Mon, 13 Dec 1993 18:18:34 +0100] rev 194
new year
nipkow [Fri, 10 Dec 1993 13:46:38 +0100] rev 193
updated instantiate to deal with type clashes
lcp [Fri, 10 Dec 1993 10:39:12 +0100] rev 192
ZF/equalities/SUM_eq_UN: new
ZF/equalities: corrected bound variable anomalies in some distributive laws
lcp [Fri, 10 Dec 1993 10:36:39 +0100] rev 191
Pure/tactic/compose_inst_tac: when catching exception THM, prints the
message before failing!! This reports the reason for failure in cases like
by (res_inst_tac [("P", "?Q(a)")] mp 1);
in which ?Q appears in mp with a different type.
nipkow [Thu, 09 Dec 1993 11:39:33 +0100] rev 190
deleted harmful basify, which pulled rewrite rules down to base type.
Not needed for new simplifier.
nipkow [Mon, 06 Dec 1993 17:05:10 +0100] rev 189
added rep_tsig
nipkow [Mon, 06 Dec 1993 13:35:38 +0100] rev 188
last minute changes, eg literal tokens -> delimiters and valued tokens ->
names.
lcp [Mon, 06 Dec 1993 10:57:22 +0100] rev 187
ZF/univ/in_Vfrom_limit: new
ZF/univ/sum_in_Vfrom, etc: streamlined proofs using in_Vfrom_limit
lcp [Mon, 06 Dec 1993 10:55:48 +0100] rev 186
ZF/ord/Ord_Un,Ord_Int,Un_upper1_le,Un_upper2_le: new
nipkow [Mon, 06 Dec 1993 09:35:35 +0100] rev 185
Typos and style
lcp [Fri, 03 Dec 1993 17:45:19 +0100] rev 184
Changed Acknowledgements
lcp [Fri, 03 Dec 1993 17:43:49 +0100] rev 183
Acknowledged Carsten Clasohm
lcp [Fri, 03 Dec 1993 12:47:45 +0100] rev 182
New distributive laws for Sigma and UN
lcp [Thu, 02 Dec 1993 12:49:03 +0100] rev 181
removal of amssymbols.sty and lcp.sty; addition of iman.sty
lcp [Wed, 01 Dec 1993 17:40:27 +0100] rev 180
ZF/ex/ROOT: changed many time_use calls to time_use_thy or else deleted
them, to make the most of the load-path mechanism. (use_thy adds the new
theory to the list of loaded theories.)
lcp [Wed, 01 Dec 1993 13:00:04 +0100] rev 179
minor corrections
lcp [Wed, 01 Dec 1993 12:48:47 +0100] rev 178
new references
lcp [Wed, 01 Dec 1993 12:45:49 +0100] rev 177
now inspects FOLP_build_completed
lcp [Wed, 01 Dec 1993 12:41:25 +0100] rev 176
now declares FOLP_build_completed
wenzelm [Tue, 30 Nov 1993 15:31:07 +0100] rev 175
*** empty log message ***
wenzelm [Tue, 30 Nov 1993 12:12:18 +0100] rev 174
*** empty log message ***
lcp [Tue, 30 Nov 1993 11:08:18 +0100] rev 173
ZF/ex/llist_eq/lleq_Int_Vset_subset_lemma,
ZF/ex/counit/counit2_Int_Vset_subset_lemma: now uses QPair_Int_Vset_subset_UN
ZF/ex/llistfn/flip_llist_quniv_lemma: now uses transfinite induction and
QPair_Int_Vset_subset_UN
ZF/ex/llist/llist_quniv_lemma: now uses transfinite induction and
QPair_Int_Vset_subset_UN
wenzelm [Tue, 30 Nov 1993 11:07:57 +0100] rev 172
changed split_filename, remove_ext;
added base_name;
wenzelm [Tue, 30 Nov 1993 11:04:07 +0100] rev 171
*** empty log message ***
lcp [Tue, 30 Nov 1993 10:55:43 +0100] rev 170
ZF/quniv/QPair_Int_Vset_subset_UN: new, isolates key argument of many
coinduction proofs
ZF/quniv: deleted the following obsolete theorems (saved on Isa/old):
Int_Vfrom_0_in_quniv Pair_in_quniv_D QInl_Int_Vfrom_succ_in_quniv
QInl_Int_quniv_in_quniv QPair_Int_Vfrom_in_quniv
QPair_Int_Vfrom_succ_in_quniv QPair_Int_quniv_eq QPair_Int_quniv_in_quniv
QPair_Int_quniv_in_quniv product_Int_quniv_eq quniv_Int_Vfrom
zero_Int_in_quniv
wenzelm [Mon, 29 Nov 1993 13:54:59 +0100] rev 169
extend: cleaned up, adapted for new Syntax.extend;
extend, merge: improved roots (logical_types) handling;