lcp [Thu, 03 Nov 1994 12:35:41 +0100] rev 690
ZF: NEW DEFINITION OF PI(A,B)
Was Pi(A,B) == {f: Pow(Sigma(A,B)). ALL x:A. EX! y. <x,y>: f}
Now function(r) == ALL x y. <x,y>:r --> (ALL y'. <x,y'>:r --> y=y')
Pi(A,B) == {f: Pow(Sigma(A,B)). A<=domain(f) & function(f)}"
This simplifies many proofs, since (a) the top-level definition has fewer
bound variables (b) the "total" and "function" properties are separated
(c) the awkward EX! quantifier is eliminated.
ZF/ZF.thy/function: new definition
lcp [Thu, 03 Nov 1994 12:30:55 +0100] rev 689
ZF/Fixedpt/subset_cs: moved to ZF/subset.ML
lcp [Thu, 03 Nov 1994 12:26:59 +0100] rev 688
ZF/Fixedpt/subset0_cs: moved to ZF/ZF.ML
lcp [Thu, 03 Nov 1994 12:23:19 +0100] rev 687
ZF/domrange/converse_iff: new
lcp [Thu, 03 Nov 1994 12:06:37 +0100] rev 686
ZF/upair/theI2: new
lcp [Thu, 03 Nov 1994 11:58:16 +0100] rev 685
ZF/equalities/domain_converse,range_converse,
prod_Un_distrib2,prod_Int_distrib2: new
lcp [Thu, 03 Nov 1994 11:52:04 +0100] rev 684
ZF/Fixedpt/subset0_cs: moved to ZF/ZF.ML
ZF/Fixedpt/subset_cs: moved to ZF/subset.ML
lcp [Thu, 03 Nov 1994 11:45:41 +0100] rev 683
Cardinal_AC/surj_implies_inj: uses Pi_memberD instead of memberPiE
clasohm [Thu, 03 Nov 1994 08:34:53 +0100] rev 682
added warning message
"Currently parsed expression could be extremely ambiguous."
lcp [Wed, 02 Nov 1994 12:48:22 +0100] rev 681
Provers/classical: now takes theorem "classical" as argument, proves "swap"
Provers/classical/depth_tac,deepen_tac: new
lcp [Wed, 02 Nov 1994 12:44:03 +0100] rev 680
Provers/hypsubst: greatly simplified! No longer simulates a
"eres_inst_tac" using rev_cut_eq; instead simply rotates the chosen
equality to the end!
lcp [Wed, 02 Nov 1994 10:45:14 +0100] rev 679
Pure/sign/infer_types/exn_type_msg: new, for more uniform handling of
exception TYPE
nipkow [Wed, 02 Nov 1994 09:09:30 +0100] rev 678
Modified pattern.ML to perform proper matching of Higher-Order Patterns.
Modified thm.ML to preserve bound var names during rewriting.
Renamed eta_matches to matches.
lcp [Tue, 01 Nov 1994 10:40:10 +0100] rev 677
FOL/FOL/swap: deleted
FOL/FOL: tidied the signature
lcp [Tue, 01 Nov 1994 10:32:18 +0100] rev 676
HOLCF/Ssum3.ML: changed res_inst_tac [("P"... to res_inst_tac [("Pa" in
some very ugly proofs. Needed to handle new variable names in swap.
lcp [Mon, 31 Oct 1994 18:15:24 +0100] rev 675
ZF/ZF.thy: added precedences to @RepFun to disambiguate phrases like {x:A.x:B}
lcp [Mon, 31 Oct 1994 18:11:12 +0100] rev 674
ZF/domrange/image_subset: tidied
lcp [Mon, 31 Oct 1994 18:09:32 +0100] rev 673
ZF/upair/mem_asym,succ_inject: tidied
lcp [Mon, 31 Oct 1994 18:07:29 +0100] rev 672
com1,2: added simplifier calls to remove use of ssubst in fast_tac
lcp [Mon, 31 Oct 1994 18:03:14 +0100] rev 671
Pure/tctical/THEN_ELSE: new
lcp [Mon, 31 Oct 1994 18:01:02 +0100] rev 670
Pure/tactic/build_netpair: now takes two arguments
lcp [Mon, 31 Oct 1994 17:59:49 +0100] rev 669
Pure/sequence/hd,tl: new
lcp [Mon, 31 Oct 1994 17:55:43 +0100] rev 668
Pure/drule/thin_rl: new
lcp [Mon, 31 Oct 1994 17:14:42 +0100] rev 667
FOL/ex/ROOT: now loads mini.ML
lcp [Mon, 31 Oct 1994 17:09:10 +0100] rev 666
FOL/ROOT/FOL_dup_cs: removed as obsolete
FOL/ROOT: no longer proves rev_cut_eq for hyp_subst_tac
lcp [Mon, 31 Oct 1994 16:45:19 +0100] rev 665
FOL/ex/cla: proofs now use deepen_tac instead of best_tac FOL_dup_cs
lcp [Mon, 31 Oct 1994 16:39:20 +0100] rev 664
ZF/ZF/ex1_functional: moved to FOL/ROOT
lcp [Mon, 31 Oct 1994 15:49:58 +0100] rev 663
Miniscope conversoin; example of formula rewriting
lcp [Mon, 31 Oct 1994 15:45:54 +0100] rev 662
ZF/OrderArith/thin: deleted as obsolete
ZF/OrderArith/wf_on_radd: now uses thin_rl
lcp [Mon, 31 Oct 1994 15:41:20 +0100] rev 661
added final newline
lcp [Mon, 31 Oct 1994 15:35:43 +0100] rev 660
added header files; deleted commented-out code
nipkow [Fri, 28 Oct 1994 10:13:16 +0100] rev 659
Prepared the code for preservation of bound var names during rewriting. Still
requires a matching function for HO-patterns.
nipkow [Wed, 26 Oct 1994 17:41:40 +0100] rev 658
removed superfluous type_intrs in datatype com.
nipkow [Wed, 26 Oct 1994 15:20:55 +0100] rev 657
simplified syntax of infix continuous functiuons
wenzelm [Tue, 25 Oct 1994 13:16:49 +0100] rev 656
strip_quotes now exported;
wenzelm [Tue, 25 Oct 1994 13:15:34 +0100] rev 655
minor change of occs_const in dest_defn;
wenzelm [Tue, 25 Oct 1994 13:13:52 +0100] rev 654
added require_thy;
lcp [Mon, 24 Oct 1994 10:34:28 +0100] rev 653
HOL,ZF/IMP/Com.thy: tightening precedences to eliminate syntactic ambiguities.
constructor ";" now yields a low precedence; the reduction relations are
now more like infixes.
lcp [Fri, 21 Oct 1994 09:58:05 +0100] rev 652
ZF/intr_elim/elim_rls: now includes Pair_inject, since coinductive
definitions may involve ordinary pairs. (HOL/intr_elim does not require
this change)
lcp [Fri, 21 Oct 1994 09:53:38 +0100] rev 651
Pure/Unify/IMPROVING "CLEANING" OF FLEX-FLEX PAIRS: Old code would refuse
to simplfy %x y.?a(x) =?= %x y.?b(f(?c(y), y)) because it found the flexible
path to y before the rigid path. New code simplifies this to
%x.?a(x) =?= %x.?d, eliminating ?a.
Pure/Unify/rigid_bound: preliminary check for rigid paths to the banned
bound variables
Pure/Unify/change_bnos: any occurrences of the banned bound variables must
now be flexible, causing abandonment of the "cleaning"
lcp [Fri, 21 Oct 1994 09:51:01 +0100] rev 650
LK/hardquant/37: deleted call to flexflex_tac: no longer needed
lcp [Fri, 21 Oct 1994 09:47:02 +0100] rev 649
LCF/LCF.thy: the constant VOID had mixfix syntax "()" !! Added quotes.
lcp [Fri, 21 Oct 1994 09:35:24 +0100] rev 648
FOLP/IFOLP.thy: tightening precedences to eliminate syntactic ambiguities.
Now proof objects have high precedences. Eliminates ambiguity in a=b:P
being parsed as (a=b):P.
lcp [Wed, 19 Oct 1994 09:54:38 +0100] rev 647
ZF/Fixedpt/coinduct: modified proof to suppress deep unification
lcp [Wed, 19 Oct 1994 09:48:13 +0100] rev 646
new comments explaining abandoned change
lcp [Wed, 19 Oct 1994 09:44:31 +0100] rev 645
LCF/fix/lfp_is_FIX: modified proof to suppress deep unification
lcp [Wed, 19 Oct 1994 09:41:48 +0100] rev 644
FOL/ex/cla/58: slightly shorter proof
lcp [Wed, 19 Oct 1994 09:39:23 +0100] rev 643
trivial update to reference
lcp [Wed, 19 Oct 1994 09:23:56 +0100] rev 642
CCL/Gfp/coinduct2, coinduct3: modified proofs to suppress deep unification
CCL/CCL, Fix, Gfp, Hered, Set, Term, Trancl, Type, Wfd: expanded shorthands
wenzelm [Wed, 12 Oct 1994 16:38:58 +0100] rev 641
add_defs: improved error messages;
installed new print_goals with nice 'env mode';
wenzelm [Wed, 12 Oct 1994 16:34:52 +0100] rev 640
removed old comment;
wenzelm [Wed, 12 Oct 1994 16:34:00 +0100] rev 639
remove _explode, _implode and trfuns;
wenzelm [Wed, 12 Oct 1994 16:32:06 +0100] rev 638
prove_subclass, prove_arity now exported;
minor internal changes;
wenzelm [Wed, 12 Oct 1994 16:31:01 +0100] rev 637
added is_equals: term -> bool;
wenzelm [Wed, 12 Oct 1994 16:30:19 +0100] rev 636
type_args, opt_witness now exported;
added AxClass.;
wenzelm [Wed, 12 Oct 1994 16:29:10 +0100] rev 635
AxClass no longer open;
lcp [Wed, 12 Oct 1994 12:20:18 +0100] rev 634
{HOL,ZF}/intr_elim/intro_tacsf: now calls DEPTH_SOLVE_1 instead of REPEAT to
solve the goal fully
lcp [Wed, 12 Oct 1994 12:09:54 +0100] rev 633
{HOL,ZF}/indrule/ind_tac: now calls DEPTH_SOLVE_1 instead of REPEAT, to
solve the goal fully before proceeding
{HOL,ZF}/indrule/mutual_ind_tac: ensures that calls to "prem" cannot loop;
calls DEPTH_SOLVE_1 instead of REPEAT to solve the goal fully
wenzelm [Wed, 12 Oct 1994 11:09:11 +0100] rev 632
fixed infix names in print_translations;
lcp [Wed, 12 Oct 1994 09:48:32 +0100] rev 631
Pure/tctical/suppress_tracing: new; can now switch tracing off until the
next tactical call. There is no good way of doing this because of
backtracking.
Pure/tctical/exec_trace_command,tracify,traced_tac: these set, test and
reset suppress_tracing