author  wenzelm 
Sat, 19 Jan 2013 22:17:26 +0100  
changeset 50987  616789281413 
parent 50878  2840522a936d 
child 50991  b3c6c9ef11b8 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant 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 Isabelle20111. 
c422128d3889
discontinued obsolete method fastsimp / tactic fast_simp_tac;
wenzelm
parents:
47958
diff
changeset

33 

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

48120
9fe0e71052a0
updated "isarref" 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 

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

41 
* Attribute "consumes" allows a negative value as well, which is 
50778  42 
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

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

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

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

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

47 

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

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

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

50 

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

53 

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

54 

49968  55 
*** Prover IDE  Isabelle/Scala/jEdit *** 
56 

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

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

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

60 
surface, while the prover is still crunching on internal 

61 
justifications. Unfinished / cancelled proofs are restarted as 

62 
required to complete full proof checking eventually. 

63 

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

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

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

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

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

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

70 

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

73 
browser on demand. 

74 

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

77 
comment delimiters works more conveniently with unfinished situations 

78 
that frequently occur in user interaction. 

79 

80 
* More efficient painting and improved reactivity when editing large 

81 
files. More scalable management of formal document content. 

82 

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

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

84 
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

85 
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

86 
potentially infinite message streams. 
49968  87 

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

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

90 
options, including tuning parameters for editor reactivity and color 

91 
schemes. 

92 

50184  93 
* Dockable window "Symbols" provides some editing support for Isabelle 
94 
symbols. 

95 

50701  96 
* Dockable window "Monitor" shows ML runtime statistics. 
97 

50183  98 
* Improved editing support for control styles: subscript, superscript, 
99 
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

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

101 

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

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

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

50183  106 

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

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

110 

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

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

112 
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

113 
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

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

115 

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

118 
now bundled exclusively with Isabelle. 

119 

120 

48205  121 
*** Pure *** 
122 

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

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

124 
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

125 

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

128 
rather arbitrary current working directory. INCOMPATIBILITY. 

48371  129 

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

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

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

134 
with some care where this is really required. 

135 

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

138 
given given sort. Example (in HOL): 

139 

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

141 

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

144 

48205  145 

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

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

147 

50646  148 
* Sledgehammer: 
149 

150 
 Added MaSh relevance filter based on machinelearning; see the 

151 
Sledgehammer manual for details. 

152 
 Polished Isar proofs generated with "isar_proofs" option. 

153 
 Rationalized type encodings ("type_enc" option). 

50720  154 
 Renamed "kill_provers" subcommand to "kill_all". 
50646  155 
 Renamed options: 
156 
isar_proof ~> isar_proofs 

157 
isar_shrink_factor ~> isar_shrink 

158 
max_relevant ~> max_facts 

159 
relevance_thresholds ~> fact_thresholds 

160 

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

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

163 
configuration quickcheck_optimise_equality to false. 

164 

50878  165 
* Quotient: only one quotient can be defined by quotient_type 
166 
INCOMPATIBILITY. 

167 

168 
* Lifting: 

169 
 generation of an abstraction function equation in lift_definition 

170 
 quot_del attribute 

171 
 renamed no_abs_code > no_code (INCOMPATIBILITY.) 

172 

50646  173 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
174 
expressions. 

175 

176 
* Preprocessing of the code generator rewrites set comprehensions into 

177 
pointfree expressions. 

178 

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

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

181 
arithmetic, datatypes/records) with potential proof reconstruction 

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

183 
INCOMPATIBILITY. 

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

184 

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

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

186 
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

187 
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

188 
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

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

190 

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

193 

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

195 
List. INCOMPATIBILITY. 

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

196 

49739  197 
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. 
198 

49738  199 
* Class "comm_monoid_diff" formalises properties of bounded 
49388  200 
subtraction, with natural numbers and multisets as typical instances. 
201 

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

204 
* Theory "Transitive_Closure": renamed lemmas 

205 

206 
reflcl_tranclp > reflclp_tranclp 

207 
rtranclp_reflcl > rtranclp_reflclp 

208 

209 
INCOMPATIBILITY. 

210 

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

212 

213 
left_distrib ~> distrib_right 

214 
right_distrib ~> distrib_left 

215 

216 
INCOMPATIBILITY. 

217 

218 
* Generalized the definition of limits: 

219 

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

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

222 
output f x converges to G. 

223 

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

225 
infinity (at_bot). 

226 

227 
 Moved infinity in the norm (at_infinity) from 

228 
Multivariate_Analysis to Complex_Main. 

229 

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

231 
at_top". 

232 

233 
INCOMPATIBILITY. 

234 

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

236 
lattice type classes. 

237 

238 
* Theory "Library/Multiset": renamed 

239 

240 
constant fold_mset ~> Multiset.fold 

241 
fact fold_mset_commute ~> fold_mset_comm 

242 

243 
INCOMPATIBILITY. 

244 

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

246 
changes as follows. 

247 

248 
 Renamed constants (and related lemmas) 

49145  249 

250 
prefix ~> prefixeq 

251 
strict_prefix ~> prefix 

252 

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

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

256 
Renamed lemmas accordingly. 

257 

258 
 Added constant "list_hembeq" for homeomorphic embedding on 

259 
lists. Added abbreviation "sublisteq" for special case 

260 
"list_hembeq (op =)". 

261 

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

