author  hoelzl 
Mon, 22 Apr 2013 16:36:02 +0200  
changeset 51732  4392eb046a97 
parent 51717  9e7d1c139569 
child 51747  e4b5bebe5235 
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 

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

11 
treelike organization via implicit subsession relation, with its 

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

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

14 
presentation of theories. 

15 

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

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

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

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

19 

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

22 

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

23 

51533  24 
*** Prover IDE  Isabelle/Scala/jEdit *** 
25 

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

27 
timing information. 

28 

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

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

30 

51533  31 

51313  32 
*** Pure *** 
33 

51565  34 
* Improved locales diagnostic command 'print_dependencies'. 
35 

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

38 
instead, while observing its uniform scope for polymorphism. 

39 

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

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

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

42 

51313  43 

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

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

45 

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

48 
is separated from the datatype package. The declaration attribute 

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

50 

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

52 

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

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

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

58 
This is now identity on infinite sets. 

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

60 
Finite_Set.fold: folding, folding_idem. 

61 
 Locales comm_monoid_set, semilattice_order_set and 

62 
semilattice_neutr_order_set for big operators on sets. 

63 
See theory Big_Operators for canonical examples. 

64 
Note that foundational constants comm_monoid_set.F and 

65 
semilattice_set.F correspond to former combinators fold_image 

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

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

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

71 
 Fact renames: 

72 
card.union_inter ~> card_Un_Int [symmetric] 

73 
card.union_disjoint ~> card_Un_disjoint 

74 

75 
INCOMPATIBILITY. 

76 

51487  77 
* Locale hierarchy for abstract orderings and (semi)lattices. 
78 

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

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

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

81 

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

84 

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

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

86 
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

87 
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

88 
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

89 
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

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

91 

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

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

93 
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

94 
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

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

96 

51732  97 
* Introduce type class "conditional_complete_lattice": Like a complete 
98 
lattice but does not assume the existence of the top and bottom elements. 

99 
Allows to generalize some lemmas about reals and extended reals. 

100 
Removed SupInf and replaced it by the instantiation of 

101 
conditional_complete_lattice for real. Renamed lemmas about conditional 

102 
complete lattice from Sup_... to cSup_... and from Inf_... to 

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

104 
INCOMPATIBILITY. 

105 

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

107 
and bottom elements. 

108 

109 
* Split dense_linorder into inner_dense_order and no_top, no_bot. 

110 

111 
* Complex_Main: Unify and move various concepts from 

112 
HOLMultivariate_Analysis to HOLComplex_Main. 

113 

114 
 Introduce type class (lin)order_topology. Allows to generalize theorems 

115 
about limits and order. Instances are reals and extended reals. 

116 

117 
 continuous and continuos_on from Multivariate_Analysis: 

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

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

120 

121 
Generalized continuity lemmas from isCont to continuous on an arbitrary 

122 
filter. 

123 

124 
 compact from Multivariate_Analysis. Use Bolzano's lemma 

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

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

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

128 

129 
 connected from Multivariate_Analysis. Use it to prove the 

130 
intermediate value theorem. Show connectedness of intervals on order 

131 
topologies which are a inner dense, conditional complete linorder. 

132 

133 
 first_countable_topology from Multivariate_Analysis. Is used to 

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

135 
all sequences converging to x. 

136 

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

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

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

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

141 

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

143 

144 
F within X = inf F (principal X) 

145 

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

147 
abbreviation for "at x within UNIV" 

148 

149 
 Introduce named theorem collections tendsto_intros, continuous_intros, 

