author  wenzelm 
Fri, 11 Jan 2013 22:01:49 +0100  
changeset 50836  c95af99e003b 
parent 50778  15dc91cf4750 
child 50878  2840522a936d 
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 

165 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 

166 
expressions. 

167 

168 
* Preprocessing of the code generator rewrites set comprehensions into 

169 
pointfree expressions. 

170 

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

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

173 
arithmetic, datatypes/records) with potential proof reconstruction 

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

175 
INCOMPATIBILITY. 

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

176 

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

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

178 
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

179 
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

180 
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

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

182 

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

185 

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

187 
List. INCOMPATIBILITY. 

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

188 

49739  189 
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. 
190 

49738  191 
* Class "comm_monoid_diff" formalises properties of bounded 
49388  192 
subtraction, with natural numbers and multisets as typical instances. 
193 

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

196 
* Theory "Transitive_Closure": renamed lemmas 

197 

198 
reflcl_tranclp > reflclp_tranclp 

199 
rtranclp_reflcl > rtranclp_reflclp 

200 

201 
INCOMPATIBILITY. 

202 

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

204 

205 
left_distrib ~> distrib_right 

206 
right_distrib ~> distrib_left 

207 

208 
INCOMPATIBILITY. 

209 

210 
* Generalized the definition of limits: 

211 

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

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

214 
output f x converges to G. 

215 

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

217 
infinity (at_bot). 

218 

219 
 Moved infinity in the norm (at_infinity) from 

220 
Multivariate_Analysis to Complex_Main. 

221 

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

223 
at_top". 

224 

225 
INCOMPATIBILITY. 

226 

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

228 
lattice type classes. 

229 

230 
* Theory "Library/Multiset": renamed 

231 

232 
constant fold_mset ~> Multiset.fold 

233 
fact fold_mset_commute ~> fold_mset_comm 

234 

235 
INCOMPATIBILITY. 

236 

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

238 
changes as follows. 

239 

240 
 Renamed constants (and related lemmas) 

49145  241 

242 
prefix ~> prefixeq 

243 
strict_prefix ~> prefix 

244 

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

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

248 
Renamed lemmas accordingly. 

249 

250 
 Added constant "list_hembeq" for homeomorphic embedding on 

251 
lists. Added abbreviation "sublisteq" for special case 

252 
"list_hembeq (op =)". 

253 

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

255 
class instances for the prefix order (merely corresponding locale 

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

257 
Library/Prefix_Order. 

258 

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

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

50516  261 

262 
le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff 

263 
le_list_append_mono ~> Sublist.list_hembeq_append_mono 

264 
le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2 

265 
le_list_Cons_EX ~> Sublist.list_hembeq_ConsD 

266 
le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2' 

267 
le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq 

268 
le_list_drop_Cons ~> Sublist.sublisteq_Cons' 

269 
le_list_drop_many ~> Sublist.sublisteq_drop_many 

270 
le_list_filter_left ~> Sublist.sublisteq_filter_left 

271 
le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many 

272 
le_list_rev_take_iff ~> Sublist.sublisteq_append 

273 
le_list_same_length ~> Sublist.sublisteq_same_length 

274 
le_list_take_many_iff ~> Sublist.sublisteq_append' 

49145  275 
less_eq_list.drop ~> less_eq_list_drop 
276 
less_eq_list.induct ~> less_eq_list_induct 

50516  277 
not_le_list_length ~> Sublist.not_sublisteq_length 
49145  278 

50646  279 
INCOMPATIBILITY. 
280 

281 

282 
* New theory Library/Countable_Set. 

283 

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

285 
parallel execution for code generated towards Isabelle/ML. 

286 

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

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

289 
extensional_funcset by an abbreviation, and renamed lemmas from 

290 
extensional_funcset to PiE as follows: 

291 

292 
extensional_empty ~> PiE_empty 

293 
extensional_funcset_empty_domain ~> PiE_empty_domain 

294 
extensional_funcset_empty_range ~> PiE_empty_range 

295 
extensional_funcset_arb ~> PiE_arb 

296 
extensional_funcset_mem ~> PiE_mem 

297 
extensional_funcset_extend_domainI ~> PiE_fun_upd 

298 
extensional_funcset_restrict_domain ~> fun_upd_in_PiE 

299 
extensional_funcset_extend_domain_eq ~> PiE_insert_eq 

300 
card_extensional_funcset ~> card_PiE 

301 
finite_extensional_funcset ~> finite_PiE 

302 

303 
INCOMPATIBILITY. 

304 

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

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

307 
Data"). 

308 

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

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

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

312 
code. 

313 

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

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

316 
return a structurally different tree than before. Potential 

317 
INCOMPATIBILITY. 

318 

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

320 

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

322 

323 
* HOL/Multivariate_Analysis: replaced 

324 

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

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

327 

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

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

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

331 

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

333 

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

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

336 
cart_base i removed 

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

338 

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

339 
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

340 

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

341 
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

342 

50646  343 
component_le_norm ~> Basis_le_norm 
344 
euclidean_eq ~> euclidean_eq_iff 

345 
differential_zero_maxmin_component ~> differential_zero_maxmin_cart 

346 
euclidean_simps ~> inner_simps 

347 
independent_basis ~> independent_Basis 

348 
span_basis ~> span_Basis 

349 
in_span_basis ~> in_span_Basis 

350 
norm_bound_component_le ~> norm_boound_Basis_le 

351 
norm_bound_component_lt ~> norm_boound_Basis_lt 

352 
component_le_infnorm ~> Basis_le_infnorm 

353 

354 
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

355 

50141  356 
* HOL/Probability: 
50646  357 

358 
 Added simproc "measurable" to automatically prove measurability. 

359 

360 
 Added induction rules for sigma sets with disjoint union 

361 
(sigma_sets_induct_disjoint) and for Borelmeasurable functions 

362 
(borel_measurable_induct). 

363 

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

365 
projective family). 