263 
class instances for the prefix order (merely corresponding locale 

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

265 
Library/Prefix_Order. 

266 

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

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

50516  269 

270 
le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff 

271 
le_list_append_mono ~> Sublist.list_hembeq_append_mono 

272 
le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2 

273 
le_list_Cons_EX ~> Sublist.list_hembeq_ConsD 

274 
le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2' 

275 
le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq 

276 
le_list_drop_Cons ~> Sublist.sublisteq_Cons' 

277 
le_list_drop_many ~> Sublist.sublisteq_drop_many 

278 
le_list_filter_left ~> Sublist.sublisteq_filter_left 

279 
le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many 

280 
le_list_rev_take_iff ~> Sublist.sublisteq_append 

281 
le_list_same_length ~> Sublist.sublisteq_same_length 

282 
le_list_take_many_iff ~> Sublist.sublisteq_append' 

49145  283 
less_eq_list.drop ~> less_eq_list_drop 
284 
less_eq_list.induct ~> less_eq_list_induct 

50516  285 
not_le_list_length ~> Sublist.not_sublisteq_length 
49145  286 

50646  287 
INCOMPATIBILITY. 
288 

289 

290 
* New theory Library/Countable_Set. 

291 

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

293 
parallel execution for code generated towards Isabelle/ML. 

294 

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

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

297 
extensional_funcset by an abbreviation, and renamed lemmas from 

298 
extensional_funcset to PiE as follows: 

299 

300 
extensional_empty ~> PiE_empty 

301 
extensional_funcset_empty_domain ~> PiE_empty_domain 

302 
extensional_funcset_empty_range ~> PiE_empty_range 

303 
extensional_funcset_arb ~> PiE_arb 

304 
extensional_funcset_mem ~> PiE_mem 

305 
extensional_funcset_extend_domainI ~> PiE_fun_upd 

306 
extensional_funcset_restrict_domain ~> fun_upd_in_PiE 

307 
extensional_funcset_extend_domain_eq ~> PiE_insert_eq 

308 
card_extensional_funcset ~> card_PiE 

309 
finite_extensional_funcset ~> finite_PiE 

310 

311 
INCOMPATIBILITY. 

312 

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

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

315 
Data"). 

316 

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

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

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

320 
code. 

321 

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

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

324 
return a structurally different tree than before. Potential 

325 
INCOMPATIBILITY. 

326 

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

328 

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

330 

331 
* HOL/Multivariate_Analysis: replaced 

332 

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

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

335 

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

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

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

339 

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

341 

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

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

344 
cart_base i removed 

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

346 

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

347 
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

348 

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

349 
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

350 

50646  351 
component_le_norm ~> Basis_le_norm 
352 
euclidean_eq ~> euclidean_eq_iff 

353 
differential_zero_maxmin_component ~> differential_zero_maxmin_cart 

354 
euclidean_simps ~> inner_simps 

355 
independent_basis ~> independent_Basis 

356 
span_basis ~> span_Basis 

357 
in_span_basis ~> in_span_Basis 

358 
norm_bound_component_le ~> norm_boound_Basis_le 

359 
norm_bound_component_lt ~> norm_boound_Basis_lt 

360 
component_le_infnorm ~> Basis_le_infnorm 

361 

362 
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

363 

50141  364 
* HOL/Probability: 
50646  365 

366 
 Added simproc "measurable" to automatically prove measurability. 

367 

368 
 Added induction rules for sigma sets with disjoint union 

369 
(sigma_sets_induct_disjoint) and for Borelmeasurable functions 

370 
(borel_measurable_induct). 

371 

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

373 
projective family). 

374 

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

376 
AFP entry "Ordinals_and_Cardinals"). 

377 

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

379 
with support for mixed, nested recursion and interesting nonfree 

380 
datatypes. 

48094  381 

50878  382 
* HOL/Finite_Set and Relation: added new set and relation operations 
383 
expressed by Finite_Set.fold. 

384 

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

386 
trees for the code generator. 

387 

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

389 
Lifting/Transfer. 

390 
possible INCOMPATIBILITY. 

391 

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

393 
INCOMPATIBILITY. 

394 

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

395 

48206  396 
*** Document preparation *** 
397 

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

400 
Discontinued legacy styles "prem1" .. "prem19". 

401 

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

403 
instead of slightly exotic babel/greek. 

48206  404 

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

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

406 
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

407 
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

408 

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

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

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

411 

48206  412 

48992  413 
*** ML *** 
414 

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

417 
hardware and Poly/ML runtime system. 

418 

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

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

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

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

422 

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

425 
necessarily printing visible text. 

426 

427 

48206  428 
*** System *** 
429 

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

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

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

434 

435 
* Discontinued obsolete "isabelle makeall". 

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

436 

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

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

438 
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

439 
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

440 
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

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

442 

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

445 

446 
isabelle build s b HOLCF 

447 

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

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

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

450 

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

453 
"isabelle usedir". 

454 

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

457 

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

459 
INCOMPATIBILITY. 

460 

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

463 
version of Isabelle. 

464 

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

467 

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

469 
picked up from some surrounding directory. Potential INCOMPATIBILITY 

470 
for homemade settings. 

50132  471 

50701  472 
* Improved ML runtime statistics (heap, threads, future tasks etc.). 
473 

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

476 
configuration. 

477 

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

480 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

482 
bundled as Isabelle component. 

48206  483 

50182  484 

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

485 

47462  486 
New in Isabelle2012 (May 2012) 
487 
 

45109  488 

45593  489 
*** General *** 
490 

45614  491 
* Prover IDE (PIDE) improvements: 
492 

47585  493 
 more robust Sledgehammer integration (as before the sledgehammer 
47806  494 
commandline needs to be typed into the source buffer) 
45614  495 
 markup for bound variables 
47806  496 
 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

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

45614  500 

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

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

