author  wenzelm 
Thu, 28 Feb 2013 17:38:35 +0100  
changeset 51316  dfe469293eb4 
parent 51313  102a0a0718c5 
child 51382  51957d006677 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

50994  4 
New in this Isabelle version 
5 
 

6 

51293
05b1bbae748d
discontinued obsolete 'uses' within theory header;
wenzelm
parents:
51238
diff
changeset

7 
*** General *** 
05b1bbae748d
discontinued obsolete 'uses' within theory header;
wenzelm
parents:
51238
diff
changeset

8 

05b1bbae748d
discontinued obsolete 'uses' within theory header;
wenzelm
parents:
51238
diff
changeset

9 
* Discontinued obsolete 'uses' within theory header. Note that 
05b1bbae748d
discontinued obsolete 'uses' within theory header;
wenzelm
parents:
51238
diff
changeset

10 
commands like 'ML_file' work without separate declaration of file 
05b1bbae748d
discontinued obsolete 'uses' within theory header;
wenzelm
parents:
51238
diff
changeset

11 
dependencies. Minor INCOMPATIBILITY. 
05b1bbae748d
discontinued obsolete 'uses' within theory header;
wenzelm
parents:
51238
diff
changeset

12 

51295  13 
* Discontinued redundant 'use' command, which was superseded by 
14 
'ML_file' in Isabelle2013. Minor INCOMPATIBILITY. 

15 

51293
05b1bbae748d
discontinued obsolete 'uses' within theory header;
wenzelm
parents:
51238
diff
changeset

16 

51313  17 
*** Pure *** 
18 

19 
* Discontinued obsolete 'axioms' command, which has been marked as 

20 
legacy since Isabelle20092. INCOMPATIBILITY, use 'axiomatization' 

21 
instead, while observing its uniform scope for polymorphism. 

22 

51316
dfe469293eb4
discontinued empty name bindings in 'axiomatization';
wenzelm
parents:
51313
diff
changeset

23 
* Discontinued empty name bindings in 'axiomatization'. 
dfe469293eb4
discontinued empty name bindings in 'axiomatization';
wenzelm
parents:
51313
diff
changeset

24 
INCOMPATIBILITY. 
dfe469293eb4
discontinued empty name bindings in 'axiomatization';
wenzelm
parents:
51313
diff
changeset

25 

51313  26 

51002
496013a6eb38
remove unnecessary assumption from real_normed_vector
hoelzl
parents:
50994
diff
changeset

27 
*** HOL *** 
496013a6eb38
remove unnecessary assumption from real_normed_vector
hoelzl
parents:
50994
diff
changeset

28 

51238  29 
* Discontinued obsolete src/HOL/IsaMakefile (considered legacy since 
30 
Isabelle2013). Use "isabelle build" to operate on Isabelle sessions. 

31 

51168
35d00ce58626
restored proper order of NEWS entries (lost due too longwaiting patches)
haftmann
parents:
51143
diff
changeset

32 
* Numeric types mapped by default to target language numerals: 
35d00ce58626
restored proper order of NEWS entries (lost due too longwaiting patches)
haftmann
parents:
51143
diff
changeset

33 
natural (replaces former code_numeral) and integer (replaces 
35d00ce58626
restored proper order of NEWS entries (lost due too longwaiting patches)
haftmann
parents:
51143
diff
changeset

34 
former code_int). Conversions are available as integer_of_natural / 
35d00ce58626
restored proper order of NEWS entries (lost due too longwaiting patches)
haftmann
parents:
51143
diff
changeset

35 
natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and 
35d00ce58626
restored proper order of NEWS entries (lost due too longwaiting patches)
haftmann
parents:
51143
diff
changeset

36 
Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in ML). 
35d00ce58626
restored proper order of NEWS entries (lost due too longwaiting patches)
haftmann
parents:
51143
diff
changeset

37 
INCOMPATIBILITY. 
35d00ce58626
restored proper order of NEWS entries (lost due too longwaiting patches)
haftmann
parents:
51143
diff
changeset

38 

35d00ce58626
restored proper order of NEWS entries (lost due too longwaiting patches)
haftmann
parents:
51143
diff
changeset

39 
* Discontinued theories Code_Integer and Efficient_Nat by a more 
35d00ce58626
restored proper order of NEWS entries (lost due too longwaiting patches)
haftmann
parents:
51143
diff
changeset

40 
finegrain stack of theories Code_Target_Int, Code_Binary_Nat, 
35d00ce58626
restored proper order of NEWS entries (lost due too longwaiting patches)
haftmann
parents:
51143
diff
changeset

41 
Code_Target_Nat and Code_Target_Numeral. See the tutorial on 
35d00ce58626
restored proper order of NEWS entries (lost due too longwaiting patches)
haftmann
parents:
51143
diff
changeset

42 
code generation for details. INCOMPATIBILITY. 
35d00ce58626
restored proper order of NEWS entries (lost due too longwaiting patches)
haftmann
parents:
51143
diff
changeset

43 

51002
496013a6eb38
remove unnecessary assumption from real_normed_vector
hoelzl
parents:
50994
diff
changeset

44 
* Theory "RealVector" and "Limits": Introduce type class 
496013a6eb38
remove unnecessary assumption from real_normed_vector
hoelzl
parents:
50994
diff
changeset

45 
(lin)order_topology. Allows to generalize theorems about limits and 
496013a6eb38
remove unnecessary assumption from real_normed_vector
hoelzl
parents:
50994
diff
changeset

46 
order. Instances are reals and extended reals. 
496013a6eb38
remove unnecessary assumption from real_normed_vector
hoelzl
parents:
50994
diff
changeset

47 

51115
7dbd6832a689
consolidation of library theories on product orders
haftmann
parents:
51088
diff
changeset

48 
* Consolidation of library theories on product orders: 
7dbd6832a689
consolidation of library theories on product orders
haftmann
parents:
51088
diff
changeset

49 

7dbd6832a689
consolidation of library theories on product orders
haftmann
parents:
51088
diff
changeset

