author  webertj 
Fri, 17 Aug 2012 20:31:12 +0200  
changeset 48853  ec82c33c75f8 
parent 48844  6408fb6f7d81 
child 48890  d72ca5742f80 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

47887  4 
New in this Isabelle version 
5 
 

6 

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

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

8 

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

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

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

11 

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

12 
* Updated and extended "isarref" manual, reduced remaining material 
9fe0e71052a0
updated "isarref" manual, reduced remaining material in "ref" manual.
wenzelm
parents:
48111
diff
changeset

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

14 

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

15 

48205  16 
*** Pure *** 
17 

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

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

19 
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

20 

48371  21 
* Command "export_code": relative file names are interpreted 
22 
relatively to master directory of current theory rather than 

23 
the rather arbitrary current working directory. 

24 
INCOMPATIBILITY. 

25 

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

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

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

30 
with some care where this is really required. 

31 

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

34 
given given sort. Example (in HOL): 

35 

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

37 

48205  38 

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

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

40 

48428  41 
* Library/Debug.thy and Library/Parallel.thy: debugging and parallel 
42 
execution for code generated towards Isabelle/ML. 

43 

48206  44 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
45 
expressions. 

48111  46 

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

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

48 

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

49 
 added an optimisation for equality premises. 
44de84112a67
added optimisation for equational premises in Quickcheck; added some Quickcheck examples; NEWS
bulwahn
parents:
47979
diff
changeset

50 
It is switched on by default, and can be switched off by setting 
44de84112a67
added optimisation for equational premises in Quickcheck; added some Quickcheck examples; NEWS
bulwahn
parents:
47979
diff
changeset

51 
the configuration quickcheck_optimise_equality to false. 
47887  52 

48069
e9b2782c4f99
restricted Z3 by default to a fragment where proof reconstruction should not fail (for better integration with Sledgehammer)  the full set of supported Z3 features can still be used by enabling the configuration option "z3_with_extensions"
boehmes
parents:
48013
diff
changeset

53 
* The SMT solver Z3 has now by default a restricted set of directly 
e9b2782c4f99
restricted Z3 by default to a fragment where proof reconstruction should not fail (for better integration with Sledgehammer)  the full set of supported Z3 features can still be used by enabling the configuration option "z3_with_extensions"
boehmes
parents:
48013
diff
changeset

54 
supported features. For the full set of features (div/mod, nonlinear 
e9b2782c4f99
restricted Z3 by default to a fragment where proof reconstruction should not fail (for better integration with Sledgehammer)  the full set of supported Z3 features can still be used by enabling the configuration option "z3_with_extensions"
boehmes
parents:
48013
diff
changeset

55 
arithmetic, datatypes/records) with potential proof reconstruction 
e9b2782c4f99
restricted Z3 by default to a fragment where proof reconstruction should not fail (for better integration with Sledgehammer)  the full set of supported Z3 features can still be used by enabling the configuration option "z3_with_extensions"
boehmes
parents:
48013
diff
changeset

56 
failures, enable the configuration option "z3_with_extensions". 
e9b2782c4f99
restricted Z3 by default to a fragment where proof reconstruction should not fail (for better integration with Sledgehammer)  the full set of supported Z3 features can still be used by enabling the configuration option "z3_with_extensions"
boehmes
parents:
48013
diff
changeset

57 
Minor INCOMPATIBILITY. 
e9b2782c4f99
restricted Z3 by default to a fragment where proof reconstruction should not fail (for better integration with Sledgehammer)  the full set of supported Z3 features can still be used by enabling the configuration option "z3_with_extensions"
boehmes
parents:
48013
diff
changeset

58 

48094  59 
* Sledgehammer: 
60 

48402  61 
 Added MaSh relevance filter based on machinelearning; see the 
62 
Sledgehammer manual for details. 

48094  63 
 Rationalized type encodings ("type_enc" option). 
48294  64 
 Renamed options: 
65 
max_relevant ~> max_facts 

66 
relevance_thresholds ~> fact_thresholds 

48094  67 

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

68 

48206  69 
*** Document preparation *** 
70 

71 
* Default for \<euro> is now based on eurosym package, instead of 

72 
slightly exotic babel/greek. 

73 

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

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

75 
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

76 
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

77 

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

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

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

80 

48206  81 

82 
*** System *** 

83 

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

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

85 
"system" manual for the chapter of that name, especially the "isabelle 
48736  86 
build" tool and its examples. INCOMPATIBILITY, isabelle usedir / 
87 
mkdir / make are rendered obsolete. 

88 

89 
* Discontinued obsolete "isabelle makeall". 

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

90 

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

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

92 
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

93 
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

94 
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

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

96 

48586  97 
* Discontinued obsolete Isabelle/build script, it is superseded by the 
98 
regular isabelle build tool. For example: 

99 

100 
isabelle build s b HOLCF 

101 

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

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

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

104 

48683  105 
* The "isabelle mkroot" tool prepares session root directories for use 
106 
with "isabelle build", similar to former "isabelle mkdir" for 

107 
"isabelle usedir". 

108 

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

111 
version of Isabelle. 

112 

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

115 
configuration. 

116 

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

119 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

121 
bundled as Isabelle component. 

48206  122 

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

123 

47462  124 
New in Isabelle2012 (May 2012) 
125 
 

45109  126 

45593  127 
*** General *** 
128 

45614  129 
* Prover IDE (PIDE) improvements: 
130 

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

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

45614  138 

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

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

46485  142 

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

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

144 
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

145 
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

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

147 
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

148 

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

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

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

151 
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

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

153 

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

154 
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

155 

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

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

157 

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

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

159 

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

160 
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

161 
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

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

163 

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

164 
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

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

166 

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

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

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

47484  172 

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

175 
oldstyle "standard" after instantiation or composition of facts 

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

177 
indices of schematic variables. 

178 

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

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

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

182 
the historic accident of dynamic reevaluation in interpretations 

183 
etc. was exploited. 

184 

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

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

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

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

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

190 
of the material of that old tutorial. 

191 

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

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

194 
manual. 

195 

196 

197 
*** Pure *** 

198 

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

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

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

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

202 

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

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

206 
undocumented feature.) 

207 

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

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

211 

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

213 

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

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

216 

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

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

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

220 
order to accommodate newly introduced premises.) 

221 

47806  222 
* Renamed some inner syntax categories: 
223 

224 
num ~> num_token 

225 
xnum ~> xnum_token 

226 
xstr ~> str_token 

227 

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

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

230 
position information via constraints). 

231 

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

234 
manual. Minor INCOMPATIBILITY. 

235 

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

45134  238 

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

241 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  242 

47464  243 
* Redundant attribute "code_inline" has been discontinued. Use 
244 
"code_unfold" instead. INCOMPATIBILITY. 

245 

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

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

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

248 

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

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

250 

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

251 
INCOMPATIBILITY. 
45383  252 

47856  253 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
254 
instead. INCOMPATIBILITY. 

255 

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

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

258 
legacy since Isabelle2011). 

47855  259 

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

260 

45122  261 
*** HOL *** 
262 

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

265 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

270 
tinkering with former theorems mem_def and Collect_def as far as 

271 
possible. 

272 

273 
For developments which deliberately mix predicates and sets, a 

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

276 
Isabelle20111 before jumping right into the current release. 

277 

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

280 

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

282 

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

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

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

288 
user theories may require adaptations as follows: 

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

289 

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

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

291 
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

292 

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

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

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

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

296 

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

297 
 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

298 
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

299 

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

300 
 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

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

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

303 

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

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

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

306 

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

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

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

311 
corresponding parts of the Quotient package.) 

47809  312 

313 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

315 
relate different type instances of the same polymorphic constant, 

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

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

318 

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

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

321 

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

323 
equivalent subgoal on the corresponding raw types. Constants are 

324 
replaced with corresponding ones according to the transfer rules. 

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

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