46485  504 

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

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

506 
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

507 
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

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

509 
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

510 

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

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

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

513 
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

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

515 

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

516 
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

517 

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

518 
end 
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 
thm my_trans 
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 
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

523 
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

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

525 

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

526 
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

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

528 

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

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

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

47484  534 

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

537 
oldstyle "standard" after instantiation or composition of facts 

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

539 
indices of schematic variables. 

540 

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

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

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

544 
the historic accident of dynamic reevaluation in interpretations 

545 
etc. was exploited. 

546 

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

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

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

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

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

552 
of the material of that old tutorial. 

553 

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

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

556 
manual. 

557 

558 

559 
*** Pure *** 

560 

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

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

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

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

564 

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

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

568 
undocumented feature.) 

569 

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

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

573 

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

575 

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

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

578 

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

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

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

582 
order to accommodate newly introduced premises.) 

583 

47806  584 
* Renamed some inner syntax categories: 
585 

586 
num ~> num_token 

587 
xnum ~> xnum_token 

588 
xstr ~> str_token 

589 

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

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

592 
position information via constraints). 

593 

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

596 
manual. Minor INCOMPATIBILITY. 

597 

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

45134  600 

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

603 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  604 

47464  605 
* Redundant attribute "code_inline" has been discontinued. Use 
606 
"code_unfold" instead. INCOMPATIBILITY. 

607 

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

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

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

610 

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

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

612 

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

613 
INCOMPATIBILITY. 
45383  614 

47856  615 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
616 
instead. INCOMPATIBILITY. 

617 

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

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

620 
legacy since Isabelle2011). 

47855  621 

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

622 

45122  623 
*** HOL *** 
624 

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

627 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

632 
tinkering with former theorems mem_def and Collect_def as far as 

633 
possible. 

634 

635 
For developments which deliberately mix predicates and sets, a 

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

638 
Isabelle20111 before jumping right into the current release. 

639 

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

642 

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

644 

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

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

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

650 
user theories may require adaptations as follows: 

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

651 

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

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

653 
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

654 

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

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

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

657 
after classes one and semigroup_add have been instantiated. 
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 
 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

660 
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

661 

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

662 
 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

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

664 
simprocs may now apply within the proof. 
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 
 Definitions and theorems using old constructors Pls/Min/Bit0/Bit1: 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

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

668 

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

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

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

673 
corresponding parts of the Quotient package.) 

47809  674 

675 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

677 
relate different type instances of the same polymorphic constant, 

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

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

680 

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

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

683 

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

685 
equivalent subgoal on the corresponding raw types. Constants are 

686 
replaced with corresponding ones according to the transfer rules. 

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

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

692 

693 
 relator_eq attribute: Collects identity laws for relators of 

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

695 
transfer method uses these lemmas to infer transfer rules for 

696 
nonpolymorphic constants on the fly. 

697 

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

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

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

701 
after unfolding the constant definitions. 

702 

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

704 
from type nat to type int. 

705 

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

47809  708 

709 
 lift_definition command: Defines operations on an abstract type in 

710 
terms of a corresponding operation on a representation 

711 
type. Example syntax: 

712 

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

714 
is List.insert 

715 

716 
Users must discharge a respectfulness proof obligation when each 

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

718 
the proof is discharged automatically.) The obligation is 

719 
presented in a userfriendly, readable form; a respectfulness 

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

721 
by the package. 

722 

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

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

725 
lift_definition generates a code certificate theorem and sets up 

726 
code generation for each constant. 

727 

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

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

730 
or a type_definition theorem. The package configures transfer 

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

732 
lift_definition command to work with the type. 

733 

734 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  735 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
736 
Word/Word.thy and Library/Float.thy. 

47809  737 

738 
* Quotient package: 

739 

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

741 
rep and abs functions, similar to typedef. 

742 

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

744 
Transfer packages, as with 'setup_lifting'. 

745 

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

747 
respectfulness property at the point where the constant is 

748 
defined, similar to lift_definition; INCOMPATIBILITY. 

749 

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

751 
accordingly, INCOMPATIBILITY. 

752 

753 
* New diagnostic command 'find_unused_assms' to find potentially 

754 
superfluous assumptions in theorems using Quickcheck. 

755 

756 
* Quickcheck: 

757 

758 
 Quickcheck returns variable assignments as counterexamples, which 

759 
allows to reveal the underspecification of functions under test. 

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

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

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

763 

764 
These counterexample are marked as potentially spurious, as 

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

766 
obvious theorem "hd xs = hd xs". 

767 

768 
After finding a potentially spurious counterexample, Quickcheck 

769 
continues searching for genuine ones. 

770 

771 
By default, Quickcheck shows potentially spurious and genuine 

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

773 
show genuine counterexamples. 

774 

775 
 The command 'quickcheck_generator' creates random and exhaustive 

776 
value generators for a given type and operations. 

777 

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

779 
constructors of that type. 

780 

781 
 Support for multisets. 

782 

783 
 Added "use_subtype" options. 

784 

785 
 Added "quickcheck_locale" configuration to specify how to process 

786 
conjectures in a locale context. 

787 

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

47809  790 

791 
* Sledgehammer: 

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

793 
paper "More SPASS with Isabelle". 

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

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

796 
TFF1), iProver, iProverEq. 

797 
 Sped up the minimizer. 

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

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

800 
 Renamed "sound" option to "strict". 

801 

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

804 

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

806 

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

47809  808 

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

811 

812 
list.exhaust [case_product nat.exhaust] 

813 

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

815 
a list and a nat. 

816 

