author  wenzelm 
Thu, 27 Jun 2013 10:35:37 +0200  
changeset 52463  c45a6939217f 
parent 52445  18a720984855 
child 52470  dedd7952a62c 
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 

52059  9 
* Uniform management of "quick_and_dirty" as system option (see also 
10 
"isabelle options"), configuration option within the context (see also 

11 
Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor 

12 
INCOMPATIBILITY, need to use more official Isabelle means to access 

13 
quick_and_dirty, instead of historical poking into mutable reference. 

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 

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

39 

51533  40 
*** Prover IDE  Isabelle/Scala/jEdit *** 
41 

52445  42 
* Dockable window "Documentation" provides access to Isabelle 
43 
documentation. 

44 

51533  45 
* Dockable window "Timing" provides an overview of relevant command 
46 
timing information. 

47 

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

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

49 

51533  50 

51313  51 
*** Pure *** 
52 

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

55 
now the default. Minor INCOMPATIBILITY. 

56 

51747  57 
* Targetsensitive commands 'interpretation' and 'sublocale'. 
58 
Particulary, 'interpretation' now allows for nonpersistent 

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

60 
See "isarref" manual for details. 

61 

51565  62 
* Improved locales diagnostic command 'print_dependencies'. 
63 

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

66 
instead, while observing its uniform scope for polymorphism. 

67 

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

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

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

70 

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

73 
situations. 

74 

51313  75 

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

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

77 

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

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

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

80 
* '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

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

82 
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

83 

52380  84 
* Library/Polynomial.thy: 
85 
* Use lifting for primitive definitions. 

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

87 
* Replaced recursion operator poly_rec by fold_coeffs. 

88 
* Prefer preexisting gcd operation for gcd. 

89 
* Fact renames: 

90 
poly_eq_iff ~> poly_eq_poly_eq_iff 

91 
poly_ext ~> poly_eqI 

92 
expand_poly_eq ~> poly_eq_iff 

93 
IMCOMPATIBILTIY. 

94 

52286  95 
* Reification and reflection: 
96 
* Reification is now directly available in HOLMain in structure "Reification". 

97 
* Reflection now handles multiple lists with variables also. 

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

99 
INCOMPATIBILITY. 

100 

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

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

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

103 

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

106 
is separated from the datatype package. The declaration attribute 

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

108 

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

110 

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

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

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

116 
This is now identity on infinite sets. 

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

118 
Finite_Set.fold: folding, folding_idem. 

119 
 Locales comm_monoid_set, semilattice_order_set and 

120 
semilattice_neutr_order_set for big operators on sets. 

121 
See theory Big_Operators for canonical examples. 

122 
Note that foundational constants comm_monoid_set.F and 

123 
semilattice_set.F correspond to former combinators fold_image 

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

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

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

129 
 Fact renames: 

130 
card.union_inter ~> card_Un_Int [symmetric] 

131 
card.union_disjoint ~> card_Un_disjoint 

132 

133 
INCOMPATIBILITY. 

134 

51487  135 
* Locale hierarchy for abstract orderings and (semi)lattices. 
136 

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

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

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

139 

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

142 

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

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

144 
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

145 
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

146 
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

147 
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

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

149 

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

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

151 
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

152 
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

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

154 

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

158 
Removed SupInf and replaced it by the instantiation of 

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

161 
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

162 

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

163 
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

164 
lattices and inner dense linorders which have more than one element. 
51732  165 
INCOMPATIBILITY. 
166 

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

168 
and bottom elements. 

169 

170 
* Split dense_linorder into inner_dense_order and no_top, no_bot. 

171 

172 
* Complex_Main: Unify and move various concepts from 

173 
HOLMultivariate_Analysis to HOLComplex_Main. 

174 

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

175 
 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

176 
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

177 
Instances are reals and extended reals. 
51732  178 

179 
 continuous and continuos_on from Multivariate_Analysis: 

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

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

182 

183 
Generalized continuity lemmas from isCont to continuous on an arbitrary 

184 
filter. 

185 

186 
 compact from Multivariate_Analysis. Use Bolzano's lemma 

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

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

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

190 

191 
 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

192 
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

193 
linear_continuum_topology). 
51732  194 

195 
 first_countable_topology from Multivariate_Analysis. Is used to 

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

197 
all sequences converging to x. 

198 

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

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

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

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

