author  haftmann 
Sat, 23 Mar 2013 17:11:06 +0100  
changeset 51487  f4bfdee99304 
parent 51417  d266f9329368 
child 51489  f738e6dbd844 
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 

51487  36 
* Locale hierarchy for abstract orderings and (semi)lattices. 
37 

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

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

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

40 

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

43 

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

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

45 
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

46 
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

47 
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

48 
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

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

50 

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

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

52 
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

53 
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

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

55 

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

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

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

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

59 

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

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

61 

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

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

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

64 

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

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

66 

51137  67 
* Sledgehammer: 
68 

69 
 Renamed option: 

70 
isar_shrink ~> isar_compress 

71 

50994  72 

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

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

74 

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

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

76 
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

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

78 

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

79 

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

80 

50993  81 
New in Isabelle2013 (February 2013) 
82 
 

47887  83 

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

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

85 

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

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

87 
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

88 
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

89 
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

90 
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

91 
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

92 
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

93 

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

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

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

98 

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

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

100 
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

101 

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

104 
Tools that load their additional source files may imitate the 

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

106 
dependencies properly. 

107 

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

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

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

110 

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

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

113 

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

49841  116 
and "class ... context ...". 
117 

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

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

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

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

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

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

124 

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

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

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

127 

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

130 

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

131 

49968  132 
*** Prover IDE  Isabelle/Scala/jEdit *** 
133 

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

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

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

137 
surface, while the prover is still crunching on internal 

138 
justifications. Unfinished / cancelled proofs are restarted as 

139 
required to complete full proof checking eventually. 

140 

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

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

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

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

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

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

147 

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

150 
browser on demand. 

151 

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

154 
comment delimiters works more conveniently with unfinished situations 

155 
that frequently occur in user interaction. 

156 

157 
* More efficient painting and improved reactivity when editing large 

158 
files. More scalable management of formal document content. 

159 

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

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

161 
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

162 
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

163 
potentially infinite message streams. 
49968  164 

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

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

167 
options, including tuning parameters for editor reactivity and color 

168 
schemes. 

169 

50184  170 
* Dockable window "Symbols" provides some editing support for Isabelle 
171 
symbols. 

172 

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

50701  175 

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

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

179 

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

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

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

50183  184 

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

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

188 

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

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

190 
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

191 
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

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

193 

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

196 
now bundled exclusively with Isabelle. 

197 

198 

48205  199 
*** Pure *** 
200 

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

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

202 
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

203 

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

206 
rather arbitrary current working directory. INCOMPATIBILITY. 

48371  207 

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

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

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

212 
with some care where this is really required. 

213 

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

51063  216 
given sort. Example (in HOL): 
48792  217 

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

219 

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

222 

48205  223 

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

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

225 

50646  226 
* Sledgehammer: 
227 

228 
 Added MaSh relevance filter based on machinelearning; see the 

229 
Sledgehammer manual for details. 

230 
 Polished Isar proofs generated with "isar_proofs" option. 

231 
 Rationalized type encodings ("type_enc" option). 

50720  232 
 Renamed "kill_provers" subcommand to "kill_all". 
50646  233 
 Renamed options: 
234 
isar_proof ~> isar_proofs 

235 
isar_shrink_factor ~> isar_shrink 

236 
max_relevant ~> max_facts 

237 
relevance_thresholds ~> fact_thresholds 

238 

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

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

241 
configuration quickcheck_optimise_equality to false. 

242 

50878  243 
* Quotient: only one quotient can be defined by quotient_type 
244 
INCOMPATIBILITY. 

245 

246 
* Lifting: 

247 
 generation of an abstraction function equation in lift_definition 

248 
 quot_del attribute 

249 
 renamed no_abs_code > no_code (INCOMPATIBILITY.) 

250 

50646  251 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
252 
expressions. 

253 

254 
* Preprocessing of the code generator rewrites set comprehensions into 

255 
pointfree expressions. 

256 

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

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

259 
arithmetic, datatypes/records) with potential proof reconstruction 

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

261 
INCOMPATIBILITY. 

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

262 

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

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

264 
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

265 
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

266 
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

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

268 

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

271 

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

273 
List. INCOMPATIBILITY. 

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

274 

49739  275 
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. 
276 

49738  277 
* Class "comm_monoid_diff" formalises properties of bounded 
49388  278 
subtraction, with natural numbers and multisets as typical instances. 
279 

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

282 
* Theory "Transitive_Closure": renamed lemmas 

283 

284 
reflcl_tranclp > reflclp_tranclp 

285 
rtranclp_reflcl > rtranclp_reflclp 

286 

287 
INCOMPATIBILITY. 

288 

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

290 

291 
left_distrib ~> distrib_right 

292 
right_distrib ~> distrib_left 

293 

294 
INCOMPATIBILITY. 

295 

296 
* Generalized the definition of limits: 

297 

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

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

300 
output f x converges to G. 

301 

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

303 
infinity (at_bot). 

304 

