author  haftmann 
Sun, 02 Jun 2013 07:46:40 +0200  
changeset 52286  8170e5327c02 
parent 52266  86d6f57c2c1e 
child 52380  3cc46b8cca5e 
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 

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

32 

51533  33 
*** Prover IDE  Isabelle/Scala/jEdit *** 
34 

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

36 
timing information. 

37 

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

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

39 

51533  40 

51313  41 
*** Pure *** 
42 

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

45 
now the default. Minor INCOMPATIBILITY. 

46 

51747  47 
* Targetsensitive commands 'interpretation' and 'sublocale'. 
48 
Particulary, 'interpretation' now allows for nonpersistent 

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

50 
See "isarref" manual for details. 

51 

51565  52 
* Improved locales diagnostic command 'print_dependencies'. 
53 

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

56 
instead, while observing its uniform scope for polymorphism. 

57 

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

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

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

60 

51313  61 

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

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

63 

52286  64 
* Reification and reflection: 
65 
* Reification is now directly available in HOLMain in structure "Reification". 

66 
* Reflection now handles multiple lists with variables also. 

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

68 
INCOMPATIBILITY. 

69 

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

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

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

72 

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

75 
is separated from the datatype package. The declaration attribute 

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

77 

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

79 

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

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

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

85 
This is now identity on infinite sets. 

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

87 
Finite_Set.fold: folding, folding_idem. 

88 
 Locales comm_monoid_set, semilattice_order_set and 

89 
semilattice_neutr_order_set for big operators on sets. 

90 
See theory Big_Operators for canonical examples. 

91 
Note that foundational constants comm_monoid_set.F and 

92 
semilattice_set.F correspond to former combinators fold_image 

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

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

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

98 
 Fact renames: 

99 
card.union_inter ~> card_Un_Int [symmetric] 

100 
card.union_disjoint ~> card_Un_disjoint 

101 

102 
INCOMPATIBILITY. 

103 

51487  104 
* Locale hierarchy for abstract orderings and (semi)lattices. 
105 

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

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

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

108 

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

111 

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

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

113 
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

114 
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

115 
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

116 
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

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

118 

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

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

120 
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

121 
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

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

123 

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

127 
Removed SupInf and replaced it by the instantiation of 

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

130 
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

131 

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

132 
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

133 
lattices and inner dense linorders which have more than one element. 
51732  134 
INCOMPATIBILITY. 
135 

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

137 
and bottom elements. 

138 

139 
* Split dense_linorder into inner_dense_order and no_top, no_bot. 

140 

141 
* Complex_Main: Unify and move various concepts from 

142 
HOLMultivariate_Analysis to HOLComplex_Main. 

143 

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

144 
 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

145 
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

146 
Instances are reals and extended reals. 
51732  147 

148 
 continuous and continuos_on from Multivariate_Analysis: 

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

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

151 

152 
Generalized continuity lemmas from isCont to continuous on an arbitrary 

153 
filter. 

154 

155 
 compact from Multivariate_Analysis. Use Bolzano's lemma 

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

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

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

159 

160 
 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

161 
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

162 
linear_continuum_topology). 
51732  163 

164 
 first_countable_topology from Multivariate_Analysis. Is used to 

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

166 
all sequences converging to x. 

167 

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

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

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

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

172 

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

174 

175 
F within X = inf F (principal X) 

176 

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

178 
abbreviation for "at x within UNIV" 

179 

180 
 Introduce named theorem collections tendsto_intros, continuous_intros, 

