author  wenzelm 
Sat, 25 May 2013 17:13:34 +0200  
changeset 52146  ceb31e1ded30 
parent 52143  36ffe23b25f8 
child 52148  893b15200ec1 
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 

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

66 
is separated from the datatype package. The declaration attribute 

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

68 

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

70 

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

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

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

76 
This is now identity on infinite sets. 

77 
 Locales (»mini packages«) for fundamental definitions with 

78 
Finite_Set.fold: folding, folding_idem. 

79 
 Locales comm_monoid_set, semilattice_order_set and 

80 
semilattice_neutr_order_set for big operators on sets. 

81 
See theory Big_Operators for canonical examples. 

82 
Note that foundational constants comm_monoid_set.F and 

83 
semilattice_set.F correspond to former combinators fold_image 

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

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

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

89 
 Fact renames: 

90 
card.union_inter ~> card_Un_Int [symmetric] 

91 
card.union_disjoint ~> card_Un_disjoint 

92 

93 
INCOMPATIBILITY. 

94 

51487  95 
* Locale hierarchy for abstract orderings and (semi)lattices. 
96 

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

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

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

99 

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

102 

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

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

104 
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

105 
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

106 
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

107 
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

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

109 

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

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

111 
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

112 
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

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

114 

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

118 
Removed SupInf and replaced it by the instantiation of 

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

121 
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

122 

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

123 
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

124 
lattices and inner dense linorders which have more than one element. 
51732  125 
INCOMPATIBILITY. 
126 

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

128 
and bottom elements. 

129 

130 
* Split dense_linorder into inner_dense_order and no_top, no_bot. 

131 

132 
* Complex_Main: Unify and move various concepts from 

133 
HOLMultivariate_Analysis to HOLComplex_Main. 

134 

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

135 
 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

136 
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

137 
Instances are reals and extended reals. 
51732  138 

139 
 continuous and continuos_on from Multivariate_Analysis: 

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

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

142 

143 
Generalized continuity lemmas from isCont to continuous on an arbitrary 

144 
filter. 

145 

146 
 compact from Multivariate_Analysis. Use Bolzano's lemma 

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

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

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

150 

151 
 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

152 
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

153 
linear_continuum_topology). 
51732  154 

155 
 first_countable_topology from Multivariate_Analysis. Is used to 

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

157 
all sequences converging to x. 

158 

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

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

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

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

163 

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

165 

166 
F within X = inf F (principal X) 

167 

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

169 
abbreviation for "at x within UNIV" 

170 

171 
 Introduce named theorem collections tendsto_intros, continuous_intros, 