50 
Product_Lattice ~> Product_Order  pointwise order on products 
7dbd6832a689
consolidation of library theories on product orders
haftmann
parents:
51088
diff
changeset

51 
Product_ord ~> Product_Lexorder  lexicographic order on products 
7dbd6832a689
consolidation of library theories on product orders
haftmann
parents:
51088
diff
changeset

52 

7dbd6832a689
consolidation of library theories on product orders
haftmann
parents:
51088
diff
changeset

53 
INCOMPATIBILITY. 
7dbd6832a689
consolidation of library theories on product orders
haftmann
parents:
51088
diff
changeset

54 

51137  55 
* Sledgehammer: 
56 

57 
 Renamed option: 

58 
isar_shrink ~> isar_compress 

59 

50994  60 

50993  61 
New in Isabelle2013 (February 2013) 
62 
 

47887  63 

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

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

65 

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

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

67 
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

68 
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

69 
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

70 
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

71 
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

72 
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

73 

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

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

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

78 

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

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

80 
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

81 

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

84 
Tools that load their additional source files may imitate the 

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

86 
dependencies properly. 

87 

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

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

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

90 

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

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

93 

51050  94 
* Improved support for auxiliary contexts that indicate block structure 
95 
for specifications. Nesting of "context fixes ... context assumes ..." 

49841  96 
and "class ... context ...". 
97 

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

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

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

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

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

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

104 

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

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

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

107 

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

110 

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

111 

49968  112 
*** Prover IDE  Isabelle/Scala/jEdit *** 
113 

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

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

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

117 
surface, while the prover is still crunching on internal 

118 
justifications. Unfinished / cancelled proofs are restarted as 

119 
required to complete full proof checking eventually. 

120 

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

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

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

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

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

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

127 

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

130 
browser on demand. 

131 

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

134 
comment delimiters works more conveniently with unfinished situations 

135 
that frequently occur in user interaction. 

136 

137 
* More efficient painting and improved reactivity when editing large 

138 
files. More scalable management of formal document content. 

139 

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

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

141 
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

142 
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

143 
potentially infinite message streams. 
49968  144 

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

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

147 
options, including tuning parameters for editor reactivity and color 

148 
schemes. 

149 

50184  150 
* Dockable window "Symbols" provides some editing support for Isabelle 
151 
symbols. 

152 

51082  153 
* Dockable window "Monitor" shows ML runtime statistics. Note that 
154 
continuous display of the chart slows down the system. 

50701  155 

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

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

159 

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

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

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

50183  164 

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

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

168 

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

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

170 
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

171 
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

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

173 

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

176 
now bundled exclusively with Isabelle. 

177 

178 

48205  179 
*** Pure *** 
180 

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

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

182 
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

183 

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

186 
rather arbitrary current working directory. INCOMPATIBILITY. 

48371  187 

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

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

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

192 
with some care where this is really required. 

193 

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

51063  196 
given sort. Example (in HOL): 
48792  197 

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

199 

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

202 

48205  203 

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

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

205 

50646  206 
* Sledgehammer: 
207 

208 
 Added MaSh relevance filter based on machinelearning; see the 

209 
Sledgehammer manual for details. 

210 
 Polished Isar proofs generated with "isar_proofs" option. 

211 
 Rationalized type encodings ("type_enc" option). 

50720  212 
 Renamed "kill_provers" subcommand to "kill_all". 
50646  213 
 Renamed options: 
214 
isar_proof ~> isar_proofs 

215 
isar_shrink_factor ~> isar_shrink 

216 
max_relevant ~> max_facts 

217 
relevance_thresholds ~> fact_thresholds 

218 

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

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

221 
configuration quickcheck_optimise_equality to false. 

222 

50878  223 
* Quotient: only one quotient can be defined by quotient_type 
224 
INCOMPATIBILITY. 

225 

226 
* Lifting: 

227 
 generation of an abstraction function equation in lift_definition 

228 
 quot_del attribute 

229 
 renamed no_abs_code > no_code (INCOMPATIBILITY.) 

230 

50646  231 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
232 
expressions. 

233 

234 
* Preprocessing of the code generator rewrites set comprehensions into 

235 
pointfree expressions. 

236 

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

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

239 
arithmetic, datatypes/records) with potential proof reconstruction 

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

241 
INCOMPATIBILITY. 

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

242 

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

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

244 
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

245 
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

246 
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

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

248 

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

251 

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

253 
List. INCOMPATIBILITY. 

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

254 

49739  255 
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. 
256 

49738  257 
* Class "comm_monoid_diff" formalises properties of bounded 
49388  258 
subtraction, with natural numbers and multisets as typical instances. 
259 

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

262 
* Theory "Transitive_Closure": renamed lemmas 

263 

264 
reflcl_tranclp > reflclp_tranclp 

265 
rtranclp_reflcl > rtranclp_reflclp 

266 

267 
INCOMPATIBILITY. 

268 

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

270 

271 
left_distrib ~> distrib_right 

272 
right_distrib ~> distrib_left 

273 

274 
INCOMPATIBILITY. 

275 

276 
* Generalized the definition of limits: 

277 

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

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

280 
output f x converges to G. 

281 

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

283 
infinity (at_bot). 

284 

285 
 Moved infinity in the norm (at_infinity) from 

286 
Multivariate_Analysis to Complex_Main. 

287 

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

289 
at_top". 

290 

291 
INCOMPATIBILITY. 

292 

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

294 
lattice type classes. 

295 

296 
* Theory "Library/Multiset": renamed 

297 

298 
constant fold_mset ~> Multiset.fold 

299 
fact fold_mset_commute ~> fold_mset_comm 

300 

301 
INCOMPATIBILITY. 

302 

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

304 
changes as follows. 

305 

306 
 Renamed constants (and related lemmas) 

49145  307 

308 
prefix ~> prefixeq 

309 
strict_prefix ~> prefix 

310 

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

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

314 
Renamed lemmas accordingly. 

315 

316 
 Added constant "list_hembeq" for homeomorphic embedding on 

