author  wenzelm 
Sun, 20 Jan 2013 15:34:27 +0100  
changeset 50994  aafd4270b4d4 
parent 50993  2c3d0cb151c0 
child 51002  496013a6eb38 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

50994  4 
New in this Isabelle version 
5 
 

6 

7 

50993  8 
New in Isabelle2013 (February 2013) 
9 
 

47887  10 

47967
c422128d3889
discontinued obsolete method fastsimp / tactic fast_simp_tac;
wenzelm
parents:
47958
diff
changeset

11 
*** General *** 
c422128d3889
discontinued obsolete method fastsimp / tactic fast_simp_tac;
wenzelm
parents:
47958
diff
changeset

12 

50126
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
50119
diff
changeset

13 
* 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

14 
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

15 
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

16 
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

17 
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

18 
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

19 
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

20 

49699  21 
* Configuration option show_markup controls direct inlining of markup 
22 
into the printed representation of formal entities  notably type 

23 
and sort constraints. This enables Prover IDE users to retrieve that 

24 
information via tooltips in the output window, for example. 

25 

48890
d72ca5742f80
'ML_file' evaluates ML text from a file directly within the theory, without predeclaration via 'uses';
wenzelm
parents:
48844
diff
changeset

26 
* 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

27 
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

28 

49243  29 
* Old command 'use' command and corresponding keyword 'uses' in the 
30 
theory header are legacy features and will be discontinued soon. 

31 
Tools that load their additional source files may imitate the 

32 
'ML_file' implementation, such that the system can take care of 

33 
dependencies properly. 

34 

47967
c422128d3889
discontinued obsolete method fastsimp / tactic fast_simp_tac;
wenzelm
parents:
47958
diff
changeset

35 
* Discontinued obsolete method fastsimp / tactic fast_simp_tac, which 
c422128d3889
discontinued obsolete method fastsimp / tactic fast_simp_tac;
wenzelm
parents:
47958
diff
changeset

36 
is called fastforce / fast_force_tac already since Isabelle20111. 
c422128d3889
discontinued obsolete method fastsimp / tactic fast_simp_tac;
wenzelm
parents:
47958
diff
changeset

37 

50110  38 
* Updated and extended "isarref" and "implementation" manual, reduced 
39 
remaining material in old "ref" manual. 

48120
9fe0e71052a0
updated "isarref" manual, reduced remaining material in "ref" manual.
wenzelm
parents:
48111
diff
changeset

40 

49841  41 
* Improved support for auxiliary contexts indicate block structure for 
42 
specifications: nesting of "context fixes ... context assumes ..." 

43 
and "class ... context ...". 

44 

50772
6973b3f41334
allow negative argument in "consumes" source format;
wenzelm
parents:
50731
diff
changeset

45 
* Attribute "consumes" allows a negative value as well, which is 
50778  46 
interpreted relatively to the total number of premises of the rule in 
50772
6973b3f41334
allow negative argument in "consumes" source format;
wenzelm
parents:
50731
diff
changeset

47 
the target context. This form of declaration is stable when exported 
6973b3f41334
allow negative argument in "consumes" source format;
wenzelm
parents:
50731
diff
changeset

48 
from a nested 'context' with additional assumptions. It is the 
6973b3f41334
allow negative argument in "consumes" source format;
wenzelm
parents:
50731
diff
changeset

49 
preferred form for definitional packages, notably cases/rules produced 
6973b3f41334
allow negative argument in "consumes" source format;
wenzelm
parents:
50731
diff
changeset

50 
in HOL/inductive and HOL/function. 
6973b3f41334
allow negative argument in "consumes" source format;
wenzelm
parents:
50731
diff
changeset

51 

49869
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset

52 
* More informative error messages for Isar proof commands involving 
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset

53 
lazy enumerations (method applications etc.). 
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset

54 

50213  55 
* Refined 'help' command to retrieve outer syntax commands according 
56 
to name patterns (with clickable results). 

57 

47967
c422128d3889
discontinued obsolete method fastsimp / tactic fast_simp_tac;
wenzelm
parents:
47958
diff
changeset

58 

49968  59 
*** Prover IDE  Isabelle/Scala/jEdit *** 
60 

61 
* Parallel terminal proofs ('by') are enabled by default, likewise 

62 
proofs that are built into packages like 'datatype', 'function'. This 

63 
allows to "run ahead" checking the theory specifications on the 

64 
surface, while the prover is still crunching on internal 

65 
justifications. Unfinished / cancelled proofs are restarted as 

66 
required to complete full proof checking eventually. 

67 

68 
* Improved output panel with tooltips, hyperlinks etc. based on the 

69 
same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of 

70 
tooltips leads to some window that supports the same recursively, 

71 
which can lead to stacks of tooltips as the semantic document content 

72 
is explored. ESCAPE closes the whole stack, individual windows may be 

73 
closed separately, or detached to become independent jEdit dockables. 

74 

50717  75 
* Improved support for commands that produce graph output: the text 
76 
message contains a clickable area to open a new instance of the graph 

77 
browser on demand. 

78 

49968  79 
* More robust incremental parsing of outer syntax (partial comments, 
80 
malformed symbols). Changing the balance of open/close quotes and 

81 
comment delimiters works more conveniently with unfinished situations 

82 
that frequently occur in user interaction. 

83 

84 
* More efficient painting and improved reactivity when editing large 

85 
files. More scalable management of formal document content. 

86 

50505
33c92722cc3d
smarter handling of tracing messages: prover process pauses and enters user dialog;
wenzelm
parents:
50455
diff
changeset

87 
* 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

88 
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

89 
dialog to stop or continue. This avoids swamping the frontend with 
50119
5c370a036de7
more generous tracing_limit, with explicit system option;
wenzelm
parents:
50118
diff
changeset

90 
potentially infinite message streams. 
49968  91 

92 
* More plugin options and preferences, based on Isabelle/Scala. The 

93 
jEdit plugin option panel provides access to some Isabelle/Scala 

94 
options, including tuning parameters for editor reactivity and color 

95 
schemes. 

96 

50184  97 
* Dockable window "Symbols" provides some editing support for Isabelle 
98 
symbols. 

99 

50701  100 
* Dockable window "Monitor" shows ML runtime statistics. 
101 

50183  102 
* Improved editing support for control styles: subscript, superscript, 
103 
bold, reset of style  operating on single symbols or text 

50198
0c7b351a6871
added convenience actions isabelle.increasefontsize and isabelle.decreasefontsize;
wenzelm
parents:
50184
diff
changeset

104 
selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT. 
0c7b351a6871
added convenience actions isabelle.increasefontsize and isabelle.decreasefontsize;
wenzelm
parents:
50184
diff
changeset

105 

0c7b351a6871
added convenience actions isabelle.increasefontsize and isabelle.decreasefontsize;
wenzelm
parents:
50184
diff
changeset

106 
* Actions isabelle.increasefontsize and isabelle.decreasefontsize 
0c7b351a6871
added convenience actions isabelle.increasefontsize and isabelle.decreasefontsize;
wenzelm
parents:
50184
diff
changeset

107 
adjust the main text area font size, and its derivatives for output, 
50836  108 
tooltips etc. Cf. keyboard shortcuts CPLUS and CMINUS, which often 
109 
need to be adapted to local keyboard layouts. 

50183  110 

50730  111 
* More reactive completion popup by default: use \t (TAB) instead of 
112 
\n (NEWLINE) to minimize intrusion into regular flow of editing. See 

113 
also "Plugin Options / SideKick / General / Code Completion Options". 

114 

50406
c28753665b8e
documentation for isabelle build_dialog and its implicit use in isabelle jedit;
wenzelm
parents:
50232
diff
changeset

115 
* 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

116 
image. For example, HOL, HOLCF, HOLNominal can be produced on 
c28753665b8e
documentation for isabelle build_dialog and its implicit use in isabelle jedit;
wenzelm
parents:
50232
diff
changeset

117 
demand, without bundling big platformdependent heap images in the 
c28753665b8e
documentation for isabelle build_dialog and its implicit use in isabelle jedit;
wenzelm
parents:
50232
diff
changeset

118 
Isabelle distribution. 
c28753665b8e
documentation for isabelle build_dialog and its implicit use in isabelle jedit;
wenzelm
parents:
50232
diff
changeset

119 

49968  120 
* Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates 
121 
from Oracle provide better multiplatform experience. This version is 

122 
now bundled exclusively with Isabelle. 

123 

124 

48205  125 
*** Pure *** 
126 

48431
6efff142bb54
restrict unqualified imports from Haskell Prelude to a small set of fundamental operations
haftmann
parents:
48428
diff
changeset

127 
* 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

128 
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

129 

50646  130 
* Command 'export_code': relative file names are interpreted 
131 
relatively to master directory of current theory rather than the 

132 
rather arbitrary current working directory. INCOMPATIBILITY. 

48371  133 

48205  134 
* Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY, 
135 
use regular rule composition via "OF" / "THEN", or explicit proof 

136 
structure instead. Note that Isabelle/ML provides a variety of 

137 
operators like COMP, INCR_COMP, COMP_INCR, which need to be applied 

138 
with some care where this is really required. 