172 
continuous_on_intros and FDERIV_intros. Theorems in tendsto_intros (or 

173 
FDERIV_intros) are also available as tendsto_eq_intros (or 

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

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

176 
equivalence by the simplifier. 

177 

178 
 Restructured theories in HOLComplex_Main: 

179 

180 
+ Moved RealDef and RComplete into Real 

181 

182 
+ Introduced Topological_Spaces and moved theorems about 

183 
topological spaces, filters, limits and continuity to it 

184 

185 
+ Renamed RealVector to Real_Vector_Spaces 

186 

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

188 
Limits 

189 

190 
+ Moved Ln and Log to Transcendental 

191 

192 
+ Moved theorems about continuity from Deriv to Topological_Spaces 

193 

194 
 Remove various auxiliary lemmas. 

195 

196 
INCOMPATIBILITY. 

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

197 

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

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

199 

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

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

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

202 

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

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

204 

51137  205 
* Sledgehammer: 
206 

207 
 Renamed option: 

208 
isar_shrink ~> isar_compress 

209 

50994  210 

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

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

212 

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

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

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

215 
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

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

217 

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

218 

51551  219 
*** ML *** 
220 

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

222 

223 
Skip_Proof.prove ~> Goal.prove_sorry 

224 
Skip_Proof.prove_global ~> Goal.prove_sorry_global 

225 

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

228 

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

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

230 
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

231 
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

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

233 

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

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

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

236 
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

237 
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

238 
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

239 
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

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

241 

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

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

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

244 

51551  245 

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

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

247 

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

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

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

250 

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

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

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

253 

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

256 

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

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

258 
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

259 

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

260 

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

261 

50993  262 
New in Isabelle2013 (February 2013) 
263 
 

47887  264 

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

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

266 

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

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

268 
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

269 
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

270 
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

271 
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

272 
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

273 
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

274 

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

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

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

279 

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

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

281 
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

282 

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

285 
Tools that load their additional source files may imitate the 

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

287 
dependencies properly. 

288 

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

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

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

291 

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

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

294 

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

49841  297 
and "class ... context ...". 
298 

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

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

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

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

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

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

305 

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

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

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

308 

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

311 

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

312 

49968  313 
*** Prover IDE  Isabelle/Scala/jEdit *** 
314 

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

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

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

318 
surface, while the prover is still crunching on internal 

319 
justifications. Unfinished / cancelled proofs are restarted as 

320 
required to complete full proof checking eventually. 

321 

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

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

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

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

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

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

328 

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

331 
browser on demand. 

332 

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

335 
comment delimiters works more conveniently with unfinished situations 

336 
that frequently occur in user interaction. 

337 

338 
* More efficient painting and improved reactivity when editing large 

339 
files. More scalable management of formal document content. 

340 

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

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

342 
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

343 
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

344 
potentially infinite message streams. 
49968  345 

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

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

348 
options, including tuning parameters for editor reactivity and color 

349 
schemes. 

350 

50184  351 
* Dockable window "Symbols" provides some editing support for Isabelle 
352 
symbols. 

353 

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

50701  356 

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

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

360 

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

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

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

50183  365 

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

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

369 

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

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

371 
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

372 
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

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

374 

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

377 
now bundled exclusively with Isabelle. 

378 

379 

48205  380 
*** Pure *** 
381 

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

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

383 
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

384 

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

387 
rather arbitrary current working directory. INCOMPATIBILITY. 

48371  388 

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

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

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

393 
with some care where this is really required. 

394 

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

51063  397 
given sort. Example (in HOL): 
48792  398 

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

400 

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

403 

48205  404 

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

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

406 

50646  407 
* Sledgehammer: 
408 

409 
 Added MaSh relevance filter based on machinelearning; see the 

410 
Sledgehammer manual for details. 

411 
 Polished Isar proofs generated with "isar_proofs" option. 

412 
 Rationalized type encodings ("type_enc" option). 

50720  413 
 Renamed "kill_provers" subcommand to "kill_all". 
50646  414 
 Renamed options: 
415 
isar_proof ~> isar_proofs 

416 
isar_shrink_factor ~> isar_shrink 

417 
max_relevant ~> max_facts 

418 
relevance_thresholds ~> fact_thresholds 

419 

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

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

422 
configuration quickcheck_optimise_equality to false. 

423 

50878  424 
* Quotient: only one quotient can be defined by quotient_type 
425 
INCOMPATIBILITY. 

426 

427 
* Lifting: 

428 
 generation of an abstraction function equation in lift_definition 

429 
 quot_del attribute 

430 
 renamed no_abs_code > no_code (INCOMPATIBILITY.) 

431 

50646  432 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
433 
expressions. 

434 

435 
* Preprocessing of the code generator rewrites set comprehensions into 

436 
pointfree expressions. 

437 

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

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

440 
arithmetic, datatypes/records) with potential proof reconstruction 

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

442 
INCOMPATIBILITY. 

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

443 

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

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

445 
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

446 
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

447 
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

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

449 

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

452 

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

454 
List. INCOMPATIBILITY. 

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

455 

49739  456 
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. 
457 

49738  458 
* Class "comm_monoid_diff" formalises properties of bounded 
49388  459 
subtraction, with natural numbers and multisets as typical instances. 
460 

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

463 
* Theory "Transitive_Closure": renamed lemmas 

464 

465 
reflcl_tranclp > reflclp_tranclp 

466 
rtranclp_reflcl > rtranclp_reflclp 

467 

468 
INCOMPATIBILITY. 

469 

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

471 

472 
left_distrib ~> distrib_right 

473 
right_distrib ~> distrib_left 

474 

475 
INCOMPATIBILITY. 

476 

477 
* Generalized the definition of limits: 

478 

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

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

481 
output f x converges to G. 

482 

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

484 
infinity (at_bot). 

485 

486 
 Moved infinity in the norm (at_infinity) from 

487 
Multivariate_Analysis to Complex_Main. 

488 

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

490 
at_top". 

491 

492 
INCOMPATIBILITY. 

493 

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

495 
lattice type classes. 

496 

497 
* Theory "Library/Multiset": renamed 

498 

499 
constant fold_mset ~> Multiset.fold 