366 

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

368 
AFP entry "Ordinals_and_Cardinals"). 

369 

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

371 
with support for mixed, nested recursion and interesting nonfree 

372 
datatypes. 

48094  373 

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

374 

48206  375 
*** Document preparation *** 
376 

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

379 
Discontinued legacy styles "prem1" .. "prem19". 

380 

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

382 
instead of slightly exotic babel/greek. 

48206  383 

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

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

385 
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

386 
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

387 

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

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

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

390 

48206  391 

48992  392 
*** ML *** 
393 

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

396 
hardware and Poly/ML runtime system. 

397 

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

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

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

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

401 

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

404 
necessarily printing visible text. 

405 

406 

48206  407 
*** System *** 
408 

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

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

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

413 

414 
* Discontinued obsolete "isabelle makeall". 

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

415 

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

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

417 
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

418 
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

419 
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

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

421 

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

424 

425 
isabelle build s b HOLCF 

426 

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

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

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

429 

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

432 
"isabelle usedir". 

433 

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

436 

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

438 
INCOMPATIBILITY. 

439 

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

442 
version of Isabelle. 

443 

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

446 

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

448 
picked up from some surrounding directory. Potential INCOMPATIBILITY 

449 
for homemade settings. 

50132  450 

50701  451 
* Improved ML runtime statistics (heap, threads, future tasks etc.). 
452 

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

455 
configuration. 

456 

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

459 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

461 
bundled as Isabelle component. 

48206  462 

50182  463 

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

464 

47462  465 
New in Isabelle2012 (May 2012) 
466 
 

45109  467 

45593  468 
*** General *** 
469 

45614  470 
* Prover IDE (PIDE) improvements: 
471 

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

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

45614  479 

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

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

46485  483 

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

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

485 
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

486 
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

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

488 
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

489 

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

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

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

492 
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

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

494 

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

495 
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

496 

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

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

498 

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

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

500 

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

501 
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

502 
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

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

504 

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

505 
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

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

507 

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

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

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

47484  513 

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

516 
oldstyle "standard" after instantiation or composition of facts 

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

518 
indices of schematic variables. 

519 

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

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

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

523 
the historic accident of dynamic reevaluation in interpretations 

524 
etc. was exploited. 

525 

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

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

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

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

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

531 
of the material of that old tutorial. 

532 

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

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

535 
manual. 

536 

537 

538 
*** Pure *** 

539 

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

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

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

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

543 

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

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

547 
undocumented feature.) 

548 

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

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

552 

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

554 

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

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

557 

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

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

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

561 
order to accommodate newly introduced premises.) 

562 

47806  563 
* Renamed some inner syntax categories: 
564 

565 
num ~> num_token 

566 
xnum ~> xnum_token 

567 
xstr ~> str_token 

568 

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

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

571 
position information via constraints). 

572 

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

575 
manual. Minor INCOMPATIBILITY. 

576 

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

45134  579 

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

582 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  583 

47464  584 
* Redundant attribute "code_inline" has been discontinued. Use 
585 
"code_unfold" instead. INCOMPATIBILITY. 

586 

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

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

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

589 

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

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

591 

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

592 
INCOMPATIBILITY. 
45383  593 

47856  594 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
595 
instead. INCOMPATIBILITY. 

596 

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

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

599 
legacy since Isabelle2011). 

47855  600 

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

601 

45122  602 
*** HOL *** 
603 

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

606 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

611 
tinkering with former theorems mem_def and Collect_def as far as 

612 
possible. 

613 

614 
For developments which deliberately mix predicates and sets, a 

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

617 
Isabelle20111 before jumping right into the current release. 

618 

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

621 

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

623 

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

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

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

629 
user theories may require adaptations as follows: 

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

630 

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

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

632 
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

633 

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

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

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

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

637 

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

638 
 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

639 
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

640 

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

641 
 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

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

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

644 

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

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

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

647 

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

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

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

652 
corresponding parts of the Quotient package.) 

47809  653 

654 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

656 
relate different type instances of the same polymorphic constant, 

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

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

659 

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

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

662 

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

664 
equivalent subgoal on the corresponding raw types. Constants are 

665 
replaced with corresponding ones according to the transfer rules. 

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

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

671 

672 
 relator_eq attribute: Collects identity laws for relators of 

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

674 
transfer method uses these lemmas to infer transfer rules for 

675 
nonpolymorphic constants on the fly. 

676 

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

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

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

680 
after unfolding the constant definitions. 

681 

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

683 
from type nat to type int. 

684 

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

47809  687 

688 
 lift_definition command: Defines operations on an abstract type in 

689 
terms of a corresponding operation on a representation 

690 
type. Example syntax: 

691 

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

693 
is List.insert 

694 

695 
Users must discharge a respectfulness proof obligation when each 

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

697 
the proof is discharged automatically.) The obligation is 

698 
presented in a userfriendly, readable form; a respectfulness 

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

700 
by the package. 