330 

331 
 relator_eq attribute: Collects identity laws for relators of 

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

333 
transfer method uses these lemmas to infer transfer rules for 

334 
nonpolymorphic constants on the fly. 

335 

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

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

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

339 
after unfolding the constant definitions. 

340 

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

342 
from type nat to type int. 

343 

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

47809  346 

347 
 lift_definition command: Defines operations on an abstract type in 

348 
terms of a corresponding operation on a representation 

349 
type. Example syntax: 

350 

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

352 
is List.insert 

353 

354 
Users must discharge a respectfulness proof obligation when each 

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

356 
the proof is discharged automatically.) The obligation is 

357 
presented in a userfriendly, readable form; a respectfulness 

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

359 
by the package. 

360 

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

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

363 
lift_definition generates a code certificate theorem and sets up 

364 
code generation for each constant. 

365 

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

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

368 
or a type_definition theorem. The package configures transfer 

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

370 
lift_definition command to work with the type. 

371 

372 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  373 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
374 
Word/Word.thy and Library/Float.thy. 

47809  375 

376 
* Quotient package: 

377 

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

379 
rep and abs functions, similar to typedef. 

380 

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

382 
Transfer packages, as with 'setup_lifting'. 

383 

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

385 
respectfulness property at the point where the constant is 

386 
defined, similar to lift_definition; INCOMPATIBILITY. 

387 

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

389 
accordingly, INCOMPATIBILITY. 

390 

391 
* New diagnostic command 'find_unused_assms' to find potentially 

392 
superfluous assumptions in theorems using Quickcheck. 

393 

394 
* Quickcheck: 

395 

396 
 Quickcheck returns variable assignments as counterexamples, which 

397 
allows to reveal the underspecification of functions under test. 

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

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

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

401 

402 
These counterexample are marked as potentially spurious, as 

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

404 
obvious theorem "hd xs = hd xs". 

405 

406 
After finding a potentially spurious counterexample, Quickcheck 

407 
continues searching for genuine ones. 

408 

409 
By default, Quickcheck shows potentially spurious and genuine 

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

411 
show genuine counterexamples. 

412 

413 
 The command 'quickcheck_generator' creates random and exhaustive 

414 
value generators for a given type and operations. 

415 

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

417 
constructors of that type. 

418 

419 
 Support for multisets. 

420 

421 
 Added "use_subtype" options. 

422 

423 
 Added "quickcheck_locale" configuration to specify how to process 

424 
conjectures in a locale context. 

425 

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

47809  428 

429 
* Sledgehammer: 

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

431 
paper "More SPASS with Isabelle". 

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

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

434 
TFF1), iProver, iProverEq. 

435 
 Sped up the minimizer. 

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

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

438 
 Renamed "sound" option to "strict". 

439 

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

442 

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

444 

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

47809  446 

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

449 

450 
list.exhaust [case_product nat.exhaust] 

451 

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

453 
a list and a nat. 

454 

47809  455 
* New "eventually_elim" method as a generalized variant of the 
47855  456 
eventually_elim* rules. Supports structured proofs. 
457 

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

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

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

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

461 

47856  462 
* Record: code generation can be switched off manually with 
463 

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

465 

466 
* Datatype: type parameters allow explicit sort constraints. 

467 

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

470 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

472 
one_case. 

473 

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

475 
the result of the fact expression. 

476 

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

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

480 

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

481 
converse_def ~> converse_unfold 
47549  482 
rel_comp_def ~> relcomp_unfold 
47820  483 
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

484 
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

485 
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

486 
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

487 

46981  488 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
489 

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

47086  492 

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

493 
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

494 

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

46458  498 
rel_pow_1 ~> relpow_1 
46363  499 
rel_pow_0_I ~> relpow_0_I 
500 
rel_pow_Suc_I ~> relpow_Suc_I 

501 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

502 
rel_pow_0_E ~> relpow_0_E 

503 
rel_pow_Suc_E ~> relpow_Suc_E 

504 
rel_pow_E ~> relpow_E 

46458  505 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  506 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  507 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
508 
rel_pow_E2 ~> relpow_E2 

509 
rel_pow_add ~> relpow_add 

510 
rel_pow_commute ~> relpow 

511 
rel_pow_empty ~> relpow_empty: 

512 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

513 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

514 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

515 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

516 
rel_pow_fun_conv ~> relpow_fun_conv 

517 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

518 
rel_pow_finite_bounded ~> relpow_finite_bounded 

519 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

520 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

521 
single_valued_rel_pow ~> single_valued_relpow 

47463  522 

46363  523 
INCOMPATIBILITY. 
524 

47448  525 
* Theory Relation: Consolidated constant name for relation composition 
47464  526 
and corresponding theorem names: 
527 

47549  528 
 Renamed constant rel_comp to relcomp. 
47464  529 

47448  530 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  531 

47448  532 
 Renamed theorems: 
47464  533 

47448  534 
rel_compI ~> relcompI 
535 
rel_compEpair ~> relcompEpair 

536 
rel_compE ~> relcompE 

537 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

538 
rel_comp_empty1 ~> relcomp_empty1 

539 
rel_comp_mono ~> relcomp_mono 

540 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

541 
rel_comp_distrib ~> relcomp_distrib 

542 
rel_comp_distrib2 ~> relcomp_distrib2 

543 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

544 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

545 
single_valued_rel_comp ~> single_valued_relcomp 

47549  546 
rel_comp_def ~> relcomp_unfold 
47448  547 
converse_rel_comp ~> converse_relcomp 
548 
pred_compI ~> relcomppI 

549 
pred_compE ~> relcomppE 

550 
pred_comp_bot1 ~> relcompp_bot1 

551 
pred_comp_bot2 ~> relcompp_bot2 

552 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

553 
pred_comp_mono ~> relcompp_mono 

554 
pred_comp_distrib ~> relcompp_distrib 

555 
pred_comp_distrib2 ~> relcompp_distrib2 

556 
converse_pred_comp ~> converse_relcompp 

47464  557 

47448  558 
finite_rel_comp ~> finite_relcomp 
47464  559 

47448  560 
set_rel_comp ~> set_relcomp 
561 

562 
INCOMPATIBILITY. 

563 

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

566 

567 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

568 
zdiv_self ~> div_self 

569 
zmod_self ~> mod_self 

570 
zdiv_zero ~> div_0 

571 
zmod_zero ~> mod_0 

572 
zdiv_zmod_equality ~> div_mod_equality2 

573 
zdiv_zmod_equality2 ~> div_mod_equality 

574 
zmod_zdiv_trivial ~> mod_div_trivial 

575 
zdiv_zminus_zminus ~> div_minus_minus 

576 
zmod_zminus_zminus ~> mod_minus_minus 

577 
zdiv_zminus2 ~> div_minus_right 

578 
zmod_zminus2 ~> mod_minus_right 

579 
zdiv_minus1_right ~> div_minus1_right 

580 
zmod_minus1_right ~> mod_minus1_right 

581 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

582 
zmod_zmult1_eq ~> mod_mult_right_eq 

583 
zpower_zmod ~> power_mod 

584 
zdvd_zmod ~> dvd_mod 

585 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

586 
mod_mult_distrib ~> mult_mod_left 

587 
mod_mult_distrib2 ~> mult_mod_right 

588 

589 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

590 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

591 

47551  592 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
593 

47552  594 
* Consolidated theorem names concerning fold combinators: 
47550  595 

596 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

597 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

598 
INFI_fold_inf ~> INF_fold_inf 

599 
SUPR_fold_sup ~> SUP_fold_sup 

600 
union_set ~> union_set_fold 

601 
minus_set ~> minus_set_fold 

602 
INFI_set_fold ~> INF_set_fold 

603 
SUPR_set_fold ~> SUP_set_fold 

604 
INF_code ~> INF_set_foldr 

605 
SUP_code ~> SUP_set_foldr 

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

