clasohm [Fri, 03 Mar 1995 12:04:16 +0100] rev 924
new version of HOL/IMP with curried function application
clasohm [Fri, 03 Mar 1995 12:02:25 +0100] rev 923
new version of HOL with curried function application
clasohm [Fri, 03 Mar 1995 11:48:05 +0100] rev 922
added CPure (curried functions) and ProtoPure (ancestor of Pure and CPure)
wenzelm [Thu, 02 Mar 1995 12:07:20 +0100] rev 921
added declaration of syntactic const "_abs";
lcp [Tue, 28 Feb 1995 10:54:49 +0100] rev 920
Added initial /bin/csh line and comments
lcp [Tue, 28 Feb 1995 10:53:56 +0100] rev 919
No longer calls maketest; instead, the Makefile writes the file
test.
lcp [Tue, 28 Feb 1995 10:51:52 +0100] rev 918
Uses "suffix substitution" to shorten macro definitions.
lcp [Tue, 28 Feb 1995 10:50:37 +0100] rev 917
Re-organised to perform the tests independently. Now test
is defined in terms of separate targets IMP, ex, etc. If ISABELLECOMP is set
wrongly then "exit 1" causes the Make to fail. Defines the macro "LOGIC" to
refer to the right command for running the object-logic. Uses "suffix
substitution" to shorten macro definitions.
lcp [Tue, 28 Feb 1995 10:33:52 +0100] rev 916
New example by Jacob Frost, tidied by lcp
lcp [Mon, 27 Feb 1995 18:12:21 +0100] rev 915
New example by Jacob Frost, tidied by lcp
lcp [Mon, 27 Feb 1995 18:07:59 +0100] rev 914
Now prove_goalw_cterm calls print_sign_exn_unit, so that the rest
of the error message ("The exception above was raised for...") will appear.
And print_exn calls print_sign_exn_unit so that it can re-raise the SAME
exception.
lcp [Mon, 27 Feb 1995 18:05:38 +0100] rev 913
Updated the "version" variable (which was never done for
Isabelle-94 revisions 1 and 2!)
lcp [Mon, 27 Feb 1995 17:51:12 +0100] rev 912
Redefined functions to suppress redundant leading 0s and 1s
wenzelm [Mon, 27 Feb 1995 17:47:57 +0100] rev 911
new in mixfix annotations: "' " (quote space) separates delimiters without
adding extra white space for printing;
lcp [Mon, 27 Feb 1995 17:47:44 +0100] rev 910
Added the exception handler
handle _ => exit 1. This will catch all errors and force an exit with error
code, causing Make to fail.
lcp [Mon, 27 Feb 1995 17:44:43 +0100] rev 909
intro_tacsf now includes subsetI as an introduction rule. It is
needed for rules like list_into_univ
lcp [Mon, 27 Feb 1995 17:40:57 +0100] rev 908
Updated comment about list_subset_univ and list_into_univ.
lcp [Mon, 27 Feb 1995 17:27:50 +0100] rev 907
exit: new, for use in Makefiles
lcp [Mon, 27 Feb 1995 17:11:25 +0100] rev 906
Redefined arithmetic to suppress redundant leading 0s and 1s
renamed the infix 2239 to the constant Bcons, as numerals eliminate
the need for the infix.
lcp [Mon, 27 Feb 1995 17:08:51 +0100] rev 905
Added integer numerals (mostly due to Markus Wenzel)
renamed the infix 2239 to the constant Bcons, as numerals eliminate
the need for the infix.
lcp [Mon, 27 Feb 1995 17:06:19 +0100] rev 904
Proved zadd_left_commute and zmult_left_commute to define
zadd_ac and zmult_ac. Deleted add_cong, add_kill and add_left_commute_kill as
unused. Defined zadd_simps, zminus_simps, zmult_simps and added them to
integ_ss.
lcp [Mon, 27 Feb 1995 16:58:59 +0100] rev 903
New shell script for finding orphan .ML files (those with no
.thy file)
clasohm [Fri, 24 Feb 1995 11:52:19 +0100] rev 902
added ExcludeThm; cleaned up Makefile; fixed isalpha bug (replaced by isalnum)
clasohm [Fri, 17 Feb 1995 13:25:11 +0100] rev 901
added check "length ts > 1" before printing ambiguity warning in infer_types
nipkow [Thu, 16 Feb 1995 08:55:15 +0100] rev 900
Improved test for looping rewrite rules.
regensbu [Wed, 15 Feb 1995 20:02:47 +0100] rev 899
replaced pair_ss by prod_ss
nipkow [Wed, 08 Feb 1995 11:30:00 +0100] rev 898
Improved check for looping conditional rewrite rules.
regensbu [Tue, 07 Feb 1995 17:36:48 +0100] rev 897
ID for the file
regensbu [Tue, 07 Feb 1995 17:35:49 +0100] rev 896
ID for the file
regensbu [Tue, 07 Feb 1995 17:30:34 +0100] rev 895
'get ID update working'
regensbu [Tue, 07 Feb 1995 17:26:32 +0100] rev 894
CVS:
CVS:
regensbu [Tue, 07 Feb 1995 17:25:31 +0100] rev 893
CVS:
clasohm [Tue, 07 Feb 1995 11:59:32 +0100] rev 892
added qed, qed_goal[w]
clasohm [Fri, 03 Feb 1995 12:32:14 +0100] rev 891
added specification of csh as script interpreter
clasohm [Thu, 02 Feb 1995 13:11:51 +0100] rev 890
simplified elimination of chain productions
wenzelm [Fri, 27 Jan 1995 13:40:07 +0100] rev 889
binder: optional body pri now [bracketted];
wenzelm [Fri, 27 Jan 1995 13:35:29 +0100] rev 888
improved read_xrules: patterns no longer read twice;
tuned read_typ;
wenzelm [Fri, 27 Jan 1995 13:33:52 +0100] rev 887
*** empty log message ***
wenzelm [Fri, 27 Jan 1995 13:31:26 +0100] rev 886
instance: now automatically includes defs of current thy node as witnesses;
wenzelm [Fri, 27 Jan 1995 13:29:44 +0100] rev 885
binder: optional body pri now [bracketted];
clasohm [Fri, 27 Jan 1995 12:42:03 +0100] rev 884
added documentation of pwd
clasohm [Fri, 27 Jan 1995 12:31:18 +0100] rev 883
renamed Sign.ambiguity_level to Syntax.ambiguity_level
clasohm [Fri, 27 Jan 1995 12:30:36 +0100] rev 882
moved ambiguity_level from sign.ML to Syntax/syntax.ML
clasohm [Fri, 27 Jan 1995 12:28:05 +0100] rev 881
moved ambiguity_level to Syntax/syntax.ML
clasohm [Thu, 26 Jan 1995 13:31:36 +0100] rev 880
added documentation of Sign.ambiguity_level
clasohm [Thu, 26 Jan 1995 12:44:50 +0100] rev 879
added reference variable ambiguity_level to control ambiguity warnings
lcp [Wed, 25 Jan 1995 04:00:27 +0100] rev 878
changed due to new .bib files
clasohm [Tue, 24 Jan 1995 12:17:49 +0100] rev 877
added optional body priority to binder declaration
lcp [Tue, 24 Jan 1995 03:04:20 +0100] rev 876
Under RS added cross reference to bind_thm
lcp [Tue, 24 Jan 1995 03:03:19 +0100] rev 875
documented slow_tac, slow_best_tac, depth_tac, deepen_tac
lcp [Tue, 24 Jan 1995 03:02:01 +0100] rev 874
removed mention of FOL_dup_cs
lcp [Tue, 24 Jan 1995 03:01:14 +0100] rev 873
\bibliography now includes crossref.bib
lcp [Tue, 24 Jan 1995 03:00:32 +0100] rev 872
updates for Isabelle94-2
clasohm [Mon, 23 Jan 1995 12:20:10 +0100] rev 871
simplified get_thm a bit
lcp [Fri, 20 Jan 1995 10:41:01 +0100] rev 870
Replaced ordermap_z_lepoll by ordermap_z_lt, which is
stronger and has a simpler proof. Modified proof of ordermap_csquare_le
accordingly.
lcp [Fri, 20 Jan 1995 02:00:57 +0100] rev 869
README: Now documents to Tools directory
lcp [Fri, 20 Jan 1995 02:00:23 +0100] rev 868
Deleted semicolon at the end of the qed_goal line, which was preventing
not_emptyE from being proved.
nipkow [Thu, 19 Jan 1995 19:46:49 +0100] rev 867
some cosmetic changes
clasohm [Thu, 19 Jan 1995 16:05:21 +0100] rev 866
added documentation of bind_thm, qed, qed_goal, get_thm, thms_of
and theory_of_thm
clasohm [Wed, 18 Jan 1995 11:36:04 +0100] rev 865
added optional precedence for body of binder;
removed call to infer_types from read_xrules
wenzelm [Wed, 18 Jan 1995 10:17:55 +0100] rev 864
quite a lot of minor and major revisions (inspecting theories, read_axm,
cert_axm, grammar generation, lexical matters, macro examples, ...);
lcp [Fri, 13 Jan 1995 02:02:00 +0100] rev 863
empty_def typo
lcp [Fri, 13 Jan 1995 02:01:26 +0100] rev 862
Proved comp_lam.
lcp [Fri, 13 Jan 1995 02:00:43 +0100] rev 861
Corrected indexing of *datatype
lcp [Thu, 12 Jan 1995 10:53:42 +0100] rev 860
prove_fun now includes equalityI. Added the rewrite rules
Collect_simps and UnInt_simps.
lcp [Thu, 12 Jan 1995 10:39:47 +0100] rev 859
Proved sum_bij, sum_ord_iso_cong, prod_bij,
prod_ord_iso_cong,singleton_prod_bij, singleton_prod_ord_iso,
prod_sum_singleton_bij, prod_sum_singleton_ord_iso.
Rotated conjunctions in radd_Inl_iff, radd_Inr_iff to be more suitable for
rewriting.
lcp [Thu, 12 Jan 1995 03:04:10 +0100] rev 858
Proved case_cong and case_case.
lcp [Thu, 12 Jan 1995 03:03:45 +0100] rev 857
Renamed single_fun to singleton_fun.
lcp [Thu, 12 Jan 1995 03:03:25 +0100] rev 856
Now also depends upon equalities.thy, allowing use of the
equalities in standard simpsets.
lcp [Thu, 12 Jan 1995 03:03:07 +0100] rev 855
Added singleton_iff, Sigma_empty1, Sigma_empty2, Collect_simps
and UnInt_simps to ZF_ss. Added consI1 to ZF_typechecks.
lcp [Thu, 12 Jan 1995 03:02:34 +0100] rev 854
Removed spurious comment about eq_cs
lcp [Thu, 12 Jan 1995 03:02:05 +0100] rev 853
Moved theorems Ord_cases_lemma and Ord_cases to Ordinal.ML
lcp [Thu, 12 Jan 1995 03:01:40 +0100] rev 852
Now depends upon Bool, so that 1 and 2 are defined
lcp [Thu, 12 Jan 1995 03:01:20 +0100] rev 851
Moved theorems Ord_cases_lemma and Ord_cases here from Univ,
strengthening the succ(j) case to include Ord(j). Proved trans_induct3,
le_implies_UN_le_UN, Ord_1, lt_Ord2, le_Ord2.
lcp [Thu, 12 Jan 1995 03:00:58 +0100] rev 850
Added constants Ord_alt, ++, **
lcp [Thu, 12 Jan 1995 03:00:38 +0100] rev 849
Proved equivalence of Ord and Ord_alt. Proved
ordertype_eq_imp_ord_iso, le_well_ord_Memrel, le_ordertype_Memrel, lt_oadd1,
oadd_le_self, bij_0_sum, oadd_0, oadd_assoc, id_ord_iso_Memrel, ordertype_0.
Now well_ord_Memrel follows from le_well_ord_Memrel and
ordertype_Memrel follows from le_ordertype_Memrel.
Proved simpler versions of Krzysztof's theorems Ord_oadd,
ordertype_pred_subset, ordertype_pred_lt, ordertype_pred_unfold, bij_sum_0,
bij_sum_succ, ordertype_sum_Memrel, lt_oadd_disj, oadd_inject.
Deleted ordertype_subset: subsumed by ordertype_pred_unfold.
Proved ordinal multiplication theorems Ord_omult, lt_omult, omult_oadd_lt,
omult_unfold, omult_0, omult_0_left, omult_1, omult_1_left,
oadd_omult_distrib, omult_succ, omult_assoc, omult_UN, omult_Limit, lt_omult1,
omult_le_self, omult_le_mono1, omult_lt_mono2, omult_le_mono2, omult_le_mono,
omult_lt_mono, omult_le_self2, omult_inject.
lcp [Wed, 11 Jan 1995 18:47:03 +0100] rev 848
Proved ord_isoI, ord_iso_refl. Simplified proof of
ord_iso_restrict_pred. Proved theorems irrefl_0, ..., well_ord_0.
lcp [Wed, 11 Jan 1995 18:42:06 +0100] rev 847
Proved cadd_cmult_distrib.
lcp [Wed, 11 Jan 1995 18:30:37 +0100] rev 846
Now proof of Ord_jump_cardinal uses
ordertype_pred_unfold; proof of sum_0_eqpoll uses bij_0_sum; proof of
sum_0_eqpoll uses sum_prod_distrib_bij; proof of sum_assoc_eqpoll uses
sum_assoc_bij; proof of prod_assoc_eqpoll uses prod_assoc_bij. Proved
well_ord_cadd_cmult_distrib.
lcp [Wed, 11 Jan 1995 18:21:39 +0100] rev 845
Added Krzysztof's theorem LeastI2. Proof of sum_eqpoll_cong
uses lemma sum_bij; proof of prod_eqpoll_cong uses lemma prod_bij.
wenzelm [Wed, 11 Jan 1995 13:25:23 +0100] rev 844
pretty_gram: now sorts productions;
wenzelm [Wed, 11 Jan 1995 10:57:39 +0100] rev 843
removed print_sign, print_axioms;
wenzelm [Wed, 11 Jan 1995 10:53:22 +0100] rev 842
slightly changed OFCLASS syntax;
wenzelm [Mon, 02 Jan 1995 12:16:12 +0100] rev 841
fixed minor typos;
wenzelm [Mon, 02 Jan 1995 12:14:26 +0100] rev 840
added;
lcp [Fri, 23 Dec 1994 16:51:10 +0100] rev 839
RepFun_eq_0_iff, RepFun_0: new
lcp [Fri, 23 Dec 1994 16:50:22 +0100] rev 838
Moved Transset_includes_summands and Transset_sum_Int_subset
here from Ordinal.ML
lcp [Fri, 23 Dec 1994 16:49:48 +0100] rev 837
Re-indented declarations; declared the number 2
lcp [Fri, 23 Dec 1994 16:35:42 +0100] rev 836
Added Krzysztof's theorems irrefl_converse, trans_on_converse,
part_ord_converse, linear_converse, tot_ord_converse,
Proved rvimage_converse, ord_iso_rvimage_eq
lcp [Fri, 23 Dec 1994 16:35:08 +0100] rev 835
Added Krzysztof's theorems irrefl_rvimage, trans_on_rvimage,
part_ord_rvimage, tot_ord_rvimage, irrefl_Int_iff, trans_on_Int_iff,
part_ord_Int_iff, linear_Int_iff, tot_ord_Int_iff, wf_on_Int_iff,
well_ord_Int_iff
lcp [Fri, 23 Dec 1994 16:34:27 +0100] rev 834
singleton_iff: new
lcp [Fri, 23 Dec 1994 16:33:37 +0100] rev 833
Proved cons_lepoll_consD, succ_lepoll_succD, cons_eqpoll_consD,
succ_eqpoll_succD, cons_lepoll_cons_iff, cons_eqpoll_cons_iff. Deleted
inj_succ_succD. Streamlined proof of nat_lepoll_imp_le_lemma. Added
Krzysztof's theorems diff_sing_lepoll, lepoll_diff_sing, diff_sing_eqpoll,
lepoll_1_is_sing, inj_not_surj_succ, lesspoll_trans, lesspoll_lepoll_lesspoll,
lepoll_lesspoll_lesspoll, lepoll_imp_lesspoll_succ, lesspoll_succ_imp_lepoll,
lepoll_succ_disj, lepoll_nat_imp_Finite, lepoll_Finite,
Finite_imp_cons_Finite, Finite_imp_succ_Finite, nat_le_infinite_Ord,
nat_wf_on_converse_Memrel, nat_well_ord_converse_Memrel, well_ord_converse,
ordertype_eq_n, Finite_well_ord_converse
lcp [Fri, 23 Dec 1994 16:32:39 +0100] rev 832
Added Krzysztof's constants lesspoll and Finite
lcp [Fri, 23 Dec 1994 16:32:02 +0100] rev 831
Added Krzysztof's theorem pred_Memrel
lcp [Fri, 23 Dec 1994 16:31:23 +0100] rev 830
Moved Transset_includes_summands and Transset_sum_Int_subset to
QUniv.thy to eliminate use of merge_theories. Proved Memrel_type.
Added Krzysztof's theorems Memrel_mono, Memrel_empty, lt_Ord, succ_le_imp_le
lcp [Fri, 23 Dec 1994 16:30:35 +0100] rev 829
natE0: deleted, since unused
lcp [Fri, 23 Dec 1994 16:29:53 +0100] rev 828
Changed succ(1) to 2 in in_VLimit, two_in_univ
lcp [Fri, 23 Dec 1994 16:29:04 +0100] rev 827
csquare_rel_def: renamed k to K
lcp [Fri, 23 Dec 1994 16:28:26 +0100] rev 826
inj_apply_equality: new
lcp [Fri, 23 Dec 1994 16:27:45 +0100] rev 825
Added Krzysztof's theorems subst_elem, not_emptyI, not_emptyE
lcp [Fri, 23 Dec 1994 16:27:07 +0100] rev 824
empty_fun: generalized from -> to Pi
lcp [Fri, 23 Dec 1994 16:26:34 +0100] rev 823
Changed succ(1) to 2 in cmult_2; Simplified proof of InfCard_is_Limit
lcp [Fri, 23 Dec 1994 16:25:45 +0100] rev 822
Added Krzysztof's theorems singleton_eq_iff, fst_type, snd_type
Renamed doubleton_iff to doubleton_eq_iff
lcp [Fri, 23 Dec 1994 10:52:25 +0100] rev 821
Added Krzysztof's theorem disj_imp_disj
lcp [Wed, 21 Dec 1994 13:36:02 +0100] rev 820
Id: marker.
lcp [Wed, 21 Dec 1994 13:26:26 +0100] rev 819
Added comments and Id: marker.
lcp [Wed, 21 Dec 1994 13:10:39 +0100] rev 818
Added comments and Id: marker.
lcp [Wed, 21 Dec 1994 12:53:45 +0100] rev 817
Tools description, largely taken from ../README
lcp [Wed, 21 Dec 1994 12:46:52 +0100] rev 816
Moved description of tools to Tools/README
lcp [Tue, 20 Dec 1994 16:20:50 +0100] rev 815
ord_iso_rvimage: new
lcp [Tue, 20 Dec 1994 15:58:52 +0100] rev 814
Moved well_ord_Memrel, lt_eq_pred, Ord_iso_implies_eq_lemma,
Ord_iso_implies_eq to top of file, as they do not require the other
material. Simplified proof of ordertype_subset.
Proved ordertype_eq: a short proof using deepen_tac! Deleted
bij_ordermap_vimage and ordermap_Memrel
"bij_ordermap_vimage and ordermap_Memrelf. [| f: bij(A,B); well_ord(B,r); x:A |] ==>\
\ ordermap(A,rvimage(A,f,r)) ` x = ordermap(B,r) ` (f`x)";
"\ ordermap(A,rvimage(A,f,r)) ` x = ordermap(B,r) ` (f`x)";i. [| Ord(i); j:i |] ==> ordermap(i,Memrel(i)) ` j = j"
because ordertype_eq serves the same purpose. Proofs of bij_ordertype_vimage
and ordertype_Memrel are now trivial.
clasohm [Tue, 20 Dec 1994 13:24:04 +0100] rev 813
qed is a utility that makes ML files store the defined theories in Isabelle's
theorem database
lcp [Tue, 20 Dec 1994 10:21:32 +0100] rev 812
Simplified proof of ord_iso_image_pred using bij_inverse_ss.
Replaced not_well_ord_iso_pred_lemma by much simpler well_ord_iso_subset_lemma.
Simplifed proof of well_ord_iso_unique_lemma using well_ord_iso_subset_lemma.
lcp [Tue, 20 Dec 1994 10:19:24 +0100] rev 811
Used bind_thm to store domain_rel_subset and range_rel_subset
lcp [Mon, 19 Dec 1994 15:30:30 +0100] rev 810
removed quotes around "Datatype",
and removed needless mention of [Q]Univ
lcp [Mon, 19 Dec 1994 15:22:42 +0100] rev 809
removed quotes around "Inductive"
lcp [Mon, 19 Dec 1994 15:17:29 +0100] rev 808
ran expandshort script
lcp [Mon, 19 Dec 1994 15:11:50 +0100] rev 807
ran expandshort script
lcp [Mon, 19 Dec 1994 13:24:58 +0100] rev 806
removed quotes around "Inductive"
lcp [Mon, 19 Dec 1994 13:18:54 +0100] rev 805
added true theory dependencies