317 
lists. Added abbreviation "sublisteq" for special case 

318 
"list_hembeq (op =)". 

319 

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

321 
class instances for the prefix order (merely corresponding locale 

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

323 
Library/Prefix_Order. 

324 

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

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

50516  327 

328 
le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff 

329 
le_list_append_mono ~> Sublist.list_hembeq_append_mono 

330 
le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2 

331 
le_list_Cons_EX ~> Sublist.list_hembeq_ConsD 

332 
le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2' 

333 
le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq 

334 
le_list_drop_Cons ~> Sublist.sublisteq_Cons' 

335 
le_list_drop_many ~> Sublist.sublisteq_drop_many 

336 
le_list_filter_left ~> Sublist.sublisteq_filter_left 

337 
le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many 

338 
le_list_rev_take_iff ~> Sublist.sublisteq_append 

339 
le_list_same_length ~> Sublist.sublisteq_same_length 

340 
le_list_take_many_iff ~> Sublist.sublisteq_append' 

49145  341 
less_eq_list.drop ~> less_eq_list_drop 
342 
less_eq_list.induct ~> less_eq_list_induct 

50516  343 
not_le_list_length ~> Sublist.not_sublisteq_length 
49145  344 

50646  345 
INCOMPATIBILITY. 
346 

347 
* New theory Library/Countable_Set. 

348 

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

350 
parallel execution for code generated towards Isabelle/ML. 

351 

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

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

354 
extensional_funcset by an abbreviation, and renamed lemmas from 

355 
extensional_funcset to PiE as follows: 

356 

357 
extensional_empty ~> PiE_empty 

358 
extensional_funcset_empty_domain ~> PiE_empty_domain 

359 
extensional_funcset_empty_range ~> PiE_empty_range 

360 
extensional_funcset_arb ~> PiE_arb 

361 
extensional_funcset_mem ~> PiE_mem 

362 
extensional_funcset_extend_domainI ~> PiE_fun_upd 

363 
extensional_funcset_restrict_domain ~> fun_upd_in_PiE 

364 
extensional_funcset_extend_domain_eq ~> PiE_insert_eq 

365 
card_extensional_funcset ~> card_PiE 

366 
finite_extensional_funcset ~> finite_PiE 

367 

368 
INCOMPATIBILITY. 

369 

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

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

372 
Data"). 

373 

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

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

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

377 
code. 

378 

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

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

381 
return a structurally different tree than before. Potential 

382 
INCOMPATIBILITY. 

383 

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

385 

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

387 

388 
* HOL/Multivariate_Analysis: replaced 

389 

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

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

392 

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

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

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

396 

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

398 

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

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

401 
cart_base i removed 

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

403 

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

404 
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

405 

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

406 
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

407 

50646  408 
component_le_norm ~> Basis_le_norm 
409 
euclidean_eq ~> euclidean_eq_iff 

410 
differential_zero_maxmin_component ~> differential_zero_maxmin_cart 

411 
euclidean_simps ~> inner_simps 

412 
independent_basis ~> independent_Basis 

413 
span_basis ~> span_Basis 

414 
in_span_basis ~> in_span_Basis 

415 
norm_bound_component_le ~> norm_boound_Basis_le 

416 
norm_bound_component_lt ~> norm_boound_Basis_lt 

417 
component_le_infnorm ~> Basis_le_infnorm 

418 

419 
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

420 

50141  421 
* HOL/Probability: 
50646  422 

423 
 Added simproc "measurable" to automatically prove measurability. 

424 

425 
 Added induction rules for sigma sets with disjoint union 

426 
(sigma_sets_induct_disjoint) and for Borelmeasurable functions 

427 
(borel_measurable_induct). 

428 

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

430 
projective family). 

431 

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

433 
AFP entry "Ordinals_and_Cardinals"). 

434 

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

436 
with support for mixed, nested recursion and interesting nonfree 

437 
datatypes. 

48094  438 

50991  439 
* HOL/Finite_Set and Relation: added new set and relation operations 
50878  440 
expressed by Finite_Set.fold. 
441 

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

443 
trees for the code generator. 

444 

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

446 
Lifting/Transfer. 

447 
possible INCOMPATIBILITY. 

448 

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

450 
INCOMPATIBILITY. 

451 

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

452 

48206  453 
*** Document preparation *** 
454 

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

457 
Discontinued legacy styles "prem1" .. "prem19". 

458 

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

460 
instead of slightly exotic babel/greek. 

48206  461 

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

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

463 
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

464 
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

465 

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

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

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

468 

48206  469 

48992  470 
*** ML *** 
471 

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

474 
hardware and Poly/ML runtime system. 

475 

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

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

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

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

479 

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

482 
necessarily printing visible text. 

483 

484 

48206  485 
*** System *** 
486 

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

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

488 
"system" manual for the chapter of that name, especially the "isabelle 
51056  489 
build" tool and its examples. The "isabelle mkroot" tool prepares 
490 
session root directories for use with "isabelle build", similar to 

491 
former "isabelle mkdir" for "isabelle usedir". Note that this affects 

492 
document preparation as well. INCOMPATIBILITY, isabelle usedir / 

48736  493 
mkdir / make are rendered obsolete. 
494 

51056  495 
* Discontinued obsolete Isabelle/build script, it is superseded by the 
496 
regular isabelle build tool. For example: 

497 

498 
isabelle build s b HOL 

499 

48736  500 
* Discontinued obsolete "isabelle makeall". 
48585
a82910dd2270
announce advanced support for Isabelle sessions and build management;
wenzelm
parents:
48574
diff
changeset

501 

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

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

503 
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

504 
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

505 
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

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

507 

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

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

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

510 

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

513 

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

515 
INCOMPATIBILITY. 

516 

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

519 
version of Isabelle. 

520 

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

523 

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

525 
picked up from some surrounding directory. Potential INCOMPATIBILITY 

526 
for homemade settings. 

50132  527 

50701  528 
* Improved ML runtime statistics (heap, threads, future tasks etc.). 
529 

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