607 
foldr_fold_rev ~> foldr_conv_fold 

608 
foldl_fold ~> foldl_conv_fold 

609 
foldr_foldr ~> foldr_conv_foldl 

610 
foldl_foldr ~> foldl_conv_foldr 

47552  611 
fold_set_remdups ~> fold_set_fold_remdups 
612 
fold_set ~> fold_set_fold 

613 
fold1_set ~> fold1_set_fold 

47550  614 

615 
INCOMPATIBILITY. 

616 

617 
* Dropped rarely useful theorems concerning fold combinators: 

618 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

619 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

620 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

621 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

622 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

623 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

627 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

628 

629 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

630 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

631 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

632 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

634 
fold_conv_foldr and fold_rev. 

635 

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

637 
through option types. 

638 

47856  639 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
640 
relations. 

641 

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

643 

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

645 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

646 

647 
zminus_zminus ~> minus_minus 

648 
zminus_0 ~> minus_zero 

649 
zminus_zadd_distrib ~> minus_add_distrib 

650 
zadd_commute ~> add_commute 

651 
zadd_assoc ~> add_assoc 

652 
zadd_left_commute ~> add_left_commute 

653 
zadd_ac ~> add_ac 

654 
zmult_ac ~> mult_ac 

655 
zadd_0 ~> add_0_left 

656 
zadd_0_right ~> add_0_right 

657 
zadd_zminus_inverse2 ~> left_minus 

658 
zmult_zminus ~> mult_minus_left 

659 
zmult_commute ~> mult_commute 

660 
zmult_assoc ~> mult_assoc 

661 
zadd_zmult_distrib ~> left_distrib 

662 
zadd_zmult_distrib2 ~> right_distrib 

663 
zdiff_zmult_distrib ~> left_diff_distrib 

664 
zdiff_zmult_distrib2 ~> right_diff_distrib 

665 
zmult_1 ~> mult_1_left 

666 
zmult_1_right ~> mult_1_right 

667 
zle_refl ~> order_refl 

668 
zle_trans ~> order_trans 

669 
zle_antisym ~> order_antisym 

670 
zle_linear ~> linorder_linear 

671 
zless_linear ~> linorder_less_linear 

672 
zadd_left_mono ~> add_left_mono 

673 
zadd_strict_right_mono ~> add_strict_right_mono 

674 
zadd_zless_mono ~> add_less_le_mono 

675 
int_0_less_1 ~> zero_less_one 

676 
int_0_neq_1 ~> zero_neq_one 

677 
zless_le ~> less_le 

678 
zpower_zadd_distrib ~> power_add 

679 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

680 
zero_le_zpower_abs ~> zero_le_power_abs 

681 

682 
* Theory Deriv: Renamed 

683 

684 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

685 

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

687 

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

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

692 
INCOMPATIBILITY. 

693 

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

696 

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

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

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

701 
follows: 

47452  702 

703 
Operations: 

704 
bulkload > rbt_bulkload 

705 
del_from_left > rbt_del_from_left 

706 
del_from_right > rbt_del_from_right 

707 
del > rbt_del 

708 
delete > rbt_delete 

709 
ins > rbt_ins 

710 
insert > rbt_insert 

711 
insertw > rbt_insert_with 

712 
insert_with_key > rbt_insert_with_key 

713 
map_entry > rbt_map_entry 

714 
lookup > rbt_lookup 

715 
sorted > rbt_sorted 

716 
tree_greater > rbt_greater 

717 
tree_less > rbt_less 

718 
tree_less_symbol > rbt_less_symbol 

719 
union > rbt_union 

720 
union_with > rbt_union_with 

721 
union_with_key > rbt_union_with_key 

722 

723 
Lemmas: 

724 
balance_left_sorted > balance_left_rbt_sorted 

725 
balance_left_tree_greater > balance_left_rbt_greater 

726 
balance_left_tree_less > balance_left_rbt_less 

727 
balance_right_sorted > balance_right_rbt_sorted 

728 
balance_right_tree_greater > balance_right_rbt_greater 

729 
balance_right_tree_less > balance_right_rbt_less 

730 
balance_sorted > balance_rbt_sorted 

731 
balance_tree_greater > balance_rbt_greater 

732 
balance_tree_less > balance_rbt_less 

733 
bulkload_is_rbt > rbt_bulkload_is_rbt 

734 
combine_sorted > combine_rbt_sorted 

735 
combine_tree_greater > combine_rbt_greater 

736 
combine_tree_less > combine_rbt_less 

737 
delete_in_tree > rbt_delete_in_tree 

738 
delete_is_rbt > rbt_delete_is_rbt 

739 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

740 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

741 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

742 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

743 
del_in_tree > rbt_del_in_tree 

744 
del_inv1_inv2 > rbt_del_inv1_inv2 

745 
del_sorted > rbt_del_rbt_sorted 

746 
del_tree_greater > rbt_del_rbt_greater 

747 
del_tree_less > rbt_del_rbt_less 

748 
dom_lookup_Branch > dom_rbt_lookup_Branch 

749 
entries_lookup > entries_rbt_lookup 

750 
finite_dom_lookup > finite_dom_rbt_lookup 

751 
insert_sorted > rbt_insert_rbt_sorted 

752 
insertw_is_rbt > rbt_insertw_is_rbt 

753 
insertwk_is_rbt > rbt_insertwk_is_rbt 

754 
insertwk_sorted > rbt_insertwk_rbt_sorted 

755 
insertw_sorted > rbt_insertw_rbt_sorted 

756 
ins_sorted > ins_rbt_sorted 

757 
ins_tree_greater > ins_rbt_greater 

758 
ins_tree_less > ins_rbt_less 

759 
is_rbt_sorted > is_rbt_rbt_sorted 

760 
lookup_balance > rbt_lookup_balance 

761 
lookup_bulkload > rbt_lookup_rbt_bulkload 

762 
lookup_delete > rbt_lookup_rbt_delete 

763 
lookup_Empty > rbt_lookup_Empty 

764 
lookup_from_in_tree > rbt_lookup_from_in_tree 

765 
lookup_in_tree > rbt_lookup_in_tree 

766 
lookup_ins > rbt_lookup_ins 

767 
lookup_insert > rbt_lookup_rbt_insert 

768 
lookup_insertw > rbt_lookup_rbt_insertw 

769 
lookup_insertwk > rbt_lookup_rbt_insertwk 

770 
lookup_keys > rbt_lookup_keys 

771 
lookup_map > rbt_lookup_map 

772 
lookup_map_entry > rbt_lookup_rbt_map_entry 

773 
lookup_tree_greater > rbt_lookup_rbt_greater 

774 
lookup_tree_less > rbt_lookup_rbt_less 

775 
lookup_union > rbt_lookup_rbt_union 

776 
map_entry_color_of > rbt_map_entry_color_of 

777 
map_entry_inv1 > rbt_map_entry_inv1 

778 
map_entry_inv2 > rbt_map_entry_inv2 

779 
map_entry_is_rbt > rbt_map_entry_is_rbt 

780 
map_entry_sorted > rbt_map_entry_rbt_sorted 

781 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

782 
map_entry_tree_less > rbt_map_entry_rbt_less 

783 
map_tree_greater > map_rbt_greater 

784 
map_tree_less > map_rbt_less 

785 
map_sorted > map_rbt_sorted 

786 
paint_sorted > paint_rbt_sorted 

787 
paint_lookup > paint_rbt_lookup 

788 
paint_tree_greater > paint_rbt_greater 

789 
paint_tree_less > paint_rbt_less 

790 
sorted_entries > rbt_sorted_entries 

791 
tree_greater_eq_trans > rbt_greater_eq_trans 

792 
tree_greater_nit > rbt_greater_nit 

793 
tree_greater_prop > rbt_greater_prop 

794 
tree_greater_simps > rbt_greater_simps 

795 
tree_greater_trans > rbt_greater_trans 

