author  wenzelm 
Mon, 10 Sep 2012 12:13:39 +0200  
changeset 49243  ded41f584938 
parent 49190  e1e1d427747d 
child 49310  6e30078de4f0 
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 

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

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

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

11 

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

14 
Tools that load their additional source files may imitate the 

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

16 
dependencies properly. 

17 

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

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

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

20 

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

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

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

23 

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

24 

48205  25 
*** Pure *** 
26 

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

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

28 
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

29 

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

32 
the rather arbitrary current working directory. 

33 
INCOMPATIBILITY. 

34 

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

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

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

39 
with some care where this is really required. 

40 

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

43 
given given sort. Example (in HOL): 

44 

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

46 

48205  47 

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

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

49 

49190  50 
* Theory "Library/Option_ord" provides instantiation of option type 
51 
to lattice type classes. 

52 

49189  53 
* New combinator "Option.these" with type "'a option set => 'a option". 
54 

49145  55 
* Renamed theory Library/List_Prefix to Library/Sublist. 
56 
INCOMPATIBILITY. Related changes are: 

57 

58 
 Renamed constants: 

59 

60 
prefix ~> prefixeq 

61 
strict_prefix ~> prefix 

62 

63 
Renamed lemmas accordingly, INCOMPATIBILITY. 

64 

65 
 Replaced constant "postfix" by "suffixeq" with swapped argument order 

66 
(i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped old infix 

67 
syntax "xs >>= ys"; use "suffixeq ys xs" instead. Renamed lemmas 

68 
accordingly. INCOMPATIBILITY. 

69 

70 
 New constant "emb" for homeomorphic embedding on lists. New 

71 
abbreviation "sub" for special case "emb (op =)". 

72 

73 
 Library/Sublist does no longer provide "order" and "bot" type class 

74 
instances for the prefix order (merely corresponding locale 

75 
interpretations). The type class instances are to be found in 

76 
Library/Prefix_Order. INCOMPATIBILITY. 

77 

78 
 The sublist relation from Library/Sublist_Order is now based on 

79 
"Sublist.sub". Replaced lemmas: 

80 

81 
le_list_append_le_same_iff ~> Sublist.sub_append_le_same_iff 

82 
le_list_append_mono ~> Sublist.emb_append_mono 

83 
le_list_below_empty ~> Sublist.emb_Nil, Sublist.emb_Nil2 

84 
le_list_Cons_EX ~> Sublist.emb_ConsD 

85 
le_list_drop_Cons2 ~> Sublist.sub_Cons2' 

86 
le_list_drop_Cons_neq ~> Sublist.sub_Cons2_neq 

87 
le_list_drop_Cons ~> Sublist.sub_Cons' 

88 
le_list_drop_many ~> Sublist.sub_drop_many 

89 
le_list_filter_left ~> Sublist.sub_filter_left 

90 
le_list_rev_drop_many ~> Sublist.sub_rev_drop_many 

91 
le_list_rev_take_iff ~> Sublist.sub_append 

92 
le_list_same_length ~> Sublist.sub_same_length 

93 
le_list_take_many_iff ~> Sublist.sub_append' 

94 
less_eq_list.drop ~> less_eq_list_drop 

95 
less_eq_list.induct ~> less_eq_list_induct 

96 
not_le_list_length ~> Sublist.not_sub_length 

97 

98 
INCOMPATIBILITY. 

99 

48977  100 
* HOL/Codatatype: New (co)datatype package with support for mixed, 
101 
nested recursion and interesting nonfree datatypes. 

102 

103 
* HOL/Ordinals_and_Cardinals: Theories of ordinals and cardinals 

104 
(supersedes the AFP entry of the same name). 

105 

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

108 

48206  109 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
110 
expressions. 

48111  111 

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

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

113 

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

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

115 
It is switched on by default, and can be switched off by setting 
48977  116 
the configuration quickcheck_optimise_equality to false. 
47887  117 

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

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

119 
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

120 
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

121 
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

122 
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

123 

48094  124 
* Sledgehammer: 
125 

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

48094  128 
 Rationalized type encodings ("type_enc" option). 
48294  129 
 Renamed options: 
130 
max_relevant ~> max_facts 

131 
relevance_thresholds ~> fact_thresholds 

48094  132 

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

133 

48206  134 
*** Document preparation *** 
135 

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

137 
slightly exotic babel/greek. 

138 

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

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

140 
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

141 
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

142 

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

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

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

145 

48206  146 

48992  147 
*** ML *** 
148 

149 
* Renamed Position.str_of to Position.here to emphasize that this is a 

150 
formal device to inline positions into message text, but not 

151 
necessarily printing visible text. 

152 

153 

48206  154 
*** System *** 
155 

49000  156 
* The ML system is configured as regular component, and no longer 
157 
picked up from some surrounding directory. Potential INCOMPATIBILITY 

158 
for homemade configurations. 

159 

49072
747835eb2782
"isabelle logo" produces EPS and PDF format simultaneously;
wenzelm
parents:
49000
diff
changeset

160 
* The "isabelle logo" tool produces EPS and PDF format simultaneously. 
747835eb2782
"isabelle logo" produces EPS and PDF format simultaneously;
wenzelm
parents:
49000
diff
changeset

161 
Minor INCOMPATIBILITY in commandline options. 
48936  162 

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

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

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

167 

168 
* Discontinued obsolete "isabelle makeall". 

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

169 

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

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

171 
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

172 
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

173 
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

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

175 

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

178 

179 
isabelle build s b HOLCF 

180 

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

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

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

183 

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

186 
"isabelle usedir". 

187 

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

190 
version of Isabelle. 

191 

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

194 
configuration. 

195 

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

198 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

200 
bundled as Isabelle component. 

48206  201 

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

202 

47462  203 
New in Isabelle2012 (May 2012) 
204 
 

45109  205 

45593  206 
*** General *** 
207 

45614  208 
* Prover IDE (PIDE) improvements: 
209 

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

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

45614  217 

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

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

46485  221 

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

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

223 
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

224 
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

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

226 
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

227 

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

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

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

230 
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

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

232 

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

233 
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

234 

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

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

236 

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

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

238 

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

239 
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

240 
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

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

242 

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

243 
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

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

245 

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

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

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

47484  251 

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

254 
oldstyle "standard" after instantiation or composition of facts 

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

256 
indices of schematic variables. 

257 

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

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

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

261 
the historic accident of dynamic reevaluation in interpretations 

262 
etc. was exploited. 

263 

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

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

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

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

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

269 
of the material of that old tutorial. 

270 

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

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

273 
manual. 

274 

275 

276 
*** Pure *** 

277 

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

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

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

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

281 

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

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

285 
undocumented feature.) 