701 

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

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

704 
lift_definition generates a code certificate theorem and sets up 

705 
code generation for each constant. 

706 

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

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

709 
or a type_definition theorem. The package configures transfer 

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

711 
lift_definition command to work with the type. 

712 

713 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  714 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
715 
Word/Word.thy and Library/Float.thy. 

47809  716 

717 
* Quotient package: 

718 

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

720 
rep and abs functions, similar to typedef. 

721 

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

723 
Transfer packages, as with 'setup_lifting'. 

724 

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

726 
respectfulness property at the point where the constant is 

727 
defined, similar to lift_definition; INCOMPATIBILITY. 

728 

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

730 
accordingly, INCOMPATIBILITY. 

731 

732 
* New diagnostic command 'find_unused_assms' to find potentially 

733 
superfluous assumptions in theorems using Quickcheck. 

734 

735 
* Quickcheck: 

736 

737 
 Quickcheck returns variable assignments as counterexamples, which 

738 
allows to reveal the underspecification of functions under test. 

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

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

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

742 

743 
These counterexample are marked as potentially spurious, as 

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

745 
obvious theorem "hd xs = hd xs". 

746 

747 
After finding a potentially spurious counterexample, Quickcheck 

748 
continues searching for genuine ones. 

749 

750 
By default, Quickcheck shows potentially spurious and genuine 

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

752 
show genuine counterexamples. 

753 

754 
 The command 'quickcheck_generator' creates random and exhaustive 

755 
value generators for a given type and operations. 

756 

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

758 
constructors of that type. 

759 

760 
 Support for multisets. 

761 

762 
 Added "use_subtype" options. 

763 

764 
 Added "quickcheck_locale" configuration to specify how to process 

765 
conjectures in a locale context. 

766 

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

47809  769 

770 
* Sledgehammer: 

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

772 
paper "More SPASS with Isabelle". 

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

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

775 
TFF1), iProver, iProverEq. 

776 
 Sped up the minimizer. 

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

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

779 
 Renamed "sound" option to "strict". 

780 

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

783 

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

785 

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

47809  787 

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

790 

791 
list.exhaust [case_product nat.exhaust] 

792 

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

794 
a list and a nat. 

795 

47809  796 
* New "eventually_elim" method as a generalized variant of the 
47855  797 
eventually_elim* rules. Supports structured proofs. 
798 

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

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

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

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

802 

47856  803 
* Record: code generation can be switched off manually with 
804 

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

806 

807 
* Datatype: type parameters allow explicit sort constraints. 

808 

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

811 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

813 
one_case. 

814 

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

816 
the result of the fact expression. 

817 

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

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

821 

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

822 
converse_def ~> converse_unfold 
47549  823 
rel_comp_def ~> relcomp_unfold 
47820  824 
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

825 
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

826 
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

827 
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

828 

46981  829 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
830 

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

47086  833 

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

834 
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

835 

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

46458  839 
rel_pow_1 ~> relpow_1 
46363  840 
rel_pow_0_I ~> relpow_0_I 
841 
rel_pow_Suc_I ~> relpow_Suc_I 

842 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

843 
rel_pow_0_E ~> relpow_0_E 

844 
rel_pow_Suc_E ~> relpow_Suc_E 

845 
rel_pow_E ~> relpow_E 

46458  846 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  847 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  848 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
849 
rel_pow_E2 ~> relpow_E2 

850 
rel_pow_add ~> relpow_add 

851 
rel_pow_commute ~> relpow 

852 
rel_pow_empty ~> relpow_empty: 

853 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

854 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

855 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

856 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

857 
rel_pow_fun_conv ~> relpow_fun_conv 

858 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

859 
rel_pow_finite_bounded ~> relpow_finite_bounded 

860 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

861 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

862 
single_valued_rel_pow ~> single_valued_relpow 

47463  863 

46363  864 
INCOMPATIBILITY. 
865 

47448  866 
* Theory Relation: Consolidated constant name for relation composition 
47464  867 
and corresponding theorem names: 
868 

47549  869 
 Renamed constant rel_comp to relcomp. 
47464  870 

47448  871 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  872 

47448  873 
 Renamed theorems: 
47464  874 

47448  875 
rel_compI ~> relcompI 
876 
rel_compEpair ~> relcompEpair 

877 
rel_compE ~> relcompE 

878 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

879 
rel_comp_empty1 ~> relcomp_empty1 

880 
rel_comp_mono ~> relcomp_mono 

881 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

882 
rel_comp_distrib ~> relcomp_distrib 

883 
rel_comp_distrib2 ~> relcomp_distrib2 

884 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

885 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

886 
single_valued_rel_comp ~> single_valued_relcomp 

47549  887 
rel_comp_def ~> relcomp_unfold 
47448  888 
converse_rel_comp ~> converse_relcomp 
889 
pred_compI ~> relcomppI 

890 
pred_compE ~> relcomppE 

891 
pred_comp_bot1 ~> relcompp_bot1 

892 
pred_comp_bot2 ~> relcompp_bot2 

893 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

894 
pred_comp_mono ~> relcompp_mono 

895 
pred_comp_distrib ~> relcompp_distrib 

896 
pred_comp_distrib2 ~> relcompp_distrib2 

897 
converse_pred_comp ~> converse_relcompp 

47464  898 

47448  899 
finite_rel_comp ~> finite_relcomp 
47464  900 

47448  901 
set_rel_comp ~> set_relcomp 
902 

