author  wenzelm 
Thu, 28 Feb 2013 16:38:17 +0100  
changeset 51313  102a0a0718c5 
parent 51295  71fc3776c453 
child 51316  dfe469293eb4 
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 

23 

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

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

25 

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

28 

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

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

30 
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

31 
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

32 
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

33 
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

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

35 

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

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

37 
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

38 
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

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

40 

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

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

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

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

44 

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

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

46 

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

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

48 
Product_ord ~> Product_Lexorder  lexicographic order on products 
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 
INCOMPATIBILITY. 
7dbd6832a689
consolidation of library theories on product orders
haftmann
parents:
51088
diff
changeset

51 

51137  52 
* Sledgehammer: 
53 

54 
 Renamed option: 

55 
isar_shrink ~> isar_compress 

56 

50994  57 

50993  58 
New in Isabelle2013 (February 2013) 
59 
 

47887  60 

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

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

62 

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

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

64 
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

65 
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

66 
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

67 
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

68 
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

69 
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

70 

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

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

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

75 

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

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

77 
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

78 

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

81 
Tools that load their additional source files may imitate the 

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

83 
dependencies properly. 

84 

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

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

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

87 

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

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

90 

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

49841  93 
and "class ... context ...". 
94 

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

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

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

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

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

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

101 

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

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

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

104 

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

107 

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

108 

49968  109 
*** Prover IDE  Isabelle/Scala/jEdit *** 
110 

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

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

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

114 
surface, while the prover is still crunching on internal 

115 
justifications. Unfinished / cancelled proofs are restarted as 

116 
required to complete full proof checking eventually. 

117 

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

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

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

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

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

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

124 

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

127 
browser on demand. 

128 

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

131 
comment delimiters works more conveniently with unfinished situations 

132 
that frequently occur in user interaction. 

133 

134 
* More efficient painting and improved reactivity when editing large 

135 
files. More scalable management of formal document content. 

136 

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

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

138 
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

139 
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

140 
potentially infinite message streams. 
49968  141 

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

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

144 
options, including tuning parameters for editor reactivity and color 

145 
schemes. 

146 

50184  147 
* Dockable window "Symbols" provides some editing support for Isabelle 
148 
symbols. 

149 

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

50701  152 

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

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

156 

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

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

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

50183  161 

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

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

165 

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

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

167 
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

168 
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

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

170 

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

173 
now bundled exclusively with Isabelle. 

174 

175 

48205  176 
*** Pure *** 
177 

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

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

179 
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

180 

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

183 
rather arbitrary current working directory. INCOMPATIBILITY. 

48371  184 

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

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

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

189 
with some care where this is really required. 

190 

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

51063  193 
given sort. Example (in HOL): 
48792  194 

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

196 

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

199 

48205  200 

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

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

202 

50646  203 
* Sledgehammer: 
204 

205 
 Added MaSh relevance filter based on machinelearning; see the 

206 
Sledgehammer manual for details. 

207 
 Polished Isar proofs generated with "isar_proofs" option. 

208 
 Rationalized type encodings ("type_enc" option). 

50720  209 
 Renamed "kill_provers" subcommand to "kill_all". 
50646  210 
 Renamed options: 
211 
isar_proof ~> isar_proofs 

212 
isar_shrink_factor ~> isar_shrink 

213 
max_relevant ~> max_facts 

214 
relevance_thresholds ~> fact_thresholds 

215 

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

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

218 
configuration quickcheck_optimise_equality to false. 

219 

50878  220 
* Quotient: only one quotient can be defined by quotient_type 
221 
INCOMPATIBILITY. 

222 

223 
* Lifting: 

224 
 generation of an abstraction function equation in lift_definition 

225 
 quot_del attribute 

226 
 renamed no_abs_code > no_code (INCOMPATIBILITY.) 

227 

50646  228 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
229 
expressions. 

230 

231 
* Preprocessing of the code generator rewrites set comprehensions into 

232 
pointfree expressions. 

233 

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

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

236 
arithmetic, datatypes/records) with potential proof reconstruction 

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

238 
INCOMPATIBILITY. 

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

239 

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

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

241 
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

242 
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

243 
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

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

245 

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

248 

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

250 
List. INCOMPATIBILITY. 

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

251 

49739  252 
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. 
253 

49738  254 
* Class "comm_monoid_diff" formalises properties of bounded 
49388  255 
subtraction, with natural numbers and multisets as typical instances. 
256 

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

259 
* Theory "Transitive_Closure": renamed lemmas 

260 

261 
reflcl_tranclp > reflclp_tranclp 

262 
rtranclp_reflcl > rtranclp_reflclp 

263 

264 
INCOMPATIBILITY. 

265 

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

267 

268 
left_distrib ~> distrib_right 

269 
right_distrib ~> distrib_left 

270 

271 
INCOMPATIBILITY. 

272 

273 
* Generalized the definition of limits: 

274 

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

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

277 
output f x converges to G. 

278 

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

280 
infinity (at_bot). 

281 

282 
 Moved infinity in the norm (at_infinity) from 

283 
Multivariate_Analysis to Complex_Main. 

284 

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

286 
at_top". 

287 