286 

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

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

290 

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

292 

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

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

295 

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

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

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

299 
order to accommodate newly introduced premises.) 

300 

47806  301 
* Renamed some inner syntax categories: 
302 

303 
num ~> num_token 

304 
xnum ~> xnum_token 

305 
xstr ~> str_token 

306 

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

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

309 
position information via constraints). 

310 

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

313 
manual. Minor INCOMPATIBILITY. 

314 

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

45134  317 

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

320 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  321 

47464  322 
* Redundant attribute "code_inline" has been discontinued. Use 
323 
"code_unfold" instead. INCOMPATIBILITY. 

324 

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

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

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

327 

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

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

329 

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

330 
INCOMPATIBILITY. 
45383  331 

47856  332 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
333 
instead. INCOMPATIBILITY. 

334 

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

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

337 
legacy since Isabelle2011). 

47855  338 

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

339 

45122  340 
*** HOL *** 
341 

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

344 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

349 
tinkering with former theorems mem_def and Collect_def as far as 

350 
possible. 

351 

352 
For developments which deliberately mix predicates and sets, a 

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

355 
Isabelle20111 before jumping right into the current release. 

356 

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

359 

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

361 

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

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

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

367 
user theories may require adaptations as follows: 

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

368 

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

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

370 
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

371 

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

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

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

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

375 

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

376 
 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

377 
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

378 

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

379 
 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

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

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

382 

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

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

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

385 

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

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

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

390 
corresponding parts of the Quotient package.) 

47809  391 

392 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

394 
relate different type instances of the same polymorphic constant, 

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

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

397 

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

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

400 

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

402 
equivalent subgoal on the corresponding raw types. Constants are 

403 
replaced with corresponding ones according to the transfer rules. 

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

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

409 

410 
 relator_eq attribute: Collects identity laws for relators of 

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

412 
transfer method uses these lemmas to infer transfer rules for 

413 
nonpolymorphic constants on the fly. 

414 

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

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

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

418 
after unfolding the constant definitions. 

419 

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

421 
from type nat to type int. 

422 

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

47809  425 

426 
 lift_definition command: Defines operations on an abstract type in 

427 
terms of a corresponding operation on a representation 

428 
type. Example syntax: 

429 

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

431 
is List.insert 

432 

433 
Users must discharge a respectfulness proof obligation when each 

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

435 
the proof is discharged automatically.) The obligation is 

436 
presented in a userfriendly, readable form; a respectfulness 

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

438 
by the package. 

439 

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

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

442 
lift_definition generates a code certificate theorem and sets up 

443 
code generation for each constant. 

444 

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

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

447 
or a type_definition theorem. The package configures transfer 

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

449 
lift_definition command to work with the type. 

450 

451 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  452 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
453 
Word/Word.thy and Library/Float.thy. 

47809  454 

455 
* Quotient package: 

456 

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

458 
rep and abs functions, similar to typedef. 

459 

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

461 
Transfer packages, as with 'setup_lifting'. 

462 

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

464 
respectfulness property at the point where the constant is 

465 
defined, similar to lift_definition; INCOMPATIBILITY. 

466 

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

468 
accordingly, INCOMPATIBILITY. 

469 

470 
* New diagnostic command 'find_unused_assms' to find potentially 

471 
superfluous assumptions in theorems using Quickcheck. 

472 

473 
* Quickcheck: 

474 

475 
 Quickcheck returns variable assignments as counterexamples, which 

476 
allows to reveal the underspecification of functions under test. 

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

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

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

480 

481 
These counterexample are marked as potentially spurious, as 

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

483 
obvious theorem "hd xs = hd xs". 

484 

485 
After finding a potentially spurious counterexample, Quickcheck 

486 
continues searching for genuine ones. 

487 

488 
By default, Quickcheck shows potentially spurious and genuine 

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

490 
show genuine counterexamples. 

491 

492 
 The command 'quickcheck_generator' creates random and exhaustive 

493 
value generators for a given type and operations. 

494 

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

496 
constructors of that type. 

497 

498 
 Support for multisets. 

499 

500 
 Added "use_subtype" options. 

501 

502 
 Added "quickcheck_locale" configuration to specify how to process 

503 
conjectures in a locale context. 

504 

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

47809  507 

508 
* Sledgehammer: 

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

510 
paper "More SPASS with Isabelle". 

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

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

513 
TFF1), iProver, iProverEq. 

514 
 Sped up the minimizer. 

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

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

517 
 Renamed "sound" option to "strict". 

518 

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

521 

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

523 

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

47809  525 

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

528 

529 
list.exhaust [case_product nat.exhaust] 

530 

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

532 
a list and a nat. 

533 

47809  534 
* New "eventually_elim" method as a generalized variant of the 
47855  535 
eventually_elim* rules. Supports structured proofs. 
536 

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

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

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

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

540 