305 
 Moved infinity in the norm (at_infinity) from 

306 
Multivariate_Analysis to Complex_Main. 

307 

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

309 
at_top". 

310 

311 
INCOMPATIBILITY. 

312 

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

314 
lattice type classes. 

315 

316 
* Theory "Library/Multiset": renamed 

317 

318 
constant fold_mset ~> Multiset.fold 

319 
fact fold_mset_commute ~> fold_mset_comm 

320 

321 
INCOMPATIBILITY. 

322 

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

324 
changes as follows. 

325 

326 
 Renamed constants (and related lemmas) 

49145  327 

328 
prefix ~> prefixeq 

329 
strict_prefix ~> prefix 

330 

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

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

334 
Renamed lemmas accordingly. 

335 

336 
 Added constant "list_hembeq" for homeomorphic embedding on 

337 
lists. Added abbreviation "sublisteq" for special case 

338 
"list_hembeq (op =)". 

339 

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

341 
class instances for the prefix order (merely corresponding locale 

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

343 
Library/Prefix_Order. 

344 

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

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

50516  347 

348 
le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff 

349 
le_list_append_mono ~> Sublist.list_hembeq_append_mono 

350 
le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2 

351 
le_list_Cons_EX ~> Sublist.list_hembeq_ConsD 

352 
le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2' 

353 
le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq 

354 
le_list_drop_Cons ~> Sublist.sublisteq_Cons' 

355 
le_list_drop_many ~> Sublist.sublisteq_drop_many 

356 
le_list_filter_left ~> Sublist.sublisteq_filter_left 

357 
le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many 

358 
le_list_rev_take_iff ~> Sublist.sublisteq_append 

359 
le_list_same_length ~> Sublist.sublisteq_same_length 

360 
le_list_take_many_iff ~> Sublist.sublisteq_append' 

49145  361 
less_eq_list.drop ~> less_eq_list_drop 
362 
less_eq_list.induct ~> less_eq_list_induct 

50516  363 
not_le_list_length ~> Sublist.not_sublisteq_length 
49145  364 

50646  365 
INCOMPATIBILITY. 
366 

367 
* New theory Library/Countable_Set. 

368 

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

370 
parallel execution for code generated towards Isabelle/ML. 

371 

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

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

374 
extensional_funcset by an abbreviation, and renamed lemmas from 

375 
extensional_funcset to PiE as follows: 

376 

377 
extensional_empty ~> PiE_empty 

378 
extensional_funcset_empty_domain ~> PiE_empty_domain 

379 
extensional_funcset_empty_range ~> PiE_empty_range 

380 
extensional_funcset_arb ~> PiE_arb 

381 
extensional_funcset_mem ~> PiE_mem 

382 
extensional_funcset_extend_domainI ~> PiE_fun_upd 

383 
extensional_funcset_restrict_domain ~> fun_upd_in_PiE 

384 
extensional_funcset_extend_domain_eq ~> PiE_insert_eq 

385 
card_extensional_funcset ~> card_PiE 

386 
finite_extensional_funcset ~> finite_PiE 

387 

388 
INCOMPATIBILITY. 

389 

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

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

392 
Data"). 

393 

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

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

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

397 
code. 

398 

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

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

401 
return a structurally different tree than before. Potential 

402 
INCOMPATIBILITY. 

403 

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

405 

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

407 

408 
* HOL/Multivariate_Analysis: replaced 

409 

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

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

412 

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

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

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

416 

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

418 

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

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

421 
cart_base i removed 

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

423 

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

424 
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

425 

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

426 
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

427 

50646  428 
component_le_norm ~> Basis_le_norm 
429 
euclidean_eq ~> euclidean_eq_iff 

430 
differential_zero_maxmin_component ~> differential_zero_maxmin_cart 

431 
euclidean_simps ~> inner_simps 

432 
independent_basis ~> independent_Basis 

433 
span_basis ~> span_Basis 

434 
in_span_basis ~> in_span_Basis 

435 
norm_bound_component_le ~> norm_boound_Basis_le 

436 
norm_bound_component_lt ~> norm_boound_Basis_lt 

437 
component_le_infnorm ~> Basis_le_infnorm 

438 

439 
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

440 

50141  441 
* HOL/Probability: 
50646  442 

443 
 Added simproc "measurable" to automatically prove measurability. 

444 

445 
 Added induction rules for sigma sets with disjoint union 

446 
(sigma_sets_induct_disjoint) and for Borelmeasurable functions 

447 
(borel_measurable_induct). 

448 

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

450 
projective family). 

451 

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

453 
AFP entry "Ordinals_and_Cardinals"). 

454 

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

456 
with support for mixed, nested recursion and interesting nonfree 

457 
datatypes. 

48094  458 

50991  459 
* HOL/Finite_Set and Relation: added new set and relation operations 
50878  460 
expressed by Finite_Set.fold. 
461 

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

463 
trees for the code generator. 

464 

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

466 
Lifting/Transfer. 

467 
possible INCOMPATIBILITY. 

