author  ballarin 
Mon, 25 Mar 2013 20:00:27 +0100  
changeset 51517  7957d26c3334 
parent 51490  7edcc0618dae 
child 51533  3f6280aedbcc 
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 

51417  9 
* Sessions may be organized via 'chapter' specifications in the ROOT 
10 
file, which determines a twolevel hierarchy of browser info. The old 

11 
treelike organization via implicit subsession relation, with its 

12 
tendency towards erratic fluctuation of URLs, has been discontinued. 

13 
The default chapter is "Unsorted". Potential INCOMPATIBILITY for HTML 

14 
presentation of theories. 

15 

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

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

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

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

19 

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

22 

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

23 

51313  24 
*** Pure *** 
25 

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

27 
legacy since Isabelle20092. INCOMPATIBILITY, use 'axiomatization' 

28 
instead, while observing its uniform scope for polymorphism. 

29 

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

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

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

32 

51313  33 

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

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

35 

51489  36 
* Revised devices for recursive definitions over finite sets: 
37 
 Only one fundamental fold combinator on finite set remains: 

38 
Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b 

39 
This is now identity on infinite sets. 

40 
 Locales (»mini packages«) for fundamental definitions with 

41 
Finite_Set.fold: folding, folding_idem. 

42 
 Locales comm_monoid_set, semilattice_order_set and 

43 
semilattice_neutr_order_set for big operators on sets. 

44 
See theory Big_Operators for canonical examples. 

45 
Note that foundational constants comm_monoid_set.F and 

46 
semilattice_set.F correspond to former combinators fold_image 

47 
and fold1 respectively. These are now gone. You may use 

51490  48 
those foundational constants as substitutes, but it is 
51489  49 
preferable to interpret the above locales accordingly. 
50 
 Dropped class ab_semigroup_idem_mult (special case of lattice, 

51 
no longer needed in connection with Finite_Set.fold etc.) 

52 
 Fact renames: 

53 
card.union_inter ~> card_Un_Int [symmetric] 

54 
card.union_disjoint ~> card_Un_disjoint 

55 

56 
INCOMPATIBILITY. 

57 

51487  58 
* Locale hierarchy for abstract orderings and (semi)lattices. 
59 

51382
51957d006677
discontinued theory src/HOL/Library/Eval_Witness  assumptions do not longer hold in presence of abstract types
haftmann
parents:
51316
diff
changeset

60 
* Discontinued theory src/HOL/Library/Eval_Witness. 
51957d006677
discontinued theory src/HOL/Library/Eval_Witness  assumptions do not longer hold in presence of abstract types
haftmann
parents:
51316
diff
changeset

61 
INCOMPATIBILITY. 
51957d006677
discontinued theory src/HOL/Library/Eval_Witness  assumptions do not longer hold in presence of abstract types
haftmann
parents:
51316
diff
changeset

62 

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

65 

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

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

67 
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

68 
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

69 
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

70 
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

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

72 

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

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

74 
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

75 
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

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

77 

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

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

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

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

81 

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

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

83 

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

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

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

86 

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

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

88 

51137  89 
* Sledgehammer: 
90 

91 
 Renamed option: 

92 
isar_shrink ~> isar_compress 

93 

50994  94 

51517
7957d26c3334
Discontinued theories src/HOL/Algebra/abstract and .../poly.
ballarin
parents:
51490
diff
changeset

95 
*** HOLAlgebra *** 
7957d26c3334
Discontinued theories src/HOL/Algebra/abstract and .../poly.
ballarin
parents:
51490
diff
changeset

96 

7957d26c3334
Discontinued theories src/HOL/Algebra/abstract and .../poly.
ballarin
parents:
51490
diff
changeset

97 
* Discontinued theories src/HOL/Algebra/abstract and .../poly. 
7957d26c3334
Discontinued theories src/HOL/Algebra/abstract and .../poly.
ballarin
parents:
51490
diff
changeset

98 
Existing theories should be based on src/HOL/Library/Polynomial 
7957d26c3334
Discontinued theories src/HOL/Algebra/abstract and .../poly.
ballarin
parents:
51490
diff
changeset

99 
instead. The latter provides integration with HOL's type classes for 
7957d26c3334
Discontinued theories src/HOL/Algebra/abstract and .../poly.
ballarin
parents:
51490
diff
changeset

100 
rings. INCOMPATIBILITY. 
7957d26c3334
Discontinued theories src/HOL/Algebra/abstract and .../poly.
ballarin
parents:
51490
diff
changeset

101 

7957d26c3334
Discontinued theories src/HOL/Algebra/abstract and .../poly.
ballarin
parents:
51490
diff
changeset

102 

51398
c3d02b3518c2
discontinued "isabelle usedir" option P (remote path);
wenzelm
parents:
51382
diff
changeset

103 
*** System *** 
c3d02b3518c2
discontinued "isabelle usedir" option P (remote path);
wenzelm
parents:
51382
diff
changeset

104 

51399
6ac3c29a300e
discontinued "isabelle usedir" option r (reset session path);
wenzelm
parents:
51398
diff
changeset

105 
* Discontinued "isabelle usedir" option P (remote path) and r (reset 
6ac3c29a300e
discontinued "isabelle usedir" option r (reset session path);
wenzelm
parents:
51398
diff
changeset

106 
session path). Note that usedir is legacy and superseded by "isabelle 
6ac3c29a300e
discontinued "isabelle usedir" option r (reset session path);
wenzelm
parents:
51398
diff
changeset