903 
INCOMPATIBILITY. 

904 

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

907 

908 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

909 
zdiv_self ~> div_self 

910 
zmod_self ~> mod_self 

911 
zdiv_zero ~> div_0 

912 
zmod_zero ~> mod_0 

913 
zdiv_zmod_equality ~> div_mod_equality2 

914 
zdiv_zmod_equality2 ~> div_mod_equality 

915 
zmod_zdiv_trivial ~> mod_div_trivial 

916 
zdiv_zminus_zminus ~> div_minus_minus 

917 
zmod_zminus_zminus ~> mod_minus_minus 

918 
zdiv_zminus2 ~> div_minus_right 

919 
zmod_zminus2 ~> mod_minus_right 

920 
zdiv_minus1_right ~> div_minus1_right 

921 
zmod_minus1_right ~> mod_minus1_right 

922 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

923 
zmod_zmult1_eq ~> mod_mult_right_eq 

924 
zpower_zmod ~> power_mod 

925 
zdvd_zmod ~> dvd_mod 

926 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

927 
mod_mult_distrib ~> mult_mod_left 

928 
mod_mult_distrib2 ~> mult_mod_right 

929 

930 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

931 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

932 

47551  933 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
934 

47552  935 
* Consolidated theorem names concerning fold combinators: 
47550  936 

937 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

938 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

939 
INFI_fold_inf ~> INF_fold_inf 

940 
SUPR_fold_sup ~> SUP_fold_sup 

941 
union_set ~> union_set_fold 

942 
minus_set ~> minus_set_fold 

943 
INFI_set_fold ~> INF_set_fold 

944 
SUPR_set_fold ~> SUP_set_fold 

945 
INF_code ~> INF_set_foldr 

946 
SUP_code ~> SUP_set_foldr 

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

948 
foldr_fold_rev ~> foldr_conv_fold 

949 
foldl_fold ~> foldl_conv_fold 

950 
foldr_foldr ~> foldr_conv_foldl 

951 
foldl_foldr ~> foldl_conv_foldr 

47552  952 
fold_set_remdups ~> fold_set_fold_remdups 
953 
fold_set ~> fold_set_fold 

954 
fold1_set ~> fold1_set_fold 

47550  955 

956 
INCOMPATIBILITY. 

957 

958 
* Dropped rarely useful theorems concerning fold combinators: 

959 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

960 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

961 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

962 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

963 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

964 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

968 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

969 

970 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

971 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

972 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

973 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

975 
fold_conv_foldr and fold_rev. 

976 

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

978 
through option types. 

979 

47856  980 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
981 
relations. 

982 

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

984 

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

986 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

987 

988 
zminus_zminus ~> minus_minus 

989 
zminus_0 ~> minus_zero 

990 
zminus_zadd_distrib ~> minus_add_distrib 

991 
zadd_commute ~> add_commute 

992 
zadd_assoc ~> add_assoc 

993 
zadd_left_commute ~> add_left_commute 

994 
zadd_ac ~> add_ac 

995 
zmult_ac ~> mult_ac 

996 
zadd_0 ~> add_0_left 

997 
zadd_0_right ~> add_0_right 

998 
zadd_zminus_inverse2 ~> left_minus 

999 
zmult_zminus ~> mult_minus_left 

1000 
zmult_commute ~> mult_commute 

1001 
zmult_assoc ~> mult_assoc 

1002 
zadd_zmult_distrib ~> left_distrib 

1003 
zadd_zmult_distrib2 ~> right_distrib 

1004 
zdiff_zmult_distrib ~> left_diff_distrib 

1005 
zdiff_zmult_distrib2 ~> right_diff_distrib 

1006 
zmult_1 ~> mult_1_left 

1007 
zmult_1_right ~> mult_1_right 

1008 
zle_refl ~> order_refl 

1009 
zle_trans ~> order_trans 

1010 
zle_antisym ~> order_antisym 

1011 
zle_linear ~> linorder_linear 

1012 
zless_linear ~> linorder_less_linear 

1013 
zadd_left_mono ~> add_left_mono 

1014 
zadd_strict_right_mono ~> add_strict_right_mono 

1015 
zadd_zless_mono ~> add_less_le_mono 

1016 
int_0_less_1 ~> zero_less_one 

1017 
int_0_neq_1 ~> zero_neq_one 

1018 
zless_le ~> less_le 

1019 
zpower_zadd_distrib ~> power_add 

1020 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

1021 
zero_le_zpower_abs ~> zero_le_power_abs 

1022 

1023 
* Theory Deriv: Renamed 

1024 

1025 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

1026 

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

1028 

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

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

1033 
INCOMPATIBILITY. 

1034 

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

1037 

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

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

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

1042 
follows: 

47452  1043 

1044 
Operations: 

1045 
bulkload > rbt_bulkload 

1046 
del_from_left > rbt_del_from_left 

1047 
del_from_right > rbt_del_from_right 

1048 
del > rbt_del 

1049 
delete > rbt_delete 

1050 
ins > rbt_ins 

1051 
insert > rbt_insert 

1052 
insertw > rbt_insert_with 

1053 
insert_with_key > rbt_insert_with_key 

1054 
map_entry > rbt_map_entry 

1055 
lookup > rbt_lookup 

1056 
sorted > rbt_sorted 

1057 
tree_greater > rbt_greater 

1058 
tree_less > rbt_less 

1059 
tree_less_symbol > rbt_less_symbol 