288 
INCOMPATIBILITY. 

289 

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

291 
lattice type classes. 

292 

293 
* Theory "Library/Multiset": renamed 

294 

295 
constant fold_mset ~> Multiset.fold 

296 
fact fold_mset_commute ~> fold_mset_comm 

297 

298 
INCOMPATIBILITY. 

299 

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

301 
changes as follows. 

302 

303 
 Renamed constants (and related lemmas) 

49145  304 

305 
prefix ~> prefixeq 

306 
strict_prefix ~> prefix 

307 

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

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

311 
Renamed lemmas accordingly. 

312 

313 
 Added constant "list_hembeq" for homeomorphic embedding on 

314 
lists. Added abbreviation "sublisteq" for special case 

315 
"list_hembeq (op =)". 

316 

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

318 
class instances for the prefix order (merely corresponding locale 

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

320 
Library/Prefix_Order. 

321 

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

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

50516  324 

325 
le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff 

326 
le_list_append_mono ~> Sublist.list_hembeq_append_mono 

327 
le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2 

328 
le_list_Cons_EX ~> Sublist.list_hembeq_ConsD 

329 
le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2' 

330 
le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq 

331 
le_list_drop_Cons ~> Sublist.sublisteq_Cons' 

332 
le_list_drop_many ~> Sublist.sublisteq_drop_many 

333 
le_list_filter_left ~> Sublist.sublisteq_filter_left 

334 
le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many 

335 
le_list_rev_take_iff ~> Sublist.sublisteq_append 

336 
le_list_same_length ~> Sublist.sublisteq_same_length 

337 
le_list_take_many_iff ~> Sublist.sublisteq_append' 

49145  338 
less_eq_list.drop ~> less_eq_list_drop 
339 
less_eq_list.induct ~> less_eq_list_induct 

50516  340 
not_le_list_length ~> Sublist.not_sublisteq_length 
49145  341 

50646  342 
INCOMPATIBILITY. 
343 

344 
* New theory Library/Countable_Set. 

345 

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

347 
parallel execution for code generated towards Isabelle/ML. 

348 

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

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

351 
extensional_funcset by an abbreviation, and renamed lemmas from 

352 
extensional_funcset to PiE as follows: 

353 

354 
extensional_empty ~> PiE_empty 

355 
extensional_funcset_empty_domain ~> PiE_empty_domain 

356 
extensional_funcset_empty_range ~> PiE_empty_range 

357 
extensional_funcset_arb ~> PiE_arb 

358 
extensional_funcset_mem ~> PiE_mem 

359 
extensional_funcset_extend_domainI ~> PiE_fun_upd 

360 
extensional_funcset_restrict_domain ~> fun_upd_in_PiE 

361 
extensional_funcset_extend_domain_eq ~> PiE_insert_eq 

362 
card_extensional_funcset ~> card_PiE 

363 
finite_extensional_funcset ~> finite_PiE 

364 

365 
INCOMPATIBILITY. 

366 

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

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

369 
Data"). 

370 

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

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

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

374 
code. 

375 

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

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

378 
return a structurally different tree than before. Potential 

379 
INCOMPATIBILITY. 

380 

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

382 

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

384 

385 
* HOL/Multivariate_Analysis: replaced 

386 

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

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

389 

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

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

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

393 

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

395 

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

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

398 
cart_base i removed 

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

400 

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

401 
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

402 

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

404 

50646  405 
component_le_norm ~> Basis_le_norm 
406 
euclidean_eq ~> euclidean_eq_iff 

407 
differential_zero_maxmin_component ~> differential_zero_maxmin_cart 

408 
euclidean_simps ~> inner_simps 

409 
independent_basis ~> independent_Basis 

410 
span_basis ~> span_Basis 

411 
in_span_basis ~> in_span_Basis 

412 
norm_bound_component_le ~> norm_boound_Basis_le 

413 
norm_bound_component_lt ~> norm_boound_Basis_lt 

414 
component_le_infnorm ~> Basis_le_infnorm 

415 

416 
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

417 

50141  418 
* HOL/Probability: 
50646  419 

420 
 Added simproc "measurable" to automatically prove measurability. 

421 

422 
 Added induction rules for sigma sets with disjoint union 

423 
(sigma_sets_induct_disjoint) and for Borelmeasurable functions 

424 
(borel_measurable_induct). 

425 

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

427 
projective family). 

428 

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

430 
AFP entry "Ordinals_and_Cardinals"). 

431 

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

433 
with support for mixed, nested recursion and interesting nonfree 

434 
datatypes. 

48094  435 

50991  436 
* HOL/Finite_Set and Relation: added new set and relation operations 
50878  437 
expressed by Finite_Set.fold. 
438 

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

440 
trees for the code generator. 

441 

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

443 
Lifting/Transfer. 

444 
possible INCOMPATIBILITY. 

445 

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

447 
INCOMPATIBILITY. 

448 

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

449 

48206  450 
*** Document preparation *** 
451 

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

454 
Discontinued legacy styles "prem1" .. "prem19". 

455 

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

457 
instead of slightly exotic babel/greek. 

48206  458 

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

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

460 
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

461 
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