150 
continuous_on_intros and FDERIV_intros. Theorems in tendsto_intros (or 

151 
FDERIV_intros) are also available as tendsto_eq_intros (or 

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

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

154 
equivalence by the simplifier. 

155 

156 
 Restructured theories in HOLComplex_Main: 

157 

158 
+ Moved RealDef and RComplete into Real 

159 

160 
+ Introduced Topological_Spaces and moved theorems about 

161 
topological spaces, filters, limits and continuity to it 

162 

163 
+ Renamed RealVector to Real_Vector_Spaces 

164 

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

166 
Limits 

167 

168 
+ Moved Ln and Log to Transcendental 

169 

170 
+ Moved theorems about continuity from Deriv to Topological_Spaces 

171 

172 
 Remove various auxiliary lemmas. 

173 

174 
INCOMPATIBILITY. 

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

175 

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

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

177 

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

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

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

180 

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

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

182 

51137  183 
* Sledgehammer: 
184 

185 
 Renamed option: 

186 
isar_shrink ~> isar_compress 

187 

50994  188 

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

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

190 

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

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

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

193 
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

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

195 

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

196 

51551  197 
*** ML *** 
198 

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

200 

201 
Skip_Proof.prove ~> Goal.prove_sorry 

202 
Skip_Proof.prove_global ~> Goal.prove_sorry_global 

203 

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

206 

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

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

208 
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

209 
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

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

211 

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

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

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

214 
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

215 
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

216 
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

217 
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

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

219 

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

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

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

222 

51551  223 

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

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

225 

51399
6ac3c29a300e
discontinued "isabelle usedir" option r (reset session path);
wenzelm
parents:
51398
diff
changeset

226 
* Discontinued "isabelle usedir" option P (remote path) and r (reset 
6ac3c29a300e
discontinued "isabelle usedir" option r (reset session path);
wenzelm
parents:
51398
diff
changeset

227 
session path). Note that usedir is legacy and superseded by "isabelle 
6ac3c29a300e
discontinued "isabelle usedir" option r (reset session path);
wenzelm
parents:
51398
diff
changeset

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

229 

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

230 

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

231 

50993  232 
New in Isabelle2013 (February 2013) 
233 
 

47887  234 

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

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

236 

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

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

238 
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

239 
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

240 
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

241 
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

242 
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

243 
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

244 

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

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

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

249 

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

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

251 
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

252 

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

255 
Tools that load their additional source files may imitate the 

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

257 
dependencies properly. 

258 

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

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

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

261 

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

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

264 

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

49841  267 
and "class ... context ...". 
268 

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

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

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

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

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

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

275 

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

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

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

278 

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

281 

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

282 

49968  283 
*** Prover IDE  Isabelle/Scala/jEdit *** 
284 

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

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

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

288 
surface, while the prover is still crunching on internal 

289 
justifications. Unfinished / cancelled proofs are restarted as 

290 
required to complete full proof checking eventually. 

291 

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

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

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

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

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

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

298 

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

301 
browser on demand. 

302 

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

305 
comment delimiters works more conveniently with unfinished situations 

306 
that frequently occur in user interaction. 

307 

308 
* More efficient painting and improved reactivity when editing large 

309 
files. More scalable management of formal document content. 

310 

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

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

312 
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

313 
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

314 
potentially infinite message streams. 
49968  315 

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

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

318 
options, including tuning parameters for editor reactivity and color 

319 
schemes. 

320 

50184  321 
* Dockable window "Symbols" provides some editing support for Isabelle 
322 
symbols. 

323 

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

50701  326 

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

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

330 

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

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

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

50183  335 

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

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

339 

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

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

341 
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

342 
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

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

344 

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

347 
now bundled exclusively with Isabelle. 

348 

349 

48205  350 
*** Pure *** 
351 

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

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

353 
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

354 

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

357 
rather arbitrary current working directory. INCOMPATIBILITY. 

48371  358 

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

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

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

363 
with some care where this is really required. 

364 

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

51063  367 
given sort. Example (in HOL): 
48792  368 

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

370 

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

373 

48205  374 

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

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

376 

50646  377 
* Sledgehammer: 
378 

379 
 Added MaSh relevance filter based on machinelearning; see the 

380 
Sledgehammer manual for details. 

381 
 Polished Isar proofs generated with "isar_proofs" option. 

382 
 Rationalized type encodings ("type_enc" option). 

50720  383 
 Renamed "kill_provers" subcommand to "kill_all". 
50646  384 
 Renamed options: 
385 
isar_proof ~> isar_proofs 

386 
isar_shrink_factor ~> isar_shrink 

387 
max_relevant ~> max_facts 

388 
relevance_thresholds ~> fact_thresholds 

389 

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

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

392 
configuration quickcheck_optimise_equality to false. 

393 

50878  394 
* Quotient: only one quotient can be defined by quotient_type 
395 
INCOMPATIBILITY. 

396 

397 
* Lifting: 

398 
 generation of an abstraction function equation in lift_definition 

399 
 quot_del attribute 

400 
 renamed no_abs_code > no_code (INCOMPATIBILITY.) 

401 

50646  402 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
403 
expressions. 

404 

405 
* Preprocessing of the code generator rewrites set comprehensions into 

406 
pointfree expressions. 

407 

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

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

410 
arithmetic, datatypes/records) with potential proof reconstruction 

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

412 
INCOMPATIBILITY. 

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

413 

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

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

415 
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

416 
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

417 
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

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

419 

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

422 

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

424 
List. INCOMPATIBILITY. 

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

425 

49739  426 
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. 
427 

49738  428 
* Class "comm_monoid_diff" formalises properties of bounded 
49388  429 
subtraction, with natural numbers and multisets as typical instances. 
430 

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

433 
* Theory "Transitive_Closure": renamed lemmas 

434 

435 
reflcl_tranclp > reflclp_tranclp 

436 
rtranclp_reflcl > rtranclp_reflclp 

437 

438 
INCOMPATIBILITY. 

439 

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