468 

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

470 
INCOMPATIBILITY. 

471 

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

472 

48206  473 
*** Document preparation *** 
474 

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

477 
Discontinued legacy styles "prem1" .. "prem19". 

478 

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

480 
instead of slightly exotic babel/greek. 

48206  481 

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

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

483 
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

484 
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

485 

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

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

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

488 

48206  489 

48992  490 
*** ML *** 
491 

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

494 
hardware and Poly/ML runtime system. 

495 

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

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

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

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

499 

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

502 
necessarily printing visible text. 

503 

504 

48206  505 
*** System *** 
506 

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

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

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

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

512 
document preparation as well. INCOMPATIBILITY, isabelle usedir / 

48736  513 
mkdir / make are rendered obsolete. 
514 

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

517 

518 
isabelle build s b HOL 

519 

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

521 

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

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

523 
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

524 
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

525 
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

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

527 

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

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

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

530 

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

533 

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

535 
INCOMPATIBILITY. 

536 

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

539 
version of Isabelle. 

540 

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

543 

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

545 
picked up from some surrounding directory. Potential INCOMPATIBILITY 

546 
for homemade settings. 

50132  547 

50701  548 
* Improved ML runtime statistics (heap, threads, future tasks etc.). 
549 

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

552 
configuration. 

553 

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

556 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

558 
bundled as Isabelle component. 

48206  559 

50182  560 

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

561 

47462  562 
New in Isabelle2012 (May 2012) 
563 
 

45109  564 

45593  565 
*** General *** 
566 

45614  567 
* Prover IDE (PIDE) improvements: 
568 

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

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

45614  576 

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

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

46485  580 

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

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

582 
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

583 
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

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

585 
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

586 

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

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

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

589 
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

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

591 

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

592 
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

593 

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

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

595 

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

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

597 

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

598 
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

599 
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

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

601 

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

602 
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

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

604 

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

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

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

47484  610 

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

613 
oldstyle "standard" after instantiation or composition of facts 

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

615 
indices of schematic variables. 

616 

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

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

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

620 
the historic accident of dynamic reevaluation in interpretations 

621 
etc. was exploited. 

622 

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

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

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

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

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

628 
of the material of that old tutorial. 

629 

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

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

632 
manual. 

633 

634 

635 
*** Pure *** 

636 

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

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

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

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

640 

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

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

644 
undocumented feature.) 

645 

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

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

649 

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

651 

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

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

654 

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

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

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

658 
order to accommodate newly introduced premises.) 

659 

47806  660 
* Renamed some inner syntax categories: 
661 

662 
num ~> num_token 

663 
xnum ~> xnum_token 

664 
xstr ~> str_token 

665 

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

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

668 
position information via constraints). 

669 

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

672 
manual. Minor INCOMPATIBILITY. 

673 

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

45134  676 

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

679 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  680 

47464  681 
* Redundant attribute "code_inline" has been discontinued. Use 
682 
"code_unfold" instead. INCOMPATIBILITY. 

683 

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

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

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

686 

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

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

688 

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

689 
INCOMPATIBILITY. 
45383  690 

47856  691 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
692 
instead. INCOMPATIBILITY. 

693 

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

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

696 
legacy since Isabelle2011). 

47855  697 

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

698 

45122  699 
*** HOL *** 
700 

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

703 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

708 
tinkering with former theorems mem_def and Collect_def as far as 

709 
possible. 

710 

711 
For developments which deliberately mix predicates and sets, a 

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

714 
Isabelle20111 before jumping right into the current release. 

715 

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

718 

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

720 

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

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

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

726 
user theories may require adaptations as follows: 

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

727 

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

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

729 
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

730 

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

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

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

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

734 

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

735 
 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

736 
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

737 

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

738 
 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

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

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

741 

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

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

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

744 

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

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

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

749 
corresponding parts of the Quotient package.) 

47809  750 

751 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

753 
relate different type instances of the same polymorphic constant, 

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

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

756 

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

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

759 

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

761 
equivalent subgoal on the corresponding raw types. Constants are 

762 
replaced with corresponding ones according to the transfer rules. 

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

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

768 

769 
 relator_eq attribute: Collects identity laws for relators of 

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

771 
transfer method uses these lemmas to infer transfer rules for 

772 
nonpolymorphic constants on the fly. 

773 

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

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

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

777 
after unfolding the constant definitions. 

778 

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

780 
from type nat to type int. 

781 

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

47809  784 

785 
 lift_definition command: Defines operations on an abstract type in 

786 
terms of a corresponding operation on a representation 

787 
type. Example syntax: 

788 

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

790 
is List.insert 

791 

792 
Users must discharge a respectfulness proof obligation when each 

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

794 
the proof is discharged automatically.) The obligation is 

795 
presented in a userfriendly, readable form; a respectfulness 

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

797 
by the package. 

798 

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

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

801 
lift_definition generates a code certificate theorem and sets up 

802 
code generation for each constant. 

803 

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

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