500 
fact fold_mset_commute ~> fold_mset_comm 

501 

502 
INCOMPATIBILITY. 

503 

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

505 
changes as follows. 

506 

507 
 Renamed constants (and related lemmas) 

49145  508 

509 
prefix ~> prefixeq 

510 
strict_prefix ~> prefix 

511 

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

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

515 
Renamed lemmas accordingly. 

516 

517 
 Added constant "list_hembeq" for homeomorphic embedding on 

518 
lists. Added abbreviation "sublisteq" for special case 

519 
"list_hembeq (op =)". 

520 

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

522 
class instances for the prefix order (merely corresponding locale 

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

524 
Library/Prefix_Order. 

525 

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

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

50516  528 

529 
le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff 

530 
le_list_append_mono ~> Sublist.list_hembeq_append_mono 

531 
le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2 

532 
le_list_Cons_EX ~> Sublist.list_hembeq_ConsD 

533 
le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2' 

534 
le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq 

535 
le_list_drop_Cons ~> Sublist.sublisteq_Cons' 

536 
le_list_drop_many ~> Sublist.sublisteq_drop_many 

537 
le_list_filter_left ~> Sublist.sublisteq_filter_left 

538 
le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many 

539 
le_list_rev_take_iff ~> Sublist.sublisteq_append 

540 
le_list_same_length ~> Sublist.sublisteq_same_length 

541 
le_list_take_many_iff ~> Sublist.sublisteq_append' 

49145  542 
less_eq_list.drop ~> less_eq_list_drop 
543 
less_eq_list.induct ~> less_eq_list_induct 

50516  544 
not_le_list_length ~> Sublist.not_sublisteq_length 
49145  545 

50646  546 
INCOMPATIBILITY. 
547 

548 
* New theory Library/Countable_Set. 

549 

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

551 
parallel execution for code generated towards Isabelle/ML. 

552 

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

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

555 
extensional_funcset by an abbreviation, and renamed lemmas from 

556 
extensional_funcset to PiE as follows: 

557 

558 
extensional_empty ~> PiE_empty 

559 
extensional_funcset_empty_domain ~> PiE_empty_domain 

560 
extensional_funcset_empty_range ~> PiE_empty_range 

561 
extensional_funcset_arb ~> PiE_arb 

562 
extensional_funcset_mem ~> PiE_mem 

563 
extensional_funcset_extend_domainI ~> PiE_fun_upd 

564 
extensional_funcset_restrict_domain ~> fun_upd_in_PiE 

565 
extensional_funcset_extend_domain_eq ~> PiE_insert_eq 

566 
card_extensional_funcset ~> card_PiE 

567 
finite_extensional_funcset ~> finite_PiE 

568 

569 
INCOMPATIBILITY. 

570 

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

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

573 
Data"). 

574 

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

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

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

578 
code. 

579 

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

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

582 
return a structurally different tree than before. Potential 

583 
INCOMPATIBILITY. 

584 

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

586 

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

588 

589 
* HOL/Multivariate_Analysis: replaced 

590 

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

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

593 

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

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

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

597 

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

599 

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

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

602 
cart_base i removed 

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

604 

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

605 
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

606 

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

607 
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

608 

50646  609 
component_le_norm ~> Basis_le_norm 
610 
euclidean_eq ~> euclidean_eq_iff 

611 
differential_zero_maxmin_component ~> differential_zero_maxmin_cart 

612 
euclidean_simps ~> inner_simps 

613 
independent_basis ~> independent_Basis 

614 
span_basis ~> span_Basis 

615 
in_span_basis ~> in_span_Basis 

616 
norm_bound_component_le ~> norm_boound_Basis_le 

617 
norm_bound_component_lt ~> norm_boound_Basis_lt 

618 
component_le_infnorm ~> Basis_le_infnorm 

619 

620 
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

621 

50141  622 
* HOL/Probability: 
50646  623 

624 
 Added simproc "measurable" to automatically prove measurability. 

625 

626 
 Added induction rules for sigma sets with disjoint union 

627 
(sigma_sets_induct_disjoint) and for Borelmeasurable functions 

628 
(borel_measurable_induct). 

629 

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

631 
projective family). 

632 

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

634 
AFP entry "Ordinals_and_Cardinals"). 

635 

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

637 
with support for mixed, nested recursion and interesting nonfree 

638 
datatypes. 

48094  639 