181 
continuous_on_intros and FDERIV_intros. Theorems in tendsto_intros (or 

182 
FDERIV_intros) are also available as tendsto_eq_intros (or 

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

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

185 
equivalence by the simplifier. 

186 

187 
 Restructured theories in HOLComplex_Main: 

188 

189 
+ Moved RealDef and RComplete into Real 

190 

191 
+ Introduced Topological_Spaces and moved theorems about 

192 
topological spaces, filters, limits and continuity to it 

193 

194 
+ Renamed RealVector to Real_Vector_Spaces 

195 

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

197 
Limits 

198 

199 
+ Moved Ln and Log to Transcendental 

200 

201 
+ Moved theorems about continuity from Deriv to Topological_Spaces 

202 

203 
 Remove various auxiliary lemmas. 

204 

205 
INCOMPATIBILITY. 

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

206 

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

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

208 

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

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

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

211 

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

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

213 

51137  214 
* Sledgehammer: 
215 

216 
 Renamed option: 

217 
isar_shrink ~> isar_compress 

218 

52266  219 
* HOLSpec_Check: a Quickcheck tool for Isabelle's ML environment. 
220 

221 
With HOLSpec_Check, ML developers can check specifications with the 

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

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

224 
src/HOL/Spec_Check/Examples.thy. 

225 

50994  226 

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

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

228 

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

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

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

231 
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

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

233 

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

234 

51551  235 
*** ML *** 
236 

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

238 

239 
Skip_Proof.prove ~> Goal.prove_sorry 

240 
Skip_Proof.prove_global ~> Goal.prove_sorry_global 

241 

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

244 

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

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

246 
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

247 
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

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

249 

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

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

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

252 
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

253 
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

254 
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

255 
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

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

257 

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

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

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

260 

51551  261 

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

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

263 

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

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

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

266 

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

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

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

269 

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

272 

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

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

274 
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

275 

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

276 

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

277 

50993  278 
New in Isabelle2013 (February 2013) 
279 
 

47887  280 

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

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

282 

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

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

284 
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

285 
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

286 
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

287 
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

288 
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

289 
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

290 

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

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

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

295 

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

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

297 
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

298 

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

301 
Tools that load their additional source files may imitate the 

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

303 
dependencies properly. 

304 

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

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

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

307 

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

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

310 

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

49841  313 
and "class ... context ...". 
314 

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

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

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

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

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

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

321 

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

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

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

324 

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

327 

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

328 

49968  329 
*** Prover IDE  Isabelle/Scala/jEdit *** 
330 

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

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

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

334 
surface, while the prover is still crunching on internal 

335 
justifications. Unfinished / cancelled proofs are restarted as 

336 
required to complete full proof checking eventually. 

337 

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

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

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

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

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

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

344 

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

347 
browser on demand. 

348 

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

351 
comment delimiters works more conveniently with unfinished situations 

352 
that frequently occur in user interaction. 

353 

354 
* More efficient painting and improved reactivity when editing large 

355 
files. More scalable management of formal document content. 

356 

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

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

358 
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

359 
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

360 
potentially infinite message streams. 
49968  361 

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

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

364 
options, including tuning parameters for editor reactivity and color 

365 
schemes. 

366 

50184  367 
* Dockable window "Symbols" provides some editing support for Isabelle 
368 
symbols. 

369 

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

50701  372 

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

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

376 

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

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

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

50183  381 

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

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

385 

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

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

387 
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

388 
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

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

390 

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

393 
now bundled exclusively with Isabelle. 

394 

395 

48205  396 
*** Pure *** 
397 

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

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

399 
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

400 

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

403 
rather arbitrary current working directory. INCOMPATIBILITY. 

48371  404 

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

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

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

409 
with some care where this is really required. 

410 

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

51063  413 
given sort. Example (in HOL): 
48792  414 

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

416 

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

419 

48205  420 

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

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

422 

50646  423 
* Sledgehammer: 
424 

425 
 Added MaSh relevance filter based on machinelearning; see the 

426 
Sledgehammer manual for details. 

427 
 Polished Isar proofs generated with "isar_proofs" option. 

428 
 Rationalized type encodings ("type_enc" option). 

50720  429 
 Renamed "kill_provers" subcommand to "kill_all". 
50646  430 
 Renamed options: 
431 
isar_proof ~> isar_proofs 

432 
isar_shrink_factor ~> isar_shrink 

433 
max_relevant ~> max_facts 

434 
relevance_thresholds ~> fact_thresholds 

435 

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

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

438 
configuration quickcheck_optimise_equality to false. 

439 

50878  440 
* Quotient: only one quotient can be defined by quotient_type 
441 
INCOMPATIBILITY. 

442 

443 
* Lifting: 

444 
 generation of an abstraction function equation in lift_definition 

445 
 quot_del attribute 

446 
 renamed no_abs_code > no_code (INCOMPATIBILITY.) 

447 

50646  448 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
449 
expressions. 

450 

451 
* Preprocessing of the code generator rewrites set comprehensions into 

452 
pointfree expressions. 

453 

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

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

456 
arithmetic, datatypes/records) with potential proof reconstruction 

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

458 
INCOMPATIBILITY. 

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

459 

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

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

461 
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

462 
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

463 
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

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

465 

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

468 

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

470 
List. INCOMPATIBILITY. 

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

471 

49739  472 
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. 
473 

