author  wenzelm 
Sun, 07 Jul 2013 18:34:29 +0200  
changeset 52549  802576856527 
parent 52539  7658f8d7b2dc 
child 52550  09e52d4a850a 
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 

52487
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset

9 
* Uniform management of "quick_and_dirty" as system option (see also 
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset

10 
"isabelle options"), configuration option within the context (see also 
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset

11 
Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor 
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset

12 
INCOMPATIBILITY, need to use more official Isabelle means to access 
48bc24467008
backout dedd7952a62c: static "proofs" value within theory prevents later inferencing with different configuration;
wenzelm
parents:
52470
diff
changeset

13 
quick_and_dirty, instead of historical poking into mutable reference. 
52059  14 

52060  15 
* Renamed command 'print_configs' to 'print_options'. Minor 
16 
INCOMPATIBILITY. 

17 

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

20 
treelike organization via implicit subsession relation, with its 

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

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

23 
presentation of theories. 

24 

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

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

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

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

28 

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

31 

52415  32 
* Updated and extended "isarref" and "implementation" manual, 
33 
eliminated old "ref" manual. 

34 

52430  35 
* Proper diagnostic command 'print_state'. Old 'pr' (with its 
36 
implicit change of some global references) is retained for now as 

37 
control command, e.g. for ProofGeneral 3.7.x. 

38 

52549  39 
* Discontinued 'print_drafts' command with its oldfashioned PS output 
40 
and Unix commandline print spooling. Minor INCOMPATIBILITY: use 

41 
'display_drafts' instead and print via the regular document viewer. 

42 

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

43 

51533  44 
*** Prover IDE  Isabelle/Scala/jEdit *** 
45 

52445  46 
* Dockable window "Documentation" provides access to Isabelle 
47 
documentation. 

48 

51533  49 
* Dockable window "Timing" provides an overview of relevant command 
50 
timing information. 

51 

51553
63327f679cff
more ambitious Goal.skip_proofs: covers Goal.prove forms as well, and do not insist in quick_and_dirty (for the sake of Isabelle/jEdit);
wenzelm
parents:
51551
diff
changeset

52 
* Option to skip over proofs, using implicit 'sorry' internally. 
63327f679cff
more ambitious Goal.skip_proofs: covers Goal.prove forms as well, and do not insist in quick_and_dirty (for the sake of Isabelle/jEdit);
wenzelm
parents:
51551
diff
changeset

53 

51533  54 

51313  55 
*** Pure *** 
56 

52488
cd65ee49a8ba
discontinued system option "proofs"  global state of Proofterm.proofs is persistently compiled into HOLProofs image;
wenzelm
parents:
52487
diff
changeset

57 
* System option "proofs" has been discontinued. Instead the global 
cd65ee49a8ba
discontinued system option "proofs"  global state of Proofterm.proofs is persistently compiled into HOLProofs image;
wenzelm
parents:
52487
diff
changeset

58 
state of Proofterm.proofs is persistently compiled into logic images 
cd65ee49a8ba
discontinued system option "proofs"  global state of Proofterm.proofs is persistently compiled into HOLProofs image;
wenzelm
parents:
52487
diff
changeset

59 
as required, notably HOLProofs. Users no longer need to change 
cd65ee49a8ba
discontinued system option "proofs"  global state of Proofterm.proofs is persistently compiled into HOLProofs image;
wenzelm
parents:
52487
diff
changeset

60 
Proofterm.proofs dynamically. Minor INCOMPATIBILITY. 
cd65ee49a8ba
discontinued system option "proofs"  global state of Proofterm.proofs is persistently compiled into HOLProofs image;
wenzelm
parents:
52487
diff
changeset

61 

52143  62 
* Syntax translation functions (print_translation etc.) always depend 
63 
on Proof.context. Discontinued former "(advanced)" option  this is 

64 
now the default. Minor INCOMPATIBILITY. 

65 

51747  66 
* Targetsensitive commands 'interpretation' and 'sublocale'. 
67 
Particulary, 'interpretation' now allows for nonpersistent 

68 
interpretation within "context ... begin ... end" blocks. 

69 
See "isarref" manual for details. 

70 

51565  71 
* Improved locales diagnostic command 'print_dependencies'. 
72 

51313  73 
* Discontinued obsolete 'axioms' command, which has been marked as 
74 
legacy since Isabelle20092. INCOMPATIBILITY, use 'axiomatization' 

75 
instead, while observing its uniform scope for polymorphism. 

76 

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

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

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

79 

52463  80 
* SELECT_GOAL now retains the syntactic context of the overall goal 
81 
state (schematic variables etc.). Potential INCOMPATIBILITY in rare 

82 
situations. 

83 

51313  84 

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

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

86 

52435
6646bb548c6b
migration from code_(consttypeclassinstance) to code_printing and from code_module to code_identifier
haftmann
parents:
52430
diff
changeset

87 
* Code generator: 
6646bb548c6b
migration from code_(consttypeclassinstance) to code_printing and from code_module to code_identifier
haftmann
parents:
52430
diff
changeset

88 
* 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' / 'code_instance'. 
6646bb548c6b
migration from code_(consttypeclassinstance) to code_printing and from code_module to code_identifier
haftmann
parents:
52430
diff
changeset

89 
* 'code_identifier' declares name hints for arbitrary identifiers in generated code, 
6646bb548c6b
migration from code_(consttypeclassinstance) to code_printing and from code_module to code_identifier
haftmann
parents:
52430
diff
changeset

90 
subsuming 'code_modulename'. 
6646bb548c6b
migration from code_(consttypeclassinstance) to code_printing and from code_module to code_identifier
haftmann
parents:
52430
diff
changeset

91 
See the Isar reference manual for syntax diagrams, and the HOL theories for examples. 
6646bb548c6b
migration from code_(consttypeclassinstance) to code_printing and from code_module to code_identifier
haftmann
parents:
52430
diff
changeset

92 

52380  93 
* Library/Polynomial.thy: 
94 
* Use lifting for primitive definitions. 

95 
* Explicit conversions from and to lists of coefficients, used for generated code. 

96 
* Replaced recursion operator poly_rec by fold_coeffs. 

97 
* Prefer preexisting gcd operation for gcd. 

98 
* Fact renames: 

99 
poly_eq_iff ~> poly_eq_poly_eq_iff 

100 
poly_ext ~> poly_eqI 

101 
expand_poly_eq ~> poly_eq_iff 

102 
IMCOMPATIBILTIY. 

103 

52286  104 
* Reification and reflection: 
105 
* Reification is now directly available in HOLMain in structure "Reification". 

106 
* Reflection now handles multiple lists with variables also. 

107 
* The whole reflection stack has been decomposed into conversions. 

108 
INCOMPATIBILITY. 

109 

52141
eff000cab70f
weaker precendence of syntax for big intersection and union on sets
haftmann
parents:
52116
diff
changeset

110 
* Weaker precendence of syntax for big intersection and union on sets, 
eff000cab70f
weaker precendence of syntax for big intersection and union on sets
haftmann
parents:
52116
diff
changeset

111 
in accordance with corresponding lattice operations. INCOMPATIBILITY. 
eff000cab70f
weaker precendence of syntax for big intersection and union on sets
haftmann
parents:
52116
diff
changeset

112 

51682  113 
* Nested case expressions are now translated in a separate check 
114 
phase rather than during parsing. The data for case combinators 

115 
is separated from the datatype package. The declaration attribute 

116 
"case_translation" can be used to register new case combinators: 

117 

118 
declare [[case_translation case_combinator constructor1 ... constructorN]] 

119 

51596  120 
* Notation "{p:A. P}" now allows tuple patterns as well. 
121 

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

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

125 
This is now identity on infinite sets. 

126 
 Locales (Â»mini packagesÂ«) for fundamental definitions with 

127 
Finite_Set.fold: folding, folding_idem. 

128 
 Locales comm_monoid_set, semilattice_order_set and 

129 
semilattice_neutr_order_set for big operators on sets. 

130 
See theory Big_Operators for canonical examples. 

131 
Note that foundational constants comm_monoid_set.F and 

132 
semilattice_set.F correspond to former combinators fold_image 

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

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

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

138 
 Fact renames: 

139 
card.union_inter ~> card_Un_Int [symmetric] 

140 
card.union_disjoint ~> card_Un_disjoint 

141 

142 
INCOMPATIBILITY. 

143 

51487  144 
* Locale hierarchy for abstract orderings and (semi)lattices. 
145 

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

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

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

148 

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

151 

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

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

153 
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

154 
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

155 
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

156 
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

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

158 

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

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

160 
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

161 
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

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

163 

51773  164 
* Introduce type class "conditionally_complete_lattice": Like a complete 
51732  165 
lattice but does not assume the existence of the top and bottom elements. 
166 
Allows to generalize some lemmas about reals and extended reals. 

167 
Removed SupInf and replaced it by the instantiation of 

51773  168 
conditionally_complete_lattice for real. Renamed lemmas about 
169 
conditionallycomplete lattice from Sup_... to cSup_... and from Inf_... 

170 
to cInf_... to avoid hidding of similar complete lattice lemmas. 

51775
408d937c9486
revert #916271d52466; add nontopological linear_continuum type class; show linear_continuum_topology is a perfect_space
hoelzl
parents:
51774
diff
changeset

171 

408d937c9486
revert #916271d52466; add nontopological linear_continuum type class; show linear_continuum_topology is a perfect_space
hoelzl
parents:
51774
diff
changeset

172 
Introduce type class linear_continuum as combination of conditionallycomplete 
408d937c9486
revert #916271d52466; add nontopological linear_continuum type class; show linear_continuum_topology is a perfect_space
hoelzl
parents:
51774
diff
changeset

173 
lattices and inner dense linorders which have more than one element. 
51732  174 
INCOMPATIBILITY. 
175 

176 
* Introduce type classes "no_top" and "no_bot" for orderings without top 

177 
and bottom elements. 

178 

179 
* Split dense_linorder into inner_dense_order and no_top, no_bot. 

180 

181 
* Complex_Main: Unify and move various concepts from 

182 
HOLMultivariate_Analysis to HOLComplex_Main. 

183 

51775
408d937c9486
revert #916271d52466; add nontopological linear_continuum type class; show linear_continuum_topology is a perfect_space
hoelzl
parents:
51774
diff
changeset

184 
 Introduce type class (lin)order_topology and linear_continuum_topology. 
408d937c9486
revert #916271d52466; add nontopological linear_continuum type class; show linear_continuum_topology is a perfect_space
hoelzl
parents:
51774
diff
changeset

185 
Allows to generalize theorems about limits and order. 
408d937c9486
revert #916271d52466; add nontopological linear_continuum type class; show linear_continuum_topology is a perfect_space
hoelzl
parents:
51774
diff
changeset

186 
Instances are reals and extended reals. 
51732  187 

188 
 continuous and continuos_on from Multivariate_Analysis: 

189 
"continuous" is the continuity of a function at a filter. 

190 
"isCont" is now an abbrevitation: "isCont x f == continuous (at _) f". 

191 

192 
Generalized continuity lemmas from isCont to continuous on an arbitrary 

193 
filter. 

194 

195 
 compact from Multivariate_Analysis. Use Bolzano's lemma 

196 
to prove compactness of closed intervals on reals. Continuous functions 

197 
attain infimum and supremum on compact sets. The inverse of a continuous 

198 
function is continuous, when the function is continuous on a compact set. 

199 

200 
 connected from Multivariate_Analysis. Use it to prove the 

51775
408d937c9486
revert #916271d52466; add nontopological linear_continuum type class; show linear_continuum_topology is a perfect_space
hoelzl
parents:
51774
diff
changeset

201 
intermediate value theorem. Show connectedness of intervals on 
408d937c9486
revert #916271d52466; add nontopological linear_continuum type class; show linear_continuum_topology is a perfect_space
hoelzl
parents:
51774
diff
changeset

202 
linear_continuum_topology). 
51732  203 