203 

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

205 

206 
F within X = inf F (principal X) 

207 

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

209 
abbreviation for "at x within UNIV" 

210 

211 
 Introduce named theorem collections tendsto_intros, continuous_intros, 

212 
continuous_on_intros and FDERIV_intros. Theorems in tendsto_intros (or 

213 
FDERIV_intros) are also available as tendsto_eq_intros (or 

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

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

216 
equivalence by the simplifier. 

217 

218 
 Restructured theories in HOLComplex_Main: 

219 

220 
+ Moved RealDef and RComplete into Real 

221 

222 
+ Introduced Topological_Spaces and moved theorems about 

223 
topological spaces, filters, limits and continuity to it 

224 

225 
+ Renamed RealVector to Real_Vector_Spaces 

226 

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

228 
Limits 

229 

230 
+ Moved Ln and Log to Transcendental 

231 

232 
+ Moved theorems about continuity from Deriv to Topological_Spaces 

233 

234 
 Remove various auxiliary lemmas. 

235 

236 
INCOMPATIBILITY. 

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

237 

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

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

239 

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

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

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

242 

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

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

244 

51137  245 
* Sledgehammer: 
246 

247 
 Renamed option: 

248 
isar_shrink ~> isar_compress 

249 

52266  250 
* HOLSpec_Check: a Quickcheck tool for Isabelle's ML environment. 
251 

252 
With HOLSpec_Check, ML developers can check specifications with the 

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

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

255 
src/HOL/Spec_Check/Examples.thy. 

256 

50994  257 

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

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

259 

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

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

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

262 
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

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

264 

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

265 

51551  266 
*** ML *** 
267 

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

269 

270 
Skip_Proof.prove ~> Goal.prove_sorry 

271 
Skip_Proof.prove_global ~> Goal.prove_sorry_global 

272 

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

275 

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

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

277 
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

278 
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

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

280 

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

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

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

283 
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

284 
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

285 
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

286 
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

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

288 

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

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

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

291 

51551  292 

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

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

294 

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

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

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

297 

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

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

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

300 

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

303 

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

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

305 
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

306 

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

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

308 
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

309 
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

310 

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

311 

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

312 

50993  313 
New in Isabelle2013 (February 2013) 
314 
 

47887  315 

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

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

317 

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

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

319 
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

320 
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

321 
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

322 
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

323 
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

324 
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

325 

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

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

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

330 

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

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

332 
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

333 

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

336 
Tools that load their additional source files may imitate the 

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

338 
dependencies properly. 

339 

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

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

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

342 

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

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

345 

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

49841  348 
and "class ... context ...". 
349 

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

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

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

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

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

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

356 

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

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

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

359 

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

362 

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

363 

49968  364 
*** Prover IDE  Isabelle/Scala/jEdit *** 
365 

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

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

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

369 
surface, while the prover is still crunching on internal 

370 
justifications. Unfinished / cancelled proofs are restarted as 

371 
required to complete full proof checking eventually. 

372 

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

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

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

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

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

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

379 

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

382 
browser on demand. 

383 

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

386 
comment delimiters works more conveniently with unfinished situations 

387 
that frequently occur in user interaction. 

388 

389 
* More efficient painting and improved reactivity when editing large 

390 
files. More scalable management of formal document content. 

391 

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

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

393 
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

394 
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

395 
potentially infinite message streams. 
49968  396 

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

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

399 
options, including tuning parameters for editor reactivity and color 

400 
schemes. 

401 

50184  402 
* Dockable window "Symbols" provides some editing support for Isabelle 
403 
symbols. 

404 

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

50701  407 

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

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

411 

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

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

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

50183  416 

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

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

420 

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

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

422 
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

423 
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

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

425 

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

428 
now bundled exclusively with Isabelle. 

429 

430 

48205  431 
*** Pure *** 
432 

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

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

434 
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

435 

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

438 
rather arbitrary current working directory. INCOMPATIBILITY. 

48371  439 

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

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

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

444 
with some care where this is really required. 

445 

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

51063  448 
given sort. Example (in HOL): 
48792  449 

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

451 

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

454 

48205  455 

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

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

457 

50646  458 
* Sledgehammer: 
459 

460 
 Added MaSh relevance filter based on machinelearning; see the 

461 
Sledgehammer manual for details. 

462 
 Polished Isar proofs generated with "isar_proofs" option. 

463 
 Rationalized type encodings ("type_enc" option). 

50720  464 
 Renamed "kill_provers" subcommand to "kill_all". 
50646  465 
 Renamed options: 
466 
isar_proof ~> isar_proofs 

467 
isar_shrink_factor ~> isar_shrink 

468 
max_relevant ~> max_facts 

469 
relevance_thresholds ~> fact_thresholds 

470 

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

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

473 
configuration quickcheck_optimise_equality to false. 

474 

50878  475 
* Quotient: only one quotient can be defined by quotient_type 
476 
INCOMPATIBILITY. 

477 

478 
* Lifting: 

479 
 generation of an abstraction function equation in lift_definition 

480 
 quot_del attribute 

481 
 renamed no_abs_code > no_code (INCOMPATIBILITY.) 

482 

50646  483 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
484 
expressions. 

485 

486 
* Preprocessing of the code generator rewrites set comprehensions into 

487 
pointfree expressions. 

488 

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

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

491 
arithmetic, datatypes/records) with potential proof reconstruction 

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