49738  474 
* Class "comm_monoid_diff" formalises properties of bounded 
49388  475 
subtraction, with natural numbers and multisets as typical instances. 
476 

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

479 
* Theory "Transitive_Closure": renamed lemmas 

480 

481 
reflcl_tranclp > reflclp_tranclp 

482 
rtranclp_reflcl > rtranclp_reflclp 

483 

484 
INCOMPATIBILITY. 

485 

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

487 

488 
left_distrib ~> distrib_right 

489 
right_distrib ~> distrib_left 

490 

491 
INCOMPATIBILITY. 

492 

493 
* Generalized the definition of limits: 

494 

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

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

497 
output f x converges to G. 

498 

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

500 
infinity (at_bot). 

501 

502 
 Moved infinity in the norm (at_infinity) from 

503 
Multivariate_Analysis to Complex_Main. 

504 

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

506 
at_top". 

507 

508 
INCOMPATIBILITY. 

509 

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

511 
lattice type classes. 

512 

513 
* Theory "Library/Multiset": renamed 

514 

515 
constant fold_mset ~> Multiset.fold 

516 
fact fold_mset_commute ~> fold_mset_comm 

517 

518 
INCOMPATIBILITY. 

519 

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

521 
changes as follows. 

522 

523 
 Renamed constants (and related lemmas) 

49145  524 

525 
prefix ~> prefixeq 

526 
strict_prefix ~> prefix 

527 

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

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

531 
Renamed lemmas accordingly. 

532 

533 
 Added constant "list_hembeq" for homeomorphic embedding on 

534 
lists. Added abbreviation "sublisteq" for special case 

535 
"list_hembeq (op =)". 

536 

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

538 
class instances for the prefix order (merely corresponding locale 

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

540 
Library/Prefix_Order. 

541 

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

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

50516  544 

545 
le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff 

546 
le_list_append_mono ~> Sublist.list_hembeq_append_mono 

547 
le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2 

548 
le_list_Cons_EX ~> Sublist.list_hembeq_ConsD 

549 
le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2' 

550 
le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq 

551 
le_list_drop_Cons ~> Sublist.sublisteq_Cons' 

552 
le_list_drop_many ~> Sublist.sublisteq_drop_many 

553 
le_list_filter_left ~> Sublist.sublisteq_filter_left 

554 
le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many 

555 
le_list_rev_take_iff ~> Sublist.sublisteq_append 

556 
le_list_same_length ~> Sublist.sublisteq_same_length 

557 
le_list_take_many_iff ~> Sublist.sublisteq_append' 

49145  558 
less_eq_list.drop ~> less_eq_list_drop 
559 
less_eq_list.induct ~> less_eq_list_induct 

50516  560 
not_le_list_length ~> Sublist.not_sublisteq_length 
49145  561 

50646  562 
INCOMPATIBILITY. 
563 

564 
* New theory Library/Countable_Set. 

565 

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

567 
parallel execution for code generated towards Isabelle/ML. 

568 

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

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

571 
extensional_funcset by an abbreviation, and renamed lemmas from 

572 
extensional_funcset to PiE as follows: 

573 

574 
extensional_empty ~> PiE_empty 

575 
extensional_funcset_empty_domain ~> PiE_empty_domain 

576 
extensional_funcset_empty_range ~> PiE_empty_range 

577 
extensional_funcset_arb ~> PiE_arb 

578 
extensional_funcset_mem ~> PiE_mem 

579 
extensional_funcset_extend_domainI ~> PiE_fun_upd 

580 
extensional_funcset_restrict_domain ~> fun_upd_in_PiE 

581 
extensional_funcset_extend_domain_eq ~> PiE_insert_eq 

582 
card_extensional_funcset ~> card_PiE 

583 
finite_extensional_funcset ~> finite_PiE 

584 

585 
INCOMPATIBILITY. 

586 

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

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

589 
Data"). 

590 

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

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

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

594 
code. 

595 

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

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

598 
return a structurally different tree than before. Potential 

599 
INCOMPATIBILITY. 

600 

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

602 

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

604 

605 
* HOL/Multivariate_Analysis: replaced 

606 

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

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

609 

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

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

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

613 

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

615 

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

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

618 
cart_base i removed 

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

620 

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

621 
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

622 

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

623 
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

624 

50646  625 
component_le_norm ~> Basis_le_norm 
626 
euclidean_eq ~> euclidean_eq_iff 

627 
differential_zero_maxmin_component ~> differential_zero_maxmin_cart 

628 
euclidean_simps ~> inner_simps 

629 
independent_basis ~> independent_Basis 

630 
span_basis ~> span_Basis 

631 
in_span_basis ~> in_span_Basis 

632 
norm_bound_component_le ~> norm_boound_Basis_le 

633 
norm_bound_component_lt ~> norm_boound_Basis_lt 

634 
component_le_infnorm ~> Basis_le_infnorm 

635 

636 
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

637 

50141  638 
* HOL/Probability: 
50646  639 

640 
 Added simproc "measurable" to automatically prove measurability. 

641 

642 
 Added induction rules for sigma sets with disjoint union 

643 
(sigma_sets_induct_disjoint) and for Borelmeasurable functions 

644 
(borel_measurable_induct). 

645 

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

647 
projective family). 