107 
build" since Isabelle2013. 
51398
c3d02b3518c2
discontinued "isabelle usedir" option P (remote path);
wenzelm
parents:
51382
diff
changeset

108 

c3d02b3518c2
discontinued "isabelle usedir" option P (remote path);
wenzelm
parents:
51382
diff
changeset

109 

c3d02b3518c2
discontinued "isabelle usedir" option P (remote path);
wenzelm
parents:
51382
diff
changeset

110 

50993  111 
New in Isabelle2013 (February 2013) 
112 
 

47887  113 

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

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

115 

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

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

117 
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

118 
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

119 
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

120 
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

121 
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

122 
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

123 

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

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

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

128 

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

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

130 
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

131 

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

134 
Tools that load their additional source files may imitate the 

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

136 
dependencies properly. 

137 

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

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

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

140 

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

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

143 

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

49841  146 
and "class ... context ...". 
147 

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

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

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

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

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

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

154 

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

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

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

157 

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

160 

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

161 

49968  162 
*** Prover IDE  Isabelle/Scala/jEdit *** 
163 

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

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

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

167 
surface, while the prover is still crunching on internal 

168 
justifications. Unfinished / cancelled proofs are restarted as 

169 
required to complete full proof checking eventually. 

170 

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

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

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

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

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

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

177 

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

180 
browser on demand. 

181 

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

184 
comment delimiters works more conveniently with unfinished situations 

185 
that frequently occur in user interaction. 

186 

187 
* More efficient painting and improved reactivity when editing large 

188 
files. More scalable management of formal document content. 

189 

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

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

191 
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

192 
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

193 
potentially infinite message streams. 
49968  194 

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

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

197 
options, including tuning parameters for editor reactivity and color 

198 
schemes. 

199 

50184  200 
* Dockable window "Symbols" provides some editing support for Isabelle 
201 
symbols. 

202 

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

50701  205 

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

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

209 

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

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

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

50183  214 

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

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

218 

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

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

220 
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

221 
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

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

223 

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

226 
now bundled exclusively with Isabelle. 

227 

228 

48205  229 
*** Pure *** 
230 

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

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

232 
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

233 

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

236 
rather arbitrary current working directory. INCOMPATIBILITY. 

48371  237 

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

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

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

242 
with some care where this is really required. 

243 

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

51063  246 
given sort. Example (in HOL): 
48792  247 

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

249 

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

252 

48205  253 

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

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

255 

50646  256 
* Sledgehammer: 
257 

258 
 Added MaSh relevance filter based on machinelearning; see the 

259 
Sledgehammer manual for details. 

260 
 Polished Isar proofs generated with "isar_proofs" option. 

261 
 Rationalized type encodings ("type_enc" option). 

50720  262 
 Renamed "kill_provers" subcommand to "kill_all". 
50646  263 
 Renamed options: 
264 
isar_proof ~> isar_proofs 

265 
isar_shrink_factor ~> isar_shrink 

266 
max_relevant ~> max_facts 

267 
relevance_thresholds ~> fact_thresholds 

268 

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

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

271 
configuration quickcheck_optimise_equality to false. 

272 

50878  273 
* Quotient: only one quotient can be defined by quotient_type 
274 
INCOMPATIBILITY. 

275 

276 
* Lifting: 

277 
 generation of an abstraction function equation in lift_definition 

278 
 quot_del attribute 

279 
 renamed no_abs_code > no_code (INCOMPATIBILITY.) 

280 

50646  281 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
282 
expressions. 

283 

284 
* Preprocessing of the code generator rewrites set comprehensions into 

285 
pointfree expressions. 

286 

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

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

289 
arithmetic, datatypes/records) with potential proof reconstruction 

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

291 
INCOMPATIBILITY. 

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

292 

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

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

294 
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

295 
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

296 
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

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

298 

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

301 

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

303 
List. INCOMPATIBILITY. 

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

304 

49739  305 
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. 
306 

49738  307 
* Class "comm_monoid_diff" formalises properties of bounded 
49388  308 
subtraction, with natural numbers and multisets as typical instances. 
309 

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

312 
* Theory "Transitive_Closure": renamed lemmas 

313 

314 
reflcl_tranclp > reflclp_tranclp 

315 
rtranclp_reflcl > rtranclp_reflclp 

316 

317 
INCOMPATIBILITY. 

318 

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

320 

321 
left_distrib ~> distrib_right 

322 
right_distrib ~> distrib_left 

323 

324 
INCOMPATIBILITY. 

325 

326 
* Generalized the definition of limits: 

327 

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

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

330 
output f x converges to G. 

331 

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

333 
infinity (at_bot). 

334 

335 
 Moved infinity in the norm (at_infinity) from 

336 
Multivariate_Analysis to Complex_Main. 

337 

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

339 
at_top". 

340 

341 
INCOMPATIBILITY. 

342 

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

344 
lattice type classes. 

345 

346 
* Theory "Library/Multiset": renamed 

347 

348 
constant fold_mset ~> Multiset.fold 

349 
fact fold_mset_commute ~> fold_mset_comm 

350 

351 
INCOMPATIBILITY. 

352 

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

354 
changes as follows. 

355 

356 
 Renamed constants (and related lemmas) 