493 
INCOMPATIBILITY. 

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

494 

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

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

496 
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

497 
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

498 
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

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

500 

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

503 

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

505 
List. INCOMPATIBILITY. 

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

506 

49739  507 
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. 
508 

49738  509 
* Class "comm_monoid_diff" formalises properties of bounded 
49388  510 
subtraction, with natural numbers and multisets as typical instances. 
511 

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

514 
* Theory "Transitive_Closure": renamed lemmas 

515 

516 
reflcl_tranclp > reflclp_tranclp 

517 
rtranclp_reflcl > rtranclp_reflclp 

518 

519 
INCOMPATIBILITY. 

520 

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

522 

523 
left_distrib ~> distrib_right 

524 
right_distrib ~> distrib_left 

525 

526 
INCOMPATIBILITY. 

527 

528 
* Generalized the definition of limits: 

529 

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

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

532 
output f x converges to G. 

533 

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

535 
infinity (at_bot). 

536 

537 
 Moved infinity in the norm (at_infinity) from 

538 
Multivariate_Analysis to Complex_Main. 

539 

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

541 
at_top". 

542 

543 
INCOMPATIBILITY. 

544 

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

546 
lattice type classes. 

547 

548 
* Theory "Library/Multiset": renamed 

549 

550 
constant fold_mset ~> Multiset.fold 

551 
fact fold_mset_commute ~> fold_mset_comm 

552 

553 
INCOMPATIBILITY. 

554 

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

556 
changes as follows. 

557 

558 
 Renamed constants (and related lemmas) 

49145  559 

560 
prefix ~> prefixeq 

561 
strict_prefix ~> prefix 

562 

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

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

566 
Renamed lemmas accordingly. 

567 

568 
 Added constant "list_hembeq" for homeomorphic embedding on 

569 
lists. Added abbreviation "sublisteq" for special case 

570 
"list_hembeq (op =)". 

571 

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