462 

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

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

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

465 

48206  466 

48992  467 
*** ML *** 
468 

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

471 
hardware and Poly/ML runtime system. 

472 

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

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

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

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

476 

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

479 
necessarily printing visible text. 

480 

481 

48206  482 
*** System *** 
483 

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

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

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

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

489 
document preparation as well. INCOMPATIBILITY, isabelle usedir / 

48736  490 
mkdir / make are rendered obsolete. 
491 

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

494 

495 
isabelle build s b HOL 

496 

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

498 

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

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

500 
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

501 
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

502 
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

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

504 

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

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

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

507 

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

510 

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

512 
INCOMPATIBILITY. 

513 

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

516 
version of Isabelle. 

517 

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

520 

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

522 
picked up from some surrounding directory. Potential INCOMPATIBILITY 

523 
for homemade settings. 

50132  524 

50701  525 
* Improved ML runtime statistics (heap, threads, future tasks etc.). 
526 

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

529 
configuration. 

530 

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

533 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

535 
bundled as Isabelle component. 

48206  536 

50182  537 

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

538 

47462  539 
New in Isabelle2012 (May 2012) 
540 
 

45109  541 

45593  542 
*** General *** 
543 

45614  544 
* Prover IDE (PIDE) improvements: 
545 

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

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

45614  553 

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

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

46485  557 

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

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

559 
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

560 
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

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

562 
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

563 

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

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

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

566 
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

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

568 

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

569 
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

570 

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

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

572 

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

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

574 

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

575 
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

576 
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

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

578 

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

579 
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

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

581 

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

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

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

47484  587 

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

590 
oldstyle "standard" after instantiation or composition of facts 

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

592 
indices of schematic variables. 

593 

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

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

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

597 
the historic accident of dynamic reevaluation in interpretations 

598 
etc. was exploited. 

599 

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

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

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

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

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

605 
of the material of that old tutorial. 

606 

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

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

609 
manual. 

610 

611 

612 
*** Pure *** 

613 

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

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

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

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

617 

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

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

621 
undocumented feature.) 

622 

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

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

626 

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

628 

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

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

631 

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

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

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

635 
order to accommodate newly introduced premises.) 

636 

47806  637 
* Renamed some inner syntax categories: 
638 

639 
num ~> num_token 

640 
xnum ~> xnum_token 

641 
xstr ~> str_token 

642 

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

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

645 
position information via constraints). 

646 

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

649 
manual. Minor INCOMPATIBILITY. 

650 

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

45134  653 

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

656 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  657 

47464  658 
* Redundant attribute "code_inline" has been discontinued. Use 
659 
"code_unfold" instead. INCOMPATIBILITY. 

660 

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

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

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

663 

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

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

665 

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

666 
INCOMPATIBILITY. 
45383  667 

47856  668 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
669 
instead. INCOMPATIBILITY. 

670 

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

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

673 
legacy since Isabelle2011). 

47855  674 

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

675 

45122  676 
*** HOL *** 
677 

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

680 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

685 
tinkering with former theorems mem_def and Collect_def as far as 

686 
possible. 

687 

688 
For developments which deliberately mix predicates and sets, a 

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

691 
Isabelle20111 before jumping right into the current release. 

692 

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

695 

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

697 

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

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

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

703 
user theories may require adaptations as follows: 

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

704 

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

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

706 
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

707 

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

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

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

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

711 

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

712 
 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

713 
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

714 

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

715 
 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

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

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

718 

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

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

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

721 

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

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

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

726 
corresponding parts of the Quotient package.) 

47809  727 

728 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

730 
relate different type instances of the same polymorphic constant, 

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

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

733 

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

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

736 

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

738 
equivalent subgoal on the corresponding raw types. Constants are 

739 
replaced with corresponding ones according to the transfer rules. 

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

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

745 

746 
 relator_eq attribute: Collects identity laws for relators of 

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

748 
transfer method uses these lemmas to infer transfer rules for 

749 
nonpolymorphic constants on the fly. 

750 

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

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

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

754 
after unfolding the constant definitions. 

755 

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

757 
from type nat to type int. 

758 

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

47809  761 

762 
 lift_definition command: Defines operations on an abstract type in 

763 
terms of a corresponding operation on a representation 

764 
type. Example syntax: 

765 

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

767 
is List.insert 

768 

769 
Users must discharge a respectfulness proof obligation when each 

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

771 
the proof is discharged automatically.) The obligation is 

772 
presented in a userfriendly, readable form; a respectfulness 

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

774 
by the package. 

775 

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

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

778 
lift_definition generates a code certificate theorem and sets up 

779 
code generation for each constant. 

780 

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

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

783 
or a type_definition theorem. The package configures transfer 

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

785 
lift_definition command to work with the type. 

786 

787 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  788 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
789 
Word/Word.thy and Library/Float.thy. 

47809  790 

791 
* Quotient package: 

792 

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

794 
rep and abs functions, similar to typedef. 

795 

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

797 
Transfer packages, as with 'setup_lifting'. 

798 

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

800 
respectfulness property at the point where the constant is 

801 
defined, similar to lift_definition; INCOMPATIBILITY. 

802 

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

