author  wenzelm 
Sun, 23 Jun 2013 21:23:36 +0200  
changeset 52430  289e36c2870a 
parent 52415  d9fed6e99a57 
child 52435  6646bb548c6b 
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 

42 
* Dockable window "Timing" provides an overview of relevant command 

43 
timing information. 

44 

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

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

46 

51533  47 

51313  48 
*** Pure *** 
49 

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

52 
now the default. Minor INCOMPATIBILITY. 

53 

51747  54 
* Targetsensitive commands 'interpretation' and 'sublocale'. 
55 
Particulary, 'interpretation' now allows for nonpersistent 

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

57 
See "isarref" manual for details. 

58 

51565  59 
* Improved locales diagnostic command 'print_dependencies'. 
60 

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

63 
instead, while observing its uniform scope for polymorphism. 

64 

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

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

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

67 

51313  68 

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

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

70 

52380  71 
* Library/Polynomial.thy: 
72 
* Use lifting for primitive definitions. 

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

74 
* Replaced recursion operator poly_rec by fold_coeffs. 

75 
* Prefer preexisting gcd operation for gcd. 

76 
* Fact renames: 

77 
poly_eq_iff ~> poly_eq_poly_eq_iff 

78 
poly_ext ~> poly_eqI 

79 
expand_poly_eq ~> poly_eq_iff 

80 
IMCOMPATIBILTIY. 

81 

52286  82 
* Reification and reflection: 
83 
* Reification is now directly available in HOLMain in structure "Reification". 

84 
* Reflection now handles multiple lists with variables also. 

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

86 
INCOMPATIBILITY. 

87 

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

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

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

90 

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

93 
is separated from the datatype package. The declaration attribute 

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

95 

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

97 

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

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

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

103 
This is now identity on infinite sets. 

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

105 
Finite_Set.fold: folding, folding_idem. 

106 
 Locales comm_monoid_set, semilattice_order_set and 

107 
semilattice_neutr_order_set for big operators on sets. 

108 
See theory Big_Operators for canonical examples. 

109 
Note that foundational constants comm_monoid_set.F and 

110 
semilattice_set.F correspond to former combinators fold_image 

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

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

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

116 
 Fact renames: 

117 
card.union_inter ~> card_Un_Int [symmetric] 

118 
card.union_disjoint ~> card_Un_disjoint 

119 

120 
INCOMPATIBILITY. 

121 

51487  122 
* Locale hierarchy for abstract orderings and (semi)lattices. 
123 

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

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

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

126 

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

129 

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

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

131 
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

132 
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

133 
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

134 
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

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

136 

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

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

138 
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

139 
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

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

141 

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

145 
Removed SupInf and replaced it by the instantiation of 

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

148 
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

149 

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

150 
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

151 
lattices and inner dense linorders which have more than one element. 
51732  152 
INCOMPATIBILITY. 
153 

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

155 
and bottom elements. 

156 

157 
* Split dense_linorder into inner_dense_order and no_top, no_bot. 

158 

159 
* Complex_Main: Unify and move various concepts from 

160 
HOLMultivariate_Analysis to HOLComplex_Main. 

161 

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

162 
 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

163 
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

164 
Instances are reals and extended reals. 
51732  165 

166 
 continuous and continuos_on from Multivariate_Analysis: 

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

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

169 

170 
Generalized continuity lemmas from isCont to continuous on an arbitrary 

171 
filter. 

172 

173 
 compact from Multivariate_Analysis. Use Bolzano's lemma 

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

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

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

177 

178 
 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

179 
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

180 
linear_continuum_topology). 
51732  181 

182 
 first_countable_topology from Multivariate_Analysis. Is used to 

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

184 
all sequences converging to x. 

185 

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

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

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

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

190 

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

192 

193 
F within X = inf F (principal X) 

194 

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

196 
abbreviation for "at x within UNIV" 

197 

198 
 Introduce named theorem collections tendsto_intros, continuous_intros, 