204 
 first_countable_topology from Multivariate_Analysis. Is used to 

205 
show equivalence of properties on the neighbourhood filter of x and on 

206 
all sequences converging to x. 

207 

208 
 FDERIV: Definition of has_derivative moved to Deriv.thy. Moved theorems 

209 
from Library/FDERIV.thy to Deriv.thy and base the definition of DERIV on 

210 
FDERIV. Add variants of DERIV and FDERIV which are restricted to sets, 

211 
i.e. to represent derivatives from left or right. 

212 

213 
 Removed the withinfilter. It is replaced by the principal filter: 

214 

215 
F within X = inf F (principal X) 

216 

217 
 Introduce "at x within U" as a single constant, "at x" is now an 

218 
abbreviation for "at x within UNIV" 

219 

220 
 Introduce named theorem collections tendsto_intros, continuous_intros, 

221 
continuous_on_intros and FDERIV_intros. Theorems in tendsto_intros (or 

222 
FDERIV_intros) are also available as tendsto_eq_intros (or 

223 
FDERIV_eq_intros) where the righthand side is replaced by a congruence 

224 
rule. This allows to apply them as intro rules and then proving 

225 
equivalence by the simplifier. 

226 

227 
 Restructured theories in HOLComplex_Main: 

228 

229 
+ Moved RealDef and RComplete into Real 