806 
or a type_definition theorem. The package configures transfer 

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

808 
lift_definition command to work with the type. 

809 

810 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  811 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
812 
Word/Word.thy and Library/Float.thy. 

47809  813 

814 
* Quotient package: 

815 

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

817 
rep and abs functions, similar to typedef. 

818 

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

820 
Transfer packages, as with 'setup_lifting'. 

821 

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

823 
respectfulness property at the point where the constant is 

824 
defined, similar to lift_definition; INCOMPATIBILITY. 

825 

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

827 
accordingly, INCOMPATIBILITY. 

828 

829 
* New diagnostic command 'find_unused_assms' to find potentially 

830 
superfluous assumptions in theorems using Quickcheck. 

831 

832 
* Quickcheck: 

833 

834 
 Quickcheck returns variable assignments as counterexamples, which 

835 
allows to reveal the underspecification of functions under test. 

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

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

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

839 

840 
These counterexample are marked as potentially spurious, as 

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

842 
obvious theorem "hd xs = hd xs". 

843 

844 
After finding a potentially spurious counterexample, Quickcheck 

845 
continues searching for genuine ones. 

846 

847 
By default, Quickcheck shows potentially spurious and genuine 

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

849 
show genuine counterexamples. 

850 

851 
 The command 'quickcheck_generator' creates random and exhaustive 

852 
value generators for a given type and operations. 

853 

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

855 
constructors of that type. 

856 

857 
 Support for multisets. 

858 

859 
 Added "use_subtype" options. 

860 

861 
 Added "quickcheck_locale" configuration to specify how to process 

862 
conjectures in a locale context. 

863 

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

47809  866 

867 
* Sledgehammer: 

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

869 
paper "More SPASS with Isabelle". 

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

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

872 
TFF1), iProver, iProverEq. 

873 
 Sped up the minimizer. 

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

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

876 
 Renamed "sound" option to "strict". 

877 

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

880 

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

882 

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

47809  884 

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

887 

888 
list.exhaust [case_product nat.exhaust] 

889 

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

891 
a list and a nat. 

892 

47809  893 
* New "eventually_elim" method as a generalized variant of the 
47855  894 
eventually_elim* rules. Supports structured proofs. 
895 

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

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

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

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

899 

47856  900 
* Record: code generation can be switched off manually with 
901 

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

903 

904 
* Datatype: type parameters allow explicit sort constraints. 

905 

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

908 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

910 
one_case. 

911 

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

913 
the result of the fact expression. 

914 

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

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

918 

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

919 
converse_def ~> converse_unfold 
47549  920 
rel_comp_def ~> relcomp_unfold 
47820  921 
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

922 
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

923 
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

924 
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

925 

46981  926 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
927 

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

47086  930 

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

931 
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

932 

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

46458  936 
rel_pow_1 ~> relpow_1 
46363  937 
rel_pow_0_I ~> relpow_0_I 
938 
rel_pow_Suc_I ~> relpow_Suc_I 

939 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

940 
rel_pow_0_E ~> relpow_0_E 

941 
rel_pow_Suc_E ~> relpow_Suc_E 

942 
rel_pow_E ~> relpow_E 

46458  943 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  944 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  945 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
946 
rel_pow_E2 ~> relpow_E2 

947 
rel_pow_add ~> relpow_add 

948 
rel_pow_commute ~> relpow 

949 
rel_pow_empty ~> relpow_empty: 

950 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

951 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

952 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

953 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

954 
rel_pow_fun_conv ~> relpow_fun_conv 

955 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

956 
rel_pow_finite_bounded ~> relpow_finite_bounded 

957 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

958 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

959 
single_valued_rel_pow ~> single_valued_relpow 

47463  960 

46363  961 
INCOMPATIBILITY. 
962 

47448  963 
* Theory Relation: Consolidated constant name for relation composition 
47464  964 
and corresponding theorem names: 
965 

47549  966 
 Renamed constant rel_comp to relcomp. 
47464  967 

47448  968 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  969 

47448  970 
 Renamed theorems: 
47464  971 

47448  972 
rel_compI ~> relcompI 
973 
rel_compEpair ~> relcompEpair 

974 
rel_compE ~> relcompE 

975 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

976 
rel_comp_empty1 ~> relcomp_empty1 

977 
rel_comp_mono ~> relcomp_mono 

978 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

979 
rel_comp_distrib ~> relcomp_distrib 

980 
rel_comp_distrib2 ~> relcomp_distrib2 

981 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

982 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

983 
single_valued_rel_comp ~> single_valued_relcomp 

47549  984 
rel_comp_def ~> relcomp_unfold 
47448  985 
converse_rel_comp ~> converse_relcomp 
986 
pred_compI ~> relcomppI 

987 
pred_compE ~> relcomppE 

988 
pred_comp_bot1 ~> relcompp_bot1 

989 
pred_comp_bot2 ~> relcompp_bot2 

990 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

991 
pred_comp_mono ~> relcompp_mono 

992 
pred_comp_distrib ~> relcompp_distrib 