47809  817 
* New "eventually_elim" method as a generalized variant of the 
47855  818 
eventually_elim* rules. Supports structured proofs. 
819 

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

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

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

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

823 

47856  824 
* Record: code generation can be switched off manually with 
825 

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

827 

828 
* Datatype: type parameters allow explicit sort constraints. 

829 

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

832 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

834 
one_case. 

835 

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

837 
the result of the fact expression. 

838 

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

839 
* More default pred/set conversions on a couple of relation operations 
47464  840 
and predicates. Added powers of predicate relations. Consolidation 
841 
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

842 

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 
converse_def ~> converse_unfold 
47549  844 
rel_comp_def ~> relcomp_unfold 
47820  845 
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

846 
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

847 
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

848 
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

849 

46981  850 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
851 

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

47086  854 

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

855 
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

856 

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

46458  860 
rel_pow_1 ~> relpow_1 
46363  861 
rel_pow_0_I ~> relpow_0_I 
862 
rel_pow_Suc_I ~> relpow_Suc_I 

863 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

864 
rel_pow_0_E ~> relpow_0_E 

865 
rel_pow_Suc_E ~> relpow_Suc_E 

866 
rel_pow_E ~> relpow_E 

46458  867 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  868 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  869 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
870 
rel_pow_E2 ~> relpow_E2 

871 
rel_pow_add ~> relpow_add 

872 
rel_pow_commute ~> relpow 

873 
rel_pow_empty ~> relpow_empty: 

874 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

875 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

876 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

877 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

878 
rel_pow_fun_conv ~> relpow_fun_conv 

879 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

880 
rel_pow_finite_bounded ~> relpow_finite_bounded 

881 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

882 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

883 
single_valued_rel_pow ~> single_valued_relpow 

47463  884 

46363  885 
INCOMPATIBILITY. 
886 

47448  887 
* Theory Relation: Consolidated constant name for relation composition 
47464  888 
and corresponding theorem names: 
889 

47549  890 
 Renamed constant rel_comp to relcomp. 
47464  891 

47448  892 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  893 

47448  894 
 Renamed theorems: 
47464  895 

47448  896 
rel_compI ~> relcompI 
897 
rel_compEpair ~> relcompEpair 

898 
rel_compE ~> relcompE 

899 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

900 
rel_comp_empty1 ~> relcomp_empty1 

901 
rel_comp_mono ~> relcomp_mono 

902 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

903 
rel_comp_distrib ~> relcomp_distrib 

904 
rel_comp_distrib2 ~> relcomp_distrib2 

905 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

906 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

907 
single_valued_rel_comp ~> single_valued_relcomp 

47549  908 
rel_comp_def ~> relcomp_unfold 
47448  909 
converse_rel_comp ~> converse_relcomp 
910 
pred_compI ~> relcomppI 

911 
pred_compE ~> relcomppE 

912 
pred_comp_bot1 ~> relcompp_bot1 

913 
pred_comp_bot2 ~> relcompp_bot2 

914 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

915 
pred_comp_mono ~> relcompp_mono 

916 
pred_comp_distrib ~> relcompp_distrib 

917 
pred_comp_distrib2 ~> relcompp_distrib2 

918 
converse_pred_comp ~> converse_relcompp 

47464  919 

47448  920 
finite_rel_comp ~> finite_relcomp 
47464  921 

47448  922 
set_rel_comp ~> set_relcomp 
923 

924 
INCOMPATIBILITY. 

925 

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

928 

929 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

930 
zdiv_self ~> div_self 

931 
zmod_self ~> mod_self 

932 
zdiv_zero ~> div_0 

933 
zmod_zero ~> mod_0 

934 
zdiv_zmod_equality ~> div_mod_equality2 

935 
zdiv_zmod_equality2 ~> div_mod_equality 

936 
zmod_zdiv_trivial ~> mod_div_trivial 

937 
zdiv_zminus_zminus ~> div_minus_minus 

938 
zmod_zminus_zminus ~> mod_minus_minus 

939 
zdiv_zminus2 ~> div_minus_right 

940 
zmod_zminus2 ~> mod_minus_right 

941 
zdiv_minus1_right ~> div_minus1_right 

942 
zmod_minus1_right ~> mod_minus1_right 

943 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

944 
zmod_zmult1_eq ~> mod_mult_right_eq 

945 
zpower_zmod ~> power_mod 

946 
zdvd_zmod ~> dvd_mod 

947 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

948 
mod_mult_distrib ~> mult_mod_left 

949 
mod_mult_distrib2 ~> mult_mod_right 

950 

951 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

952 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

953 

47551  954 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
955 

47552  956 
* Consolidated theorem names concerning fold combinators: 
47550  957 

958 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

959 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

960 
INFI_fold_inf ~> INF_fold_inf 

961 
SUPR_fold_sup ~> SUP_fold_sup 

962 
union_set ~> union_set_fold 

963 
minus_set ~> minus_set_fold 

964 
INFI_set_fold ~> INF_set_fold 

965 
SUPR_set_fold ~> SUP_set_fold 

966 
INF_code ~> INF_set_foldr 

967 
SUP_code ~> SUP_set_foldr 

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

969 
foldr_fold_rev ~> foldr_conv_fold 

970 
foldl_fold ~> foldl_conv_fold 

971 
foldr_foldr ~> foldr_conv_foldl 

972 
foldl_foldr ~> foldl_conv_foldr 

47552  973 
fold_set_remdups ~> fold_set_fold_remdups 
974 
fold_set ~> fold_set_fold 

975 
fold1_set ~> fold1_set_fold 

47550  976 

977 
INCOMPATIBILITY. 