230 

231 
+ Introduced Topological_Spaces and moved theorems about 

232 
topological spaces, filters, limits and continuity to it 

233 

234 
+ Renamed RealVector to Real_Vector_Spaces 

235 

236 
+ Split Lim, SEQ, Series into Topological_Spaces, Real_Vector_Spaces, and 

237 
Limits 

238 

239 
+ Moved Ln and Log to Transcendental 

240 

241 
+ Moved theorems about continuity from Deriv to Topological_Spaces 

242 

243 
 Remove various auxiliary lemmas. 

244 

245 
INCOMPATIBILITY. 

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

246 

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

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

248 

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

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

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

251 

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

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

253 

51137  254 
* Sledgehammer: 
255 

256 
 Renamed option: 

257 
isar_shrink ~> isar_compress 

258 

52266  259 
* HOLSpec_Check: a Quickcheck tool for Isabelle's ML environment. 
260 

261 
With HOLSpec_Check, ML developers can check specifications with the 

262 
ML function check_property. The specifications must be of the form 

263 
"ALL x1 ... xn. Prop x1 ... xn". Simple examples are in 

264 
src/HOL/Spec_Check/Examples.thy. 

265 

50994  266 

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

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

268 

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

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

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

271 
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

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

273 

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

274 

51551  275 
*** ML *** 
276 

277 
* More uniform naming of goal functions for skipped proofs: 

278 

279 
Skip_Proof.prove ~> Goal.prove_sorry 

280 
Skip_Proof.prove_global ~> Goal.prove_sorry_global 

281 

51686  282 
* Antiquotation @{theory_context A} is similar to @{theory A}, but 
283 
presents the result as initial Proof.context. 

284 

51703
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51689
diff
changeset

285 
* Modifiers for classical wrappers (e.g. addWrapper, delWrapper) 
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51689
diff
changeset

286 
operate on Proof.context instead of claset, for uniformity with addIs, 
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51689
diff
changeset

287 
addEs, addDs etc. Note that claset_of and put_claset allow to manage 
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51689
diff
changeset

288 
clasets separately from the context. 
f2e92fc0c8aa
modifiers for classical wrappers operate on Proof.context instead of claset;
wenzelm
parents:
51689
diff
changeset

289 

51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset

290 
* Simplifier tactics and tools use proper Proof.context instead of 
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset

291 
historic type simpset. Oldstyle declarations like addsimps, 
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset

292 
addsimprocs etc. operate directly on Proof.context. Raw type simpset 
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset

293 
retains its use as snapshot of the main Simplifier context, using 
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset

294 
simpset_of and put_simpset on Proof.context. INCOMPATIBILITY  port 
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset

295 
old tools by making them depend on (ctxt : Proof.context) instead of 
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset

296 
(ss : simpset), then turn (simpset_of ctxt) into ctxt. 
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset

297 

9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset

298 
* Discontinued obsolete ML antiquotations @{claset} and @{simpset}. 
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset

299 
INCOMPATIBILITY, use @{context} instead. 
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51703
diff
changeset

300 

51551  301 

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

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

303 

52052
892061142ba6
discontinued obsolete isabelle usedir, mkdir, make;
wenzelm
parents:
51775
diff
changeset

304 
* Discontinued obsolete isabelle usedir, mkdir, make  superseded by 
892061142ba6
discontinued obsolete isabelle usedir, mkdir, make;
wenzelm
parents:
51775
diff
changeset

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

306 

52054
eaf17514aabd
discontinued obsolete isabelleprocess options f and u;
wenzelm
parents:
52053
diff
changeset

307 
* Discontinued obsolete isabelleprocess options f and u (former 
eaf17514aabd
discontinued obsolete isabelleprocess options f and u;
wenzelm
parents:
52053
diff
changeset

308 
administrative aliases of option e). Minor INCOMPATIBILITY. 
eaf17514aabd
discontinued obsolete isabelleprocess options f and u;
wenzelm
parents:
52053
diff
changeset

309 