441 

442 
left_distrib ~> distrib_right 

443 
right_distrib ~> distrib_left 

444 

445 
INCOMPATIBILITY. 

446 

447 
* Generalized the definition of limits: 

448 

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

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

451 
output f x converges to G. 

452 

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

454 
infinity (at_bot). 

455 

456 
 Moved infinity in the norm (at_infinity) from 

457 
Multivariate_Analysis to Complex_Main. 

458 

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

460 
at_top". 

461 

462 
INCOMPATIBILITY. 

463 

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

465 
lattice type classes. 

466 

467 
* Theory "Library/Multiset": renamed 

468 

469 
constant fold_mset ~> Multiset.fold 

470 
fact fold_mset_commute ~> fold_mset_comm 

471 

472 
INCOMPATIBILITY. 

473 

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

475 
changes as follows. 

476 

477 
 Renamed constants (and related lemmas) 

49145  478 

479 
prefix ~> prefixeq 

480 
strict_prefix ~> prefix 

481 

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

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

485 
Renamed lemmas accordingly. 

486 

487 
 Added constant "list_hembeq" for homeomorphic embedding on 

488 
lists. Added abbreviation "sublisteq" for special case 

489 
"list_hembeq (op =)". 

490 

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

492 
class instances for the prefix order (merely corresponding locale 

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

494 
Library/Prefix_Order. 

495 

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

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

50516  498 

499 
le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff 

500 
le_list_append_mono ~> Sublist.list_hembeq_append_mono 

501 
le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2 

502 
le_list_Cons_EX ~> Sublist.list_hembeq_ConsD 

503 
le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2' 

504 
le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq 

505 
le_list_drop_Cons ~> Sublist.sublisteq_Cons' 

506 
le_list_drop_many ~> Sublist.sublisteq_drop_many 

507 
le_list_filter_left ~> Sublist.sublisteq_filter_left 

508 
le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many 

509 
le_list_rev_take_iff ~> Sublist.sublisteq_append 

510 
le_list_same_length ~> Sublist.sublisteq_same_length 

511 
le_list_take_many_iff ~> Sublist.sublisteq_append' 

49145  512 
less_eq_list.drop ~> less_eq_list_drop 
513 
less_eq_list.induct ~> less_eq_list_induct 

50516  514 
not_le_list_length ~> Sublist.not_sublisteq_length 
49145  515 

50646  516 
INCOMPATIBILITY. 
517 

518 
* New theory Library/Countable_Set. 

519 

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

521 
parallel execution for code generated towards Isabelle/ML. 

522 

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

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

525 
extensional_funcset by an abbreviation, and renamed lemmas from 

526 
extensional_funcset to PiE as follows: 

527 

528 
extensional_empty ~> PiE_empty 

529 
extensional_funcset_empty_domain ~> PiE_empty_domain 

530 
extensional_funcset_empty_range ~> PiE_empty_range 

531 
extensional_funcset_arb ~> PiE_arb 

532 
extensional_funcset_mem ~> PiE_mem 

533 
extensional_funcset_extend_domainI ~> PiE_fun_upd 

534 
extensional_funcset_restrict_domain ~> fun_upd_in_PiE 

535 
extensional_funcset_extend_domain_eq ~> PiE_insert_eq 

536 
card_extensional_funcset ~> card_PiE 

537 
finite_extensional_funcset ~> finite_PiE 

538 

539 
INCOMPATIBILITY. 

540 

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

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

543 
Data"). 

544 

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

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

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

548 
code. 

549 

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

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

552 
return a structurally different tree than before. Potential 

553 
INCOMPATIBILITY. 

554 

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

556 

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

558 

559 
* HOL/Multivariate_Analysis: replaced 

560 

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

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

563 

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

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

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

567 

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

569 

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

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

572 
cart_base i removed 

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

574 

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

575 
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

576 

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

577 
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

578 

50646  579 
component_le_norm ~> Basis_le_norm 
580 
euclidean_eq ~> euclidean_eq_iff 

581 
differential_zero_maxmin_component ~> differential_zero_maxmin_cart 

582 
euclidean_simps ~> inner_simps 

583 
independent_basis ~> independent_Basis 

584 
span_basis ~> span_Basis 

585 
in_span_basis ~> in_span_Basis 

586 
norm_bound_component_le ~> norm_boound_Basis_le 

587 
norm_bound_component_lt ~> norm_boound_Basis_lt 

588 
component_le_infnorm ~> Basis_le_infnorm 

589 

590 
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

591 

50141  592 
* HOL/Probability: 
50646  593 

594 
 Added simproc "measurable" to automatically prove measurability. 

595 

596 
 Added induction rules for sigma sets with disjoint union 

597 
(sigma_sets_induct_disjoint) and for Borelmeasurable functions 

598 
(borel_measurable_induct). 

599 

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

601 
projective family). 