139 

48792  140 
* Command 'typ' supports an additional variant with explicit sort 
141 
constraint, to infer and check the most general type conforming to a 

142 
given given sort. Example (in HOL): 

143 

144 
typ "_ * _ * bool * unit" :: finite 

145 

50716  146 
* Command 'locale_deps' visualizes all locales and their relations as 
147 
a Hasse diagram. 

148 

48205  149 

48013
44de84112a67
added optimisation for equational premises in Quickcheck; added some Quickcheck examples; NEWS
bulwahn
parents:
47979
diff
changeset

150 
*** HOL *** 
44de84112a67
added optimisation for equational premises in Quickcheck; added some Quickcheck examples; NEWS
bulwahn
parents:
47979
diff
changeset

151 

50646  152 
* Sledgehammer: 
153 

154 
 Added MaSh relevance filter based on machinelearning; see the 

155 
Sledgehammer manual for details. 

156 
 Polished Isar proofs generated with "isar_proofs" option. 

157 
 Rationalized type encodings ("type_enc" option). 

50720  158 
 Renamed "kill_provers" subcommand to "kill_all". 
50646  159 
 Renamed options: 
160 
isar_proof ~> isar_proofs 

161 
isar_shrink_factor ~> isar_shrink 

162 
max_relevant ~> max_facts 

163 
relevance_thresholds ~> fact_thresholds 

164 

165 
* Quickcheck: added an optimisation for equality premises. It is 

166 
switched on by default, and can be switched off by setting the 

167 
configuration quickcheck_optimise_equality to false. 

168 

50878  169 
* Quotient: only one quotient can be defined by quotient_type 
170 
INCOMPATIBILITY. 

171 

172 
* Lifting: 

173 
 generation of an abstraction function equation in lift_definition 

174 
 quot_del attribute 

175 
 renamed no_abs_code > no_code (INCOMPATIBILITY.) 

176 

50646  177 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
178 
expressions. 

179 

180 
* Preprocessing of the code generator rewrites set comprehensions into 

181 
pointfree expressions. 

182 

183 
* The SMT solver Z3 has now by default a restricted set of directly 

184 
supported features. For the full set of features (div/mod, nonlinear 

185 
arithmetic, datatypes/records) with potential proof reconstruction 

186 
failures, enable the configuration option "z3_with_extensions". Minor 

187 
INCOMPATIBILITY. 

49948
744934b818c7
moved quite generic material from theory Enum to more appropriate places
haftmann
parents:
49918
diff
changeset

188 

49836
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49822
diff
changeset

189 
* Simplified 'typedef' specifications: historical options for implicit 
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49822
diff
changeset

190 
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

191 
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

192 
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

193 
accordingly. 
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49822
diff
changeset

194 

50646  195 
* Removed constant "chars"; prefer "Enum.enum" on type "char" 
196 
directly. INCOMPATIBILITY. 

197 

198 
* Moved operation product, sublists and n_lists from theory Enum to 

199 
List. INCOMPATIBILITY. 

49822
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49770
diff
changeset

200 

49739  201 
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. 
202 

49738  203 
* Class "comm_monoid_diff" formalises properties of bounded 
49388  204 
subtraction, with natural numbers and multisets as typical instances. 
205 

50646  206 
* Added combinator "Option.these" with type "'a option set => 'a set". 
207 

208 
* Theory "Transitive_Closure": renamed lemmas 

209 

210 
reflcl_tranclp > reflclp_tranclp 

211 
rtranclp_reflcl > rtranclp_reflclp 

212 

213 
INCOMPATIBILITY. 

214 

215 
* Theory "Rings": renamed lemmas (in class semiring) 

216 

217 
left_distrib ~> distrib_right 

218 
right_distrib ~> distrib_left 

219 

220 
INCOMPATIBILITY. 

221 

222 
* Generalized the definition of limits: 

223 

224 
 Introduced the predicate filterlim (LIM x F. f x :> G) which 

225 
expresses that when the input values x converge to F then the 

226 
output f x converges to G. 

227 

228 
 Added filters for convergence to positive (at_top) and negative 

229 
infinity (at_bot). 

230 

231 
 Moved infinity in the norm (at_infinity) from 

232 
Multivariate_Analysis to Complex_Main. 

233 

234 
 Removed real_tendsto_inf, it is superseded by "LIM x F. f x :> 

235 
at_top". 

236 

237 
INCOMPATIBILITY. 

238 

239 
* Theory "Library/Option_ord" provides instantiation of option type to 

240 
lattice type classes. 

241 

242 
* Theory "Library/Multiset": renamed 

243 

244 
constant fold_mset ~> Multiset.fold 

245 
fact fold_mset_commute ~> fold_mset_comm 

246 

247 
INCOMPATIBILITY. 

248 

249 
* Renamed theory Library/List_Prefix to Library/Sublist, with related 

250 
changes as follows. 

251 

252 
 Renamed constants (and related lemmas) 

49145  253 

254 
prefix ~> prefixeq 

255 
strict_prefix ~> prefix 

256 

50646  257 
 Replaced constant "postfix" by "suffixeq" with swapped argument 
258 
order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped 

259 
old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead. 

260 
Renamed lemmas accordingly. 

261 

262 
 Added constant "list_hembeq" for homeomorphic embedding on 

263 
lists. Added abbreviation "sublisteq" for special case 

264 
"list_hembeq (op =)". 

265 

266 
 Theory Library/Sublist no longer provides "order" and "bot" type 

267 
class instances for the prefix order (merely corresponding locale 

268 
interpretations). The type class instances are now in theory 

269 
Library/Prefix_Order. 

270 

271 
 The sublist relation of theory Library/Sublist_Order is now based 

272 
on "Sublist.sublisteq". Renamed lemmas accordingly: 

50516  273 

274 
le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff 

275 
le_list_append_mono ~> Sublist.list_hembeq_append_mono 

276 
le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2 

277 
le_list_Cons_EX ~> Sublist.list_hembeq_ConsD 

278 
le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2' 

279 
le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq 

280 
le_list_drop_Cons ~> Sublist.sublisteq_Cons' 

281 
le_list_drop_many ~> Sublist.sublisteq_drop_many 

282 
le_list_filter_left ~> Sublist.sublisteq_filter_left 

283 
le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many 

284 
le_list_rev_take_iff ~> Sublist.sublisteq_append 

285 
le_list_same_length ~> Sublist.sublisteq_same_length 

286 
le_list_take_many_iff ~> Sublist.sublisteq_append' 

49145  287 
less_eq_list.drop ~> less_eq_list_drop 
288 
less_eq_list.induct ~> less_eq_list_induct 

50516  289 
not_le_list_length ~> Sublist.not_sublisteq_length 
49145  290 

50646  291 
INCOMPATIBILITY. 
292 

293 

294 
* New theory Library/Countable_Set. 

295 

296 
* Theory Library/Debug and Library/Parallel provide debugging and 

297 
parallel execution for code generated towards Isabelle/ML. 

298 

299 
* Theory Library/FuncSet: Extended support for Pi and extensional and 

300 
introduce the extensional dependent function space "PiE". Replaced 

301 
extensional_funcset by an abbreviation, and renamed lemmas from 

302 
extensional_funcset to PiE as follows: 

303 

304 
extensional_empty ~> PiE_empty 

305 
extensional_funcset_empty_domain ~> PiE_empty_domain 

306 
extensional_funcset_empty_range ~> PiE_empty_range 

307 
extensional_funcset_arb ~> PiE_arb 

308 
extensional_funcset_mem ~> PiE_mem 

309 
extensional_funcset_extend_domainI ~> PiE_fun_upd 

310 
extensional_funcset_restrict_domain ~> fun_upd_in_PiE 

311 
extensional_funcset_extend_domain_eq ~> PiE_insert_eq 

312 
card_extensional_funcset ~> card_PiE 

313 
finite_extensional_funcset ~> finite_PiE 

314 

315 
INCOMPATIBILITY. 

316 

317 
* Theory Library/FinFun: theory of almost everywhere constant 