49145  357 

358 
prefix ~> prefixeq 

359 
strict_prefix ~> prefix 

360 

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

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

364 
Renamed lemmas accordingly. 

365 

366 
 Added constant "list_hembeq" for homeomorphic embedding on 

367 
lists. Added abbreviation "sublisteq" for special case 

368 
"list_hembeq (op =)". 

369 

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

371 
class instances for the prefix order (merely corresponding locale 

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

373 
Library/Prefix_Order. 

374 

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

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

50516  377 

378 
le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff 

379 
le_list_append_mono ~> Sublist.list_hembeq_append_mono 

380 
le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2 

381 
le_list_Cons_EX ~> Sublist.list_hembeq_ConsD 

382 
le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2' 

383 
le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq 

384 
le_list_drop_Cons ~> Sublist.sublisteq_Cons' 

385 
le_list_drop_many ~> Sublist.sublisteq_drop_many 

386 
le_list_filter_left ~> Sublist.sublisteq_filter_left 

387 
le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many 

388 
le_list_rev_take_iff ~> Sublist.sublisteq_append 

389 
le_list_same_length ~> Sublist.sublisteq_same_length 

390 
le_list_take_many_iff ~> Sublist.sublisteq_append' 

49145  391 
less_eq_list.drop ~> less_eq_list_drop 
392 
less_eq_list.induct ~> less_eq_list_induct 

50516  393 
not_le_list_length ~> Sublist.not_sublisteq_length 
49145  394 

50646  395 
INCOMPATIBILITY. 
396 

397 
* New theory Library/Countable_Set. 

398 

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

400 
parallel execution for code generated towards Isabelle/ML. 

401 

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

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

404 
extensional_funcset by an abbreviation, and renamed lemmas from 

405 
extensional_funcset to PiE as follows: 

406 

407 
extensional_empty ~> PiE_empty 

408 
extensional_funcset_empty_domain ~> PiE_empty_domain 

409 
extensional_funcset_empty_range ~> PiE_empty_range 

410 
extensional_funcset_arb ~> PiE_arb 

411 
extensional_funcset_mem ~> PiE_mem 

412 
extensional_funcset_extend_domainI ~> PiE_fun_upd 

413 
extensional_funcset_restrict_domain ~> fun_upd_in_PiE 

414 
extensional_funcset_extend_domain_eq ~> PiE_insert_eq 

415 
card_extensional_funcset ~> card_PiE 

416 
finite_extensional_funcset ~> finite_PiE 

417 

418 
INCOMPATIBILITY. 

419 

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

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

422 
Data"). 

423 

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

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

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

427 
code. 

428 

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

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

431 
return a structurally different tree than before. Potential 

432 
INCOMPATIBILITY. 

433 

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

435 

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

437 

438 
* HOL/Multivariate_Analysis: replaced 

439 

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

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

442 

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

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

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

446 

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

448 

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

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

451 
cart_base i removed 

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

453 

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

454 
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

455 

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

456 
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

457 

50646  458 
component_le_norm ~> Basis_le_norm 
459 
euclidean_eq ~> euclidean_eq_iff 

460 
differential_zero_maxmin_component ~> differential_zero_maxmin_cart 

461 
euclidean_simps ~> inner_simps 

462 
independent_basis ~> independent_Basis 

463 
span_basis ~> span_Basis 

464 
in_span_basis ~> in_span_Basis 

465 
norm_bound_component_le ~> norm_boound_Basis_le 

466 
norm_bound_component_lt ~> norm_boound_Basis_lt 

467 
component_le_infnorm ~> Basis_le_infnorm 

468 

469 
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

470 

50141  471 
* HOL/Probability: 
50646  472 

473 
 Added simproc "measurable" to automatically prove measurability. 

474 

475 
 Added induction rules for sigma sets with disjoint union 

476 
(sigma_sets_induct_disjoint) and for Borelmeasurable functions 

477 
(borel_measurable_induct). 

478 

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

480 
projective family). 

481 

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

483 
AFP entry "Ordinals_and_Cardinals"). 

484 

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

486 
with support for mixed, nested recursion and interesting nonfree 

487 
datatypes. 

48094  488 

50991  489 
* HOL/Finite_Set and Relation: added new set and relation operations 
50878  490 
expressed by Finite_Set.fold. 
491 

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

493 
trees for the code generator. 

494 

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

496 
Lifting/Transfer. 

497 
possible INCOMPATIBILITY. 

498 

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

500 
INCOMPATIBILITY. 

501 

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

502 

48206  503 
*** Document preparation *** 
504 

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

507 
Discontinued legacy styles "prem1" .. "prem19". 

508 

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

510 
instead of slightly exotic babel/greek. 

48206  511 

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

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

513 
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

514 
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

515 

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

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

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

518 

48206  519 

48992  520 
*** ML *** 
521 

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

524 
hardware and Poly/ML runtime system. 

525 

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

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

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

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

529 

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

532 
necessarily printing visible text. 

533 

534 

48206  535 
*** System *** 
536 

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

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

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

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

542 
document preparation as well. INCOMPATIBILITY, isabelle usedir / 

48736  543 
mkdir / make are rendered obsolete. 
544 

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

547 

548 
isabelle build s b HOL 

549 

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

551 

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

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

553 
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

554 
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

555 
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

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

557 

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

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

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

560 

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

563 

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