804 
accordingly, INCOMPATIBILITY. 

805 

806 
* New diagnostic command 'find_unused_assms' to find potentially 

807 
superfluous assumptions in theorems using Quickcheck. 

808 

809 
* Quickcheck: 

810 

811 
 Quickcheck returns variable assignments as counterexamples, which 

812 
allows to reveal the underspecification of functions under test. 

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

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

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

816 

817 
These counterexample are marked as potentially spurious, as 

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

819 
obvious theorem "hd xs = hd xs". 

820 

821 
After finding a potentially spurious counterexample, Quickcheck 

822 
continues searching for genuine ones. 

823 

824 
By default, Quickcheck shows potentially spurious and genuine 

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

826 
show genuine counterexamples. 

827 

828 
 The command 'quickcheck_generator' creates random and exhaustive 

829 
value generators for a given type and operations. 

830 

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

832 
constructors of that type. 

833 

834 
 Support for multisets. 

835 

836 
 Added "use_subtype" options. 

837 

838 
 Added "quickcheck_locale" configuration to specify how to process 

839 
conjectures in a locale context. 

840 

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

47809  843 

844 
* Sledgehammer: 

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

846 
paper "More SPASS with Isabelle". 

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

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

849 
TFF1), iProver, iProverEq. 

850 
 Sped up the minimizer. 

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

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

853 
 Renamed "sound" option to "strict". 

854 

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

857 

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

859 

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

47809  861 

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

864 

865 
list.exhaust [case_product nat.exhaust] 

866 

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

868 
a list and a nat. 

869 

47809  870 
* New "eventually_elim" method as a generalized variant of the 
47855  871 
eventually_elim* rules. Supports structured proofs. 
872 

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

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

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

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

876 

47856  877 
* Record: code generation can be switched off manually with 
878 

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

880 

881 
* Datatype: type parameters allow explicit sort constraints. 

882 

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

885 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

887 
one_case. 

888 

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

890 
the result of the fact expression. 

891 

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

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

895 

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

896 
converse_def ~> converse_unfold 
47549  897 
rel_comp_def ~> relcomp_unfold 
47820  898 
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

899 
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

900 
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

901 
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

902 

46981  903 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
904 

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

47086  907 

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

908 
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

909 

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

46458  913 
rel_pow_1 ~> relpow_1 
46363  914 
rel_pow_0_I ~> relpow_0_I 
915 
rel_pow_Suc_I ~> relpow_Suc_I 

916 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

917 
rel_pow_0_E ~> relpow_0_E 

918 
rel_pow_Suc_E ~> relpow_Suc_E 

919 
rel_pow_E ~> relpow_E 

46458  920 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  921 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  922 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
923 
rel_pow_E2 ~> relpow_E2 

924 
rel_pow_add ~> relpow_add 

925 
rel_pow_commute ~> relpow 

926 
rel_pow_empty ~> relpow_empty: 

927 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

928 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

929 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

930 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

931 
rel_pow_fun_conv ~> relpow_fun_conv 

932 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

933 
rel_pow_finite_bounded ~> relpow_finite_bounded 

934 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

935 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

936 
single_valued_rel_pow ~> single_valued_relpow 

47463  937 

46363  938 
INCOMPATIBILITY. 
939 

47448  940 
* Theory Relation: Consolidated constant name for relation composition 
47464  941 
and corresponding theorem names: 
942 

47549  943 
 Renamed constant rel_comp to relcomp. 
47464  944 

47448  945 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  946 

47448  947 
 Renamed theorems: 
47464  948 

47448  949 
rel_compI ~> relcompI 
950 
rel_compEpair ~> relcompEpair 

951 
rel_compE ~> relcompE 

952 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

953 
rel_comp_empty1 ~> relcomp_empty1 

954 
rel_comp_mono ~> relcomp_mono 

955 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

956 
rel_comp_distrib ~> relcomp_distrib 

957 
rel_comp_distrib2 ~> relcomp_distrib2 

958 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

959 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

960 
single_valued_rel_comp ~> single_valued_relcomp 

47549  961 
rel_comp_def ~> relcomp_unfold 
47448  962 
converse_rel_comp ~> converse_relcomp 
963 
pred_compI ~> relcomppI 

964 
pred_compE ~> relcomppE 

965 
pred_comp_bot1 ~> relcompp_bot1 

966 
pred_comp_bot2 ~> relcompp_bot2 

967 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

968 
pred_comp_mono ~> relcompp_mono 

969 
pred_comp_distrib ~> relcompp_distrib 

970 
pred_comp_distrib2 ~> relcompp_distrib2 

971 
converse_pred_comp ~> converse_relcompp 

47464  972 

47448  973 
finite_rel_comp ~> finite_relcomp 
47464  974 

47448  975 
set_rel_comp ~> set_relcomp 
976 

977 
INCOMPATIBILITY. 

978 

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

981 

982 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

983 
zdiv_self ~> div_self 

984 
zmod_self ~> mod_self 

985 
zdiv_zero ~> div_0 

986 
zmod_zero ~> mod_0 

987 
zdiv_zmod_equality ~> div_mod_equality2 

988 
zdiv_zmod_equality2 ~> div_mod_equality 