318 
functions (supersedes the AFP entry "Code Generation for Functions as 

319 
Data"). 

320 

321 
* Theory Library/Phantom: generic phantom type to make a type 

322 
parameter appear in a constant's type. This alternative to adding 

323 
TYPE('a) as another parameter avoids unnecessary closures in generated 

324 
code. 

325 

326 
* Theory Library/RBT_Impl: efficient construction of redblack trees 

327 
from sorted associative lists. Merging two trees with rbt_union may 

328 
return a structurally different tree than before. Potential 

329 
INCOMPATIBILITY. 

330 

331 
* Theory Library/IArray: immutable arrays with code generation. 

332 

333 
* Theory Library/Finite_Lattice: theory of finite lattices. 

334 

335 
* HOL/Multivariate_Analysis: replaced 

336 

337 
"basis :: 'a::euclidean_space => nat => real" 

338 
"\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space" 

339 

340 
on euclidean spaces by using the inner product "_ \<bullet> _" with 

341 
vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by 

342 
"SUM i : Basis. f i * r i". 

343 

344 
With this change the following constants are also changed or removed: 

345 

346 
DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation) 

347 
a $$ i ~> inner a i (where i : Basis) 

348 
cart_base i removed 

349 
\<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

350 

899c9c4e4a4c
Remove the indexed basis from the definition of euclidean spaces and only use the set of Basis vectors
hoelzl
parents:
50525
diff
changeset

351 
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

352 

899c9c4e4a4c
Remove the indexed basis from the definition of euclidean spaces and only use the set of Basis vectors
hoelzl
parents:
50525
diff
changeset

353 
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

354 

50646  355 
component_le_norm ~> Basis_le_norm 
356 
euclidean_eq ~> euclidean_eq_iff 

357 
differential_zero_maxmin_component ~> differential_zero_maxmin_cart 

358 
euclidean_simps ~> inner_simps 

359 
independent_basis ~> independent_Basis 

360 
span_basis ~> span_Basis 

361 
in_span_basis ~> in_span_Basis 

362 
norm_bound_component_le ~> norm_boound_Basis_le 

363 
norm_bound_component_lt ~> norm_boound_Basis_lt 

364 
component_le_infnorm ~> Basis_le_infnorm 

365 

366 
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

367 

50141  368 
* HOL/Probability: 
50646  369 

370 
 Added simproc "measurable" to automatically prove measurability. 

371 

372 
 Added induction rules for sigma sets with disjoint union 

373 
(sigma_sets_induct_disjoint) and for Borelmeasurable functions 

374 
(borel_measurable_induct). 

375 

376 
 Added the DaniellKolmogorov theorem (the existence the limit of a 

377 
projective family). 

378 

379 
* HOL/Cardinals: Theories of ordinals and cardinals (supersedes the 

380 
AFP entry "Ordinals_and_Cardinals"). 

381 

382 
* HOL/BNF: New (co)datatype package based on bounded natural functors 

383 
with support for mixed, nested recursion and interesting nonfree 

384 
datatypes. 

48094  385 

50991  386 
* HOL/Finite_Set and Relation: added new set and relation operations 
50878  387 
expressed by Finite_Set.fold. 
388 

389 
* New theory HOL/Library/RBT_Set: implementation of sets by redblack 

390 
trees for the code generator. 

391 

392 
* HOL/Library/RBT and HOL/Library/Mapping have been converted to 

393 
Lifting/Transfer. 

394 
possible INCOMPATIBILITY. 

395 

396 
* HOL/Set: renamed Set.project > Set.filter 

397 
INCOMPATIBILITY. 

398 

48120
9fe0e71052a0
updated "isarref" manual, reduced remaining material in "ref" manual.
wenzelm
parents:
48111
diff
changeset

399 

48206  400 
*** Document preparation *** 
401 

50646  402 
* Dropped legacy antiquotations "term_style" and "thm_style", since 
403 
styles may be given as arguments to "term" and "thm" already. 

404 
Discontinued legacy styles "prem1" .. "prem19". 

405 

406 
* Default LaTeX rendering for \<euro> is now based on eurosym package, 

407 
instead of slightly exotic babel/greek. 

48206  408 

48616
be8002ee43d8
document variant NAME may use different LaTeX entry point document/root_NAME.tex if that file exists;
wenzelm
parents:
48586
diff
changeset

409 
* 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

410 
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

411 
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

412 

48657
63ef2f0cf8bb
simplified custom document/build script, instead of oldstyle document/IsaMakefile;
wenzelm
parents:
48616
diff
changeset

413 
* Simplified custom document/build script, instead of oldstyle 
63ef2f0cf8bb
simplified custom document/build script, instead of oldstyle document/IsaMakefile;
wenzelm
parents:
48616
diff
changeset

414 
document/IsaMakefile. Minor INCOMPATIBILITY. 
63ef2f0cf8bb
simplified custom document/build script, instead of oldstyle document/IsaMakefile;
wenzelm
parents:
48616
diff
changeset

415 

48206  416 

48992  417 
*** ML *** 
418 

50646  419 
* The default limit for maximum number of worker threads is now 8, 
420 
instead of 4, in correspondence to capabilities of contemporary 

421 
hardware and Poly/ML runtime system. 

422 

49869
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset

423 
* Type Seq.results and related operations support embedded error 
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset

424 
messages within lazy enumerations, and thus allow to provide 
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset

425 
informative errors in the absence of any usable results. 
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset

426 

48992  427 
* Renamed Position.str_of to Position.here to emphasize that this is a 
428 
formal device to inline positions into message text, but not 

429 
necessarily printing visible text. 

430 

431 

48206  432 
*** System *** 
433 

48585
a82910dd2270
announce advanced support for Isabelle sessions and build management;
wenzelm
parents:
48574
diff
changeset

434 
* Advanced support for Isabelle sessions and build management, see 
a82910dd2270
announce advanced support for Isabelle sessions and build management;
wenzelm
parents:
48574
diff
changeset

435 
"system" manual for the chapter of that name, especially the "isabelle 
48736  436 
build" tool and its examples. INCOMPATIBILITY, isabelle usedir / 
437 
mkdir / make are rendered obsolete. 

438 

439 
* Discontinued obsolete "isabelle makeall". 

48585
a82910dd2270
announce advanced support for Isabelle sessions and build management;
wenzelm
parents:
48574
diff
changeset

440 

48722
a5e3ba7cbb2a
discontinued obsolete IsaMakefile and ROOT.ML files from the Isabelle distribution;
wenzelm
parents:
48693
diff
changeset

441 
* 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

442 
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

443 
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

444 
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

445 
"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

446 

48586  447 
* Discontinued obsolete Isabelle/build script, it is superseded by the 
448 
regular isabelle build tool. For example: 

449 

450 
isabelle build s b HOLCF 

451 

48693
ceeea46bdeba
"isabelle options" prints Isabelle system options;
wenzelm
parents:
48683
diff
changeset

452 
* The "isabelle options" tool prints Isabelle system options, as 
ceeea46bdeba
"isabelle options" prints Isabelle system options;
wenzelm
parents:
48683
diff
changeset

453 
required for "isabelle build", for example. 
ceeea46bdeba
"isabelle options" prints Isabelle system options;
wenzelm
parents:
48683
diff
changeset

454 

48683  455 
* The "isabelle mkroot" tool prepares session root directories for use 
456 
with "isabelle build", similar to former "isabelle mkdir" for 

457 
"isabelle usedir". 

458 

50646  459 
* The "isabelle logo" tool produces EPS and PDF format simultaneously. 
460 
Minor INCOMPATIBILITY in commandline options. 

461 

462 
* The "isabelle install" tool has now a simpler commandline. Minor 

463 
INCOMPATIBILITY. 

464 

48844  465 
* The "isabelle components" tool helps to resolve addon components 
466 
that are not bundled, or referenced from a barebones repository 

467 
version of Isabelle. 

468 

50646  469 
* Settings variable ISABELLE_PLATFORM_FAMILY refers to the general 
470 
platform family: "linux", "macos", "windows". 

471 

472 
* The ML system is configured as regular component, and no longer 

473 
picked up from some surrounding directory. Potential INCOMPATIBILITY 

474 
for homemade settings. 

50132  475 

50701  476 
* Improved ML runtime statistics (heap, threads, future tasks etc.). 
477 

48206  478 
* Discontinued support for Poly/ML 5.2.1, which was the last version 
479 
without exception positions and advanced ML compiler/toplevel 

480 
configuration. 

481 

48574  482 
* Discontinued special treatment of Proof General  no longer guess 
483 
PROOFGENERAL_HOME based on accidental filesystem layout. Minor 

484 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

485 
settings manually, or use a Proof General version that has been 

486 
bundled as Isabelle component. 

48206  487 

50182  488 

48120
9fe0e71052a0
updated "isarref" manual, reduced remaining material in "ref" manual.
wenzelm
parents:
48111
diff
changeset

489 

47462  490 
New in Isabelle2012 (May 2012) 
491 
 

45109  492 

45593  493 
*** General *** 
494 

45614  495 
* Prover IDE (PIDE) improvements: 
496 

47585  497 
 more robust Sledgehammer integration (as before the sledgehammer 
47806  498 
commandline needs to be typed into the source buffer) 
45614  499 
 markup for bound variables 
47806  500 
 markup for types of term variables (displayed as tooltips) 
46956
9ff441f295c2
Isabelle/jEdit supports userdefined Isar commands within the running session;
wenzelm
parents:
46948
diff
changeset

501 
 support for userdefined Isar commands within the running session 
47158  502 
 improved support for Unicode outside original 16bit range 
503 
e.g. glyph for \<A> (thanks to jEdit 4.5.1) 

45614  504 

47806  505 
* Forward declaration of outer syntax keywords within the theory 
506 
header  minor INCOMPATIBILITY for userdefined commands. Allow new 

507 
commands to be used in the same theory where defined. 

46485  508 

47482
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

509 
* 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

510 
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

511 
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

512 
'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

513 
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

514 

a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

515 
context 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

516 
fixes x y z :: 'a 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

517 
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

518 
begin 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

519 

a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

520 
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

521 

a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

522 
end 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

523 

a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

524 
thm my_trans 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

525 

a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

526 
The most basic application is to factorout context elements of 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

527 
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

528 
~~/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

529 

a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

530 
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

531 
... begin ... end" block as well. 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

532 

47484  533 
* Bundled declarations associate attributed fact expressions with a 
534 
given name in the context. These may be later included in other 

535 
contexts. This allows to manage context extensions casually, without 

47855  536 
the logical dependencies of locales and locale interpretation. See 
537 
commands 'bundle', 'include', 'including' etc. in the isarref manual. 

47484  538 

47829  539 
* Commands 'lemmas' and 'theorems' allow local variables using 'for' 
540 
declaration, and results are standardized before being stored. Thus 

541 
oldstyle "standard" after instantiation or composition of facts 

542 
becomes obsolete. Minor INCOMPATIBILITY, due to potential change of 

543 
indices of schematic variables. 

544 

545 
* Rule attributes in local theory declarations (e.g. locale or class) 

546 
are now statically evaluated: the resulting theorem is stored instead 

547 
of the original expression. INCOMPATIBILITY in rare situations, where 

548 
the historic accident of dynamic reevaluation in interpretations 

549 
etc. was exploited. 

550 

551 
* New tutorial "Programming and Proving in Isabelle/HOL" 

552 
("progprove"). It completely supersedes "A Tutorial Introduction to 

553 
Structured Isar Proofs" ("isaroverview"), which has been removed. It 

554 
also supersedes "Isabelle/HOL, A Proof Assistant for HigherOrder 

555 
Logic" as the recommended beginners tutorial, but does not cover all 

556 
of the material of that old tutorial. 

557 

558 
* Updated and extended reference manuals: "isarref", 

559 
"implementation", "system"; reduced remaining material in old "ref" 

560 
manual. 

561 

562 

563 
*** Pure *** 

564 

46976
80123a220219
'definition' no longer exports the foundational "raw_def";
wenzelm
parents:
46966
diff
changeset

565 
* Command 'definition' no longer exports the foundational "raw_def" 
80123a220219
'definition' no longer exports the foundational "raw_def";
wenzelm
parents:
46966
diff
changeset

566 
into the user context. Minor INCOMPATIBILITY, may use the regular 
80123a220219
'definition' no longer exports the foundational "raw_def";
wenzelm
parents:
46966
diff
changeset

567 
"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

568 

47855  569 
* Attribute "abs_def" turns an equation of the form "f x y == t" into 
570 
"f == %x y. t", which ensures that "simp" or "unfold" steps always 

571 
expand it. This also works for objectlogic equality. (Formerly 

572 
undocumented feature.) 

573 

47856  574 
* Sort constraints are now propagated in simultaneous statements, just 
575 
like type constraints. INCOMPATIBILITY in rare situations, where 

576 
distinct sorts used to be assigned accidentally. For example: 

577 

578 
lemma "P (x::'a::foo)" and "Q (y::'a::bar)"  "now illegal" 

579 

580 
lemma "P (x::'a)" and "Q (y::'a::bar)" 

581 
 "now uniform 'a::bar instead of default sort for first occurrence (!)" 

582 

583 
* Rule composition via attribute "OF" (or ML functions OF/MRS) is more 

584 
tolerant against multiple unifiers, as long as the final result is 

585 
unique. (As before, rules are composed in canonical righttoleft 

586 
order to accommodate newly introduced premises.) 

587 

47806  588 
* Renamed some inner syntax categories: 
589 

590 
num ~> num_token 

591 
xnum ~> xnum_token 

592 
xstr ~> str_token 

593 

594 
Minor INCOMPATIBILITY. Note that in practice "num_const" or 

595 
"num_position" etc. are mainly used instead (which also include 

596 
position information via constraints). 

597 

47829  598 
* Simplified configuration options for syntax ambiguity: see 
599 
"syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isarref 

600 
manual. Minor INCOMPATIBILITY. 

601 

47856  602 
* Discontinued configuration option "syntax_positions": atomic terms 
603 
in parse trees are always annotated by position constraints. 

45134  604 

47464  605 
* Old code generator for SML and its commands 'code_module', 
45383  606 
'code_library', 'consts_code', 'types_code' have been discontinued. 
46028
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset

607 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  608 

47464  609 
* Redundant attribute "code_inline" has been discontinued. Use 
610 
"code_unfold" instead. INCOMPATIBILITY. 

611 

612 
* Dropped attribute "code_unfold_post" in favor of the its dual 

613 
"code_abbrev", which yields a common pattern in definitions like 

46028
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset

614 

9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset

615 
definition [code_abbrev]: "f = t" 
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset

616 

9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset

617 
INCOMPATIBILITY. 
45383  618 

47856  619 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
620 
instead. INCOMPATIBILITY. 

621 

622 
* Discontinued old "prems" fact, which used to refer to the accidental 

623 
collection of foundational premises in the context (already marked as 

624 
legacy since Isabelle2011). 

47855  625 

45427
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset

626 

45122  627 
*** HOL *** 
628 

47464  629 
* Type 'a set is now a proper type constructor (just as before 
630 
Isabelle2008). Definitions mem_def and Collect_def have disappeared. 