565 
INCOMPATIBILITY. 

566 

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

569 
version of Isabelle. 

570 

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

573 

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

575 
picked up from some surrounding directory. Potential INCOMPATIBILITY 

576 
for homemade settings. 

50132  577 

50701  578 
* Improved ML runtime statistics (heap, threads, future tasks etc.). 
579 

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

582 
configuration. 

583 

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

586 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

588 
bundled as Isabelle component. 

48206  589 

50182  590 

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

591 

47462  592 
New in Isabelle2012 (May 2012) 
593 
 

45109  594 

45593  595 
*** General *** 
596 

45614  597 
* Prover IDE (PIDE) improvements: 
598 

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

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

45614  606 

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

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

46485  610 

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

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

612 
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

613 
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

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

615 
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

616 

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

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

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

619 
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

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

621 

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

622 
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

623 

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

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

625 

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

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

627 

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

628 
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

629 
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

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

631 

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

632 
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

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

634 

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

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

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

47484  640 

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

643 
oldstyle "standard" after instantiation or composition of facts 

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

645 
indices of schematic variables. 

646 

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

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

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

650 
the historic accident of dynamic reevaluation in interpretations 

651 
etc. was exploited. 

652 

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

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

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

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

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

658 
of the material of that old tutorial. 

659 

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

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

662 
manual. 

663 

664 

665 
*** Pure *** 

666 

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

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

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

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

670 

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

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

674 
undocumented feature.) 

675 

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

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

679 

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

681 

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

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

684 

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

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

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

688 
order to accommodate newly introduced premises.) 

689 

47806  690 
* Renamed some inner syntax categories: 
691 

692 
num ~> num_token 

693 
xnum ~> xnum_token 

694 
xstr ~> str_token 

695 

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

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

698 
position information via constraints). 

699 

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

702 
manual. Minor INCOMPATIBILITY. 

703 

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

45134  706 

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

709 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  710 

47464  711 
* Redundant attribute "code_inline" has been discontinued. Use 
712 
"code_unfold" instead. INCOMPATIBILITY. 

713 

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

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

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

716 

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

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

718 

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

719 
INCOMPATIBILITY. 
45383  720 

47856  721 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
722 
instead. INCOMPATIBILITY. 

723 

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

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

726 
legacy since Isabelle2011). 

47855  727 

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

728 

45122  729 
*** HOL *** 
730 

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

733 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

738 
tinkering with former theorems mem_def and Collect_def as far as 

739 
possible. 

740 

741 
For developments which deliberately mix predicates and sets, a 

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

744 
Isabelle20111 before jumping right into the current release. 

745 

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

748 

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

750 

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

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

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

756 
user theories may require adaptations as follows: 

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

757 

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

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

759 
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

760 

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

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

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

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

764 

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

765 
 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

766 
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

767 

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

768 
 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

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

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

771 

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

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

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

774 

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

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

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

779 
corresponding parts of the Quotient package.) 

47809  780 

781 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

783 
relate different type instances of the same polymorphic constant, 

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

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

786 

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

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

789 

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

791 
equivalent subgoal on the corresponding raw types. Constants are 

792 
replaced with corresponding ones according to the transfer rules. 

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

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

798 

799 
 relator_eq attribute: Collects identity laws for relators of 

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

801 
transfer method uses these lemmas to infer transfer rules for 

802 
nonpolymorphic constants on the fly. 

803 

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

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

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

807 
after unfolding the constant definitions. 

808 

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

810 
from type nat to type int. 

811 

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

47809  814 

815 
 lift_definition command: Defines operations on an abstract type in 

816 
terms of a corresponding operation on a representation 

817 
type. Example syntax: 

818 

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

820 
is List.insert 

821 

822 
Users must discharge a respectfulness proof obligation when each 

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

824 
the proof is discharged automatically.) The obligation is 

825 
presented in a userfriendly, readable form; a respectfulness 

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

827 
by the package. 

828 

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

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

831 
lift_definition generates a code certificate theorem and sets up 

832 
code generation for each constant. 

833 

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

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

836 
or a type_definition theorem. The package configures transfer 

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

838 
lift_definition command to work with the type. 

839 

840 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  841 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
842 
Word/Word.thy and Library/Float.thy. 

47809  843 

844 
* Quotient package: 

845 

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

847 
rep and abs functions, similar to typedef. 

848 

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

850 
Transfer packages, as with 'setup_lifting'. 

851 

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

853 
respectfulness property at the point where the constant is 

854 
defined, similar to lift_definition; INCOMPATIBILITY. 

855 

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

857 
accordingly, INCOMPATIBILITY. 

858 

859 
* New diagnostic command 'find_unused_assms' to find potentially 

860 
superfluous assumptions in theorems using Quickcheck. 

861 

862 
* Quickcheck: 

863 

864 
 Quickcheck returns variable assignments as counterexamples, which 

865 
allows to reveal the underspecification of functions under test. 

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

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

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

869 

870 
These counterexample are marked as potentially spurious, as 

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

872 
obvious theorem "hd xs = hd xs". 

873 

874 
After finding a potentially spurious counterexample, Quickcheck 

875 
continues searching for genuine ones. 

876 

877 
By default, Quickcheck shows potentially spurious and genuine 

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

879 
show genuine counterexamples. 

880 

881 
 The command 'quickcheck_generator' creates random and exhaustive 