796 
tree_less_eq_trans > rbt_less_eq_trans 

797 
tree_less_nit > rbt_less_nit 

798 
tree_less_prop > rbt_less_prop 

799 
tree_less_simps > rbt_less_simps 

800 
tree_less_trans > rbt_less_trans 

801 
tree_ord_props > rbt_ord_props 

802 
union_Branch > rbt_union_Branch 

803 
union_is_rbt > rbt_union_is_rbt 

804 
unionw_is_rbt > rbt_unionw_is_rbt 

805 
unionwk_is_rbt > rbt_unionwk_is_rbt 

806 
unionwk_sorted > rbt_unionwk_rbt_sorted 

807 

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

810 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  811 

812 
Changed Operations: 

47622  813 
float_abs > abs 
814 
float_nprt > nprt 

815 
float_pprt > pprt 

816 
pow2 > use powr 

817 
round_down > float_round_down 

818 
round_up > float_round_up 

819 
scale > exponent 

820 

821 
Removed Operations: 

822 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

823 

824 
Renamed Lemmas: 

825 
abs_float_def > Float.compute_float_abs 

826 
bitlen_ge0 > bitlen_nonneg 

827 
bitlen.simps > Float.compute_bitlen 

828 
float_components > Float_mantissa_exponent 

829 
float_divl.simps > Float.compute_float_divl 

830 
float_divr.simps > Float.compute_float_divr 

831 
float_eq_odd > mult_powr_eq_mult_powr_iff 

832 
float_power > real_of_float_power 

833 
lapprox_posrat_def > Float.compute_lapprox_posrat 

834 
lapprox_rat.simps > Float.compute_lapprox_rat 

835 
le_float_def' > Float.compute_float_le 

836 
le_float_def > less_eq_float.rep_eq 

837 
less_float_def' > Float.compute_float_less 

838 
less_float_def > less_float.rep_eq 

839 
normfloat_def > Float.compute_normfloat 

840 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

841 
normfloat > normfloat_def 

842 
normfloat_unique > use normfloat_def 

843 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

844 
one_float_def > Float.compute_float_one 

845 
plus_float_def > Float.compute_float_plus 

846 
rapprox_posrat_def > Float.compute_rapprox_posrat 

847 
rapprox_rat.simps > Float.compute_rapprox_rat 

848 
real_of_float_0 > zero_float.rep_eq 

849 
real_of_float_1 > one_float.rep_eq 

850 
real_of_float_abs > abs_float.rep_eq 

851 
real_of_float_add > plus_float.rep_eq 

852 
real_of_float_minus > uminus_float.rep_eq 

853 
real_of_float_mult > times_float.rep_eq 

854 
real_of_float_simp > Float.rep_eq 

855 
real_of_float_sub > minus_float.rep_eq 

856 
round_down.simps > Float.compute_float_round_down 

857 
round_up.simps > Float.compute_float_round_up 

858 
times_float_def > Float.compute_float_times 

859 
uminus_float_def > Float.compute_float_uminus 

860 
zero_float_def > Float.compute_float_zero 

861 

862 
Lemmas not necessary anymore, use the transfer method: 

863 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

864 
float_divr, float_le_simp, float_less1_mantissa_bound, 

865 
float_less_simp, float_less_zero, float_le_zero, 

866 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

867 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

868 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

869 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

870 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

871 
round_up, zero_le_float, zero_less_float 

47616  872 

47856  873 
* New theory HOL/Library/DAList provides an abstract type for 
874 
association lists with distinct keys. 

45791  875 

47866  876 
* Session HOL/IMP: Added new theory of abstract interpretation of 
877 
annotated commands. 

878 

47855  879 
* Session HOLImport: Reimplementation from scratch is faster, 
880 
simpler, and more scalable. Requires a proof bundle, which is 