1060 
union > rbt_union 

1061 
union_with > rbt_union_with 

1062 
union_with_key > rbt_union_with_key 

1063 

1064 
Lemmas: 

1065 
balance_left_sorted > balance_left_rbt_sorted 

1066 
balance_left_tree_greater > balance_left_rbt_greater 

1067 
balance_left_tree_less > balance_left_rbt_less 

1068 
balance_right_sorted > balance_right_rbt_sorted 

1069 
balance_right_tree_greater > balance_right_rbt_greater 

1070 
balance_right_tree_less > balance_right_rbt_less 

1071 
balance_sorted > balance_rbt_sorted 

1072 
balance_tree_greater > balance_rbt_greater 

1073 
balance_tree_less > balance_rbt_less 

1074 
bulkload_is_rbt > rbt_bulkload_is_rbt 

1075 
combine_sorted > combine_rbt_sorted 

1076 
combine_tree_greater > combine_rbt_greater 

1077 
combine_tree_less > combine_rbt_less 

1078 
delete_in_tree > rbt_delete_in_tree 

1079 
delete_is_rbt > rbt_delete_is_rbt 

1080 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

1081 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

1082 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

1083 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

1084 
del_in_tree > rbt_del_in_tree 

1085 
del_inv1_inv2 > rbt_del_inv1_inv2 

1086 
del_sorted > rbt_del_rbt_sorted 

1087 
del_tree_greater > rbt_del_rbt_greater 

1088 
del_tree_less > rbt_del_rbt_less 

1089 
dom_lookup_Branch > dom_rbt_lookup_Branch 

1090 
entries_lookup > entries_rbt_lookup 

1091 
finite_dom_lookup > finite_dom_rbt_lookup 

1092 
insert_sorted > rbt_insert_rbt_sorted 

1093 
insertw_is_rbt > rbt_insertw_is_rbt 

1094 
insertwk_is_rbt > rbt_insertwk_is_rbt 

1095 
insertwk_sorted > rbt_insertwk_rbt_sorted 

1096 
insertw_sorted > rbt_insertw_rbt_sorted 

1097 
ins_sorted > ins_rbt_sorted 

1098 
ins_tree_greater > ins_rbt_greater 

1099 
ins_tree_less > ins_rbt_less 

1100 
is_rbt_sorted > is_rbt_rbt_sorted 

1101 
lookup_balance > rbt_lookup_balance 

1102 
lookup_bulkload > rbt_lookup_rbt_bulkload 

1103 
lookup_delete > rbt_lookup_rbt_delete 

1104 
lookup_Empty > rbt_lookup_Empty 

1105 
lookup_from_in_tree > rbt_lookup_from_in_tree 

1106 
lookup_in_tree > rbt_lookup_in_tree 

1107 
lookup_ins > rbt_lookup_ins 

1108 
lookup_insert > rbt_lookup_rbt_insert 

1109 
lookup_insertw > rbt_lookup_rbt_insertw 

1110 
lookup_insertwk > rbt_lookup_rbt_insertwk 

1111 
lookup_keys > rbt_lookup_keys 

1112 
lookup_map > rbt_lookup_map 

1113 
lookup_map_entry > rbt_lookup_rbt_map_entry 

1114 
lookup_tree_greater > rbt_lookup_rbt_greater 

1115 
lookup_tree_less > rbt_lookup_rbt_less 

1116 
lookup_union > rbt_lookup_rbt_union 

1117 
map_entry_color_of > rbt_map_entry_color_of 

1118 
map_entry_inv1 > rbt_map_entry_inv1 

1119 
map_entry_inv2 > rbt_map_entry_inv2 

1120 
map_entry_is_rbt > rbt_map_entry_is_rbt 

1121 
map_entry_sorted > rbt_map_entry_rbt_sorted 

1122 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

1123 
map_entry_tree_less > rbt_map_entry_rbt_less 

1124 
map_tree_greater > map_rbt_greater 

1125 
map_tree_less > map_rbt_less 

1126 
map_sorted > map_rbt_sorted 

1127 
paint_sorted > paint_rbt_sorted 

1128 
paint_lookup > paint_rbt_lookup 

1129 
paint_tree_greater > paint_rbt_greater 

1130 
paint_tree_less > paint_rbt_less 

1131 
sorted_entries > rbt_sorted_entries 

1132 
tree_greater_eq_trans > rbt_greater_eq_trans 

1133 
tree_greater_nit > rbt_greater_nit 

1134 
tree_greater_prop > rbt_greater_prop 

1135 
tree_greater_simps > rbt_greater_simps 

1136 
tree_greater_trans > rbt_greater_trans 

1137 
tree_less_eq_trans > rbt_less_eq_trans 

1138 
tree_less_nit > rbt_less_nit 

1139 
tree_less_prop > rbt_less_prop 

1140 
tree_less_simps > rbt_less_simps 

1141 
tree_less_trans > rbt_less_trans 

1142 
tree_ord_props > rbt_ord_props 

1143 
union_Branch > rbt_union_Branch 

1144 
union_is_rbt > rbt_union_is_rbt 

1145 
unionw_is_rbt > rbt_unionw_is_rbt 

1146 
unionwk_is_rbt > rbt_unionwk_is_rbt 

1147 
unionwk_sorted > rbt_unionwk_rbt_sorted 

1148 

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

1151 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  1152 

1153 
Changed Operations: 

