Thu, 08 Dec 1994 13:53:28 +0100 lcp le_imp_lepoll: renamed to Card_le_imp_lepoll
Thu, 08 Dec 1994 13:38:13 +0100 lcp Card_cardinal_le: new
Thu, 08 Dec 1994 12:46:25 +0100 clasohm changed Pure's grammar and the way types are converted to nonterminals
Thu, 08 Dec 1994 12:45:28 +0100 clasohm replaced type_syn by pure_syn in Pure signature
Thu, 08 Dec 1994 11:28:34 +0100 lcp test_assume_tac: now tries eq_assume_tac on exceptional cases
Thu, 08 Dec 1994 11:26:25 +0100 lcp res_inst_tac: added comments
Wed, 07 Dec 1994 13:12:04 +0100 clasohm added qed and qed_goal[w]
Wed, 07 Dec 1994 12:34:47 +0100 clasohm moved first call of store_theory from thy_read.ML to created .thy.ML file
Tue, 06 Dec 1994 12:50:13 +0100 clasohm added bind_thm
Wed, 30 Nov 1994 13:53:46 +0100 clasohm added qed and qed_goal[w]
Wed, 30 Nov 1994 13:18:42 +0100 clasohm added qed_goal for meta_iffD
Wed, 30 Nov 1994 13:13:52 +0100 clasohm replaced "val ... = result()" by "qed ..."
Tue, 29 Nov 1994 11:51:07 +0100 lcp le_UN_Ord_lt_csucc: added comment
Tue, 29 Nov 1994 00:31:31 +0100 lcp replaced "rules" by "defs"
Mon, 28 Nov 1994 19:48:30 +0100 regensbu ----------------------------------------------------------------------
Fri, 25 Nov 1994 11:13:55 +0100 lcp ZF/indrule/mutual_ind_tac: ensured that asm_full_simp_tac ignores any
Fri, 25 Nov 1994 11:08:12 +0100 lcp checks that the recursive sets are Consts before taking
Fri, 25 Nov 1994 11:04:44 +0100 lcp equiv_comp_eq: simplified proof
Fri, 25 Nov 1994 11:02:39 +0100 lcp moved Cantors theorem here from ZF/ex/misc
Fri, 25 Nov 1994 10:43:50 +0100 lcp deepen_tac: modified due to outcome of experiments. Its
Fri, 25 Nov 1994 09:13:49 +0100 clasohm added qed_goal[w]
Fri, 25 Nov 1994 00:02:37 +0100 lcp added blank line
Fri, 25 Nov 1994 00:01:04 +0100 lcp tidied proofs, using fast_tac etc. as much as possible
Fri, 25 Nov 1994 00:00:35 +0100 lcp prove_fun: new; no longer depends upon the version in simpdata.ML
Thu, 24 Nov 1994 10:57:24 +0100 lcp data_domain,Codata_domain: removed replicate; now return one
Thu, 24 Nov 1994 10:53:46 +0100 lcp tidied proofs, using fast_tac etc. as much as possible
Thu, 24 Nov 1994 10:47:45 +0100 lcp added comments on alternative uses of type_intrs/elims
Thu, 24 Nov 1994 10:38:08 +0100 lcp modified for new treatment of mutual recursion
Thu, 24 Nov 1994 10:31:47 +0100 lcp the_equality: more careful use of addSIs and addIs
Thu, 24 Nov 1994 10:23:41 +0100 lcp cons_fun_eq: modified strange uses of classical reasoner
Thu, 24 Nov 1994 00:33:13 +0100 lcp moved Cantors theorem to ZF/ZF.ML and ZF/Perm.ML
Thu, 24 Nov 1994 00:32:43 +0100 lcp moved version of Cantors theorem to ZF/Perm.ML
Thu, 24 Nov 1994 00:32:12 +0100 lcp ZF INDUCTIVE DEFINITIONS: Simplifying the type checking for mutually
Thu, 24 Nov 1994 00:31:41 +0100 lcp ZF/Datatype/datatype_decl: supplies a SINGLE domain for the mutually
Thu, 24 Nov 1994 00:31:08 +0100 lcp updated for new deepen_tac
Thu, 24 Nov 1994 00:30:35 +0100 lcp trivial changes
Wed, 23 Nov 1994 11:45:56 +0100 lcp new reference to HO patterns
Tue, 22 Nov 1994 23:32:16 +0100 lcp Pure/tctical/protect_subgoal: simplified to use Sequence.hd
Tue, 22 Nov 1994 23:30:49 +0100 lcp Pure/term: commented typ_subst_TVars, subst_TVars, subst_Vars, subst_vars
Mon, 21 Nov 1994 18:48:03 +0100 lcp ZF INDUCTIVE DEFINITIONS: Simplifying the type checking for mutually
Mon, 21 Nov 1994 15:53:02 +0100 lcp ZF/intr_elim/elim: now "folds" definitions of the mutually recursive sets!
Mon, 21 Nov 1994 14:11:21 +0100 clasohm replaced 'val ... = result();' by 'qed "...";'
Mon, 21 Nov 1994 14:06:59 +0100 lcp ZF/indrule/mutual_ind_tac: backtracks using DEPTH_SOLVE to be certain of
Mon, 21 Nov 1994 13:47:00 +0100 lcp ZF/EquivClass/congruent_commuteI: uncommented and simplified proof
Mon, 21 Nov 1994 13:09:41 +0100 lcp ZF/ZF.ML/UN_iff, INT_iff: added to the signature
Mon, 21 Nov 1994 11:49:36 +0100 lcp Pure/thm/norm_term_skip: new, for skipping normalization of the context
Mon, 21 Nov 1994 11:33:23 +0100 lcp Pure/sequence: added comment explaining that memoing sequences were found
Mon, 21 Nov 1994 11:27:10 +0100 lcp Pure/envir/norm_term: replaced equality test for [] by null
Mon, 21 Nov 1994 10:51:40 +0100 lcp page 157 erratum
Mon, 21 Nov 1994 10:39:32 +0100 lcp now searches all subdirectories of object-logics
Fri, 18 Nov 1994 13:14:23 +0100 nipkow Chnaged simplifier description (lhss)
Fri, 18 Nov 1994 13:08:10 +0100 clasohm added call of store_theory after thy file has been read
Fri, 18 Nov 1994 13:04:51 +0100 nipkow Updated description of valid lhss.
Thu, 17 Nov 1994 22:01:08 +0100 lcp In ZF, type i has class term, not (just) logic
Mon, 14 Nov 1994 14:47:20 +0100 clasohm added check for newlines not enclosed by '\' inside strings
Mon, 14 Nov 1994 14:29:20 +0100 clasohm updated remarks about grammar; added section about ambiguities
Mon, 14 Nov 1994 11:57:32 +0100 wenzelm exported 'cat';
Mon, 14 Nov 1994 10:49:39 +0100 lcp Pure/tctical/select: now uses cprems_of instead of prems_of and cterm_of:
Mon, 14 Nov 1994 10:46:50 +0100 lcp Pure/drule/cprems_of, cskip_flexpairs, cstrip_imp_prems: new cterm operations
Mon, 14 Nov 1994 10:41:25 +0100 lcp Added month for Coens thesis
Fri, 11 Nov 1994 10:53:41 +0100 lcp removal of FOL_dup_cs
Fri, 11 Nov 1994 10:50:49 +0100 lcp removal of HOL_dup_cs
Fri, 11 Nov 1994 10:42:55 +0100 lcp Provers/hypsubst/REPEATN: deleted; using REPEAT_DETERM_N instead.
Fri, 11 Nov 1994 10:41:09 +0100 lcp Pure/tctical/REPEAT_DETERM_N,REPEAT_DETERM1,REPEAT_DETERM_FIRST,
Fri, 11 Nov 1994 10:33:05 +0100 lcp FOL/intprover/safe_tac: now uses REPEAT_DETERM_FIRST instead of REPEAT_DETERM
Fri, 11 Nov 1994 10:31:51 +0100 lcp argument swaps in HOL
Thu, 10 Nov 1994 11:36:40 +0100 lcp HOL,ZF/Makefile: enclosed multiple "use" calls in parentheses. This
Thu, 10 Nov 1994 11:06:44 +0100 lcp updated pathnames
Wed, 09 Nov 1994 15:47:11 +0100 lcp updated discussion of congruence rules in first section
Wed, 09 Nov 1994 13:50:59 +0100 clasohm changed warning for extremely ambiguous expressions
Thu, 03 Nov 1994 16:52:19 +0100 lcp Pure/goals/prepare_proof/mkresult: now smashes flexflex pairs in the final
Thu, 03 Nov 1994 16:39:41 +0100 lcp ZF/ex/Ramsey,Rmap,misc.ML: modified for new definition of Pi(A,B)
Thu, 03 Nov 1994 16:05:22 +0100 lcp ZF/ex/Ramsey,Rmap,misc.ML: modified for new definition of Pi(A,B)
Thu, 03 Nov 1994 13:42:39 +0100 lcp ZF/Perm/inj_converse_fun: tidied; removed uses of PiI/E
Thu, 03 Nov 1994 12:43:42 +0100 lcp ZF/InfDatatype/fun_Vcsucc: removed use of PiE
Thu, 03 Nov 1994 12:39:39 +0100 lcp ZF/func: tidied many proofs, using new definition of Pi(A,B)
Thu, 03 Nov 1994 12:35:41 +0100 lcp ZF: NEW DEFINITION OF PI(A,B)
Thu, 03 Nov 1994 12:30:55 +0100 lcp ZF/Fixedpt/subset_cs: moved to ZF/subset.ML
Thu, 03 Nov 1994 12:26:59 +0100 lcp ZF/Fixedpt/subset0_cs: moved to ZF/ZF.ML
Thu, 03 Nov 1994 12:23:19 +0100 lcp ZF/domrange/converse_iff: new
Thu, 03 Nov 1994 12:06:37 +0100 lcp ZF/upair/theI2: new
Thu, 03 Nov 1994 11:58:16 +0100 lcp ZF/equalities/domain_converse,range_converse,
Thu, 03 Nov 1994 11:52:04 +0100 lcp ZF/Fixedpt/subset0_cs: moved to ZF/ZF.ML
Thu, 03 Nov 1994 11:45:41 +0100 lcp Cardinal_AC/surj_implies_inj: uses Pi_memberD instead of memberPiE
Thu, 03 Nov 1994 08:34:53 +0100 clasohm added warning message
Wed, 02 Nov 1994 12:48:22 +0100 lcp Provers/classical: now takes theorem "classical" as argument, proves "swap"
Wed, 02 Nov 1994 12:44:03 +0100 lcp Provers/hypsubst: greatly simplified! No longer simulates a
Wed, 02 Nov 1994 10:45:14 +0100 lcp Pure/sign/infer_types/exn_type_msg: new, for more uniform handling of
Wed, 02 Nov 1994 09:09:30 +0100 nipkow Modified pattern.ML to perform proper matching of Higher-Order Patterns.
Tue, 01 Nov 1994 10:40:10 +0100 lcp FOL/FOL/swap: deleted
Tue, 01 Nov 1994 10:32:18 +0100 lcp HOLCF/Ssum3.ML: changed res_inst_tac [("P"... to res_inst_tac [("Pa" in
Mon, 31 Oct 1994 18:15:24 +0100 lcp ZF/ZF.thy: added precedences to @RepFun to disambiguate phrases like {x:A.x:B}
Mon, 31 Oct 1994 18:11:12 +0100 lcp ZF/domrange/image_subset: tidied
Mon, 31 Oct 1994 18:09:32 +0100 lcp ZF/upair/mem_asym,succ_inject: tidied
Mon, 31 Oct 1994 18:07:29 +0100 lcp com1,2: added simplifier calls to remove use of ssubst in fast_tac
Mon, 31 Oct 1994 18:03:14 +0100 lcp Pure/tctical/THEN_ELSE: new
Mon, 31 Oct 1994 18:01:02 +0100 lcp Pure/tactic/build_netpair: now takes two arguments
Mon, 31 Oct 1994 17:59:49 +0100 lcp Pure/sequence/hd,tl: new
Mon, 31 Oct 1994 17:55:43 +0100 lcp Pure/drule/thin_rl: new
Mon, 31 Oct 1994 17:14:42 +0100 lcp FOL/ex/ROOT: now loads mini.ML
Mon, 31 Oct 1994 17:09:10 +0100 lcp FOL/ROOT/FOL_dup_cs: removed as obsolete
Mon, 31 Oct 1994 16:45:19 +0100 lcp FOL/ex/cla: proofs now use deepen_tac instead of best_tac FOL_dup_cs
Mon, 31 Oct 1994 16:39:20 +0100 lcp ZF/ZF/ex1_functional: moved to FOL/ROOT
Mon, 31 Oct 1994 15:49:58 +0100 lcp Miniscope conversoin; example of formula rewriting
Mon, 31 Oct 1994 15:45:54 +0100 lcp ZF/OrderArith/thin: deleted as obsolete
Mon, 31 Oct 1994 15:41:20 +0100 lcp added final newline
Mon, 31 Oct 1994 15:35:43 +0100 lcp added header files; deleted commented-out code
Fri, 28 Oct 1994 10:13:16 +0100 nipkow Prepared the code for preservation of bound var names during rewriting. Still
Wed, 26 Oct 1994 17:41:40 +0100 nipkow removed superfluous type_intrs in datatype com.
Wed, 26 Oct 1994 15:20:55 +0100 nipkow simplified syntax of infix continuous functiuons
Tue, 25 Oct 1994 13:16:49 +0100 wenzelm strip_quotes now exported;
Tue, 25 Oct 1994 13:15:34 +0100 wenzelm minor change of occs_const in dest_defn;
Tue, 25 Oct 1994 13:13:52 +0100 wenzelm added require_thy;
Mon, 24 Oct 1994 10:34:28 +0100 lcp HOL,ZF/IMP/Com.thy: tightening precedences to eliminate syntactic ambiguities.
Fri, 21 Oct 1994 09:58:05 +0100 lcp ZF/intr_elim/elim_rls: now includes Pair_inject, since coinductive
Fri, 21 Oct 1994 09:53:38 +0100 lcp Pure/Unify/IMPROVING "CLEANING" OF FLEX-FLEX PAIRS: Old code would refuse
Fri, 21 Oct 1994 09:51:01 +0100 lcp LK/hardquant/37: deleted call to flexflex_tac: no longer needed
Fri, 21 Oct 1994 09:47:02 +0100 lcp LCF/LCF.thy: the constant VOID had mixfix syntax "()" !! Added quotes.
Fri, 21 Oct 1994 09:35:24 +0100 lcp FOLP/IFOLP.thy: tightening precedences to eliminate syntactic ambiguities.
Wed, 19 Oct 1994 09:54:38 +0100 lcp ZF/Fixedpt/coinduct: modified proof to suppress deep unification
(0) -120 +120 +1000 +3000 +10000 +30000 tip