989 
zmod_zdiv_trivial ~> mod_div_trivial 

990 
zdiv_zminus_zminus ~> div_minus_minus 

991 
zmod_zminus_zminus ~> mod_minus_minus 

992 
zdiv_zminus2 ~> div_minus_right 

993 
zmod_zminus2 ~> mod_minus_right 

994 
zdiv_minus1_right ~> div_minus1_right 

995 
zmod_minus1_right ~> mod_minus1_right 

996 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

997 
zmod_zmult1_eq ~> mod_mult_right_eq 

998 
zpower_zmod ~> power_mod 

999 
zdvd_zmod ~> dvd_mod 

1000 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

1001 
mod_mult_distrib ~> mult_mod_left 

1002 
mod_mult_distrib2 ~> mult_mod_right 

1003 

1004 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

1005 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

1006 

47551  1007 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
1008 

47552  1009 
* Consolidated theorem names concerning fold combinators: 
47550  1010 

1011 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

1012 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

1013 
INFI_fold_inf ~> INF_fold_inf 

1014 
SUPR_fold_sup ~> SUP_fold_sup 

1015 
union_set ~> union_set_fold 

1016 
minus_set ~> minus_set_fold 

1017 
INFI_set_fold ~> INF_set_fold 

1018 
SUPR_set_fold ~> SUP_set_fold 

1019 
INF_code ~> INF_set_foldr 

1020 
SUP_code ~> SUP_set_foldr 

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

1022 
foldr_fold_rev ~> foldr_conv_fold 

1023 
foldl_fold ~> foldl_conv_fold 

1024 
foldr_foldr ~> foldr_conv_foldl 

1025 
foldl_foldr ~> foldl_conv_foldr 

47552  1026 
fold_set_remdups ~> fold_set_fold_remdups 
1027 
fold_set ~> fold_set_fold 

1028 
fold1_set ~> fold1_set_fold 

47550  1029 

1030 
INCOMPATIBILITY. 

1031 

1032 
* Dropped rarely useful theorems concerning fold combinators: 

1033 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

1034 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

1035 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

1036 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

1037 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

1038 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

1042 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

1043 

1044 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

1045 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

1046 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

1047 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

1049 
fold_conv_foldr and fold_rev. 

1050 

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

1052 
through option types. 

1053 

47856  1054 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
1055 
relations. 

1056 

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

1058 

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

1060 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

1061 

1062 
zminus_zminus ~> minus_minus 

1063 
zminus_0 ~> minus_zero 

1064 
zminus_zadd_distrib ~> minus_add_distrib 

1065 
zadd_commute ~> add_commute 

1066 
zadd_assoc ~> add_assoc 

1067 
zadd_left_commute ~> add_left_commute 

1068 
zadd_ac ~> add_ac 

1069 
zmult_ac ~> mult_ac 

1070 
zadd_0 ~> add_0_left 

1071 
zadd_0_right ~> add_0_right 

1072 
zadd_zminus_inverse2 ~> left_minus 

1073 
zmult_zminus ~> mult_minus_left 

1074 
zmult_commute ~> mult_commute 

1075 
zmult_assoc ~> mult_assoc 

1076 
zadd_zmult_distrib ~> left_distrib 

1077 
zadd_zmult_distrib2 ~> right_distrib 

1078 
zdiff_zmult_distrib ~> left_diff_distrib 

1079 
zdiff_zmult_distrib2 ~> right_diff_distrib 

1080 
zmult_1 ~> mult_1_left 

1081 
zmult_1_right ~> mult_1_right 

1082 
zle_refl ~> order_refl 

1083 
zle_trans ~> order_trans 

1084 
zle_antisym ~> order_antisym 

1085 
zle_linear ~> linorder_linear 

1086 
zless_linear ~> linorder_less_linear 

1087 
zadd_left_mono ~> add_left_mono 

1088 
zadd_strict_right_mono ~> add_strict_right_mono 

1089 
zadd_zless_mono ~> add_less_le_mono 

1090 
int_0_less_1 ~> zero_less_one 

1091 
int_0_neq_1 ~> zero_neq_one 

1092 
zless_le ~> less_le 

1093 
zpower_zadd_distrib ~> power_add 

1094 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

1095 
zero_le_zpower_abs ~> zero_le_power_abs 

1096 

1097 
* Theory Deriv: Renamed 

1098 

1099 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

1100 

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

1102 

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

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

1107 
INCOMPATIBILITY. 

1108 

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

1111 

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

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

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

1116 
follows: 

47452  1117 

1118 
Operations: 

1119 
bulkload > rbt_bulkload 

1120 
del_from_left > rbt_del_from_left 

1121 
del_from_right > rbt_del_from_right 

1122 
del > rbt_del 

1123 
delete > rbt_delete 

1124 
ins > rbt_ins 

1125 
insert > rbt_insert 

1126 
insertw > rbt_insert_with 

1127 
insert_with_key > rbt_insert_with_key 

1128 
map_entry > rbt_map_entry 

1129 
lookup > rbt_lookup 

1130 
sorted > rbt_sorted 

1131 
tree_greater > rbt_greater 