47622  1154 
float_abs > abs 
1155 
float_nprt > nprt 

1156 
float_pprt > pprt 

1157 
pow2 > use powr 

1158 
round_down > float_round_down 

1159 
round_up > float_round_up 

1160 
scale > exponent 

1161 

1162 
Removed Operations: 

1163 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

1164 

1165 
Renamed Lemmas: 

1166 
abs_float_def > Float.compute_float_abs 

1167 
bitlen_ge0 > bitlen_nonneg 

1168 
bitlen.simps > Float.compute_bitlen 

1169 
float_components > Float_mantissa_exponent 

1170 
float_divl.simps > Float.compute_float_divl 

1171 
float_divr.simps > Float.compute_float_divr 

1172 
float_eq_odd > mult_powr_eq_mult_powr_iff 

1173 
float_power > real_of_float_power 

1174 
lapprox_posrat_def > Float.compute_lapprox_posrat 

1175 
lapprox_rat.simps > Float.compute_lapprox_rat 

1176 
le_float_def' > Float.compute_float_le 

1177 
le_float_def > less_eq_float.rep_eq 

1178 
less_float_def' > Float.compute_float_less 

1179 
less_float_def > less_float.rep_eq 

1180 
normfloat_def > Float.compute_normfloat 

1181 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

1182 
normfloat > normfloat_def 

1183 
normfloat_unique > use normfloat_def 

1184 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

1185 
one_float_def > Float.compute_float_one 

1186 
plus_float_def > Float.compute_float_plus 

1187 
rapprox_posrat_def > Float.compute_rapprox_posrat 

1188 
rapprox_rat.simps > Float.compute_rapprox_rat 

1189 
real_of_float_0 > zero_float.rep_eq 

1190 
real_of_float_1 > one_float.rep_eq 

1191 
real_of_float_abs > abs_float.rep_eq 

1192 
real_of_float_add > plus_float.rep_eq 

1193 
real_of_float_minus > uminus_float.rep_eq 

1194 
real_of_float_mult > times_float.rep_eq 

1195 
real_of_float_simp > Float.rep_eq 

1196 
real_of_float_sub > minus_float.rep_eq 

1197 
round_down.simps > Float.compute_float_round_down 

1198 
round_up.simps > Float.compute_float_round_up 

1199 
times_float_def > Float.compute_float_times 

1200 
uminus_float_def > Float.compute_float_uminus 

1201 
zero_float_def > Float.compute_float_zero 

1202 

1203 
Lemmas not necessary anymore, use the transfer method: 

1204 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

1205 
float_divr, float_le_simp, float_less1_mantissa_bound, 

1206 
float_less_simp, float_less_zero, float_le_zero, 

1207 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

1208 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

1209 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

1210 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

1211 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

1212 
round_up, zero_le_float, zero_less_float 

47616  1213 

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

45791  1216 

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

1219 

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

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

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

1224 

1225 
* Session HOLWord: Discontinued many redundant theorems specific to 

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

1227 
instead. 

1228 

1229 
word_sub_alt ~> word_sub_wi 

1230 
word_add_alt ~> word_add_def 

1231 
word_mult_alt ~> word_mult_def 

1232 
word_minus_alt ~> word_minus_def 

1233 
word_0_alt ~> word_0_wi 

1234 
word_1_alt ~> word_1_wi 

1235 
word_add_0 ~> add_0_left 

1236 
word_add_0_right ~> add_0_right 

1237 
word_mult_1 ~> mult_1_left 

1238 
word_mult_1_right ~> mult_1_right 

1239 
word_add_commute ~> add_commute 

1240 
word_add_assoc ~> add_assoc 

1241 
word_add_left_commute ~> add_left_commute 

1242 
word_mult_commute ~> mult_commute 

1243 
word_mult_assoc ~> mult_assoc 

1244 
word_mult_left_commute ~> mult_left_commute 

1245 
word_left_distrib ~> left_distrib 

1246 
word_right_distrib ~> right_distrib 

1247 
word_left_minus ~> left_minus 

1248 
word_diff_0_right ~> diff_0_right 

1249 
word_diff_self ~> diff_self 

1250 
word_sub_def ~> diff_minus 

1251 
word_diff_minus ~> diff_minus 

1252 
word_add_ac ~> add_ac 

1253 
word_mult_ac ~> mult_ac 

1254 
word_plus_ac0 ~> add_0_left add_0_right add_ac 

1255 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 

1256 
word_order_trans ~> order_trans 

1257 
word_order_refl ~> order_refl 

1258 
word_order_antisym ~> order_antisym 

1259 
word_order_linear ~> linorder_linear 

1260 
lenw1_zero_neq_one ~> zero_neq_one 

1261 
word_number_of_eq ~> number_of_eq 

1262 
word_of_int_add_hom ~> wi_hom_add 

1263 
word_of_int_sub_hom ~> wi_hom_sub 

1264 
word_of_int_mult_hom ~> wi_hom_mult 

1265 
word_of_int_minus_hom ~> wi_hom_neg 

1266 
word_of_int_succ_hom ~> wi_hom_succ 

1267 
word_of_int_pred_hom ~> wi_hom_pred 

1268 
word_of_int_0_hom ~> word_0_wi 

1269 
word_of_int_1_hom ~> word_1_wi 

1270 

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

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

1274 
multiplication, shifting by constants, bitwise operators and numeric 

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

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

1279 

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

1282 
measure_space. The locales based on subset_class now have two 

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

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

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

