lcp [Fri, 25 Nov 1994 00:00:35 +0100] rev 743
prove_fun: new; no longer depends upon the version in simpdata.ML
lcp [Thu, 24 Nov 1994 10:57:24 +0100] rev 742
data_domain,Codata_domain: removed replicate; now return one
single domain
lcp [Thu, 24 Nov 1994 10:53:46 +0100] rev 741
tidied proofs, using fast_tac etc. as much as possible
lcp [Thu, 24 Nov 1994 10:47:45 +0100] rev 740
added comments on alternative uses of type_intrs/elims
lcp [Thu, 24 Nov 1994 10:38:08 +0100] rev 739
modified for new treatment of mutual recursion
lcp [Thu, 24 Nov 1994 10:31:47 +0100] rev 738
the_equality: more careful use of addSIs and addIs
lcp [Thu, 24 Nov 1994 10:23:41 +0100] rev 737
cons_fun_eq: modified strange uses of classical reasoner
lcp [Thu, 24 Nov 1994 00:33:13 +0100] rev 736
moved Cantors theorem to ZF/ZF.ML and ZF/Perm.ML
hom_tac: removed to simplify the proof of comp_homs
lcp [Thu, 24 Nov 1994 00:32:43 +0100] rev 735
moved version of Cantors theorem to ZF/Perm.ML
lcp [Thu, 24 Nov 1994 00:32:12 +0100] rev 734
ZF INDUCTIVE DEFINITIONS: Simplifying the type checking for mutually
recursive datatypes, especially with monotone operators
Inductive_Fun,CoInductive_Fun: deleted as obsolete
inductive_decl: now reads a SINGLE domain for the mutually
recursive construction. This could be a sum, perhaps not! CONCRETE SYNTAX
has changed too (but there are no examples of this to change).
lcp [Thu, 24 Nov 1994 00:31:41 +0100] rev 733
ZF/Datatype/datatype_decl: supplies a SINGLE domain for the mutually
recursive construction. This is [q]univ(A), which is closed under sum.
lcp [Thu, 24 Nov 1994 00:31:08 +0100] rev 732
updated for new deepen_tac
lcp [Thu, 24 Nov 1994 00:30:35 +0100] rev 731
trivial changes
lcp [Wed, 23 Nov 1994 11:45:56 +0100] rev 730
new reference to HO patterns
lcp [Tue, 22 Nov 1994 23:32:16 +0100] rev 729
Pure/tctical/protect_subgoal: simplified to use Sequence.hd
Pure/tctical/DEPTH_FIRST: now suppresses duplicate solutions
lcp [Tue, 22 Nov 1994 23:30:49 +0100] rev 728
Pure/term: commented typ_subst_TVars, subst_TVars, subst_Vars, subst_vars
lcp [Mon, 21 Nov 1994 18:48:03 +0100] rev 727
ZF INDUCTIVE DEFINITIONS: Simplifying the type checking for mutually
recursive datatypes, especially with monotone operators
ZF/add_ind_def/add_fp_def: deleted as obsolete
ZF/add_ind_def/add_fp_def_i: now takes dom_sum instead of domts. We no
longer automatically construct a sum of separate domains, but could use a
sum-closed set such as univ(A).
lcp [Mon, 21 Nov 1994 15:53:02 +0100] rev 726
ZF/intr_elim/elim: now "folds" definitions of the mutually recursive sets!
clasohm [Mon, 21 Nov 1994 14:11:21 +0100] rev 725
replaced 'val ... = result();' by 'qed "...";'
lcp [Mon, 21 Nov 1994 14:06:59 +0100] rev 724
ZF/indrule/mutual_ind_tac: backtracks using DEPTH_SOLVE to be certain of
solving the subgoal. Entire tactic is enclosed in DETERM to prevent
backtracking between subgoals.
lcp [Mon, 21 Nov 1994 13:47:00 +0100] rev 723
ZF/EquivClass/congruent_commuteI: uncommented and simplified proof
lcp [Mon, 21 Nov 1994 13:09:41 +0100] rev 722
ZF/ZF.ML/UN_iff, INT_iff: added to the signature
lcp [Mon, 21 Nov 1994 11:49:36 +0100] rev 721
Pure/thm/norm_term_skip: new, for skipping normalization of the context
Pure/thm/bicompose_aux: now computes nlift (number of lifted assumptions in
new subgoals) and avoids normalizing the first nlift assumptions in the
case where the proof state is not affected.
Pure/thm/norm_term_skip: now normalizes types of parameters
Pure/thm/THM: aligned colons
lcp [Mon, 21 Nov 1994 11:33:23 +0100] rev 720
Pure/sequence: added comment explaining that memoing sequences were found
to be much slower (due to overheads) than the sequences currently used.