648 

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

650 
AFP entry "Ordinals_and_Cardinals"). 

651 

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

653 
with support for mixed, nested recursion and interesting nonfree 

654 
datatypes. 

48094  655 

50991  656 
* HOL/Finite_Set and Relation: added new set and relation operations 
50878  657 
expressed by Finite_Set.fold. 
658 

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

660 
trees for the code generator. 

661 

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

663 
Lifting/Transfer. 

664 
possible INCOMPATIBILITY. 

665 

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

667 
INCOMPATIBILITY. 

668 

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

669 

48206  670 
*** Document preparation *** 
671 

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

674 
Discontinued legacy styles "prem1" .. "prem19". 

675 

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

677 
instead of slightly exotic babel/greek. 

48206  678 

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

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

680 
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

681 
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

682 

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

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

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

685 

48206  686 

48992  687 
*** ML *** 
688 

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

691 
hardware and Poly/ML runtime system. 

692 

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

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

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

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

696 

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

699 
necessarily printing visible text. 

700 

701 

48206  702 
*** System *** 
703 

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

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

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

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

709 
document preparation as well. INCOMPATIBILITY, isabelle usedir / 

48736  710 
mkdir / make are rendered obsolete. 
711 

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

714 

715 
isabelle build s b HOL 

716 

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

718 

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

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

720 
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

721 
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

722 
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

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

724 

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

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

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

727 

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

730 

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

732 
INCOMPATIBILITY. 

733 

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

736 
version of Isabelle. 

737 

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

740 

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

742 
picked up from some surrounding directory. Potential INCOMPATIBILITY 

743 
for homemade settings. 

50132  744 

50701  745 
* Improved ML runtime statistics (heap, threads, future tasks etc.). 
746 

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

749 
configuration. 

750 

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

753 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

755 
bundled as Isabelle component. 

48206  756 

50182  757 

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

758 

47462  759 
New in Isabelle2012 (May 2012) 
760 
 

45109  761 

45593  762 
*** General *** 
763 

45614  764 
* Prover IDE (PIDE) improvements: 
765 

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

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

45614  773 

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

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

46485  777 

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

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

779 
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

780 
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

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

782 
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

783 

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

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

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

786 
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

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

788 

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

789 
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

790 

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

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

792 

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

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

794 

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

795 
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

796 
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

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

798 

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

799 
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

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

801 

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

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

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

47484  807 

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

810 
oldstyle "standard" after instantiation or composition of facts 

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

812 
indices of schematic variables. 

813 

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

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

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

817 
the historic accident of dynamic reevaluation in interpretations 

818 
etc. was exploited. 

819 

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

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

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

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

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

825 
of the material of that old tutorial. 

826 

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

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

829 
manual. 

830 

831 

832 
*** Pure *** 

833 

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

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

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

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

837 

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

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

841 
undocumented feature.) 

842 

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

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

846 

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

848 

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

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

851 

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

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

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

855 
order to accommodate newly introduced premises.) 

856 

47806  857 
* Renamed some inner syntax categories: 
858 

859 
num ~> num_token 

860 
xnum ~> xnum_token 

861 
xstr ~> str_token 

862 

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

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

865 
position information via constraints). 

866 

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

869 
manual. Minor INCOMPATIBILITY. 

870 

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

45134  873 

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

876 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  877 

47464  878 
* Redundant attribute "code_inline" has been discontinued. Use 
879 
"code_unfold" instead. INCOMPATIBILITY. 

880 

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

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

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

883 

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

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

885 

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

886 
INCOMPATIBILITY. 
45383  887 

47856  888 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
889 
instead. INCOMPATIBILITY. 

890 

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

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

893 
legacy since Isabelle2011). 

47855  894 

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