573 
class instances for the prefix order (merely corresponding locale 

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

575 
Library/Prefix_Order. 

576 

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

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

50516  579 

580 
le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff 

581 
le_list_append_mono ~> Sublist.list_hembeq_append_mono 

582 
le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2 

583 
le_list_Cons_EX ~> Sublist.list_hembeq_ConsD 

584 
le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2' 

585 
le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq 

586 
le_list_drop_Cons ~> Sublist.sublisteq_Cons' 

587 
le_list_drop_many ~> Sublist.sublisteq_drop_many 

588 
le_list_filter_left ~> Sublist.sublisteq_filter_left 

589 
le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many 

590 
le_list_rev_take_iff ~> Sublist.sublisteq_append 

591 
le_list_same_length ~> Sublist.sublisteq_same_length 

592 
le_list_take_many_iff ~> Sublist.sublisteq_append' 

49145  593 
less_eq_list.drop ~> less_eq_list_drop 
594 
less_eq_list.induct ~> less_eq_list_induct 

50516  595 
not_le_list_length ~> Sublist.not_sublisteq_length 
49145  596 

50646  597 
INCOMPATIBILITY. 
598 

599 
* New theory Library/Countable_Set. 

600 

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

602 
parallel execution for code generated towards Isabelle/ML. 

603 

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

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

606 
extensional_funcset by an abbreviation, and renamed lemmas from 

607 
extensional_funcset to PiE as follows: 

608 

609 
extensional_empty ~> PiE_empty 

610 
extensional_funcset_empty_domain ~> PiE_empty_domain 

611 
extensional_funcset_empty_range ~> PiE_empty_range 

612 
extensional_funcset_arb ~> PiE_arb 

613 
extensional_funcset_mem ~> PiE_mem 

614 
extensional_funcset_extend_domainI ~> PiE_fun_upd 

615 
extensional_funcset_restrict_domain ~> fun_upd_in_PiE 

616 
extensional_funcset_extend_domain_eq ~> PiE_insert_eq 

617 
card_extensional_funcset ~> card_PiE 

618 
finite_extensional_funcset ~> finite_PiE 

619 

620 
INCOMPATIBILITY. 

621 

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

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

624 
Data"). 

625 

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

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

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

629 
code. 

630 

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

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

633 
return a structurally different tree than before. Potential 

634 
INCOMPATIBILITY. 

635 

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

637 

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

639 

640 
* HOL/Multivariate_Analysis: replaced 

641 

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

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

644 

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

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

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

648 

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

650 

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

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

653 
cart_base i removed 

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

655 

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

656 
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

657 

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

658 
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

659 

50646  660 
component_le_norm ~> Basis_le_norm 
661 
euclidean_eq ~> euclidean_eq_iff 

662 
differential_zero_maxmin_component ~> differential_zero_maxmin_cart 

663 
euclidean_simps ~> inner_simps 

664 
independent_basis ~> independent_Basis 

665 
span_basis ~> span_Basis 

666 
in_span_basis ~> in_span_Basis 

667 
norm_bound_component_le ~> norm_boound_Basis_le 

668 
norm_bound_component_lt ~> norm_boound_Basis_lt 

669 
component_le_infnorm ~> Basis_le_infnorm 

670 

671 
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

672 

50141  673 
* HOL/Probability: 
50646  674 

675 
 Added simproc "measurable" to automatically prove measurability. 

676 

677 
 Added induction rules for sigma sets with disjoint union 

678 
(sigma_sets_induct_disjoint) and for Borelmeasurable functions 

679 
(borel_measurable_induct). 

680 

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

682 
projective family). 

683 

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

685 
AFP entry "Ordinals_and_Cardinals"). 

686 

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

688 
with support for mixed, nested recursion and interesting nonfree 

689 
datatypes. 

48094  690 

50991  691 
* HOL/Finite_Set and Relation: added new set and relation operations 
50878  692 
expressed by Finite_Set.fold. 
693 

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

695 
trees for the code generator. 

696 

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

698 
Lifting/Transfer. 

699 
possible INCOMPATIBILITY. 

700 

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

702 
INCOMPATIBILITY. 

703 

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

704 

48206  705 
*** Document preparation *** 
706 

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

709 
Discontinued legacy styles "prem1" .. "prem19". 

710 

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

712 
instead of slightly exotic babel/greek. 

48206  713 

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

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

715 
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

716 
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

717 

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

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

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

720 

48206  721 

48992  722 
*** ML *** 
723 

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

726 
hardware and Poly/ML runtime system. 

727 

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

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

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

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

731 

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

734 
necessarily printing visible text. 

735 

736 

48206  737 
*** System *** 
738 

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

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

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

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

744 
document preparation as well. INCOMPATIBILITY, isabelle usedir / 

48736  745 
mkdir / make are rendered obsolete. 
746 

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

749 

750 
isabelle build s b HOL 

751 

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

753 

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

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

755 
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

756 
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

757 
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

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

759 

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

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

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

762 

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

765 

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

767 
INCOMPATIBILITY. 

768 

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

771 
version of Isabelle. 

772 

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

775 

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

777 
picked up from some surrounding directory. Potential INCOMPATIBILITY 

778 
for homemade settings. 

50132  779 

50701  780 
* Improved ML runtime statistics (heap, threads, future tasks etc.). 
781 

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

784 
configuration. 

785 

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

788 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

790 
bundled as Isabelle component. 

48206  791 

50182  792 

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

793 

47462  794 
New in Isabelle2012 (May 2012) 
795 
 

45109  796 

45593  797 
*** General *** 
798 

45614  799 
* Prover IDE (PIDE) improvements: 
800 

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

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