47856  541 
* Record: code generation can be switched off manually with 
542 

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

544 

545 
* Datatype: type parameters allow explicit sort constraints. 

546 

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

549 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

551 
one_case. 

552 

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

554 
the result of the fact expression. 

555 

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

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

559 

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

560 
converse_def ~> converse_unfold 
47549  561 
rel_comp_def ~> relcomp_unfold 
47820  562 
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

563 
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

564 
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

565 
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

566 

46981  567 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
568 

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

47086  571 

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

572 
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

573 

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

46458  577 
rel_pow_1 ~> relpow_1 
46363  578 
rel_pow_0_I ~> relpow_0_I 
579 
rel_pow_Suc_I ~> relpow_Suc_I 

580 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

581 
rel_pow_0_E ~> relpow_0_E 

582 
rel_pow_Suc_E ~> relpow_Suc_E 

583 
rel_pow_E ~> relpow_E 

46458  584 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  585 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  586 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
587 
rel_pow_E2 ~> relpow_E2 

588 
rel_pow_add ~> relpow_add 

589 
rel_pow_commute ~> relpow 

590 
rel_pow_empty ~> relpow_empty: 

591 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

592 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

593 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

594 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

595 
rel_pow_fun_conv ~> relpow_fun_conv 

596 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

597 
rel_pow_finite_bounded ~> relpow_finite_bounded 

598 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

599 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

600 
single_valued_rel_pow ~> single_valued_relpow 

47463  601 

46363  602 
INCOMPATIBILITY. 
603 

47448  604 
* Theory Relation: Consolidated constant name for relation composition 
47464  605 
and corresponding theorem names: 
606 

47549  607 
 Renamed constant rel_comp to relcomp. 
47464  608 

47448  609 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  610 

47448  611 
 Renamed theorems: 
47464  612 

47448  613 
rel_compI ~> relcompI 
614 
rel_compEpair ~> relcompEpair 

615 
rel_compE ~> relcompE 

616 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

617 
rel_comp_empty1 ~> relcomp_empty1 

618 
rel_comp_mono ~> relcomp_mono 

619 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

620 
rel_comp_distrib ~> relcomp_distrib 

621 
rel_comp_distrib2 ~> relcomp_distrib2 

622 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

623 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

624 
single_valued_rel_comp ~> single_valued_relcomp 

47549  625 
rel_comp_def ~> relcomp_unfold 
47448  626 
converse_rel_comp ~> converse_relcomp 
627 
pred_compI ~> relcomppI 

628 
pred_compE ~> relcomppE 

629 
pred_comp_bot1 ~> relcompp_bot1 

630 
pred_comp_bot2 ~> relcompp_bot2 

631 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

632 
pred_comp_mono ~> relcompp_mono 

633 
pred_comp_distrib ~> relcompp_distrib 

634 
pred_comp_distrib2 ~> relcompp_distrib2 

635 
converse_pred_comp ~> converse_relcompp 

47464  636 

47448  637 
finite_rel_comp ~> finite_relcomp 
47464  638 

47448  639 
set_rel_comp ~> set_relcomp 
640 

641 
INCOMPATIBILITY. 

642 

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

645 

646 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

647 
zdiv_self ~> div_self 

648 
zmod_self ~> mod_self 

649 
zdiv_zero ~> div_0 

650 
zmod_zero ~> mod_0 

651 
zdiv_zmod_equality ~> div_mod_equality2 

652 
zdiv_zmod_equality2 ~> div_mod_equality 

653 
zmod_zdiv_trivial ~> mod_div_trivial 

654 
zdiv_zminus_zminus ~> div_minus_minus 

655 
zmod_zminus_zminus ~> mod_minus_minus 

656 
zdiv_zminus2 ~> div_minus_right 

657 
zmod_zminus2 ~> mod_minus_right 

658 
zdiv_minus1_right ~> div_minus1_right 

659 
zmod_minus1_right ~> mod_minus1_right 

660 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

661 
zmod_zmult1_eq ~> mod_mult_right_eq 

662 
zpower_zmod ~> power_mod 

663 
zdvd_zmod ~> dvd_mod 

664 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

665 
mod_mult_distrib ~> mult_mod_left 

666 
mod_mult_distrib2 ~> mult_mod_right 

667 

668 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

669 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

670 

47551  671 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
672 

47552  673 
* Consolidated theorem names concerning fold combinators: 
47550  674 

675 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

676 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

677 
INFI_fold_inf ~> INF_fold_inf 

678 
SUPR_fold_sup ~> SUP_fold_sup 

679 
union_set ~> union_set_fold 

680 
minus_set ~> minus_set_fold 

681 
INFI_set_fold ~> INF_set_fold 

682 
SUPR_set_fold ~> SUP_set_fold 

683 
INF_code ~> INF_set_foldr 

684 
SUP_code ~> SUP_set_foldr 

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

686 
foldr_fold_rev ~> foldr_conv_fold 

687 
foldl_fold ~> foldl_conv_fold 

688 
foldr_foldr ~> foldr_conv_foldl 

689 
foldl_foldr ~> foldl_conv_foldr 

47552  690 
fold_set_remdups ~> fold_set_fold_remdups 
691 
fold_set ~> fold_set_fold 

692 
fold1_set ~> fold1_set_fold 

47550  693 

694 
INCOMPATIBILITY. 

695 

696 
* Dropped rarely useful theorems concerning fold combinators: 

697 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

698 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

699 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

700 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

701 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

702 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

706 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

707 

708 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

709 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

710 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

711 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

713 
fold_conv_foldr and fold_rev. 

714 

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

716 
through option types. 

717 

47856  718 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
719 
relations. 

720 

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

722 

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

724 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

725 

726 
zminus_zminus ~> minus_minus 

727 
zminus_0 ~> minus_zero 