895 

45122  896 
*** HOL *** 
897 

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

900 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

905 
tinkering with former theorems mem_def and Collect_def as far as 

906 
possible. 

907 

908 
For developments which deliberately mix predicates and sets, a 

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

911 
Isabelle20111 before jumping right into the current release. 

912 

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

915 

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

917 

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

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

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

923 
user theories may require adaptations as follows: 

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

924 

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

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

926 
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

927 

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

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

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

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

931 

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

932 
 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

933 
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

934 

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

935 
 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

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

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

938 

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

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

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

941 

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

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

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

946 
corresponding parts of the Quotient package.) 

47809  947 

948 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

950 
relate different type instances of the same polymorphic constant, 

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

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

953 

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

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

956 

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

958 
equivalent subgoal on the corresponding raw types. Constants are 

959 
replaced with corresponding ones according to the transfer rules. 

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

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

965 

966 
 relator_eq attribute: Collects identity laws for relators of 

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

968 
transfer method uses these lemmas to infer transfer rules for 

969 
nonpolymorphic constants on the fly. 

970 

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

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

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

974 
after unfolding the constant definitions. 

975 

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

977 
from type nat to type int. 

978 

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

47809  981 

982 
 lift_definition command: Defines operations on an abstract type in 

983 
terms of a corresponding operation on a representation 

984 
type. Example syntax: 

985 

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

987 
is List.insert 

988 

989 
Users must discharge a respectfulness proof obligation when each 

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

991 
the proof is discharged automatically.) The obligation is 

992 
presented in a userfriendly, readable form; a respectfulness 

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

994 
by the package. 

995 

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

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

998 
lift_definition generates a code certificate theorem and sets up 

999 
code generation for each constant. 

1000 

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

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

1003 
or a type_definition theorem. The package configures transfer 

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

1005 
lift_definition command to work with the type. 

1006 

1007 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  1008 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
1009 
Word/Word.thy and Library/Float.thy. 

47809  1010 

1011 
* Quotient package: 

1012 

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

1014 
rep and abs functions, similar to typedef. 

1015 

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

1017 
Transfer packages, as with 'setup_lifting'. 

1018 

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

1020 
respectfulness property at the point where the constant is 

1021 
defined, similar to lift_definition; INCOMPATIBILITY. 

1022 

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

1024 
accordingly, INCOMPATIBILITY. 

1025 

1026 
* New diagnostic command 'find_unused_assms' to find potentially 

1027 
superfluous assumptions in theorems using Quickcheck. 

1028 

1029 
* Quickcheck: 

1030 

1031 
 Quickcheck returns variable assignments as counterexamples, which 

1032 
allows to reveal the underspecification of functions under test. 

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

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

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

1036 

1037 
These counterexample are marked as potentially spurious, as 

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

1039 
obvious theorem "hd xs = hd xs". 

1040 

1041 
After finding a potentially spurious counterexample, Quickcheck 

1042 
continues searching for genuine ones. 

1043 

1044 
By default, Quickcheck shows potentially spurious and genuine 

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

1046 
show genuine counterexamples. 

1047 

1048 
 The command 'quickcheck_generator' creates random and exhaustive 

1049 
value generators for a given type and operations. 

1050 

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

1052 
constructors of that type. 

1053 

1054 
 Support for multisets. 

1055 

1056 
 Added "use_subtype" options. 

1057 

1058 
 Added "quickcheck_locale" configuration to specify how to process 

1059 
conjectures in a locale context. 

1060 

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

47809  1063 

1064 
* Sledgehammer: 

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

1066 
paper "More SPASS with Isabelle". 

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

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

1069 
TFF1), iProver, iProverEq. 

1070 
 Sped up the minimizer. 

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

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

1073 
 Renamed "sound" option to "strict". 

1074 

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

1077 

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

1079 

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

47809  1081 

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

1084 

1085 
list.exhaust [case_product nat.exhaust] 

1086 

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

1088 
a list and a nat. 

1089 

47809  1090 
* New "eventually_elim" method as a generalized variant of the 
47855  1091 
eventually_elim* rules. Supports structured proofs. 
1092 

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

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

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

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

1096 

47856  1097 
* Record: code generation can be switched off manually with 
1098 

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

1100 

1101 
* Datatype: type parameters allow explicit sort constraints. 

1102 

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

1105 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

1107 
one_case. 

1108 

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

1110 
the result of the fact expression. 

1111 

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

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

1115 

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