199 
continuous_on_intros and FDERIV_intros. Theorems in tendsto_intros (or 

200 
FDERIV_intros) are also available as tendsto_eq_intros (or 

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

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

203 
equivalence by the simplifier. 

204 

205 
 Restructured theories in HOLComplex_Main: 

206 

207 
+ Moved RealDef and RComplete into Real 

208 

209 
+ Introduced Topological_Spaces and moved theorems about 

210 
topological spaces, filters, limits and continuity to it 

211 

212 
+ Renamed RealVector to Real_Vector_Spaces 

213 

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

215 
Limits 

216 

217 
+ Moved Ln and Log to Transcendental 

218 

219 
+ Moved theorems about continuity from Deriv to Topological_Spaces 

220 

221 
 Remove various auxiliary lemmas. 

222 

223 
INCOMPATIBILITY. 

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

224 

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

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

226 

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

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

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

229 

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

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

231 

51137  232 
* Sledgehammer: 
233 

234 
 Renamed option: 

235 
isar_shrink ~> isar_compress 

236 

52266  237 
* HOLSpec_Check: a Quickcheck tool for Isabelle's ML environment. 
238 

239 
With HOLSpec_Check, ML developers can check specifications with the 

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

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

242 
src/HOL/Spec_Check/Examples.thy. 

243 

50994  244 

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

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

246 

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

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

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

249 
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

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

251 

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

252 

51551  253 
*** ML *** 
254 

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

256 

257 
Skip_Proof.prove ~> Goal.prove_sorry 

258 
Skip_Proof.prove_global ~> Goal.prove_sorry_global 

259 

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

262 

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

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

264 
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

265 
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

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

267 

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

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

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

270 
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

271 
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

272 
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

273 
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

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

275 

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

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

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

278 

51551  279 

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

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

281 

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

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

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

284 

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

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

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

287 

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

290 

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

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

292 
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

293 

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

294 

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

295 

50993  296 
New in Isabelle2013 (February 2013) 
297 
 

47887  298 

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

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

300 

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

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

302 
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

303 
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

304 
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

305 
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

306 
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

307 
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

308 

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

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

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

313 

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

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

315 
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

316 

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

319 
Tools that load their additional source files may imitate the 

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

321 
dependencies properly. 

322 

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

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

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

325 

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

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

328 

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

49841  331 
and "class ... context ...". 
332 

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

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

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

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

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

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

339 

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

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

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

342 

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

345 

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

346 

49968  347 
*** Prover IDE  Isabelle/Scala/jEdit *** 
348 

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

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

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

352 
surface, while the prover is still crunching on internal 

353 
justifications. Unfinished / cancelled proofs are restarted as 

354 
required to complete full proof checking eventually. 

355 

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

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

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

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

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

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

362 

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

365 
browser on demand. 

366 

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

369 
comment delimiters works more conveniently with unfinished situations 

370 
that frequently occur in user interaction. 

371 

372 
* More efficient painting and improved reactivity when editing large 

373 
files. More scalable management of formal document content. 

374 

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

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

376 
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

377 
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

378 
potentially infinite message streams. 
49968  379 

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

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

382 
options, including tuning parameters for editor reactivity and color 

383 
schemes. 

384 

50184  385 
* Dockable window "Symbols" provides some editing support for Isabelle 
386 
symbols. 

387 

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

50701  390 

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

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

394 

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

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

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

50183  399 

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

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

403 

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

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

405 
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

406 
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

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

408 

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

411 
now bundled exclusively with Isabelle. 

412 

413 

48205  414 
*** Pure *** 
415 

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

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

417 
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

418 

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

421 
rather arbitrary current working directory. INCOMPATIBILITY. 

48371  422 

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

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

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

427 
with some care where this is really required. 

428 

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

51063  431 
given sort. Example (in HOL): 
48792  432 

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

434 

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

437 

48205  438 

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

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

440 

50646  441 
* Sledgehammer: 
442 

443 
 Added MaSh relevance filter based on machinelearning; see the 

444 
Sledgehammer manual for details. 

445 
 Polished Isar proofs generated with "isar_proofs" option. 

446 
 Rationalized type encodings ("type_enc" option). 

50720  447 
 Renamed "kill_provers" subcommand to "kill_all". 
50646  448 
 Renamed options: 
449 
isar_proof ~> isar_proofs 

450 
isar_shrink_factor ~> isar_shrink 

451 
max_relevant ~> max_facts 

452 
relevance_thresholds ~> fact_thresholds 

453 

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

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

456 
configuration quickcheck_optimise_equality to false. 

457 

50878  458 
* Quotient: only one quotient can be defined by quotient_type 
459 
INCOMPATIBILITY. 

460 

461 
* Lifting: 

462 
 generation of an abstraction function equation in lift_definition 

463 
 quot_del attribute 

464 
 renamed no_abs_code > no_code (INCOMPATIBILITY.) 

465 

50646  466 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
467 
expressions. 

468 

469 
* Preprocessing of the code generator rewrites set comprehensions into 

470 
pointfree expressions. 

471 

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

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

474 
arithmetic, datatypes/records) with potential proof reconstruction 

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