881 
available as an external component. Discontinued old (and mostly 

882 
dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY. 

883 

884 
* Session HOLWord: Discontinued many redundant theorems specific to 

885 
type 'a word. INCOMPATIBILITY, use the corresponding generic theorems 

886 
instead. 

887 

888 
word_sub_alt ~> word_sub_wi 

889 
word_add_alt ~> word_add_def 

890 
word_mult_alt ~> word_mult_def 

891 
word_minus_alt ~> word_minus_def 

892 
word_0_alt ~> word_0_wi 

893 
word_1_alt ~> word_1_wi 

894 
word_add_0 ~> add_0_left 

895 
word_add_0_right ~> add_0_right 

896 
word_mult_1 ~> mult_1_left 

897 
word_mult_1_right ~> mult_1_right 

898 
word_add_commute ~> add_commute 

899 
word_add_assoc ~> add_assoc 

900 
word_add_left_commute ~> add_left_commute 

901 
word_mult_commute ~> mult_commute 

902 
word_mult_assoc ~> mult_assoc 

903 
word_mult_left_commute ~> mult_left_commute 

904 
word_left_distrib ~> left_distrib 

905 
word_right_distrib ~> right_distrib 

906 
word_left_minus ~> left_minus 

907 
word_diff_0_right ~> diff_0_right 

908 
word_diff_self ~> diff_self 

909 
word_sub_def ~> diff_minus 

910 
word_diff_minus ~> diff_minus 

911 
word_add_ac ~> add_ac 

912 
word_mult_ac ~> mult_ac 

913 
word_plus_ac0 ~> add_0_left add_0_right add_ac 

914 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 

915 
word_order_trans ~> order_trans 

916 
word_order_refl ~> order_refl 

917 
word_order_antisym ~> order_antisym 

918 
word_order_linear ~> linorder_linear 

919 
lenw1_zero_neq_one ~> zero_neq_one 

920 
word_number_of_eq ~> number_of_eq 

921 
word_of_int_add_hom ~> wi_hom_add 

922 
word_of_int_sub_hom ~> wi_hom_sub 

923 
word_of_int_mult_hom ~> wi_hom_mult 

924 
word_of_int_minus_hom ~> wi_hom_neg 

925 
word_of_int_succ_hom ~> wi_hom_succ 

926 
word_of_int_pred_hom ~> wi_hom_pred 

927 
word_of_int_0_hom ~> word_0_wi 

928 
word_of_int_1_hom ~> word_1_wi 

929 

47809  930 
* Session HOLWord: New proof method "word_bitwise" for splitting 
931 
machine word equalities and inequalities into logical circuits, 

932 
defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction, 

933 
multiplication, shifting by constants, bitwise operators and numeric 

934 
constants. Requires fixedlength word types, not 'a word. Solves 

47854  935 
many standard word identities outright and converts more into first 
47809  936 
order problems amenable to blast or similar. See also examples in 
937 
HOL/Word/Examples/WordExamples.thy. 

938 

47807  939 
* Session HOLProbability: Introduced the type "'a measure" to 
940 
represent measures, this replaces the records 'a algebra and 'a 

941 
measure_space. The locales based on subset_class now have two 

47856  942 
localeparameters the space \<Omega> and the set of measurable sets M. 
943 
The product of probability spaces uses now the same constant as the 

944 
finite product of sigmafinite measure spaces "PiM :: ('i => 'a) 

47807  945 
measure". Most constants are defined now outside of locales and gain 
946 
an additional parameter, like null_sets, almost_eventually or \<mu>'. 

947 
Measure space constructions for distributions and densities now got 

948 
their own constants distr and density. Instead of using locales to 

949 
describe measure spaces with a finite space, the measure count_space 

950 
and point_measure is introduced. INCOMPATIBILITY. 

47694  951 

952 
Renamed constants: 

953 
measure > emeasure 

954 
finite_measure.\<mu>' > measure 

955 
product_algebra_generator > prod_algebra 

956 
product_prob_space.emb > prod_emb 

957 
product_prob_space.infprod_algebra > PiM 

958 

959 
Removed locales: 

960 
completeable_measure_space 

961 
finite_measure_space 

962 
finite_prob_space 

963 
finite_product_finite_prob_space 

964 
finite_product_sigma_algebra 

965 
finite_sigma_algebra 

966 
measure_space 

967 
pair_finite_prob_space 

968 
pair_finite_sigma_algebra 

969 
pair_finite_space 

970 
pair_sigma_algebra 

971 
product_sigma_algebra 

972 

973 
Removed constants: 

47751  974 
conditional_space 
47694  975 
distribution > use distr measure, or distributed predicate 
47751  976 
image_space 
47694  977 
joint_distribution > use distr measure, or distributed predicate 
47751  978 
pair_measure_generator 
47694  979 
product_prob_space.infprod_algebra > use PiM 
980 
subvimage 

981 

982 
Replacement theorems: 

47751  983 
finite_additivity_sufficient > ring_of_sets.countably_additiveI_finite 
984 
finite_measure.empty_measure > measure_empty 

985 
finite_measure.finite_continuity_from_above > finite_measure.finite_Lim_measure_decseq 

986 
finite_measure.finite_continuity_from_below > finite_measure.finite_Lim_measure_incseq 

987 
finite_measure.finite_measure_countably_subadditive > finite_measure.finite_measure_subadditive_countably 

988 
finite_measure.finite_measure_eq > finite_measure.emeasure_eq_measure 

989 
finite_measure.finite_measure > finite_measure.emeasure_finite 

990 
finite_measure.finite_measure_finite_singleton > finite_measure.finite_measure_eq_setsum_singleton 

991 
finite_measure.positive_measure' > measure_nonneg 

992 
finite_measure.real_measure > finite_measure.emeasure_real 

993 
finite_product_prob_space.finite_measure_times > finite_product_prob_space.finite_measure_PiM_emb 

994 
finite_product_sigma_algebra.in_P > sets_PiM_I_finite 

995 
finite_product_sigma_algebra.P_empty > space_PiM_empty, sets_PiM_empty 

996 
information_space.conditional_entropy_eq > information_space.conditional_entropy_simple_distributed 

997 
information_space.conditional_entropy_positive > information_space.conditional_entropy_nonneg_simple 

998 
information_space.conditional_mutual_information_eq_mutual_information > information_space.conditional_mutual_information_eq_mutual_information_simple 

999 
information_space.conditional_mutual_information_generic_positive > information_space.conditional_mutual_information_nonneg_simple 

1000 
information_space.conditional_mutual_information_positive > information_space.conditional_mutual_information_nonneg_simple 

1001 
information_space.entropy_commute > information_space.entropy_commute_simple 

1002 
information_space.entropy_eq > information_space.entropy_simple_distributed 

1003 
information_space.entropy_generic_eq > information_space.entropy_simple_distributed 

1004 
information_space.entropy_positive > information_space.entropy_nonneg_simple 

1005 
information_space.entropy_uniform_max > information_space.entropy_uniform 

1006 
information_space.KL_eq_0_imp > information_space.KL_eq_0_iff_eq 

1007 
information_space.KL_eq_0 > information_space.KL_same_eq_0 

1008 
information_space.KL_ge_0 > information_space.KL_nonneg 

1009 
information_space.mutual_information_eq > information_space.mutual_information_simple_distributed 

1010 
information_space.mutual_information_positive > information_space.mutual_information_nonneg_simple 

1011 
Int_stable_cuboids > Int_stable_atLeastAtMost 

1012 
Int_stable_product_algebra_generator > positive_integral 

1013 
measure_preserving > equality "distr M N f = N" "f : measurable M N" 

47694  1014 
measure_space.additive > emeasure_additive 
47751  1015 
measure_space.AE_iff_null_set > AE_iff_null 
1016 
measure_space.almost_everywhere_def > eventually_ae_filter 

1017 
measure_space.almost_everywhere_vimage > AE_distrD 

1018 
measure_space.continuity_from_above > INF_emeasure_decseq 

1019 
measure_space.continuity_from_above_Lim > Lim_emeasure_decseq 

1020 
measure_space.continuity_from_below_Lim > Lim_emeasure_incseq 

47694  1021 
measure_space.continuity_from_below > SUP_emeasure_incseq 
47751  1022 
measure_space_density > emeasure_density 
1023 
measure_space.density_is_absolutely_continuous > absolutely_continuousI_density 

1024 
measure_space.integrable_vimage > integrable_distr 

1025 
measure_space.integral_translated_density > integral_density 

1026 
measure_space.integral_vimage > integral_distr 

1027 
measure_space.measure_additive > plus_emeasure 

1028 
measure_space.measure_compl > emeasure_compl 

1029 
measure_space.measure_countable_increasing > emeasure_countable_increasing 

1030 
measure_space.measure_countably_subadditive > emeasure_subadditive_countably 

47694  1031 
measure_space.measure_decseq > decseq_emeasure 
47751  1032 
measure_space.measure_Diff > emeasure_Diff 
1033 
measure_space.measure_Diff_null_set > emeasure_Diff_null_set 

47694  1034 
measure_space.measure_eq_0 > emeasure_eq_0 
1035 
measure_space.measure_finitely_subadditive > emeasure_subadditive_finite 

47751  1036 
measure_space.measure_finite_singleton > emeasure_eq_setsum_singleton 
1037 
measure_space.measure_incseq > incseq_emeasure 

1038 
measure_space.measure_insert > emeasure_insert 

1039 
measure_space.measure_mono > emeasure_mono 

1040 
measure_space.measure_not_negative > emeasure_not_MInf 

1041 
measure_space.measure_preserving_Int_stable > measure_eqI_generator_eq 

1042 
measure_space.measure_setsum > setsum_emeasure 

1043 
measure_space.measure_setsum_split > setsum_emeasure_cover 

47694  1044 
measure_space.measure_space_vimage > emeasure_distr 
47751  1045 
measure_space.measure_subadditive_finite > emeasure_subadditive_finite 
1046 
measure_space.measure_subadditive > subadditive 

1047 
measure_space.measure_top > emeasure_space 

1048 
measure_space.measure_UN_eq_0 > emeasure_UN_eq_0 

1049 
measure_space.measure_Un_null_set > emeasure_Un_null_set 

1050 
measure_space.positive_integral_translated_density > positive_integral_density 

1051 
measure_space.positive_integral_vimage > positive_integral_distr 

47694  1052 
measure_space.real_continuity_from_above > Lim_measure_decseq 
47751  1053 
measure_space.real_continuity_from_below > Lim_measure_incseq 
47694  1054 
measure_space.real_measure_countably_subadditive > measure_subadditive_countably 
47751  1055 
measure_space.real_measure_Diff > measure_Diff 
1056 
measure_space.real_measure_finite_Union > measure_finite_Union 

1057 
measure_space.real_measure_setsum_singleton > measure_eq_setsum_singleton 

1058 
measure_space.real_measure_subadditive > measure_subadditive 

1059 
measure_space.real_measure_Union > measure_Union 

1060 
measure_space.real_measure_UNION > measure_UNION 

47694  1061 
measure_space.simple_function_vimage > simple_function_comp 
1062 
measure_space.simple_integral_vimage > simple_integral_distr 

47751  1063 
measure_space.simple_integral_vimage > simple_integral_distr 
1064 
measure_unique_Int_stable > measure_eqI_generator_eq 

1065 
measure_unique_Int_stable_vimage > measure_eqI_generator_eq 

47694  1066 
pair_sigma_algebra.measurable_cut_fst > sets_Pair1 
1067 
pair_sigma_algebra.measurable_cut_snd > sets_Pair2 

1068 
pair_sigma_algebra.measurable_pair_image_fst > measurable_Pair1 

1069 
pair_sigma_algebra.measurable_pair_image_snd > measurable_Pair2 

1070 
pair_sigma_algebra.measurable_product_swap > measurable_pair_swap_iff 

1071 
pair_sigma_algebra.pair_sigma_algebra_measurable > measurable_pair_swap 

1072 
pair_sigma_algebra.pair_sigma_algebra_swap_measurable > measurable_pair_swap' 

1073 
pair_sigma_algebra.sets_swap > sets_pair_swap 

47751  1074 
pair_sigma_finite.measure_cut_measurable_fst > pair_sigma_finite.measurable_emeasure_Pair1 
1075 
pair_sigma_finite.measure_cut_measurable_snd > pair_sigma_finite.measurable_emeasure_Pair2 

1076 
pair_sigma_finite.measure_preserving_swap > pair_sigma_finite.distr_pair_swap 

1077 
pair_sigma_finite.pair_measure_alt2 > pair_sigma_finite.emeasure_pair_measure_alt2 

1078 
pair_sigma_finite.pair_measure_alt > pair_sigma_finite.emeasure_pair_measure_alt 

1079 
pair_sigma_finite.pair_measure_times > pair_sigma_finite.emeasure_pair_measure_Times 

1080 
prob_space.indep_distribution_eq_measure > prob_space.indep_vars_iff_distr_eq_PiM 

1081 
prob_space.indep_var_distributionD > prob_space.indep_var_distribution_eq 

47694  1082 
prob_space.measure_space_1 > prob_space.emeasure_space_1 
1083 
prob_space.prob_space_vimage > prob_space_distr 

1084 
prob_space.random_variable_restrict > measurable_restrict 

47751  1085 
prob_space_unique_Int_stable > measure_eqI_prob_space 
1086 
product_algebraE > prod_algebraE_all 

1087 
product_algebra_generator_der > prod_algebra_eq_finite 

1088 
product_algebra_generator_into_space > prod_algebra_sets_into_space 

1089 
product_algebraI > sets_PiM_I_finite 

1090 
product_measure_exists > product_sigma_finite.sigma_finite 

47694  1091 
product_prob_space.finite_index_eq_finite_product > product_prob_space.sets_PiM_generator 
1092 
product_prob_space.finite_measure_infprod_emb_Pi > product_prob_space.measure_PiM_emb 

1093 
product_prob_space.infprod_spec > product_prob_space.emeasure_PiM_emb_not_empty 

1094 
product_prob_space.measurable_component > measurable_component_singleton 

1095 
product_prob_space.measurable_emb > measurable_prod_emb 

1096 
product_prob_space.measurable_into_infprod_algebra > measurable_PiM_single 

1097 
product_prob_space.measurable_singleton_infprod > measurable_component_singleton 

1098 
product_prob_space.measure_emb > emeasure_prod_emb 

47751  1099 
product_prob_space.measure_preserving_restrict > product_prob_space.distr_restrict 
1100 
product_sigma_algebra.product_algebra_into_space > space_closed 

1101 
product_sigma_finite.measure_fold > product_sigma_finite.distr_merge 

1102 
product_sigma_finite.measure_preserving_component_singelton > product_sigma_finite.distr_singleton 

1103 
product_sigma_finite.measure_preserving_merge > product_sigma_finite.distr_merge 

47694  1104 
sequence_space.measure_infprod > sequence_space.measure_PiM_countable 
47751  1105 
sets_product_algebra > sets_PiM 
1106 
sigma_algebra.measurable_sigma > measurable_measure_of 

1107 
sigma_finite_measure.disjoint_sigma_finite > sigma_finite_disjoint 

1108 
sigma_finite_measure.RN_deriv_vimage > sigma_finite_measure.RN_deriv_distr 

1109 
sigma_product_algebra_sigma_eq > sigma_prod_algebra_sigma_eq 

1110 
space_product_algebra > space_PiM 

47694  1111 

47855  1112 
* Session HOLTPTP: support to parse and import TPTP problems (all 
1113 
languages) into Isabelle/HOL. 

47413  1114 

45398
7dbb7b044a11
avoid infinite recursion in peephole optimizer function  this had a debilitating effect on rationals and reals
blanchet
parents:
45384
diff
changeset

1115 

45160  1116 
*** FOL *** 
1117 

45383  1118 
* New "case_product" attribute (see HOL). 
45160  1119 

45109  1120 

47463  1121 
*** ZF *** 
1122 

1123 
* Greater support for structured proofs involving induction or case 

1124 
analysis. 

1125 

1126 
* Much greater use of mathematical symbols. 

1127 

1128 
* Removal of many ML theorem bindings. INCOMPATIBILITY. 

1129 

1130 

45128
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset

1131 
*** ML *** 
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset

1132 

46948  1133 
* Antiquotation @{keyword "name"} produces a parser for outer syntax 
1134 
from a minor keyword introduced via theory header declaration. 

1135 

46961
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46959
diff
changeset

1136 
* Antiquotation @{command_spec "name"} produces the 
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46959
diff
changeset

1137 
Outer_Syntax.command_spec from a major keyword introduced via theory 
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46959
diff
changeset

1138 
header declaration; it can be passed to Outer_Syntax.command etc. 
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46959
diff
changeset

1139 

46916
e7ea35b41e2d
Local_Theory.define no longer hardwires default theorem name  targets/packages need to take care of it;
wenzelm
parents:
46903
diff
changeset

1140 
* Local_Theory.define no longer hardwires default theorem name 
46992
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

1141 
"foo_def", but retains the binding as given. If that is Binding.empty 
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

1142 
/ Attrib.empty_binding, the result is not registered as userlevel 
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

1143 
fact. The Local_Theory.define_internal variant allows to specify a 
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

1144 
nonempty name (used for the foundation in the background theory), 
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

1145 
while omitting the fact binding in the usercontext. Potential 
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

1146 
INCOMPATIBILITY for derived definitional packages: need to specify 
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

1147 
naming policy for primitive definitions more explicitly. 
46916
e7ea35b41e2d
Local_Theory.define no longer hardwires default theorem name  targets/packages need to take care of it;
wenzelm
parents:
46903
diff
changeset

1148 

46497
89ccf66aa73d
renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in conformance with similar operations in structure Term and Logic;
wenzelm
parents:
46493
diff
changeset

1149 
* Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in 
89ccf66aa73d
renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in conformance with similar operations in structure Term and Logic;
wenzelm
parents:
46493
diff
changeset

1150 
conformance with similar operations in structure Term and Logic. 
89ccf66aa73d
renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in conformance with similar operations in structure Term and Logic;
wenzelm
parents:
46493
diff
changeset

1151 

45592  1152 
* Antiquotation @{attributes [...]} embeds attribute source 
1153 
representation into the ML text, which is particularly useful with 

1154 
declarations like Local_Theory.note. 

1155 

45128
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset

1156 
* Structure Proof_Context follows standard naming scheme. Old 
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset

1157 
ProofContext has been discontinued. INCOMPATIBILITY. 
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset

1158 

45293
57def0b39696
refined Local_Theory.declaration {syntax = false, pervasive} semantics: update is applied to auxiliary context as well;
wenzelm
parents:
45233
diff
changeset

1159 
* Refined Local_Theory.declaration {syntax, pervasive}, with subtle 
45298
aa35859c8741
uniform treatment of syntax declaration wrt. aux. context (NB: notation avoids duplicate mixfix internally);
wenzelm
parents:
45293
diff
changeset

1160 
change of semantics: update is applied to auxiliary local theory 
45293
57def0b39696
refined Local_Theory.declaration {syntax = false, pervasive} semantics: update is applied to auxiliary context as well;
wenzelm
parents:
45233
diff
changeset

1161 
context as well. 
57def0b39696
refined Local_Theory.declaration {syntax = false, pervasive} semantics: update is applied to auxiliary context as well;
wenzelm
parents:
45233
diff
changeset

1162 

45620
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1163 
* Modernized some oldstyle infix operations: 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1164 

f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1165 
addeqcongs ~> Simplifier.add_eqcong 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1166 
deleqcongs ~> Simplifier.del_eqcong 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1167 
addcongs ~> Simplifier.add_cong 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1168 
delcongs ~> Simplifier.del_cong 
45625
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

1169 
setmksimps ~> Simplifier.set_mksimps 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

1170 
setmkcong ~> Simplifier.set_mkcong 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

1171 
setmksym ~> Simplifier.set_mksym 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

1172 
setmkeqTrue ~> Simplifier.set_mkeqTrue 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

1173 
settermless ~> Simplifier.set_termless 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

1174 
setsubgoaler ~> Simplifier.set_subgoaler 
45620
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1175 
addsplits ~> Splitter.add_split 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1176 
delsplits ~> Splitter.del_split 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1177 

45128
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset

1178 

47461
5a7903ba2dac
more robust treatment of ISABELLE_HOME on windows: eliminate spaces and funny unicode characters in directory name via DOS~1 notation;
wenzelm
parents:
47453
diff
changeset

1179 
*** System *** 
5a7903ba2dac
more robust treatment of ISABELLE_HOME on windows: eliminate spaces and funny unicode characters in directory name via DOS~1 notation;
wenzelm
parents:
47453
diff
changeset

1180 

47661
012a887997f3
USER_HOME settings variable points to crossplatform user home directory;
wenzelm
parents:
47659
diff
changeset

1181 
* USER_HOME settings variable points to crossplatform user home 
012a887997f3
USER_HOME settings variable points to crossplatform user home directory;
wenzelm
parents:
47659
diff
changeset

1182 
directory, which coincides with HOME on POSIX systems only. Likewise, 
012a887997f3
USER_HOME settings variable points to crossplatform user home directory;
wenzelm
parents:
47659
diff
changeset

1183 
the Isabelle path specification "~" now expands to $USER_HOME, instead 
012a887997f3
USER_HOME settings variable points to crossplatform user home directory;
wenzelm
parents:
47659
diff
changeset

1184 
of former $HOME. A different default for USER_HOME may be set 
012a887997f3
USER_HOME settings variable points to crossplatform user home directory;
wenzelm
parents:
47659
diff
changeset

1185 
explicitly in shell environment, before Isabelle settings are 
012a887997f3
USER_HOME settings variable points to crossplatform user home directory;
wenzelm
parents:
47659
diff
changeset

1186 
evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where 
012a887997f3
USER_HOME settings variable points to crossplatform user home directory;
wenzelm
parents:
47659
diff
changeset

1187 
the generic user home was intended. 
012a887997f3
USER_HOME settings variable points to crossplatform user home directory;
wenzelm
parents:
47659
diff
changeset

1188 

47807  1189 
* ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name 
1190 
notation, which is useful for the jEdit file browser, for example. 

1191 

47464  1192 
* ISABELLE_JDK_HOME settings variable points to JDK with javac and jar 
1193 
(not just JRE). 

1194 

47461
5a7903ba2dac
more robust treatment of ISABELLE_HOME on windows: eliminate spaces and funny unicode characters in directory name via DOS~1 notation;
wenzelm
parents:
47453
diff
changeset

1195 

45109  1196 

44801  1197 
New in Isabelle20111 (October 2011) 
1198 
 

41651  1199 

41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

1200 
*** General *** 
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

1201 

44760  1202 
* Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as 
44968  1203 
"isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line. 
44760  1204 

44777  1205 
 Management of multiple theory files directly from the editor 
44760  1206 
buffer store  bypassing the filesystem (no requirement to save 
1207 
files for checking). 

1208 

44777  1209 
 Markup of formal entities within the text buffer, with semantic 
44760  1210 
highlighting, tooltips and hyperlinks to jump to defining source 
1211 
positions. 

1212 

44777  1213 
 Improved text rendering, with sub/superscripts in the source 
1214 
buffer (including support for copy/paste wrt. output panel, HTML 

1215 
theory output and other nonIsabelle text boxes). 

1216 

1217 
 Refined scheduling of proof checking and printing of results, 

44760  1218 
based on interactive editor view. (Note: jEdit folding and 
1219 
narrowing allows to restrict buffer perspectives explicitly.) 

1220 

44777  1221 
 Reduced CPU performance requirements, usable on machines with few 
44760  1222 
cores. 
1223 

44777  1224 
 Reduced memory requirements due to pruning of unused document 
44760  1225 
versions (garbage collection). 
1226 

1227 
See also ~~/src/Tools/jEdit/README.html for further information, 

1228 
including some remaining limitations. 

1229 

44800  1230 
* Theory loader: source files are exclusively located via the master 
1231 
directory of each theory node (where the .thy file itself resides). 

1232 
The global load path (such as src/HOL/Library) has been discontinued. 

1233 
Note that the path element ~~ may be used to reference theories in the 

1234 
Isabelle home folder  for instance, "~~/src/HOL/Library/FuncSet". 

1235 
INCOMPATIBILITY. 

1236 

41955
703ea96b13c6
files are identified via SHA1 digests  discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset

1237 
* Theory loader: source files are identified by content via SHA1 
703ea96b13c6
files are identified via SHA1 digests  discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset

1238 
digests. Discontinued former path/modtime identification and optional 
703ea96b13c6
files are identified via SHA1 digests  discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset

1239 
ISABELLE_FILE_IDENT plugin scripts. 
703ea96b13c6
files are identified via SHA1 digests  discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset

1240 

41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

1241 
* Parallelization of nested Isar proofs is subject to 
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

1242 
Goal.parallel_proofs_threshold (default 100). See also isabelle 
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

1243 
usedir option Q. 
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

1244 

42669
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1245 
* Name space: former unsynchronized references are now proper 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1246 
configuration options, with more conventional names: 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1247 

04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1248 
long_names ~> names_long 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1249 
short_names ~> names_short 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1250 
unique_names ~> names_unique 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1251 

04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1252 
Minor INCOMPATIBILITY, need to declare options in context like this: 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1253 

04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1254 
declare [[names_unique = false]] 
42358
b47d41d9f4b5
Name_Space: proper configuration options long_names, short_names, unique_names instead of former unsynchronized references;
wenzelm
parents:
42290
diff
changeset

1255 

42502  1256 
* Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note 
1257 
that the result needs to be unique, which means fact specifications 

1258 
may have to be refined after enriching a proof context. 

1259 

44800  1260 
* Attribute "case_names" has been refined: the assumptions in each case 
1261 
can be named now by following the case name with [name1 name2 ...]. 

1262 

44968  1263 
* Isabelle/Isar reference manual has been updated and extended: 
1264 
 "Synopsis" provides a catalog of main Isar language concepts. 

1265 
 Formal references in syntax diagrams, via @{rail} antiquotation. 

1266 
 Updated material from classic "ref" manual, notably about 

1267 
"Classical Reasoner". 

42633  1268 

41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

1269 

41727
ab3f6d76fb23
available_provers ~> supported_provers (for clarity)
blanchet
parents:
41703
diff
changeset

1270 
*** HOL *** 
ab3f6d76fb23
available_provers ~> supported_provers (for clarity)
blanchet
parents:
41703
diff
changeset

1271 

44968  1272 
* Class bot and top require underlying partial order rather than 
44800  1273 
preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY. 
43815
4f6e2965d821
adjusted to tightened specification of classes bot and top
haftmann
parents:
43752
diff
changeset

1274 

43940  1275 
* Class complete_lattice: generalized a couple of lemmas from sets; 
44800  1276 
generalized theorems INF_cong and SUP_cong. New type classes for 
1277 
complete boolean algebras and complete linear orders. Lemmas 

1278 
Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in 

1279 
class complete_linorder. 

1280 

1281 
Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def, 

1282 
Sup_fun_def, Inf_apply, Sup_apply. 

1283 

45088  1284 
Removed redundant lemmas (the right hand side gives hints how to 
1285 
replace them for (metis ...), or (simp only: ...) proofs): 

45041
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1286 

0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1287 
Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right] 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1288 
Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right] 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1289 
Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1290 
Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1291 
Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1292 
Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1293 
Inter_def ~> INF_def, image_def 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1294 
Union_def ~> SUP_def, image_def 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1295 
INT_eq ~> INF_def, and image_def 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1296 
UN_eq ~> SUP_def, and image_def 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1297 
INF_subset ~> INF_superset_mono [OF _ order_refl] 
44800  1298 