45614  808 

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

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

46485  812 

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

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

814 
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

815 
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

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

817 
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

818 

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

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

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

821 
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

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

823 

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

824 
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

825 

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

826 
end 
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 
thm my_trans 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

829 

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

830 
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

831 
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

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

833 

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

834 
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

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

836 

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

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

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

47484  842 

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

845 
oldstyle "standard" after instantiation or composition of facts 

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

847 
indices of schematic variables. 

848 

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

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

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

852 
the historic accident of dynamic reevaluation in interpretations 

853 
etc. was exploited. 

854 

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

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

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

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

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

860 
of the material of that old tutorial. 

861 

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

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

864 
manual. 

865 

866 

867 
*** Pure *** 

868 

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

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

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

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

872 

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

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

876 
undocumented feature.) 

877 

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

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

881 

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

883 

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

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

886 

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

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

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

890 
order to accommodate newly introduced premises.) 

891 

47806  892 
* Renamed some inner syntax categories: 
893 

894 
num ~> num_token 

895 
xnum ~> xnum_token 

896 
xstr ~> str_token 

897 

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

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

900 
position information via constraints). 

901 

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

904 
manual. Minor INCOMPATIBILITY. 

905 

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

45134  908 

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

911 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  912 

47464  913 
* Redundant attribute "code_inline" has been discontinued. Use 
914 
"code_unfold" instead. INCOMPATIBILITY. 

915 

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

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

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

918 

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

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

920 

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

921 
INCOMPATIBILITY. 
45383  922 

47856  923 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
924 
instead. INCOMPATIBILITY. 

925 

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

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

928 
legacy since Isabelle2011). 

47855  929 

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

930 

45122  931 
*** HOL *** 
932 

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

935 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

940 
tinkering with former theorems mem_def and Collect_def as far as 

941 
possible. 

942 

943 
For developments which deliberately mix predicates and sets, a 

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

946 
Isabelle20111 before jumping right into the current release. 

947 

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

950 

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

952 

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

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

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

958 
user theories may require adaptations as follows: 

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

959 

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

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

961 
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

962 

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

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

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

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

966 

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

967 
 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

968 
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

969 

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

970 
 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

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

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

973 

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

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

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

976 

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

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

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

981 
corresponding parts of the Quotient package.) 

47809  982 

983 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

985 
relate different type instances of the same polymorphic constant, 

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

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

988 

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

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

991 

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

993 
equivalent subgoal on the corresponding raw types. Constants are 

994 
replaced with corresponding ones according to the transfer rules. 

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

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

1000 

1001 
 relator_eq attribute: Collects identity laws for relators of 

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

1003 
transfer method uses these lemmas to infer transfer rules for 

1004 
nonpolymorphic constants on the fly. 

1005 

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

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

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

1009 
after unfolding the constant definitions. 

1010 

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

1012 
from type nat to type int. 

1013 

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

47809  1016 

1017 
 lift_definition command: Defines operations on an abstract type in 

1018 
terms of a corresponding operation on a representation 

1019 
type. Example syntax: 

1020 

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

1022 
is List.insert 

1023 

1024 
Users must discharge a respectfulness proof obligation when each 

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

1026 
the proof is discharged automatically.) The obligation is 

1027 
presented in a userfriendly, readable form; a respectfulness 

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

1029 
by the package. 

1030 

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

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

1033 
lift_definition generates a code certificate theorem and sets up 

1034 
code generation for each constant. 

1035 

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

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

1038 
or a type_definition theorem. The package configures transfer 

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

1040 
lift_definition command to work with the type. 

1041 

1042 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  1043 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
1044 
Word/Word.thy and Library/Float.thy. 

47809  1045 

1046 
* Quotient package: 

1047 

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

1049 
rep and abs functions, similar to typedef. 

1050 

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

1052 
Transfer packages, as with 'setup_lifting'. 

1053 

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

1055 
respectfulness property at the point where the constant is 

1056 
defined, similar to lift_definition; INCOMPATIBILITY. 

1057 

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

1059 
accordingly, INCOMPATIBILITY. 

1060 

1061 
* New diagnostic command 'find_unused_assms' to find potentially 

1062 
superfluous assumptions in theorems using Quickcheck. 

1063 

1064 
* Quickcheck: 

1065 

1066 
 Quickcheck returns variable assignments as counterexamples, which 

