author | wenzelm |
Mon, 31 Dec 2012 13:08:37 +0100 | |
changeset 50646 | c02e6a75aa3f |
parent 50645 | cb8f93361e86 |
child 50701 | 054f6bf349d2 |
permissions | -rw-r--r-- |
5363 | 1 |
Isabelle NEWS -- history user-relevant changes |
2 |
============================================== |
|
2553 | 3 |
|
47887 | 4 |
New in this Isabelle version |
5 |
---------------------------- |
|
6 |
||
47967
c422128d3889
discontinued obsolete method fastsimp / tactic fast_simp_tac;
wenzelm
parents:
47958
diff
changeset
|
7 |
*** General *** |
c422128d3889
discontinued obsolete method fastsimp / tactic fast_simp_tac;
wenzelm
parents:
47958
diff
changeset
|
8 |
|
50126
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
50119
diff
changeset
|
9 |
* Theorem status about oracles and unfinished/failed future proofs is |
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
50119
diff
changeset
|
10 |
no longer printed by default, since it is incompatible with |
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
50119
diff
changeset
|
11 |
incremental / parallel checking of the persistent document model. ML |
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
50119
diff
changeset
|
12 |
function Thm.peek_status may be used to inspect a snapshot of the |
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
50119
diff
changeset
|
13 |
ongoing evaluation process. Note that in batch mode --- notably |
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
50119
diff
changeset
|
14 |
isabelle build --- the system ensures that future proofs of all |
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
50119
diff
changeset
|
15 |
accessible theorems in the theory context are finished (as before). |
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
50119
diff
changeset
|
16 |
|
49699 | 17 |
* Configuration option show_markup controls direct inlining of markup |
18 |
into the printed representation of formal entities --- notably type |
|
19 |
and sort constraints. This enables Prover IDE users to retrieve that |
|
20 |
information via tooltips in the output window, for example. |
|
21 |
||
48890
d72ca5742f80
'ML_file' evaluates ML text from a file directly within the theory, without predeclaration via 'uses';
wenzelm
parents:
48844
diff
changeset
|
22 |
* Command 'ML_file' evaluates ML text from a file directly within the |
d72ca5742f80
'ML_file' evaluates ML text from a file directly within the theory, without predeclaration via 'uses';
wenzelm
parents:
48844
diff
changeset
|
23 |
theory, without any predeclaration via 'uses' in the theory header. |
d72ca5742f80
'ML_file' evaluates ML text from a file directly within the theory, without predeclaration via 'uses';
wenzelm
parents:
48844
diff
changeset
|
24 |
|
49243 | 25 |
* Old command 'use' command and corresponding keyword 'uses' in the |
26 |
theory header are legacy features and will be discontinued soon. |
|
27 |
Tools that load their additional source files may imitate the |
|
28 |
'ML_file' implementation, such that the system can take care of |
|
29 |
dependencies properly. |
|
30 |
||
47967
c422128d3889
discontinued obsolete method fastsimp / tactic fast_simp_tac;
wenzelm
parents:
47958
diff
changeset
|
31 |
* Discontinued obsolete method fastsimp / tactic fast_simp_tac, which |
c422128d3889
discontinued obsolete method fastsimp / tactic fast_simp_tac;
wenzelm
parents:
47958
diff
changeset
|
32 |
is called fastforce / fast_force_tac already since Isabelle2011-1. |
c422128d3889
discontinued obsolete method fastsimp / tactic fast_simp_tac;
wenzelm
parents:
47958
diff
changeset
|
33 |
|
50110 | 34 |
* Updated and extended "isar-ref" and "implementation" manual, reduced |
35 |
remaining material in old "ref" manual. |
|
48120
9fe0e71052a0
updated "isar-ref" manual, reduced remaining material in "ref" manual.
wenzelm
parents:
48111
diff
changeset
|
36 |
|
49841 | 37 |
* Improved support for auxiliary contexts indicate block structure for |
38 |
specifications: nesting of "context fixes ... context assumes ..." |
|
39 |
and "class ... context ...". |
|
40 |
||
49869
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset
|
41 |
* More informative error messages for Isar proof commands involving |
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset
|
42 |
lazy enumerations (method applications etc.). |
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset
|
43 |
|
50213 | 44 |
* Refined 'help' command to retrieve outer syntax commands according |
45 |
to name patterns (with clickable results). |
|
46 |
||
47967
c422128d3889
discontinued obsolete method fastsimp / tactic fast_simp_tac;
wenzelm
parents:
47958
diff
changeset
|
47 |
|
49968 | 48 |
*** Prover IDE -- Isabelle/Scala/jEdit *** |
49 |
||
50 |
* Parallel terminal proofs ('by') are enabled by default, likewise |
|
51 |
proofs that are built into packages like 'datatype', 'function'. This |
|
52 |
allows to "run ahead" checking the theory specifications on the |
|
53 |
surface, while the prover is still crunching on internal |
|
54 |
justifications. Unfinished / cancelled proofs are restarted as |
|
55 |
required to complete full proof checking eventually. |
|
56 |
||
57 |
* Improved output panel with tooltips, hyperlinks etc. based on the |
|
58 |
same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of |
|
59 |
tooltips leads to some window that supports the same recursively, |
|
60 |
which can lead to stacks of tooltips as the semantic document content |
|
61 |
is explored. ESCAPE closes the whole stack, individual windows may be |
|
62 |
closed separately, or detached to become independent jEdit dockables. |
|
63 |
||
64 |
* More robust incremental parsing of outer syntax (partial comments, |
|
65 |
malformed symbols). Changing the balance of open/close quotes and |
|
66 |
comment delimiters works more conveniently with unfinished situations |
|
67 |
that frequently occur in user interaction. |
|
68 |
||
69 |
* More efficient painting and improved reactivity when editing large |
|
70 |
files. More scalable management of formal document content. |
|
71 |
||
50505
33c92722cc3d
smarter handling of tracing messages: prover process pauses and enters user dialog;
wenzelm
parents:
50455
diff
changeset
|
72 |
* Smarter handling of tracing messages: prover process pauses after |
33c92722cc3d
smarter handling of tracing messages: prover process pauses and enters user dialog;
wenzelm
parents:
50455
diff
changeset
|
73 |
certain number of messages per command transaction, with some user |
33c92722cc3d
smarter handling of tracing messages: prover process pauses and enters user dialog;
wenzelm
parents:
50455
diff
changeset
|
74 |
dialog to stop or continue. This avoids swamping the front-end with |
50119
5c370a036de7
more generous tracing_limit, with explicit system option;
wenzelm
parents:
50118
diff
changeset
|
75 |
potentially infinite message streams. |
49968 | 76 |
|
77 |
* More plugin options and preferences, based on Isabelle/Scala. The |
|
78 |
jEdit plugin option panel provides access to some Isabelle/Scala |
|
79 |
options, including tuning parameters for editor reactivity and color |
|
80 |
schemes. |
|
81 |
||
50184 | 82 |
* Dockable window "Symbols" provides some editing support for Isabelle |
83 |
symbols. |
|
84 |
||
50183 | 85 |
* Improved editing support for control styles: subscript, superscript, |
86 |
bold, reset of style -- operating on single symbols or text |
|
50198
0c7b351a6871
added convenience actions isabelle.increase-font-size and isabelle.decrease-font-size;
wenzelm
parents:
50184
diff
changeset
|
87 |
selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT. |
0c7b351a6871
added convenience actions isabelle.increase-font-size and isabelle.decrease-font-size;
wenzelm
parents:
50184
diff
changeset
|
88 |
|
0c7b351a6871
added convenience actions isabelle.increase-font-size and isabelle.decrease-font-size;
wenzelm
parents:
50184
diff
changeset
|
89 |
* Actions isabelle.increase-font-size and isabelle.decrease-font-size |
0c7b351a6871
added convenience actions isabelle.increase-font-size and isabelle.decrease-font-size;
wenzelm
parents:
50184
diff
changeset
|
90 |
adjust the main text area font size, and its derivatives for output, |
0c7b351a6871
added convenience actions isabelle.increase-font-size and isabelle.decrease-font-size;
wenzelm
parents:
50184
diff
changeset
|
91 |
tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS. |
50183 | 92 |
|
50406
c28753665b8e
documentation for isabelle build_dialog and its implicit use in isabelle jedit;
wenzelm
parents:
50232
diff
changeset
|
93 |
* Implicit check and build dialog of the specified logic session |
c28753665b8e
documentation for isabelle build_dialog and its implicit use in isabelle jedit;
wenzelm
parents:
50232
diff
changeset
|
94 |
image. For example, HOL, HOLCF, HOL-Nominal can be produced on |
c28753665b8e
documentation for isabelle build_dialog and its implicit use in isabelle jedit;
wenzelm
parents:
50232
diff
changeset
|
95 |
demand, without bundling big platform-dependent heap images in the |
c28753665b8e
documentation for isabelle build_dialog and its implicit use in isabelle jedit;
wenzelm
parents:
50232
diff
changeset
|
96 |
Isabelle distribution. |
c28753665b8e
documentation for isabelle build_dialog and its implicit use in isabelle jedit;
wenzelm
parents:
50232
diff
changeset
|
97 |
|
49968 | 98 |
* Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates |
99 |
from Oracle provide better multi-platform experience. This version is |
|
100 |
now bundled exclusively with Isabelle. |
|
101 |
||
102 |
||
48205 | 103 |
*** Pure *** |
104 |
||
48431
6efff142bb54
restrict unqualified imports from Haskell Prelude to a small set of fundamental operations
haftmann
parents:
48428
diff
changeset
|
105 |
* Code generation for Haskell: restrict unqualified imports from |
6efff142bb54
restrict unqualified imports from Haskell Prelude to a small set of fundamental operations
haftmann
parents:
48428
diff
changeset
|
106 |
Haskell Prelude to a small set of fundamental operations. |
6efff142bb54
restrict unqualified imports from Haskell Prelude to a small set of fundamental operations
haftmann
parents:
48428
diff
changeset
|
107 |
|
50646 | 108 |
* Command 'export_code': relative file names are interpreted |
109 |
relatively to master directory of current theory rather than the |
|
110 |
rather arbitrary current working directory. INCOMPATIBILITY. |
|
48371 | 111 |
|
48205 | 112 |
* Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY, |
113 |
use regular rule composition via "OF" / "THEN", or explicit proof |
|
114 |
structure instead. Note that Isabelle/ML provides a variety of |
|
115 |
operators like COMP, INCR_COMP, COMP_INCR, which need to be applied |
|
116 |
with some care where this is really required. |
|
117 |
||
48792 | 118 |
* Command 'typ' supports an additional variant with explicit sort |
119 |
constraint, to infer and check the most general type conforming to a |
|
120 |
given given sort. Example (in HOL): |
|
121 |
||
122 |
typ "_ * _ * bool * unit" :: finite |
|
123 |
||
48205 | 124 |
|
48013
44de84112a67
added optimisation for equational premises in Quickcheck; added some Quickcheck examples; NEWS
bulwahn
parents:
47979
diff
changeset
|
125 |
*** HOL *** |
44de84112a67
added optimisation for equational premises in Quickcheck; added some Quickcheck examples; NEWS
bulwahn
parents:
47979
diff
changeset
|
126 |
|
50646 | 127 |
* Sledgehammer: |
128 |
||
129 |
- Added MaSh relevance filter based on machine-learning; see the |
|
130 |
Sledgehammer manual for details. |
|
131 |
- Polished Isar proofs generated with "isar_proofs" option. |
|
132 |
- Rationalized type encodings ("type_enc" option). |
|
133 |
- Renamed "kill_provers" subcommand to "kill". |
|
134 |
- Renamed options: |
|
135 |
isar_proof ~> isar_proofs |
|
136 |
isar_shrink_factor ~> isar_shrink |
|
137 |
max_relevant ~> max_facts |
|
138 |
relevance_thresholds ~> fact_thresholds |
|
139 |
||
140 |
* Quickcheck: added an optimisation for equality premises. It is |
|
141 |
switched on by default, and can be switched off by setting the |
|
142 |
configuration quickcheck_optimise_equality to false. |
|
143 |
||
144 |
* Simproc "finite_Collect" rewrites set comprehensions into pointfree |
|
145 |
expressions. |
|
146 |
||
147 |
* Preprocessing of the code generator rewrites set comprehensions into |
|
148 |
pointfree expressions. |
|
149 |
||
150 |
* The SMT solver Z3 has now by default a restricted set of directly |
|
151 |
supported features. For the full set of features (div/mod, nonlinear |
|
152 |
arithmetic, datatypes/records) with potential proof reconstruction |
|
153 |
failures, enable the configuration option "z3_with_extensions". Minor |
|
154 |
INCOMPATIBILITY. |
|
49948
744934b818c7
moved quite generic material from theory Enum to more appropriate places
haftmann
parents:
49918
diff
changeset
|
155 |
|
49836
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49822
diff
changeset
|
156 |
* Simplified 'typedef' specifications: historical options for implicit |
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49822
diff
changeset
|
157 |
set definition and alternative name have been discontinued. The |
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49822
diff
changeset
|
158 |
former behavior of "typedef (open) t = A" is now the default, but |
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49822
diff
changeset
|
159 |
written just "typedef t = A". INCOMPATIBILITY, need to adapt theories |
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49822
diff
changeset
|
160 |
accordingly. |
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49822
diff
changeset
|
161 |
|
50646 | 162 |
* Removed constant "chars"; prefer "Enum.enum" on type "char" |
163 |
directly. INCOMPATIBILITY. |
|
164 |
||
165 |
* Moved operation product, sublists and n_lists from theory Enum to |
|
166 |
List. INCOMPATIBILITY. |
|
49822
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49770
diff
changeset
|
167 |
|
49739 | 168 |
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. |
169 |
||
49738 | 170 |
* Class "comm_monoid_diff" formalises properties of bounded |
49388 | 171 |
subtraction, with natural numbers and multisets as typical instances. |
172 |
||
50646 | 173 |
* Added combinator "Option.these" with type "'a option set => 'a set". |
174 |
||
175 |
* Theory "Transitive_Closure": renamed lemmas |
|
176 |
||
177 |
reflcl_tranclp -> reflclp_tranclp |
|
178 |
rtranclp_reflcl -> rtranclp_reflclp |
|
179 |
||
180 |
INCOMPATIBILITY. |
|
181 |
||
182 |
* Theory "Rings": renamed lemmas (in class semiring) |
|
183 |
||
184 |
left_distrib ~> distrib_right |
|
185 |
right_distrib ~> distrib_left |
|
186 |
||
187 |
INCOMPATIBILITY. |
|
188 |
||
189 |
* Generalized the definition of limits: |
|
190 |
||
191 |
- Introduced the predicate filterlim (LIM x F. f x :> G) which |
|
192 |
expresses that when the input values x converge to F then the |
|
193 |
output f x converges to G. |
|
194 |
||
195 |
- Added filters for convergence to positive (at_top) and negative |
|
196 |
infinity (at_bot). |
|
197 |
||
198 |
- Moved infinity in the norm (at_infinity) from |
|
199 |
Multivariate_Analysis to Complex_Main. |
|
200 |
||
201 |
- Removed real_tendsto_inf, it is superseded by "LIM x F. f x :> |
|
202 |
at_top". |
|
203 |
||
204 |
INCOMPATIBILITY. |
|
205 |
||
206 |
* Theory "Library/Option_ord" provides instantiation of option type to |
|
207 |
lattice type classes. |
|
208 |
||
209 |
* Theory "Library/Multiset": renamed |
|
210 |
||
211 |
constant fold_mset ~> Multiset.fold |
|
212 |
fact fold_mset_commute ~> fold_mset_comm |
|
213 |
||
214 |
INCOMPATIBILITY. |
|
215 |
||
216 |
* Renamed theory Library/List_Prefix to Library/Sublist, with related |
|
217 |
changes as follows. |
|
218 |
||
219 |
- Renamed constants (and related lemmas) |
|
49145 | 220 |
|
221 |
prefix ~> prefixeq |
|
222 |
strict_prefix ~> prefix |
|
223 |
||
50646 | 224 |
- Replaced constant "postfix" by "suffixeq" with swapped argument |
225 |
order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped |
|
226 |
old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead. |
|
227 |
Renamed lemmas accordingly. |
|
228 |
||
229 |
- Added constant "list_hembeq" for homeomorphic embedding on |
|
230 |
lists. Added abbreviation "sublisteq" for special case |
|
231 |
"list_hembeq (op =)". |
|
232 |
||
233 |
- Theory Library/Sublist no longer provides "order" and "bot" type |
|
234 |
class instances for the prefix order (merely corresponding locale |
|
235 |
interpretations). The type class instances are now in theory |
|
236 |
Library/Prefix_Order. |
|
237 |
||
238 |
- The sublist relation of theory Library/Sublist_Order is now based |
|
239 |
on "Sublist.sublisteq". Renamed lemmas accordingly: |
|
50516 | 240 |
|
241 |
le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff |
|
242 |
le_list_append_mono ~> Sublist.list_hembeq_append_mono |
|
243 |
le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2 |
|
244 |
le_list_Cons_EX ~> Sublist.list_hembeq_ConsD |
|
245 |
le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2' |
|
246 |
le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq |
|
247 |
le_list_drop_Cons ~> Sublist.sublisteq_Cons' |
|
248 |
le_list_drop_many ~> Sublist.sublisteq_drop_many |
|
249 |
le_list_filter_left ~> Sublist.sublisteq_filter_left |
|
250 |
le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many |
|
251 |
le_list_rev_take_iff ~> Sublist.sublisteq_append |
|
252 |
le_list_same_length ~> Sublist.sublisteq_same_length |
|
253 |
le_list_take_many_iff ~> Sublist.sublisteq_append' |
|
49145 | 254 |
less_eq_list.drop ~> less_eq_list_drop |
255 |
less_eq_list.induct ~> less_eq_list_induct |
|
50516 | 256 |
not_le_list_length ~> Sublist.not_sublisteq_length |
49145 | 257 |
|
50646 | 258 |
INCOMPATIBILITY. |
259 |
||
260 |
||
261 |
* New theory Library/Countable_Set. |
|
262 |
||
263 |
* Theory Library/Debug and Library/Parallel provide debugging and |
|
264 |
parallel execution for code generated towards Isabelle/ML. |
|
265 |
||
266 |
* Theory Library/FuncSet: Extended support for Pi and extensional and |
|
267 |
introduce the extensional dependent function space "PiE". Replaced |
|
268 |
extensional_funcset by an abbreviation, and renamed lemmas from |
|
269 |
extensional_funcset to PiE as follows: |
|
270 |
||
271 |
extensional_empty ~> PiE_empty |
|
272 |
extensional_funcset_empty_domain ~> PiE_empty_domain |
|
273 |
extensional_funcset_empty_range ~> PiE_empty_range |
|
274 |
extensional_funcset_arb ~> PiE_arb |
|
275 |
extensional_funcset_mem ~> PiE_mem |
|
276 |
extensional_funcset_extend_domainI ~> PiE_fun_upd |
|
277 |
extensional_funcset_restrict_domain ~> fun_upd_in_PiE |
|
278 |
extensional_funcset_extend_domain_eq ~> PiE_insert_eq |
|
279 |
card_extensional_funcset ~> card_PiE |
|
280 |
finite_extensional_funcset ~> finite_PiE |
|
281 |
||
282 |
INCOMPATIBILITY. |
|
283 |
||
284 |
* Theory Library/FinFun: theory of almost everywhere constant |
|
285 |
functions (supersedes the AFP entry "Code Generation for Functions as |
|
286 |
Data"). |
|
287 |
||
288 |
* Theory Library/Phantom: generic phantom type to make a type |
|
289 |
parameter appear in a constant's type. This alternative to adding |
|
290 |
TYPE('a) as another parameter avoids unnecessary closures in generated |
|
291 |
code. |
|
292 |
||
293 |
* Theory Library/RBT_Impl: efficient construction of red-black trees |
|
294 |
from sorted associative lists. Merging two trees with rbt_union may |
|
295 |
return a structurally different tree than before. Potential |
|
296 |
INCOMPATIBILITY. |
|
297 |
||
298 |
* Theory Library/IArray: immutable arrays with code generation. |
|
299 |
||
300 |
* Theory Library/Finite_Lattice: theory of finite lattices. |
|
301 |
||
302 |
* HOL/Multivariate_Analysis: replaced |
|
303 |
||
304 |
"basis :: 'a::euclidean_space => nat => real" |
|
305 |
"\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space" |
|
306 |
||
307 |
on euclidean spaces by using the inner product "_ \<bullet> _" with |
|
308 |
vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by |
|
309 |
"SUM i : Basis. f i * r i". |
|
310 |
||
311 |
With this change the following constants are also changed or removed: |
|
312 |
||
313 |
DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation) |
|
314 |
a $$ i ~> inner a i (where i : Basis) |
|
315 |
cart_base i removed |
|
316 |
\<pi>, \<pi>' removed |
|
50526
899c9c4e4a4c
Remove the indexed basis from the definition of euclidean spaces and only use the set of Basis vectors
hoelzl
parents:
50525
diff
changeset
|
317 |
|
899c9c4e4a4c
Remove the indexed basis from the definition of euclidean spaces and only use the set of Basis vectors
hoelzl
parents:
50525
diff
changeset
|
318 |
Theorems about these constants where removed. |
899c9c4e4a4c
Remove the indexed basis from the definition of euclidean spaces and only use the set of Basis vectors
hoelzl
parents:
50525
diff
changeset
|
319 |
|
899c9c4e4a4c
Remove the indexed basis from the definition of euclidean spaces and only use the set of Basis vectors
hoelzl
parents:
50525
diff
changeset
|
320 |
Renamed lemmas: |
899c9c4e4a4c
Remove the indexed basis from the definition of euclidean spaces and only use the set of Basis vectors
hoelzl
parents:
50525
diff
changeset
|
321 |
|
50646 | 322 |
component_le_norm ~> Basis_le_norm |
323 |
euclidean_eq ~> euclidean_eq_iff |
|
324 |
differential_zero_maxmin_component ~> differential_zero_maxmin_cart |
|
325 |
euclidean_simps ~> inner_simps |
|
326 |
independent_basis ~> independent_Basis |
|
327 |
span_basis ~> span_Basis |
|
328 |
in_span_basis ~> in_span_Basis |
|
329 |
norm_bound_component_le ~> norm_boound_Basis_le |
|
330 |
norm_bound_component_lt ~> norm_boound_Basis_lt |
|
331 |
component_le_infnorm ~> Basis_le_infnorm |
|
332 |
||
333 |
INCOMPATIBILITY. |
|
50526
899c9c4e4a4c
Remove the indexed basis from the definition of euclidean spaces and only use the set of Basis vectors
hoelzl
parents:
50525
diff
changeset
|
334 |
|
50141 | 335 |
* HOL/Probability: |
50646 | 336 |
|
337 |
- Added simproc "measurable" to automatically prove measurability. |
|
338 |
||
339 |
- Added induction rules for sigma sets with disjoint union |
|
340 |
(sigma_sets_induct_disjoint) and for Borel-measurable functions |
|
341 |
(borel_measurable_induct). |
|
342 |
||
343 |
- Added the Daniell-Kolmogorov theorem (the existence the limit of a |
|
344 |
projective family). |
|
345 |
||
346 |
* HOL/Cardinals: Theories of ordinals and cardinals (supersedes the |
|
347 |
AFP entry "Ordinals_and_Cardinals"). |
|
348 |
||
349 |
* HOL/BNF: New (co)datatype package based on bounded natural functors |
|
350 |
with support for mixed, nested recursion and interesting non-free |
|
351 |
datatypes. |
|
48094 | 352 |
|
48120
9fe0e71052a0
updated "isar-ref" manual, reduced remaining material in "ref" manual.
wenzelm
parents:
48111
diff
changeset
|
353 |
|
48206 | 354 |
*** Document preparation *** |
355 |
||
50646 | 356 |
* Dropped legacy antiquotations "term_style" and "thm_style", since |
357 |
styles may be given as arguments to "term" and "thm" already. |
|
358 |
Discontinued legacy styles "prem1" .. "prem19". |
|
359 |
||
360 |
* Default LaTeX rendering for \<euro> is now based on eurosym package, |
|
361 |
instead of slightly exotic babel/greek. |
|
48206 | 362 |
|
48616
be8002ee43d8
document variant NAME may use different LaTeX entry point document/root_NAME.tex if that file exists;
wenzelm
parents:
48586
diff
changeset
|
363 |
* Document variant NAME may use different LaTeX entry point |
be8002ee43d8
document variant NAME may use different LaTeX entry point document/root_NAME.tex if that file exists;
wenzelm
parents:
48586
diff
changeset
|
364 |
document/root_NAME.tex if that file exists, instead of the common |
be8002ee43d8
document variant NAME may use different LaTeX entry point document/root_NAME.tex if that file exists;
wenzelm
parents:
48586
diff
changeset
|
365 |
document/root.tex. |
be8002ee43d8
document variant NAME may use different LaTeX entry point document/root_NAME.tex if that file exists;
wenzelm
parents:
48586
diff
changeset
|
366 |
|
48657
63ef2f0cf8bb
simplified custom document/build script, instead of old-style document/IsaMakefile;
wenzelm
parents:
48616
diff
changeset
|
367 |
* Simplified custom document/build script, instead of old-style |
63ef2f0cf8bb
simplified custom document/build script, instead of old-style document/IsaMakefile;
wenzelm
parents:
48616
diff
changeset
|
368 |
document/IsaMakefile. Minor INCOMPATIBILITY. |
63ef2f0cf8bb
simplified custom document/build script, instead of old-style document/IsaMakefile;
wenzelm
parents:
48616
diff
changeset
|
369 |
|
48206 | 370 |
|
48992 | 371 |
*** ML *** |
372 |
||
50646 | 373 |
* The default limit for maximum number of worker threads is now 8, |
374 |
instead of 4, in correspondence to capabilities of contemporary |
|
375 |
hardware and Poly/ML runtime system. |
|
376 |
||
49869
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset
|
377 |
* Type Seq.results and related operations support embedded error |
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset
|
378 |
messages within lazy enumerations, and thus allow to provide |
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset
|
379 |
informative errors in the absence of any usable results. |
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset
|
380 |
|
48992 | 381 |
* Renamed Position.str_of to Position.here to emphasize that this is a |
382 |
formal device to inline positions into message text, but not |
|
383 |
necessarily printing visible text. |
|
384 |
||
385 |
||
48206 | 386 |
*** System *** |
387 |
||
48585
a82910dd2270
announce advanced support for Isabelle sessions and build management;
wenzelm
parents:
48574
diff
changeset
|
388 |
* Advanced support for Isabelle sessions and build management, see |
a82910dd2270
announce advanced support for Isabelle sessions and build management;
wenzelm
parents:
48574
diff
changeset
|
389 |
"system" manual for the chapter of that name, especially the "isabelle |
48736 | 390 |
build" tool and its examples. INCOMPATIBILITY, isabelle usedir / |
391 |
mkdir / make are rendered obsolete. |
|
392 |
||
393 |
* Discontinued obsolete "isabelle makeall". |
|
48585
a82910dd2270
announce advanced support for Isabelle sessions and build management;
wenzelm
parents:
48574
diff
changeset
|
394 |
|
48722
a5e3ba7cbb2a
discontinued obsolete IsaMakefile and ROOT.ML files from the Isabelle distribution;
wenzelm
parents:
48693
diff
changeset
|
395 |
* Discontinued obsolete IsaMakefile and ROOT.ML files from the |
a5e3ba7cbb2a
discontinued obsolete IsaMakefile and ROOT.ML files from the Isabelle distribution;
wenzelm
parents:
48693
diff
changeset
|
396 |
Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that |
a5e3ba7cbb2a
discontinued obsolete IsaMakefile and ROOT.ML files from the Isabelle distribution;
wenzelm
parents:
48693
diff
changeset
|
397 |
provides some traditional targets that invoke "isabelle build". Note |
a5e3ba7cbb2a
discontinued obsolete IsaMakefile and ROOT.ML files from the Isabelle distribution;
wenzelm
parents:
48693
diff
changeset
|
398 |
that this is inefficient! Applications of Isabelle/HOL involving |
a5e3ba7cbb2a
discontinued obsolete IsaMakefile and ROOT.ML files from the Isabelle distribution;
wenzelm
parents:
48693
diff
changeset
|
399 |
"isabelle make" should be upgraded to use "isabelle build" directly. |
a5e3ba7cbb2a
discontinued obsolete IsaMakefile and ROOT.ML files from the Isabelle distribution;
wenzelm
parents:
48693
diff
changeset
|
400 |
|
48586 | 401 |
* Discontinued obsolete Isabelle/build script, it is superseded by the |
402 |
regular isabelle build tool. For example: |
|
403 |
||
404 |
isabelle build -s -b HOLCF |
|
405 |
||
48693
ceeea46bdeba
"isabelle options" prints Isabelle system options;
wenzelm
parents:
48683
diff
changeset
|
406 |
* The "isabelle options" tool prints Isabelle system options, as |
ceeea46bdeba
"isabelle options" prints Isabelle system options;
wenzelm
parents:
48683
diff
changeset
|
407 |
required for "isabelle build", for example. |
ceeea46bdeba
"isabelle options" prints Isabelle system options;
wenzelm
parents:
48683
diff
changeset
|
408 |
|
48683 | 409 |
* The "isabelle mkroot" tool prepares session root directories for use |
410 |
with "isabelle build", similar to former "isabelle mkdir" for |
|
411 |
"isabelle usedir". |
|
412 |
||
50646 | 413 |
* The "isabelle logo" tool produces EPS and PDF format simultaneously. |
414 |
Minor INCOMPATIBILITY in command-line options. |
|
415 |
||
416 |
* The "isabelle install" tool has now a simpler command-line. Minor |
|
417 |
INCOMPATIBILITY. |
|
418 |
||
48844 | 419 |
* The "isabelle components" tool helps to resolve add-on components |
420 |
that are not bundled, or referenced from a bare-bones repository |
|
421 |
version of Isabelle. |
|
422 |
||
50646 | 423 |
* Settings variable ISABELLE_PLATFORM_FAMILY refers to the general |
424 |
platform family: "linux", "macos", "windows". |
|
425 |
||
426 |
* The ML system is configured as regular component, and no longer |
|
427 |
picked up from some surrounding directory. Potential INCOMPATIBILITY |
|
428 |
for home-made settings. |
|
50132 | 429 |
|
48206 | 430 |
* Discontinued support for Poly/ML 5.2.1, which was the last version |
431 |
without exception positions and advanced ML compiler/toplevel |
|
432 |
configuration. |
|
433 |
||
48574 | 434 |
* Discontinued special treatment of Proof General -- no longer guess |
435 |
PROOFGENERAL_HOME based on accidental file-system layout. Minor |
|
436 |
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS |
|
437 |
settings manually, or use a Proof General version that has been |
|
438 |
bundled as Isabelle component. |
|
48206 | 439 |
|
50182 | 440 |
|
48120
9fe0e71052a0
updated "isar-ref" manual, reduced remaining material in "ref" manual.
wenzelm
parents:
48111
diff
changeset
|
441 |
|
47462 | 442 |
New in Isabelle2012 (May 2012) |
443 |
------------------------------ |
|
45109 | 444 |
|
45593 | 445 |
*** General *** |
446 |
||
45614 | 447 |
* Prover IDE (PIDE) improvements: |
448 |
||
47585 | 449 |
- more robust Sledgehammer integration (as before the sledgehammer |
47806 | 450 |
command-line needs to be typed into the source buffer) |
45614 | 451 |
- markup for bound variables |
47806 | 452 |
- markup for types of term variables (displayed as tooltips) |
46956
9ff441f295c2
Isabelle/jEdit supports user-defined Isar commands within the running session;
wenzelm
parents:
46948
diff
changeset
|
453 |
- support for user-defined Isar commands within the running session |
47158 | 454 |
- improved support for Unicode outside original 16bit range |
455 |
e.g. glyph for \<A> (thanks to jEdit 4.5.1) |
|
45614 | 456 |
|
47806 | 457 |
* Forward declaration of outer syntax keywords within the theory |
458 |
header -- minor INCOMPATIBILITY for user-defined commands. Allow new |
|
459 |
commands to be used in the same theory where defined. |
|
46485 | 460 |
|
47482
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
461 |
* Auxiliary contexts indicate block structure for specifications with |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
462 |
additional parameters and assumptions. Such unnamed contexts may be |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
463 |
nested within other targets, like 'theory', 'locale', 'class', |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
464 |
'instantiation' etc. Results from the local context are generalized |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
465 |
accordingly and applied to the enclosing target context. Example: |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
466 |
|
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
467 |
context |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
468 |
fixes x y z :: 'a |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
469 |
assumes xy: "x = y" and yz: "y = z" |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
470 |
begin |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
471 |
|
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
472 |
lemma my_trans: "x = z" using xy yz by simp |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
473 |
|
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
474 |
end |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
475 |
|
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
476 |
thm my_trans |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
477 |
|
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
478 |
The most basic application is to factor-out context elements of |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
479 |
several fixes/assumes/shows theorem statements, e.g. see |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
480 |
~~/src/HOL/Isar_Examples/Group_Context.thy |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
481 |
|
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
482 |
Any other local theory specification element works within the "context |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
483 |
... begin ... end" block as well. |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
484 |
|
47484 | 485 |
* Bundled declarations associate attributed fact expressions with a |
486 |
given name in the context. These may be later included in other |
|
487 |
contexts. This allows to manage context extensions casually, without |
|
47855 | 488 |
the logical dependencies of locales and locale interpretation. See |
489 |
commands 'bundle', 'include', 'including' etc. in the isar-ref manual. |
|
47484 | 490 |
|
47829 | 491 |
* Commands 'lemmas' and 'theorems' allow local variables using 'for' |
492 |
declaration, and results are standardized before being stored. Thus |
|
493 |
old-style "standard" after instantiation or composition of facts |
|
494 |
becomes obsolete. Minor INCOMPATIBILITY, due to potential change of |
|
495 |
indices of schematic variables. |
|
496 |
||
497 |
* Rule attributes in local theory declarations (e.g. locale or class) |
|
498 |
are now statically evaluated: the resulting theorem is stored instead |
|
499 |
of the original expression. INCOMPATIBILITY in rare situations, where |
|
500 |
the historic accident of dynamic re-evaluation in interpretations |
|
501 |
etc. was exploited. |
|
502 |
||
503 |
* New tutorial "Programming and Proving in Isabelle/HOL" |
|
504 |
("prog-prove"). It completely supersedes "A Tutorial Introduction to |
|
505 |
Structured Isar Proofs" ("isar-overview"), which has been removed. It |
|
506 |
also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order |
|
507 |
Logic" as the recommended beginners tutorial, but does not cover all |
|
508 |
of the material of that old tutorial. |
|
509 |
||
510 |
* Updated and extended reference manuals: "isar-ref", |
|
511 |
"implementation", "system"; reduced remaining material in old "ref" |
|
512 |
manual. |
|
513 |
||
514 |
||
515 |
*** Pure *** |
|
516 |
||
46976
80123a220219
'definition' no longer exports the foundational "raw_def";
wenzelm
parents:
46966
diff
changeset
|
517 |
* Command 'definition' no longer exports the foundational "raw_def" |
80123a220219
'definition' no longer exports the foundational "raw_def";
wenzelm
parents:
46966
diff
changeset
|
518 |
into the user context. Minor INCOMPATIBILITY, may use the regular |
80123a220219
'definition' no longer exports the foundational "raw_def";
wenzelm
parents:
46966
diff
changeset
|
519 |
"def" result with attribute "abs_def" to imitate the old version. |
80123a220219
'definition' no longer exports the foundational "raw_def";
wenzelm
parents:
46966
diff
changeset
|
520 |
|
47855 | 521 |
* Attribute "abs_def" turns an equation of the form "f x y == t" into |
522 |
"f == %x y. t", which ensures that "simp" or "unfold" steps always |
|
523 |
expand it. This also works for object-logic equality. (Formerly |
|
524 |
undocumented feature.) |
|
525 |
||
47856 | 526 |
* Sort constraints are now propagated in simultaneous statements, just |
527 |
like type constraints. INCOMPATIBILITY in rare situations, where |
|
528 |
distinct sorts used to be assigned accidentally. For example: |
|
529 |
||
530 |
lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal" |
|
531 |
||
532 |
lemma "P (x::'a)" and "Q (y::'a::bar)" |
|
533 |
-- "now uniform 'a::bar instead of default sort for first occurrence (!)" |
|
534 |
||
535 |
* Rule composition via attribute "OF" (or ML functions OF/MRS) is more |
|
536 |
tolerant against multiple unifiers, as long as the final result is |
|
537 |
unique. (As before, rules are composed in canonical right-to-left |
|
538 |
order to accommodate newly introduced premises.) |
|
539 |
||
47806 | 540 |
* Renamed some inner syntax categories: |
541 |
||
542 |
num ~> num_token |
|
543 |
xnum ~> xnum_token |
|
544 |
xstr ~> str_token |
|
545 |
||
546 |
Minor INCOMPATIBILITY. Note that in practice "num_const" or |
|
547 |
"num_position" etc. are mainly used instead (which also include |
|
548 |
position information via constraints). |
|
549 |
||
47829 | 550 |
* Simplified configuration options for syntax ambiguity: see |
551 |
"syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref |
|
552 |
manual. Minor INCOMPATIBILITY. |
|
553 |
||
47856 | 554 |
* Discontinued configuration option "syntax_positions": atomic terms |
555 |
in parse trees are always annotated by position constraints. |
|
45134 | 556 |
|
47464 | 557 |
* Old code generator for SML and its commands 'code_module', |
45383 | 558 |
'code_library', 'consts_code', 'types_code' have been discontinued. |
46028
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset
|
559 |
Use commands of the generic code generator instead. INCOMPATIBILITY. |
45383 | 560 |
|
47464 | 561 |
* Redundant attribute "code_inline" has been discontinued. Use |
562 |
"code_unfold" instead. INCOMPATIBILITY. |
|
563 |
||
564 |
* Dropped attribute "code_unfold_post" in favor of the its dual |
|
565 |
"code_abbrev", which yields a common pattern in definitions like |
|
46028
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset
|
566 |
|
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset
|
567 |
definition [code_abbrev]: "f = t" |
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset
|
568 |
|
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset
|
569 |
INCOMPATIBILITY. |
45383 | 570 |
|
47856 | 571 |
* Obsolete 'types' command has been discontinued. Use 'type_synonym' |
572 |
instead. INCOMPATIBILITY. |
|
573 |
||
574 |
* Discontinued old "prems" fact, which used to refer to the accidental |
|
575 |
collection of foundational premises in the context (already marked as |
|
576 |
legacy since Isabelle2011). |
|
47855 | 577 |
|
45427
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset
|
578 |
|
45122 | 579 |
*** HOL *** |
580 |
||
47464 | 581 |
* Type 'a set is now a proper type constructor (just as before |
582 |
Isabelle2008). Definitions mem_def and Collect_def have disappeared. |
|
583 |
Non-trivial INCOMPATIBILITY. For developments keeping predicates and |
|
47855 | 584 |
sets separate, it is often sufficient to rephrase some set S that has |
585 |
been accidentally used as predicates by "%x. x : S", and some |
|
586 |
predicate P that has been accidentally used as set by "{x. P x}". |
|
587 |
Corresponding proofs in a first step should be pruned from any |
|
588 |
tinkering with former theorems mem_def and Collect_def as far as |
|
589 |
possible. |
|
590 |
||
591 |
For developments which deliberately mix predicates and sets, a |
|
47464 | 592 |
planning step is necessary to determine what should become a predicate |
593 |
and what a set. It can be helpful to carry out that step in |
|
594 |
Isabelle2011-1 before jumping right into the current release. |
|
595 |
||
47855 | 596 |
* Code generation by default implements sets as container type rather |
597 |
than predicates. INCOMPATIBILITY. |
|
598 |
||
599 |
* New type synonym 'a rel = ('a * 'a) set |
|
600 |
||
47464 | 601 |
* The representation of numerals has changed. Datatype "num" |
602 |
represents strictly positive binary numerals, along with functions |
|
603 |
"numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent |
|
47855 | 604 |
positive and negated numeric literals, respectively. See also |
605 |
definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some |
|
606 |
user theories may require adaptations as follows: |
|
47108
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
607 |
|
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
608 |
- Theorems with number_ring or number_semiring constraints: These |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
609 |
classes are gone; use comm_ring_1 or comm_semiring_1 instead. |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
610 |
|
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
611 |
- Theories defining numeric types: Remove number, number_semiring, |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
612 |
and number_ring instances. Defer all theorems about numerals until |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
613 |
after classes one and semigroup_add have been instantiated. |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
614 |
|
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
615 |
- Numeral-only simp rules: Replace each rule having a "number_of v" |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
616 |
pattern with two copies, one for numeral and one for neg_numeral. |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
617 |
|
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
618 |
- Theorems about subclasses of semiring_1 or ring_1: These classes |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
619 |
automatically support numerals now, so more simp rules and |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
620 |
simprocs may now apply within the proof. |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
621 |
|
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
622 |
- Definitions and theorems using old constructors Pls/Min/Bit0/Bit1: |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
623 |
Redefine using other integer operations. |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
624 |
|
47855 | 625 |
* Transfer: New package intended to generalize the existing |
626 |
"descending" method and related theorem attributes from the Quotient |
|
627 |
package. (Not all functionality is implemented yet, but future |
|
628 |
development will focus on Transfer as an eventual replacement for the |
|
629 |
corresponding parts of the Quotient package.) |
|
47809 | 630 |
|
631 |
- transfer_rule attribute: Maintains a collection of transfer rules, |
|
632 |
which relate constants at two different types. Transfer rules may |
|
633 |
relate different type instances of the same polymorphic constant, |
|
634 |
or they may relate an operation on a raw type to a corresponding |
|
635 |
operation on an abstract type (quotient or subtype). For example: |
|
636 |
||
637 |
((A ===> B) ===> list_all2 A ===> list_all2 B) map map |
|
638 |
(cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int |
|
639 |
||
640 |
- transfer method: Replaces a subgoal on abstract types with an |
|
641 |
equivalent subgoal on the corresponding raw types. Constants are |
|
642 |
replaced with corresponding ones according to the transfer rules. |
|
643 |
Goals are generalized over all free variables by default; this is |
|
47851 | 644 |
necessary for variables whose types change, but can be overridden |
47855 | 645 |
for specific variables with e.g. "transfer fixing: x y z". The |
47809 | 646 |
variant transfer' method allows replacing a subgoal with one that |
647 |
is logically stronger (rather than equivalent). |
|
648 |
||
649 |
- relator_eq attribute: Collects identity laws for relators of |
|
650 |
various type constructors, e.g. "list_all2 (op =) = (op =)". The |
|
651 |
transfer method uses these lemmas to infer transfer rules for |
|
652 |
non-polymorphic constants on the fly. |
|
653 |
||
654 |
- transfer_prover method: Assists with proving a transfer rule for a |
|
655 |
new constant, provided the constant is defined in terms of other |
|
656 |
constants that already have transfer rules. It should be applied |
|
657 |
after unfolding the constant definitions. |
|
658 |
||
659 |
- HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer |
|
660 |
from type nat to type int. |
|
661 |
||
47851 | 662 |
* Lifting: New package intended to generalize the quotient_definition |
663 |
facility of the Quotient package; designed to work with Transfer. |
|
47809 | 664 |
|
665 |
- lift_definition command: Defines operations on an abstract type in |
|
666 |
terms of a corresponding operation on a representation |
|
667 |
type. Example syntax: |
|
668 |
||
669 |
lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist" |
|
670 |
is List.insert |
|
671 |
||
672 |
Users must discharge a respectfulness proof obligation when each |
|
673 |
constant is defined. (For a type copy, i.e. a typedef with UNIV, |
|
674 |
the proof is discharged automatically.) The obligation is |
|
675 |
presented in a user-friendly, readable form; a respectfulness |
|
676 |
theorem in the standard format and a transfer rule are generated |
|
677 |
by the package. |
|
678 |
||
679 |
- Integration with code_abstype: For typedefs (e.g. subtypes |
|
680 |
corresponding to a datatype invariant, such as dlist), |
|
681 |
lift_definition generates a code certificate theorem and sets up |
|
682 |
code generation for each constant. |
|
683 |
||
684 |
- setup_lifting command: Sets up the Lifting package to work with a |
|
685 |
user-defined type. The user must provide either a quotient theorem |
|
686 |
or a type_definition theorem. The package configures transfer |
|
687 |
rules for equality and quantifiers on the type, and sets up the |
|
688 |
lift_definition command to work with the type. |
|
689 |
||
690 |
- Usage examples: See Quotient_Examples/Lift_DList.thy, |
|
47851 | 691 |
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, |
692 |
Word/Word.thy and Library/Float.thy. |
|
47809 | 693 |
|
694 |
* Quotient package: |
|
695 |
||
696 |
- The 'quotient_type' command now supports a 'morphisms' option with |
|
697 |
rep and abs functions, similar to typedef. |
|
698 |
||
699 |
- 'quotient_type' sets up new types to work with the Lifting and |
|
700 |
Transfer packages, as with 'setup_lifting'. |
|
701 |
||
702 |
- The 'quotient_definition' command now requires the user to prove a |
|
703 |
respectfulness property at the point where the constant is |
|
704 |
defined, similar to lift_definition; INCOMPATIBILITY. |
|
705 |
||
706 |
- Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems |
|
707 |
accordingly, INCOMPATIBILITY. |
|
708 |
||
709 |
* New diagnostic command 'find_unused_assms' to find potentially |
|
710 |
superfluous assumptions in theorems using Quickcheck. |
|
711 |
||
712 |
* Quickcheck: |
|
713 |
||
714 |
- Quickcheck returns variable assignments as counterexamples, which |
|
715 |
allows to reveal the underspecification of functions under test. |
|
716 |
For example, refuting "hd xs = x", it presents the variable |
|
717 |
assignment xs = [] and x = a1 as a counterexample, assuming that |
|
718 |
any property is false whenever "hd []" occurs in it. |
|
719 |
||
720 |
These counterexample are marked as potentially spurious, as |
|
721 |
Quickcheck also returns "xs = []" as a counterexample to the |
|
722 |
obvious theorem "hd xs = hd xs". |
|
723 |
||
724 |
After finding a potentially spurious counterexample, Quickcheck |
|
725 |
continues searching for genuine ones. |
|
726 |
||
727 |
By default, Quickcheck shows potentially spurious and genuine |
|
728 |
counterexamples. The option "genuine_only" sets quickcheck to only |
|
729 |
show genuine counterexamples. |
|
730 |
||
731 |
- The command 'quickcheck_generator' creates random and exhaustive |
|
732 |
value generators for a given type and operations. |
|
733 |
||
734 |
It generates values by using the operations as if they were |
|
735 |
constructors of that type. |
|
736 |
||
737 |
- Support for multisets. |
|
738 |
||
739 |
- Added "use_subtype" options. |
|
740 |
||
741 |
- Added "quickcheck_locale" configuration to specify how to process |
|
742 |
conjectures in a locale context. |
|
743 |
||
47855 | 744 |
* Nitpick: Fixed infinite loop caused by the 'peephole_optim' option |
745 |
and affecting 'rat' and 'real'. |
|
47809 | 746 |
|
747 |
* Sledgehammer: |
|
748 |
- Integrated more tightly with SPASS, as described in the ITP 2012 |
|
749 |
paper "More SPASS with Isabelle". |
|
750 |
- Made it try "smt" as a fallback if "metis" fails or times out. |
|
751 |
- Added support for the following provers: Alt-Ergo (via Why3 and |
|
752 |
TFF1), iProver, iProver-Eq. |
|
753 |
- Sped up the minimizer. |
|
754 |
- Added "lam_trans", "uncurry_aliases", and "minimize" options. |
|
755 |
- Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice"). |
|
756 |
- Renamed "sound" option to "strict". |
|
757 |
||
47855 | 758 |
* Metis: Added possibility to specify lambda translations scheme as a |
759 |
parenthesized argument (e.g., "by (metis (lifting) ...)"). |
|
760 |
||
761 |
* SMT: Renamed "smt_fixed" option to "smt_read_only_certificates". |
|
762 |
||
763 |
* Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY. |
|
47809 | 764 |
|
47856 | 765 |
* New "case_product" attribute to generate a case rule doing multiple |
766 |
case distinctions at the same time. E.g. |
|
767 |
||
768 |
list.exhaust [case_product nat.exhaust] |
|
769 |
||
770 |
produces a rule which can be used to perform case distinction on both |
|
771 |
a list and a nat. |
|
772 |
||
47809 | 773 |
* New "eventually_elim" method as a generalized variant of the |
47855 | 774 |
eventually_elim* rules. Supports structured proofs. |
775 |
||
47702
5f9ce06f281e
typedef with implicit set definition is considered legacy;
wenzelm
parents:
47694
diff
changeset
|
776 |
* Typedef with implicit set definition is considered legacy. Use |
5f9ce06f281e
typedef with implicit set definition is considered legacy;
wenzelm
parents:
47694
diff
changeset
|
777 |
"typedef (open)" form instead, which will eventually become the |
5f9ce06f281e
typedef with implicit set definition is considered legacy;
wenzelm
parents:
47694
diff
changeset
|
778 |
default. |
5f9ce06f281e
typedef with implicit set definition is considered legacy;
wenzelm
parents:
47694
diff
changeset
|
779 |
|
47856 | 780 |
* Record: code generation can be switched off manually with |
781 |
||
782 |
declare [[record_coden = false]] -- "default true" |
|
783 |
||
784 |
* Datatype: type parameters allow explicit sort constraints. |
|
785 |
||
47855 | 786 |
* Concrete syntax for case expressions includes constraints for source |
787 |
positions, and thus produces Prover IDE markup for its bindings. |
|
788 |
INCOMPATIBILITY for old-style syntax translations that augment the |
|
789 |
pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of |
|
790 |
one_case. |
|
791 |
||
792 |
* Clarified attribute "mono_set": pure declaration without modifying |
|
793 |
the result of the fact expression. |
|
794 |
||
46752
e9e7209eb375
more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset
|
795 |
* More default pred/set conversions on a couple of relation operations |
47464 | 796 |
and predicates. Added powers of predicate relations. Consolidation |
797 |
of some relation theorems: |
|
46752
e9e7209eb375
more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset
|
798 |
|
e9e7209eb375
more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset
|
799 |
converse_def ~> converse_unfold |
47549 | 800 |
rel_comp_def ~> relcomp_unfold |
47820 | 801 |
symp_def ~> (modified, use symp_def and sym_def instead) |
46752
e9e7209eb375
more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset
|
802 |
transp_def ~> transp_trans |
e9e7209eb375
more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset
|
803 |
Domain_def ~> Domain_unfold |
e9e7209eb375
more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset
|
804 |
Range_def ~> Domain_converse [symmetric] |
e9e7209eb375
more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset
|
805 |
|
46981 | 806 |
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. |
807 |
||
47464 | 808 |
See theory "Relation" for examples for making use of pred/set |
809 |
conversions by means of attributes "to_set" and "to_pred". |
|
47086 | 810 |
|
46752
e9e7209eb375
more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset
|
811 |
INCOMPATIBILITY. |
e9e7209eb375
more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset
|
812 |
|
46363 | 813 |
* Renamed facts about the power operation on relations, i.e., relpow |
47464 | 814 |
to match the constant's name: |
47463 | 815 |
|
46458 | 816 |
rel_pow_1 ~> relpow_1 |
46363 | 817 |
rel_pow_0_I ~> relpow_0_I |
818 |
rel_pow_Suc_I ~> relpow_Suc_I |
|
819 |
rel_pow_Suc_I2 ~> relpow_Suc_I2 |
|
820 |
rel_pow_0_E ~> relpow_0_E |
|
821 |
rel_pow_Suc_E ~> relpow_Suc_E |
|
822 |
rel_pow_E ~> relpow_E |
|
46458 | 823 |
rel_pow_Suc_D2 ~> relpow_Suc_D2 |
47463 | 824 |
rel_pow_Suc_E2 ~> relpow_Suc_E2 |
46363 | 825 |
rel_pow_Suc_D2' ~> relpow_Suc_D2' |
826 |
rel_pow_E2 ~> relpow_E2 |
|
827 |
rel_pow_add ~> relpow_add |
|
828 |
rel_pow_commute ~> relpow |
|
829 |
rel_pow_empty ~> relpow_empty: |
|
830 |
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow |
|
831 |
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl |
|
832 |
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow |
|
833 |
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow |
|
834 |
rel_pow_fun_conv ~> relpow_fun_conv |
|
835 |
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 |
|
836 |
rel_pow_finite_bounded ~> relpow_finite_bounded |
|
837 |
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow |
|
838 |
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow |
|
839 |
single_valued_rel_pow ~> single_valued_relpow |
|
47463 | 840 |
|
46363 | 841 |
INCOMPATIBILITY. |
842 |
||
47448 | 843 |
* Theory Relation: Consolidated constant name for relation composition |
47464 | 844 |
and corresponding theorem names: |
845 |
||
47549 | 846 |
- Renamed constant rel_comp to relcomp. |
47464 | 847 |
|
47448 | 848 |
- Dropped abbreviation pred_comp. Use relcompp instead. |
47464 | 849 |
|
47448 | 850 |
- Renamed theorems: |
47464 | 851 |
|
47448 | 852 |
rel_compI ~> relcompI |
853 |
rel_compEpair ~> relcompEpair |
|
854 |
rel_compE ~> relcompE |
|
855 |
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq |
|
856 |
rel_comp_empty1 ~> relcomp_empty1 |
|
857 |
rel_comp_mono ~> relcomp_mono |
|
858 |
rel_comp_subset_Sigma ~> relcomp_subset_Sigma |
|
859 |
rel_comp_distrib ~> relcomp_distrib |
|
860 |
rel_comp_distrib2 ~> relcomp_distrib2 |
|
861 |
rel_comp_UNION_distrib ~> relcomp_UNION_distrib |
|
862 |
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 |
|
863 |
single_valued_rel_comp ~> single_valued_relcomp |
|
47549 | 864 |
rel_comp_def ~> relcomp_unfold |
47448 | 865 |
converse_rel_comp ~> converse_relcomp |
866 |
pred_compI ~> relcomppI |
|
867 |
pred_compE ~> relcomppE |
|
868 |
pred_comp_bot1 ~> relcompp_bot1 |
|
869 |
pred_comp_bot2 ~> relcompp_bot2 |
|
870 |
transp_pred_comp_less_eq ~> transp_relcompp_less_eq |
|
871 |
pred_comp_mono ~> relcompp_mono |
|
872 |
pred_comp_distrib ~> relcompp_distrib |
|
873 |
pred_comp_distrib2 ~> relcompp_distrib2 |
|
874 |
converse_pred_comp ~> converse_relcompp |
|
47464 | 875 |
|
47448 | 876 |
finite_rel_comp ~> finite_relcomp |
47464 | 877 |
|
47448 | 878 |
set_rel_comp ~> set_relcomp |
879 |
||
880 |
INCOMPATIBILITY. |
|
881 |
||
47550 | 882 |
* Theory Divides: Discontinued redundant theorems about div and mod. |
883 |
INCOMPATIBILITY, use the corresponding generic theorems instead. |
|
884 |
||
885 |
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 |
|
886 |
zdiv_self ~> div_self |
|
887 |
zmod_self ~> mod_self |
|
888 |
zdiv_zero ~> div_0 |
|
889 |
zmod_zero ~> mod_0 |
|
890 |
zdiv_zmod_equality ~> div_mod_equality2 |
|
891 |
zdiv_zmod_equality2 ~> div_mod_equality |
|
892 |
zmod_zdiv_trivial ~> mod_div_trivial |
|
893 |
zdiv_zminus_zminus ~> div_minus_minus |
|
894 |
zmod_zminus_zminus ~> mod_minus_minus |
|
895 |
zdiv_zminus2 ~> div_minus_right |
|
896 |
zmod_zminus2 ~> mod_minus_right |
|
897 |
zdiv_minus1_right ~> div_minus1_right |
|
898 |
zmod_minus1_right ~> mod_minus1_right |
|
899 |
zdvd_mult_div_cancel ~> dvd_mult_div_cancel |
|
900 |
zmod_zmult1_eq ~> mod_mult_right_eq |
|
901 |
zpower_zmod ~> power_mod |
|
902 |
zdvd_zmod ~> dvd_mod |
|
903 |
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd |
|
904 |
mod_mult_distrib ~> mult_mod_left |
|
905 |
mod_mult_distrib2 ~> mult_mod_right |
|
906 |
||
907 |
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use |
|
908 |
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. |
|
909 |
||
47551 | 910 |
* Finite_Set.fold now qualified. INCOMPATIBILITY. |
911 |
||
47552 | 912 |
* Consolidated theorem names concerning fold combinators: |
47550 | 913 |
|
914 |
inf_INFI_fold_inf ~> inf_INF_fold_inf |
|
915 |
sup_SUPR_fold_sup ~> sup_SUP_fold_sup |
|
916 |
INFI_fold_inf ~> INF_fold_inf |
|
917 |
SUPR_fold_sup ~> SUP_fold_sup |
|
918 |
union_set ~> union_set_fold |
|
919 |
minus_set ~> minus_set_fold |
|
920 |
INFI_set_fold ~> INF_set_fold |
|
921 |
SUPR_set_fold ~> SUP_set_fold |
|
922 |
INF_code ~> INF_set_foldr |
|
923 |
SUP_code ~> SUP_set_foldr |
|
924 |
foldr.simps ~> foldr.simps (in point-free formulation) |
|
925 |
foldr_fold_rev ~> foldr_conv_fold |
|
926 |
foldl_fold ~> foldl_conv_fold |
|
927 |
foldr_foldr ~> foldr_conv_foldl |
|
928 |
foldl_foldr ~> foldl_conv_foldr |
|
47552 | 929 |
fold_set_remdups ~> fold_set_fold_remdups |
930 |
fold_set ~> fold_set_fold |
|
931 |
fold1_set ~> fold1_set_fold |
|
47550 | 932 |
|
933 |
INCOMPATIBILITY. |
|
934 |
||
935 |
* Dropped rarely useful theorems concerning fold combinators: |
|
936 |
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, |
|
937 |
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, |
|
938 |
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, |
|
939 |
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, |
|
940 |
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, |
|
941 |
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. |
|
942 |
INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0" |
|
943 |
and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be |
|
944 |
useful to boil down "List.foldr" and "List.foldl" to "List.fold" by |
|
945 |
unfolding "foldr_conv_fold" and "foldl_conv_fold". |
|
946 |
||
947 |
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, |
|
948 |
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, |
|
949 |
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, |
|
950 |
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding |
|
951 |
lemmas over fold rather than foldr, or make use of lemmas |
|
952 |
fold_conv_foldr and fold_rev. |
|
953 |
||
954 |
* Congruence rules Option.map_cong and Option.bind_cong for recursion |
|
955 |
through option types. |
|
956 |
||
47856 | 957 |
* "Transitive_Closure.ntrancl": bounded transitive closure on |
958 |
relations. |
|
959 |
||
960 |
* Constant "Set.not_member" now qualified. INCOMPATIBILITY. |
|
961 |
||
962 |
* Theory Int: Discontinued many legacy theorems specific to type int. |
|
963 |
INCOMPATIBILITY, use the corresponding generic theorems instead. |
|
964 |
||
965 |
zminus_zminus ~> minus_minus |
|
966 |
zminus_0 ~> minus_zero |
|
967 |
zminus_zadd_distrib ~> minus_add_distrib |
|
968 |
zadd_commute ~> add_commute |
|
969 |
zadd_assoc ~> add_assoc |
|
970 |
zadd_left_commute ~> add_left_commute |
|
971 |
zadd_ac ~> add_ac |
|
972 |
zmult_ac ~> mult_ac |
|
973 |
zadd_0 ~> add_0_left |
|
974 |
zadd_0_right ~> add_0_right |
|
975 |
zadd_zminus_inverse2 ~> left_minus |
|
976 |
zmult_zminus ~> mult_minus_left |
|
977 |
zmult_commute ~> mult_commute |
|
978 |
zmult_assoc ~> mult_assoc |
|
979 |
zadd_zmult_distrib ~> left_distrib |
|
980 |
zadd_zmult_distrib2 ~> right_distrib |
|
981 |
zdiff_zmult_distrib ~> left_diff_distrib |
|
982 |
zdiff_zmult_distrib2 ~> right_diff_distrib |
|
983 |
zmult_1 ~> mult_1_left |
|
984 |
zmult_1_right ~> mult_1_right |
|
985 |
zle_refl ~> order_refl |
|
986 |
zle_trans ~> order_trans |
|
987 |
zle_antisym ~> order_antisym |
|
988 |
zle_linear ~> linorder_linear |
|
989 |
zless_linear ~> linorder_less_linear |
|
990 |
zadd_left_mono ~> add_left_mono |
|
991 |
zadd_strict_right_mono ~> add_strict_right_mono |
|
992 |
zadd_zless_mono ~> add_less_le_mono |
|
993 |
int_0_less_1 ~> zero_less_one |
|
994 |
int_0_neq_1 ~> zero_neq_one |
|
995 |
zless_le ~> less_le |
|
996 |
zpower_zadd_distrib ~> power_add |
|
997 |
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff |
|
998 |
zero_le_zpower_abs ~> zero_le_power_abs |
|
999 |
||
1000 |
* Theory Deriv: Renamed |
|
1001 |
||
1002 |
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing |
|
1003 |
||
1004 |
* Theory Library/Multiset: Improved code generation of multisets. |
|
1005 |
||
47855 | 1006 |
* Theory HOL/Library/Set_Algebras: Addition and multiplication on sets |
47703 | 1007 |
are expressed via type classes again. The special syntax |
1008 |
\<oplus>/\<otimes> has been replaced by plain +/*. Removed constant |
|
1009 |
setsum_set, which is now subsumed by Big_Operators.setsum. |
|
1010 |
INCOMPATIBILITY. |
|
1011 |
||
46160 | 1012 |
* Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY, |
1013 |
use theory HOL/Library/Nat_Bijection instead. |
|
1014 |
||
47464 | 1015 |
* Theory HOL/Library/RBT_Impl: Backing implementation of red-black |
1016 |
trees is now inside a type class context. Names of affected |
|
1017 |
operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for |
|
1018 |
theories working directly with raw red-black trees, adapt the names as |
|
1019 |
follows: |
|
47452 | 1020 |
|
1021 |
Operations: |
|
1022 |
bulkload -> rbt_bulkload |
|
1023 |
del_from_left -> rbt_del_from_left |
|
1024 |
del_from_right -> rbt_del_from_right |
|
1025 |
del -> rbt_del |
|
1026 |
delete -> rbt_delete |
|
1027 |
ins -> rbt_ins |
|
1028 |
insert -> rbt_insert |
|
1029 |
insertw -> rbt_insert_with |
|
1030 |
insert_with_key -> rbt_insert_with_key |
|
1031 |
map_entry -> rbt_map_entry |
|
1032 |
lookup -> rbt_lookup |
|
1033 |
sorted -> rbt_sorted |
|
1034 |
tree_greater -> rbt_greater |
|
1035 |
tree_less -> rbt_less |
|
1036 |
tree_less_symbol -> rbt_less_symbol |
|
1037 |
union -> rbt_union |
|
1038 |
union_with -> rbt_union_with |
|
1039 |
union_with_key -> rbt_union_with_key |
|
1040 |
||
1041 |
Lemmas: |
|
1042 |
balance_left_sorted -> balance_left_rbt_sorted |
|
1043 |
balance_left_tree_greater -> balance_left_rbt_greater |
|
1044 |
balance_left_tree_less -> balance_left_rbt_less |
|
1045 |
balance_right_sorted -> balance_right_rbt_sorted |
|
1046 |
balance_right_tree_greater -> balance_right_rbt_greater |
|
1047 |
balance_right_tree_less -> balance_right_rbt_less |
|
1048 |
balance_sorted -> balance_rbt_sorted |
|
1049 |
balance_tree_greater -> balance_rbt_greater |
|
1050 |
balance_tree_less -> balance_rbt_less |
|
1051 |
bulkload_is_rbt -> rbt_bulkload_is_rbt |
|
1052 |
combine_sorted -> combine_rbt_sorted |
|
1053 |
combine_tree_greater -> combine_rbt_greater |
|
1054 |
combine_tree_less -> combine_rbt_less |
|
1055 |
delete_in_tree -> rbt_delete_in_tree |
|
1056 |
delete_is_rbt -> rbt_delete_is_rbt |
|
1057 |
del_from_left_tree_greater -> rbt_del_from_left_rbt_greater |
|
1058 |
del_from_left_tree_less -> rbt_del_from_left_rbt_less |
|
1059 |
del_from_right_tree_greater -> rbt_del_from_right_rbt_greater |
|
1060 |
del_from_right_tree_less -> rbt_del_from_right_rbt_less |
|
1061 |
del_in_tree -> rbt_del_in_tree |
|
1062 |
del_inv1_inv2 -> rbt_del_inv1_inv2 |
|
1063 |
del_sorted -> rbt_del_rbt_sorted |
|
1064 |
del_tree_greater -> rbt_del_rbt_greater |
|
1065 |
del_tree_less -> rbt_del_rbt_less |
|
1066 |
dom_lookup_Branch -> dom_rbt_lookup_Branch |
|
1067 |
entries_lookup -> entries_rbt_lookup |
|
1068 |
finite_dom_lookup -> finite_dom_rbt_lookup |
|
1069 |
insert_sorted -> rbt_insert_rbt_sorted |
|
1070 |
insertw_is_rbt -> rbt_insertw_is_rbt |
|
1071 |
insertwk_is_rbt -> rbt_insertwk_is_rbt |
|
1072 |
insertwk_sorted -> rbt_insertwk_rbt_sorted |
|
1073 |
insertw_sorted -> rbt_insertw_rbt_sorted |
|
1074 |
ins_sorted -> ins_rbt_sorted |
|
1075 |
ins_tree_greater -> ins_rbt_greater |
|
1076 |
ins_tree_less -> ins_rbt_less |
|
1077 |
is_rbt_sorted -> is_rbt_rbt_sorted |
|
1078 |
lookup_balance -> rbt_lookup_balance |
|
1079 |
lookup_bulkload -> rbt_lookup_rbt_bulkload |
|
1080 |
lookup_delete -> rbt_lookup_rbt_delete |
|
1081 |
lookup_Empty -> rbt_lookup_Empty |
|
1082 |
lookup_from_in_tree -> rbt_lookup_from_in_tree |
|
1083 |
lookup_in_tree -> rbt_lookup_in_tree |
|
1084 |
lookup_ins -> rbt_lookup_ins |
|
1085 |
lookup_insert -> rbt_lookup_rbt_insert |
|
1086 |
lookup_insertw -> rbt_lookup_rbt_insertw |
|
1087 |
lookup_insertwk -> rbt_lookup_rbt_insertwk |
|
1088 |
lookup_keys -> rbt_lookup_keys |
|
1089 |
lookup_map -> rbt_lookup_map |
|
1090 |
lookup_map_entry -> rbt_lookup_rbt_map_entry |
|
1091 |
lookup_tree_greater -> rbt_lookup_rbt_greater |
|
1092 |
lookup_tree_less -> rbt_lookup_rbt_less |
|
1093 |
lookup_union -> rbt_lookup_rbt_union |
|
1094 |
map_entry_color_of -> rbt_map_entry_color_of |
|
1095 |
map_entry_inv1 -> rbt_map_entry_inv1 |
|
1096 |
map_entry_inv2 -> rbt_map_entry_inv2 |
|
1097 |
map_entry_is_rbt -> rbt_map_entry_is_rbt |
|
1098 |
map_entry_sorted -> rbt_map_entry_rbt_sorted |
|
1099 |
map_entry_tree_greater -> rbt_map_entry_rbt_greater |
|
1100 |
map_entry_tree_less -> rbt_map_entry_rbt_less |
|
1101 |
map_tree_greater -> map_rbt_greater |
|
1102 |
map_tree_less -> map_rbt_less |
|
1103 |
map_sorted -> map_rbt_sorted |
|
1104 |
paint_sorted -> paint_rbt_sorted |
|
1105 |
paint_lookup -> paint_rbt_lookup |
|
1106 |
paint_tree_greater -> paint_rbt_greater |
|
1107 |
paint_tree_less -> paint_rbt_less |
|
1108 |
sorted_entries -> rbt_sorted_entries |
|
1109 |
tree_greater_eq_trans -> rbt_greater_eq_trans |
|
1110 |
tree_greater_nit -> rbt_greater_nit |
|
1111 |
tree_greater_prop -> rbt_greater_prop |
|
1112 |
tree_greater_simps -> rbt_greater_simps |
|
1113 |
tree_greater_trans -> rbt_greater_trans |
|
1114 |
tree_less_eq_trans -> rbt_less_eq_trans |
|
1115 |
tree_less_nit -> rbt_less_nit |
|
1116 |
tree_less_prop -> rbt_less_prop |
|
1117 |
tree_less_simps -> rbt_less_simps |
|
1118 |
tree_less_trans -> rbt_less_trans |
|
1119 |
tree_ord_props -> rbt_ord_props |
|
1120 |
union_Branch -> rbt_union_Branch |
|
1121 |
union_is_rbt -> rbt_union_is_rbt |
|
1122 |
unionw_is_rbt -> rbt_unionw_is_rbt |
|
1123 |
unionwk_is_rbt -> rbt_unionwk_is_rbt |
|
1124 |
unionwk_sorted -> rbt_unionwk_rbt_sorted |
|
1125 |
||
47807 | 1126 |
* Theory HOL/Library/Float: Floating point numbers are now defined as |
1127 |
a subset of the real numbers. All operations are defined using the |
|
1128 |
lifing-framework and proofs use the transfer method. INCOMPATIBILITY. |
|
47616 | 1129 |
|
1130 |
Changed Operations: |
|
47622 | 1131 |
float_abs -> abs |
1132 |
float_nprt -> nprt |
|
1133 |
float_pprt -> pprt |
|
1134 |
pow2 -> use powr |
|
1135 |
round_down -> float_round_down |
|
1136 |
round_up -> float_round_up |
|
1137 |
scale -> exponent |
|
1138 |
||
1139 |
Removed Operations: |
|
1140 |
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod |
|
1141 |
||
1142 |
Renamed Lemmas: |
|
1143 |
abs_float_def -> Float.compute_float_abs |
|
1144 |
bitlen_ge0 -> bitlen_nonneg |
|
1145 |
bitlen.simps -> Float.compute_bitlen |
|
1146 |
float_components -> Float_mantissa_exponent |
|
1147 |
float_divl.simps -> Float.compute_float_divl |
|
1148 |
float_divr.simps -> Float.compute_float_divr |
|
1149 |
float_eq_odd -> mult_powr_eq_mult_powr_iff |
|
1150 |
float_power -> real_of_float_power |
|
1151 |
lapprox_posrat_def -> Float.compute_lapprox_posrat |
|
1152 |
lapprox_rat.simps -> Float.compute_lapprox_rat |
|
1153 |
le_float_def' -> Float.compute_float_le |
|
1154 |
le_float_def -> less_eq_float.rep_eq |
|
1155 |
less_float_def' -> Float.compute_float_less |
|
1156 |
less_float_def -> less_float.rep_eq |
|
1157 |
normfloat_def -> Float.compute_normfloat |
|
1158 |
normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0 |
|
1159 |
normfloat -> normfloat_def |
|
1160 |
normfloat_unique -> use normfloat_def |
|
1161 |
number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral |
|
1162 |
one_float_def -> Float.compute_float_one |
|
1163 |
plus_float_def -> Float.compute_float_plus |
|
1164 |
rapprox_posrat_def -> Float.compute_rapprox_posrat |
|
1165 |
rapprox_rat.simps -> Float.compute_rapprox_rat |
|
1166 |
real_of_float_0 -> zero_float.rep_eq |
|
1167 |
real_of_float_1 -> one_float.rep_eq |
|
1168 |
real_of_float_abs -> abs_float.rep_eq |
|
1169 |
real_of_float_add -> plus_float.rep_eq |
|
1170 |
real_of_float_minus -> uminus_float.rep_eq |
|
1171 |
real_of_float_mult -> times_float.rep_eq |
|
1172 |
real_of_float_simp -> Float.rep_eq |
|
1173 |
real_of_float_sub -> minus_float.rep_eq |
|
1174 |
round_down.simps -> Float.compute_float_round_down |
|
1175 |
round_up.simps -> Float.compute_float_round_up |
|
1176 |
times_float_def -> Float.compute_float_times |
|
1177 |
uminus_float_def -> Float.compute_float_uminus |
|
1178 |
zero_float_def -> Float.compute_float_zero |
|
1179 |
||
1180 |
Lemmas not necessary anymore, use the transfer method: |
|
1181 |
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, |
|
1182 |
float_divr, float_le_simp, float_less1_mantissa_bound, |
|
1183 |
float_less_simp, float_less_zero, float_le_zero, |
|
1184 |
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, |
|
1185 |
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, |
|
1186 |
lapprox_rat_bottom, normalized_float, rapprox_posrat, |
|
1187 |
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, |
|
1188 |
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, |
|
1189 |
round_up, zero_le_float, zero_less_float |
|
47616 | 1190 |
|
47856 | 1191 |
* New theory HOL/Library/DAList provides an abstract type for |
1192 |
association lists with distinct keys. |
|
45791 | 1193 |
|
47866 | 1194 |
* Session HOL/IMP: Added new theory of abstract interpretation of |
1195 |
annotated commands. |
|
1196 |
||
47855 | 1197 |
* Session HOL-Import: Re-implementation from scratch is faster, |
1198 |
simpler, and more scalable. Requires a proof bundle, which is |
|
1199 |
available as an external component. Discontinued old (and mostly |
|
1200 |
dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY. |
|
1201 |
||
1202 |
* Session HOL-Word: Discontinued many redundant theorems specific to |
|
1203 |
type 'a word. INCOMPATIBILITY, use the corresponding generic theorems |
|
1204 |
instead. |
|
1205 |
||
1206 |
word_sub_alt ~> word_sub_wi |
|
1207 |
word_add_alt ~> word_add_def |
|
1208 |
word_mult_alt ~> word_mult_def |
|
1209 |
word_minus_alt ~> word_minus_def |
|
1210 |
word_0_alt ~> word_0_wi |
|
1211 |
word_1_alt ~> word_1_wi |
|
1212 |
word_add_0 ~> add_0_left |
|
1213 |
word_add_0_right ~> add_0_right |
|
1214 |
word_mult_1 ~> mult_1_left |
|
1215 |
word_mult_1_right ~> mult_1_right |
|
1216 |
word_add_commute ~> add_commute |
|
1217 |
word_add_assoc ~> add_assoc |
|
1218 |
word_add_left_commute ~> add_left_commute |
|
1219 |
word_mult_commute ~> mult_commute |
|
1220 |
word_mult_assoc ~> mult_assoc |
|
1221 |
word_mult_left_commute ~> mult_left_commute |
|
1222 |
word_left_distrib ~> left_distrib |
|
1223 |
word_right_distrib ~> right_distrib |
|
1224 |
word_left_minus ~> left_minus |
|
1225 |
word_diff_0_right ~> diff_0_right |
|
1226 |
word_diff_self ~> diff_self |
|
1227 |
word_sub_def ~> diff_minus |
|
1228 |
word_diff_minus ~> diff_minus |
|
1229 |
word_add_ac ~> add_ac |
|
1230 |
word_mult_ac ~> mult_ac |
|
1231 |
word_plus_ac0 ~> add_0_left add_0_right add_ac |
|
1232 |
word_times_ac1 ~> mult_1_left mult_1_right mult_ac |
|
1233 |
word_order_trans ~> order_trans |
|
1234 |
word_order_refl ~> order_refl |
|
1235 |
word_order_antisym ~> order_antisym |
|
1236 |
word_order_linear ~> linorder_linear |
|
1237 |
lenw1_zero_neq_one ~> zero_neq_one |
|
1238 |
word_number_of_eq ~> number_of_eq |
|
1239 |
word_of_int_add_hom ~> wi_hom_add |
|
1240 |
word_of_int_sub_hom ~> wi_hom_sub |
|
1241 |
word_of_int_mult_hom ~> wi_hom_mult |
|
1242 |
word_of_int_minus_hom ~> wi_hom_neg |
|
1243 |
word_of_int_succ_hom ~> wi_hom_succ |
|
1244 |
word_of_int_pred_hom ~> wi_hom_pred |
|
1245 |
word_of_int_0_hom ~> word_0_wi |
|
1246 |
word_of_int_1_hom ~> word_1_wi |
|
1247 |
||
47809 | 1248 |
* Session HOL-Word: New proof method "word_bitwise" for splitting |
1249 |
machine word equalities and inequalities into logical circuits, |
|
1250 |
defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction, |
|
1251 |
multiplication, shifting by constants, bitwise operators and numeric |
|
1252 |
constants. Requires fixed-length word types, not 'a word. Solves |
|
47854 | 1253 |
many standard word identities outright and converts more into first |
47809 | 1254 |
order problems amenable to blast or similar. See also examples in |
1255 |
HOL/Word/Examples/WordExamples.thy. |
|
1256 |
||
47807 | 1257 |
* Session HOL-Probability: Introduced the type "'a measure" to |
1258 |
represent measures, this replaces the records 'a algebra and 'a |
|
1259 |
measure_space. The locales based on subset_class now have two |
|
47856 | 1260 |
locale-parameters the space \<Omega> and the set of measurable sets M. |
1261 |
The product of probability spaces uses now the same constant as the |
|
1262 |
finite product of sigma-finite measure spaces "PiM :: ('i => 'a) |
|
47807 | 1263 |
measure". Most constants are defined now outside of locales and gain |
1264 |
an additional parameter, like null_sets, almost_eventually or \<mu>'. |
|
1265 |
Measure space constructions for distributions and densities now got |
|
1266 |
their own constants distr and density. Instead of using locales to |
|
1267 |
describe measure spaces with a finite space, the measure count_space |
|
1268 |
and point_measure is introduced. INCOMPATIBILITY. |
|
47694 | 1269 |
|
1270 |
Renamed constants: |
|
1271 |
measure -> emeasure |
|
1272 |
finite_measure.\<mu>' -> measure |
|
1273 |
product_algebra_generator -> prod_algebra |
|
1274 |
product_prob_space.emb -> prod_emb |
|
1275 |
product_prob_space.infprod_algebra -> PiM |
|
1276 |
||
1277 |
Removed locales: |
|
1278 |
completeable_measure_space |
|
1279 |
finite_measure_space |
|
1280 |
finite_prob_space |
|
1281 |
finite_product_finite_prob_space |
|
1282 |
finite_product_sigma_algebra |
|
1283 |
finite_sigma_algebra |
|
1284 |
measure_space |
|
1285 |
pair_finite_prob_space |
|
1286 |
pair_finite_sigma_algebra |
|
1287 |
pair_finite_space |
|
1288 |
pair_sigma_algebra |
|
1289 |
product_sigma_algebra |
|
1290 |
||
1291 |
Removed constants: |
|
47751 | 1292 |
conditional_space |
47694 | 1293 |
distribution -> use distr measure, or distributed predicate |
47751 | 1294 |
image_space |
47694 | 1295 |
joint_distribution -> use distr measure, or distributed predicate |
47751 | 1296 |
pair_measure_generator |
47694 | 1297 |
product_prob_space.infprod_algebra -> use PiM |
1298 |
subvimage |
|
1299 |
||
1300 |
Replacement theorems: |
|
47751 | 1301 |
finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite |
1302 |
finite_measure.empty_measure -> measure_empty |
|
1303 |
finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq |
|
1304 |
finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq |
|
1305 |
finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably |
|
1306 |
finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure |
|
1307 |
finite_measure.finite_measure -> finite_measure.emeasure_finite |
|
1308 |
finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton |
|
1309 |
finite_measure.positive_measure' -> measure_nonneg |
|
1310 |
finite_measure.real_measure -> finite_measure.emeasure_real |
|
1311 |
finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb |
|
1312 |
finite_product_sigma_algebra.in_P -> sets_PiM_I_finite |
|
1313 |
finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty |
|
1314 |
information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed |
|
1315 |
information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple |
|
1316 |
information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple |
|
1317 |
information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple |
|
1318 |
information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple |
|
1319 |
information_space.entropy_commute -> information_space.entropy_commute_simple |
|
1320 |
information_space.entropy_eq -> information_space.entropy_simple_distributed |
|
1321 |
information_space.entropy_generic_eq -> information_space.entropy_simple_distributed |
|
1322 |
information_space.entropy_positive -> information_space.entropy_nonneg_simple |
|
1323 |
information_space.entropy_uniform_max -> information_space.entropy_uniform |
|
1324 |
information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq |
|
1325 |
information_space.KL_eq_0 -> information_space.KL_same_eq_0 |
|
1326 |
information_space.KL_ge_0 -> information_space.KL_nonneg |
|
1327 |
information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed |
|
1328 |
information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple |
|
1329 |
Int_stable_cuboids -> Int_stable_atLeastAtMost |
|
1330 |
Int_stable_product_algebra_generator -> positive_integral |
|
1331 |
measure_preserving -> equality "distr M N f = N" "f : measurable M N" |
|
47694 | 1332 |
measure_space.additive -> emeasure_additive |
47751 | 1333 |
measure_space.AE_iff_null_set -> AE_iff_null |
1334 |
measure_space.almost_everywhere_def -> eventually_ae_filter |
|
1335 |
measure_space.almost_everywhere_vimage -> AE_distrD |
|
1336 |
measure_space.continuity_from_above -> INF_emeasure_decseq |
|
1337 |
measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq |
|
1338 |
measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq |
|
47694 | 1339 |
measure_space.continuity_from_below -> SUP_emeasure_incseq |
47751 | 1340 |
measure_space_density -> emeasure_density |
1341 |
measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density |
|
1342 |
measure_space.integrable_vimage -> integrable_distr |
|
1343 |
measure_space.integral_translated_density -> integral_density |
|
1344 |
measure_space.integral_vimage -> integral_distr |
|
1345 |
measure_space.measure_additive -> plus_emeasure |
|
1346 |
measure_space.measure_compl -> emeasure_compl |
|
1347 |
measure_space.measure_countable_increasing -> emeasure_countable_increasing |
|
1348 |
measure_space.measure_countably_subadditive -> emeasure_subadditive_countably |
|
47694 | 1349 |
measure_space.measure_decseq -> decseq_emeasure |
47751 | 1350 |
measure_space.measure_Diff -> emeasure_Diff |
1351 |
measure_space.measure_Diff_null_set -> emeasure_Diff_null_set |
|
47694 | 1352 |
measure_space.measure_eq_0 -> emeasure_eq_0 |
1353 |
measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite |
|
47751 | 1354 |
measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton |
1355 |
measure_space.measure_incseq -> incseq_emeasure |
|
1356 |
measure_space.measure_insert -> emeasure_insert |
|
1357 |
measure_space.measure_mono -> emeasure_mono |
|
1358 |
measure_space.measure_not_negative -> emeasure_not_MInf |
|
1359 |
measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq |
|
1360 |
measure_space.measure_setsum -> setsum_emeasure |
|
1361 |
measure_space.measure_setsum_split -> setsum_emeasure_cover |
|
47694 | 1362 |
measure_space.measure_space_vimage -> emeasure_distr |
47751 | 1363 |
measure_space.measure_subadditive_finite -> emeasure_subadditive_finite |
1364 |
measure_space.measure_subadditive -> subadditive |
|
1365 |
measure_space.measure_top -> emeasure_space |
|
1366 |
measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0 |
|
1367 |
measure_space.measure_Un_null_set -> emeasure_Un_null_set |
|
1368 |
measure_space.positive_integral_translated_density -> positive_integral_density |
|
1369 |
measure_space.positive_integral_vimage -> positive_integral_distr |
|
47694 | 1370 |
measure_space.real_continuity_from_above -> Lim_measure_decseq |
47751 | 1371 |
measure_space.real_continuity_from_below -> Lim_measure_incseq |
47694 | 1372 |
measure_space.real_measure_countably_subadditive -> measure_subadditive_countably |
47751 | 1373 |
measure_space.real_measure_Diff -> measure_Diff |
1374 |
measure_space.real_measure_finite_Union -> measure_finite_Union |
|
1375 |
measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton |
|
1376 |
measure_space.real_measure_subadditive -> measure_subadditive |
|
1377 |
measure_space.real_measure_Union -> measure_Union |
|
1378 |
measure_space.real_measure_UNION -> measure_UNION |
|
47694 | 1379 |
measure_space.simple_function_vimage -> simple_function_comp |
1380 |
measure_space.simple_integral_vimage -> simple_integral_distr |
|
47751 | 1381 |
measure_space.simple_integral_vimage -> simple_integral_distr |
1382 |
measure_unique_Int_stable -> measure_eqI_generator_eq |
|
1383 |
measure_unique_Int_stable_vimage -> measure_eqI_generator_eq |
|
47694 | 1384 |
pair_sigma_algebra.measurable_cut_fst -> sets_Pair1 |
1385 |
pair_sigma_algebra.measurable_cut_snd -> sets_Pair2 |
|
1386 |
pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1 |
|
1387 |
pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2 |
|
1388 |
pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff |
|
1389 |
pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap |
|
1390 |
pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap' |
|
1391 |
pair_sigma_algebra.sets_swap -> sets_pair_swap |
|
47751 | 1392 |
pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1 |
1393 |
pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2 |
|
1394 |
pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap |
|
1395 |
pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2 |
|
1396 |
pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt |
|
1397 |
pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times |
|
1398 |
prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM |
|
1399 |
prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq |
|
47694 | 1400 |
prob_space.measure_space_1 -> prob_space.emeasure_space_1 |
1401 |
prob_space.prob_space_vimage -> prob_space_distr |
|
1402 |
prob_space.random_variable_restrict -> measurable_restrict |
|
47751 | 1403 |
prob_space_unique_Int_stable -> measure_eqI_prob_space |
1404 |
product_algebraE -> prod_algebraE_all |
|
1405 |
product_algebra_generator_der -> prod_algebra_eq_finite |
|
1406 |
product_algebra_generator_into_space -> prod_algebra_sets_into_space |
|
1407 |
product_algebraI -> sets_PiM_I_finite |
|
1408 |
product_measure_exists -> product_sigma_finite.sigma_finite |
|
47694 | 1409 |
product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator |
1410 |
product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb |
|
1411 |
product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty |
|
1412 |
product_prob_space.measurable_component -> measurable_component_singleton |
|
1413 |
product_prob_space.measurable_emb -> measurable_prod_emb |
|
1414 |
product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single |
|
1415 |
product_prob_space.measurable_singleton_infprod -> measurable_component_singleton |
|
1416 |
product_prob_space.measure_emb -> emeasure_prod_emb |
|
47751 | 1417 |
product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict |
1418 |
product_sigma_algebra.product_algebra_into_space -> space_closed |
|
1419 |
product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge |
|
1420 |
product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton |
|
1421 |
product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge |
|
47694 | 1422 |
sequence_space.measure_infprod -> sequence_space.measure_PiM_countable |
47751 | 1423 |
sets_product_algebra -> sets_PiM |
1424 |
sigma_algebra.measurable_sigma -> measurable_measure_of |
|
1425 |
sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint |
|
1426 |
sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr |
|
1427 |
sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq |
|
1428 |
space_product_algebra -> space_PiM |
|
47694 | 1429 |
|
47855 | 1430 |
* Session HOL-TPTP: support to parse and import TPTP problems (all |
1431 |
languages) into Isabelle/HOL. |
|
47413 | 1432 |
|
45398
7dbb7b044a11
avoid infinite recursion in peephole optimizer function -- this had a debilitating effect on rationals and reals
blanchet
parents:
45384
diff
changeset
|
1433 |
|
45160 | 1434 |
*** FOL *** |