2 ================================================= |
2 ================================================= |
3 |
3 |
4 (Note: Isabelle/jEdit shows a tree-view of the NEWS file in Sidekick.) |
4 (Note: Isabelle/jEdit shows a tree-view of the NEWS file in Sidekick.) |
5 |
5 |
6 |
6 |
7 New in this Isabelle version |
7 New in Isabelle2024 (May 2024) |
8 ---------------------------- |
8 ------------------------------ |
9 |
9 |
10 *** General *** |
10 *** General *** |
11 |
11 |
12 * Dropped support for very old operating systems. The platform |
12 * Dropped support for very old operating systems. The platform |
13 base-lines are now as follows: |
13 base-lines are now as follows: |
27 |
27 |
28 *** Document preparation *** |
28 *** Document preparation *** |
29 |
29 |
30 * The bundled LaTeX LNCS style has been updated to version 2.23 |
30 * The bundled LaTeX LNCS style has been updated to version 2.23 |
31 (02-Nov-2023). See also src/Doc/Demo_LLNCS/. |
31 (02-Nov-2023). See also src/Doc/Demo_LLNCS/. |
|
32 |
|
33 |
|
34 *** Pure *** |
|
35 |
|
36 * Added configuration option "unify_trace" (default: false) to guard |
|
37 tracing of higher-order unification, which is ubiquitous in assumption |
|
38 steps and rule applications via resolution. This is disabled by default |
|
39 to avoid breakdown due to massive amounts of spurious messages. |
32 |
40 |
33 |
41 |
34 *** HOL *** |
42 *** HOL *** |
35 |
43 |
36 * Commands 'inductive_cases', 'inductive_simps', 'case_of_simps', |
44 * Commands 'inductive_cases', 'inductive_simps', 'case_of_simps', |
44 . Z3 4.4.1 for arm64-linux has been removed: unreliable, unstable. |
52 . Z3 4.4.1 for arm64-linux has been removed: unreliable, unstable. |
45 - New implementation of moura tactic. INCOMPATIBILITY. |
53 - New implementation of moura tactic. INCOMPATIBILITY. |
46 - Added support for "order" proof method to proof reconstruction. |
54 - Added support for "order" proof method to proof reconstruction. |
47 |
55 |
48 * Mirabelle: |
56 * Mirabelle: |
49 - Removed proof reconstruction from "sledgehammer" action; |
57 - Removed proof reconstruction from "sledgehammer" action; the related |
50 the related option "proof_method" was removed. Proof reconstruction is |
58 option "proof_method" was removed. Proof reconstruction is supported |
51 supported directly by Sledgehammer and should be used instead. For |
59 directly by Sledgehammer and should be used instead. For more |
52 more information, see Sledgehammer's documentation relating to |
60 information, see Sledgehammer's documentation relating to |
53 "preplay_timeout". INCOMPATIBILITY. |
61 "preplay_timeout". INCOMPATIBILITY. |
54 - Added the action "order" testing the proof method of the same name. |
62 - Added the action "order" testing the proof method of the same name. |
55 |
|
56 * Session Data_Structures provides automatic translation from |
|
57 HOL functions into corresponding step-counting running-time functions.See theory Define_Time_Function. |
|
58 |
63 |
59 * Explicit type class for discrete_linear_ordered_semidom for integral |
64 * Explicit type class for discrete_linear_ordered_semidom for integral |
60 semidomains with a discrete linear order. |
65 semidomains with a discrete linear order. |
61 |
66 |
62 * Type class linordered_euclidean_semiring replaces the (rather |
67 * Type class linordered_euclidean_semiring replaces the (rather |
105 tranclp_ident_if_and_transp |
110 tranclp_ident_if_and_transp |
106 tranclp_less[simp] |
111 tranclp_less[simp] |
107 tranclp_less_eq[simp] |
112 tranclp_less_eq[simp] |
108 |
113 |
109 * Theory "HOL.Wellfounded": |
114 * Theory "HOL.Wellfounded": |
110 - Added predicates wf_on and wfp_on and redefined wfP to be abbreviations. |
115 - Added predicates wf_on and wfp_on and redefined wfP to be |
111 Lemmas wf_def and wfP_def are explicitly provided for backward |
116 abbreviations. Lemmas wf_def and wfP_def are explicitly provided for |
112 compatibility but their usage is discouraged. Minor INCOMPATIBILITY. |
117 backward compatibility but their usage is discouraged. Minor |
113 - Added wfp as alias for wfP for greater consistency with other predicates |
118 INCOMPATIBILITY. |
114 such as asymp, transp, or totalp. |
119 - Added wfp as alias for wfP for greater consistency with other |
|
120 predicates such as asymp, transp, or totalp. |
115 - Added lemmas. |
121 - Added lemmas. |
116 wellorder.wfp_on_less[simp] |
122 wellorder.wfp_on_less[simp] |
117 wfP_iff_ex_minimal |
123 wfP_iff_ex_minimal |
118 wf_iff_ex_minimal |
124 wf_iff_ex_minimal |
119 wf_onE_pf |
125 wf_onE_pf |
146 to require the underlying set to be convex. INCOMPATIBILITY. |
152 to require the underlying set to be convex. INCOMPATIBILITY. |
147 |
153 |
148 * HOL-Complex_Analysis: new, more general definition of meromorphicity. |
154 * HOL-Complex_Analysis: new, more general definition of meromorphicity. |
149 INCOMPATIBILITY. |
155 INCOMPATIBILITY. |
150 |
156 |
151 *** Pure *** |
157 * HOL-Data_Structures: automatic translation from HOL functions into |
152 |
158 corresponding step-counting running-time functions. See theory |
153 * Added configuration option "unify_trace" (default: false) to guard |
159 "HOL-Data_Structures.Define_Time_Function". |
154 tracing of higher-order unification, which is ubiquitous in assumption |
|
155 steps and rule applications via resolution. This is disabled by default |
|
156 to avoid breakdown due to massive amounts of spurious messages. |
|
157 |
160 |
158 |
161 |
159 *** ML *** |
162 *** ML *** |
160 |
163 |
161 * ML antiquotation "try" provides variants of exception handling that |
164 * ML antiquotation "try" provides variants of exception handling that |