728 
zminus_zadd_distrib ~> minus_add_distrib 

729 
zadd_commute ~> add_commute 

730 
zadd_assoc ~> add_assoc 

731 
zadd_left_commute ~> add_left_commute 

732 
zadd_ac ~> add_ac 

733 
zmult_ac ~> mult_ac 

734 
zadd_0 ~> add_0_left 

735 
zadd_0_right ~> add_0_right 

736 
zadd_zminus_inverse2 ~> left_minus 

737 
zmult_zminus ~> mult_minus_left 

738 
zmult_commute ~> mult_commute 

739 
zmult_assoc ~> mult_assoc 

740 
zadd_zmult_distrib ~> left_distrib 

741 
zadd_zmult_distrib2 ~> right_distrib 

742 
zdiff_zmult_distrib ~> left_diff_distrib 

743 
zdiff_zmult_distrib2 ~> right_diff_distrib 

744 
zmult_1 ~> mult_1_left 

745 
zmult_1_right ~> mult_1_right 

746 
zle_refl ~> order_refl 

747 
zle_trans ~> order_trans 

748 
zle_antisym ~> order_antisym 

749 
zle_linear ~> linorder_linear 

750 
zless_linear ~> linorder_less_linear 

751 
zadd_left_mono ~> add_left_mono 

752 
zadd_strict_right_mono ~> add_strict_right_mono 

753 
zadd_zless_mono ~> add_less_le_mono 

754 
int_0_less_1 ~> zero_less_one 

755 
int_0_neq_1 ~> zero_neq_one 

756 
zless_le ~> less_le 

757 
zpower_zadd_distrib ~> power_add 

758 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

759 
zero_le_zpower_abs ~> zero_le_power_abs 

760 

761 
* Theory Deriv: Renamed 

762 

763 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

764 

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

766 

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

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

771 
INCOMPATIBILITY. 

772 

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

775 

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

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

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

780 
follows: 

47452  781 

782 
Operations: 

783 
bulkload > rbt_bulkload 

784 
del_from_left > rbt_del_from_left 

785 
del_from_right > rbt_del_from_right 

786 
del > rbt_del 

787 
delete > rbt_delete 

788 
ins > rbt_ins 

789 
insert > rbt_insert 

790 
insertw > rbt_insert_with 

791 
insert_with_key > rbt_insert_with_key 

792 
map_entry > rbt_map_entry 

793 
lookup > rbt_lookup 

794 
sorted > rbt_sorted 

795 
tree_greater > rbt_greater 

796 
tree_less > rbt_less 

797 
tree_less_symbol > rbt_less_symbol 

798 
union > rbt_union 

799 
union_with > rbt_union_with 

800 
union_with_key > rbt_union_with_key 

801 

802 
Lemmas: 

803 
balance_left_sorted > balance_left_rbt_sorted 

804 
balance_left_tree_greater > balance_left_rbt_greater 

805 
balance_left_tree_less > balance_left_rbt_less 

806 
balance_right_sorted > balance_right_rbt_sorted 

807 
balance_right_tree_greater > balance_right_rbt_greater 

808 
balance_right_tree_less > balance_right_rbt_less 

809 
balance_sorted > balance_rbt_sorted 

810 
balance_tree_greater > balance_rbt_greater 

811 
balance_tree_less > balance_rbt_less 

812 
bulkload_is_rbt > rbt_bulkload_is_rbt 

813 
combine_sorted > combine_rbt_sorted 

814 
combine_tree_greater > combine_rbt_greater 

815 
combine_tree_less > combine_rbt_less 

816 
delete_in_tree > rbt_delete_in_tree 

817 
delete_is_rbt > rbt_delete_is_rbt 

818 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

819 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

820 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

821 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

822 
del_in_tree > rbt_del_in_tree 

823 
del_inv1_inv2 > rbt_del_inv1_inv2 

824 
del_sorted > rbt_del_rbt_sorted 

825 
del_tree_greater > rbt_del_rbt_greater 

826 
del_tree_less > rbt_del_rbt_less 

827 
dom_lookup_Branch > dom_rbt_lookup_Branch 

828 
entries_lookup > entries_rbt_lookup 

829 
finite_dom_lookup > finite_dom_rbt_lookup 

830 
insert_sorted > rbt_insert_rbt_sorted 

831 
insertw_is_rbt > rbt_insertw_is_rbt 

832 
insertwk_is_rbt > rbt_insertwk_is_rbt 

833 
insertwk_sorted > rbt_insertwk_rbt_sorted 

834 
insertw_sorted > rbt_insertw_rbt_sorted 

835 
ins_sorted > ins_rbt_sorted 

836 
ins_tree_greater > ins_rbt_greater 

837 
ins_tree_less > ins_rbt_less 

838 
is_rbt_sorted > is_rbt_rbt_sorted 

839 
lookup_balance > rbt_lookup_balance 

840 
lookup_bulkload > rbt_lookup_rbt_bulkload 

841 
lookup_delete > rbt_lookup_rbt_delete 

842 
lookup_Empty > rbt_lookup_Empty 

843 
lookup_from_in_tree > rbt_lookup_from_in_tree 

844 
lookup_in_tree > rbt_lookup_in_tree 

845 
lookup_ins > rbt_lookup_ins 

846 
lookup_insert > rbt_lookup_rbt_insert 

847 
lookup_insertw > rbt_lookup_rbt_insertw 

848 
lookup_insertwk > rbt_lookup_rbt_insertwk 

849 
lookup_keys > rbt_lookup_keys 

850 
lookup_map > rbt_lookup_map 

851 
lookup_map_entry > rbt_lookup_rbt_map_entry 

852 
lookup_tree_greater > rbt_lookup_rbt_greater 

853 
lookup_tree_less > rbt_lookup_rbt_less 