882 
value generators for a given type and operations. 

883 

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

885 
constructors of that type. 

886 

887 
 Support for multisets. 

888 

889 
 Added "use_subtype" options. 

890 

891 
 Added "quickcheck_locale" configuration to specify how to process 

892 
conjectures in a locale context. 

893 

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

47809  896 

897 
* Sledgehammer: 

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

899 
paper "More SPASS with Isabelle". 

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

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

902 
TFF1), iProver, iProverEq. 

903 
 Sped up the minimizer. 

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

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

906 
 Renamed "sound" option to "strict". 

907 

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

910 

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

912 

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

47809  914 

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

917 

918 
list.exhaust [case_product nat.exhaust] 

919 

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

921 
a list and a nat. 

922 

47809  923 
* New "eventually_elim" method as a generalized variant of the 
47855  924 
eventually_elim* rules. Supports structured proofs. 
925 

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

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

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

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

929 

47856  930 
* Record: code generation can be switched off manually with 
931 

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

933 

934 
* Datatype: type parameters allow explicit sort constraints. 

935 

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

938 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

940 
one_case. 

941 

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

943 
the result of the fact expression. 

944 

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

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

948 

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

949 
converse_def ~> converse_unfold 
47549  950 
rel_comp_def ~> relcomp_unfold 
47820  951 
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

952 
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

953 
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

954 
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

955 

46981  956 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
957 

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

47086  960 

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

961 
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

962 

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

46458  966 
rel_pow_1 ~> relpow_1 
46363  967 
rel_pow_0_I ~> relpow_0_I 
968 
rel_pow_Suc_I ~> relpow_Suc_I 

969 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

970 
rel_pow_0_E ~> relpow_0_E 

971 
rel_pow_Suc_E ~> relpow_Suc_E 

972 
rel_pow_E ~> relpow_E 

46458  973 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  974 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  975 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
976 
rel_pow_E2 ~> relpow_E2 

977 
rel_pow_add ~> relpow_add 

978 
rel_pow_commute ~> relpow 

979 
rel_pow_empty ~> relpow_empty: 

980 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

981 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

982 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

983 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

984 
rel_pow_fun_conv ~> relpow_fun_conv 

985 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

986 
rel_pow_finite_bounded ~> relpow_finite_bounded 

987 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

988 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

989 
single_valued_rel_pow ~> single_valued_relpow 

47463  990 

46363  991 
INCOMPATIBILITY. 
992 

47448  993 
* Theory Relation: Consolidated constant name for relation composition 
47464  994 
and corresponding theorem names: 
995 

47549  996 
 Renamed constant rel_comp to relcomp. 
47464  997 

47448  998 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  999 

47448  1000 
 Renamed theorems: 
47464  1001 

47448  1002 
rel_compI ~> relcompI 
1003 
rel_compEpair ~> relcompEpair 

1004 
rel_compE ~> relcompE 

1005 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

1006 
rel_comp_empty1 ~> relcomp_empty1 

1007 
rel_comp_mono ~> relcomp_mono 

1008 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

1009 
rel_comp_distrib ~> relcomp_distrib 

1010 
rel_comp_distrib2 ~> relcomp_distrib2 

1011 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

1012 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

1013 
single_valued_rel_comp ~> single_valued_relcomp 

47549  1014 
rel_comp_def ~> relcomp_unfold 
47448  1015 
converse_rel_comp ~> converse_relcomp 
1016 
pred_compI ~> relcomppI 

1017 
pred_compE ~> relcomppE 

1018 
pred_comp_bot1 ~> relcompp_bot1 

1019 
pred_comp_bot2 ~> relcompp_bot2 

1020 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

1021 
pred_comp_mono ~> relcompp_mono 

1022 
pred_comp_distrib ~> relcompp_distrib 

1023 
pred_comp_distrib2 ~> relcompp_distrib2 

1024 
converse_pred_comp ~> converse_relcompp 

47464  1025 

47448  1026 
finite_rel_comp ~> finite_relcomp 
47464  1027 

47448  1028 
set_rel_comp ~> set_relcomp 
1029 

1030 
INCOMPATIBILITY. 

1031 

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

1034 

1035 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

1036 
zdiv_self ~> div_self 

1037 
zmod_self ~> mod_self 

1038 
zdiv_zero ~> div_0 

1039 
zmod_zero ~> mod_0 

1040 
zdiv_zmod_equality ~> div_mod_equality2 

1041 
zdiv_zmod_equality2 ~> div_mod_equality 

1042 
zmod_zdiv_trivial ~> mod_div_trivial 

1043 
zdiv_zminus_zminus ~> div_minus_minus 

1044 
zmod_zminus_zminus ~> mod_minus_minus 

1045 
zdiv_zminus2 ~> div_minus_right 

1046 
zmod_zminus2 ~> mod_minus_right 

1047 
zdiv_minus1_right ~> div_minus1_right 

1048 
zmod_minus1_right ~> mod_minus1_right 

1049 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

1050 
zmod_zmult1_eq ~> mod_mult_right_eq 

1051 
zpower_zmod ~> power_mod 

1052 
zdvd_zmod ~> dvd_mod 

1053 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

1054 
mod_mult_distrib ~> mult_mod_left 

1055 
mod_mult_distrib2 ~> mult_mod_right 

1056 

1057 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

1058 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

1059 

47551  1060 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
1061 