1132 
tree_less > rbt_less 

1133 
tree_less_symbol > rbt_less_symbol 

1134 
union > rbt_union 

1135 
union_with > rbt_union_with 

1136 
union_with_key > rbt_union_with_key 

1137 

1138 
Lemmas: 

1139 
balance_left_sorted > balance_left_rbt_sorted 

1140 
balance_left_tree_greater > balance_left_rbt_greater 

1141 
balance_left_tree_less > balance_left_rbt_less 

1142 
balance_right_sorted > balance_right_rbt_sorted 

1143 
balance_right_tree_greater > balance_right_rbt_greater 

1144 
balance_right_tree_less > balance_right_rbt_less 

1145 
balance_sorted > balance_rbt_sorted 

1146 
balance_tree_greater > balance_rbt_greater 

1147 
balance_tree_less > balance_rbt_less 

1148 
bulkload_is_rbt > rbt_bulkload_is_rbt 

1149 
combine_sorted > combine_rbt_sorted 

1150 
combine_tree_greater > combine_rbt_greater 

1151 
combine_tree_less > combine_rbt_less 

1152 
delete_in_tree > rbt_delete_in_tree 

1153 
delete_is_rbt > rbt_delete_is_rbt 

1154 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

1155 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

1156 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

1157 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

1158 
del_in_tree > rbt_del_in_tree 

1159 
del_inv1_inv2 > rbt_del_inv1_inv2 

1160 
del_sorted > rbt_del_rbt_sorted 

1161 
del_tree_greater > rbt_del_rbt_greater 

1162 
del_tree_less > rbt_del_rbt_less 

1163 
dom_lookup_Branch > dom_rbt_lookup_Branch 

1164 
entries_lookup > entries_rbt_lookup 

1165 
finite_dom_lookup > finite_dom_rbt_lookup 

1166 
insert_sorted > rbt_insert_rbt_sorted 

1167 
insertw_is_rbt > rbt_insertw_is_rbt 

1168 
insertwk_is_rbt > rbt_insertwk_is_rbt 

1169 
insertwk_sorted > rbt_insertwk_rbt_sorted 

1170 
insertw_sorted > rbt_insertw_rbt_sorted 

1171 
ins_sorted > ins_rbt_sorted 

1172 
ins_tree_greater > ins_rbt_greater 

1173 
ins_tree_less > ins_rbt_less 

1174 
is_rbt_sorted > is_rbt_rbt_sorted 

1175 
lookup_balance > rbt_lookup_balance 

1176 
lookup_bulkload > rbt_lookup_rbt_bulkload 

1177 
lookup_delete > rbt_lookup_rbt_delete 

1178 
lookup_Empty > rbt_lookup_Empty 

1179 
lookup_from_in_tree > rbt_lookup_from_in_tree 

1180 
lookup_in_tree > rbt_lookup_in_tree 

1181 
lookup_ins > rbt_lookup_ins 

1182 
lookup_insert > rbt_lookup_rbt_insert 

1183 
lookup_insertw > rbt_lookup_rbt_insertw 

1184 
lookup_insertwk > rbt_lookup_rbt_insertwk 

1185 
lookup_keys > rbt_lookup_keys 

1186 
lookup_map > rbt_lookup_map 

1187 
lookup_map_entry > rbt_lookup_rbt_map_entry 

1188 
lookup_tree_greater > rbt_lookup_rbt_greater 

1189 
lookup_tree_less > rbt_lookup_rbt_less 

1190 
lookup_union > rbt_lookup_rbt_union 

1191 
map_entry_color_of > rbt_map_entry_color_of 

1192 
map_entry_inv1 > rbt_map_entry_inv1 

1193 
map_entry_inv2 > rbt_map_entry_inv2 

1194 
map_entry_is_rbt > rbt_map_entry_is_rbt 

1195 
map_entry_sorted > rbt_map_entry_rbt_sorted 

1196 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

1197 
map_entry_tree_less > rbt_map_entry_rbt_less 

1198 
map_tree_greater > map_rbt_greater 

1199 
map_tree_less > map_rbt_less 

1200 
map_sorted > map_rbt_sorted 

1201 
paint_sorted > paint_rbt_sorted 

1202 
paint_lookup > paint_rbt_lookup 

1203 
paint_tree_greater > paint_rbt_greater 

1204 
paint_tree_less > paint_rbt_less 

1205 
sorted_entries > rbt_sorted_entries 

1206 
tree_greater_eq_trans > rbt_greater_eq_trans 

1207 
tree_greater_nit > rbt_greater_nit 

1208 
tree_greater_prop > rbt_greater_prop 

1209 
tree_greater_simps > rbt_greater_simps 

1210 
tree_greater_trans > rbt_greater_trans 

1211 
tree_less_eq_trans > rbt_less_eq_trans 

1212 
tree_less_nit > rbt_less_nit 

1213 
tree_less_prop > rbt_less_prop 

1214 
tree_less_simps > rbt_less_simps 

1215 
tree_less_trans > rbt_less_trans 

1216 
tree_ord_props > rbt_ord_props 

1217 
union_Branch > rbt_union_Branch 

1218 
union_is_rbt > rbt_union_is_rbt 