631 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

47855  632 
sets separate, it is often sufficient to rephrase some set S that has 
633 
been accidentally used as predicates by "%x. x : S", and some 

634 
predicate P that has been accidentally used as set by "{x. P x}". 

635 
Corresponding proofs in a first step should be pruned from any 

636 
tinkering with former theorems mem_def and Collect_def as far as 

637 
possible. 

638 

639 
For developments which deliberately mix predicates and sets, a 

47464  640 
planning step is necessary to determine what should become a predicate 
641 
and what a set. It can be helpful to carry out that step in 

642 
Isabelle20111 before jumping right into the current release. 

643 

47855  644 
* Code generation by default implements sets as container type rather 
645 
than predicates. INCOMPATIBILITY. 

646 

647 
* New type synonym 'a rel = ('a * 'a) set 

648 

47464  649 
* The representation of numerals has changed. Datatype "num" 
650 
represents strictly positive binary numerals, along with functions 

651 
"numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent 

47855  652 
positive and negated numeric literals, respectively. See also 
653 
definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some 

654 
user theories may require adaptations as follows: 

47108
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

655 

2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

656 
 Theorems with number_ring or number_semiring constraints: These 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

657 
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

658 

2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

659 
 Theories defining numeric types: Remove number, number_semiring, 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

660 
and number_ring instances. Defer all theorems about numerals until 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

661 
after classes one and semigroup_add have been instantiated. 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

662 

2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

663 
 Numeralonly simp rules: Replace each rule having a "number_of v" 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

664 
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

665 

2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

666 
 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

667 
automatically support numerals now, so more simp rules and 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

668 
simprocs may now apply within the proof. 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

669 

2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

670 
 Definitions and theorems using old constructors Pls/Min/Bit0/Bit1: 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

671 
Redefine using other integer operations. 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

672 

47855  673 
* Transfer: New package intended to generalize the existing 
674 
"descending" method and related theorem attributes from the Quotient 

675 
package. (Not all functionality is implemented yet, but future 

676 
development will focus on Transfer as an eventual replacement for the 

677 
corresponding parts of the Quotient package.) 

47809  678 

679 
 transfer_rule attribute: Maintains a collection of transfer rules, 

680 
which relate constants at two different types. Transfer rules may 

681 
relate different type instances of the same polymorphic constant, 

682 
or they may relate an operation on a raw type to a corresponding 

683 
operation on an abstract type (quotient or subtype). For example: 

684 

685 
((A ===> B) ===> list_all2 A ===> list_all2 B) map map 