532 
configuration. 

533 

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

536 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

538 
bundled as Isabelle component. 

48206  539 

50182  540 

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

541 

47462  542 
New in Isabelle2012 (May 2012) 
543 
 

45109  544 

45593  545 
*** General *** 
546 

45614  547 
* Prover IDE (PIDE) improvements: 
548 

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

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

45614  556 

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

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

46485  560 

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

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

562 
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

563 
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

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

565 
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

566 

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

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

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

569 
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

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

571 

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

572 
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

573 

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

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

575 

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

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

577 

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

578 
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

579 
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

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

581 

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

582 
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

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

584 

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

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

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

47484  590 

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

593 
oldstyle "standard" after instantiation or composition of facts 

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

595 
indices of schematic variables. 

596 

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

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

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

600 
the historic accident of dynamic reevaluation in interpretations 

601 
etc. was exploited. 

602 

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

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

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

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

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

608 
of the material of that old tutorial. 

609 

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

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

612 
manual. 

613 

614 

615 
*** Pure *** 

616 

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

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

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

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

620 

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

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

624 
undocumented feature.) 

625 

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

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

629 

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

631 

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

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

634 

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

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

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

638 
order to accommodate newly introduced premises.) 

639 

47806  640 
* Renamed some inner syntax categories: 
641 

642 
num ~> num_token 

643 
xnum ~> xnum_token 

644 
xstr ~> str_token 

645 

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

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

648 
position information via constraints). 

649 

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

652 
manual. Minor INCOMPATIBILITY. 

653 

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

45134  656 

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

659 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  660 

47464  661 
* Redundant attribute "code_inline" has been discontinued. Use 
662 
"code_unfold" instead. INCOMPATIBILITY. 

663 

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

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

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

666 

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

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

668 

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

669 
INCOMPATIBILITY. 
45383  670 

47856  671 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
672 
instead. INCOMPATIBILITY. 

673 

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

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

676 
legacy since Isabelle2011). 

47855  677 

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

678 

45122  679 
*** HOL *** 
680 

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

683 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

688 
tinkering with former theorems mem_def and Collect_def as far as 

689 
possible. 

690 

691 
For developments which deliberately mix predicates and sets, a 

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

694 
Isabelle20111 before jumping right into the current release. 

695 

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

698 

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

700 

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

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

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

706 
user theories may require adaptations as follows: 

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

707 

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

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

709 
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

710 

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

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

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

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

714 

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

715 
 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

716 
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

717 

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

718 
 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

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

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

721 

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

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

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

724 

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

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

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

729 
corresponding parts of the Quotient package.) 

47809  730 

731 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

733 
relate different type instances of the same polymorphic constant, 

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

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

736 

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

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

739 

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

741 
equivalent subgoal on the corresponding raw types. Constants are 

742 
replaced with corresponding ones according to the transfer rules. 

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

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

748 

749 
 relator_eq attribute: Collects identity laws for relators of 

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

751 
transfer method uses these lemmas to infer transfer rules for 

752 
nonpolymorphic constants on the fly. 

753 

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

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

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

757 
after unfolding the constant definitions. 

758 

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

760 
from type nat to type int. 

761 

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

47809  764 

765 
 lift_definition command: Defines operations on an abstract type in 

766 
terms of a corresponding operation on a representation 

767 
type. Example syntax: 

768 

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

770 
is List.insert 

771 

772 
Users must discharge a respectfulness proof obligation when each 

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

774 
the proof is discharged automatically.) The obligation is 

775 
presented in a userfriendly, readable form; a respectfulness 

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

777 
by the package. 

778 

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

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

781 
lift_definition generates a code certificate theorem and sets up 

782 
code generation for each constant. 

783 

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

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

786 
or a type_definition theorem. The package configures transfer 

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

788 
lift_definition command to work with the type. 

789 

790 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  791 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
792 
Word/Word.thy and Library/Float.thy. 

47809  793 

794 
* Quotient package: 

795 

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

797 
rep and abs functions, similar to typedef. 

798 

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

800 
Transfer packages, as with 'setup_lifting'. 

801 

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

803 
respectfulness property at the point where the constant is 

804 
defined, similar to lift_definition; INCOMPATIBILITY. 

805 

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

807 
accordingly, INCOMPATIBILITY. 

808 

809 
* New diagnostic command 'find_unused_assms' to find potentially 

810 
superfluous assumptions in theorems using Quickcheck. 

811 

812 
* Quickcheck: 

813 

814 
 Quickcheck returns variable assignments as counterexamples, which 

815 
allows to reveal the underspecification of functions under test. 

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

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

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

819 

820 
These counterexample are marked as potentially spurious, as 

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

822 
obvious theorem "hd xs = hd xs". 

823 

824 
After finding a potentially spurious counterexample, Quickcheck 

825 
continues searching for genuine ones. 

826 

827 
By default, Quickcheck shows potentially spurious and genuine 

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

829 
show genuine counterexamples. 

830 

831 
 The command 'quickcheck_generator' creates random and exhaustive 

832 
value generators for a given type and operations. 

833 

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

835 
constructors of that type. 

836 

837 
 Support for multisets. 

838 

839 
 Added "use_subtype" options. 

840 

841 
 Added "quickcheck_locale" configuration to specify how to process 

842 
conjectures in a locale context. 

843 

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

47809  846 

847 
* Sledgehammer: 

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

849 
paper "More SPASS with Isabelle". 

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

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

852 
TFF1), iProver, iProverEq. 

853 
 Sped up the minimizer. 

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

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

856 
 Renamed "sound" option to "strict". 

857 

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

860 

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

862 

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

47809  864 

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

867 

868 
list.exhaust [case_product nat.exhaust] 

869 

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

871 
a list and a nat. 

872 

47809  873 
* New "eventually_elim" method as a generalized variant of the 
47855  874 
eventually_elim* rules. Supports structured proofs. 
875 

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

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

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

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

879 

47856  880 
* Record: code generation can be switched off manually with 
881 

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