47552  1062 
* Consolidated theorem names concerning fold combinators: 
47550  1063 

1064 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

1065 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

1066 
INFI_fold_inf ~> INF_fold_inf 

1067 
SUPR_fold_sup ~> SUP_fold_sup 

1068 
union_set ~> union_set_fold 

1069 
minus_set ~> minus_set_fold 

1070 
INFI_set_fold ~> INF_set_fold 

1071 
SUPR_set_fold ~> SUP_set_fold 

1072 
INF_code ~> INF_set_foldr 

1073 
SUP_code ~> SUP_set_foldr 

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

1075 
foldr_fold_rev ~> foldr_conv_fold 

1076 
foldl_fold ~> foldl_conv_fold 

1077 
foldr_foldr ~> foldr_conv_foldl 

1078 
foldl_foldr ~> foldl_conv_foldr 

47552  1079 
fold_set_remdups ~> fold_set_fold_remdups 
1080 
fold_set ~> fold_set_fold 

1081 
fold1_set ~> fold1_set_fold 

47550  1082 

1083 
INCOMPATIBILITY. 

1084 

1085 
* Dropped rarely useful theorems concerning fold combinators: 

1086 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

1087 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

1088 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

1089 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

1090 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

1091 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

1095 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

1096 

1097 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

1098 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

1099 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

1100 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

1102 
fold_conv_foldr and fold_rev. 

1103 

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

1105 
through option types. 

1106 

47856  1107 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
1108 
relations. 

1109 

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

1111 

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

1113 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

1114 

1115 
zminus_zminus ~> minus_minus 

1116 
zminus_0 ~> minus_zero 

1117 
zminus_zadd_distrib ~> minus_add_distrib 

1118 
zadd_commute ~> add_commute 

1119 
zadd_assoc ~> add_assoc 

1120 
zadd_left_commute ~> add_left_commute 

1121 
zadd_ac ~> add_ac 

1122 
zmult_ac ~> mult_ac 

1123 
zadd_0 ~> add_0_left 

1124 
zadd_0_right ~> add_0_right 

1125 
zadd_zminus_inverse2 ~> left_minus 

1126 
zmult_zminus ~> mult_minus_left 

1127 
zmult_commute ~> mult_commute 

1128 
zmult_assoc ~> mult_assoc 

1129 
zadd_zmult_distrib ~> left_distrib 

1130 
zadd_zmult_distrib2 ~> right_distrib 

1131 
zdiff_zmult_distrib ~> left_diff_distrib 

1132 
zdiff_zmult_distrib2 ~> right_diff_distrib 

1133 
zmult_1 ~> mult_1_left 

1134 
zmult_1_right ~> mult_1_right 

1135 
zle_refl ~> order_refl 

1136 
zle_trans ~> order_trans 

1137 
zle_antisym ~> order_antisym 

1138 
zle_linear ~> linorder_linear 

1139 
zless_linear ~> linorder_less_linear 

1140 
zadd_left_mono ~> add_left_mono 

1141 
zadd_strict_right_mono ~> add_strict_right_mono 

1142 
zadd_zless_mono ~> add_less_le_mono 

1143 
int_0_less_1 ~> zero_less_one 

1144 
int_0_neq_1 ~> zero_neq_one 

1145 
zless_le ~> less_le 

1146 
zpower_zadd_distrib ~> power_add 

1147 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

1148 
zero_le_zpower_abs ~> zero_le_power_abs 

1149 

1150 
* Theory Deriv: Renamed 

1151 

1152 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

1153 

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

1155 

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

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

1160 
INCOMPATIBILITY. 

1161 

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

1164 

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

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

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

1169 
follows: 

47452  1170 

1171 
Operations: 

1172 
bulkload > rbt_bulkload 

1173 
del_from_left > rbt_del_from_left 

1174 
del_from_right > rbt_del_from_right 

1175 
del > rbt_del 

1176 
delete > rbt_delete 

1177 
ins > rbt_ins 

1178 
insert > rbt_insert 

1179 
insertw > rbt_insert_with 

1180 
insert_with_key > rbt_insert_with_key 

1181 
map_entry > rbt_map_entry 

1182 
lookup > rbt_lookup 

1183 
sorted > rbt_sorted 

1184 
tree_greater > rbt_greater 

1185 
tree_less > rbt_less 

1186 
tree_less_symbol > rbt_less_symbol 

1187 
union > rbt_union 

1188 
union_with > rbt_union_with 

1189 
union_with_key > rbt_union_with_key 

1190 

1191 
Lemmas: 

1192 
balance_left_sorted > balance_left_rbt_sorted 

1193 
balance_left_tree_greater > balance_left_rbt_greater 

1194 
balance_left_tree_less > balance_left_rbt_less 

1195 
balance_right_sorted > balance_right_rbt_sorted 

1196 
balance_right_tree_greater > balance_right_rbt_greater 

1197 
balance_right_tree_less > balance_right_rbt_less 

1198 
balance_sorted > balance_rbt_sorted 

1199 
balance_tree_greater > balance_rbt_greater 

1200 
balance_tree_less > balance_rbt_less 

1201 
bulkload_is_rbt > rbt_bulkload_is_rbt 

1202 
combine_sorted > combine_rbt_sorted 

1203 
combine_tree_greater > combine_rbt_greater 

1204 
combine_tree_less > combine_rbt_less 