1299 
More consistent and comprehensive names: 

1300 

45041
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1301 
INTER_eq_Inter_image ~> INF_def 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1302 
UNION_eq_Union_image ~> SUP_def 
43872  1303 
INFI_def ~> INF_def 
1304 
SUPR_def ~> SUP_def 

44103
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

1305 
INF_leI ~> INF_lower 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

1306 
INF_leI2 ~> INF_lower2 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

1307 
le_INFI ~> INF_greatest 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

1308 
le_SUPI ~> SUP_upper 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

1309 
le_SUPI2 ~> SUP_upper2 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

1310 
SUP_leI ~> SUP_least 
43873  1311 
INFI_bool_eq ~> INF_bool_eq 
1312 
SUPR_bool_eq ~> SUP_bool_eq 

1313 
INFI_apply ~> INF_apply 

1314 
SUPR_apply ~> SUP_apply 

44103
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

1315 
INTER_def ~> INTER_eq 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

1316 
UNION_def ~> UNION_eq 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

1317 

43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43816
diff
changeset

1318 
INCOMPATIBILITY. 
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43816
diff
changeset

1319 

44973
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1320 
* Renamed theory Complete_Lattice to Complete_Lattices. 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1321 
INCOMPATIBILITY. 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1322 

dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1323 
* Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff, 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1324 
INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot, 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1325 
Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image, 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1326 
Sup_insert are now declared as [simp]. INCOMPATIBILITY. 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1327 

dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1328 
* Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff, 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1329 
compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem, 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1330 
sup_inf_absob, sup_left_idem are now declared as [simp]. Minor 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1331 
INCOMPATIBILITY. 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1332 

44845  1333 
* Added syntactic classes "inf" and "sup" for the respective 
1334 
constants. INCOMPATIBILITY: Changes in the argument order of the 

1335 
(mostly internal) locale predicates for some derived classes. 

1336 

44800  1337 
* Theorem collections ball_simps and bex_simps do not contain theorems 
1338 
referring to UNION any longer; these have been moved to collection 

1339 
UN_ball_bex_simps. INCOMPATIBILITY. 

1340 

1341 
* Theory Archimedean_Field: floor now is defined as parameter of a 

1342 
separate type class floor_ceiling. 

1343 

1344 
* Theory Finite_Set: more coherent development of fold_set locales: 

42874  1345 

1346 
locale fun_left_comm ~> locale comp_fun_commute 

1347 
locale fun_left_comm_idem ~> locale comp_fun_idem 

44800  1348 

1349 
Both use pointfree characterization; interpretation proofs may need 

1350 
adjustment. INCOMPATIBILITY. 

42874  1351 

44800  1352 
* Theory Limits: Type "'a net" has been renamed to "'a filter", in 
44081
730f7cced3a6
rename type 'a net to 'a filter, following standard mathematical terminology
huffman
parents:
44027
diff
changeset