883 

884 
* Datatype: type parameters allow explicit sort constraints. 

885 

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

888 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

890 
one_case. 

891 

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

893 
the result of the fact expression. 

894 

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

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

898 

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

899 
converse_def ~> converse_unfold 
47549  900 
rel_comp_def ~> relcomp_unfold 
47820  901 
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

902 
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

903 
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

904 
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

905 

46981  906 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
907 

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

47086  910 

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

911 
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

912 

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

46458  916 
rel_pow_1 ~> relpow_1 
46363  917 
rel_pow_0_I ~> relpow_0_I 
918 
rel_pow_Suc_I ~> relpow_Suc_I 

919 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

920 
rel_pow_0_E ~> relpow_0_E 

921 
rel_pow_Suc_E ~> relpow_Suc_E 

922 
rel_pow_E ~> relpow_E 

46458  923 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  924 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  925 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
926 
rel_pow_E2 ~> relpow_E2 

927 
rel_pow_add ~> relpow_add 

928 
rel_pow_commute ~> relpow 

929 
rel_pow_empty ~> relpow_empty: 

930 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

931 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

932 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

933 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

934 
rel_pow_fun_conv ~> relpow_fun_conv 

935 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

936 
rel_pow_finite_bounded ~> relpow_finite_bounded 

937 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

938 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

939 
single_valued_rel_pow ~> single_valued_relpow 

47463  940 

46363  941 
INCOMPATIBILITY. 
942 

47448  943 
* Theory Relation: Consolidated constant name for relation composition 
47464  944 
and corresponding theorem names: 
945 

47549  946 
 Renamed constant rel_comp to relcomp. 
47464  947 

47448  948 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  949 

47448  950 
 Renamed theorems: 
47464  951 

47448  952 
rel_compI ~> relcompI 
953 
rel_compEpair ~> relcompEpair 

954 
rel_compE ~> relcompE 

955 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

956 
rel_comp_empty1 ~> relcomp_empty1 

957 
rel_comp_mono ~> relcomp_mono 

958 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

959 
rel_comp_distrib ~> relcomp_distrib 

960 
rel_comp_distrib2 ~> relcomp_distrib2 

961 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

962 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

963 
single_valued_rel_comp ~> single_valued_relcomp 

47549  964 
rel_comp_def ~> relcomp_unfold 
47448  965 
converse_rel_comp ~> converse_relcomp 
966 
pred_compI ~> relcomppI 

967 
pred_compE ~> relcomppE 

968 
pred_comp_bot1 ~> relcompp_bot1 

969 
pred_comp_bot2 ~> relcompp_bot2 

970 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

971 
pred_comp_mono ~> relcompp_mono 

972 
pred_comp_distrib ~> relcompp_distrib 

973 
pred_comp_distrib2 ~> relcompp_distrib2 

974 
converse_pred_comp ~> converse_relcompp 

47464  975 

47448  976 
finite_rel_comp ~> finite_relcomp 
47464  977 

47448  978 
set_rel_comp ~> set_relcomp 
979 

980 
INCOMPATIBILITY. 

981 

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

984 

985 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

986 
zdiv_self ~> div_self 

987 
zmod_self ~> mod_self 

988 
zdiv_zero ~> div_0 

989 
zmod_zero ~> mod_0 

990 
zdiv_zmod_equality ~> div_mod_equality2 

991 
zdiv_zmod_equality2 ~> div_mod_equality 

992 
zmod_zdiv_trivial ~> mod_div_trivial 

993 
zdiv_zminus_zminus ~> div_minus_minus 

994 
zmod_zminus_zminus ~> mod_minus_minus 

995 
zdiv_zminus2 ~> div_minus_right 

996 
zmod_zminus2 ~> mod_minus_right 

997 
zdiv_minus1_right ~> div_minus1_right 

998 
zmod_minus1_right ~> mod_minus1_right 

999 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

1000 
zmod_zmult1_eq ~> mod_mult_right_eq 

1001 
zpower_zmod ~> power_mod 

1002 
zdvd_zmod ~> dvd_mod 

1003 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

1004 
mod_mult_distrib ~> mult_mod_left 

1005 
mod_mult_distrib2 ~> mult_mod_right 

1006 

1007 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

1008 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

1009 

47551  1010 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
1011 

47552  1012 
* Consolidated theorem names concerning fold combinators: 
47550  1013 

1014 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

1015 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

1016 
INFI_fold_inf ~> INF_fold_inf 

1017 
SUPR_fold_sup ~> SUP_fold_sup 

1018 
union_set ~> union_set_fold 

1019 
minus_set ~> minus_set_fold 

1020 
INFI_set_fold ~> INF_set_fold 

1021 
SUPR_set_fold ~> SUP_set_fold 

1022 
INF_code ~> INF_set_foldr 

1023 
SUP_code ~> SUP_set_foldr 

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

1025 
foldr_fold_rev ~> foldr_conv_fold 

1026 
foldl_fold ~> foldl_conv_fold 

1027 
foldr_foldr ~> foldr_conv_foldl 

1028 
foldl_foldr ~> foldl_conv_foldr 

47552  1029 
fold_set_remdups ~> fold_set_fold_remdups 
1030 
fold_set ~> fold_set_fold 

1031 
fold1_set ~> fold1_set_fold 

47550  1032 

1033 
INCOMPATIBILITY. 

1034 

1035 
* Dropped rarely useful theorems concerning fold combinators: 

1036 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

1037 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

1038 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

1039 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

1040 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

1041 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

1045 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

1046 

1047 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

1048 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

1049 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

1050 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

1052 
fold_conv_foldr and fold_rev. 

1053 

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

1055 
through option types. 

1056 

47856  1057 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
1058 
relations. 

1059 

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

1061 

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

1063 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

1064 

1065 
zminus_zminus ~> minus_minus 

1066 
zminus_0 ~> minus_zero 

1067 
zminus_zadd_distrib ~> minus_add_distrib 

1068 
zadd_commute ~> add_commute 

1069 
zadd_assoc ~> add_assoc 