602 

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

604 
AFP entry "Ordinals_and_Cardinals"). 

605 

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

607 
with support for mixed, nested recursion and interesting nonfree 

608 
datatypes. 

48094  609 

50991  610 
* HOL/Finite_Set and Relation: added new set and relation operations 
50878  611 
expressed by Finite_Set.fold. 
612 

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

614 
trees for the code generator. 

615 

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

617 
Lifting/Transfer. 

618 
possible INCOMPATIBILITY. 

619 

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

621 
INCOMPATIBILITY. 

622 

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

623 

48206  624 
*** Document preparation *** 
625 

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

628 
Discontinued legacy styles "prem1" .. "prem19". 

629 

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

631 
instead of slightly exotic babel/greek. 

48206  632 

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

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

634 
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

635 
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

636 

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

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

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

639 

48206  640 

48992  641 
*** ML *** 
642 

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

645 
hardware and Poly/ML runtime system. 

646 

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

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

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

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

650 

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

653 
necessarily printing visible text. 

654 

655 

48206  656 
*** System *** 
657 

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

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

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

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

663 
document preparation as well. INCOMPATIBILITY, isabelle usedir / 

48736  664 
mkdir / make are rendered obsolete. 
665 

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

668 

669 
isabelle build s b HOL 

670 

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

672 

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

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

674 
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

675 
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

676 
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

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

678 

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

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

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

681 

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

684 

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

686 
INCOMPATIBILITY. 

687 

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

690 
version of Isabelle. 

691 

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

694 

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

696 
picked up from some surrounding directory. Potential INCOMPATIBILITY 

697 
for homemade settings. 

50132  698 

50701  699 
* Improved ML runtime statistics (heap, threads, future tasks etc.). 
700 

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

703 
configuration. 

704 

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

707 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

709 
bundled as Isabelle component. 

48206  710 

50182  711 

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

712 

47462  713 
New in Isabelle2012 (May 2012) 
714 
 

45109  715 

45593  716 
*** General *** 
717 

45614  718 
* Prover IDE (PIDE) improvements: 
719 

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

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

45614  727 

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

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

46485  731 

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

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

733 
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

734 
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

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

736 
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

737 

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

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

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

740 
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

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

742 

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

743 
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

744 

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

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

746 

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

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

748 

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

749 
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

750 
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

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

752 

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

753 
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

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

755 

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

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

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

47484  761 

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

764 
oldstyle "standard" after instantiation or composition of facts 

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

766 
indices of schematic variables. 

767 

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

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

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

771 
the historic accident of dynamic reevaluation in interpretations 

772 
etc. was exploited. 

773 

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

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

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

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

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

779 
of the material of that old tutorial. 

780 

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

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

783 
manual. 

784 

785 

786 
*** Pure *** 

787 

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

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

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

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

791 

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

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

795 
undocumented feature.) 

796 

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

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

800 

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

802 

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

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

805 

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

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

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

809 
order to accommodate newly introduced premises.) 

810 

47806  811 
* Renamed some inner syntax categories: 
812 

813 
num ~> num_token 

814 
xnum ~> xnum_token 

815 
xstr ~> str_token 

816 

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

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

819 
position information via constraints). 

820 

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

823 
manual. Minor INCOMPATIBILITY. 

824 

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

45134  827 

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

830 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  831 

47464  832 
* Redundant attribute "code_inline" has been discontinued. Use 
833 
"code_unfold" instead. INCOMPATIBILITY. 

834 

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

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

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

837 

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

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

839 

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

840 
INCOMPATIBILITY. 
45383  841 

47856  842 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
843 
instead. INCOMPATIBILITY. 

844 

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

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

847 
legacy since Isabelle2011). 

47855  848 

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

849 

45122  850 
*** HOL *** 
851 

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

854 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

859 
tinkering with former theorems mem_def and Collect_def as far as 

860 
possible. 

861 

862 
For developments which deliberately mix predicates and sets, a 

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

865 
Isabelle20111 before jumping right into the current release. 

866 

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

869 

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

871 

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

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

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

877 
user theories may require adaptations as follows: 

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

878 

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

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

880 
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

881 

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

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

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

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

885 

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

886 
 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

887 
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

888 

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

889 
 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

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

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

892 

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

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

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

895 

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

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

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

900 
corresponding parts of the Quotient package.) 

47809  901 

902 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

904 
relate different type instances of the same polymorphic constant, 

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

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

907 

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

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

910 

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

912 
equivalent subgoal on the corresponding raw types. Constants are 

913 
replaced with corresponding ones according to the transfer rules. 

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

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

919 

920 
 relator_eq attribute: Collects identity laws for relators of 

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

922 
transfer method uses these lemmas to infer transfer rules for 