854 
lookup_union > rbt_lookup_rbt_union 

855 
map_entry_color_of > rbt_map_entry_color_of 

856 
map_entry_inv1 > rbt_map_entry_inv1 

857 
map_entry_inv2 > rbt_map_entry_inv2 

858 
map_entry_is_rbt > rbt_map_entry_is_rbt 

859 
map_entry_sorted > rbt_map_entry_rbt_sorted 

860 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

861 
map_entry_tree_less > rbt_map_entry_rbt_less 

862 
map_tree_greater > map_rbt_greater 

863 
map_tree_less > map_rbt_less 

864 
map_sorted > map_rbt_sorted 

865 
paint_sorted > paint_rbt_sorted 

866 
paint_lookup > paint_rbt_lookup 

867 
paint_tree_greater > paint_rbt_greater 

868 
paint_tree_less > paint_rbt_less 

869 
sorted_entries > rbt_sorted_entries 

870 
tree_greater_eq_trans > rbt_greater_eq_trans 

871 
tree_greater_nit > rbt_greater_nit 

872 
tree_greater_prop > rbt_greater_prop 

873 
tree_greater_simps > rbt_greater_simps 

874 
tree_greater_trans > rbt_greater_trans 

875 
tree_less_eq_trans > rbt_less_eq_trans 

876 
tree_less_nit > rbt_less_nit 

877 
tree_less_prop > rbt_less_prop 

878 
tree_less_simps > rbt_less_simps 

879 
tree_less_trans > rbt_less_trans 

880 
tree_ord_props > rbt_ord_props 

881 
union_Branch > rbt_union_Branch 

882 
union_is_rbt > rbt_union_is_rbt 

883 
unionw_is_rbt > rbt_unionw_is_rbt 

884 
unionwk_is_rbt > rbt_unionwk_is_rbt 

885 
unionwk_sorted > rbt_unionwk_rbt_sorted 

886 

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

889 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  890 

891 
Changed Operations: 

47622  892 
float_abs > abs 
893 
float_nprt > nprt 

894 
float_pprt > pprt 

895 
pow2 > use powr 

896 
round_down > float_round_down 

897 
round_up > float_round_up 

898 
scale > exponent 

899 

900 
Removed Operations: 

901 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

902 

903 
Renamed Lemmas: 

904 
abs_float_def > Float.compute_float_abs 

905 
bitlen_ge0 > bitlen_nonneg 

906 
bitlen.simps > Float.compute_bitlen 

907 
float_components > Float_mantissa_exponent 

908 
float_divl.simps > Float.compute_float_divl 

909 
float_divr.simps > Float.compute_float_divr 

910 
float_eq_odd > mult_powr_eq_mult_powr_iff 

911 
float_power > real_of_float_power 

912 
lapprox_posrat_def > Float.compute_lapprox_posrat 

913 
lapprox_rat.simps > Float.compute_lapprox_rat 

914 
le_float_def' > Float.compute_float_le 

915 
le_float_def > less_eq_float.rep_eq 

916 
less_float_def' > Float.compute_float_less 

917 
less_float_def > less_float.rep_eq 

918 
normfloat_def > Float.compute_normfloat 

919 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

920 
normfloat > normfloat_def 

921 
normfloat_unique > use normfloat_def 

922 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

923 
one_float_def > Float.compute_float_one 

924 
plus_float_def > Float.compute_float_plus 

925 
rapprox_posrat_def > Float.compute_rapprox_posrat 

926 
rapprox_rat.simps > Float.compute_rapprox_rat 

927 
real_of_float_0 > zero_float.rep_eq 

928 
real_of_float_1 > one_float.rep_eq 

929 
real_of_float_abs > abs_float.rep_eq 

930 
real_of_float_add > plus_float.rep_eq 

931 
real_of_float_minus > uminus_float.rep_eq 

932 
real_of_float_mult > times_float.rep_eq 

933 
real_of_float_simp > Float.rep_eq 

934 
real_of_float_sub > minus_float.rep_eq 

935 
round_down.simps > Float.compute_float_round_down 

936 
round_up.simps > Float.compute_float_round_up 

937 
times_float_def > Float.compute_float_times 

938 
uminus_float_def > Float.compute_float_uminus 

939 
zero_float_def > Float.compute_float_zero 

940 

941 
Lemmas not necessary anymore, use the transfer method: 

942 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

943 
float_divr, float_le_simp, float_less1_mantissa_bound, 

944 
float_less_simp, float_less_zero, float_le_zero, 

945 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

946 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

947 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

948 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

949 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

950 
round_up, zero_le_float, zero_less_float 

47616  951 

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

45791  954 

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

957 

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

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

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

962 

963 
* Session HOLWord: Discontinued many redundant theorems specific to 

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

965 
instead. 

966 

967 
word_sub_alt ~> word_sub_wi 

968 
word_add_alt ~> word_add_def 

969 
word_mult_alt ~> word_mult_def 

970 
word_minus_alt ~> word_minus_def 

971 
word_0_alt ~> word_0_wi 

972 
word_1_alt ~> word_1_wi 

973 
word_add_0 ~> add_0_left 

974 
word_add_0_right ~> add_0_right 

975 
word_mult_1 ~> mult_1_left 

976 
word_mult_1_right ~> mult_1_right 

977 
word_add_commute ~> add_commute 

978 
word_add_assoc ~> add_assoc 

979 
word_add_left_commute ~> add_left_commute 

980 
word_mult_commute ~> mult_commute 

981 
word_mult_assoc ~> mult_assoc 

982 
word_mult_left_commute ~> mult_left_commute 

983 
word_left_distrib ~> left_distrib 

984 
word_right_distrib ~> right_distrib 

985 
word_left_minus ~> left_minus 