52053  310 
* Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to 
311 
specify global resources of the JVM process run by isabelle build. 

312 

52116
abf9fcfa65cf
added isabelle_scala_script wrapper  NB: portable hashbang allows exactly one executable, without additional arguments;
wenzelm
parents:
52060
diff
changeset

313 
* Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows 
abf9fcfa65cf
added isabelle_scala_script wrapper  NB: portable hashbang allows exactly one executable, without additional arguments;
wenzelm
parents:
52060
diff
changeset

314 
to run Isabelle/Scala source files as standalone programs. 
abf9fcfa65cf
added isabelle_scala_script wrapper  NB: portable hashbang allows exactly one executable, without additional arguments;
wenzelm
parents:
52060
diff
changeset

315 

52439
4cf3f6153eb8
improved "isabelle keywords" and "isabelle update_keywords" based on Isabelle/Scala, without requiring to build sessions first;
wenzelm
parents:
52435
diff
changeset

316 
* Improved "isabelle keywords" tool (for oldstyle ProofGeneral 
4cf3f6153eb8
improved "isabelle keywords" and "isabelle update_keywords" based on Isabelle/Scala, without requiring to build sessions first;
wenzelm
parents:
52435
diff
changeset

317 
keyword tables): use Isabelle/Scala operations, which inspect outer 
4cf3f6153eb8
improved "isabelle keywords" and "isabelle update_keywords" based on Isabelle/Scala, without requiring to build sessions first;
wenzelm
parents:
52435
diff
changeset

318 
syntax without requiring to build sessions first. 
4cf3f6153eb8
improved "isabelle keywords" and "isabelle update_keywords" based on Isabelle/Scala, without requiring to build sessions first;
wenzelm
parents:
52435
diff
changeset

319 

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

320 

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

321 

50993  322 
New in Isabelle2013 (February 2013) 
323 
 

47887  324 

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

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

326 

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

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

328 
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

329 
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

330 
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

331 
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

332 
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

333 
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

334 

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

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

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

339 

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

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

341 
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

342 

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

345 
Tools that load their additional source files may imitate the 

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

347 
dependencies properly. 

348 

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

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

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

351 

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

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

354 

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

49841  357 
and "class ... context ...". 
358 

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

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

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

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

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

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

365 

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

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

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

368 

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

371 

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

372 

49968  373 
*** Prover IDE  Isabelle/Scala/jEdit *** 
374 

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

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

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

378 
surface, while the prover is still crunching on internal 

379 
justifications. Unfinished / cancelled proofs are restarted as 

380 
required to complete full proof checking eventually. 

381 

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

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

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

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

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

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

388 

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

391 
browser on demand. 

392 

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

395 
comment delimiters works more conveniently with unfinished situations 

396 
that frequently occur in user interaction. 

397 

398 
* More efficient painting and improved reactivity when editing large 

399 
files. More scalable management of formal document content. 

400 

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

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

402 
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

403 
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

404 
potentially infinite message streams. 
49968  405 

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

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

408 
options, including tuning parameters for editor reactivity and color 

409 
schemes. 

410 

50184  411 
* Dockable window "Symbols" provides some editing support for Isabelle 
412 
symbols. 

413 

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

50701  416 

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

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

420 

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

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

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

50183  425 

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

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

429 

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

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

431 
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

432 
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

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

434 

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

437 
now bundled exclusively with Isabelle. 

438 

439 

48205  440 
*** Pure *** 
441 

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

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

443 
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

444 

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

447 
rather arbitrary current working directory. INCOMPATIBILITY. 

48371  448 

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

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

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

453 
with some care where this is really required. 

454 

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

51063  457 
given sort. Example (in HOL): 
48792  458 

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

460 

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

463 

48205  464 

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

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

466 

50646  467 
* Sledgehammer: 
468 

469 
 Added MaSh relevance filter based on machinelearning; see the 

470 
Sledgehammer manual for details. 

471 
 Polished Isar proofs generated with "isar_proofs" option. 

472 
 Rationalized type encodings ("type_enc" option). 

50720  473 
 Renamed "kill_provers" subcommand to "kill_all". 
50646  474 
 Renamed options: 
475 
isar_proof ~> isar_proofs 

476 
isar_shrink_factor ~> isar_shrink 

477 
max_relevant ~> max_facts 

478 
relevance_thresholds ~> fact_thresholds 

479 

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

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

482 
configuration quickcheck_optimise_equality to false. 

483 

50878  484 
* Quotient: only one quotient can be defined by quotient_type 
485 
INCOMPATIBILITY. 

486 

487 
* Lifting: 

488 
 generation of an abstraction function equation in lift_definition 

489 
 quot_del attribute 

490 
 renamed no_abs_code > no_code (INCOMPATIBILITY.) 

491 

50646  492 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
493 
expressions. 

494 

495 
* Preprocessing of the code generator rewrites set comprehensions into 

496 
pointfree expressions. 

497 

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

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

500 
arithmetic, datatypes/records) with potential proof reconstruction 

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

502 
INCOMPATIBILITY. 

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

503 

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

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

505 
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

506 
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

507 
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

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

509 

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

512 

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

514 
List. INCOMPATIBILITY. 

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

515 

49739  516 
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. 
517 

49738  518 
* Class "comm_monoid_diff" formalises properties of bounded 
49388  519 
subtraction, with natural numbers and multisets as typical instances. 
520 

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

523 
* Theory "Transitive_Closure": renamed lemmas 

524 

525 
reflcl_tranclp > reflclp_tranclp 

526 
rtranclp_reflcl > rtranclp_reflclp 

527 

528 
INCOMPATIBILITY. 

529 

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

531 

532 
left_distrib ~> distrib_right 

533 
right_distrib ~> distrib_left 

534 

535 
INCOMPATIBILITY. 

536 

537 
* Generalized the definition of limits: 