1288 
Measure space constructions for distributions and densities now got 

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

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

1291 
and point_measure is introduced. INCOMPATIBILITY. 

47694  1292 

1293 
Renamed constants: 

1294 
measure > emeasure 

1295 
finite_measure.\<mu>' > measure 

1296 
product_algebra_generator > prod_algebra 

1297 
product_prob_space.emb > prod_emb 

1298 
product_prob_space.infprod_algebra > PiM 

1299 

1300 
Removed locales: 

1301 
completeable_measure_space 

1302 
finite_measure_space 

1303 
finite_prob_space 

1304 
finite_product_finite_prob_space 

1305 
finite_product_sigma_algebra 

1306 
finite_sigma_algebra 

1307 
measure_space 

1308 
pair_finite_prob_space 

1309 
pair_finite_sigma_algebra 

1310 
pair_finite_space 

1311 
pair_sigma_algebra 

1312 
product_sigma_algebra 

1313 

1314 
Removed constants: 

47751  1315 
conditional_space 
47694  1316 
distribution > use distr measure, or distributed predicate 
47751  1317 
image_space 
47694  1318 
joint_distribution > use distr measure, or distributed predicate 
47751  1319 
pair_measure_generator 
47694  1320 
product_prob_space.infprod_algebra > use PiM 
1321 
subvimage 

1322 

1323 
Replacement theorems: 

47751  1324 
finite_additivity_sufficient > ring_of_sets.countably_additiveI_finite 
1325 
finite_measure.empty_measure > measure_empty 

1326 
finite_measure.finite_continuity_from_above > finite_measure.finite_Lim_measure_decseq 

1327 
finite_measure.finite_continuity_from_below > finite_measure.finite_Lim_measure_incseq 

1328 
finite_measure.finite_measure_countably_subadditive > finite_measure.finite_measure_subadditive_countably 

1329 
finite_measure.finite_measure_eq > finite_measure.emeasure_eq_measure 

1330 
finite_measure.finite_measure > finite_measure.emeasure_finite 

1331 
finite_measure.finite_measure_finite_singleton > finite_measure.finite_measure_eq_setsum_singleton 

1332 
finite_measure.positive_measure' > measure_nonneg 

1333 
finite_measure.real_measure > finite_measure.emeasure_real 

1334 
finite_product_prob_space.finite_measure_times > finite_product_prob_space.finite_measure_PiM_emb 

1335 
finite_product_sigma_algebra.in_P > sets_PiM_I_finite 

1336 
finite_product_sigma_algebra.P_empty > space_PiM_empty, sets_PiM_empty 

1337 
information_space.conditional_entropy_eq > information_space.conditional_entropy_simple_distributed 

1338 
information_space.conditional_entropy_positive > information_space.conditional_entropy_nonneg_simple 

1339 
information_space.conditional_mutual_information_eq_mutual_information > information_space.conditional_mutual_information_eq_mutual_information_simple 

1340 
information_space.conditional_mutual_information_generic_positive > information_space.conditional_mutual_information_nonneg_simple 

1341 
information_space.conditional_mutual_information_positive > information_space.conditional_mutual_information_nonneg_simple 

1342 
information_space.entropy_commute > information_space.entropy_commute_simple 

1343 
information_space.entropy_eq > information_space.entropy_simple_distributed 

1344 
information_space.entropy_generic_eq > information_space.entropy_simple_distributed 

1345 
information_space.entropy_positive > information_space.entropy_nonneg_simple 

1346 
information_space.entropy_uniform_max > information_space.entropy_uniform 

1347 
information_space.KL_eq_0_imp > information_space.KL_eq_0_iff_eq 

1348 
information_space.KL_eq_0 > information_space.KL_same_eq_0 

1349 
information_space.KL_ge_0 > information_space.KL_nonneg 

1350 
information_space.mutual_information_eq > information_space.mutual_information_simple_distributed 

1351 
information_space.mutual_information_positive > information_space.mutual_information_nonneg_simple 

1352 
Int_stable_cuboids > Int_stable_atLeastAtMost 

1353 
Int_stable_product_algebra_generator > positive_integral 

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

47694  1355 
measure_space.additive > emeasure_additive 
47751  1356 
measure_space.AE_iff_null_set > AE_iff_null 
1357 
measure_space.almost_everywhere_def > eventually_ae_filter 

1358 
measure_space.almost_everywhere_vimage > AE_distrD 

1359 
measure_space.continuity_from_above > INF_emeasure_decseq 

1360 
measure_space.continuity_from_above_Lim > Lim_emeasure_decseq 

1361 
measure_space.continuity_from_below_Lim > Lim_emeasure_incseq 

47694  1362 
measure_space.continuity_from_below > SUP_emeasure_incseq 
47751  1363 
measure_space_density > emeasure_density 
1364 
measure_space.density_is_absolutely_continuous > absolutely_continuousI_density 

1365 
measure_space.integrable_vimage > integrable_distr 

1366 
measure_space.integral_translated_density > integral_density 

1367 
measure_space.integral_vimage > integral_distr 

1368 
measure_space.measure_additive > plus_emeasure 

1369 
measure_space.measure_compl > emeasure_compl 

1370 
measure_space.measure_countable_increasing > emeasure_countable_increasing 

1371 
measure_space.measure_countably_subadditive > emeasure_subadditive_countably 