923 
nonpolymorphic constants on the fly. 

924 

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

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

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

928 
after unfolding the constant definitions. 

929 

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

931 
from type nat to type int. 

932 

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

47809  935 

936 
 lift_definition command: Defines operations on an abstract type in 

937 
terms of a corresponding operation on a representation 

938 
type. Example syntax: 

939 

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

941 
is List.insert 

942 

943 
Users must discharge a respectfulness proof obligation when each 

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

945 
the proof is discharged automatically.) The obligation is 

946 
presented in a userfriendly, readable form; a respectfulness 

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

948 
by the package. 

949 

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

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

952 
lift_definition generates a code certificate theorem and sets up 

953 
code generation for each constant. 

954 

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

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

957 
or a type_definition theorem. The package configures transfer 

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

959 
lift_definition command to work with the type. 

960 

961 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  962 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
963 
Word/Word.thy and Library/Float.thy. 

47809  964 

965 
* Quotient package: 

966 

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

968 
rep and abs functions, similar to typedef. 

969 

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

971 
Transfer packages, as with 'setup_lifting'. 

972 

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

974 
respectfulness property at the point where the constant is 

975 
defined, similar to lift_definition; INCOMPATIBILITY. 

976 

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

978 
accordingly, INCOMPATIBILITY. 

979 

980 
* New diagnostic command 'find_unused_assms' to find potentially 

981 
superfluous assumptions in theorems using Quickcheck. 

982 

983 
* Quickcheck: 

984 

985 
 Quickcheck returns variable assignments as counterexamples, which 

986 
allows to reveal the underspecification of functions under test. 

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

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

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

990 

991 
These counterexample are marked as potentially spurious, as 

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

993 
obvious theorem "hd xs = hd xs". 

994 

995 
After finding a potentially spurious counterexample, Quickcheck 

996 
continues searching for genuine ones. 

997 

998 
By default, Quickcheck shows potentially spurious and genuine 

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

1000 
show genuine counterexamples. 

1001 

1002 
 The command 'quickcheck_generator' creates random and exhaustive 

1003 
value generators for a given type and operations. 

1004 

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

1006 
constructors of that type. 

1007 

1008 
 Support for multisets. 

1009 

1010 
 Added "use_subtype" options. 

1011 

1012 
 Added "quickcheck_locale" configuration to specify how to process 

1013 
conjectures in a locale context. 

1014 

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

47809  1017 

1018 
* Sledgehammer: 

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

1020 
paper "More SPASS with Isabelle". 

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

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

1023 
TFF1), iProver, iProverEq. 

1024 
 Sped up the minimizer. 

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

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

1027 
 Renamed "sound" option to "strict". 

1028 

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

1031 

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

1033 

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

47809  1035 

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

1038 

1039 
list.exhaust [case_product nat.exhaust] 

1040 

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

1042 
a list and a nat. 

1043 

47809  1044 
* New "eventually_elim" method as a generalized variant of the 
47855  1045 
eventually_elim* rules. Supports structured proofs. 
1046 

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

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

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

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

1050 

47856  1051 
* Record: code generation can be switched off manually with 
1052 

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

1054 

1055 
* Datatype: type parameters allow explicit sort constraints. 

1056 

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

1059 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

1061 
one_case. 

1062 

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

1064 
the result of the fact expression. 

1065 

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

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

1069 

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

1070 
converse_def ~> converse_unfold 
47549  1071 
rel_comp_def ~> relcomp_unfold 
47820  1072 
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

1073 
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

1074 
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

1075 
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

1076 

46981  1077 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
1078 

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

47086  1081 

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

1082 
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

1083 

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

46458  1087 
rel_pow_1 ~> relpow_1 
46363  1088 
rel_pow_0_I ~> relpow_0_I 
1089 
rel_pow_Suc_I ~> relpow_Suc_I 

1090 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

1091 
rel_pow_0_E ~> relpow_0_E 

1092 
rel_pow_Suc_E ~> relpow_Suc_E 

1093 
rel_pow_E ~> relpow_E 

46458  1094 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  1095 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  1096 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
1097 
rel_pow_E2 ~> relpow_E2 

1098 
rel_pow_add ~> relpow_add 

1099 
rel_pow_commute ~> relpow 

1100 
rel_pow_empty ~> relpow_empty: 

1101 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

1102 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

1103 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

1104 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

1105 
rel_pow_fun_conv ~> relpow_fun_conv 

1106 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

1107 
rel_pow_finite_bounded ~> relpow_finite_bounded 

1108 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

1109 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

1110 
single_valued_rel_pow ~> single_valued_relpow 

47463  1111 

46363  1112 
INCOMPATIBILITY. 
1113 

47448  1114 
* Theory Relation: Consolidated constant name for relation composition 
47464  1115 
and corresponding theorem names: 
1116 