1067 
allows to reveal the underspecification of functions under test. 

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

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

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

1071 

1072 
These counterexample are marked as potentially spurious, as 

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

1074 
obvious theorem "hd xs = hd xs". 

1075 

1076 
After finding a potentially spurious counterexample, Quickcheck 

1077 
continues searching for genuine ones. 

1078 

1079 
By default, Quickcheck shows potentially spurious and genuine 

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

1081 
show genuine counterexamples. 

1082 

1083 
 The command 'quickcheck_generator' creates random and exhaustive 

1084 
value generators for a given type and operations. 

1085 

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

1087 
constructors of that type. 

1088 

1089 
 Support for multisets. 

1090 

1091 
 Added "use_subtype" options. 

1092 

1093 
 Added "quickcheck_locale" configuration to specify how to process 

1094 
conjectures in a locale context. 

1095 

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

47809  1098 

1099 
* Sledgehammer: 

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

1101 
paper "More SPASS with Isabelle". 

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

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

1104 
TFF1), iProver, iProverEq. 

1105 
 Sped up the minimizer. 

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

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

1108 
 Renamed "sound" option to "strict". 

1109 

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

1112 

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

1114 

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

47809  1116 

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

1119 

1120 
list.exhaust [case_product nat.exhaust] 

1121 

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

1123 
a list and a nat. 

1124 

47809  1125 
* New "eventually_elim" method as a generalized variant of the 
47855  1126 
eventually_elim* rules. Supports structured proofs. 
1127 

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

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

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

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

1131 

47856  1132 
* Record: code generation can be switched off manually with 
1133 

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

1135 

1136 
* Datatype: type parameters allow explicit sort constraints. 

1137 

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

1140 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

1142 
one_case. 

1143 

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

1145 
the result of the fact expression. 

1146 

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

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

1150 

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

1151 
converse_def ~> converse_unfold 
47549  1152 
rel_comp_def ~> relcomp_unfold 
47820  1153 
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

1154 
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

1155 
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

1156 
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

1157 

46981  1158 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
1159 

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

47086  1162 

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

1164 

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

46458  1168 
rel_pow_1 ~> relpow_1 
46363  1169 
rel_pow_0_I ~> relpow_0_I 
1170 
rel_pow_Suc_I ~> relpow_Suc_I 

1171 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

1172 
rel_pow_0_E ~> relpow_0_E 

1173 
rel_pow_Suc_E ~> relpow_Suc_E 

1174 
rel_pow_E ~> relpow_E 

46458  1175 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  1176 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  1177 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
1178 
rel_pow_E2 ~> relpow_E2 

1179 
rel_pow_add ~> relpow_add 

1180 
rel_pow_commute ~> relpow 

1181 
rel_pow_empty ~> relpow_empty: 

1182 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

1183 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

1184 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

1185 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

1186 
rel_pow_fun_conv ~> relpow_fun_conv 

1187 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

1188 
rel_pow_finite_bounded ~> relpow_finite_bounded 

1189 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

1190 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

1191 
single_valued_rel_pow ~> single_valued_relpow 

47463  1192 

46363  1193 
INCOMPATIBILITY. 
1194 

47448  1195 
* Theory Relation: Consolidated constant name for relation composition 
47464  1196 
and corresponding theorem names: 
1197 

47549  1198 
 Renamed constant rel_comp to relcomp. 
47464  1199 

47448  1200 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  1201 

47448  1202 
 Renamed theorems: 
47464  1203 

47448  1204 
rel_compI ~> relcompI 
1205 
rel_compEpair ~> relcompEpair 

1206 
rel_compE ~> relcompE 

1207 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

1208 
rel_comp_empty1 ~> relcomp_empty1 

1209 
rel_comp_mono ~> relcomp_mono 

1210 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

1211 
rel_comp_distrib ~> relcomp_distrib 

1212 
rel_comp_distrib2 ~> relcomp_distrib2 

1213 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

1214 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

1215 
single_valued_rel_comp ~> single_valued_relcomp 

47549  1216 
rel_comp_def ~> relcomp_unfold 
47448  1217 
converse_rel_comp ~> converse_relcomp 
1218 
pred_compI ~> relcomppI 

1219 
pred_compE ~> relcomppE 

1220 
pred_comp_bot1 ~> relcompp_bot1 

1221 
pred_comp_bot2 ~> relcompp_bot2 