1070 
zadd_left_commute ~> add_left_commute 

1071 
zadd_ac ~> add_ac 

1072 
zmult_ac ~> mult_ac 

1073 
zadd_0 ~> add_0_left 

1074 
zadd_0_right ~> add_0_right 

1075 
zadd_zminus_inverse2 ~> left_minus 

1076 
zmult_zminus ~> mult_minus_left 

1077 
zmult_commute ~> mult_commute 

1078 
zmult_assoc ~> mult_assoc 

1079 
zadd_zmult_distrib ~> left_distrib 

1080 
zadd_zmult_distrib2 ~> right_distrib 

1081 
zdiff_zmult_distrib ~> left_diff_distrib 

1082 
zdiff_zmult_distrib2 ~> right_diff_distrib 

1083 
zmult_1 ~> mult_1_left 

1084 
zmult_1_right ~> mult_1_right 

1085 
zle_refl ~> order_refl 

1086 
zle_trans ~> order_trans 

1087 
zle_antisym ~> order_antisym 

1088 
zle_linear ~> linorder_linear 

1089 
zless_linear ~> linorder_less_linear 

1090 
zadd_left_mono ~> add_left_mono 

1091 
zadd_strict_right_mono ~> add_strict_right_mono 

1092 
zadd_zless_mono ~> add_less_le_mono 

1093 
int_0_less_1 ~> zero_less_one 

1094 
int_0_neq_1 ~> zero_neq_one 

1095 
zless_le ~> less_le 

1096 
zpower_zadd_distrib ~> power_add 

1097 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

1098 
zero_le_zpower_abs ~> zero_le_power_abs 

1099 

1100 
* Theory Deriv: Renamed 

1101 

1102 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

1103 

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

1105 

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

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

1110 
INCOMPATIBILITY. 

1111 

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

1114 

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

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

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

1119 
follows: 

47452  1120 

1121 
Operations: 

1122 
bulkload > rbt_bulkload 

1123 
del_from_left > rbt_del_from_left 

1124 
del_from_right > rbt_del_from_right 

1125 
del > rbt_del 

1126 
delete > rbt_delete 

1127 
ins > rbt_ins 

1128 
insert > rbt_insert 

1129 
insertw > rbt_insert_with 

1130 
insert_with_key > rbt_insert_with_key 

1131 
map_entry > rbt_map_entry 

1132 
lookup > rbt_lookup 

1133 
sorted > rbt_sorted 

1134 
tree_greater > rbt_greater 

1135 
tree_less > rbt_less 

1136 
tree_less_symbol > rbt_less_symbol 

1137 
union > rbt_union 

1138 
union_with > rbt_union_with 

1139 
union_with_key > rbt_union_with_key 

1140 

1141 
Lemmas: 

1142 
balance_left_sorted > balance_left_rbt_sorted 

1143 
balance_left_tree_greater > balance_left_rbt_greater 

1144 
balance_left_tree_less > balance_left_rbt_less 

1145 
balance_right_sorted > balance_right_rbt_sorted 

1146 
balance_right_tree_greater > balance_right_rbt_greater 

1147 
balance_right_tree_less > balance_right_rbt_less 

1148 
balance_sorted > balance_rbt_sorted 

1149 
balance_tree_greater > balance_rbt_greater 

1150 
balance_tree_less > balance_rbt_less 

1151 
bulkload_is_rbt > rbt_bulkload_is_rbt 

1152 
combine_sorted > combine_rbt_sorted 

1153 
combine_tree_greater > combine_rbt_greater 

1154 
combine_tree_less > combine_rbt_less 

1155 
delete_in_tree > rbt_delete_in_tree 

1156 
delete_is_rbt > rbt_delete_is_rbt 

1157 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

1158 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

1159 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

1160 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

1161 
del_in_tree > rbt_del_in_tree 

1162 
del_inv1_inv2 > rbt_del_inv1_inv2 

1163 
del_sorted > rbt_del_rbt_sorted 

1164 
del_tree_greater > rbt_del_rbt_greater 

1165 
del_tree_less > rbt_del_rbt_less 

1166 
dom_lookup_Branch > dom_rbt_lookup_Branch 

1167 
entries_lookup > entries_rbt_lookup 

1168 
finite_dom_lookup > finite_dom_rbt_lookup 

1169 
insert_sorted > rbt_insert_rbt_sorted 

1170 
insertw_is_rbt > rbt_insertw_is_rbt 

1171 
insertwk_is_rbt > rbt_insertwk_is_rbt 

1172 
insertwk_sorted > rbt_insertwk_rbt_sorted 

1173 
insertw_sorted > rbt_insertw_rbt_sorted 

1174 
ins_sorted > ins_rbt_sorted 

1175 
ins_tree_greater > ins_rbt_greater 

1176 
ins_tree_less > ins_rbt_less 

1177 
is_rbt_sorted > is_rbt_rbt_sorted 

1178 
lookup_balance > rbt_lookup_balance 

1179 
lookup_bulkload > rbt_lookup_rbt_bulkload 

1180 
lookup_delete > rbt_lookup_rbt_delete 

1181 
lookup_Empty > rbt_lookup_Empty 

1182 
lookup_from_in_tree > rbt_lookup_from_in_tree 

1183 
lookup_in_tree > rbt_lookup_in_tree 

1184 
lookup_ins > rbt_lookup_ins 

1185 
lookup_insert > rbt_lookup_rbt_insert 

1186 
lookup_insertw > rbt_lookup_rbt_insertw 

1187 
lookup_insertwk > rbt_lookup_rbt_insertwk 

1188 
lookup_keys > rbt_lookup_keys 

1189 
lookup_map > rbt_lookup_map 

1190 
lookup_map_entry > rbt_lookup_rbt_map_entry 

1191 
lookup_tree_greater > rbt_lookup_rbt_greater 

1192 
lookup_tree_less > rbt_lookup_rbt_less 

1193 
lookup_union > rbt_lookup_rbt_union 