538 

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

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

541 
output f x converges to G. 

542 

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

544 
infinity (at_bot). 

545 

546 
 Moved infinity in the norm (at_infinity) from 

547 
Multivariate_Analysis to Complex_Main. 

548 

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

550 
at_top". 

551 

552 
INCOMPATIBILITY. 

553 

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

555 
lattice type classes. 

556 

557 
* Theory "Library/Multiset": renamed 

558 

559 
constant fold_mset ~> Multiset.fold 

560 
fact fold_mset_commute ~> fold_mset_comm 

561 

562 
INCOMPATIBILITY. 

563 

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

565 
changes as follows. 

566 

567 
 Renamed constants (and related lemmas) 

49145  568 

569 
prefix ~> prefixeq 

570 
strict_prefix ~> prefix 

571 

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

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

575 
Renamed lemmas accordingly. 

576 

577 
 Added constant "list_hembeq" for homeomorphic embedding on 

578 
lists. Added abbreviation "sublisteq" for special case 

579 
"list_hembeq (op =)". 

580 

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

582 
class instances for the prefix order (merely corresponding locale 

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

584 
Library/Prefix_Order. 

585 

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

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

50516  588 

589 
le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff 

590 
le_list_append_mono ~> Sublist.list_hembeq_append_mono 

591 
le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2 

592 
le_list_Cons_EX ~> Sublist.list_hembeq_ConsD 

593 
le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2' 

594 
le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq 

595 
le_list_drop_Cons ~> Sublist.sublisteq_Cons' 

596 
le_list_drop_many ~> Sublist.sublisteq_drop_many 

597 
le_list_filter_left ~> Sublist.sublisteq_filter_left 

598 
le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many 

599 
le_list_rev_take_iff ~> Sublist.sublisteq_append 

600 
le_list_same_length ~> Sublist.sublisteq_same_length 

601 
le_list_take_many_iff ~> Sublist.sublisteq_append' 

49145  602 
less_eq_list.drop ~> less_eq_list_drop 
603 
less_eq_list.induct ~> less_eq_list_induct 

50516  604 
not_le_list_length ~> Sublist.not_sublisteq_length 
49145  605 

50646  606 
INCOMPATIBILITY. 
607 

608 
* New theory Library/Countable_Set. 

609 

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

611 
parallel execution for code generated towards Isabelle/ML. 

612 

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

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

615 
extensional_funcset by an abbreviation, and renamed lemmas from 

616 
extensional_funcset to PiE as follows: 

617 

618 
extensional_empty ~> PiE_empty 

619 
extensional_funcset_empty_domain ~> PiE_empty_domain 

620 
extensional_funcset_empty_range ~> PiE_empty_range 

621 
extensional_funcset_arb ~> PiE_arb 

622 
extensional_funcset_mem ~> PiE_mem 

623 
extensional_funcset_extend_domainI ~> PiE_fun_upd 

624 
extensional_funcset_restrict_domain ~> fun_upd_in_PiE 

625 
extensional_funcset_extend_domain_eq ~> PiE_insert_eq 

626 
card_extensional_funcset ~> card_PiE 

627 
finite_extensional_funcset ~> finite_PiE 

628 

629 
INCOMPATIBILITY. 

630 

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

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

633 
Data"). 

634 

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

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

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

638 
code. 

639 

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

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

642 
return a structurally different tree than before. Potential 

643 
INCOMPATIBILITY. 

644 

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

646 

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

648 

649 
* HOL/Multivariate_Analysis: replaced 

650 

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

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

653 

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

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

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

657 

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

659 

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

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

662 
cart_base i removed 

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

664 

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

665 
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

666 

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

667 
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

668 

50646  669 
component_le_norm ~> Basis_le_norm 
670 
euclidean_eq ~> euclidean_eq_iff 

671 
differential_zero_maxmin_component ~> differential_zero_maxmin_cart 

672 
euclidean_simps ~> inner_simps 

673 
independent_basis ~> independent_Basis 

674 
span_basis ~> span_Basis 

675 
in_span_basis ~> in_span_Basis 

676 
norm_bound_component_le ~> norm_boound_Basis_le 

677 
norm_bound_component_lt ~> norm_boound_Basis_lt 

678 
component_le_infnorm ~> Basis_le_infnorm 

679 

680 
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

681 

50141  682 
* HOL/Probability: 
50646  683 

684 
 Added simproc "measurable" to automatically prove measurability. 

685 

686 
 Added induction rules for sigma sets with disjoint union 

687 
(sigma_sets_induct_disjoint) and for Borelmeasurable functions 

688 
(borel_measurable_induct). 

689 

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

691 
projective family). 

692 

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

694 
AFP entry "Ordinals_and_Cardinals"). 

695 

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

697 
with support for mixed, nested recursion and interesting nonfree 

698 
datatypes. 

48094  699 

50991  700 
* HOL/Finite_Set and Relation: added new set and relation operations 
50878  701 
expressed by Finite_Set.fold. 
702 

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

704 
trees for the code generator. 

705 

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

707 
Lifting/Transfer. 

708 
possible INCOMPATIBILITY. 

709 

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

711 
INCOMPATIBILITY. 

712 

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

713 

48206  714 
*** Document preparation *** 
715 

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

718 
Discontinued legacy styles "prem1" .. "prem19". 

719 

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

721 
instead of slightly exotic babel/greek. 

48206  722 

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

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

724 
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

725 
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

726 

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

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

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

729 

48206  730 

48992  731 
*** ML *** 
732 

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

735 
hardware and Poly/ML runtime system. 

736 

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

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

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

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

740 

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

743 
necessarily printing visible text. 

744 

745 

48206  746 
*** System *** 
747 

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

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

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

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

753 
document preparation as well. INCOMPATIBILITY, isabelle usedir / 