1222 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

1223 
pred_comp_mono ~> relcompp_mono 

1224 
pred_comp_distrib ~> relcompp_distrib 

1225 
pred_comp_distrib2 ~> relcompp_distrib2 

1226 
converse_pred_comp ~> converse_relcompp 

47464  1227 

47448  1228 
finite_rel_comp ~> finite_relcomp 
47464  1229 

47448  1230 
set_rel_comp ~> set_relcomp 
1231 

1232 
INCOMPATIBILITY. 

1233 

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

1236 

1237 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

1238 
zdiv_self ~> div_self 

1239 
zmod_self ~> mod_self 

1240 
zdiv_zero ~> div_0 

1241 
zmod_zero ~> mod_0 

1242 
zdiv_zmod_equality ~> div_mod_equality2 

1243 
zdiv_zmod_equality2 ~> div_mod_equality 

1244 
zmod_zdiv_trivial ~> mod_div_trivial 

1245 
zdiv_zminus_zminus ~> div_minus_minus 

1246 
zmod_zminus_zminus ~> mod_minus_minus 

1247 
zdiv_zminus2 ~> div_minus_right 

1248 
zmod_zminus2 ~> mod_minus_right 

1249 
zdiv_minus1_right ~> div_minus1_right 

1250 
zmod_minus1_right ~> mod_minus1_right 

1251 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

1252 
zmod_zmult1_eq ~> mod_mult_right_eq 

1253 
zpower_zmod ~> power_mod 

1254 
zdvd_zmod ~> dvd_mod 

1255 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

1256 
mod_mult_distrib ~> mult_mod_left 

1257 
mod_mult_distrib2 ~> mult_mod_right 

1258 

1259 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

1260 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

1261 

47551  1262 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
1263 

47552  1264 
* Consolidated theorem names concerning fold combinators: 
47550  1265 

1266 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

1267 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

1268 
INFI_fold_inf ~> INF_fold_inf 

1269 
SUPR_fold_sup ~> SUP_fold_sup 

1270 
union_set ~> union_set_fold 

1271 
minus_set ~> minus_set_fold 

1272 
INFI_set_fold ~> INF_set_fold 

1273 
SUPR_set_fold ~> SUP_set_fold 

1274 
INF_code ~> INF_set_foldr 

1275 
SUP_code ~> SUP_set_foldr 

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

1277 
foldr_fold_rev ~> foldr_conv_fold 

1278 
foldl_fold ~> foldl_conv_fold 

1279 
foldr_foldr ~> foldr_conv_foldl 

1280 
foldl_foldr ~> foldl_conv_foldr 

47552  1281 
fold_set_remdups ~> fold_set_fold_remdups 
1282 
fold_set ~> fold_set_fold 

1283 
fold1_set ~> fold1_set_fold 

47550  1284 

1285 
INCOMPATIBILITY. 

1286 

1287 
* Dropped rarely useful theorems concerning fold combinators: 

1288 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

1289 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

1290 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

1291 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

1292 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

1293 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

1297 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

1298 

1299 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

1300 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

1301 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

1302 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

1304 
fold_conv_foldr and fold_rev. 

1305 

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

1307 
through option types. 

1308 

47856  1309 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
1310 
relations. 

1311 

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

1313 

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

1315 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

1316 

1317 
zminus_zminus ~> minus_minus 

1318 
zminus_0 ~> minus_zero 

1319 
zminus_zadd_distrib ~> minus_add_distrib 

1320 
zadd_commute ~> add_commute 

1321 
zadd_assoc ~> add_assoc 

1322 
zadd_left_commute ~> add_left_commute 

1323 
zadd_ac ~> add_ac 

1324 
zmult_ac ~> mult_ac 

1325 
zadd_0 ~> add_0_left 

1326 
zadd_0_right ~> add_0_right 

1327 
zadd_zminus_inverse2 ~> left_minus 

1328 
zmult_zminus ~> mult_minus_left 

1329 
zmult_commute ~> mult_commute 

1330 
zmult_assoc ~> mult_assoc 

1331 
zadd_zmult_distrib ~> left_distrib 

1332 
zadd_zmult_distrib2 ~> right_distrib 

1333 
zdiff_zmult_distrib ~> left_diff_distrib 

1334 
zdiff_zmult_distrib2 ~> right_diff_distrib 