1219 
unionw_is_rbt > rbt_unionw_is_rbt 

1220 
unionwk_is_rbt > rbt_unionwk_is_rbt 

1221 
unionwk_sorted > rbt_unionwk_rbt_sorted 

1222 

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

1225 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  1226 

1227 
Changed Operations: 

47622  1228 
float_abs > abs 
1229 
float_nprt > nprt 

1230 
float_pprt > pprt 

1231 
pow2 > use powr 

1232 
round_down > float_round_down 

1233 
round_up > float_round_up 

1234 
scale > exponent 

1235 

1236 
Removed Operations: 

1237 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

1238 

1239 
Renamed Lemmas: 

1240 
abs_float_def > Float.compute_float_abs 

1241 
bitlen_ge0 > bitlen_nonneg 

1242 
bitlen.simps > Float.compute_bitlen 

1243 
float_components > Float_mantissa_exponent 

1244 
float_divl.simps > Float.compute_float_divl 

1245 
float_divr.simps > Float.compute_float_divr 

1246 
float_eq_odd > mult_powr_eq_mult_powr_iff 

1247 
float_power > real_of_float_power 

1248 
lapprox_posrat_def > Float.compute_lapprox_posrat 

1249 
lapprox_rat.simps > Float.compute_lapprox_rat 

1250 
le_float_def' > Float.compute_float_le 

1251 
le_float_def > less_eq_float.rep_eq 

1252 
less_float_def' > Float.compute_float_less 

1253 
less_float_def > less_float.rep_eq 

1254 
normfloat_def > Float.compute_normfloat 

1255 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

1256 
normfloat > normfloat_def 

1257 
normfloat_unique > use normfloat_def 

1258 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

1259 
one_float_def > Float.compute_float_one 

1260 
plus_float_def > Float.compute_float_plus 

1261 
rapprox_posrat_def > Float.compute_rapprox_posrat 

1262 
rapprox_rat.simps > Float.compute_rapprox_rat 

1263 
real_of_float_0 > zero_float.rep_eq 

1264 
real_of_float_1 > one_float.rep_eq 

1265 
real_of_float_abs > abs_float.rep_eq 

1266 
real_of_float_add > plus_float.rep_eq 

1267 
real_of_float_minus > uminus_float.rep_eq 

1268 
real_of_float_mult > times_float.rep_eq 

1269 
real_of_float_simp > Float.rep_eq 

1270 
real_of_float_sub > minus_float.rep_eq 

1271 
round_down.simps > Float.compute_float_round_down 

1272 
round_up.simps > Float.compute_float_round_up 

1273 
times_float_def > Float.compute_float_times 

1274 
uminus_float_def > Float.compute_float_uminus 

1275 
zero_float_def > Float.compute_float_zero 

1276 

1277 
Lemmas not necessary anymore, use the transfer method: 

1278 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

1279 
float_divr, float_le_simp, float_less1_mantissa_bound, 

1280 
float_less_simp, float_less_zero, float_le_zero, 

1281 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

1282 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

1283 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

1284 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

1285 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

1286 
round_up, zero_le_float, zero_less_float 

47616  1287 

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

45791  1290 

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

1293 

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

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

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

1298 

1299 
* Session HOLWord: Discontinued many redundant theorems specific to 

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

1301 
instead. 

1302 

1303 
word_sub_alt ~> word_sub_wi 

1304 
word_add_alt ~> word_add_def 

1305 
word_mult_alt ~> word_mult_def 

1306 
word_minus_alt ~> word_minus_def 

1307 
word_0_alt ~> word_0_wi 

1308 
word_1_alt ~> word_1_wi 

1309 
word_add_0 ~> add_0_left 

1310 
word_add_0_right ~> add_0_right 

1311 
word_mult_1 ~> mult_1_left 

1312 
word_mult_1_right ~> mult_1_right 

1313 
word_add_commute ~> add_commute 

1314 
word_add_assoc ~> add_assoc 

1315 
word_add_left_commute ~> add_left_commute 

1316 
word_mult_commute ~> mult_commute 

1317 
word_mult_assoc ~> mult_assoc 

1318 
word_mult_left_commute ~> mult_left_commute 

1319 
word_left_distrib ~> left_distrib 

1320 
word_right_distrib ~> right_distrib 

1321 
word_left_minus ~> left_minus 

1322 
word_diff_0_right ~> diff_0_right 

1323 
word_diff_self ~> diff_self 

1324 
word_sub_def ~> diff_minus 

1325 
word_diff_minus ~> diff_minus 

1326 
word_add_ac ~> add_ac 

1327 
word_mult_ac ~> mult_ac 

1328 
word_plus_ac0 ~> add_0_left add_0_right add_ac 

1329 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 

1330 
word_order_trans ~> order_trans 

1331 
word_order_refl ~> order_refl 

1332 
word_order_antisym ~> order_antisym 

1333 
word_order_linear ~> linorder_linear 

1334 
lenw1_zero_neq_one ~> zero_neq_one 

1335 
word_number_of_eq ~> number_of_eq 

1336 
word_of_int_add_hom ~> wi_hom_add 