48736  754 
mkdir / make are rendered obsolete. 
755 

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

758 

759 
isabelle build s b HOL 

760 

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

762 

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

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

764 
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

765 
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

766 
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

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

768 

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

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

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

771 

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

774 

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

776 
INCOMPATIBILITY. 

777 

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

780 
version of Isabelle. 

781 

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

784 

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

786 
picked up from some surrounding directory. Potential INCOMPATIBILITY 

787 
for homemade settings. 

50132  788 

50701  789 
* Improved ML runtime statistics (heap, threads, future tasks etc.). 
790 

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

793 
configuration. 

794 

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

797 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

799 
bundled as Isabelle component. 

48206  800 

50182  801 

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

802 

47462  803 
New in Isabelle2012 (May 2012) 
804 
 

45109  805 

45593  806 
*** General *** 
807 

45614  808 
* Prover IDE (PIDE) improvements: 
809 

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

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

45614  817 

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

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

46485  821 

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

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

823 
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

824 
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

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

826 
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

827 

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

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

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

830 
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

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

832 

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

833 
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

834 

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

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

836 

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

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

838 

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

839 
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

840 
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

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

842 

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

843 
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

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

845 

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

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

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

47484  851 

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

854 
oldstyle "standard" after instantiation or composition of facts 

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

856 
indices of schematic variables. 

857 

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

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

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

861 
the historic accident of dynamic reevaluation in interpretations 

862 
etc. was exploited. 

863 

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

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

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

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

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

869 
of the material of that old tutorial. 

870 

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

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

873 
manual. 

874 

875 

876 
*** Pure *** 

877 

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

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

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

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

881 

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

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

885 
undocumented feature.) 

886 

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

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

890 

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

892 

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

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

895 

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

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

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

899 
order to accommodate newly introduced premises.) 

900 

47806  901 
* Renamed some inner syntax categories: 
902 

903 
num ~> num_token 

904 
xnum ~> xnum_token 

905 
xstr ~> str_token 

906 

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

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

909 
position information via constraints). 

910 

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

913 
manual. Minor INCOMPATIBILITY. 

914 

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

45134  917 

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

920 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  921 

47464  922 
* Redundant attribute "code_inline" has been discontinued. Use 
923 
"code_unfold" instead. INCOMPATIBILITY. 

924 

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

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

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

927 

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

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

929 

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

930 
INCOMPATIBILITY. 
45383  931 

47856  932 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
933 
instead. INCOMPATIBILITY. 

934 

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

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

937 
legacy since Isabelle2011). 

47855  938 

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

939 

45122  940 
*** HOL *** 
941 

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

944 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

949 
tinkering with former theorems mem_def and Collect_def as far as 

950 
possible. 

951 

952 
For developments which deliberately mix predicates and sets, a 

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

955 
Isabelle20111 before jumping right into the current release. 

956 

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

959 

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

961 

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

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

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

967 
user theories may require adaptations as follows: 

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

968 

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

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

970 
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

971 

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

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

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

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

975 

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

976 
 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

977 
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

978 

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

979 
 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

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

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

982 

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

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

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

985 

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

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

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

990 
corresponding parts of the Quotient package.) 

47809  991 

992 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

994 
relate different type instances of the same polymorphic constant, 

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

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

997 

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

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

1000 

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

1002 
equivalent subgoal on the corresponding raw types. Constants are 

1003 
replaced with corresponding ones according to the transfer rules. 

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

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

1009 

1010 
 relator_eq attribute: Collects identity laws for relators of 

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

1012 
transfer method uses these lemmas to infer transfer rules for 

1013 
nonpolymorphic constants on the fly. 

1014 

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

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

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

1018 
after unfolding the constant definitions. 

1019 

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

1021 
from type nat to type int. 

1022 

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

47809  1025 

1026 
 lift_definition command: Defines operations on an abstract type in 

1027 
terms of a corresponding operation on a representation 

1028 
type. Example syntax: 

1029 

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

1031 
is List.insert 

1032 

1033 
Users must discharge a respectfulness proof obligation when each 

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

1035 
the proof is discharged automatically.) The obligation is 

1036 
presented in a userfriendly, readable form; a respectfulness 

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

1038 
by the package. 

1039 

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

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

1042 
lift_definition generates a code certificate theorem and sets up 

1043 
code generation for each constant. 

1044 

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

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

1047 
or a type_definition theorem. The package configures transfer 

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

1049 
lift_definition command to work with the type. 

1050 

1051 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  1052 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
1053 
Word/Word.thy and Library/Float.thy. 

47809  1054 

1055 
* Quotient package: 

1056 

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

1058 
rep and abs functions, similar to typedef. 

1059 

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

1061 
Transfer packages, as with 'setup_lifting'. 

1062 

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

1064 
respectfulness property at the point where the constant is 

1065 
defined, similar to lift_definition; INCOMPATIBILITY. 

1066 

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

1068 
accordingly, INCOMPATIBILITY. 

1069 

1070 
* New diagnostic command 'find_unused_assms' to find potentially 

1071 
superfluous assumptions in theorems using Quickcheck. 

1072 

1073 
* Quickcheck: 

1074 

1075 
 Quickcheck returns variable assignments as counterexamples, which 

1076 
allows to reveal the underspecification of functions under test. 

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

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

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

1080 

1081 
These counterexample are marked as potentially spurious, as 

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

1083 
obvious theorem "hd xs = hd xs". 

1084 

1085 
After finding a potentially spurious counterexample, Quickcheck 

1086 
continues searching for genuine ones. 

1087 

1088 
By default, Quickcheck shows potentially spurious and genuine 

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

1090 
show genuine counterexamples. 

1091 

1092 
 The command 'quickcheck_generator' creates random and exhaustive 

1093 
value generators for a given type and operations. 

1094 

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

1096 
constructors of that type. 