50991  640 
* HOL/Finite_Set and Relation: added new set and relation operations 
50878  641 
expressed by Finite_Set.fold. 
642 

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

644 
trees for the code generator. 

645 

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

647 
Lifting/Transfer. 

648 
possible INCOMPATIBILITY. 

649 

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

651 
INCOMPATIBILITY. 

652 

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

653 

48206  654 
*** Document preparation *** 
655 

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

658 
Discontinued legacy styles "prem1" .. "prem19". 

659 

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

661 
instead of slightly exotic babel/greek. 

48206  662 

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

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

664 
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

665 
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

666 

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

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

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

669 

48206  670 

48992  671 
*** ML *** 
672 

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

675 
hardware and Poly/ML runtime system. 

676 

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

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

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

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

680 

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

683 
necessarily printing visible text. 

684 

685 

48206  686 
*** System *** 
687 

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

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

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

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

693 
document preparation as well. INCOMPATIBILITY, isabelle usedir / 

48736  694 
mkdir / make are rendered obsolete. 
695 

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

698 

699 
isabelle build s b HOL 

700 

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

702 

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

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

704 
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

705 
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

706 
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

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

708 

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

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

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

711 

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

714 

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

716 
INCOMPATIBILITY. 

717 

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

720 
version of Isabelle. 

721 

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

724 

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

726 
picked up from some surrounding directory. Potential INCOMPATIBILITY 

727 
for homemade settings. 

50132  728 

50701  729 
* Improved ML runtime statistics (heap, threads, future tasks etc.). 
730 

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

733 
configuration. 

734 

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

737 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

739 
bundled as Isabelle component. 

48206  740 

50182  741 

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

742 

47462  743 
New in Isabelle2012 (May 2012) 
744 
 

45109  745 

45593  746 
*** General *** 
747 

45614  748 
* Prover IDE (PIDE) improvements: 
749 

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

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

45614  757 

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

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

46485  761 

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

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

763 
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

764 
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

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

766 
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

767 

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

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

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

770 
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

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

772 

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

773 
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

774 

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

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

776 

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

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

778 

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

779 
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

780 
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

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

782 

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

783 
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

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

785 

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

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

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

47484  791 

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

794 
oldstyle "standard" after instantiation or composition of facts 

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

796 
indices of schematic variables. 

797 

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

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

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

801 
the historic accident of dynamic reevaluation in interpretations 

802 
etc. was exploited. 

803 

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

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

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

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

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

809 
of the material of that old tutorial. 

810 

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

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

813 
manual. 

814 

815 

816 
*** Pure *** 

817 

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

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

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

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

821 

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

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

825 
undocumented feature.) 

826 

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

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

830 

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

832 

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

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

835 

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

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

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

839 
order to accommodate newly introduced premises.) 

840 

47806  841 
* Renamed some inner syntax categories: 
842 

843 
num ~> num_token 

844 
xnum ~> xnum_token 

845 
xstr ~> str_token 

846 

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

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

849 
position information via constraints). 

850 

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

853 
manual. Minor INCOMPATIBILITY. 

854 

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

45134  857 

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

860 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  861 

47464  862 
* Redundant attribute "code_inline" has been discontinued. Use 
863 
"code_unfold" instead. INCOMPATIBILITY. 

864 

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

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

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

867 

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

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

869 

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

870 
INCOMPATIBILITY. 
45383  871 

47856  872 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
873 
instead. INCOMPATIBILITY. 

874 

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

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

877 
legacy since Isabelle2011). 

47855  878 

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

879 

45122  880 
*** HOL *** 
881 

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

884 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

889 
tinkering with former theorems mem_def and Collect_def as far as 

890 
possible. 

891 

892 
For developments which deliberately mix predicates and sets, a 

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

895 
Isabelle20111 before jumping right into the current release. 

896 

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

899 

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

901 

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

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

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

907 
user theories may require adaptations as follows: 

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

908 

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

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

910 
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

911 

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

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

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

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

915 

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

916 
 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

917 
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

918 

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

919 
 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

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

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

922 

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

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

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

925 

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

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

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

930 
corresponding parts of the Quotient package.) 

47809  931 

932 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

934 
relate different type instances of the same polymorphic constant, 

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

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

937 

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

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

940 

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

942 
equivalent subgoal on the corresponding raw types. Constants are 

943 
replaced with corresponding ones according to the transfer rules. 

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

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

949 