47694  1372 
measure_space.measure_decseq > decseq_emeasure 
47751  1373 
measure_space.measure_Diff > emeasure_Diff 
1374 
measure_space.measure_Diff_null_set > emeasure_Diff_null_set 

47694  1375 
measure_space.measure_eq_0 > emeasure_eq_0 
1376 
measure_space.measure_finitely_subadditive > emeasure_subadditive_finite 

47751  1377 
measure_space.measure_finite_singleton > emeasure_eq_setsum_singleton 
1378 
measure_space.measure_incseq > incseq_emeasure 

1379 
measure_space.measure_insert > emeasure_insert 

1380 
measure_space.measure_mono > emeasure_mono 

1381 
measure_space.measure_not_negative > emeasure_not_MInf 

1382 
measure_space.measure_preserving_Int_stable > measure_eqI_generator_eq 

1383 
measure_space.measure_setsum > setsum_emeasure 

1384 
measure_space.measure_setsum_split > setsum_emeasure_cover 

47694  1385 
measure_space.measure_space_vimage > emeasure_distr 
47751  1386 
measure_space.measure_subadditive_finite > emeasure_subadditive_finite 
1387 
measure_space.measure_subadditive > subadditive 

1388 
measure_space.measure_top > emeasure_space 

1389 
measure_space.measure_UN_eq_0 > emeasure_UN_eq_0 

1390 
measure_space.measure_Un_null_set > emeasure_Un_null_set 

1391 
measure_space.positive_integral_translated_density > positive_integral_density 

1392 
measure_space.positive_integral_vimage > positive_integral_distr 

47694  1393 
measure_space.real_continuity_from_above > Lim_measure_decseq 
47751  1394 
measure_space.real_continuity_from_below > Lim_measure_incseq 
47694  1395 
measure_space.real_measure_countably_subadditive > measure_subadditive_countably 
47751  1396 
measure_space.real_measure_Diff > measure_Diff 
1397 
measure_space.real_measure_finite_Union > measure_finite_Union 

1398 
measure_space.real_measure_setsum_singleton > measure_eq_setsum_singleton 

1399 
measure_space.real_measure_subadditive > measure_subadditive 

1400 
measure_space.real_measure_Union > measure_Union 

1401 
measure_space.real_measure_UNION > measure_UNION 

47694  1402 
measure_space.simple_function_vimage > simple_function_comp 
1403 
measure_space.simple_integral_vimage > simple_integral_distr 

47751  1404 
measure_space.simple_integral_vimage > simple_integral_distr 
1405 
measure_unique_Int_stable > measure_eqI_generator_eq 

1406 
measure_unique_Int_stable_vimage > measure_eqI_generator_eq 

47694  1407 
pair_sigma_algebra.measurable_cut_fst > sets_Pair1 
1408 
pair_sigma_algebra.measurable_cut_snd > sets_Pair2 

1409 
pair_sigma_algebra.measurable_pair_image_fst > measurable_Pair1 

1410 
pair_sigma_algebra.measurable_pair_image_snd > measurable_Pair2 

1411 
pair_sigma_algebra.measurable_product_swap > measurable_pair_swap_iff 

1412 
pair_sigma_algebra.pair_sigma_algebra_measurable > measurable_pair_swap 

1413 
pair_sigma_algebra.pair_sigma_algebra_swap_measurable > measurable_pair_swap' 

1414 
pair_sigma_algebra.sets_swap > sets_pair_swap 

47751  1415 
pair_sigma_finite.measure_cut_measurable_fst > pair_sigma_finite.measurable_emeasure_Pair1 
1416 
pair_sigma_finite.measure_cut_measurable_snd > pair_sigma_finite.measurable_emeasure_Pair2 

1417 
pair_sigma_finite.measure_preserving_swap > pair_sigma_finite.distr_pair_swap 

1418 
pair_sigma_finite.pair_measure_alt2 > pair_sigma_finite.emeasure_pair_measure_alt2 

1419 
pair_sigma_finite.pair_measure_alt > pair_sigma_finite.emeasure_pair_measure_alt 

1420 
pair_sigma_finite.pair_measure_times > pair_sigma_finite.emeasure_pair_measure_Times 

1421 
prob_space.indep_distribution_eq_measure > prob_space.indep_vars_iff_distr_eq_PiM 

1422 
prob_space.indep_var_distributionD > prob_space.indep_var_distribution_eq 

47694  1423 
prob_space.measure_space_1 > prob_space.emeasure_space_1 
1424 
prob_space.prob_space_vimage > prob_space_distr 

1425 
prob_space.random_variable_restrict > measurable_restrict 

47751  1426 
prob_space_unique_Int_stable > measure_eqI_prob_space 
1427 
product_algebraE > prod_algebraE_all 

1428 
product_algebra_generator_der > prod_algebra_eq_finite 

1429 
product_algebra_generator_into_space > prod_algebra_sets_into_space 

1430 
product_algebraI > sets_PiM_I_finite 

1431 
product_measure_exists > product_sigma_finite.sigma_finite 

47694  1432 
product_prob_space.finite_index_eq_finite_product > product_prob_space.sets_PiM_generator 
1433 
product_prob_space.finite_measure_infprod_emb_Pi > product_prob_space.measure_PiM_emb 

1434 
product_prob_space.infprod_spec > product_prob_space.emeasure_PiM_emb_not_empty 

1435 
product_prob_space.measurable_component > measurable_component_singleton 

1436 
product_prob_space.measurable_emb > measurable_prod_emb 