476 
INCOMPATIBILITY. 

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

477 

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

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

479 
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

480 
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

481 
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

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

483 

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

486 

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

488 
List. INCOMPATIBILITY. 

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

489 

49739  490 
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. 
491 

49738  492 
* Class "comm_monoid_diff" formalises properties of bounded 
49388  493 
subtraction, with natural numbers and multisets as typical instances. 
494 

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

497 
* Theory "Transitive_Closure": renamed lemmas 

498 

499 
reflcl_tranclp > reflclp_tranclp 

500 
rtranclp_reflcl > rtranclp_reflclp 

501 

502 
INCOMPATIBILITY. 

503 

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

505 

506 
left_distrib ~> distrib_right 

507 
right_distrib ~> distrib_left 

508 

509 
INCOMPATIBILITY. 

510 

511 
* Generalized the definition of limits: 

512 

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

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

515 
output f x converges to G. 

516 

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

518 
infinity (at_bot). 

519 

520 
 Moved infinity in the norm (at_infinity) from 

521 
Multivariate_Analysis to Complex_Main. 

522 

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

524 
at_top". 

525 

526 
INCOMPATIBILITY. 

527 

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

529 
lattice type classes. 

530 

531 
* Theory "Library/Multiset": renamed 

532 

533 
constant fold_mset ~> Multiset.fold 

534 
fact fold_mset_commute ~> fold_mset_comm 

535 

536 
INCOMPATIBILITY. 

537 

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

539 
changes as follows. 

540 

541 
 Renamed constants (and related lemmas) 

49145  542 

543 
prefix ~> prefixeq 

544 
strict_prefix ~> prefix 

545 

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

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

549 
Renamed lemmas accordingly. 

550 

551 
 Added constant "list_hembeq" for homeomorphic embedding on 

552 
lists. Added abbreviation "sublisteq" for special case 

553 
"list_hembeq (op =)". 

554 

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

556 
class instances for the prefix order (merely corresponding locale 

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

558 
Library/Prefix_Order. 

559 

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

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

50516  562 

563 
le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff 

564 
le_list_append_mono ~> Sublist.list_hembeq_append_mono 

565 
le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2 

566 
le_list_Cons_EX ~> Sublist.list_hembeq_ConsD 

567 
le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2' 

568 
le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq 

569 
le_list_drop_Cons ~> Sublist.sublisteq_Cons' 

570 
le_list_drop_many ~> Sublist.sublisteq_drop_many 

571 
le_list_filter_left ~> Sublist.sublisteq_filter_left 

572 
le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many 

573 
le_list_rev_take_iff ~> Sublist.sublisteq_append 

574 
le_list_same_length ~> Sublist.sublisteq_same_length 

575 
le_list_take_many_iff ~> Sublist.sublisteq_append' 

49145  576 
less_eq_list.drop ~> less_eq_list_drop 
577 
less_eq_list.induct ~> less_eq_list_induct 

50516  578 
not_le_list_length ~> Sublist.not_sublisteq_length 
49145  579 

50646  580 
INCOMPATIBILITY. 
581 

582 
* New theory Library/Countable_Set. 

583 

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

585 
parallel execution for code generated towards Isabelle/ML. 

586 

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

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

589 
extensional_funcset by an abbreviation, and renamed lemmas from 

590 
extensional_funcset to PiE as follows: 

591 

592 
extensional_empty ~> PiE_empty 

593 
extensional_funcset_empty_domain ~> PiE_empty_domain 

594 
extensional_funcset_empty_range ~> PiE_empty_range 

595 
extensional_funcset_arb ~> PiE_arb 

596 
extensional_funcset_mem ~> PiE_mem 

597 
extensional_funcset_extend_domainI ~> PiE_fun_upd 

598 
extensional_funcset_restrict_domain ~> fun_upd_in_PiE 

599 
extensional_funcset_extend_domain_eq ~> PiE_insert_eq 

600 
card_extensional_funcset ~> card_PiE 

601 
finite_extensional_funcset ~> finite_PiE 

602 

603 
INCOMPATIBILITY. 

604 

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

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

607 
Data"). 

608 

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

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

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

612 
code. 

613 

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

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

616 
return a structurally different tree than before. Potential 

617 
INCOMPATIBILITY. 

618 

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

620 

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

622 

623 
* HOL/Multivariate_Analysis: replaced 

624 

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

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

627 

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

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

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

631 

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

633 

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

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

636 
cart_base i removed 

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

638 

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

639 
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

640 

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

641 
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

642 

50646  643 
component_le_norm ~> Basis_le_norm 
644 
euclidean_eq ~> euclidean_eq_iff 

645 
differential_zero_maxmin_component ~> differential_zero_maxmin_cart 

646 
euclidean_simps ~> inner_simps 

647 
independent_basis ~> independent_Basis 

648 
span_basis ~> span_Basis 

649 
in_span_basis ~> in_span_Basis 

650 
norm_bound_component_le ~> norm_boound_Basis_le 

651 
norm_bound_component_lt ~> norm_boound_Basis_lt 

652 
component_le_infnorm ~> Basis_le_infnorm 

653 

654 
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

655 

50141  656 
* HOL/Probability: 
50646  657 

658 
 Added simproc "measurable" to automatically prove measurability. 

659 

660 
 Added induction rules for sigma sets with disjoint union 

661 
(sigma_sets_induct_disjoint) and for Borelmeasurable functions 

662 
(borel_measurable_induct). 

663 

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

665 
projective family). 