950 
 relator_eq attribute: Collects identity laws for relators of 

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

952 
transfer method uses these lemmas to infer transfer rules for 

953 
nonpolymorphic constants on the fly. 

954 

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

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

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

958 
after unfolding the constant definitions. 

959 

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

961 
from type nat to type int. 

962 

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

47809  965 

966 
 lift_definition command: Defines operations on an abstract type in 

967 
terms of a corresponding operation on a representation 

968 
type. Example syntax: 

969 

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

971 
is List.insert 

972 

973 
Users must discharge a respectfulness proof obligation when each 

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

975 
the proof is discharged automatically.) The obligation is 

976 
presented in a userfriendly, readable form; a respectfulness 

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

978 
by the package. 

979 

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

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

982 
lift_definition generates a code certificate theorem and sets up 

983 
code generation for each constant. 

984 

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

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

987 
or a type_definition theorem. The package configures transfer 

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

989 
lift_definition command to work with the type. 

990 

991 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  992 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
993 
Word/Word.thy and Library/Float.thy. 

47809  994 

995 
* Quotient package: 

996 

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

998 
rep and abs functions, similar to typedef. 

999 

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

1001 
Transfer packages, as with 'setup_lifting'. 

1002 

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

1004 
respectfulness property at the point where the constant is 

1005 
defined, similar to lift_definition; INCOMPATIBILITY. 

1006 

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

1008 
accordingly, INCOMPATIBILITY. 

1009 

1010 
* New diagnostic command 'find_unused_assms' to find potentially 

1011 
superfluous assumptions in theorems using Quickcheck. 

1012 

1013 
* Quickcheck: 

1014 

1015 
 Quickcheck returns variable assignments as counterexamples, which 

1016 
allows to reveal the underspecification of functions under test. 

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

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

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

1020 

1021 
These counterexample are marked as potentially spurious, as 

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

1023 
obvious theorem "hd xs = hd xs". 

1024 

1025 
After finding a potentially spurious counterexample, Quickcheck 

1026 
continues searching for genuine ones. 

1027 

1028 
By default, Quickcheck shows potentially spurious and genuine 

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

1030 
show genuine counterexamples. 

1031 

1032 
 The command 'quickcheck_generator' creates random and exhaustive 

1033 
value generators for a given type and operations. 

1034 

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

1036 
constructors of that type. 

1037 

1038 
 Support for multisets. 

1039 

1040 
 Added "use_subtype" options. 

1041 

1042 
 Added "quickcheck_locale" configuration to specify how to process 

1043 
conjectures in a locale context. 

1044 

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

47809  1047 

1048 
* Sledgehammer: 

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

1050 
paper "More SPASS with Isabelle". 

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

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

1053 
TFF1), iProver, iProverEq. 

1054 
 Sped up the minimizer. 

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

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

1057 
 Renamed "sound" option to "strict". 

1058 

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

1061 

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

1063 

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

47809  1065 

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

1068 

1069 
list.exhaust [case_product nat.exhaust] 

1070 

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

1072 
a list and a nat. 

1073 

47809  1074 
* New "eventually_elim" method as a generalized variant of the 
47855  1075 
eventually_elim* rules. Supports structured proofs. 
1076 

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

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

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

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

1080 

47856  1081 
* Record: code generation can be switched off manually with 
1082 

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

1084 

1085 
* Datatype: type parameters allow explicit sort constraints. 

1086 

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

1089 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

1091 
one_case. 

1092 

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

1094 
the result of the fact expression. 

1095 

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

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

1099 

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

1100 
converse_def ~> converse_unfold 
47549  1101 
rel_comp_def ~> relcomp_unfold 
47820  1102 
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

1103 
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

1104 
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

1105 
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

1106 

46981  1107 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
1108 

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

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

1113 

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

46458  1117 
rel_pow_1 ~> relpow_1 
46363  1118 
rel_pow_0_I ~> relpow_0_I 
1119 
rel_pow_Suc_I ~> relpow_Suc_I 

1120 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

1121 
rel_pow_0_E ~> relpow_0_E 

1122 
rel_pow_Suc_E ~> relpow_Suc_E 

1123 
rel_pow_E ~> relpow_E 

46458  1124 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  1125 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  1126 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
1127 
rel_pow_E2 ~> relpow_E2 

1128 
rel_pow_add ~> relpow_add 

1129 
rel_pow_commute ~> relpow 