978 

979 
* Dropped rarely useful theorems concerning fold combinators: 

980 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

981 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

982 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

983 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

984 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

985 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

989 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

990 

991 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

992 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

993 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

994 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

996 
fold_conv_foldr and fold_rev. 

997 

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

999 
through option types. 

1000 

47856  1001 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
1002 
relations. 

1003 

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

1005 

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

1007 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

1008 

1009 
zminus_zminus ~> minus_minus 

1010 
zminus_0 ~> minus_zero 

1011 
zminus_zadd_distrib ~> minus_add_distrib 

1012 
zadd_commute ~> add_commute 

1013 
zadd_assoc ~> add_assoc 

1014 
zadd_left_commute ~> add_left_commute 

1015 
zadd_ac ~> add_ac 

1016 
zmult_ac ~> mult_ac 

1017 
zadd_0 ~> add_0_left 

1018 
zadd_0_right ~> add_0_right 

1019 
zadd_zminus_inverse2 ~> left_minus 

1020 
zmult_zminus ~> mult_minus_left 

1021 
zmult_commute ~> mult_commute 

1022 
zmult_assoc ~> mult_assoc 

1023 
zadd_zmult_distrib ~> left_distrib 

1024 
zadd_zmult_distrib2 ~> right_distrib 

1025 
zdiff_zmult_distrib ~> left_diff_distrib 

1026 
zdiff_zmult_distrib2 ~> right_diff_distrib 

1027 
zmult_1 ~> mult_1_left 

1028 
zmult_1_right ~> mult_1_right 

1029 
zle_refl ~> order_refl 

1030 
zle_trans ~> order_trans 

1031 
zle_antisym ~> order_antisym 

1032 
zle_linear ~> linorder_linear 

1033 
zless_linear ~> linorder_less_linear 

1034 
zadd_left_mono ~> add_left_mono 

1035 
zadd_strict_right_mono ~> add_strict_right_mono 

1036 
zadd_zless_mono ~> add_less_le_mono 

1037 
int_0_less_1 ~> zero_less_one 

1038 
int_0_neq_1 ~> zero_neq_one 

1039 
zless_le ~> less_le 

1040 
zpower_zadd_distrib ~> power_add 

1041 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

1042 
zero_le_zpower_abs ~> zero_le_power_abs 

1043 

1044 
* Theory Deriv: Renamed 

1045 

1046 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

1047 

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

1049 

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

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

1054 
INCOMPATIBILITY. 

1055 

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

1058 

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

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

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

1063 
follows: 

47452  1064 

1065 
Operations: 

1066 
bulkload > rbt_bulkload 

1067 
del_from_left > rbt_del_from_left 

1068 
del_from_right > rbt_del_from_right 

1069 
del > rbt_del 

1070 
delete > rbt_delete 

1071 
ins > rbt_ins 

1072 
insert > rbt_insert 

1073 
insertw > rbt_insert_with 

1074 
insert_with_key > rbt_insert_with_key 

1075 
map_entry > rbt_map_entry 

1076 
lookup > rbt_lookup 

1077 
sorted > rbt_sorted 

1078 
tree_greater > rbt_greater 

1079 
tree_less > rbt_less 

1080 
tree_less_symbol > rbt_less_symbol 

1081 
union > rbt_union 

1082 
union_with > rbt_union_with 

1083 
union_with_key > rbt_union_with_key 

1084 

1085 
Lemmas: 

1086 
balance_left_sorted > balance_left_rbt_sorted 

1087 
balance_left_tree_greater > balance_left_rbt_greater 

1088 
balance_left_tree_less > balance_left_rbt_less 

1089 
balance_right_sorted > balance_right_rbt_sorted 

1090 
balance_right_tree_greater > balance_right_rbt_greater 

1091 
balance_right_tree_less > balance_right_rbt_less 

1092 
balance_sorted > balance_rbt_sorted 

1093 
balance_tree_greater > balance_rbt_greater 

1094 
balance_tree_less > balance_rbt_less 

1095 
bulkload_is_rbt > rbt_bulkload_is_rbt 

1096 
combine_sorted > combine_rbt_sorted 

1097 
combine_tree_greater > combine_rbt_greater 

1098 
combine_tree_less > combine_rbt_less 

1099 
delete_in_tree > rbt_delete_in_tree 

1100 
delete_is_rbt > rbt_delete_is_rbt 

1101 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

1102 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

1103 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

1104 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

1105 
del_in_tree > rbt_del_in_tree 

1106 
del_inv1_inv2 > rbt_del_inv1_inv2 

1107 
del_sorted > rbt_del_rbt_sorted 

1108 
del_tree_greater > rbt_del_rbt_greater 

1109 
del_tree_less > rbt_del_rbt_less 

1110 
dom_lookup_Branch > dom_rbt_lookup_Branch 

1111 
entries_lookup > entries_rbt_lookup 

1112 
finite_dom_lookup > finite_dom_rbt_lookup 

1113 
insert_sorted > rbt_insert_rbt_sorted 

1114 
insertw_is_rbt > rbt_insertw_is_rbt 

1115 
insertwk_is_rbt > rbt_insertwk_is_rbt 

1116 
insertwk_sorted > rbt_insertwk_rbt_sorted 

1117 
insertw_sorted > rbt_insertw_rbt_sorted 

1118 
ins_sorted > ins_rbt_sorted 

1119 
ins_tree_greater > ins_rbt_greater 

1120 
ins_tree_less > ins_rbt_less 

1121 
is_rbt_sorted > is_rbt_rbt_sorted 