666 

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

668 
AFP entry "Ordinals_and_Cardinals"). 

669 

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

671 
with support for mixed, nested recursion and interesting nonfree 

672 
datatypes. 

48094  673 

50991  674 
* HOL/Finite_Set and Relation: added new set and relation operations 
50878  675 
expressed by Finite_Set.fold. 
676 

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

678 
trees for the code generator. 

679 

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

681 
Lifting/Transfer. 

682 
possible INCOMPATIBILITY. 

683 

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

685 
INCOMPATIBILITY. 

686 

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

687 

48206  688 
*** Document preparation *** 
689 

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

692 
Discontinued legacy styles "prem1" .. "prem19". 

693 

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

695 
instead of slightly exotic babel/greek. 

48206  696 

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

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

698 
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

699 
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

700 

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

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

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

703 

48206  704 

48992  705 
*** ML *** 
706 

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

709 
hardware and Poly/ML runtime system. 

710 

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

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

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

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

714 

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

717 
necessarily printing visible text. 

718 

719 

48206  720 
*** System *** 
721 

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

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

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

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

727 
document preparation as well. INCOMPATIBILITY, isabelle usedir / 

48736  728 
mkdir / make are rendered obsolete. 
729 

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

732 

733 
isabelle build s b HOL 

734 

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

736 

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

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

738 
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

739 
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

740 
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

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

742 

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

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

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

745 

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

748 

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

750 
INCOMPATIBILITY. 

751 

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

754 
version of Isabelle. 

755 

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

758 

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

760 
picked up from some surrounding directory. Potential INCOMPATIBILITY 

761 
for homemade settings. 

50132  762 

50701  763 
* Improved ML runtime statistics (heap, threads, future tasks etc.). 
764 

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

767 
configuration. 

768 

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

771 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

773 
bundled as Isabelle component. 

48206  774 

50182  775 

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

776 

47462  777 
New in Isabelle2012 (May 2012) 
778 
 

45109  779 

45593  780 
*** General *** 
781 

45614  782 
* Prover IDE (PIDE) improvements: 
783 

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

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

45614  791 

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

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

46485  795 

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

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

797 
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

798 
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

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

800 
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

801 

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

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

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

804 
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

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

806 

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

807 
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

808 

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

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

810 

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

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

812 

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

813 
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

814 
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

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

816 

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

817 
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

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

819 

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

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

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

47484  825 

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

828 
oldstyle "standard" after instantiation or composition of facts 

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

830 
indices of schematic variables. 

831 

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

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

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

835 
the historic accident of dynamic reevaluation in interpretations 

836 
etc. was exploited. 

837 

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

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

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

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

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

843 
of the material of that old tutorial. 

844 

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

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

847 
manual. 

848 

849 

850 
*** Pure *** 

851 

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

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

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

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

855 

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

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

859 
undocumented feature.) 

860 

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

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

864 

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

866 

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

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

869 

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

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

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

873 
order to accommodate newly introduced premises.) 

874 