1130 
rel_pow_empty ~> relpow_empty: 

1131 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

1132 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

1133 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

1134 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

1135 
rel_pow_fun_conv ~> relpow_fun_conv 

1136 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

1137 
rel_pow_finite_bounded ~> relpow_finite_bounded 

1138 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

1139 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

1140 
single_valued_rel_pow ~> single_valued_relpow 

47463  1141 

46363  1142 
INCOMPATIBILITY. 
1143 

47448  1144 
* Theory Relation: Consolidated constant name for relation composition 
47464  1145 
and corresponding theorem names: 
1146 

47549  1147 
 Renamed constant rel_comp to relcomp. 
47464  1148 

47448  1149 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  1150 

47448  1151 
 Renamed theorems: 
47464  1152 

47448  1153 
rel_compI ~> relcompI 
1154 
rel_compEpair ~> relcompEpair 

1155 
rel_compE ~> relcompE 

1156 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

1157 
rel_comp_empty1 ~> relcomp_empty1 

1158 
rel_comp_mono ~> relcomp_mono 

1159 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

1160 
rel_comp_distrib ~> relcomp_distrib 

1161 
rel_comp_distrib2 ~> relcomp_distrib2 

1162 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

1163 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

1164 
single_valued_rel_comp ~> single_valued_relcomp 

47549  1165 
rel_comp_def ~> relcomp_unfold 
47448  1166 
converse_rel_comp ~> converse_relcomp 
1167 
pred_compI ~> relcomppI 

1168 
pred_compE ~> relcomppE 

1169 
pred_comp_bot1 ~> relcompp_bot1 

1170 
pred_comp_bot2 ~> relcompp_bot2 

1171 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

1172 
pred_comp_mono ~> relcompp_mono 

1173 
pred_comp_distrib ~> relcompp_distrib 

1174 
pred_comp_distrib2 ~> relcompp_distrib2 

1175 
converse_pred_comp ~> converse_relcompp 

47464  1176 

47448  1177 
finite_rel_comp ~> finite_relcomp 
47464  1178 

47448  1179 
set_rel_comp ~> set_relcomp 
1180 

1181 
INCOMPATIBILITY. 

1182 

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

1185 

1186 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

1187 
zdiv_self ~> div_self 

1188 
zmod_self ~> mod_self 

1189 
zdiv_zero ~> div_0 

1190 
zmod_zero ~> mod_0 

1191 
zdiv_zmod_equality ~> div_mod_equality2 

1192 
zdiv_zmod_equality2 ~> div_mod_equality 

1193 
zmod_zdiv_trivial ~> mod_div_trivial 

1194 
zdiv_zminus_zminus ~> div_minus_minus 

1195 
zmod_zminus_zminus ~> mod_minus_minus 

1196 
zdiv_zminus2 ~> div_minus_right 

1197 
zmod_zminus2 ~> mod_minus_right 

1198 
zdiv_minus1_right ~> div_minus1_right 

1199 
zmod_minus1_right ~> mod_minus1_right 

1200 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

1201 
zmod_zmult1_eq ~> mod_mult_right_eq 

1202 
zpower_zmod ~> power_mod 

1203 
zdvd_zmod ~> dvd_mod 

1204 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

1205 
mod_mult_distrib ~> mult_mod_left 

1206 
mod_mult_distrib2 ~> mult_mod_right 

1207 

1208 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

1209 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

1210 

47551  1211 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
1212 

47552  1213 
* Consolidated theorem names concerning fold combinators: 
47550  1214 

1215 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

1216 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

1217 
INFI_fold_inf ~> INF_fold_inf 

1218 
SUPR_fold_sup ~> SUP_fold_sup 

1219 
union_set ~> union_set_fold 

1220 
minus_set ~> minus_set_fold 

1221 
INFI_set_fold ~> INF_set_fold 

1222 
SUPR_set_fold ~> SUP_set_fold 

1223 
INF_code ~> INF_set_foldr 

1224 
SUP_code ~> SUP_set_foldr 

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

1226 
foldr_fold_rev ~> foldr_conv_fold 

1227 
foldl_fold ~> foldl_conv_fold 

1228 
foldr_foldr ~> foldr_conv_foldl 

1229 
foldl_foldr ~> foldl_conv_foldr 

47552  1230 
fold_set_remdups ~> fold_set_fold_remdups 
1231 
fold_set ~> fold_set_fold 

