equal
deleted
inserted
replaced
41 "fact". INCOMPATIBILITY: need to name facts explicitly in rare |
41 "fact". INCOMPATIBILITY: need to name facts explicitly in rare |
42 situations. |
42 situations. |
43 |
43 |
44 |
44 |
45 *** HOL *** |
45 *** HOL *** |
|
46 |
|
47 * Theory Product_Type: duplicated lemmas split_Pair_apply and injective_fst_snd |
|
48 removed, use split_eta and prod_eqI instead. Renamed upd_fst to apfst and upd_snd |
|
49 to apsnd. INCOMPATIBILITY. |
46 |
50 |
47 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of |
51 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of |
48 the same name in theory Orderings: |
52 the same name in theory Orderings: |
49 |
53 |
50 less_trans |
54 less_trans |
109 |
113 |
110 * New primrec package. Specification syntax conforms in style to |
114 * New primrec package. Specification syntax conforms in style to |
111 definition/function/.... No separate induction rule is provided. The |
115 definition/function/.... No separate induction rule is provided. The |
112 "primrec" command distinguishes old-style and new-style specifications |
116 "primrec" command distinguishes old-style and new-style specifications |
113 by syntax. The former primrec package is now named OldPrimrecPackage. |
117 by syntax. The former primrec package is now named OldPrimrecPackage. |
114 When adjusting theories, beware: constants stemming for new-style |
118 When adjusting theories, beware: constants stemming from new-style |
115 primrec specifications have authentic syntax. |
119 primrec specifications have authentic syntax. |
116 |
120 |
117 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}. |
121 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}. |
118 |
122 |
119 * Library/ListVector: new theory of arithmetic vector operations. |
123 * Library/ListVector: new theory of arithmetic vector operations. |
1026 - Efficient_Nat implements natural numbers by integers, which in general will |
1030 - Efficient_Nat implements natural numbers by integers, which in general will |
1027 result in higher efficency; pattern matching with 0/Suc is eliminated; |
1031 result in higher efficency; pattern matching with 0/Suc is eliminated; |
1028 includes Code_Integer. |
1032 includes Code_Integer. |
1029 - Code_Index provides an additional datatype index which is mapped to |
1033 - Code_Index provides an additional datatype index which is mapped to |
1030 target-language built-in integers. |
1034 target-language built-in integers. |
1031 - Code_Message provides an additional datatype message_string} which is isomorphic to |
1035 - Code_Message provides an additional datatype message_string which is isomorphic to |
1032 strings; messages are mapped to target-language strings. |
1036 strings; messages are mapped to target-language strings. |
1033 |
1037 |
1034 * New package for inductive predicates |
1038 * New package for inductive predicates |
1035 |
1039 |
1036 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via |
1040 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via |