47806  875 
* Renamed some inner syntax categories: 
876 

877 
num ~> num_token 

878 
xnum ~> xnum_token 

879 
xstr ~> str_token 

880 

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

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

883 
position information via constraints). 

884 

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

887 
manual. Minor INCOMPATIBILITY. 

888 

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

45134  891 

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

894 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  895 

47464  896 
* Redundant attribute "code_inline" has been discontinued. Use 
897 
"code_unfold" instead. INCOMPATIBILITY. 

898 

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

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

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

901 

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

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

903 

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

904 
INCOMPATIBILITY. 
45383  905 

47856  906 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
907 
instead. INCOMPATIBILITY. 

908 

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

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

911 
legacy since Isabelle2011). 

47855  912 

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

913 

45122  914 
*** HOL *** 
915 

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

918 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

923 
tinkering with former theorems mem_def and Collect_def as far as 

924 
possible. 

925 

926 
For developments which deliberately mix predicates and sets, a 

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

929 
Isabelle20111 before jumping right into the current release. 

930 

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

933 

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

935 

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

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

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

941 
user theories may require adaptations as follows: 

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

942 

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

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

944 
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

945 

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

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

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

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

949 

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

950 
 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

951 
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

952 

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

953 
 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

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

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

956 

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

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

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

959 

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

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

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

964 
corresponding parts of the Quotient package.) 

47809  965 

966 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

968 
relate different type instances of the same polymorphic constant, 

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

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

971 

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

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

974 

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

976 
equivalent subgoal on the corresponding raw types. Constants are 

977 
replaced with corresponding ones according to the transfer rules. 

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

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

983 

984 
 relator_eq attribute: Collects identity laws for relators of 

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

986 
transfer method uses these lemmas to infer transfer rules for 

987 
nonpolymorphic constants on the fly. 

988 

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

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

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

992 
after unfolding the constant definitions. 

993 

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

995 
from type nat to type int. 

996 

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

47809  999 

1000 
 lift_definition command: Defines operations on an abstract type in 

1001 
terms of a corresponding operation on a representation 

1002 
type. Example syntax: 

1003 

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

1005 
is List.insert 

1006 

1007 
Users must discharge a respectfulness proof obligation when each 

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

1009 
the proof is discharged automatically.) The obligation is 

1010 
presented in a userfriendly, readable form; a respectfulness 

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

1012 
by the package. 

1013 

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

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

1016 
lift_definition generates a code certificate theorem and sets up 

1017 
code generation for each constant. 

1018 

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

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

1021 
or a type_definition theorem. The package configures transfer 

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

1023 
lift_definition command to work with the type. 

1024 

1025 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  1026 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
1027 
Word/Word.thy and Library/Float.thy. 

47809  1028 

1029 
* Quotient package: 

1030 

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

1032 
rep and abs functions, similar to typedef. 

1033 

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

1035 
Transfer packages, as with 'setup_lifting'. 

1036 

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

1038 
respectfulness property at the point where the constant is 

1039 
defined, similar to lift_definition; INCOMPATIBILITY. 

1040 

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

1042 
accordingly, INCOMPATIBILITY. 

1043 

1044 
* New diagnostic command 'find_unused_assms' to find potentially 

1045 
superfluous assumptions in theorems using Quickcheck. 

1046 

1047 
* Quickcheck: 

1048 

1049 
 Quickcheck returns variable assignments as counterexamples, which 

1050 
allows to reveal the underspecification of functions under test. 

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

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

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

1054 

1055 
These counterexample are marked as potentially spurious, as 

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

1057 
obvious theorem "hd xs = hd xs". 

1058 

1059 
After finding a potentially spurious counterexample, Quickcheck 

1060 
continues searching for genuine ones. 

1061 

1062 
By default, Quickcheck shows potentially spurious and genuine 

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

1064 
show genuine counterexamples. 

1065 

1066 
 The command 'quickcheck_generator' creates random and exhaustive 

1067 
value generators for a given type and operations. 

1068 

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

1070 
constructors of that type. 

1071 

1072 
 Support for multisets. 

1073 

1074 
 Added "use_subtype" options. 

1075 

1076 
 Added "quickcheck_locale" configuration to specify how to process 

1077 
conjectures in a locale context. 

1078 

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

47809  1081 

1082 
* Sledgehammer: 

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

1084 
paper "More SPASS with Isabelle". 

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

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

1087 
TFF1), iProver, iProverEq. 