1194 
map_entry_color_of > rbt_map_entry_color_of 

1195 
map_entry_inv1 > rbt_map_entry_inv1 

1196 
map_entry_inv2 > rbt_map_entry_inv2 

1197 
map_entry_is_rbt > rbt_map_entry_is_rbt 

1198 
map_entry_sorted > rbt_map_entry_rbt_sorted 

1199 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

1200 
map_entry_tree_less > rbt_map_entry_rbt_less 

1201 
map_tree_greater > map_rbt_greater 

1202 
map_tree_less > map_rbt_less 

1203 
map_sorted > map_rbt_sorted 

1204 
paint_sorted > paint_rbt_sorted 

1205 
paint_lookup > paint_rbt_lookup 

1206 
paint_tree_greater > paint_rbt_greater 

1207 
paint_tree_less > paint_rbt_less 

1208 
sorted_entries > rbt_sorted_entries 

1209 
tree_greater_eq_trans > rbt_greater_eq_trans 

1210 
tree_greater_nit > rbt_greater_nit 

1211 
tree_greater_prop > rbt_greater_prop 

1212 
tree_greater_simps > rbt_greater_simps 

1213 
tree_greater_trans > rbt_greater_trans 

1214 
tree_less_eq_trans > rbt_less_eq_trans 

1215 
tree_less_nit > rbt_less_nit 

1216 
tree_less_prop > rbt_less_prop 

1217 
tree_less_simps > rbt_less_simps 

1218 
tree_less_trans > rbt_less_trans 

1219 
tree_ord_props > rbt_ord_props 

1220 
union_Branch > rbt_union_Branch 

1221 
union_is_rbt > rbt_union_is_rbt 

1222 
unionw_is_rbt > rbt_unionw_is_rbt 

1223 
unionwk_is_rbt > rbt_unionwk_is_rbt 

1224 
unionwk_sorted > rbt_unionwk_rbt_sorted 

1225 

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

1228 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  1229 

1230 
Changed Operations: 

47622  1231 
float_abs > abs 
1232 
float_nprt > nprt 

1233 
float_pprt > pprt 

1234 
pow2 > use powr 

1235 
round_down > float_round_down 

1236 
round_up > float_round_up 

1237 
scale > exponent 

1238 

1239 
Removed Operations: 

1240 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

1241 

1242 
Renamed Lemmas: 

1243 
abs_float_def > Float.compute_float_abs 

1244 
bitlen_ge0 > bitlen_nonneg 

1245 
bitlen.simps > Float.compute_bitlen 

1246 
float_components > Float_mantissa_exponent 

1247 
float_divl.simps > Float.compute_float_divl 

1248 
float_divr.simps > Float.compute_float_divr 

1249 
float_eq_odd > mult_powr_eq_mult_powr_iff 

1250 
float_power > real_of_float_power 

1251 
lapprox_posrat_def > Float.compute_lapprox_posrat 

1252 
lapprox_rat.simps > Float.compute_lapprox_rat 

1253 
le_float_def' > Float.compute_float_le 

1254 
le_float_def > less_eq_float.rep_eq 

1255 
less_float_def' > Float.compute_float_less 

1256 
less_float_def > less_float.rep_eq 

1257 
normfloat_def > Float.compute_normfloat 

1258 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

1259 
normfloat > normfloat_def 

1260 
normfloat_unique > use normfloat_def 

1261 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

1262 
one_float_def > Float.compute_float_one 

1263 
plus_float_def > Float.compute_float_plus 

1264 
rapprox_posrat_def > Float.compute_rapprox_posrat 

1265 
rapprox_rat.simps > Float.compute_rapprox_rat 

1266 
real_of_float_0 > zero_float.rep_eq 

1267 
real_of_float_1 > one_float.rep_eq 

1268 
real_of_float_abs > abs_float.rep_eq 

1269 
real_of_float_add > plus_float.rep_eq 

1270 
real_of_float_minus > uminus_float.rep_eq 

1271 
real_of_float_mult > times_float.rep_eq 

1272 
real_of_float_simp > Float.rep_eq 

1273 
real_of_float_sub > minus_float.rep_eq 

1274 
round_down.simps > Float.compute_float_round_down 

1275 
round_up.simps > Float.compute_float_round_up 

1276 
times_float_def > Float.compute_float_times 

1277 
uminus_float_def > Float.compute_float_uminus 

1278 
zero_float_def > Float.compute_float_zero 

1279 

1280 
Lemmas not necessary anymore, use the transfer method: 

1281 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

1282 
float_divr, float_le_simp, float_less1_mantissa_bound, 

1283 
float_less_simp, float_less_zero, float_le_zero, 

1284 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

1285 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

1286 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

1287 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

1288 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

1289 
round_up, zero_le_float, zero_less_float 

47616  1290 

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

45791  1293 

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

1296 

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

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

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

1301 

1302 
* Session HOLWord: Discontinued many redundant theorems specific to 

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

1304 
instead. 

1305 

1306 
word_sub_alt ~> word_sub_wi 

1307 
word_add_alt ~> word_add_def 

1308 
word_mult_alt ~> word_mult_def 

1309 
word_minus_alt ~> word_minus_def 

1310 
word_0_alt ~> word_0_wi 

1311 
word_1_alt ~> word_1_wi 

1312 
word_add_0 ~> add_0_left 

1313 
word_add_0_right ~> add_0_right 

1314 
word_mult_1 ~> mult_1_left 

1315 
word_mult_1_right ~> mult_1_right 

1316 
word_add_commute ~> add_commute 

1317 
word_add_assoc ~> add_assoc 

1318 
word_add_left_commute ~> add_left_commute 

1319 
word_mult_commute ~> mult_commute 

1320 
word_mult_assoc ~> mult_assoc 

1321 
word_mult_left_commute ~> mult_left_commute 

1322 
word_left_distrib ~> left_distrib 

1323 
word_right_distrib ~> right_distrib 

1324 
word_left_minus ~> left_minus 

1325 
word_diff_0_right ~> diff_0_right 