986 
word_diff_0_right ~> diff_0_right 

987 
word_diff_self ~> diff_self 

988 
word_sub_def ~> diff_minus 

989 
word_diff_minus ~> diff_minus 

990 
word_add_ac ~> add_ac 

991 
word_mult_ac ~> mult_ac 

992 
word_plus_ac0 ~> add_0_left add_0_right add_ac 

993 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 

994 
word_order_trans ~> order_trans 

995 
word_order_refl ~> order_refl 

996 
word_order_antisym ~> order_antisym 

997 
word_order_linear ~> linorder_linear 

998 
lenw1_zero_neq_one ~> zero_neq_one 

999 
word_number_of_eq ~> number_of_eq 

1000 
word_of_int_add_hom ~> wi_hom_add 

1001 
word_of_int_sub_hom ~> wi_hom_sub 

1002 
word_of_int_mult_hom ~> wi_hom_mult 

1003 
word_of_int_minus_hom ~> wi_hom_neg 

1004 
word_of_int_succ_hom ~> wi_hom_succ 

1005 
word_of_int_pred_hom ~> wi_hom_pred 

1006 
word_of_int_0_hom ~> word_0_wi 

1007 
word_of_int_1_hom ~> word_1_wi 

1008 

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

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

1012 
multiplication, shifting by constants, bitwise operators and numeric 

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

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

1017 

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

1020 
measure_space. The locales based on subset_class now have two 

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

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

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

1026 
Measure space constructions for distributions and densities now got 

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

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

1029 
and point_measure is introduced. INCOMPATIBILITY. 

47694  1030 

1031 
Renamed constants: 

1032 
measure > emeasure 

1033 
finite_measure.\<mu>' > measure 

1034 
product_algebra_generator > prod_algebra 

1035 
product_prob_space.emb > prod_emb 

1036 
product_prob_space.infprod_algebra > PiM 

1037 

1038 
Removed locales: 

1039 
completeable_measure_space 

1040 
finite_measure_space 

1041 
finite_prob_space 

1042 
finite_product_finite_prob_space 

1043 
finite_product_sigma_algebra 

1044 
finite_sigma_algebra 

1045 
measure_space 

1046 
pair_finite_prob_space 

1047 
pair_finite_sigma_algebra 

1048 
pair_finite_space 

1049 
pair_sigma_algebra 

1050 
product_sigma_algebra 

1051 

1052 
Removed constants: 

47751  1053 
conditional_space 
47694  1054 
distribution > use distr measure, or distributed predicate 
47751  1055 
image_space 
47694  1056 
joint_distribution > use distr measure, or distributed predicate 
47751  1057 
pair_measure_generator 
47694  1058 
product_prob_space.infprod_algebra > use PiM 
1059 
subvimage 

1060 

1061 
Replacement theorems: 

47751  1062 
finite_additivity_sufficient > ring_of_sets.countably_additiveI_finite 
1063 
finite_measure.empty_measure > measure_empty 

1064 
finite_measure.finite_continuity_from_above > finite_measure.finite_Lim_measure_decseq 

1065 
finite_measure.finite_continuity_from_below > finite_measure.finite_Lim_measure_incseq 

1066 
finite_measure.finite_measure_countably_subadditive > finite_measure.finite_measure_subadditive_countably 

1067 
finite_measure.finite_measure_eq > finite_measure.emeasure_eq_measure 

1068 
finite_measure.finite_measure > finite_measure.emeasure_finite 

1069 
finite_measure.finite_measure_finite_singleton > finite_measure.finite_measure_eq_setsum_singleton 

1070 
finite_measure.positive_measure' > measure_nonneg 

1071 
finite_measure.real_measure > finite_measure.emeasure_real 

1072 
finite_product_prob_space.finite_measure_times > finite_product_prob_space.finite_measure_PiM_emb 

1073 
finite_product_sigma_algebra.in_P > sets_PiM_I_finite 

1074 
finite_product_sigma_algebra.P_empty > space_PiM_empty, sets_PiM_empty 

1075 
information_space.conditional_entropy_eq > information_space.conditional_entropy_simple_distributed 

1076 
information_space.conditional_entropy_positive > information_space.conditional_entropy_nonneg_simple 

1077 
information_space.conditional_mutual_information_eq_mutual_information > information_space.conditional_mutual_information_eq_mutual_information_simple 

1078 
information_space.conditional_mutual_information_generic_positive > information_space.conditional_mutual_information_nonneg_simple 

1079 
information_space.conditional_mutual_information_positive > information_space.conditional_mutual_information_nonneg_simple 

1080 
information_space.entropy_commute > information_space.entropy_commute_simple 

1081 
information_space.entropy_eq > information_space.entropy_simple_distributed 

1082 
information_space.entropy_generic_eq > information_space.entropy_simple_distributed 

1083 
information_space.entropy_positive > information_space.entropy_nonneg_simple 

1084 
information_space.entropy_uniform_max > information_space.entropy_uniform 

1085 
information_space.KL_eq_0_imp > information_space.KL_eq_0_iff_eq 

1086 
information_space.KL_eq_0 > information_space.KL_same_eq_0 

1087 
information_space.KL_ge_0 > information_space.KL_nonneg 

1088 
information_space.mutual_information_eq > information_space.mutual_information_simple_distributed 

1089 
information_space.mutual_information_positive > information_space.mutual_information_nonneg_simple 

1090 
Int_stable_cuboids > Int_stable_atLeastAtMost 

1091 
Int_stable_product_algebra_generator > positive_integral 

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

47694  1093 
measure_space.additive > emeasure_additive 
47751  1094 
measure_space.AE_iff_null_set > AE_iff_null 
1095 
measure_space.almost_everywhere_def > eventually_ae_filter 

1096 
measure_space.almost_everywhere_vimage > AE_distrD 