1088 
 Sped up the minimizer. 

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

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

1091 
 Renamed "sound" option to "strict". 

1092 

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

1095 

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

1097 

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

47809  1099 

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

1102 

1103 
list.exhaust [case_product nat.exhaust] 

1104 

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

1106 
a list and a nat. 

1107 

47809  1108 
* New "eventually_elim" method as a generalized variant of the 
47855  1109 
eventually_elim* rules. Supports structured proofs. 
1110 

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

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

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

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

1114 

47856  1115 
* Record: code generation can be switched off manually with 
1116 

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

1118 

1119 
* Datatype: type parameters allow explicit sort constraints. 

1120 

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

1123 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

1125 
one_case. 

1126 

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

1128 
the result of the fact expression. 

1129 

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

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

1133 

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

1134 
converse_def ~> converse_unfold 
47549  1135 
rel_comp_def ~> relcomp_unfold 
47820  1136 
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

1137 
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

1138 
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

1139 
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

1140 

46981  1141 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
1142 

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

47086  1145 

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

1146 
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

1147 

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

46458  1151 
rel_pow_1 ~> relpow_1 
46363  1152 
rel_pow_0_I ~> relpow_0_I 
1153 
rel_pow_Suc_I ~> relpow_Suc_I 

1154 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

1155 
rel_pow_0_E ~> relpow_0_E 

1156 
rel_pow_Suc_E ~> relpow_Suc_E 

1157 
rel_pow_E ~> relpow_E 

46458  1158 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  1159 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  1160 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
1161 
rel_pow_E2 ~> relpow_E2 

1162 
rel_pow_add ~> relpow_add 

1163 
rel_pow_commute ~> relpow 

1164 
rel_pow_empty ~> relpow_empty: 

1165 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

1166 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

1167 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

1168 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

1169 
rel_pow_fun_conv ~> relpow_fun_conv 

1170 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

1171 
rel_pow_finite_bounded ~> relpow_finite_bounded 

1172 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

1173 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

1174 
single_valued_rel_pow ~> single_valued_relpow 

47463  1175 

46363  1176 
INCOMPATIBILITY. 
1177 

47448  1178 
* Theory Relation: Consolidated constant name for relation composition 
47464  1179 
and corresponding theorem names: 
1180 

47549  1181 
 Renamed constant rel_comp to relcomp. 
47464  1182 

47448  1183 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  1184 

47448  1185 
 Renamed theorems: 
47464  1186 

47448  1187 
rel_compI ~> relcompI 
1188 
rel_compEpair ~> relcompEpair 

1189 
rel_compE ~> relcompE 

1190 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

1191 
rel_comp_empty1 ~> relcomp_empty1 

1192 
rel_comp_mono ~> relcomp_mono 

1193 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

1194 
rel_comp_distrib ~> relcomp_distrib 

1195 
rel_comp_distrib2 ~> relcomp_distrib2 

1196 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

1197 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

1198 
single_valued_rel_comp ~> single_valued_relcomp 

47549  1199 
rel_comp_def ~> relcomp_unfold 
47448  1200 
converse_rel_comp ~> converse_relcomp 
1201 
pred_compI ~> relcomppI 

1202 
pred_compE ~> relcomppE 

1203 
pred_comp_bot1 ~> relcompp_bot1 

1204 
pred_comp_bot2 ~> relcompp_bot2 

1205 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

1206 
pred_comp_mono ~> relcompp_mono 

1207 
pred_comp_distrib ~> relcompp_distrib 

1208 
pred_comp_distrib2 ~> relcompp_distrib2 

1209 
converse_pred_comp ~> converse_relcompp 

47464  1210 

47448  1211 
finite_rel_comp ~> finite_relcomp 
47464  1212 

47448  1213 
set_rel_comp ~> set_relcomp 
1214 

1215 
INCOMPATIBILITY. 

1216 

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

1219 

1220 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

1221 
zdiv_self ~> div_self 

1222 
zmod_self ~> mod_self 

1223 
zdiv_zero ~> div_0 

1224 
zmod_zero ~> mod_0 

1225 
zdiv_zmod_equality ~> div_mod_equality2 

1226 
zdiv_zmod_equality2 ~> div_mod_equality 

1227 
zmod_zdiv_trivial ~> mod_div_trivial 

1228 
zdiv_zminus_zminus ~> div_minus_minus 