1232 
fold1_set ~> fold1_set_fold 

47550  1233 

1234 
INCOMPATIBILITY. 

1235 

1236 
* Dropped rarely useful theorems concerning fold combinators: 

1237 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

1238 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

1239 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

1240 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

1241 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

1242 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

1246 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

1247 

1248 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

1249 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

1250 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

1251 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

1253 
fold_conv_foldr and fold_rev. 

1254 

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

1256 
through option types. 

1257 

47856  1258 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
1259 
relations. 

1260 

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

1262 

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

1264 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

1265 

1266 
zminus_zminus ~> minus_minus 

1267 
zminus_0 ~> minus_zero 

1268 
zminus_zadd_distrib ~> minus_add_distrib 

1269 
zadd_commute ~> add_commute 

1270 
zadd_assoc ~> add_assoc 

1271 
zadd_left_commute ~> add_left_commute 

1272 
zadd_ac ~> add_ac 

1273 
zmult_ac ~> mult_ac 

1274 
zadd_0 ~> add_0_left 

1275 
zadd_0_right ~> add_0_right 

1276 
zadd_zminus_inverse2 ~> left_minus 

1277 
zmult_zminus ~> mult_minus_left 

1278 
zmult_commute ~> mult_commute 

1279 
zmult_assoc ~> mult_assoc 

1280 
zadd_zmult_distrib ~> left_distrib 

1281 
zadd_zmult_distrib2 ~> right_distrib 

1282 
zdiff_zmult_distrib ~> left_diff_distrib 

1283 
zdiff_zmult_distrib2 ~> right_diff_distrib 

1284 
zmult_1 ~> mult_1_left 

1285 
zmult_1_right ~> mult_1_right 

1286 
zle_refl ~> order_refl 

1287 
zle_trans ~> order_trans 

1288 
zle_antisym ~> order_antisym 

1289 
zle_linear ~> linorder_linear 

1290 
zless_linear ~> linorder_less_linear 

1291 
zadd_left_mono ~> add_left_mono 

1292 
zadd_strict_right_mono ~> add_strict_right_mono 

1293 
zadd_zless_mono ~> add_less_le_mono 

1294 
int_0_less_1 ~> zero_less_one 

1295 
int_0_neq_1 ~> zero_neq_one 

1296 
zless_le ~> less_le 

1297 
zpower_zadd_distrib ~> power_add 

1298 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

1299 
zero_le_zpower_abs ~> zero_le_power_abs 

1300 

1301 
* Theory Deriv: Renamed 

1302 

1303 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

1304 

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

1306 

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

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

1311 
INCOMPATIBILITY. 

1312 

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

1315 

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

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

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

1320 
follows: 

47452  1321 

1322 
Operations: 

1323 
bulkload > rbt_bulkload 

1324 
del_from_left > rbt_del_from_left 

1325 
del_from_right > rbt_del_from_right 

1326 
del > rbt_del 

1327 
delete > rbt_delete 

1328 
ins > rbt_ins 

1329 
insert > rbt_insert 

1330 
insertw > rbt_insert_with 

1331 
insert_with_key > rbt_insert_with_key 

1332 
map_entry > rbt_map_entry 

1333 
lookup > rbt_lookup 

1334 
sorted > rbt_sorted 

1335 
tree_greater > rbt_greater 

1336 
tree_less > rbt_less 

1337 
tree_less_symbol > rbt_less_symbol 

1338 
union > rbt_union 

1339 
union_with > rbt_union_with 

1340 
union_with_key > rbt_union_with_key 

1341 

1342 
Lemmas: 

1343 
balance_left_sorted > balance_left_rbt_sorted 

1344 
balance_left_tree_greater > balance_left_rbt_greater 

1345 
balance_left_tree_less > balance_left_rbt_less 

1346 
balance_right_sorted > balance_right_rbt_sorted 

1347 
balance_right_tree_greater > balance_right_rbt_greater 

1348 
balance_right_tree_less > balance_right_rbt_less 

1349 
balance_sorted > balance_rbt_sorted 

1350 
balance_tree_greater > balance_rbt_greater 

1351 
balance_tree_less > balance_rbt_less 

1352 
bulkload_is_rbt > rbt_bulkload_is_rbt 

1353 
combine_sorted > combine_rbt_sorted 

1354 
combine_tree_greater > combine_rbt_greater 

1355 
combine_tree_less > combine_rbt_less 