1116 
converse_def ~> converse_unfold 
47549  1117 
rel_comp_def ~> relcomp_unfold 
47820  1118 
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

1119 
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

1120 
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

1121 
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

1122 

46981  1123 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
1124 

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

47086  1127 

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

1128 
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

1129 

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

46458  1133 
rel_pow_1 ~> relpow_1 
46363  1134 
rel_pow_0_I ~> relpow_0_I 
1135 
rel_pow_Suc_I ~> relpow_Suc_I 

1136 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

1137 
rel_pow_0_E ~> relpow_0_E 

1138 
rel_pow_Suc_E ~> relpow_Suc_E 

1139 
rel_pow_E ~> relpow_E 

46458  1140 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  1141 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  1142 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
1143 
rel_pow_E2 ~> relpow_E2 

1144 
rel_pow_add ~> relpow_add 

1145 
rel_pow_commute ~> relpow 

1146 
rel_pow_empty ~> relpow_empty: 

1147 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

1148 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

1149 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

1150 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

1151 
rel_pow_fun_conv ~> relpow_fun_conv 

1152 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

1153 
rel_pow_finite_bounded ~> relpow_finite_bounded 

1154 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

1155 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

1156 
single_valued_rel_pow ~> single_valued_relpow 

47463  1157 

46363  1158 
INCOMPATIBILITY. 
1159 

47448  1160 
* Theory Relation: Consolidated constant name for relation composition 
47464  1161 
and corresponding theorem names: 
1162 

47549  1163 
 Renamed constant rel_comp to relcomp. 
47464  1164 

47448  1165 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  1166 

47448  1167 
 Renamed theorems: 
47464  1168 

47448  1169 
rel_compI ~> relcompI 
1170 
rel_compEpair ~> relcompEpair 

1171 
rel_compE ~> relcompE 

1172 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

1173 
rel_comp_empty1 ~> relcomp_empty1 

1174 
rel_comp_mono ~> relcomp_mono 

1175 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

1176 
rel_comp_distrib ~> relcomp_distrib 

1177 
rel_comp_distrib2 ~> relcomp_distrib2 

1178 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

1179 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

1180 
single_valued_rel_comp ~> single_valued_relcomp 

47549  1181 
rel_comp_def ~> relcomp_unfold 
47448  1182 
converse_rel_comp ~> converse_relcomp 
1183 
pred_compI ~> relcomppI 

1184 
pred_compE ~> relcomppE 

1185 
pred_comp_bot1 ~> relcompp_bot1 

1186 
pred_comp_bot2 ~> relcompp_bot2 

1187 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

1188 
pred_comp_mono ~> relcompp_mono 

1189 
pred_comp_distrib ~> relcompp_distrib 

1190 
pred_comp_distrib2 ~> relcompp_distrib2 

1191 
converse_pred_comp ~> converse_relcompp 

47464  1192 

47448  1193 
finite_rel_comp ~> finite_relcomp 
47464  1194 

47448  1195 
set_rel_comp ~> set_relcomp 
1196 

1197 
INCOMPATIBILITY. 

1198 

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

1201 

1202 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

1203 
zdiv_self ~> div_self 

1204 
zmod_self ~> mod_self 

1205 
zdiv_zero ~> div_0 

1206 
zmod_zero ~> mod_0 

1207 
zdiv_zmod_equality ~> div_mod_equality2 

1208 
zdiv_zmod_equality2 ~> div_mod_equality 

1209 
zmod_zdiv_trivial ~> mod_div_trivial 

1210 
zdiv_zminus_zminus ~> div_minus_minus 

1211 
zmod_zminus_zminus ~> mod_minus_minus 

1212 
zdiv_zminus2 ~> div_minus_right 

1213 
zmod_zminus2 ~> mod_minus_right 

1214 
zdiv_minus1_right ~> div_minus1_right 

1215 
zmod_minus1_right ~> mod_minus1_right 

1216 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

1217 
zmod_zmult1_eq ~> mod_mult_right_eq 

1218 
zpower_zmod ~> power_mod 

1219 
zdvd_zmod ~> dvd_mod 

1220 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

1221 
mod_mult_distrib ~> mult_mod_left 

1222 
mod_mult_distrib2 ~> mult_mod_right 

1223 

1224 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

1225 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

1226 

47551  1227 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
1228 

47552  1229 
* Consolidated theorem names concerning fold combinators: 
47550  1230 

1231 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

1232 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

1233 
INFI_fold_inf ~> INF_fold_inf 