47549  1117 
 Renamed constant rel_comp to relcomp. 
47464  1118 

47448  1119 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  1120 

47448  1121 
 Renamed theorems: 
47464  1122 

47448  1123 
rel_compI ~> relcompI 
1124 
rel_compEpair ~> relcompEpair 

1125 
rel_compE ~> relcompE 

1126 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

1127 
rel_comp_empty1 ~> relcomp_empty1 

1128 
rel_comp_mono ~> relcomp_mono 

1129 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

1130 
rel_comp_distrib ~> relcomp_distrib 

1131 
rel_comp_distrib2 ~> relcomp_distrib2 

1132 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

1133 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

1134 
single_valued_rel_comp ~> single_valued_relcomp 

47549  1135 
rel_comp_def ~> relcomp_unfold 
47448  1136 
converse_rel_comp ~> converse_relcomp 
1137 
pred_compI ~> relcomppI 

1138 
pred_compE ~> relcomppE 

1139 
pred_comp_bot1 ~> relcompp_bot1 

1140 
pred_comp_bot2 ~> relcompp_bot2 

1141 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

1142 
pred_comp_mono ~> relcompp_mono 

1143 
pred_comp_distrib ~> relcompp_distrib 

1144 
pred_comp_distrib2 ~> relcompp_distrib2 

1145 
converse_pred_comp ~> converse_relcompp 

47464  1146 

47448  1147 
finite_rel_comp ~> finite_relcomp 
47464  1148 

47448  1149 
set_rel_comp ~> set_relcomp 
1150 

1151 
INCOMPATIBILITY. 

1152 

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

1155 

1156 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

1157 
zdiv_self ~> div_self 

1158 
zmod_self ~> mod_self 

1159 
zdiv_zero ~> div_0 

1160 
zmod_zero ~> mod_0 

1161 
zdiv_zmod_equality ~> div_mod_equality2 

1162 
zdiv_zmod_equality2 ~> div_mod_equality 

1163 
zmod_zdiv_trivial ~> mod_div_trivial 

1164 
zdiv_zminus_zminus ~> div_minus_minus 

1165 
zmod_zminus_zminus ~> mod_minus_minus 

1166 
zdiv_zminus2 ~> div_minus_right 

1167 
zmod_zminus2 ~> mod_minus_right 

1168 
zdiv_minus1_right ~> div_minus1_right 

1169 
zmod_minus1_right ~> mod_minus1_right 

1170 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

1171 
zmod_zmult1_eq ~> mod_mult_right_eq 

1172 
zpower_zmod ~> power_mod 

1173 
zdvd_zmod ~> dvd_mod 

1174 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

1175 
mod_mult_distrib ~> mult_mod_left 

1176 
mod_mult_distrib2 ~> mult_mod_right 

1177 

1178 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

1179 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

1180 

47551  1181 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
1182 

47552  1183 
* Consolidated theorem names concerning fold combinators: 
47550  1184 

1185 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

1186 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

1187 
INFI_fold_inf ~> INF_fold_inf 

1188 
SUPR_fold_sup ~> SUP_fold_sup 

1189 
union_set ~> union_set_fold 

1190 
minus_set ~> minus_set_fold 

1191 
INFI_set_fold ~> INF_set_fold 

1192 
SUPR_set_fold ~> SUP_set_fold 

1193 
INF_code ~> INF_set_foldr 

1194 
SUP_code ~> SUP_set_foldr 

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

1196 
foldr_fold_rev ~> foldr_conv_fold 

1197 
foldl_fold ~> foldl_conv_fold 

1198 
foldr_foldr ~> foldr_conv_foldl 

1199 
foldl_foldr ~> foldl_conv_foldr 

47552  1200 
fold_set_remdups ~> fold_set_fold_remdups 
1201 
fold_set ~> fold_set_fold 

1202 
fold1_set ~> fold1_set_fold 

47550  1203 

1204 
INCOMPATIBILITY. 

1205 

1206 
* Dropped rarely useful theorems concerning fold combinators: 

1207 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

1208 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

1209 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

1210 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

1211 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

1212 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

1216 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

1217 

1218 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

1219 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

1220 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

1221 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

1223 
fold_conv_foldr and fold_rev. 

1224 

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

1226 
through option types. 

1227 

47856  1228 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
1229 
relations. 

1230 

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

1232 

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

1234 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

1235 

1236 
zminus_zminus ~> minus_minus 

1237 
zminus_0 ~> minus_zero 

1238 
zminus_zadd_distrib ~> minus_add_distrib 

1239 
zadd_commute ~> add_commute 

1240 
zadd_assoc ~> add_assoc 

1241 
zadd_left_commute ~> add_left_commute 