1356 
delete_in_tree > rbt_delete_in_tree 

1357 
delete_is_rbt > rbt_delete_is_rbt 

1358 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

1359 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

1360 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

1361 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

1362 
del_in_tree > rbt_del_in_tree 

1363 
del_inv1_inv2 > rbt_del_inv1_inv2 

1364 
del_sorted > rbt_del_rbt_sorted 

1365 
del_tree_greater > rbt_del_rbt_greater 

1366 
del_tree_less > rbt_del_rbt_less 

1367 
dom_lookup_Branch > dom_rbt_lookup_Branch 

1368 
entries_lookup > entries_rbt_lookup 

1369 
finite_dom_lookup > finite_dom_rbt_lookup 

1370 
insert_sorted > rbt_insert_rbt_sorted 

1371 
insertw_is_rbt > rbt_insertw_is_rbt 

1372 
insertwk_is_rbt > rbt_insertwk_is_rbt 

1373 
insertwk_sorted > rbt_insertwk_rbt_sorted 

1374 
insertw_sorted > rbt_insertw_rbt_sorted 

1375 
ins_sorted > ins_rbt_sorted 

1376 
ins_tree_greater > ins_rbt_greater 

1377 
ins_tree_less > ins_rbt_less 

1378 
is_rbt_sorted > is_rbt_rbt_sorted 

1379 
lookup_balance > rbt_lookup_balance 

1380 
lookup_bulkload > rbt_lookup_rbt_bulkload 

1381 
lookup_delete > rbt_lookup_rbt_delete 

1382 
lookup_Empty > rbt_lookup_Empty 

1383 
lookup_from_in_tree > rbt_lookup_from_in_tree 

1384 
lookup_in_tree > rbt_lookup_in_tree 

1385 
lookup_ins > rbt_lookup_ins 

1386 
lookup_insert > rbt_lookup_rbt_insert 

1387 
lookup_insertw > rbt_lookup_rbt_insertw 

1388 
lookup_insertwk > rbt_lookup_rbt_insertwk 

1389 
lookup_keys > rbt_lookup_keys 

1390 
lookup_map > rbt_lookup_map 

1391 
lookup_map_entry > rbt_lookup_rbt_map_entry 

1392 
lookup_tree_greater > rbt_lookup_rbt_greater 

1393 
lookup_tree_less > rbt_lookup_rbt_less 

1394 
lookup_union > rbt_lookup_rbt_union 

1395 
map_entry_color_of > rbt_map_entry_color_of 

1396 
map_entry_inv1 > rbt_map_entry_inv1 

1397 
map_entry_inv2 > rbt_map_entry_inv2 

1398 
map_entry_is_rbt > rbt_map_entry_is_rbt 

1399 
map_entry_sorted > rbt_map_entry_rbt_sorted 

1400 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

1401 
map_entry_tree_less > rbt_map_entry_rbt_less 

1402 
map_tree_greater > map_rbt_greater 

1403 
map_tree_less > map_rbt_less 

1404 
map_sorted > map_rbt_sorted 

1405 
paint_sorted > paint_rbt_sorted 

1406 
paint_lookup > paint_rbt_lookup 

1407 
paint_tree_greater > paint_rbt_greater 

1408 
paint_tree_less > paint_rbt_less 

1409 
sorted_entries > rbt_sorted_entries 

1410 
tree_greater_eq_trans > rbt_greater_eq_trans 

1411 
tree_greater_nit > rbt_greater_nit 

1412 
tree_greater_prop > rbt_greater_prop 

1413 
tree_greater_simps > rbt_greater_simps 

1414 
tree_greater_trans > rbt_greater_trans 

1415 
tree_less_eq_trans > rbt_less_eq_trans 

1416 
tree_less_nit > rbt_less_nit 

1417 
tree_less_prop > rbt_less_prop 

1418 
tree_less_simps > rbt_less_simps 

1419 
tree_less_trans > rbt_less_trans 

1420 
tree_ord_props > rbt_ord_props 

1421 
union_Branch > rbt_union_Branch 

1422 
union_is_rbt > rbt_union_is_rbt 

1423 
unionw_is_rbt > rbt_unionw_is_rbt 

1424 
unionwk_is_rbt > rbt_unionwk_is_rbt 

1425 
unionwk_sorted > rbt_unionwk_rbt_sorted 

1426 

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

1429 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  1430 

1431 
Changed Operations: 

47622  1432 