1229 
zmod_zminus_zminus ~> mod_minus_minus 

1230 
zdiv_zminus2 ~> div_minus_right 

1231 
zmod_zminus2 ~> mod_minus_right 

1232 
zdiv_minus1_right ~> div_minus1_right 

1233 
zmod_minus1_right ~> mod_minus1_right 

1234 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

1235 
zmod_zmult1_eq ~> mod_mult_right_eq 

1236 
zpower_zmod ~> power_mod 

1237 
zdvd_zmod ~> dvd_mod 

1238 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

1239 
mod_mult_distrib ~> mult_mod_left 

1240 
mod_mult_distrib2 ~> mult_mod_right 

1241 

1242 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

1243 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

1244 

47551  1245 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
1246 

47552  1247 
* Consolidated theorem names concerning fold combinators: 
47550  1248 

1249 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

1250 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

1251 
INFI_fold_inf ~> INF_fold_inf 

1252 
SUPR_fold_sup ~> SUP_fold_sup 

1253 
union_set ~> union_set_fold 

1254 
minus_set ~> minus_set_fold 

1255 
INFI_set_fold ~> INF_set_fold 

1256 
SUPR_set_fold ~> SUP_set_fold 

1257 
INF_code ~> INF_set_foldr 

1258 
SUP_code ~> SUP_set_foldr 

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

1260 
foldr_fold_rev ~> foldr_conv_fold 

1261 
foldl_fold ~> foldl_conv_fold 

1262 
foldr_foldr ~> foldr_conv_foldl 

1263 
foldl_foldr ~> foldl_conv_foldr 

47552  1264 
fold_set_remdups ~> fold_set_fold_remdups 
1265 
fold_set ~> fold_set_fold 

1266 
fold1_set ~> fold1_set_fold 

47550  1267 

1268 
INCOMPATIBILITY. 

1269 

1270 
* Dropped rarely useful theorems concerning fold combinators: 

1271 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

1272 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

1273 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

1274 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

1275 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

1276 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

1280 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

1281 

1282 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

1283 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

1284 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

1285 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

1287 
fold_conv_foldr and fold_rev. 

1288 

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

1290 
through option types. 

1291 

47856  1292 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
1293 
relations. 

1294 

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

1296 

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

1298 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

1299 

1300 
zminus_zminus ~> minus_minus 

1301 
zminus_0 ~> minus_zero 

1302 
zminus_zadd_distrib ~> minus_add_distrib 

1303 
zadd_commute ~> add_commute 

1304 
zadd_assoc ~> add_assoc 

1305 
zadd_left_commute ~> add_left_commute 

1306 
zadd_ac ~> add_ac 

1307 
zmult_ac ~> mult_ac 

1308 
zadd_0 ~> add_0_left 

1309 
zadd_0_right ~> add_0_right 

1310 
zadd_zminus_inverse2 ~> left_minus 

1311 
zmult_zminus ~> mult_minus_left 

1312 
zmult_commute ~> mult_commute 

1313 
zmult_assoc ~> mult_assoc 

1314 
zadd_zmult_distrib ~> left_distrib 

1315 
zadd_zmult_distrib2 ~> right_distrib 

1316 
zdiff_zmult_distrib ~> left_diff_distrib 

1317 
zdiff_zmult_distrib2 ~> right_diff_distrib 

1318 
zmult_1 ~> mult_1_left 

1319 
zmult_1_right ~> mult_1_right 

1320 
zle_refl ~> order_refl 

1321 
zle_trans ~> order_trans 

1322 
zle_antisym ~> order_antisym 

1323 
zle_linear ~> linorder_linear 

1324 
zless_linear ~> linorder_less_linear 

1325 
zadd_left_mono ~> add_left_mono 

1326 
zadd_strict_right_mono ~> add_strict_right_mono 

1327 
zadd_zless_mono ~> add_less_le_mono 

1328 
int_0_less_1 ~> zero_less_one 

1329 
int_0_neq_1 ~> zero_neq_one 

1330 
zless_le ~> less_le 

1331 
zpower_zadd_distrib ~> power_add 

1332 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

1333 
zero_le_zpower_abs ~> zero_le_power_abs 

1334 

1335 
* Theory Deriv: Renamed 

1336 

1337 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

1338 

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

1340 

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

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

1345 
INCOMPATIBILITY. 

1346 

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

1349 

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

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

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

1354 
follows: 

47452  1355 

1356 
Operations: 

