clasohm [Wed, 07 Dec 1994 13:12:04 +0100] rev 760
added qed and qed_goal[w]
clasohm [Wed, 07 Dec 1994 12:34:47 +0100] rev 759
moved first call of store_theory from thy_read.ML to created .thy.ML file
clasohm [Tue, 06 Dec 1994 12:50:13 +0100] rev 758
added bind_thm
clasohm [Wed, 30 Nov 1994 13:53:46 +0100] rev 757
added qed and qed_goal[w]
clasohm [Wed, 30 Nov 1994 13:18:42 +0100] rev 756
added qed_goal for meta_iffD
clasohm [Wed, 30 Nov 1994 13:13:52 +0100] rev 755
replaced "val ... = result()" by "qed ..."
lcp [Tue, 29 Nov 1994 11:51:07 +0100] rev 754
le_UN_Ord_lt_csucc: added comment
lcp [Tue, 29 Nov 1994 00:31:31 +0100] rev 753
replaced "rules" by "defs"
regensbu [Mon, 28 Nov 1994 19:48:30 +0100] rev 752
----------------------------------------------------------------------
Committing in HOLCF
Use new translation mechanism and keyword syntax, cinfix.ML no
longer needed.
Optimized proofs in Cont.ML
Modified Files:
Cfun1.ML Cfun2.thy Cont.ML Cprod3.thy Makefile README
Sprod3.thy Tr2.thy ccc1.thy
----------------------------------------------------------------------
lcp [Fri, 25 Nov 1994 11:13:55 +0100] rev 751
ZF/indrule/mutual_ind_tac: ensured that asm_full_simp_tac ignores any
equalities, by adding setmksimps K[].
ZF/indrule/mut_ss: removed Collect_cong; it is redundant.
lcp [Fri, 25 Nov 1994 11:08:12 +0100] rev 750
checks that the recursive sets are Consts before taking
them apart! Bug was introduced during the translation to theory sections.
lcp [Fri, 25 Nov 1994 11:04:44 +0100] rev 749
equiv_comp_eq: simplified proof
lcp [Fri, 25 Nov 1994 11:02:39 +0100] rev 748
moved Cantors theorem here from ZF/ex/misc
lcp [Fri, 25 Nov 1994 10:43:50 +0100] rev 747
deepen_tac: modified due to outcome of experiments. Its
choice of unsafe rule to expand is still non-deterministic.
clasohm [Fri, 25 Nov 1994 09:13:49 +0100] rev 746
added qed_goal[w]
lcp [Fri, 25 Nov 1994 00:02:37 +0100] rev 745
added blank line
lcp [Fri, 25 Nov 1994 00:01:04 +0100] rev 744
tidied proofs, using fast_tac etc. as much as possible
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