1242 
zadd_ac ~> add_ac 

1243 
zmult_ac ~> mult_ac 

1244 
zadd_0 ~> add_0_left 

1245 
zadd_0_right ~> add_0_right 

1246 
zadd_zminus_inverse2 ~> left_minus 

1247 
zmult_zminus ~> mult_minus_left 

1248 
zmult_commute ~> mult_commute 

1249 
zmult_assoc ~> mult_assoc 

1250 
zadd_zmult_distrib ~> left_distrib 

1251 
zadd_zmult_distrib2 ~> right_distrib 

1252 
zdiff_zmult_distrib ~> left_diff_distrib 

1253 
zdiff_zmult_distrib2 ~> right_diff_distrib 

1254 
zmult_1 ~> mult_1_left 

1255 
zmult_1_right ~> mult_1_right 

1256 
zle_refl ~> order_refl 

1257 
zle_trans ~> order_trans 

1258 
zle_antisym ~> order_antisym 

1259 
zle_linear ~> linorder_linear 

1260 
zless_linear ~> linorder_less_linear 

1261 
zadd_left_mono ~> add_left_mono 

1262 
zadd_strict_right_mono ~> add_strict_right_mono 

1263 
zadd_zless_mono ~> add_less_le_mono 

1264 
int_0_less_1 ~> zero_less_one 

1265 
int_0_neq_1 ~> zero_neq_one 

1266 
zless_le ~> less_le 

1267 
zpower_zadd_distrib ~> power_add 

1268 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

1269 
zero_le_zpower_abs ~> zero_le_power_abs 

1270 

1271 
* Theory Deriv: Renamed 

1272 

1273 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

1274 

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

1276 

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

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

1281 
INCOMPATIBILITY. 

1282 

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

1285 

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

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

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

1290 
follows: 

47452  1291 

1292 
Operations: 

1293 
bulkload > rbt_bulkload 

1294 
del_from_left > rbt_del_from_left 

1295 
del_from_right > rbt_del_from_right 

1296 
del > rbt_del 

1297 
delete > rbt_delete 

1298 
ins > rbt_ins 

1299 
insert > rbt_insert 

1300 
insertw > rbt_insert_with 

1301 
insert_with_key > rbt_insert_with_key 

1302 
map_entry > rbt_map_entry 

1303 
lookup > rbt_lookup 

1304 
sorted > rbt_sorted 

1305 
tree_greater > rbt_greater 

1306 
tree_less > rbt_less 

1307 
tree_less_symbol > rbt_less_symbol 

1308 
union > rbt_union 

1309 
union_with > rbt_union_with 

1310 
union_with_key > rbt_union_with_key 

1311 

1312 
Lemmas: 

1313 
balance_left_sorted > balance_left_rbt_sorted 

1314 
balance_left_tree_greater > balance_left_rbt_greater 

1315 
balance_left_tree_less > balance_left_rbt_less 

1316 
balance_right_sorted > balance_right_rbt_sorted 

1317 
balance_right_tree_greater > balance_right_rbt_greater 

1318 
balance_right_tree_less > balance_right_rbt_less 

1319 
balance_sorted > balance_rbt_sorted 

1320 
balance_tree_greater > balance_rbt_greater 

1321 
balance_tree_less > balance_rbt_less 

1322 
bulkload_is_rbt > rbt_bulkload_is_rbt 

1323 
combine_sorted > combine_rbt_sorted 

1324 
combine_tree_greater > combine_rbt_greater 

1325 
combine_tree_less > combine_rbt_less 

1326 
delete_in_tree > rbt_delete_in_tree 

1327 
delete_is_rbt > rbt_delete_is_rbt 

1328 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

1329 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

1330 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

1331 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

1332 
del_in_tree > rbt_del_in_tree 

1333 
del_inv1_inv2 > rbt_del_inv1_inv2 

1334 
del_sorted > rbt_del_rbt_sorted 

1335 
del_tree_greater > rbt_del_rbt_greater 

1336 
del_tree_less > rbt_del_rbt_less 

1337 
dom_lookup_Branch > dom_rbt_lookup_Branch 

1338 
entries_lookup > entries_rbt_lookup 

1339 
finite_dom_lookup > finite_dom_rbt_lookup 

1340 
insert_sorted > rbt_insert_rbt_sorted 

1341 
insertw_is_rbt > rbt_insertw_is_rbt 

1342 
insertwk_is_rbt > rbt_insertwk_is_rbt 

1343 
insertwk_sorted > rbt_insertwk_rbt_sorted 

1344 
insertw_sorted > rbt_insertw_rbt_sorted 

1345 
ins_sorted > ins_rbt_sorted 

1346 
ins_tree_greater > ins_rbt_greater 

1347 
ins_tree_less > ins_rbt_less 