1326 
word_diff_self ~> diff_self 

1327 
word_sub_def ~> diff_minus 

1328 
word_diff_minus ~> diff_minus 

1329 
word_add_ac ~> add_ac 

1330 
word_mult_ac ~> mult_ac 

1331 
word_plus_ac0 ~> add_0_left add_0_right add_ac 

1332 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 

1333 
word_order_trans ~> order_trans 

1334 
word_order_refl ~> order_refl 

1335 
word_order_antisym ~> order_antisym 

1336 
word_order_linear ~> linorder_linear 

1337 
lenw1_zero_neq_one ~> zero_neq_one 

1338 
word_number_of_eq ~> number_of_eq 

1339 
word_of_int_add_hom ~> wi_hom_add 

1340 
word_of_int_sub_hom ~> wi_hom_sub 

1341 
word_of_int_mult_hom ~> wi_hom_mult 

1342 
word_of_int_minus_hom ~> wi_hom_neg 

1343 
word_of_int_succ_hom ~> wi_hom_succ 

1344 
word_of_int_pred_hom ~> wi_hom_pred 

1345 
word_of_int_0_hom ~> word_0_wi 

1346 
word_of_int_1_hom ~> word_1_wi 

1347 

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

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

1351 
multiplication, shifting by constants, bitwise operators and numeric 

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

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

1356 

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

1359 
measure_space. The locales based on subset_class now have two 

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

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

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

1365 
Measure space constructions for distributions and densities now got 

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

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

1368 
and point_measure is introduced. INCOMPATIBILITY. 

47694  1369 

1370 
Renamed constants: 

1371 
measure > emeasure 

1372 
finite_measure.\<mu>' > measure 

1373 
product_algebra_generator > prod_algebra 

1374 
product_prob_space.emb > prod_emb 

1375 
product_prob_space.infprod_algebra > PiM 

1376 

1377 
Removed locales: 

1378 
completeable_measure_space 

1379 
finite_measure_space 

1380 
finite_prob_space 

1381 
finite_product_finite_prob_space 

1382 
finite_product_sigma_algebra 

1383 
finite_sigma_algebra 

1384 
measure_space 

1385 
pair_finite_prob_space 

1386 
pair_finite_sigma_algebra 

1387 
pair_finite_space 

1388 
pair_sigma_algebra 

1389 
product_sigma_algebra 

1390 

1391 
Removed constants: 

47751  1392 
conditional_space 
47694  1393 
distribution > use distr measure, or distributed predicate 
47751  1394 
image_space 
47694  1395 
joint_distribution > use distr measure, or distributed predicate 
47751  1396 
pair_measure_generator 
47694  1397 
product_prob_space.infprod_algebra > use PiM 
1398 
subvimage 

1399 

1400 
Replacement theorems: 

47751  1401 
finite_additivity_sufficient > ring_of_sets.countably_additiveI_finite 
1402 
finite_measure.empty_measure > measure_empty 

1403 
finite_measure.finite_continuity_from_above > finite_measure.finite_Lim_measure_decseq 

1404 
finite_measure.finite_continuity_from_below > finite_measure.finite_Lim_measure_incseq 

1405 
finite_measure.finite_measure_countably_subadditive > finite_measure.finite_measure_subadditive_countably 

1406 
finite_measure.finite_measure_eq > finite_measure.emeasure_eq_measure 

1407 
finite_measure.finite_measure > finite_measure.emeasure_finite 

1408 
finite_measure.finite_measure_finite_singleton > finite_measure.finite_measure_eq_setsum_singleton 

1409 
finite_measure.positive_measure' > measure_nonneg 

1410 
finite_measure.real_measure > finite_measure.emeasure_real 

1411 
finite_product_prob_space.finite_measure_times > finite_product_prob_space.finite_measure_PiM_emb 

1412 
finite_product_sigma_algebra.in_P > sets_PiM_I_finite 

1413 
finite_product_sigma_algebra.P_empty > space_PiM_empty, sets_PiM_empty 

1414 
information_space.conditional_entropy_eq > information_space.conditional_entropy_simple_distributed 

1415 
information_space.conditional_entropy_positive > information_space.conditional_entropy_nonneg_simple 

1416 
information_space.conditional_mutual_information_eq_mutual_information > information_space.conditional_mutual_information_eq_mutual_information_simple 

1417 
information_space.conditional_mutual_information_generic_positive > information_space.conditional_mutual_information_nonneg_simple 

1418 
information_space.conditional_mutual_information_positive > information_space.conditional_mutual_information_nonneg_simple 

1419 
information_space.entropy_commute > information_space.entropy_commute_simple 

1420 
information_space.entropy_eq > information_space.entropy_simple_distributed 

1421 
information_space.entropy_generic_eq > information_space.entropy_simple_distributed 

1422 
information_space.entropy_positive > information_space.entropy_nonneg_simple 

1423 
information_space.entropy_uniform_max > information_space.entropy_uniform 

1424 
information_space.KL_eq_0_imp > information_space.KL_eq_0_iff_eq 

1425 
information_space.KL_eq_0 > information_space.KL_same_eq_0 

1426 
information_space.KL_ge_0 > information_space.KL_nonneg 

1427 
information_space.mutual_information_eq > information_space.mutual_information_simple_distributed 

1428 
information_space.mutual_information_positive > information_space.mutual_information_nonneg_simple 

1429 
Int_stable_cuboids > Int_stable_atLeastAtMost 

1430 
Int_stable_product_algebra_generator > positive_integral 

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

47694  1432 
measure_space.additive > emeasure_additive 
47751  1433 
measure_space.AE_iff_null_set > AE_iff_null 
1434 
measure_space.almost_everywhere_def > eventually_ae_filter 

1435 
measure_space.almost_everywhere_vimage > AE_distrD 

1436 
measure_space.continuity_from_above > INF_emeasure_decseq 

1437 
measure_space.continuity_from_above_Lim > Lim_emeasure_decseq 

1438 
measure_space.continuity_from_below_Lim > Lim_emeasure_incseq 