1097 
measure_space.continuity_from_above > INF_emeasure_decseq 

1098 
measure_space.continuity_from_above_Lim > Lim_emeasure_decseq 

1099 
measure_space.continuity_from_below_Lim > Lim_emeasure_incseq 

47694  1100 
measure_space.continuity_from_below > SUP_emeasure_incseq 
47751  1101 
measure_space_density > emeasure_density 
1102 
measure_space.density_is_absolutely_continuous > absolutely_continuousI_density 

1103 
measure_space.integrable_vimage > integrable_distr 

1104 
measure_space.integral_translated_density > integral_density 

1105 
measure_space.integral_vimage > integral_distr 

1106 
measure_space.measure_additive > plus_emeasure 

1107 
measure_space.measure_compl > emeasure_compl 

1108 
measure_space.measure_countable_increasing > emeasure_countable_increasing 

1109 
measure_space.measure_countably_subadditive > emeasure_subadditive_countably 

47694  1110 
measure_space.measure_decseq > decseq_emeasure 
47751  1111 
measure_space.measure_Diff > emeasure_Diff 
1112 
measure_space.measure_Diff_null_set > emeasure_Diff_null_set 

47694  1113 
measure_space.measure_eq_0 > emeasure_eq_0 
1114 
measure_space.measure_finitely_subadditive > emeasure_subadditive_finite 

47751  1115 
measure_space.measure_finite_singleton > emeasure_eq_setsum_singleton 
1116 
measure_space.measure_incseq > incseq_emeasure 

1117 
measure_space.measure_insert > emeasure_insert 

1118 
measure_space.measure_mono > emeasure_mono 

1119 
measure_space.measure_not_negative > emeasure_not_MInf 

1120 
measure_space.measure_preserving_Int_stable > measure_eqI_generator_eq 

1121 
measure_space.measure_setsum > setsum_emeasure 

1122 
measure_space.measure_setsum_split > setsum_emeasure_cover 

47694  1123 
measure_space.measure_space_vimage > emeasure_distr 
47751  1124 
measure_space.measure_subadditive_finite > emeasure_subadditive_finite 
1125 
measure_space.measure_subadditive > subadditive 

1126 
measure_space.measure_top > emeasure_space 

1127 
measure_space.measure_UN_eq_0 > emeasure_UN_eq_0 

1128 
measure_space.measure_Un_null_set > emeasure_Un_null_set 

1129 
measure_space.positive_integral_translated_density > positive_integral_density 

1130 
measure_space.positive_integral_vimage > positive_integral_distr 

47694  1131 
measure_space.real_continuity_from_above > Lim_measure_decseq 
47751  1132 
measure_space.real_continuity_from_below > Lim_measure_incseq 
47694  1133 
measure_space.real_measure_countably_subadditive > measure_subadditive_countably 
47751  1134 
measure_space.real_measure_Diff > measure_Diff 
1135 
measure_space.real_measure_finite_Union > measure_finite_Union 

1136 
measure_space.real_measure_setsum_singleton > measure_eq_setsum_singleton 

1137 
measure_space.real_measure_subadditive > measure_subadditive 

1138 
measure_space.real_measure_Union > measure_Union 

1139 
measure_space.real_measure_UNION > measure_UNION 

47694  1140 
measure_space.simple_function_vimage > simple_function_comp 
1141 
measure_space.simple_integral_vimage > simple_integral_distr 

47751  1142 
measure_space.simple_integral_vimage > simple_integral_distr 
1143 
measure_unique_Int_stable > measure_eqI_generator_eq 

1144 
measure_unique_Int_stable_vimage > measure_eqI_generator_eq 

47694  1145 
pair_sigma_algebra.measurable_cut_fst > sets_Pair1 
1146 
pair_sigma_algebra.measurable_cut_snd > sets_Pair2 

1147 
pair_sigma_algebra.measurable_pair_image_fst > measurable_Pair1 

1148 
pair_sigma_algebra.measurable_pair_image_snd > measurable_Pair2 

1149 
pair_sigma_algebra.measurable_product_swap > measurable_pair_swap_iff 

1150 
pair_sigma_algebra.pair_sigma_algebra_measurable > measurable_pair_swap 

1151 
pair_sigma_algebra.pair_sigma_algebra_swap_measurable > measurable_pair_swap' 

1152 
pair_sigma_algebra.sets_swap > sets_pair_swap 

47751  1153 
pair_sigma_finite.measure_cut_measurable_fst > pair_sigma_finite.measurable_emeasure_Pair1 
1154 
pair_sigma_finite.measure_cut_measurable_snd > pair_sigma_finite.measurable_emeasure_Pair2 

1155 
pair_sigma_finite.measure_preserving_swap > pair_sigma_finite.distr_pair_swap 

1156 
pair_sigma_finite.pair_measure_alt2 > pair_sigma_finite.emeasure_pair_measure_alt2 

1157 
pair_sigma_finite.pair_measure_alt > pair_sigma_finite.emeasure_pair_measure_alt 

1158 
pair_sigma_finite.pair_measure_times > pair_sigma_finite.emeasure_pair_measure_Times 

1159 
prob_space.indep_distribution_eq_measure > prob_space.indep_vars_iff_distr_eq_PiM 

1160 
prob_space.indep_var_distributionD > prob_space.indep_var_distribution_eq 

47694  1161 
prob_space.measure_space_1 > prob_space.emeasure_space_1 
1162 
prob_space.prob_space_vimage > prob_space_distr 

1163 
prob_space.random_variable_restrict > measurable_restrict 

47751  1164 
prob_space_unique_Int_stable > measure_eqI_prob_space 
1165 
product_algebraE > prod_algebraE_all 

1166 
product_algebra_generator_der > prod_algebra_eq_finite 