993 
pred_comp_distrib2 ~> relcompp_distrib2 

994 
converse_pred_comp ~> converse_relcompp 

47464  995 

47448  996 
finite_rel_comp ~> finite_relcomp 
47464  997 

47448  998 
set_rel_comp ~> set_relcomp 
999 

1000 
INCOMPATIBILITY. 

1001 

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

1004 

1005 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

1006 
zdiv_self ~> div_self 

1007 
zmod_self ~> mod_self 

1008 
zdiv_zero ~> div_0 

1009 
zmod_zero ~> mod_0 

1010 
zdiv_zmod_equality ~> div_mod_equality2 

1011 
zdiv_zmod_equality2 ~> div_mod_equality 

1012 
zmod_zdiv_trivial ~> mod_div_trivial 

1013 
zdiv_zminus_zminus ~> div_minus_minus 

1014 
zmod_zminus_zminus ~> mod_minus_minus 

1015 
zdiv_zminus2 ~> div_minus_right 

1016 
zmod_zminus2 ~> mod_minus_right 

1017 
zdiv_minus1_right ~> div_minus1_right 

1018 
zmod_minus1_right ~> mod_minus1_right 

1019 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

1020 
zmod_zmult1_eq ~> mod_mult_right_eq 

1021 
zpower_zmod ~> power_mod 

1022 
zdvd_zmod ~> dvd_mod 

1023 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

1024 
mod_mult_distrib ~> mult_mod_left 

1025 
mod_mult_distrib2 ~> mult_mod_right 

1026 

1027 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

1028 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

1029 

47551  1030 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
1031 

47552  1032 
* Consolidated theorem names concerning fold combinators: 
47550  1033 

1034 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

1035 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

1036 
INFI_fold_inf ~> INF_fold_inf 

1037 
SUPR_fold_sup ~> SUP_fold_sup 

1038 
union_set ~> union_set_fold 

1039 
minus_set ~> minus_set_fold 

1040 
INFI_set_fold ~> INF_set_fold 

1041 
SUPR_set_fold ~> SUP_set_fold 

1042 
INF_code ~> INF_set_foldr 

1043 
SUP_code ~> SUP_set_foldr 

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

1045 
foldr_fold_rev ~> foldr_conv_fold 

1046 
foldl_fold ~> foldl_conv_fold 

1047 
foldr_foldr ~> foldr_conv_foldl 

1048 
foldl_foldr ~> foldl_conv_foldr 

47552  1049 
fold_set_remdups ~> fold_set_fold_remdups 
1050 
fold_set ~> fold_set_fold 

1051 
fold1_set ~> fold1_set_fold 

47550  1052 

1053 
INCOMPATIBILITY. 

1054 

1055 
* Dropped rarely useful theorems concerning fold combinators: 

1056 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

1057 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

1058 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

1059 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

1060 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

1061 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

1065 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

1066 

1067 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

1068 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

1069 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

1070 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

1072 
fold_conv_foldr and fold_rev. 

1073 

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

1075 
through option types. 

1076 

47856  1077 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
1078 
relations. 

1079 

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

1081 

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

1083 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

1084 

1085 
zminus_zminus ~> minus_minus 

1086 
zminus_0 ~> minus_zero 

1087 
zminus_zadd_distrib ~> minus_add_distrib 

1088 
zadd_commute ~> add_commute 

1089 
zadd_assoc ~> add_assoc 

1090 
zadd_left_commute ~> add_left_commute 

1091 
zadd_ac ~> add_ac 

1092 
zmult_ac ~> mult_ac 

1093 
zadd_0 ~> add_0_left 

1094 
zadd_0_right ~> add_0_right 

1095 
zadd_zminus_inverse2 ~> left_minus 

1096 
zmult_zminus ~> mult_minus_left 

1097 
zmult_commute ~> mult_commute 

1098 
zmult_assoc ~> mult_assoc 

1099 
zadd_zmult_distrib ~> left_distrib 

1100 
zadd_zmult_distrib2 ~> right_distrib 

1101 
zdiff_zmult_distrib ~> left_diff_distrib 

1102 
zdiff_zmult_distrib2 ~> right_diff_distrib 

1103 
zmult_1 ~> mult_1_left 

1104 
zmult_1_right ~> mult_1_right 

1105 
zle_refl ~> order_refl 

1106 
zle_trans ~> order_trans 

1107 
zle_antisym ~> order_antisym 

1108 
zle_linear ~> linorder_linear 

1109 
zless_linear ~> linorder_less_linear 

1110 
zadd_left_mono ~> add_left_mono 

1111 
zadd_strict_right_mono ~> add_strict_right_mono 

1112 
zadd_zless_mono ~> add_less_le_mono 

1113 
int_0_less_1 ~> zero_less_one 

1114 
int_0_neq_1 ~> zero_neq_one 

1115 
zless_le ~> less_le 

1116 
zpower_zadd_distrib ~> power_add 

1117 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