1335 
zmult_1 ~> mult_1_left 

1336 
zmult_1_right ~> mult_1_right 

1337 
zle_refl ~> order_refl 

1338 
zle_trans ~> order_trans 

1339 
zle_antisym ~> order_antisym 

1340 
zle_linear ~> linorder_linear 

1341 
zless_linear ~> linorder_less_linear 

1342 
zadd_left_mono ~> add_left_mono 

1343 
zadd_strict_right_mono ~> add_strict_right_mono 

1344 
zadd_zless_mono ~> add_less_le_mono 

1345 
int_0_less_1 ~> zero_less_one 

1346 
int_0_neq_1 ~> zero_neq_one 

1347 
zless_le ~> less_le 

1348 
zpower_zadd_distrib ~> power_add 

1349 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

1350 
zero_le_zpower_abs ~> zero_le_power_abs 

1351 

1352 
* Theory Deriv: Renamed 

1353 

1354 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

1355 

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

1357 

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

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

1362 
INCOMPATIBILITY. 

1363 

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

1366 

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

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

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

1371 
follows: 

47452  1372 

1373 
Operations: 

1374 
bulkload > rbt_bulkload 

1375 
del_from_left > rbt_del_from_left 

1376 
del_from_right > rbt_del_from_right 

1377 
del > rbt_del 

1378 
delete > rbt_delete 

1379 
ins > rbt_ins 

1380 
insert > rbt_insert 

1381 
insertw > rbt_insert_with 

1382 
insert_with_key > rbt_insert_with_key 

1383 
map_entry > rbt_map_entry 

1384 
lookup > rbt_lookup 

1385 
sorted > rbt_sorted 

1386 
tree_greater > rbt_greater 

1387 
tree_less > rbt_less 

1388 
tree_less_symbol > rbt_less_symbol 

1389 
union > rbt_union 

1390 
union_with > rbt_union_with 

1391 
union_with_key > rbt_union_with_key 

1392 

1393 
Lemmas: 

1394 
balance_left_sorted > balance_left_rbt_sorted 

1395 
balance_left_tree_greater > balance_left_rbt_greater 

1396 
balance_left_tree_less > balance_left_rbt_less 

1397 
balance_right_sorted > balance_right_rbt_sorted 

1398 
balance_right_tree_greater > balance_right_rbt_greater 

1399 
balance_right_tree_less > balance_right_rbt_less 

1400 
balance_sorted > balance_rbt_sorted 

1401 
balance_tree_greater > balance_rbt_greater 

1402 
balance_tree_less > balance_rbt_less 

1403 
bulkload_is_rbt > rbt_bulkload_is_rbt 

1404 
combine_sorted > combine_rbt_sorted 

1405 
combine_tree_greater > combine_rbt_greater 

1406 
combine_tree_less > combine_rbt_less 

1407 
delete_in_tree > rbt_delete_in_tree 

1408 
delete_is_rbt > rbt_delete_is_rbt 

1409 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

1410 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

1411 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

1412 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

1413 
del_in_tree > rbt_del_in_tree 

1414 
del_inv1_inv2 > rbt_del_inv1_inv2 

1415 
del_sorted > rbt_del_rbt_sorted 

1416 
del_tree_greater > rbt_del_rbt_greater 

1417 
del_tree_less > rbt_del_rbt_less 

1418 
dom_lookup_Branch > dom_rbt_lookup_Branch 

1419 
entries_lookup > entries_rbt_lookup 

1420 
finite_dom_lookup > finite_dom_rbt_lookup 

1421 
insert_sorted > rbt_insert_rbt_sorted 

1422 
insertw_is_rbt > rbt_insertw_is_rbt 

1423 
insertwk_is_rbt > rbt_insertwk_is_rbt 

1424 
insertwk_sorted > rbt_insertwk_rbt_sorted 

1425 
insertw_sorted > rbt_insertw_rbt_sorted 

1426 
ins_sorted > ins_rbt_sorted 

1427 
ins_tree_greater > ins_rbt_greater 

1428 
ins_tree_less > ins_rbt_less 

1429 
is_rbt_sorted > is_rbt_rbt_sorted 

1430 
lookup_balance > rbt_lookup_balance 

1431 
lookup_bulkload > rbt_lookup_rbt_bulkload 

60da1ee5363f
NEWS
Andreas 