1097 

1098 
 Support for multisets. 

1099 

1100 
 Added "use_subtype" options. 

1101 

1102 
 Added "quickcheck_locale" configuration to specify how to process 

1103 
conjectures in a locale context. 

1104 

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

47809  1107 

1108 
* Sledgehammer: 

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

1110 
paper "More SPASS with Isabelle". 

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

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

1113 
TFF1), iProver, iProverEq. 

1114 
 Sped up the minimizer. 

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

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

1117 
 Renamed "sound" option to "strict". 

1118 

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

1121 

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

1123 

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

47809  1125 

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

1128 

1129 
list.exhaust [case_product nat.exhaust] 

1130 

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

1132 
a list and a nat. 

1133 

47809  1134 
* New "eventually_elim" method as a generalized variant of the 
47855  1135 
eventually_elim* rules. Supports structured proofs. 
1136 

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

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

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

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

1140 

47856  1141 
* Record: code generation can be switched off manually with 
1142 

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

1144 

1145 
* Datatype: type parameters allow explicit sort constraints. 

1146 

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

1149 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

1151 
one_case. 

1152 

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

1154 
the result of the fact expression. 

1155 

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

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

1159 

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

1160 
converse_def ~> converse_unfold 
47549  1161 
rel_comp_def ~> relcomp_unfold 
47820  1162 
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

1163 
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

1164 
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

1165 
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

1166 

46981  1167 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
1168 

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

47086  1171 

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

1172 
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

1173 

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

46458  1177 
rel_pow_1 ~> relpow_1 
46363  1178 
rel_pow_0_I ~> relpow_0_I 
1179 
rel_pow_Suc_I ~> relpow_Suc_I 

1180 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

1181 
rel_pow_0_E ~> relpow_0_E 

1182 
rel_pow_Suc_E ~> relpow_Suc_E 

1183 
rel_pow_E ~> relpow_E 

46458  1184 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  1185 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  1186 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
1187 
rel_pow_E2 ~> relpow_E2 

1188 
rel_pow_add ~> relpow_add 

1189 
rel_pow_commute ~> relpow 

1190 
rel_pow_empty ~> relpow_empty: 

1191 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

1192 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

1193 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

1194 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

1195 
rel_pow_fun_conv ~> relpow_fun_conv 

1196 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

1197 
rel_pow_finite_bounded ~> relpow_finite_bounded 

1198 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

1199 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

1200 
single_valued_rel_pow ~> single_valued_relpow 

47463  1201 

46363  1202 
INCOMPATIBILITY. 
1203 

47448  1204 
* Theory Relation: Consolidated constant name for relation composition 
47464  1205 
and corresponding theorem names: 
1206 

47549  1207 
 Renamed constant rel_comp to relcomp. 
47464  1208 

47448  1209 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  1210 

47448  1211 
 Renamed theorems: 
47464  1212 

47448  1213 
rel_compI ~> relcompI 
1214 
rel_compEpair ~> relcompEpair 

1215 
rel_compE ~> relcompE 

1216 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

1217 
rel_comp_empty1 ~> relcomp_empty1 

1218 
rel_comp_mono ~> relcomp_mono 

1219 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

1220 
rel_comp_distrib ~> relcomp_distrib 

1221 
rel_comp_distrib2 ~> relcomp_distrib2 

1222 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

1223 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

1224 
single_valued_rel_comp ~> single_valued_relcomp 

47549  1225 
rel_comp_def ~> relcomp_unfold 
47448  1226 
converse_rel_comp ~> converse_relcomp 
1227 
pred_compI ~> relcomppI 

1228 
pred_compE ~> relcomppE 

1229 
pred_comp_bot1 ~> relcompp_bot1 

1230 
pred_comp_bot2 ~> relcompp_bot2 

1231 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

1232 
pred_comp_mono ~> relcompp_mono 

1233 
pred_comp_distrib ~> relcompp_distrib 

1234 
pred_comp_distrib2 ~> relcompp_distrib2 

1235 
converse_pred_comp ~> converse_relcompp 

47464  1236 

47448  1237 
finite_rel_comp ~> finite_relcomp 
47464  1238 

47448  1239 
set_rel_comp ~> set_relcomp 
1240 

1241 
INCOMPATIBILITY. 

1242 

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

1245 

1246 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

1247 
zdiv_self ~> div_self 

1248 
zmod_self ~> mod_self 

1249 
zdiv_zero ~> div_0 

1250 
zmod_zero ~> mod_0 

1251 
zdiv_zmod_equality ~> div_mod_equality2 

1252 
zdiv_zmod_equality2 ~> div_mod_equality 

1253 
zmod_zdiv_trivial ~> mod_div_trivial 

1254 
zdiv_zminus_zminus ~> div_minus_minus 

1255 
zmod_zminus_zminus ~> mod_minus_minus 

1256 
zdiv_zminus2 ~> div_minus_right 

1257 
zmod_zminus2 ~> mod_minus_right 

1258 
zdiv_minus1_right ~> div_minus1_right 

1259 
zmod_minus1_right ~> mod_minus1_right 

1260 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

1261 
zmod_zmult1_eq ~> mod_mult_right_eq 

1262 
zpower_zmod ~> power_mod 

1263 
zdvd_zmod ~> dvd_mod 

1264 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

1265 
mod_mult_distrib ~> mult_mod_left 

1266 
mod_mult_distrib2 ~> mult_mod_right 

1267 

1268 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

1269 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

1270 

47551  1271 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
1272 

47552  1273 
* Consolidated theorem names concerning fold combinators: 
47550  1274 

1275 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

1276 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

1277 
INFI_fold_inf ~> INF_fold_inf 

1278 
SUPR_fold_sup ~> SUP_fold_sup 

1279 
union_set ~> union_set_fold 