1353 
accordance with standard mathematical terminology. INCOMPATIBILITY. 
730f7cced3a6
rename type 'a net to 'a filter, following standard mathematical terminology
huffman
parents:
44027
diff
changeset

1354 

44800  1355 
* Theory Complex_Main: The locale interpretations for the 
1356 
bounded_linear and bounded_bilinear locales have been removed, in 

1357 
order to reduce the number of duplicate lemmas. Users must use the 

1358 
original names for distributivity theorems, potential INCOMPATIBILITY. 

44282
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1359 

f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1360 
divide.add ~> add_divide_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1361 
divide.diff ~> diff_divide_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1362 
divide.setsum ~> setsum_divide_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1363 
mult.add_right ~> right_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1364 
mult.diff_right ~> right_diff_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1365 
mult_right.setsum ~> setsum_right_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1366 
mult_left.diff ~> left_diff_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1367 

44800  1368 
* Theory Complex_Main: Several redundant theorems have been removed or 
44568
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1369 
replaced by more general versions. INCOMPATIBILITY. 
44522
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1370 

45051
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1371 
real_diff_def ~> minus_real_def 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1372 
real_divide_def ~> divide_real_def 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1373 
real_less_def ~> less_le 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1374 
real_abs_def ~> abs_real_def 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1375 
real_sgn_def ~> sgn_real_def 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1376 
real_mult_commute ~> mult_commute 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1377 
real_mult_assoc ~> mult_assoc 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1378 
real_mult_1 ~> mult_1_left 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1379 
real_add_mult_distrib ~> left_distrib 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1380 
real_zero_not_eq_one ~> zero_neq_one 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1381 
real_mult_inverse_left ~> left_inverse 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1382 
INVERSE_ZERO ~> inverse_zero 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1383 
real_le_refl ~> order_refl 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1384 
real_le_antisym ~> order_antisym 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1385 
real_le_trans ~> order_trans 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1386 
real_le_linear ~> linear 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1387 
real_le_eq_diff ~> le_iff_diff_le_0 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1388 
real_add_left_mono ~> add_left_mono 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1389 
real_mult_order ~> mult_pos_pos 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1390 
real_mult_less_mono2 ~> mult_strict_left_mono 
44822
2690b6de5021
remove duplicate lemma real_of_int_real_of_nat in favor of real_of_int_of_nat_eq
huffman
parents:
44777
diff
changeset

1391 
real_of_int_real_of_nat ~> real_of_int_of_nat_eq 
44522
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1392 
real_0_le_divide_iff ~> zero_le_divide_iff 
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1393 
realpow_two_disj ~> power2_eq_iff 
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1394 
real_squared_diff_one_factored ~> square_diff_one_factored 
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1395 
realpow_two_diff ~> square_diff_square_factored 
44669
8e6cdb9c00a7
remove redundant lemma reals_complete2 in favor of complete_real
huffman
parents:
44666
diff
changeset

1396 
reals_complete2 ~> complete_real 
44749
5b1e1432c320
remove redundant lemma real_sum_squared_expand in favor of power2_sum
huffman
parents:
44748
diff
changeset

1397 
real_sum_squared_expand ~> power2_sum 
44522
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1398 
exp_ln_eq ~> ln_unique 
44711  1399 
expi_add ~> exp_add 
1400 
expi_zero ~> exp_zero 

44522
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1401 
lemma_DERIV_subst ~> DERIV_cong 
44568
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1402 
LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1403 
LIMSEQ_const ~> tendsto_const 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1404 
LIMSEQ_norm ~> tendsto_norm 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1405 
LIMSEQ_add ~> tendsto_add 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1406 
LIMSEQ_minus ~> tendsto_minus 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1407 
LIMSEQ_minus_cancel ~> tendsto_minus_cancel 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1408 
LIMSEQ_diff ~> tendsto_diff 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1409 
bounded_linear.LIMSEQ ~> bounded_linear.tendsto 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1410 
bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1411 
LIMSEQ_mult ~> tendsto_mult 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1412 
LIMSEQ_inverse ~> tendsto_inverse 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1413 
LIMSEQ_divide ~> tendsto_divide 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1414 
LIMSEQ_pow ~> tendsto_power 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1415 
LIMSEQ_setsum ~> tendsto_setsum 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1416 
LIMSEQ_setprod ~> tendsto_setprod 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1417 
LIMSEQ_norm_zero ~> tendsto_norm_zero_iff 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1418 
LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1419 
LIMSEQ_imp_rabs ~> tendsto_rabs 
44710  1420 
LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus] 
1421 
LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const] 

1422 
LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const] 

44748 