1122 
lookup_balance > rbt_lookup_balance 

1123 
lookup_bulkload > rbt_lookup_rbt_bulkload 

1124 
lookup_delete > rbt_lookup_rbt_delete 

1125 
lookup_Empty > rbt_lookup_Empty 

1126 
lookup_from_in_tree > rbt_lookup_from_in_tree 

1127 
lookup_in_tree > rbt_lookup_in_tree 

1128 
lookup_ins > rbt_lookup_ins 

1129 
lookup_insert > rbt_lookup_rbt_insert 

1130 
lookup_insertw > rbt_lookup_rbt_insertw 

1131 
lookup_insertwk > rbt_lookup_rbt_insertwk 

1132 
lookup_keys > rbt_lookup_keys 

1133 
lookup_map > rbt_lookup_map 

1134 
lookup_map_entry > rbt_lookup_rbt_map_entry 

1135 
lookup_tree_greater > rbt_lookup_rbt_greater 

1136 
lookup_tree_less > rbt_lookup_rbt_less 

1137 
lookup_union > rbt_lookup_rbt_union 

1138 
map_entry_color_of > rbt_map_entry_color_of 

1139 
map_entry_inv1 > rbt_map_entry_inv1 

1140 
map_entry_inv2 > rbt_map_entry_inv2 

1141 
map_entry_is_rbt > rbt_map_entry_is_rbt 

1142 
map_entry_sorted > rbt_map_entry_rbt_sorted 

1143 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

1144 
map_entry_tree_less > rbt_map_entry_rbt_less 

1145 
map_tree_greater > map_rbt_greater 

1146 
map_tree_less > map_rbt_less 

1147 
map_sorted > map_rbt_sorted 

1148 
paint_sorted > paint_rbt_sorted 

1149 
paint_lookup > paint_rbt_lookup 

1150 
paint_tree_greater > paint_rbt_greater 

1151 
paint_tree_less > paint_rbt_less 

1152 
sorted_entries > rbt_sorted_entries 

1153 
tree_greater_eq_trans > rbt_greater_eq_trans 

1154 
tree_greater_nit > rbt_greater_nit 

1155 
tree_greater_prop > rbt_greater_prop 

1156 
tree_greater_simps > rbt_greater_simps 

1157 
tree_greater_trans > rbt_greater_trans 

1158 
tree_less_eq_trans > rbt_less_eq_trans 

1159 
tree_less_nit > rbt_less_nit 

1160 
tree_less_prop > rbt_less_prop 

1161 
tree_less_simps > rbt_less_simps 

1162 
tree_less_trans > rbt_less_trans 

1163 
tree_ord_props > rbt_ord_props 

1164 
union_Branch > rbt_union_Branch 

1165 
union_is_rbt > rbt_union_is_rbt 

1166 
unionw_is_rbt > rbt_unionw_is_rbt 

1167 
unionwk_is_rbt > rbt_unionwk_is_rbt 

1168 
unionwk_sorted > rbt_unionwk_rbt_sorted 

1169 

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

1172 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  1173 

1174 
Changed Operations: 

47622  1175 
float_abs > abs 
1176 
float_nprt > nprt 

1177 
float_pprt > pprt 

1178 
pow2 > use powr 

1179 
round_down > float_round_down 

1180 
round_up > float_round_up 

1181 
scale > exponent 

1182 

1183 
Removed Operations: 

1184 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

1185 

1186 
Renamed Lemmas: 

1187 
abs_float_def > Float.compute_float_abs 

1188 
bitlen_ge0 > bitlen_nonneg 

1189 
bitlen.simps > Float.compute_bitlen 

1190 
float_components > Float_mantissa_exponent 

1191 
float_divl.simps > Float.compute_float_divl 

1192 
float_divr.simps > Float.compute_float_divr 

1193 
float_eq_odd > mult_powr_eq_mult_powr_iff 

1194 
float_power > real_of_float_power 

1195 
lapprox_posrat_def > Float.compute_lapprox_posrat 

1196 
lapprox_rat.simps > Float.compute_lapprox_rat 

1197 
le_float_def' > Float.compute_float_le 

1198 
le_float_def > less_eq_float.rep_eq 

1199 
less_float_def' > Float.compute_float_less 

1200 
less_float_def > less_float.rep_eq 

1201 
normfloat_def > Float.compute_normfloat 

1202 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

1203 
normfloat > normfloat_def 

1204 
normfloat_unique > use normfloat_def 

1205 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

1206 
one_float_def > Float.compute_float_one 

1207 
plus_float_def > Float.compute_float_plus 

1208 
rapprox_posrat_def > Float.compute_rapprox_posrat 

1209 
rapprox_rat.simps > Float.compute_rapprox_rat 

1210 
real_of_float_0 > zero_float.rep_eq 

1211 
real_of_float_1 > one_float.rep_eq 

1212 
real_of_float_abs > abs_float.rep_eq 

1213 
real_of_float_add > plus_float.rep_eq 

1214 
real_of_float_minus > uminus_float.rep_eq 

1215 
real_of_float_mult > times_float.rep_eq 

1216 
real_of_float_simp > Float.rep_eq 

1217 
real_of_float_sub > minus_float.rep_eq 

1218 
round_down.simps > Float.compute_float_round_down 

1219 
round_up.simps > Float.compute_float_round_up 

1220 
times_float_def > Float.compute_float_times 

1221 
uminus_float_def > Float.compute_float_uminus 

1222 
zero_float_def > Float.compute_float_zero 

1223 

1224 
Lemmas not necessary anymore, use the transfer method: 

1225 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