1280 
minus_set ~> minus_set_fold 

1281 
INFI_set_fold ~> INF_set_fold 

1282 
SUPR_set_fold ~> SUP_set_fold 

1283 
INF_code ~> INF_set_foldr 

1284 
SUP_code ~> SUP_set_foldr 

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

1286 
foldr_fold_rev ~> foldr_conv_fold 

1287 
foldl_fold ~> foldl_conv_fold 

1288 
foldr_foldr ~> foldr_conv_foldl 

1289 
foldl_foldr ~> foldl_conv_foldr 

47552  1290 
fold_set_remdups ~> fold_set_fold_remdups 
1291 
fold_set ~> fold_set_fold 

1292 
fold1_set ~> fold1_set_fold 

47550  1293 

1294 
INCOMPATIBILITY. 

1295 

1296 
* Dropped rarely useful theorems concerning fold combinators: 

1297 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

1298 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

1299 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

1300 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

1301 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

1302 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

1306 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

1307 

1308 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

1309 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

1310 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

1311 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

1313 
fold_conv_foldr and fold_rev. 

1314 

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

1316 
through option types. 

1317 

47856  1318 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
1319 
relations. 

1320 

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

1322 

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

1324 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

1325 

1326 
zminus_zminus ~> minus_minus 

1327 
zminus_0 ~> minus_zero 

1328 
zminus_zadd_distrib ~> minus_add_distrib 

1329 
zadd_commute ~> add_commute 

1330 
zadd_assoc ~> add_assoc 

1331 
zadd_left_commute ~> add_left_commute 

1332 
zadd_ac ~> add_ac 

1333 
zmult_ac ~> mult_ac 

1334 
zadd_0 ~> add_0_left 

1335 
zadd_0_right ~> add_0_right 

1336 
zadd_zminus_inverse2 ~> left_minus 

1337 
zmult_zminus ~> mult_minus_left 

1338 
zmult_commute ~> mult_commute 

1339 
zmult_assoc ~> mult_assoc 

1340 
zadd_zmult_distrib ~> left_distrib 

1341 
zadd_zmult_distrib2 ~> right_distrib 

1342 
zdiff_zmult_distrib ~> left_diff_distrib 

1343 
zdiff_zmult_distrib2 ~> right_diff_distrib 

1344 
zmult_1 ~> mult_1_left 

1345 
zmult_1_right ~> mult_1_right 

1346 
zle_refl ~> order_refl 

1347 
zle_trans ~> order_trans 

1348 
zle_antisym ~> order_antisym 

1349 
zle_linear ~> linorder_linear 

1350 
zless_linear ~> linorder_less_linear 

1351 
zadd_left_mono ~> add_left_mono 

1352 
zadd_strict_right_mono ~> add_strict_right_mono 

1353 
zadd_zless_mono ~> add_less_le_mono 

1354 
int_0_less_1 ~> zero_less_one 

1355 
int_0_neq_1 ~> zero_neq_one 

1356 
zless_le ~> less_le 

1357 
zpower_zadd_distrib ~> power_add 

1358 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

1359 
zero_le_zpower_abs ~> zero_le_power_abs 

1360 

1361 
* Theory Deriv: Renamed 

1362 

1363 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

1364 

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

1366 

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

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

1371 
INCOMPATIBILITY. 

1372 

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

1375 

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

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

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

1380 
follows: 

47452  1381 

1382 
Operations: 

1383 
bulkload > rbt_bulkload 

1384 
del_from_left > rbt_del_from_left 

1385 
del_from_right > rbt_del_from_right 

1386 
del > rbt_del 

1387 
delete > rbt_delete 

1388 
ins > rbt_ins 

1389 
insert > rbt_insert 

1390 
insertw > rbt_insert_with 

1391 
insert_with_key > rbt_insert_with_key 

1392 
map_entry > rbt_map_entry 

1393 
lookup > rbt_lookup 

1394 
sorted > rbt_sorted 

1395 
tree_greater > rbt_greater 

1396 
tree_less > rbt_less 

1397 
tree_less_symbol > rbt_less_symbol 

1398 
union > rbt_union 

1399 
union_with > rbt_union_with 

1400 
union_with_key > rbt_union_with_key 

1401 

1402 
Lemmas: 

1403 
balance_left_sorted > balance_left_rbt_sorted 

1404 
balance_left_tree_greater > balance_left_rbt_greater 

1405 
balance_left_tree_less > balance_left_rbt_less 

1406 
balance_right_sorted > balance_right_rbt_sorted 

1407 
balance_right_tree_greater > balance_right_rbt_greater 

1408 
balance_right_tree_less > balance_right_rbt_less 

1409 
balance_sorted > balance_rbt_sorted 

1410 
balance_tree_greater > balance_rbt_greater 

1411 
balance_tree_less > balance_rbt_less 

1412 
bulkload_is_rbt > rbt_bulkload_is_rbt 

1413 
combine_sorted > combine_rbt_sorted 

1414 
combine_tree_greater > combine_rbt_greater 

1415 
combine_tree_less > combine_rbt_less 

1416 
delete_in_tree > rbt_delete_in_tree 

1417 
delete_is_rbt > rbt_delete_is_rbt 

1418 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

1419 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

1420 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

1421 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

1422 
del_in_tree > rbt_del_in_tree 

1423 
del_inv1_inv2 > rbt_del_inv1_inv2 

1424 
del_sorted > rbt_del_rbt_sorted 

1425 
del_tree_greater > rbt_del_rbt_greater 

1426 
del_tree_less > rbt_del_rbt_less 

1427 
dom_lookup_Branch > dom_rbt_lookup_Branch 

1428 
entries_lookup > entries_rbt_lookup 

1429 
finite_dom_lookup > finite_dom_rbt_lookup 

1430 
insert_sorted > rbt_insert_rbt_sorted 