1205 
delete_in_tree > rbt_delete_in_tree 

1206 
delete_is_rbt > rbt_delete_is_rbt 

1207 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

1208 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

1209 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

1210 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

1211 
del_in_tree > rbt_del_in_tree 

1212 
del_inv1_inv2 > rbt_del_inv1_inv2 

1213 
del_sorted > rbt_del_rbt_sorted 

1214 
del_tree_greater > rbt_del_rbt_greater 

1215 
del_tree_less > rbt_del_rbt_less 

1216 
dom_lookup_Branch > dom_rbt_lookup_Branch 

1217 
entries_lookup > entries_rbt_lookup 

1218 
finite_dom_lookup > finite_dom_rbt_lookup 

1219 
insert_sorted > rbt_insert_rbt_sorted 

1220 
insertw_is_rbt > rbt_insertw_is_rbt 

1221 
insertwk_is_rbt > rbt_insertwk_is_rbt 

1222 
insertwk_sorted > rbt_insertwk_rbt_sorted 

1223 
insertw_sorted > rbt_insertw_rbt_sorted 

1224 
ins_sorted > ins_rbt_sorted 

1225 
ins_tree_greater > ins_rbt_greater 

1226 
ins_tree_less > ins_rbt_less 

1227 
is_rbt_sorted > is_rbt_rbt_sorted 

1228 
lookup_balance > rbt_lookup_balance 

1229 
lookup_bulkload > rbt_lookup_rbt_bulkload 

1230 
lookup_delete > rbt_lookup_rbt_delete 

1231 
lookup_Empty > rbt_lookup_Empty 

1232 
lookup_from_in_tree > rbt_lookup_from_in_tree 

1233 
lookup_in_tree > rbt_lookup_in_tree 

1234 
lookup_ins > rbt_lookup_ins 

1235 
lookup_insert > rbt_lookup_rbt_insert 

1236 
lookup_insertw > rbt_lookup_rbt_insertw 

1237 
lookup_insertwk > rbt_lookup_rbt_insertwk 

1238 
lookup_keys > rbt_lookup_keys 

1239 
lookup_map > rbt_lookup_map 

1240 
lookup_map_entry > rbt_lookup_rbt_map_entry 

1241 
lookup_tree_greater > rbt_lookup_rbt_greater 

1242 
lookup_tree_less > rbt_lookup_rbt_less 

1243 
lookup_union > rbt_lookup_rbt_union 

1244 
map_entry_color_of > rbt_map_entry_color_of 

1245 
map_entry_inv1 > rbt_map_entry_inv1 

1246 
map_entry_inv2 > rbt_map_entry_inv2 

1247 
map_entry_is_rbt > rbt_map_entry_is_rbt 

1248 
map_entry_sorted > rbt_map_entry_rbt_sorted 

1249 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

1250 
map_entry_tree_less > rbt_map_entry_rbt_less 

1251 
map_tree_greater > map_rbt_greater 

1252 
map_tree_less > map_rbt_less 

1253 
map_sorted > map_rbt_sorted 

1254 
paint_sorted > paint_rbt_sorted 

1255 
paint_lookup > paint_rbt_lookup 

1256 
paint_tree_greater > paint_rbt_greater 

1257 
paint_tree_less > paint_rbt_less 

1258 
sorted_entries > rbt_sorted_entries 

1259 
tree_greater_eq_trans > rbt_greater_eq_trans 

1260 
tree_greater_nit > rbt_greater_nit 

1261 
tree_greater_prop > rbt_greater_prop 

1262 
tree_greater_simps > rbt_greater_simps 

1263 
tree_greater_trans > rbt_greater_trans 

1264 
tree_less_eq_trans > rbt_less_eq_trans 

1265 
tree_less_nit > rbt_less_nit 

1266 
tree_less_prop > rbt_less_prop 

1267 
tree_less_simps > rbt_less_simps 

1268 
tree_less_trans > rbt_less_trans 

1269 
tree_ord_props > rbt_ord_props 

1270 
union_Branch > rbt_union_Branch 

1271 
union_is_rbt > rbt_union_is_rbt 

1272 
unionw_is_rbt > rbt_unionw_is_rbt 

1273 
unionwk_is_rbt > rbt_unionwk_is_rbt 

1274 
unionwk_sorted > rbt_unionwk_rbt_sorted 

1275 

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

1278 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  1279 

1280 
Changed Operations: 

47622  1281 
float_abs > abs 
1282 
float_nprt > nprt 

1283 
float_pprt > pprt 

1284 
pow2 > use powr 

1285 
round_down > float_round_down 

1286 
round_up > float_round_up 

1287 
scale > exponent 

1288 

1289 
Removed Operations: 

1290 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

1291 

1292 
Renamed Lemmas: 

1293 
abs_float_def > Float.compute_float_abs 

1294 
bitlen_ge0 > bitlen_nonneg 

1295 
bitlen.simps > Float.compute_bitlen 

1296 
float_components > Float_mantissa_exponent 

1297 
float_divl.simps > Float.compute_float_divl 

1298 
float_divr.simps > Float.compute_float_divr 

1299 
float_eq_odd > mult_powr_eq_mult_powr_iff 

1300 
float_power > real_of_float_power 

1301 
lapprox_posrat_def > Float.compute_lapprox_posrat 

1302 
lapprox_rat.simps > Float.compute_lapprox_rat 