1234 
SUPR_fold_sup ~> SUP_fold_sup 

1235 
union_set ~> union_set_fold 

1236 
minus_set ~> minus_set_fold 

1237 
INFI_set_fold ~> INF_set_fold 

1238 
SUPR_set_fold ~> SUP_set_fold 

1239 
INF_code ~> INF_set_foldr 

1240 
SUP_code ~> SUP_set_foldr 

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

1242 
foldr_fold_rev ~> foldr_conv_fold 

1243 
foldl_fold ~> foldl_conv_fold 

1244 
foldr_foldr ~> foldr_conv_foldl 

1245 
foldl_foldr ~> foldl_conv_foldr 

47552  1246 
fold_set_remdups ~> fold_set_fold_remdups 
1247 
fold_set ~> fold_set_fold 

1248 
fold1_set ~> fold1_set_fold 

47550  1249 

1250 
INCOMPATIBILITY. 

1251 

1252 
* Dropped rarely useful theorems concerning fold combinators: 

1253 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

1254 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

1255 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

1256 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

1257 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

1258 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

1262 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

1263 

1264 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

1265 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

1266 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

1267 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

1269 
fold_conv_foldr and fold_rev. 

1270 

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

1272 
through option types. 

1273 

47856  1274 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
1275 
relations. 

1276 

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

1278 

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

1280 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

1281 

1282 
zminus_zminus ~> minus_minus 

1283 
zminus_0 ~> minus_zero 

1284 
zminus_zadd_distrib ~> minus_add_distrib 

1285 
zadd_commute ~> add_commute 

1286 
zadd_assoc ~> add_assoc 

1287 
zadd_left_commute ~> add_left_commute 

1288 
zadd_ac ~> add_ac 

1289 
zmult_ac ~> mult_ac 

1290 
zadd_0 ~> add_0_left 

1291 
zadd_0_right ~> add_0_right 

1292 
zadd_zminus_inverse2 ~> left_minus 

1293 
zmult_zminus ~> mult_minus_left 

1294 
zmult_commute ~> mult_commute 

1295 
zmult_assoc ~> mult_assoc 

1296 
zadd_zmult_distrib ~> left_distrib 

1297 
zadd_zmult_distrib2 ~> right_distrib 

1298 
zdiff_zmult_distrib ~> left_diff_distrib 

1299 
zdiff_zmult_distrib2 ~> right_diff_distrib 

1300 
zmult_1 ~> mult_1_left 

1301 
zmult_1_right ~> mult_1_right 

1302 
zle_refl ~> order_refl 

1303 
zle_trans ~> order_trans 

1304 
zle_antisym ~> order_antisym 

1305 
zle_linear ~> linorder_linear 

1306 
zless_linear ~> linorder_less_linear 

1307 
zadd_left_mono ~> add_left_mono 

1308 
zadd_strict_right_mono ~> add_strict_right_mono 

1309 
zadd_zless_mono ~> add_less_le_mono 

1310 
int_0_less_1 ~> zero_less_one 

1311 
int_0_neq_1 ~> zero_neq_one 

1312 
zless_le ~> less_le 

1313 
zpower_zadd_distrib ~> power_add 

1314 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

1315 
zero_le_zpower_abs ~> zero_le_power_abs 

1316 

1317 
* Theory Deriv: Renamed 

1318 

1319 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

1320 

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

1322 

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

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

1327 
INCOMPATIBILITY. 

1328 

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

1331 

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

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

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

1336 
follows: 

47452  1337 

1338 
Operations: 

1339 
bulkload > rbt_bulkload 

1340 
del_from_left > rbt_del_from_left 

1341 
del_from_right > rbt_del_from_right 

1342 
del > rbt_del 

1343 
delete > rbt_delete 

1344 
ins > rbt_ins 

1345 
insert > rbt_insert 

1346 
insertw > rbt_insert_with 

1347 
insert_with_key > rbt_insert_with_key 

1348 
map_entry > rbt_map_entry 

1349 
lookup > rbt_lookup 

1350 
sorted > rbt_sorted 

1351 
tree_greater > rbt_greater 

1352 
tree_less > rbt_less 

1353 
tree_less_symbol > rbt_less_symbol 

1354 
union > rbt_union 

1355 
union_with > rbt_union_with 

1356 
union_with_key > rbt_union_with_key 

1357 

1358 
Lemmas: 

1359 
balance_left_sorted > balance_left_rbt_sorted 