1167 
product_algebra_generator_into_space > prod_algebra_sets_into_space 

1168 
product_algebraI > sets_PiM_I_finite 

1169 
product_measure_exists > product_sigma_finite.sigma_finite 

47694  1170 
product_prob_space.finite_index_eq_finite_product > product_prob_space.sets_PiM_generator 
1171 
product_prob_space.finite_measure_infprod_emb_Pi > product_prob_space.measure_PiM_emb 

1172 
product_prob_space.infprod_spec > product_prob_space.emeasure_PiM_emb_not_empty 

1173 
product_prob_space.measurable_component > measurable_component_singleton 

1174 
product_prob_space.measurable_emb > measurable_prod_emb 

1175 
product_prob_space.measurable_into_infprod_algebra > measurable_PiM_single 

1176 
product_prob_space.measurable_singleton_infprod > measurable_component_singleton 

1177 
product_prob_space.measure_emb > emeasure_prod_emb 

47751  1178 
product_prob_space.measure_preserving_restrict > product_prob_space.distr_restrict 
1179 
product_sigma_algebra.product_algebra_into_space > space_closed 

1180 
product_sigma_finite.measure_fold > product_sigma_finite.distr_merge 

1181 
product_sigma_finite.measure_preserving_component_singelton > product_sigma_finite.distr_singleton 

1182 
product_sigma_finite.measure_preserving_merge > product_sigma_finite.distr_merge 

47694  1183 
sequence_space.measure_infprod > sequence_space.measure_PiM_countable 
47751  1184 
sets_product_algebra > sets_PiM 
1185 
sigma_algebra.measurable_sigma > measurable_measure_of 

1186 
sigma_finite_measure.disjoint_sigma_finite > sigma_finite_disjoint 

1187 
sigma_finite_measure.RN_deriv_vimage > sigma_finite_measure.RN_deriv_distr 

1188 
sigma_product_algebra_sigma_eq > sigma_prod_algebra_sigma_eq 

1189 
space_product_algebra > space_PiM 

47694  1190 

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

47413  1193 

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

1194 

45160  1195 
*** FOL *** 
1196 

45383  1197 
* New "case_product" attribute (see HOL). 
45160  1198 

45109  1199 

47463  1200 
*** ZF *** 
1201 

1202 
* Greater support for structured proofs involving induction or case 

1203 
analysis. 

1204 

1205 
* Much greater use of mathematical symbols. 

1206 

1207 
* Removal of many ML theorem bindings. INCOMPATIBILITY. 

1208 

1209 

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

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

1211 

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

1214 

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

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

1216 
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

1217 
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

1218 

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

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

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

1221 
/ 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

1222 
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

1223 
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

1224 
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

1225 
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

1226 
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

1227 

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

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

1229 
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

1230 

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

1233 
declarations like Local_Theory.note. 

1234 

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

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

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

1237 

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

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

1239 
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

1240 
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

1241 

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

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

1243 

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

1244 
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

1245 
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

1246 
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

1247 
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

1248 
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

1249 
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

1250 
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

1251 
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

1252 
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

1253 
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

1254 
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

1255 
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

1256 

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

1257 

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

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

1259 

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

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

1261 
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

1262 
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

1263 
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

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

1265 
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

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

1267 

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

1270 

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

1273 

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

1274 

45109  1275 

44801  1276 
New in Isabelle20111 (October 2011) 
1277 
 

41651  1278 

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

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

1280 

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

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

1287 

44777  1288 
 Markup of formal entities within the text buffer, with semantic 
44760  1289 
highlighting, tooltips and hyperlinks to jump to defining source 
1290 
positions. 

1291 

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

1294 
theory output and other nonIsabelle text boxes). 

1295 

1296 
 Refined scheduling of proof checking and printing of results, 

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

1299 

44777  1300 
 Reduced CPU performance requirements, usable on machines with few 
44760  1301 
cores. 
1302 

44777  1303 
 Reduced memory requirements due to pruning of unused document 
44760  1304 
versions (garbage collection). 
1305 

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

1307 
including some remaining limitations. 

1308 

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

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

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

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

1314 
INCOMPATIBILITY. 

1315 

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

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

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

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

1319 

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

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

1321 
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

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

1323 

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

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

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

1326 

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

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

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

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

1330 

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

1331 
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

1332 

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

1333 
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

1334 

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

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

1338 

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

1341 

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

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

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

1346 
"Classical Reasoner". 

42633  1347 

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

1348 

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

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

1350 

44968  1351 
* Class bot and top require underlying partial order rather than 
44800  1352 
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

1353 

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

1357 
Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in 

1358 
class complete_linorder. 

1359 

1360 
Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def, 

1361 
Sup_fun_def, Inf_apply, Sup_apply. 

1362 

45088  1363 
Removed redundant lemmas (the right hand side gives hints how to 
1364 
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

1365 

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

1366 
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

1367 
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

1368 
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

1369 
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

1370 
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

1371 
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

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

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

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

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

1376 
INF_subset ~> INF_superset_mono [OF _ order_refl] 
44800  1377 

1378 
More consistent and comprehensive names: 

1379 

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

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

1381 
UNION_eq_Union_image ~> SUP_def 
43872  1382 
INFI_def ~> INF_def 
1383 
SUPR_def ~> SUP_def 

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

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

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

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

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

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

1389 
SUP_leI ~> SUP_least 
43873  1390 
INFI_bool_eq ~> INF_bool_eq 
1391 
SUPR_bool_eq ~> SUP_bool_eq 

1392 
INFI_apply ~> INF_apply 

1393 
SUPR_apply ~> SUP_apply 

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

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

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

1396 

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

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

1398 

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

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

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

1401 

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

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

1403 
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

1404 
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

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

1406 

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

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

1408 
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

1409 
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

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

1411 

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