1357 
bulkload > rbt_bulkload 

1358 
del_from_left > rbt_del_from_left 

1359 
del_from_right > rbt_del_from_right 

1360 
del > rbt_del 

1361 
delete > rbt_delete 

1362 
ins > rbt_ins 

1363 
insert > rbt_insert 

1364 
insertw > rbt_insert_with 

1365 
insert_with_key > rbt_insert_with_key 

1366 
map_entry > rbt_map_entry 

1367 
lookup > rbt_lookup 

1368 
sorted > rbt_sorted 

1369 
tree_greater > rbt_greater 

1370 
tree_less > rbt_less 

1371 
tree_less_symbol > rbt_less_symbol 

1372 
union > rbt_union 

1373 
union_with > rbt_union_with 

1374 
union_with_key > rbt_union_with_key 

1375 

1376 
Lemmas: 

1377 
balance_left_sorted > balance_left_rbt_sorted 

1378 
balance_left_tree_greater > balance_left_rbt_greater 

1379 
balance_left_tree_less > balance_left_rbt_less 

1380 
balance_right_sorted > balance_right_rbt_sorted 

1381 
balance_right_tree_greater > balance_right_rbt_greater 

1382 
balance_right_tree_less > balance_right_rbt_less 

1383 
balance_sorted > balance_rbt_sorted 

1384 
balance_tree_greater > balance_rbt_greater 

1385 
balance_tree_less > balance_rbt_less 

1386 
bulkload_is_rbt > rbt_bulkload_is_rbt 

1387 
combine_sorted > combine_rbt_sorted 

1388 
combine_tree_greater > combine_rbt_greater 

1389 
combine_tree_less > combine_rbt_less 

1390 
delete_in_tree > rbt_delete_in_tree 

1391 
delete_is_rbt > rbt_delete_is_rbt 

1392 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

1393 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

1394 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

1395 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

1396 
del_in_tree > rbt_del_in_tree 

1397 
del_inv1_inv2 > rbt_del_inv1_inv2 

1398 
del_sorted > rbt_del_rbt_sorted 

1399 
del_tree_greater > rbt_del_rbt_greater 

1400 
del_tree_less > rbt_del_rbt_less 

1401 
dom_lookup_Branch > dom_rbt_lookup_Branch 

1402 
entries_lookup > entries_rbt_lookup 

1403 
finite_dom_lookup > finite_dom_rbt_lookup 

1404 
insert_sorted > rbt_insert_rbt_sorted 

1405 
insertw_is_rbt > rbt_insertw_is_rbt 

1406 
insertwk_is_rbt > rbt_insertwk_is_rbt 

1407 
insertwk_sorted > rbt_insertwk_rbt_sorted 

1408 
insertw_sorted > rbt_insertw_rbt_sorted 

1409 
ins_sorted > ins_rbt_sorted 

1410 
ins_tree_greater > ins_rbt_greater 

1411 
ins_tree_less > ins_rbt_less 

1412 
is_rbt_sorted > is_rbt_rbt_sorted 

1413 
lookup_balance > rbt_lookup_balance 

1414 
lookup_bulkload > rbt_lookup_rbt_bulkload 

1415 
lookup_delete > rbt_lookup_rbt_delete 

1416 
lookup_Empty > rbt_lookup_Empty 

1417 
lookup_from_in_tree > rbt_lookup_from_in_tree 

1418 
lookup_in_tree > rbt_lookup_in_tree 

1419 
lookup_ins > rbt_lookup_ins 

1420 
lookup_insert > rbt_lookup_rbt_insert 

1421 
lookup_insertw > rbt_lookup_rbt_insertw 

1422 
lookup_insertwk > rbt_lookup_rbt_insertwk 

1423 
lookup_keys > rbt_lookup_keys 

1424 
lookup_map > rbt_lookup_map 

1425 
lookup_map_entry > rbt_lookup_rbt_map_entry 

1426 
lookup_tree_greater > rbt_lookup_rbt_greater 

1427 
lookup_tree_less > rbt_lookup_rbt_less 

1428 
lookup_union > rbt_lookup_rbt_union 

1429 
map_entry_color_of > rbt_map_entry_color_of 

1430 
map_entry_inv1 > rbt_map_entry_inv1 

1431 
map_entry_inv2 > rbt_map_entry_inv2 

1432 
map_entry_is_rbt > rbt_map_entry_is_rbt 