1337 
word_of_int_sub_hom ~> wi_hom_sub 

1338 
word_of_int_mult_hom ~> wi_hom_mult 

1339 
word_of_int_minus_hom ~> wi_hom_neg 

1340 
word_of_int_succ_hom ~> wi_hom_succ 

1341 
word_of_int_pred_hom ~> wi_hom_pred 

1342 
word_of_int_0_hom ~> word_0_wi 

1343 
word_of_int_1_hom ~> word_1_wi 

1344 

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

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

1348 
multiplication, shifting by constants, bitwise operators and numeric 

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

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

1353 

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

1356 
measure_space. The locales based on subset_class now have two 

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

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

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

1362 
Measure space constructions for distributions and densities now got 

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

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

1365 
and point_measure is introduced. INCOMPATIBILITY. 

47694  1366 

1367 
Renamed constants: 

1368 
measure > emeasure 

1369 
finite_measure.\<mu>' > measure 

1370 
product_algebra_generator > prod_algebra 

1371 
product_prob_space.emb > prod_emb 

1372 
product_prob_space.infprod_algebra > PiM 

1373 

1374 
Removed locales: 

1375 
completeable_measure_space 

1376 
finite_measure_space 

1377 
finite_prob_space 

1378 
finite_product_finite_prob_space 

1379 
finite_product_sigma_algebra 

1380 
finite_sigma_algebra 

1381 
measure_space 

1382 
pair_finite_prob_space 

1383 
pair_finite_sigma_algebra 

1384 
pair_finite_space 

1385 
pair_sigma_algebra 

1386 
product_sigma_algebra 

1387 

1388 
Removed constants: 

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

1396 

1397 
Replacement theorems: 

47751  1398 
finite_additivity_sufficient > ring_of_sets.countably_additiveI_finite 
1399 
finite_measure.empty_measure > measure_empty 

1400 
finite_measure.finite_continuity_from_above > finite_measure.finite_Lim_measure_decseq 

1401 
finite_measure.finite_continuity_from_below > finite_measure.finite_Lim_measure_incseq 

1402 
finite_measure.finite_measure_countably_subadditive > finite_measure.finite_measure_subadditive_countably 

1403 
finite_measure.finite_measure_eq > finite_measure.emeasure_eq_measure 

1404 
finite_measure.finite_measure > finite_measure.emeasure_finite 

1405 
finite_measure.finite_measure_finite_singleton > finite_measure.finite_measure_eq_setsum_singleton 

1406 
finite_measure.positive_measure' > measure_nonneg 

1407 
finite_measure.real_measure > finite_measure.emeasure_real 

1408 
finite_product_prob_space.finite_measure_times > finite_product_prob_space.finite_measure_PiM_emb 

1409 
finite_product_sigma_algebra.in_P > sets_PiM_I_finite 

1410 
finite_product_sigma_algebra.P_empty > space_PiM_empty, sets_PiM_empty 

1411 
information_space.conditional_entropy_eq > information_space.conditional_entropy_simple_distributed 

1412 
information_space.conditional_entropy_positive > information_space.conditional_entropy_nonneg_simple 

1413 
information_space.conditional_mutual_information_eq_mutual_information > information_space.conditional_mutual_information_eq_mutual_information_simple 

1414 
information_space.conditional_mutual_information_generic_positive > information_space.conditional_mutual_information_nonneg_simple 

1415 
information_space.conditional_mutual_information_positive > information_space.conditional_mutual_information_nonneg_simple 

1416 
information_space.entropy_commute > information_space.entropy_commute_simple 

1417 
information_space.entropy_eq > information_space.entropy_simple_distributed 

1418 
information_space.entropy_generic_eq > information_space.entropy_simple_distributed 

1419 
information_space.entropy_positive > information_space.entropy_nonneg_simple 

1420 
information_space.entropy_uniform_max > information_space.entropy_uniform 

1421 
information_space.KL_eq_0_imp > information_space.KL_eq_0_iff_eq 

1422 
information_space.KL_eq_0 > information_space.KL_same_eq_0 

1423 
information_space.KL_ge_0 > information_space.KL_nonneg 

1424 
information_space.mutual_information_eq > information_space.mutual_information_simple_distributed 

1425 
information_space.mutual_information_positive > information_space.mutual_information_nonneg_simple 

1426 
Int_stable_cuboids > Int_stable_atLeastAtMost 

1427 
Int_stable_product_algebra_generator > positive_integral 

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

47694  1429 
measure_space.additive > emeasure_additive 
47751  1430 
measure_space.AE_iff_null_set > AE_iff_null 
1431 
measure_space.almost_everywhere_def > eventually_ae_filter 

1432 
measure_space.almost_everywhere_vimage > AE_distrD 

1433 
measure_space.continuity_from_above > INF_emeasure_decseq 

1434 
measure_space.continuity_from_above_Lim > Lim_emeasure_decseq 

1435 
measure_space.continuity_from_below_Lim > Lim_emeasure_incseq 

47694  1436 
measure_space.continuity_from_below > SUP_emeasure_incseq 
47751  1437 
measure_space_density > emeasure_density 
1438 
measure_space.density_is_absolutely_continuous  