1118 
zero_le_zpower_abs ~> zero_le_power_abs 

1119 

1120 
* Theory Deriv: Renamed 

1121 

1122 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

1123 

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

1125 

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

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

1130 
INCOMPATIBILITY. 

1131 

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

1134 

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

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

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

1139 
follows: 

47452  1140 

1141 
Operations: 

1142 
bulkload > rbt_bulkload 

1143 
del_from_left > rbt_del_from_left 

1144 
del_from_right > rbt_del_from_right 

1145 
del > rbt_del 

1146 
delete > rbt_delete 

1147 
ins > rbt_ins 

1148 
insert > rbt_insert 

1149 
insertw > rbt_insert_with 

1150 
insert_with_key > rbt_insert_with_key 

1151 
map_entry > rbt_map_entry 

1152 
lookup > rbt_lookup 

1153 
sorted > rbt_sorted 

1154 
tree_greater > rbt_greater 

1155 
tree_less > rbt_less 

1156 
tree_less_symbol > rbt_less_symbol 

1157 
union > rbt_union 

1158 
union_with > rbt_union_with 

1159 
union_with_key > rbt_union_with_key 

1160 

1161 
Lemmas: 

1162 
balance_left_sorted > balance_left_rbt_sorted 

1163 
balance_left_tree_greater > balance_left_rbt_greater 

1164 
balance_left_tree_less > balance_left_rbt_less 

1165 
balance_right_sorted > balance_right_rbt_sorted 

1166 
balance_right_tree_greater > balance_right_rbt_greater 

1167 
balance_right_tree_less > balance_right_rbt_less 

1168 
balance_sorted > balance_rbt_sorted 

1169 
balance_tree_greater > balance_rbt_greater 

1170 
balance_tree_less > balance_rbt_less 

1171 
bulkload_is_rbt > rbt_bulkload_is_rbt 

1172 
combine_sorted > combine_rbt_sorted 

1173 
combine_tree_greater > combine_rbt_greater 

1174 
combine_tree_less > combine_rbt_less 

1175 
delete_in_tree > rbt_delete_in_tree 

1176 
delete_is_rbt > rbt_delete_is_rbt 

1177 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

1178 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

1179 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

1180 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

1181 
del_in_tree > rbt_del_in_tree 

1182 
del_inv1_inv2 > rbt_del_inv1_inv2 

1183 
del_sorted > rbt_del_rbt_sorted 

1184 
del_tree_greater > rbt_del_rbt_greater 

1185 
del_tree_less > rbt_del_rbt_less 

1186 
dom_lookup_Branch > dom_rbt_lookup_Branch 

1187 
entries_lookup > entries_rbt_lookup 

1188 
finite_dom_lookup > finite_dom_rbt_lookup 

1189 
insert_sorted > rbt_insert_rbt_sorted 

1190 
insertw_is_rbt > rbt_insertw_is_rbt 

1191 
insertwk_is_rbt > rbt_insertwk_is_rbt 

1192 
insertwk_sorted > rbt_insertwk_rbt_sorted 

1193 
insertw_sorted > rbt_insertw_rbt_sorted 

1194 
ins_sorted > ins_rbt_sorted 

1195 
ins_tree_greater > ins_rbt_greater 

1196 
ins_tree_less > ins_rbt_less 

1197 
is_rbt_sorted > is_rbt_rbt_sorted 

1198 
lookup_balance > rbt_lookup_balance 

1199 
lookup_bulkload > rbt_lookup_rbt_bulkload 

1200 
lookup_delete > rbt_lookup_rbt_delete 

1201 
lookup_Empty > rbt_lookup_Empty 

1202 
lookup_from_in_tree > rbt_lookup_from_in_tree 

1203 
lookup_in_tree > rbt_lookup_in_tree 

1204 
lookup_ins > rbt_lookup_ins 

1205 
lookup_insert > rbt_lookup_rbt_insert 

1206 
lookup_insertw > rbt_lookup_rbt_insertw 

1207 
lookup_insertwk > rbt_lookup_rbt_insertwk 

1208 
lookup_keys > rbt_lookup_keys 

1209 
lookup_map > rbt_lookup_map 

1210 
lookup_map_entry > rbt_lookup_rbt_map_entry 

1211 
lookup_tree_greater > rbt_lookup_rbt_greater 

1212 
lookup_tree_less > rbt_lookup_rbt_less 

1213 
lookup_union > rbt_lookup_rbt_union 

1214 
map_entry_color_of > rbt_map_entry_color_of 

1215 
map_entry_inv1 > rbt_map_entry_inv1 

1216 
map_entry_inv2 > rbt_map_entry_inv2 

1217 
map_entry_is_rbt > rbt_map_entry_is_rbt 

1218 
map_entry_sorted > rbt_map_entry_rbt_sorted 

1219 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

1220 
map_entry_tree_less > rbt_map_entry_rbt_less 

1221 
map_tree_greater > map_rbt_greater 

1222 
map_tree_less > map_rbt_less 

1223 
map_sorted > map_rbt_sorted 