1226 
float_divr, float_le_simp, float_less1_mantissa_bound, 

1227 
float_less_simp, float_less_zero, float_le_zero, 

1228 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

1229 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

1230 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

1231 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

1232 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

1233 
round_up, zero_le_float, zero_less_float 

47616  1234 

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

45791  1237 

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

1240 

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

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

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

1245 

1246 
* Session HOLWord: Discontinued many redundant theorems specific to 

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

1248 
instead. 

1249 

1250 
word_sub_alt ~> word_sub_wi 

1251 
word_add_alt ~> word_add_def 

1252 
word_mult_alt ~> word_mult_def 

1253 
word_minus_alt ~> word_minus_def 

1254 
word_0_alt ~> word_0_wi 

1255 
word_1_alt ~> word_1_wi 

1256 
word_add_0 ~> add_0_left 

1257 
word_add_0_right ~> add_0_right 

1258 
word_mult_1 ~> mult_1_left 

1259 
word_mult_1_right ~> mult_1_right 

1260 
word_add_commute ~> add_commute 

1261 
word_add_assoc ~> add_assoc 

1262 
word_add_left_commute ~> add_left_commute 

1263 
word_mult_commute ~> mult_commute 

1264 
word_mult_assoc ~> mult_assoc 

1265 
word_mult_left_commute ~> mult_left_commute 

1266 
word_left_distrib ~> left_distrib 

1267 
word_right_distrib ~> right_distrib 

1268 
word_left_minus ~> left_minus 

1269 
word_diff_0_right ~> diff_0_right 

1270 
word_diff_self ~> diff_self 

1271 
word_sub_def ~> diff_minus 

1272 
word_diff_minus ~> diff_minus 

1273 
word_add_ac ~> add_ac 

1274 
word_mult_ac ~> mult_ac 

1275 
word_plus_ac0 ~> add_0_left add_0_right add_ac 

1276 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 

1277 
word_order_trans ~> order_trans 

1278 
word_order_refl ~> order_refl 

1279 
word_order_antisym ~> order_antisym 

1280 
word_order_linear ~> linorder_linear 

1281 
lenw1_zero_neq_one ~> zero_neq_one 

1282 
word_number_of_eq ~> number_of_eq 

1283 
word_of_int_add_hom ~> wi_hom_add 

1284 
word_of_int_sub_hom ~> wi_hom_sub 

1285 
word_of_int_mult_hom ~> wi_hom_mult 

1286 
word_of_int_minus_hom ~> wi_hom_neg 

1287 
word_of_int_succ_hom ~> wi_hom_succ 

1288 
word_of_int_pred_hom ~> wi_hom_pred 

1289 
word_of_int_0_hom ~> word_0_wi 

1290 
word_of_int_1_hom ~> word_1_wi 

1291 

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

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

1295 
multiplication, shifting by constants, bitwise operators and numeric 

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

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

1300 

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

1303 
measure_space. The locales based on subset_class now have two 

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

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

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

1309 
Measure space constructions for distributions and densities now got 

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

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

1312 
and point_measure is introduced. INCOMPATIBILITY. 

47694  1313 

1314 
Renamed constants: 

1315 
measure > emeasure 

1316 
finite_measure.\<mu>' > measure 

1317 
product_algebra_generator > prod_algebra 

1318 
product_prob_space.emb > prod_emb 

1319 
product_prob_space.infprod_algebra > PiM 

1320 

1321 
Removed locales: 

1322 
completeable_measure_space 

1323 
finite_measure_space 

1324 
finite_prob_space 

1325 
finite_product_finite_prob_space 

1326 
finite_product_sigma_algebra 

1327 
finite_sigma_algebra 

1328 
measure_space 

1329 
pair_finite_prob_space 

1330 
pair_finite_sigma_algebra 

1331 
pair_finite_space 

1332 
pair_sigma_algebra 

1333 
product_sigma_algebra 

1334 

1335 
Removed constants: 

47751  1336 
conditional_space 
47694  1337 
distribution > use distr measure, or distributed predicate 
47751  1338 
image_space 
47694  1339 
joint_distribution > use distr measure, or distributed predicate 
47751  1340 
pair_measure_generator 
47694  1341 
product_prob_space.infprod_algebra > use PiM 
1342 
subvimage 

1343 

1344 
Replacement theorems: 

47751  1345 
finite_additivity_sufficient > ring_of_sets.countably_additiveI_finite 
1346 
finite_measure.empty_measure > measure_empty 

1347 
finite_measure.finite_continuity_from_above > finite_measure.finite_Lim_measure_decseq 

1348 
finite_measure.finite_continuity_from_below > finite_measure.finite_Lim_measure_incseq 

1349 
finite_measure.finite_measure_countably_subadditive > finite_measure.finite_measure_subadditive_countably 

1350 
finite_measure.finite_measure_eq > finite_measure.emeasure_eq_measure 

1351 
finite_measure.finite_measure > finite_measure.emeasure_finite 

1352 
finite_measure.finite_measure_finite_singleton > finite_measure.finite_measure_eq_setsum_singleton 

1353 
finite_measure.positive_measure' > measure_nonneg 

1354 
finite_measure.real_measure > finite_measure.emeasure_real 

1355 
finite_product_prob_space.finite_measure_times > finite_product_prob_space.finite_measure_PiM_emb 

1356 
finite_product_sigma_algebra.in_P > sets_PiM_I_finite 

1357 
finite_product_sigma_algebra.P_empty > space_PiM_empty, sets_PiM_empty 

1358 
information_space.conditional_entropy_eq > information_space.conditional_entropy_simple_distributed 