1348 
is_rbt_sorted > is_rbt_rbt_sorted 

1349 
lookup_balance > rbt_lookup_balance 

1350 
lookup_bulkload > rbt_lookup_rbt_bulkload 

1351 
lookup_delete > rbt_lookup_rbt_delete 

1352 
lookup_Empty > rbt_lookup_Empty 

1353 
lookup_from_in_tree > rbt_lookup_from_in_tree 

1354 
lookup_in_tree > rbt_lookup_in_tree 

1355 
lookup_ins > rbt_lookup_ins 

1356 
lookup_insert > rbt_lookup_rbt_insert 

1357 
lookup_insertw > rbt_lookup_rbt_insertw 

1358 
lookup_insertwk > rbt_lookup_rbt_insertwk 

1359 
lookup_keys > rbt_lookup_keys 

1360 
lookup_map > rbt_lookup_map 

1361 
lookup_map_entry > rbt_lookup_rbt_map_entry 

1362 
lookup_tree_greater > rbt_lookup_rbt_greater 

1363 
lookup_tree_less > rbt_lookup_rbt_less 

1364 
lookup_union > rbt_lookup_rbt_union 

1365 
map_entry_color_of > rbt_map_entry_color_of 

1366 
map_entry_inv1 > rbt_map_entry_inv1 

1367 
map_entry_inv2 > rbt_map_entry_inv2 

1368 
map_entry_is_rbt > rbt_map_entry_is_rbt 

1369 
map_entry_sorted > rbt_map_entry_rbt_sorted 

1370 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

1371 
map_entry_tree_less > rbt_map_entry_rbt_less 

1372 
map_tree_greater > map_rbt_greater 

1373 
map_tree_less > map_rbt_less 

1374 
map_sorted > map_rbt_sorted 

1375 
paint_sorted > paint_rbt_sorted 

1376 
paint_lookup > paint_rbt_lookup 

1377 
paint_tree_greater > paint_rbt_greater 

1378 
paint_tree_less > paint_rbt_less 

1379 
sorted_entries > rbt_sorted_entries 

1380 
tree_greater_eq_trans > rbt_greater_eq_trans 

1381 
tree_greater_nit > rbt_greater_nit 

1382 
tree_greater_prop > rbt_greater_prop 

1383 
tree_greater_simps > rbt_greater_simps 

1384 
tree_greater_trans > rbt_greater_trans 

1385 
tree_less_eq_trans > rbt_less_eq_trans 

1386 
tree_less_nit > rbt_less_nit 

1387 
tree_less_prop > rbt_less_prop 

1388 
tree_less_simps > rbt_less_simps 

1389 
tree_less_trans > rbt_less_trans 

1390 
tree_ord_props > rbt_ord_props 

1391 
union_Branch > rbt_union_Branch 

1392 
union_is_rbt > rbt_union_is_rbt 

1393 
unionw_is_rbt > rbt_unionw_is_rbt 

1394 
unionwk_is_rbt > rbt_unionwk_is_rbt 

1395 
unionwk_sorted > rbt_unionwk_rbt_sorted 

1396 

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

1399 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  1400 

1401 
Changed Operations: 

47622  1402 
float_abs > abs 
1403 
float_nprt > nprt 

1404 
float_pprt > pprt 

1405 
pow2 > use powr 

1406 
round_down > float_round_down 

1407 
round_up > float_round_up 

1408 
scale > exponent 

1409 

1410 
Removed Operations: 

1411 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

1412 

1413 
Renamed Lemmas: 

1414 
abs_float_def > Float.compute_float_abs 

1415 
bitlen_ge0 > bitlen_nonneg 

1416 
bitlen.simps > Float.compute_bitlen 

1417 
float_components > Float_mantissa_exponent 

1418 
float_divl.simps > Float.compute_float_divl 

1419 
float_divr.simps > Float.compute_float_divr 

1420 
float_eq_odd > mult_powr_eq_mult_powr_iff 

1421 
float_power > real_of_float_power 

1422 
lapprox_posrat_def > Float.compute_lapprox_posrat 

1423 
lapprox_rat.simps > Float.compute_lapprox_rat 

1424 
le_float_def' > Float.compute_float_le 

1425 
le_float_def > less_eq_float.rep_eq 

1426 
less_float_def' > Float.compute_float_less 

1427 
less_float_def > less_float.rep_eq 

1428 
normfloat_def > Float.compute_normfloat 

1429 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

1430 
normfloat > normfloat_def 

1431 
normfloat_unique > use normfloat_def 

1432 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

1433 
one_float_def > Float.compute_float_one 

1434 
plus_float_def > Float.compute_float_plus 

1435 
rapprox_posrat_def > Float.compute_rapprox_posrat 

1436 
rapprox_rat.simps > Float.compute_rapprox_rat 