686 
(cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int 

687 

688 
 transfer method: Replaces a subgoal on abstract types with an 

689 
equivalent subgoal on the corresponding raw types. Constants are 

690 
replaced with corresponding ones according to the transfer rules. 

691 
Goals are generalized over all free variables by default; this is 

47851  692 
necessary for variables whose types change, but can be overridden 
47855  693 
for specific variables with e.g. "transfer fixing: x y z". The 
47809  694 
variant transfer' method allows replacing a subgoal with one that 
695 
is logically stronger (rather than equivalent). 

696 

697 
 relator_eq attribute: Collects identity laws for relators of 

698 
various type constructors, e.g. "list_all2 (op =) = (op =)". The 

699 
transfer method uses these lemmas to infer transfer rules for 

700 
nonpolymorphic constants on the fly. 

701 

702 
 transfer_prover method: Assists with proving a transfer rule for a 

703 
new constant, provided the constant is defined in terms of other 

704 
constants that already have transfer rules. It should be applied 

705 
after unfolding the constant definitions. 

706 

707 
 HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer 

708 
from type nat to type int. 

709 

47851  710 
* Lifting: New package intended to generalize the quotient_definition 
711 
facility of the Quotient package; designed to work with Transfer. 

47809  712 

713 
 lift_definition command: Defines operations on an abstract type in 

714 
terms of a corresponding operation on a representation 

715 
type. Example syntax: 

716 

717 
lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist" 

718 
is List.insert 

719 

720 
Users must discharge a respectfulness proof obligation when each 

721 
constant is defined. (For a type copy, i.e. a typedef with UNIV, 

722 
the proof is discharged automatically.) The obligation is 

723 
presented in a userfriendly, readable form; a respectfulness 

724 
theorem in the standard format and a transfer rule are generated 

725 
by the package. 

726 

727 
 Integration with code_abstype: For typedefs (e.g. subtypes 

728 
corresponding to a datatype invariant, such as dlist), 

729 
lift_definition generates a code certificate theorem and sets up 

730 
code generation for each constant. 

731 

732 
 setup_lifting command: Sets up the Lifting package to work with a 

733 
userdefined type. The user must provide either a quotient theorem 

734 
or a type_definition theorem. The package configures transfer 

735 
rules for equality and quantifiers on the type, and sets up the 

736 
lift_definition command to work with the type. 

737 

738 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  739 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
740 
Word/Word.thy and Library/Float.thy. 

47809  741 

742 
* Quotient package: 

743 

744 
 The 'quotient_type' command now supports a 'morphisms' option with 

745 
rep and abs functions, similar to typedef. 

746 

747 
 'quotient_type' sets up new types to work with the Lifting and 

748 
Transfer packages, as with 'setup_lifting'. 

749 

750 
 The 'quotient_definition' command now requires the user to prove a 

751 
respectfulness property at the point where the constant is 

752 
defined, similar to lift_definition; INCOMPATIBILITY. 

753 

754 
 Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems 

755 
accordingly, INCOMPATIBILITY. 

756 

757 
* New diagnostic command 'find_unused_assms' to find potentially 

758 
superfluous assumptions in theorems using Quickcheck. 

759 

760 
* Quickcheck: 

761 

762 
 Quickcheck returns variable assignments as counterexamples, which 

763 
allows to reveal the underspecification of functions under test. 

764 
For example, refuting "hd xs = x", it presents the variable 

765 
assignment xs = [] and x = a1 as a counterexample, assuming that 

766 
any property is false whenever "hd []" occurs in it. 

767 

768 
These counterexample are marked as potentially spurious, as 

769 
Quickcheck also returns "xs = []" as a counterexample to the 

770 
obvious theorem "hd xs = hd xs". 

771 

772 
After finding a potentially spurious counterexample, Quickcheck 

773 
continues searching for genuine ones. 

774 

775 
By default, Quickcheck shows potentially spurious and genuine 

776 
counterexamples. The option "genuine_only" sets quickcheck to only 

777 
show genuine counterexamples. 

778 

779 
 The command 'quickcheck_generator' creates random and exhaustive 

780 
value generators for a given type and operations. 

781 

782 
It generates values by using the operations as if they were 

783 
constructors of that type. 

784 

785 
 Support for multisets. 

786 

787 
 Added "use_subtype" options. 

788 

789 
 Added "quickcheck_locale" configuration to specify how to process 

790 
conjectures in a locale context. 

791 

47855  792 
* Nitpick: Fixed infinite loop caused by the 'peephole_optim' option 
793 
and affecting 'rat' and 'real'. 

47809  794 

795 
* Sledgehammer: 

796 
 Integrated more tightly with SPASS, as described in the ITP 2012 

797 
paper "More SPASS with Isabelle". 

798 
 Made it try "smt" as a fallback if "metis" fails or times out. 

799 
 Added support for the following provers: AltErgo (via Why3 and 

800 
TFF1), iProver, iProverEq. 

801 
 Sped up the minimizer. 

802 
 Added "lam_trans", "uncurry_aliases", and "minimize" options. 

803 
 Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice"). 

804 
 Renamed "sound" option to "strict". 

805 

47855  806 
* Metis: Added possibility to specify lambda translations scheme as a 
807 
parenthesized argument (e.g., "by (metis (lifting) ...)"). 

808 

809 
* SMT: Renamed "smt_fixed" option to "smt_read_only_certificates". 

810 

811 
* Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY. 

47809  812 

47856  813 
* New "case_product" attribute to generate a case rule doing multiple 
814 
case distinctions at the same time. E.g. 

815 

816 
list.exhaust [case_product nat.exhaust] 

817 

818 
produces a rule which can be used to perform case distinction on both 

819 
a list and a nat. 

820 

47809  821 
* New "eventually_elim" method as a generalized variant of the 
47855  822 
eventually_elim* rules. Supports structured proofs. 
823 

47702
5f9ce06f281e
typedef with implicit set definition is considered legacy;
wenzelm
parents:
47694
diff
changeset

824 
* Typedef with implicit set definition is considered legacy. Use 
5f9ce06f281e
typedef with implicit set definition is considered legacy;
wenzelm
parents:
47694
diff
changeset

825 
"typedef (open)" form instead, which will eventually become the 
5f9ce06f281e
typedef with implicit set definition is considered legacy;
wenzelm
parents:
47694
diff
changeset

826 
default. 
5f9ce06f281e
typedef with implicit set definition is considered legacy;
wenzelm
parents:
47694
diff
changeset

827 

47856  828 
* Record: code generation can be switched off manually with 
829 

830 
declare [[record_coden = false]]  "default true" 

831 

832 
* Datatype: type parameters allow explicit sort constraints. 

833 

47855  834 
* Concrete syntax for case expressions includes constraints for source 
835 
positions, and thus produces Prover IDE markup for its bindings. 

836 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

837 
pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of 

838 
one_case. 

839 

840 
* Clarified attribute "mono_set": pure declaration without modifying 

841 
the result of the fact expression. 

842 

46752
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

843 
* More default pred/set conversions on a couple of relation operations 
47464  844 
and predicates. Added powers of predicate relations. Consolidation 
845 
of some relation theorems: 

46752
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

846 

e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

847 
converse_def ~> converse_unfold 
47549  848 
rel_comp_def ~> relcomp_unfold 
47820  849 
symp_def ~> (modified, use symp_def and sym_def instead) 
46752
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

850 
transp_def ~> transp_trans 
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

851 
Domain_def ~> Domain_unfold 
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

852 
Range_def ~> Domain_converse [symmetric] 
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

853 

46981  854 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
855 

47464  856 
See theory "Relation" for examples for making use of pred/set 
857 
conversions by means of attributes "to_set" and "to_pred". 

47086  858 

46752
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

859 
INCOMPATIBILITY. 
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

860 

46363  861 
* Renamed facts about the power operation on relations, i.e., relpow 
47464  862 
to match the constant's name: 
47463  863 

46458  864 
rel_pow_1 ~> relpow_1 
46363  865 
rel_pow_0_I ~> relpow_0_I 
866 
rel_pow_Suc_I ~> relpow_Suc_I 

867 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

868 
rel_pow_0_E ~> relpow_0_E 

869 
rel_pow_Suc_E ~> relpow_Suc_E 

870 
rel_pow_E ~> relpow_E 

46458  871 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  872 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  873 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
874 
rel_pow_E2 ~> relpow_E2 

875 
rel_pow_add ~> relpow_add 

876 
rel_pow_commute ~> relpow 

877 
rel_pow_empty ~> relpow_empty: 

878 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

879 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

880 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

881 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

882 
rel_pow_fun_conv ~> relpow_fun_conv 

883 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

884 
rel_pow_finite_bounded ~> relpow_finite_bounded 

885 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

886 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

887 
single_valued_rel_pow ~> single_valued_relpow 

47463  888 

46363  889 
INCOMPATIBILITY. 
890 

47448  891 
* Theory Relation: Consolidated constant name for relation composition 
47464  892 
and corresponding theorem names: 
893 

47549  894 
 Renamed constant rel_comp to relcomp. 
47464  895 

47448  896 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  897 

47448  898 
 Renamed theorems: 
47464  899 

47448  900 
rel_compI ~> relcompI 
901 
rel_compEpair ~> relcompEpair 

902 
rel_compE ~> relcompE 

903 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

904 
rel_comp_empty1 ~> relcomp_empty1 

905 
rel_comp_mono ~> relcomp_mono 

906 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

907 
rel_comp_distrib ~> relcomp_distrib 

908 
rel_comp_distrib2 ~> relcomp_distrib2 

909 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

910 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

911 
single_valued_rel_comp ~> single_valued_relcomp 

47549  912 
rel_comp_def ~> relcomp_unfold 
47448  913 
converse_rel_comp ~> converse_relcomp 
914 
pred_compI ~> relcomppI 

915 
pred_compE ~> relcomppE 

916 
pred_comp_bot1 ~> relcompp_bot1 

917 
pred_comp_bot2 ~> relcompp_bot2 

918 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

919 
pred_comp_mono ~> relcompp_mono 

920 
pred_comp_distrib ~> relcompp_distrib 

921 
pred_comp_distrib2 ~> relcompp_distrib2 

922 
converse_pred_comp ~> converse_relcompp 

47464  923 

47448  924 
finite_rel_comp ~> finite_relcomp 
47464  925 

47448  926 
set_rel_comp ~> set_relcomp 
927 

928 
INCOMPATIBILITY. 

929 

47550  930 
* Theory Divides: Discontinued redundant theorems about div and mod. 
931 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

932 

933 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

934 
zdiv_self ~> div_self 

935 
zmod_self ~> mod_self 

936 
zdiv_zero ~> div_0 

937 
zmod_zero ~> mod_0 

938 
zdiv_zmod_equality ~> div_mod_equality2 

939 
zdiv_zmod_equality2 ~> div_mod_equality 

940 
zmod_zdiv_trivial ~> mod_div_trivial 

941 
zdiv_zminus_zminus ~> div_minus_minus 

942 
zmod_zminus_zminus ~> mod_minus_minus 

943 
zdiv_zminus2 ~> div_minus_right 

944 
zmod_zminus2 ~> mod_minus_right 

945 
zdiv_minus1_right ~> div_minus1_right 

946 
zmod_minus1_right ~> mod_minus1_right 

947 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

948 
zmod_zmult1_eq ~> mod_mult_right_eq 

949 
zpower_zmod ~> power_mod 

950 
zdvd_zmod ~> dvd_mod 

951 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

952 
mod_mult_distrib ~> mult_mod_left 

953 
mod_mult_distrib2 ~> mult_mod_right 

954 

955 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

956 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

957 

47551  958 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
959 

47552  960 
* Consolidated theorem names concerning fold combinators: 
47550  961 

962 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

963 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

964 
INFI_fold_inf ~> INF_fold_inf 

965 
SUPR_fold_sup ~> SUP_fold_sup 

966 
union_set ~> union_set_fold 

967 
minus_set ~> minus_set_fold 

968 
INFI_set_fold ~> INF_set_fold 

969 
SUPR_set_fold ~> SUP_set_fold 

970 
INF_code ~> INF_set_foldr 

971 
SUP_code ~> SUP_set_foldr 

972 
foldr.simps ~> foldr.simps (in pointfree formulation) 

973 
foldr_fold_rev ~> foldr_conv_fold 

974 
foldl_fold ~> foldl_conv_fold 

975 
foldr_foldr ~> foldr_conv_foldl 

976 
foldl_foldr ~> foldl_conv_foldr 

47552  977 
fold_set_remdups ~> fold_set_fold_remdups 
978 
fold_set ~> fold_set_fold 

979 
fold1_set ~> fold1_set_fold 

47550  980 

981 
INCOMPATIBILITY. 

982 

983 
* Dropped rarely useful theorems concerning fold combinators: 

984 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

985 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

986 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

987 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

988 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

989 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

990 
INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0" 

991 
and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be 

992 
useful to boil down "List.foldr" and "List.foldl" to "List.fold" by 

993 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

994 

995 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

996 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

997 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

998 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

999 
lemmas over fold rather than foldr, or make use of lemmas 

1000 
fold_conv_foldr and fold_rev. 

1001 

1002 
* Congruence rules Option.map_cong and Option.bind_cong for recursion 

1003 
through option types. 

1004 

47856  1005 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
1006 
relations. 

1007 

1008 
* Constant "Set.not_member" now qualified. INCOMPATIBILITY. 

1009 

1010 
* Theory Int: Discontinued many legacy theorems specific to type int. 

1011 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

1012 

1013 
zminus_zminus ~> minus_minus 

1014 
zminus_0 ~> minus_zero 

1015 
zminus_zadd_distrib ~> minus_add_distrib 

1016 
zadd_commute ~> add_commute 

1017 
zadd_assoc ~> add_assoc 

1018 
zadd_left_commute ~> add_left_commute 

1019 
zadd_ac ~> add_ac 

1020 
zmult_ac ~> mult_ac 

1021 
zadd_0 ~> add_0_left 

1022 
zadd_0_right ~> add_0_right 

1023 
zadd_zminus_inverse2 ~> left_minus 

1024 
zmult_zminus ~> mult_minus_left 

1025 
zmult_commute ~> mult_commute 

1026 
zmult_assoc ~> mult_assoc 

1027 
zadd_zmult_distrib ~> left_distrib 

1028 
zadd_zmult_distrib2 ~> right_distrib 

1029 
zdiff_zmult_distrib ~> left_diff_distrib 

1030 
zdiff_zmult_distrib2 ~> right_diff_distrib 

1031 
zmult_1 ~> mult_1_left 

1032 
zmult_1_right ~> mult_1_right 

1033 
zle_refl ~> order_refl 

1034 
zle_trans ~> order_trans 

1035 
zle_antisym ~> order_antisym 

1036 
zle_linear ~> linorder_linear 

1037 
zless_linear ~> linorder_less_linear 

1038 
zadd_left_mono ~> add_left_mono 

1039 
zadd_strict_right_mono ~> add_strict_right_mono 

1040 
zadd_zless_mono ~> add_less_le_mono 

1041 
int_0_less_1 ~> zero_less_one 

1042 
int_0_neq_1 ~> zero_neq_one 

1043 
zless_le ~> less_le 

1044 
zpower_zadd_distrib ~> power_add 

1045 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

1046 
zero_le_zpower_abs ~> zero_le_power_abs 

1047 

1048 
* Theory Deriv: Renamed 

1049 

1050 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

1051 

1052 
* Theory Library/Multiset: Improved code generation of multisets. 

1053 

47855  1054 
* Theory HOL/Library/Set_Algebras: Addition and multiplication on sets 
47703  1055 
are expressed via type classes again. The special syntax 
1056 
\<oplus>/\<otimes> has been replaced by plain +/*. Removed constant 

1057 
setsum_set, which is now subsumed by Big_Operators.setsum. 

1058 
INCOMPATIBILITY. 

1059 

46160  1060 
* Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY, 
1061 
use theory HOL/Library/Nat_Bijection instead. 

1062 

47464  1063 
* Theory HOL/Library/RBT_Impl: Backing implementation of redblack 
1064 
trees is now inside a type class context. Names of affected 

1065 
operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for 

1066 
theories working directly with raw redblack trees, adapt the names as 

1067 
follows: 

47452  1068 

1069 
Operations: 

1070 
bulkload > rbt_bulkload 

1071 
del_from_left > rbt_del_from_left 

1072 
del_from_right > rbt_del_from_right 

1073 
del > rbt_del 

1074 
delete > rbt_delete 

1075 
ins > rbt_ins 

1076 
insert > rbt_insert 

1077 
insertw > rbt_insert_with 

1078 
insert_with_key > rbt_insert_with_key 

1079 
map_entry > rbt_map_entry 

1080 
lookup > rbt_lookup 

1081 
sorted > rbt_sorted 

1082 
tree_greater > rbt_greater 

1083 
tree_less > rbt_less 

1084 
tree_less_symbol > rbt_less_symbol 

1085 
union > rbt_union 

1086 
union_with > rbt_union_with 

1087 
union_with_key > rbt_union_with_key 

1088 

1089 
Lemmas: 

1090 
balance_left_sorted > balance_left_rbt_sorted 

1091 
balance_left_tree_greater > balance_left_rbt_greater 

1092 
balance_left_tree_less > balance_left_rbt_less 

1093 
balance_right_sorted > balance_right_rbt_sorted 

1094 
balance_right_tree_greater > balance_right_rbt_greater 

1095 
balance_right_tree_less > balance_right_rbt_less 

1096 
balance_sorted > balance_rbt_sorted 

1097 
balance_tree_greater > balance_rbt_greater 

1098 
balance_tree_less > balance_rbt_less 

1099 
bulkload_is_rbt > rbt_bulkload_is_rbt 

1100 
combine_sorted > combine_rbt_sorted 

1101 
combine_tree_greater > combine_rbt_greater 

1102 
combine_tree_less > combine_rbt_less 

1103 
delete_in_tree > rbt_delete_in_tree 

1104 
delete_is_rbt > rbt_delete_is_rbt 

1105 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

1106 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

1107 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

1108 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

1109 
del_in_tree > rbt_del_in_tree 

1110 
del_inv1_inv2 > rbt_del_inv1_inv2 

1111 
del_sorted > rbt_del_rbt_sorted 

1112 
del_tree_greater > rbt_del_rbt_greater 

1113 
del_tree_less > rbt_del_rbt_less 

1114 
dom_lookup_Branch > dom_rbt_lookup_Branch 

1115 
entries_lookup > entries_rbt_lookup 

1116 
finite_dom_lookup > finite_dom_rbt_lookup 

1117 
insert_sorted > rbt_insert_rbt_sorted 

1118 
insertw_is_rbt > rbt_insertw_is_rbt 

1119 
insertwk_is_rbt > rbt_insertwk_is_rbt 

1120 
insertwk_sorted > rbt_insertwk_rbt_sorted 

1121 
insertw_sorted > rbt_insertw_rbt_sorted 

1122 
ins_sorted > ins_rbt_sorted 

1123 
ins_tree_greater > ins_rbt_greater 

1124 
ins_tree_less > ins_rbt_less 

1125 
is_rbt_sorted > is_rbt_rbt_sorted 

1126 
lookup_balance > rbt_lookup_balance 

1127 
lookup_bulkload > rbt_lookup_rbt_bulkload 

1128 
lookup_delete > rbt_lookup_rbt_delete 

1129 
lookup_Empty > rbt_lookup_Empty 

1130 
lookup_from_in_tree > rbt_lookup_from_in_tree 

1131 
lookup_in_tree > rbt_lookup_in_tree 

1132 
lookup_ins > rbt_lookup_ins 

1133 
lookup_insert > rbt_lookup_rbt_insert 

1134 
lookup_insertw > rbt_lookup_rbt_insertw 

1135 
lookup_insertwk > rbt_lookup_rbt_insertwk 

1136 
lookup_keys > rbt_lookup_keys 

1137 
lookup_map > rbt_lookup_map 

1138 
lookup_map_entry > rbt_lookup_rbt_map_entry 

1139 
lookup_tree_greater > rbt_lookup_rbt_greater 

1140 
lookup_tree_less > rbt_lookup_rbt_less 

1141 
lookup_union > rbt_lookup_rbt_union 

1142 
map_entry_color_of > rbt_map_entry_color_of 

1143 
map_entry_inv1 > rbt_map_entry_inv1 

1144 
map_entry_inv2 > rbt_map_entry_inv2 

1145 
map_entry_is_rbt > rbt_map_entry_is_rbt 

1146 
map_entry_sorted > rbt_map_entry_rbt_sorted 

1147 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

1148 
map_entry_tree_less > rbt_map_entry_rbt_less 

1149 
map_tree_greater > map_rbt_greater 

1150 
map_tree_less > map_rbt_less 

1151 
map_sorted > map_rbt_sorted 

1152 
paint_sorted > paint_rbt_sorted 

1153 
paint_lookup > paint_rbt_lookup 

1154 
paint_tree_greater > paint_rbt_greater 

1155 
paint_tree_less > paint_rbt_less 

1156 
sorted_entries > rbt_sorted_entries 

1157 
tree_greater_eq_trans > rbt_greater_eq_trans 

1158 
tree_greater_nit > rbt_greater_nit 

1159 
tree_greater_prop > rbt_greater_prop 

1160 
tree_greater_simps > rbt_greater_simps 

1161 
tree_greater_trans > rbt_greater_trans 

1162 
tree_less_eq_trans > rbt_less_eq_trans 

1163 
tree_less_nit > rbt_less_nit 

1164 
tree_less_prop > rbt_less_prop 

1165 
tree_less_simps > rbt_less_simps 

1166 
tree_less_trans > rbt_less_trans 

1167 
tree_ord_props > rbt_ord_props 

1168 
union_Branch > rbt_union_Branch 

1169 
union_is_rbt > rbt_union_is_rbt 

1170 
unionw_is_rbt > rbt_unionw_is_rbt 

1171 
unionwk_is_rbt > rbt_unionwk_is_rbt 

1172 
unionwk_sorted > rbt_unionwk_rbt_sorted 

1173 

47807  1174 
* Theory HOL/Library/Float: Floating point numbers are now defined as 
1175 
a subset of the real numbers. All operations are defined using the 

1176 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  1177 

1178 
Changed Operations: 

47622  1179 
float_abs > abs 
1180 
float_nprt > nprt 

1181 
float_pprt > pprt 

1182 
pow2 > use powr 

1183 
round_down > float_round_down 

1184 
round_up > float_round_up 

1185 
scale > exponent 

1186 

1187 
Removed Operations: 

1188 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

1189 

1190 
Renamed Lemmas: 

1191 
abs_float_def > Float.compute_float_abs 

1192 
bitlen_ge0 > bitlen_nonneg 

1193 
bitlen.simps > Float.compute_bitlen 

1194 
float_components > Float_mantissa_exponent 

1195 
float_divl.simps > Float.compute_float_divl 

1196 
float_divr.simps > Float.compute_float_divr 

1197 
float_eq_odd > mult_powr_eq_mult_powr_iff 

1198 
float_power > real_of_float_power 

1199 
lapprox_posrat_def > Float.compute_lapprox_posrat 

1200 
lapprox_rat.simps > Float.compute_lapprox_rat 

1201 
le_float_def' > Float.compute_float_le 

1202 
le_float_def > less_eq_float.rep_eq 

1203 
less_float_def' > Float.compute_float_less 

1204 
less_float_def > less_float.rep_eq 

1205 
normfloat_def > Float.compute_normfloat 

1206 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

1207 
normfloat > normfloat_def 

1208 
normfloat_unique > use normfloat_def 

1209 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

1210 
one_float_def > Float.compute_float_one 

1211 
plus_float_def > Float.compute_float_plus 

1212 
rapprox_posrat_def > Float.compute_rapprox_posrat 

1213 
rapprox_rat.simps > Float.compute_rapprox_rat 

1214 
real_of_float_0 > zero_float.rep_eq 

1215 
real_of_float_1 > one_float.rep_eq 

1216 
real_of_float_abs > abs_float.rep_eq 

1217 
real_of_float_add > plus_float.rep_eq 

1218 
real_of_float_minus > uminus_float.rep_eq 

1219 
real_of_float_mult > times_float.rep_eq 

1220 
real_of_float_simp > Float.rep_eq 

1221 
real_of_float_sub > minus_float.rep_eq 

1222 
round_down.simps > Float.compute_float_round_down 

1223 
round_up.simps > Float.compute_float_round_up 

1224 
times_float_def > Float.compute_float_times 

1225 
uminus_float_def > Float.compute_float_uminus 

1226 
zero_float_def > Float.compute_float_zero 

1227 

1228 
Lemmas not necessary anymore, use the transfer method: 

1229 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

1230 
float_divr, float_le_simp, float_less1_mantissa_bound, 

1231 
float_less_simp, float_less_zero, float_le_zero, 

1232 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

1233 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

1234 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

1235 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

1236 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

1237 
round_up, zero_le_float, zero_less_float 

47616  1238 

47856  1239 
* New theory HOL/Library/DAList provides an abstract type for 
1240 
association lists with distinct keys. 

45791  1241 

47866  1242 
* Session HOL/IMP: Added new theory of abstract interpretation of 
1243 
annotated commands. 

1244 

47855  1245 
* Session HOLImport: Reimplementation from scratch is faster, 
1246 
simpler, and more scalable. Requires a proof bundle, which is 

1247 
available as an external component. Discontinued old (and mostly 

1248 
dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY. 

1249 

1250 
* Session HOLWord: Discontinued many redundant theorems specific to 

1251 
type 'a word. INCOMPATIBILITY, use the corresponding generic theorems 

1252 
instead. 

1253 

1254 
word_sub_alt ~> word_sub_wi 

1255 
word_add_alt ~> word_add_def 

1256 
word_mult_alt ~> word_mult_def 

1257 
word_minus_alt ~> word_minus_def 

1258 
word_0_alt ~> word_0_wi 

1259 
word_1_alt ~> word_1_wi 

1260 
word_add_0 ~> add_0_left 

1261 
word_add_0_right ~> add_0_right 

1262 
word_mult_1 ~> mult_1_left 

1263 
word_mult_1_right ~> mult_1_right 

1264 
word_add_commute ~> add_commute 

1265 
word_add_assoc ~> add_assoc 

1266 
word_add_left_commute ~> add_left_commute 

1267 
word_mult_commute ~> mult_commute 

1268 
word_mult_assoc ~> mult_assoc 

1269 
word_mult_left_commute ~> mult_left_commute 

1270 
word_left_distrib ~> left_distrib 

1271 
word_right_distrib ~> right_distrib 

1272 
word_left_minus ~> left_minus 

1273 
word_diff_0_right ~> diff_0_right 

1274 
word_diff_self ~> diff_self 

1275 
word_sub_def ~> diff_minus 

1276 
word_diff_minus ~> diff_minus 

1277 
word_add_ac ~> add_ac 

1278 
word_mult_ac ~> mult_ac 

1279 
word_plus_ac0 ~> add_0_left add_0_right add_ac 

1280 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 

1281 
word_order_trans ~> order_trans 

1282 
word_order_refl ~> order_refl 

1283 
word_order_antisym ~> order_antisym 

1284 
word_order_linear ~> linorder_linear 

1285 
lenw1_zero_neq_one ~> zero_neq_one 

1286 
word_number_of_eq ~> number_of_eq 

1287 
word_of_int_add_hom ~> wi_hom_add 

1288 
word_of_int_sub_hom ~> wi_hom_sub 

1289 
word_of_int_mult_hom ~> wi_hom_mult 

1290 
word_of_int_minus_hom ~> wi_hom_neg 

1291 
word_of_int_succ_hom ~> wi_hom_succ 

1292 
word_of_int_pred_hom ~> wi_hom_pred 

1293 
word_of_int_0_hom ~> word_0_wi 

1294 
word_of_int_1_hom ~> word_1_wi 

1295 

47809  1296 
* Session HOLWord: New proof method "word_bitwise" for splitting 
1297 
machine word equalities and inequalities into logical circuits, 

1298 
defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction, 

1299 
multiplication, shifting by constants, bitwise operators and numeric 

1300 
constants. Requires fixedlength word types, not 'a word. Solves 

47854  1301 
many standard word identities outright and converts more into first 
47809  1302 
order problems amenable to blast or similar. See also examples in 
1303 
HOL/Word/Examples/WordExamples.thy. 

1304 

47807  1305 
* Session HOLProbability: Introduced the type "'a measure" to 
1306 
represent measures, this replaces the records 'a algebra and 'a 

1307 
measure_space. The locales based on subset_class now have two 

47856  1308 
localeparameters the space \<Omega> and the set of measurable sets M. 
1309 
The product of probability spaces uses now the same constant as the 

1310 
finite product of sigmafinite measure spaces "PiM :: ('i => 'a) 

47807  1311 
measure". Most constants are defined now outside of locales and gain 
1312 
an additional parameter, like null_sets, almost_eventually or \<mu>'. 

1313 
Measure space constructions for distributions and densities now got 

1314 
their own constants distr and density. Instead of using locales to 

1315 
describe measure spaces with a finite space, the measure count_space 

1316 
and point_measure is introduced. INCOMPATIBILITY. 

47694  1317 

1318 
Renamed constants: 

1319 
measure > emeasure 

1320 
finite_measure.\<mu>' > measure 

1321 
product_algebra_generator > prod_algebra 

1322 
product_prob_space.emb > prod_emb 

1323 
product_prob_space.infprod_algebra > PiM 

1324 

1325 
Removed locales: 

1326 
completeable_measure_space 

1327 
finite_measure_space 

1328 
finite_prob_space 

1329 
finite_product_finite_prob_space 

1330 
finite_product_sigma_algebra 

1331 
finite_sigma_algebra 

1332 
measure_space 

1333 
pair_finite_prob_space 

1334 
pair_finite_sigma_algebra 

1335 
pair_finite_space 

1336 
pair_sigma_algebra 

1337 
product_sigma_algebra 

1338 

1339 
Removed constants: 

47751  1340 
conditional_space 
47694  1341 
distribution > use distr measure, or distributed predicate 
47751  1342 
image_space 
47694  1343 
joint_distribution > use distr measure, or distributed predicate 
47751  1344 
pair_measure_generator 
47694  1345 
product_prob_space.infprod_algebra > use PiM 
1346 
subvimage 

1347 

1348 
Replacement theorems: 

47751  1349 
finite_additivity_sufficient > ring_of_sets.countably_additiveI_finite 
1350 
finite_measure.empty_measure > measure_empty 

1351 
finite_measure.finite_continuity_from_above > finite_measure.finite_Lim_measure_decseq 

1352 
finite_measure.finite_continuity_from_below > finite_measure.finite_Lim_measure_incseq 

1353 
finite_measure.finite_measure_countably_subadditive > finite_measure.finite_measure_subadditive_countably 

1354 
finite_measure.finite_measure_eq > finite_measure.emeasure_eq_measure 

1355 
finite_measure.finite_measure > finite_measure.emeasure_finite 

1356 
finite_measure.finite_measure_finite_singleton > finite_measure.finite_measure_eq_setsum_singleton 

1357 
finite_measure.positive_measure' > measure_nonneg 

1358 
finite_measure.real_measure > finite_measure.emeasure_real 

1359 
finite_product_prob_space.finite_measure_times > finite_product_prob_space.finite_measure_PiM_emb 

1360 
finite_product_sigma_algebra.in_P > sets_PiM_I_finite 

1361 
finite_product_sigma_algebra.P_empty > space_PiM_empty, sets_PiM_empty 

1362 
information_space.conditional_entropy_eq > information_space.conditional_entropy_simple_distributed 

1363 
information_space.conditional_entropy_positive > information_space.conditional_entropy_nonneg_simple 

1364 
information_space.conditional_mutual_information_eq_mutual_information > information_space.conditional_mutual_information_eq_mutual_information_simple 

1365 
information_space.conditional_mutual_information_generic_positive > information_space.conditional_mutual_information_nonneg_simple 

1366 
information_space.conditional_mutual_information_positive > information_space.conditional_mutual_information_nonneg_simple 

1367 
information_space.entropy_commute > information_space.entropy_commute_simple 

1368 
information_space.entropy_eq > information_space.entropy_simple_distributed 

1369 
information_space.entropy_generic_eq > information_space.entropy_simple_distributed 

1370 
information_space.entropy_positive > information_space.entropy_nonneg_simple 

1371 
information_space.entropy_uniform_max > information_space.entropy_uniform 

1372 
information_space.KL_eq_0_imp > information_space.KL_eq_0_iff_eq 

1373 
information_space.KL_eq_0 > information_space.KL_same_eq_0 

1374 
information_space.KL_ge_0 > information_space.KL_nonneg 

1375 
information_space.mutual_information_eq > information_space.mutual_information_simple_distributed 

1376 
information_space.mutual_information_positive > information_space.mutual_information_nonneg_simple 

1377 
Int_stable_cuboids > Int_stable_atLeastAtMost 

1378 
Int_stable_product_algebra_generator > positive_integral 

1379 
measure_preserving > equality "distr M N f = N" "f : measurable M N" 

47694  1380 
measure_space.additive > emeasure_additive 
47751  1381 
measure_space.AE_iff_null_set > AE_iff_null 
1382 
measure_space.almost_everywhere_def > eventually_ae_filter 

1383 
measure_space.almost_everywhere_vimage > AE_distrD 

1384 
measure_space.continuity_from_above > INF_emeasure_decseq 

1385 
measure_space.continuity_from_above_Lim > Lim_emeasure_decseq 

1386 
measure_space.continuity_from_below_Lim > Lim_emeasure_incseq 

47694  1387 
measure_space.continuity_from_below > SUP_emeasure_incseq 
47751  1388 
measure_space_density > emeasure_density 
1389 
measure_space.density_is_absolutely_continuous > absolutely_continuousI_density 

1390 
measure_space.integrable_vimage > integrable_distr 

1391 
measure_space.integral_translated_density > integral_density 

1392 
measure_space.integral_vimage > integral_distr 

1393 
measure_space.measure_additive > plus_emeasure 

1394 
measure_space.measure_compl > emeasure_compl 

1395 
measure_space.measure_countable_increasing > emeasure_countable_increasing 

1396 
measure_space.measure_countably_subadditive > emeasure_subadditive_countably 

47694  1397 
measure_space.measure_decseq > decseq_emeasure 
47751  1398 
measure_space.measure_Diff > emeasure_Diff 
1399 
measure_space.measure_Diff_null_set > emeasure_Diff_null_set 

47694  1400 
measure_space.measure_eq_0 > emeasure_eq_0 
1401 
measure_space.measure_finitely_subadditive > emeasure_subadditive_finite 

47751  1402 
measure_space.measure_finite_singleton > emeasure_eq_setsum_singleton 
1403 
measure_space.measure_incseq > incseq_emeasure 

1404 
measure_space.measure_insert > emeasure_insert 

1405 
measure_space.measure_mono > emeasure_mono 

1406 
measure_space.measure_not_negative > emeasure_not_MInf 

1407 
measure_space.measure_preserving_Int_stable > measure_eqI_generator_eq 

1408 
measure_space.measure_setsum > setsum_emeasure 

1409 
measure_space.measure_setsum_split > setsum_emeasure_cover 

47694  1410 
measure_space.measure_space_vimage > emeasure_distr 
47751  1411 
measure_space.measure_subadditive_finite > emeasure_subadditive_finite 
1412 
measure_space.measure_subadditive > subadditive 

1413 
measure_space.measure_top > emeasure_space 

1414 
measure_space.measure_UN_eq_0 > emeasure_UN_eq_0 

1415 
measure_space.measure_Un_null_set > emeasure_Un_null_set 

1416 
measure_space.positive_integral_translated_density > positive_integral_density 

1417 
measure_space.positive_integral_vimage > positive_integral_distr 

47694  1418 
measure_space.real_continuity_from_above > Lim_measure_decseq 
47751  1419 
measure_space.real_continuity_from_below > Lim_measure_incseq 
47694  1420 
measure_space.real_measure_countably_subadditive > measure_subadditive_countably 
47751  1421 
measure_space.real_measure_Diff > measure_Diff 
1422 
measure_space.real_measure_finite_Union > measure_finite_Union 

1423 
measure_space.real_measure_setsum_singleton > measure_eq_setsum_singleton 

1424 
measure_space.real_measure_subadditive > measure_subadditive 

1425 
measure_space.real_measure_Union > measure_Union 

1426 
measure_space.real_measure_UNION > measure_UNION 

47694  1427 
measure_space.simple_function_vimage > simple_function_comp 
1428 
measure_space.simple_integral_vimage > simple_integral_distr 

47751  1429 
measure_space.simple_integral_vimage > simple_integral_distr 
1430 
measure_unique_Int_stable > measure_eqI_generator_eq 

1431 
measure_unique_Int_stable_vimage > measure_eqI_generator_eq 

47694  1432 
pair_sigma_algebra.measurable_cut_fst > sets_Pair1 
1433 
pair_sigma_algebra.measurable_cut_snd > sets_Pair2 

1434 
pair_sigma_algebra.measurable_pair_image_fst > measurable_Pair1 

1435 
pair_sigma_algebra.measurable_pair_image_snd > measurable_Pair2 

1436 
pair_sigma_algebra.measurable_product_swap > measurable_pair_swap_iff 

1437 
pair_sigma_algebra.pair_sigma_algebra_measurable > measurable_pair_swap 

1438 
pair_sigma_algebra.pair_sigma_algebra_swap_measurable > measurable_pair_swap' 