1224 
paint_sorted > paint_rbt_sorted 

1225 
paint_lookup > paint_rbt_lookup 

1226 
paint_tree_greater > paint_rbt_greater 

1227 
paint_tree_less > paint_rbt_less 

1228 
sorted_entries > rbt_sorted_entries 

1229 
tree_greater_eq_trans > rbt_greater_eq_trans 

1230 
tree_greater_nit > rbt_greater_nit 

1231 
tree_greater_prop > rbt_greater_prop 

1232 
tree_greater_simps > rbt_greater_simps 

1233 
tree_greater_trans > rbt_greater_trans 

1234 
tree_less_eq_trans > rbt_less_eq_trans 

1235 
tree_less_nit > rbt_less_nit 

1236 
tree_less_prop > rbt_less_prop 

1237 
tree_less_simps > rbt_less_simps 

1238 
tree_less_trans > rbt_less_trans 

1239 
tree_ord_props > rbt_ord_props 

1240 
union_Branch > rbt_union_Branch 

1241 
union_is_rbt > rbt_union_is_rbt 

1242 
unionw_is_rbt > rbt_unionw_is_rbt 

1243 
unionwk_is_rbt > rbt_unionwk_is_rbt 

1244 
unionwk_sorted > rbt_unionwk_rbt_sorted 

1245 

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

1248 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  1249 

1250 
Changed Operations: 

47622  1251 
float_abs > abs 
1252 
float_nprt > nprt 

1253 
float_pprt > pprt 

1254 
pow2 > use powr 

1255 
round_down > float_round_down 

1256 
round_up > float_round_up 

1257 
scale > exponent 

1258 

1259 
Removed Operations: 

1260 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

1261 

1262 
Renamed Lemmas: 

1263 
abs_float_def > Float.compute_float_abs 

1264 
bitlen_ge0 > bitlen_nonneg 

1265 
bitlen.simps > Float.compute_bitlen 

1266 
float_components > Float_mantissa_exponent 

1267 
float_divl.simps > Float.compute_float_divl 

1268 
float_divr.simps > Float.compute_float_divr 

1269 
float_eq_odd > mult_powr_eq_mult_powr_iff 

1270 
float_power > real_of_float_power 

1271 
lapprox_posrat_def > Float.compute_lapprox_posrat 

1272 
lapprox_rat.simps > Float.compute_lapprox_rat 

1273 
le_float_def' > Float.compute_float_le 

1274 
le_float_def > less_eq_float.rep_eq 

1275 
less_float_def' > Float.compute_float_less 

1276 
less_float_def > less_float.rep_eq 

1277 
normfloat_def > Float.compute_normfloat 

1278 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

1279 
normfloat > normfloat_def 

1280 
normfloat_unique > use normfloat_def 

1281 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

1282 
one_float_def > Float.compute_float_one 

1283 
plus_float_def > Float.compute_float_plus 

1284 
rapprox_posrat_def > Float.compute_rapprox_posrat 

1285 
rapprox_rat.simps > Float.compute_rapprox_rat 

1286 
real_of_float_0 > zero_float.rep_eq 

1287 
real_of_float_1 > one_float.rep_eq 

1288 
real_of_float_abs > abs_float.rep_eq 

1289 
real_of_float_add > plus_float.rep_eq 

1290 
real_of_float_minus > uminus_float.rep_eq 

1291 
real_of_float_mult > times_float.rep_eq 

1292 
real_of_float_simp > Float.rep_eq 

1293 
real_of_float_sub > minus_float.rep_eq 

1294 
round_down.simps > Float.compute_float_round_down 

1295 
round_up.simps > Float.compute_float_round_up 

1296 
times_float_def > Float.compute_float_times 

1297 
uminus_float_def > Float.compute_float_uminus 

1298 
zero_float_def > Float.compute_float_zero 

1299 

1300 
Lemmas not necessary anymore, use the transfer method: 

1301 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

1302 
float_divr, float_le_simp, float_less1_mantissa_bound, 

1303 
float_less_simp, float_less_zero, float_le_zero, 

1304 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

1305 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

1306 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

1307 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

1308 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

1309 
round_up, zero_le_float, zero_less_float 

47616  1310 

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

45791  1313 

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

1316 

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

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

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

1321 

1322 
* Session HOLWord: Discontinued many redundant theorems specific to 

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

1324 
instead. 

1325 

1326 
word_sub_alt ~> word_sub_wi 

1327 
word_add_alt ~> word_add_def 

1328 
word_mult_alt ~> word_mult_def 

1329 
word_minus_alt ~> word_minus_def 

1330 
word_0_alt ~> word_0_wi 

1331 
word_1_alt ~> word_1_wi 

1332 
word_add_0 ~> add_0_left 

1333 
word_add_0_right ~> add_0_right 

1334 
word_mult_1 ~> mult_1_left 

1335 
word_mult_1_right ~> mult_1_right 

1336 
word_add_commute ~> add_commute 