1360 
balance_left_tree_greater > balance_left_rbt_greater 

1361 
balance_left_tree_less > balance_left_rbt_less 

1362 
balance_right_sorted > balance_right_rbt_sorted 

1363 
balance_right_tree_greater > balance_right_rbt_greater 

1364 
balance_right_tree_less > balance_right_rbt_less 

1365 
balance_sorted > balance_rbt_sorted 

1366 
balance_tree_greater > balance_rbt_greater 

1367 
balance_tree_less > balance_rbt_less 

1368 
bulkload_is_rbt > rbt_bulkload_is_rbt 

1369 
combine_sorted > combine_rbt_sorted 

1370 
combine_tree_greater > combine_rbt_greater 

1371 
combine_tree_less > combine_rbt_less 

1372 
delete_in_tree > rbt_delete_in_tree 

1373 
delete_is_rbt > rbt_delete_is_rbt 

1374 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

1375 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

1376 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

1377 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

1378 
del_in_tree > rbt_del_in_tree 

1379 
del_inv1_inv2 > rbt_del_inv1_inv2 

1380 
del_sorted > rbt_del_rbt_sorted 

1381 
del_tree_greater > rbt_del_rbt_greater 

1382 
del_tree_less > rbt_del_rbt_less 

1383 
dom_lookup_Branch > dom_rbt_lookup_Branch 

1384 
entries_lookup > entries_rbt_lookup 

1385 
finite_dom_lookup > finite_dom_rbt_lookup 

1386 
insert_sorted > rbt_insert_rbt_sorted 

1387 
insertw_is_rbt > rbt_insertw_is_rbt 

1388 
insertwk_is_rbt > rbt_insertwk_is_rbt 

1389 
insertwk_sorted > rbt_insertwk_rbt_sorted 

1390 
insertw_sorted > rbt_insertw_rbt_sorted 

1391 
ins_sorted > ins_rbt_sorted 

1392 
ins_tree_greater > ins_rbt_greater 

1393 
ins_tree_less > ins_rbt_less 

1394 
is_rbt_sorted > is_rbt_rbt_sorted 

1395 
lookup_balance > rbt_lookup_balance 

1396 
lookup_bulkload > rbt_lookup_rbt_bulkload 

1397 
lookup_delete > rbt_lookup_rbt_delete 

1398 
lookup_Empty > rbt_lookup_Empty 

1399 
lookup_from_in_tree > rbt_lookup_from_in_tree 

1400 
lookup_in_tree > rbt_lookup_in_tree 

1401 
lookup_ins > rbt_lookup_ins 

1402 
lookup_insert > rbt_lookup_rbt_insert 

1403 
lookup_insertw > rbt_lookup_rbt_insertw 

1404 
lookup_insertwk > rbt_lookup_rbt_insertwk 

1405 
lookup_keys > rbt_lookup_keys 

1406 
lookup_map > rbt_lookup_map 

1407 
lookup_map_entry > rbt_lookup_rbt_map_entry 

1408 
lookup_tree_greater > rbt_lookup_rbt_greater 

1409 
lookup_tree_less > rbt_lookup_rbt_less 

1410 
lookup_union > rbt_lookup_rbt_union 

1411 
map_entry_color_of > rbt_map_entry_color_of 

1412 
map_entry_inv1 > rbt_map_entry_inv1 

1413 
map_entry_inv2 > rbt_map_entry_inv2 

1414 
map_entry_is_rbt > rbt_map_entry_is_rbt 

1415 
map_entry_sorted > rbt_map_entry_rbt_sorted 

1416 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

1417 
map_entry_tree_less > rbt_map_entry_rbt_less 

1418 
map_tree_greater > map_rbt_greater 

1419 
map_tree_less > map_rbt_less 

1420 
map_sorted > map_rbt_sorted 

1421 
paint_sorted > paint_rbt_sorted 

1422 
paint_lookup > paint_rbt_lookup 

1423 
paint_tree_greater > paint_rbt_greater 

1424 
paint_tree_less > paint_rbt_less 

1425 
sorted_entries > rbt_sorted_entries 

1426 
tree_greater_eq_trans > rbt_greater_eq_trans 

1427 
tree_greater_nit > rbt_greater_nit 

1428 
tree_greater_prop > rbt_greater_prop 

1429 
tree_greater_simps > rbt_greater_simps 

1430 
tree_greater_trans > rbt_greater_trans 

1431 
tree_less_eq_trans > rbt_less_eq_trans 