1303 
le_float_def' > Float.compute_float_le 

1304 
le_float_def > less_eq_float.rep_eq 

1305 
less_float_def' > Float.compute_float_less 

1306 
less_float_def > less_float.rep_eq 

1307 
normfloat_def > Float.compute_normfloat 

1308 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

1309 
normfloat > normfloat_def 

1310 
normfloat_unique > use normfloat_def 

1311 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

1312 
one_float_def > Float.compute_float_one 

1313 
plus_float_def > Float.compute_float_plus 

1314 
rapprox_posrat_def > Float.compute_rapprox_posrat 

1315 
rapprox_rat.simps > Float.compute_rapprox_rat 

1316 
real_of_float_0 > zero_float.rep_eq 

1317 
real_of_float_1 > one_float.rep_eq 

1318 
real_of_float_abs > abs_float.rep_eq 

1319 
real_of_float_add > plus_float.rep_eq 

1320 
real_of_float_minus > uminus_float.rep_eq 

1321 
real_of_float_mult > times_float.rep_eq 

1322 
real_of_float_simp > Float.rep_eq 

1323 
real_of_float_sub > minus_float.rep_eq 

1324 
round_down.simps > Float.compute_float_round_down 

1325 
round_up.simps > Float.compute_float_round_up 

1326 
times_float_def > Float.compute_float_times 

1327 
uminus_float_def > Float.compute_float_uminus 

1328 
zero_float_def > Float.compute_float_zero 

1329 

1330 
Lemmas not necessary anymore, use the transfer method: 

1331 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

1332 
float_divr, float_le_simp, float_less1_mantissa_bound, 

1333 
float_less_simp, float_less_zero, float_le_zero, 

1334 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

1335 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

1336 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

1337 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

1338 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

1339 
round_up, zero_le_float, zero_less_float 

47616  1340 

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

45791  1343 

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

1346 

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

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

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

1351 

1352 
* Session HOLWord: Discontinued many redundant theorems specific to 

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

1354 
instead. 

1355 

1356 
word_sub_alt ~> word_sub_wi 

1357 
word_add_alt ~> word_add_def 

1358 
word_mult_alt ~> word_mult_def 

1359 
word_minus_alt ~> word_minus_def 

1360 
word_0_alt ~> word_0_wi 

1361 
word_1_alt ~> word_1_wi 

1362 
word_add_0 ~> add_0_left 

1363 
word_add_0_right ~> add_0_right 

1364 
word_mult_1 ~> mult_1_left 

1365 
word_mult_1_right ~> mult_1_right 

1366 
word_add_commute ~> add_commute 

1367 
word_add_assoc ~> add_assoc 

1368 
word_add_left_commute ~> add_left_commute 

1369 
word_mult_commute ~> mult_commute 

1370 
word_mult_assoc ~> mult_assoc 

1371 
word_mult_left_commute ~> mult_left_commute 

1372 
word_left_distrib ~> left_distrib 

1373 
word_right_distrib ~> right_distrib 

1374 
word_left_minus ~> left_minus 

1375 
word_diff_0_right ~> diff_0_right 

1376 
word_diff_self ~> diff_self 

1377 
word_sub_def ~> diff_minus 

1378 
word_diff_minus ~> diff_minus 

1379 
word_add_ac ~> add_ac 

1380 
word_mult_ac ~> mult_ac 

1381 
word_plus_ac0 ~> add_0_left add_0_right add_ac 

1382 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 

1383 
word_order_trans ~> order_trans 

1384 
word_order_refl ~> order_refl 

1385 
word_order_antisym ~> order_antisym 

1386 
word_order_linear ~> linorder_linear 

1387 
lenw1_zero_neq_one ~> zero_neq_one 

1388 
word_number_of_eq ~> number_of_eq 

1389 
word_of_int_add_hom ~> wi_hom_add 

1390 
word_of_int_sub_hom ~> wi_hom_sub 

1391 
word_of_int_mult_hom ~> wi_hom_mult 

1392 
word_of_int_minus_hom ~> wi_hom_neg 

1393 
word_of_int_succ_hom ~> wi_hom_succ 

1394 
word_of_int_pred_hom ~> wi_hom_pred 

1395 
word_of_int_0_hom ~> word_0_wi 

1396 
word_of_int_1_hom ~> word_1_wi 

1397 

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

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

1401 
multiplication, shifting by constants, bitwise operators and numeric 

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

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

1406 

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

1409 
measure_space. The locales based on subset_class now have two 

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

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

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

1415 
Measure space constructions for distributions and densities now got 

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

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

1418 
and point_measure is introduced. INCOMPATIBILITY. 

47694  1419 

1420 
Renamed constants: 

1421 
measure > emeasure 

1422 
finite_measure.\<mu>' > measure 

1423 
product_algebra_generator > prod_algebra 

1424 
product_prob_space.emb > prod_emb 

1425 
product_prob_space.infprod_algebra > PiM 

1426 

1427 
Removed locales: 

1428 
completeable_measure_space 

1429 
finite_measure_space 

1430 
finite_prob_space 

1431 
finite_product_finite_prob_space 

1432 
finite_product_sigma_algebra 

1433 
finite_sigma_algebra 

1434 
measure_space 

1435 
pair_finite_prob_space 

1436 
pair_finite_sigma_algebra 

1437 
pair_finite_space 