1337 
word_add_assoc ~> add_assoc 

1338 
word_add_left_commute ~> add_left_commute 

1339 
word_mult_commute ~> mult_commute 

1340 
word_mult_assoc ~> mult_assoc 

1341 
word_mult_left_commute ~> mult_left_commute 

1342 
word_left_distrib ~> left_distrib 

1343 
word_right_distrib ~> right_distrib 

1344 
word_left_minus ~> left_minus 

1345 
word_diff_0_right ~> diff_0_right 

1346 
word_diff_self ~> diff_self 

1347 
word_sub_def ~> diff_minus 

1348 
word_diff_minus ~> diff_minus 

1349 
word_add_ac ~> add_ac 

1350 
word_mult_ac ~> mult_ac 

1351 
word_plus_ac0 ~> add_0_left add_0_right add_ac 

1352 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 

1353 
word_order_trans ~> order_trans 

1354 
word_order_refl ~> order_refl 

1355 
word_order_antisym ~> order_antisym 

1356 
word_order_linear ~> linorder_linear 

1357 
lenw1_zero_neq_one ~> zero_neq_one 

1358 
word_number_of_eq ~> number_of_eq 

1359 
word_of_int_add_hom ~> wi_hom_add 

1360 
word_of_int_sub_hom ~> wi_hom_sub 

1361 
word_of_int_mult_hom ~> wi_hom_mult 

1362 
word_of_int_minus_hom ~> wi_hom_neg 

1363 
word_of_int_succ_hom ~> wi_hom_succ 

1364 
word_of_int_pred_hom ~> wi_hom_pred 

1365 
word_of_int_0_hom ~> word_0_wi 

1366 
word_of_int_1_hom ~> word_1_wi 

1367 

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

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

1371 
multiplication, shifting by constants, bitwise operators and numeric 

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

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

1376 

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

1379 
measure_space. The locales based on subset_class now have two 

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

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

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

1385 
Measure space constructions for distributions and densities now got 

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

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

1388 
and point_measure is introduced. INCOMPATIBILITY. 

47694  1389 

1390 
Renamed constants: 

1391 
measure > emeasure 

1392 
finite_measure.\<mu>' > measure 

1393 
product_algebra_generator > prod_algebra 

1394 
product_prob_space.emb > prod_emb 

1395 
product_prob_space.infprod_algebra > PiM 

1396 

1397 
Removed locales: 

1398 
completeable_measure_space 

1399 
finite_measure_space 

1400 
finite_prob_space 

1401 
finite_product_finite_prob_space 

1402 
finite_product_sigma_algebra 

1403 
finite_sigma_algebra 

1404 
measure_space 

1405 
pair_finite_prob_space 

1406 
pair_finite_sigma_algebra 

1407 
pair_finite_space 

1408 
pair_sigma_algebra 

1409 
product_sigma_algebra 

1410 

1411 
Removed constants: 

47751  1412 
conditional_space 
47694  1413 
distribution > use distr measure, or distributed predicate 
47751  1414 
image_space 
47694  1415 
joint_distribution > use distr measure, or distributed predicate 
47751  1416 
pair_measure_generator 
47694  1417 
product_prob_space.infprod_algebra > use PiM 
1418 
subvimage 

1419 

1420 
Replacement theorems: 

47751  1421 
finite_additivity_sufficient > ring_of_sets.countably_additiveI_finite 
1422 
finite_measure.empty_measure > measure_empty 

1423 
finite_measure.finite_continuity_from_above > finite_measure.finite_Lim_measure_decseq 

1424 
finite_measure.finite_continuity_from_below > finite_measure.finite_Lim_measure_incseq 

1425 
finite_measure.finite_measure_countably_subadditive > finite_measure.finite_measure_subadditive_countably 

1426 
finite_measure.finite_measure_eq > finite_measure.emeasure_eq_measure 

1427 
finite_measure.finite_measure > finite_measure.emeasure_finite 

1428 
finite_measure.finite_measure_finite_singleton > finite_measure.finite_measure_eq_setsum_singleton 

1429 
finite_measure.positive_measure' > measure_nonneg 

1430 
finite_measure.real_measure > finite_measure.emeasure_real 

1431 
finite_product_prob_space.finite_measure_times > finite_product_prob_space.finite_measure_PiM_emb 

1432 
finite_product_sigma_algebra.in_P > sets_PiM_I_finite 

1433 
finite_product_sigma_algebra.P_empty > space_PiM_empty, sets_PiM_empty 

1434 
information_space.conditional_entropy_eq > information_space.conditional_entropy_simple_distributed 

1435 
information_space.conditional_entropy_positive > information_space.conditional_entropy_nonneg_simple 

1436 
information_space.conditional_mutual_information_eq_mutual_information > information_space.conditional_mutual_information_eq_mutual_information_simple 

1437 
information_space.conditional_mutual_information_generic_positive > information_space.conditional_mutual_information_nonneg_simple 

f98bbb445c06
sorted lemma list in NEWS
hoelzl</ 