1359 
information_space.conditional_entropy_positive > information_space.conditional_entropy_nonneg_simple 

1360 
information_space.conditional_mutual_information_eq_mutual_information > information_space.conditional_mutual_information_eq_mutual_information_simple 

1361 
information_space.conditional_mutual_information_generic_positive > information_space.conditional_mutual_information_nonneg_simple 

1362 
information_space.conditional_mutual_information_positive > information_space.conditional_mutual_information_nonneg_simple 

1363 
information_space.entropy_commute > information_space.entropy_commute_simple 

1364 
information_space.entropy_eq > information_space.entropy_simple_distributed 

1365 
information_space.entropy_generic_eq > information_space.entropy_simple_distributed 

1366 
information_space.entropy_positive > information_space.entropy_nonneg_simple 

1367 
information_space.entropy_uniform_max > information_space.entropy_uniform 

1368 
information_space.KL_eq_0_imp > information_space.KL_eq_0_iff_eq 

1369 
information_space.KL_eq_0 > information_space.KL_same_eq_0 

1370 
information_space.KL_ge_0 > information_space.KL_nonneg 

1371 
information_space.mutual_information_eq > information_space.mutual_information_simple_distributed 

1372 
information_space.mutual_information_positive > information_space.mutual_information_nonneg_simple 

1373 
Int_stable_cuboids > Int_stable_atLeastAtMost 

1374 
Int_stable_product_algebra_generator > positive_integral 

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

47694  1376 
measure_space.additive > emeasure_additive 
47751  1377 
measure_space.AE_iff_null_set > AE_iff_null 
1378 
measure_space.almost_everywhere_def > eventually_ae_filter 

1379 
measure_space.almost_everywhere_vimage > AE_distrD 

1380 
measure_space.continuity_from_above > INF_emeasure_decseq 

1381 
measure_space.continuity_from_above_Lim > Lim_emeasure_decseq 

1382 
measure_space.continuity_from_below_Lim > Lim_emeasure_incseq 

47694  1383 
measure_space.continuity_from_below > SUP_emeasure_incseq 
47751  1384 
measure_space_density > emeasure_density 
1385 
measure_space.density_is_absolutely_continuous > absolutely_continuousI_density 

1386 
measure_space.integrable_vimage > integrable_distr 

1387 
measure_space.integral_translated_density > integral_density 

1388 
measure_space.integral_vimage > integral_distr 

1389 
measure_space.measure_additive > plus_emeasure 

1390 
measure_space.measure_compl > emeasure_compl 

1391 
measure_space.measure_countable_increasing > emeasure_countable_increasing 

1392 
measure_space.measure_countably_subadditive > emeasure_subadditive_countably 

47694  1393 
measure_space.measure_decseq > decseq_emeasure 
47751  1394 
measure_space.measure_Diff > emeasure_Diff 
1395 
measure_space.measure_Diff_null_set > emeasure_Diff_null_set 

47694  1396 
measure_space.measure_eq_0 > emeasure_eq_0 
1397 
measure_space.measure_finitely_subadditive > emeasure_subadditive_finite 

47751  1398 
measure_space.measure_finite_singleton > emeasure_eq_setsum_singleton 
1399 
measure_space.measure_incseq > incseq_emeasure 

1400 
measure_space.measure_insert > emeasure_insert 

1401 
measure_space.measure_mono > emeasure_mono 

1402 
measure_space.measure_not_negative > emeasure_not_MInf 

1403 
measure_space.measure_preserving_Int_stable > measure_eqI_generator_eq 

1404 
measure_space.measure_setsum > setsum_emeasure 

1405 
measure_space.measure_setsum_split > setsum_emeasure_cover 

47694  1406 
measure_space.measure_space_vimage > emeasure_distr 
47751  1407 
measure_space.measure_subadditive_finite > emeasure_subadditive_finite 
1408 
measure_space.measure_subadditive > subadditive 

1409 
measure_space.measure_top > emeasure_space 

1410 
measure_space.measure_UN_eq_0 > emeasure_UN_eq_0 

1411 
measure_space.measure_Un_null_set > emeasure_Un_null_set 

1412 
measure_space.positive_integral_translated_density > positive_integral_density 

1413 
measure_space.positive_integral_vimage > positive_integral_distr 

47694  1414 
measure_space.real_continuity_from_above > Lim_measure_decseq 
47751  1415 
measure_space.real_continuity_from_below > Lim_measure_incseq 
47694  1416 
measure_space.real_measure_countably_subadditive > measure_subadditive_countably 
47751  1417 
measure_space.real_measure_Diff > measure_Diff 
1418 
measure_space.real_measure_finite_Union > measure_finite_Union 

1419 
measure_space.real_measure_setsum_singleton > measure_eq_setsum_singleton 

1420 
measure_space.real_measure_subadditive > measure_subadditive 

1421 
measure_space.real_measure_Union > measure_Union 

1422 
measure_space.real_measure_UNION > measure_UNION 

47694  1423 
measure_space.simple_function_vimage > simple_function_comp 
1424 
measure_space.simple_integral_vimage > simple_integral_distr 

47751  1425 
measure_space.simple_integral_vimage > simple_integral_distr 
1426 
measure_unique_Int_stable > measure_eqI_generator_eq 

1427 
measure_unique_Int_stable_vimage > measure_eqI_generator_eq 

47694  1428 
pair_sigma_algebra.measurable_cut_fst > sets_Pair1 
1429 
pair_sigma_algebra.measurable_cut_snd > sets_Pair2 

1430 
pair_sigma_algebra.measurable_pair_image_fst > measurable_Pair1 
