author  huffman 
Tue, 09 Oct 2012 17:33:46 +0200  
changeset 49759  ecf1d5d87e5e 
parent 49739  13aa6d8268ec 
child 49770  cf6a78acf445 
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 

49532  9 
* Prover IDE (PIDE) improvements: 
10 
. parallel terminal proofs ('by'); 

11 
. improved output panel with tooltips, hyperlinks etc.; 

12 
. more efficient painting, improved reactivity; 

13 
. more robust incremental parsing of outer syntax (partial 

14 
comments, malformed symbols); 

49647  15 
. smarter handling of tracing messages (via tracing_limit); 
49532  16 
. more plugin options and preferences, based on Isabelle/Scala; 
17 
. uniform Java 7 platform on Linux, Mac OS X, Windows; 

18 

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

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

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

23 

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

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

25 
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

26 

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

29 
Tools that load their additional source files may imitate the 

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

31 
dependencies properly. 

32 

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

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

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

35 

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

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

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

38 

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

39 

48205  40 
*** Pure *** 
41 

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

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

43 
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

44 

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

47 
the rather arbitrary current working directory. 

48 
INCOMPATIBILITY. 

49 

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

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

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

54 
with some care where this is really required. 

55 

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

58 
given given sort. Example (in HOL): 

59 

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

61 

48205  62 

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

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

64 

49739  65 
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. 
66 

49738  67 
* Class "comm_monoid_diff" formalises properties of bounded 
49388  68 
subtraction, with natural numbers and multisets as typical instances. 
69 

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

72 

49738  73 
* New combinator "Option.these" with type "'a option set => 'a set". 
49189  74 

49145  75 
* Renamed theory Library/List_Prefix to Library/Sublist. 
76 
INCOMPATIBILITY. Related changes are: 

77 

78 
 Renamed constants: 

79 

80 
prefix ~> prefixeq 

81 
strict_prefix ~> prefix 

82 

83 
Renamed lemmas accordingly, INCOMPATIBILITY. 

84 

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

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

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

88 
accordingly. INCOMPATIBILITY. 

89 

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

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

92 

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

94 
instances for the prefix order (merely corresponding locale 

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

96 
Library/Prefix_Order. INCOMPATIBILITY. 

97 

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

99 
"Sublist.sub". Replaced lemmas: 

100 

101 
le_list_append_le_same_iff ~> Sublist.sub_append_le_same_iff 

102 
le_list_append_mono ~> Sublist.emb_append_mono 

103 
le_list_below_empty ~> Sublist.emb_Nil, Sublist.emb_Nil2 

104 
le_list_Cons_EX ~> Sublist.emb_ConsD 

105 
le_list_drop_Cons2 ~> Sublist.sub_Cons2' 

106 
le_list_drop_Cons_neq ~> Sublist.sub_Cons2_neq 

107 
le_list_drop_Cons ~> Sublist.sub_Cons' 

108 
le_list_drop_many ~> Sublist.sub_drop_many 

109 
le_list_filter_left ~> Sublist.sub_filter_left 

110 
le_list_rev_drop_many ~> Sublist.sub_rev_drop_many 

111 
le_list_rev_take_iff ~> Sublist.sub_append 

112 
le_list_same_length ~> Sublist.sub_same_length 

113 
le_list_take_many_iff ~> Sublist.sub_append' 

114 
less_eq_list.drop ~> less_eq_list_drop 

115 
less_eq_list.induct ~> less_eq_list_induct 

116 
not_le_list_length ~> Sublist.not_sub_length 

117 

118 
INCOMPATIBILITY. 

119 

49510
ba50d204095e
renamed "Codatatype" directory "BNF" (and corresponding session)  this opens the door to nononsense session names like "HOLBNFLFP"
blanchet
parents:
49481
diff
changeset

120 
* HOL/BNF: New (co)datatype package based on bounded natural 
ba50d204095e
renamed "Codatatype" directory "BNF" (and corresponding session)  this opens the door to nononsense session names like "HOLBNFLFP"
blanchet
parents:
49481
diff
changeset

121 
functors with support for mixed, nested recursion and interesting 
ba50d204095e
renamed "Codatatype" directory "BNF" (and corresponding session)  this opens the door to nononsense session names like "HOLBNFLFP"
blanchet
parents:
49481
diff
changeset

122 
nonfree datatypes. 
48977  123 

49310  124 
* HOL/Cardinals: Theories of ordinals and cardinals 
125 
(supersedes the AFP entry "Ordinals_and_Cardinals"). 

48977  126 

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

129 

49481
818bf31759e7
NEWS and CONTRIBUTORS for a5377f6d9f14 and f0ecc1550998
Andreas Lochbihler
parents:
49388
diff
changeset

130 
* Library/FinFun.thy: theory of almost everywhere constant functions 
818bf31759e7
NEWS and CONTRIBUTORS for a5377f6d9f14 and f0ecc1550998
Andreas Lochbihler
parents:
49388
diff
changeset

131 
(supersedes the AFP entry "Code Generation for Functions as Data"). 
818bf31759e7
NEWS and CONTRIBUTORS for a5377f6d9f14 and f0ecc1550998
Andreas Lochbihler
parents:
49388
diff
changeset

132 

818bf31759e7
NEWS and CONTRIBUTORS for a5377f6d9f14 and f0ecc1550998
Andreas Lochbihler
parents:
49388
diff
changeset

133 
* Library/Phantom.thy: generic phantom type to make a type parameter 
818bf31759e7
NEWS and CONTRIBUTORS for a5377f6d9f14 and f0ecc1550998
Andreas Lochbihler
parents:
49388
diff
changeset

134 
appear in a constant's type. This alternative to adding TYPE('a) as 
818bf31759e7
NEWS and CONTRIBUTORS for a5377f6d9f14 and f0ecc1550998
Andreas Lochbihler
parents:
49388
diff
changeset

135 
another parameter avoids unnecessary closures in generated code. 
818bf31759e7
NEWS and CONTRIBUTORS for a5377f6d9f14 and f0ecc1550998
Andreas Lochbihler
parents:
49388
diff
changeset

136 

48206  137 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
138 
expressions. 

48111  139 

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

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

141 

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

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

143 
It is switched on by default, and can be switched off by setting 
48977  144 
the configuration quickcheck_optimise_equality to false. 
47887  145 

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

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

147 
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

148 
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

149 
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

150 
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

151 

48094  152 
* Sledgehammer: 
153 

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

48094  156 
 Rationalized type encodings ("type_enc" option). 
49365  157 
 Renamed "kill_provers" subcommand to "kill" 
48294  158 
 Renamed options: 
159 
max_relevant ~> max_facts 

160 
relevance_thresholds ~> fact_thresholds 

48094  161 

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

162 

48206  163 
*** Document preparation *** 
164 

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

166 
slightly exotic babel/greek. 

167 

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

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

169 
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

170 
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

171 

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

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

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

174 

48206  175 

48992  176 
*** ML *** 
177 

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

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

180 
necessarily printing visible text. 

181 

182 

48206  183 
*** System *** 
184 

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

187 
for homemade configurations. 

188 

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

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

190 
Minor INCOMPATIBILITY in commandline options. 
48936  191 

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

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

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

196 

197 
* Discontinued obsolete "isabelle makeall". 

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

198 

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

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

200 
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

201 
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

202 
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

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

204 

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

207 

208 
isabelle build s b HOLCF 

209 

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

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

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

212 

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

215 
"isabelle usedir". 

216 

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

219 
version of Isabelle. 

220 

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

223 
configuration. 

224 

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

227 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

229 
bundled as Isabelle component. 

48206  230 

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

231 

47462  232 
New in Isabelle2012 (May 2012) 
233 
 

45109  234 

45593  235 
*** General *** 
236 

45614  237 
* Prover IDE (PIDE) improvements: 
238 

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

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

45614  246 

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

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

46485  250 

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

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

252 
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

253 
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

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

255 
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

256 

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

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

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

259 
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

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

261 

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

262 
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

263 

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

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

265 

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

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

267 

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

268 
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

269 
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

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

271 

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

272 
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

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

274 

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

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

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

47484  280 

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

283 
oldstyle "standard" after instantiation or composition of facts 

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

285 
indices of schematic variables. 

286 

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

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

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

290 
the historic accident of dynamic reevaluation in interpretations 

291 
etc. was exploited. 

292 

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

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

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

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

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

298 
of the material of that old tutorial. 

299 

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

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

302 
manual. 

303 

304 

305 
*** Pure *** 

306 

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

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

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

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

310 

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

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

314 
undocumented feature.) 

315 

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

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

319 

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

321 

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

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

324 

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

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

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

328 
order to accommodate newly introduced premises.) 

329 

47806  330 
* Renamed some inner syntax categories: 
331 

332 
num ~> num_token 

333 
xnum ~> xnum_token 

334 
xstr ~> str_token 

335 

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

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

338 
position information via constraints). 

339 

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

342 
manual. Minor INCOMPATIBILITY. 

343 

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

45134  346 

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

349 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  350 

47464  351 
* Redundant attribute "code_inline" has been discontinued. Use 
352 
"code_unfold" instead. INCOMPATIBILITY. 

353 

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

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

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

356 

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

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

358 

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

359 
INCOMPATIBILITY. 
45383  360 

47856  361 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
362 
instead. INCOMPATIBILITY. 

363 

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

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

366 
legacy since Isabelle2011). 

47855  367 

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

368 

45122  369 
*** HOL *** 
370 

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

373 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

378 
tinkering with former theorems mem_def and Collect_def as far as 

379 
possible. 

380 

381 
For developments which deliberately mix predicates and sets, a 

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

384 
Isabelle20111 before jumping right into the current release. 

385 

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

388 

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

390 

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

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

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

396 
user theories may require adaptations as follows: 

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

397 

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

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

399 
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

400 

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

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

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

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

404 

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

405 
 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

406 
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

407 

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

408 
 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

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

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

411 

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

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

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

414 

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

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

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

419 
corresponding parts of the Quotient package.) 

47809  420 

421 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

423 
relate different type instances of the same polymorphic constant, 

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

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

426 

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

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

429 

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

431 
equivalent subgoal on the corresponding raw types. Constants are 

432 
replaced with corresponding ones according to the transfer rules. 

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

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

438 

439 
 relator_eq attribute: Collects identity laws for relators of 

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

441 
transfer method uses these lemmas to infer transfer rules for 

442 
nonpolymorphic constants on the fly. 

443 

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

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

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

447 
after unfolding the constant definitions. 

448 

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

450 
from type nat to type int. 

451 

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

47809  454 

455 
 lift_definition command: Defines operations on an abstract type in 

456 
terms of a corresponding operation on a representation 

457 
type. Example syntax: 

458 

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

460 
is List.insert 

461 

462 
Users must discharge a respectfulness proof obligation when each 

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

464 
the proof is discharged automatically.) The obligation is 

465 
presented in a userfriendly, readable form; a respectfulness 

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

467 
by the package. 

468 

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

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

471 
lift_definition generates a code certificate theorem and sets up 

472 
code generation for each constant. 

473 

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

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

476 
or a type_definition theorem. The package configures transfer 

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

478 
lift_definition command to work with the type. 

479 

480 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  481 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
482 
Word/Word.thy and Library/Float.thy. 

47809  483 

484 
* Quotient package: 

485 

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

487 
rep and abs functions, similar to typedef. 

488 

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

490 
Transfer packages, as with 'setup_lifting'. 

491 

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

493 
respectfulness property at the point where the constant is 

494 
defined, similar to lift_definition; INCOMPATIBILITY. 

495 

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

497 
accordingly, INCOMPATIBILITY. 

498 

499 
* New diagnostic command 'find_unused_assms' to find potentially 

500 
superfluous assumptions in theorems using Quickcheck. 

501 

502 
* Quickcheck: 

503 

504 
 Quickcheck returns variable assignments as counterexamples, which 

505 
allows to reveal the underspecification of functions under test. 

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

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

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

509 

510 
These counterexample are marked as potentially spurious, as 

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

512 
obvious theorem "hd xs = hd xs". 

513 

514 
After finding a potentially spurious counterexample, Quickcheck 

515 
continues searching for genuine ones. 

516 

517 
By default, Quickcheck shows potentially spurious and genuine 

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

519 
show genuine counterexamples. 

520 

521 
 The command 'quickcheck_generator' creates random and exhaustive 

522 
value generators for a given type and operations. 

523 

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

525 
constructors of that type. 

526 

527 
 Support for multisets. 

528 

529 
 Added "use_subtype" options. 

530 

531 
 Added "quickcheck_locale" configuration to specify how to process 

532 
conjectures in a locale context. 

533 

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

47809  536 

537 
* Sledgehammer: 

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

539 
paper "More SPASS with Isabelle". 

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

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

542 
TFF1), iProver, iProverEq. 

543 
 Sped up the minimizer. 

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

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

546 
 Renamed "sound" option to "strict". 

547 

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

550 

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

552 

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

47809  554 

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

557 

558 
list.exhaust [case_product nat.exhaust] 

559 

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

561 
a list and a nat. 

562 

47809  563 
* New "eventually_elim" method as a generalized variant of the 
47855  564 
eventually_elim* rules. Supports structured proofs. 
565 

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

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

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

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

569 

47856  570 
* Record: code generation can be switched off manually with 
571 

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

573 

574 
* Datatype: type parameters allow explicit sort constraints. 

575 

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

578 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

580 
one_case. 

581 

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

583 
the result of the fact expression. 

584 

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

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

588 

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

589 
converse_def ~> converse_unfold 
47549  590 
rel_comp_def ~> relcomp_unfold 
47820  591 
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

592 
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

593 
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

594 
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

595 

46981  596 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
597 

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

47086  600 

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

601 
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

602 

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

46458  606 
rel_pow_1 ~> relpow_1 
46363  607 
rel_pow_0_I ~> relpow_0_I 
608 
rel_pow_Suc_I ~> relpow_Suc_I 

609 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

610 
rel_pow_0_E ~> relpow_0_E 

611 
rel_pow_Suc_E ~> relpow_Suc_E 

612 
rel_pow_E ~> relpow_E 

46458  613 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  614 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  615 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
616 
rel_pow_E2 ~> relpow_E2 

617 
rel_pow_add ~> relpow_add 

618 
rel_pow_commute ~> relpow 

619 
rel_pow_empty ~> relpow_empty: 

620 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

621 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

622 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

623 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

624 
rel_pow_fun_conv ~> relpow_fun_conv 

625 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

626 
rel_pow_finite_bounded ~> relpow_finite_bounded 

627 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

628 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

629 
single_valued_rel_pow ~> single_valued_relpow 

47463  630 

46363  631 
INCOMPATIBILITY. 
632 

47448  633 
* Theory Relation: Consolidated constant name for relation composition 
47464  634 
and corresponding theorem names: 
635 

47549  636 
 Renamed constant rel_comp to relcomp. 
47464  637 

47448  638 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  639 

47448  640 
 Renamed theorems: 
47464  641 

47448  642 
rel_compI ~> relcompI 
643 
rel_compEpair ~> relcompEpair 

644 
rel_compE ~> relcompE 

645 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

646 
rel_comp_empty1 ~> relcomp_empty1 

647 
rel_comp_mono ~> relcomp_mono 

648 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

649 
rel_comp_distrib ~> relcomp_distrib 

650 
rel_comp_distrib2 ~> relcomp_distrib2 

651 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

652 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

653 
single_valued_rel_comp ~> single_valued_relcomp 

47549  654 
rel_comp_def ~> relcomp_unfold 
47448  655 
converse_rel_comp ~> converse_relcomp 
656 
pred_compI ~> relcomppI 

657 
pred_compE ~> relcomppE 

658 
pred_comp_bot1 ~> relcompp_bot1 

659 
pred_comp_bot2 ~> relcompp_bot2 

660 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

661 
pred_comp_mono ~> relcompp_mono 

662 
pred_comp_distrib ~> relcompp_distrib 

663 
pred_comp_distrib2 ~> relcompp_distrib2 

664 
converse_pred_comp ~> converse_relcompp 

47464  665 

47448  666 
finite_rel_comp ~> finite_relcomp 
47464  667 

47448  668 
set_rel_comp ~> set_relcomp 
669 

670 
INCOMPATIBILITY. 

671 

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

674 

675 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

676 
zdiv_self ~> div_self 

677 
zmod_self ~> mod_self 

678 
zdiv_zero ~> div_0 

679 
zmod_zero ~> mod_0 

680 
zdiv_zmod_equality ~> div_mod_equality2 

681 
zdiv_zmod_equality2 ~> div_mod_equality 

682 
zmod_zdiv_trivial ~> mod_div_trivial 

683 
zdiv_zminus_zminus ~> div_minus_minus 

684 
zmod_zminus_zminus ~> mod_minus_minus 

685 
zdiv_zminus2 ~> div_minus_right 

686 
zmod_zminus2 ~> mod_minus_right 

687 
zdiv_minus1_right ~> div_minus1_right 

688 
zmod_minus1_right ~> mod_minus1_right 

689 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

690 
zmod_zmult1_eq ~> mod_mult_right_eq 

691 
zpower_zmod ~> power_mod 

692 
zdvd_zmod ~> dvd_mod 

693 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

694 
mod_mult_distrib ~> mult_mod_left 

695 
mod_mult_distrib2 ~> mult_mod_right 

696 

697 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

698 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

699 

47551  700 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
701 

47552  702 
* Consolidated theorem names concerning fold combinators: 
47550  703 

704 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

705 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

706 
INFI_fold_inf ~> INF_fold_inf 

707 
SUPR_fold_sup ~> SUP_fold_sup 

708 
union_set ~> union_set_fold 

709 
minus_set ~> minus_set_fold 

710 
INFI_set_fold ~> INF_set_fold 

711 
SUPR_set_fold ~> SUP_set_fold 

712 
INF_code ~> INF_set_foldr 

713 
SUP_code ~> SUP_set_foldr 

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

715 
foldr_fold_rev ~> foldr_conv_fold 

716 
foldl_fold ~> foldl_conv_fold 

717 
foldr_foldr ~> foldr_conv_foldl 

718 
foldl_foldr ~> foldl_conv_foldr 

47552  719 
fold_set_remdups ~> fold_set_fold_remdups 
720 
fold_set ~> fold_set_fold 

721 
fold1_set ~> fold1_set_fold 

47550  722 

723 
INCOMPATIBILITY. 

724 

725 
* Dropped rarely useful theorems concerning fold combinators: 

726 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

727 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

728 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

729 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

730 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

731 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

735 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

736 

737 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

738 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

739 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

740 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

742 
fold_conv_foldr and fold_rev. 

743 

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

745 
through option types. 

746 

47856  747 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
748 
relations. 

749 

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

751 

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

753 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

754 

755 
zminus_zminus ~> minus_minus 

756 
zminus_0 ~> minus_zero 

757 
zminus_zadd_distrib ~> minus_add_distrib 

758 
zadd_commute ~> add_commute 

759 
zadd_assoc ~> add_assoc 

760 
zadd_left_commute ~> add_left_commute 

761 
zadd_ac ~> add_ac 

762 
zmult_ac ~> mult_ac 

763 
zadd_0 ~> add_0_left 

764 
zadd_0_right ~> add_0_right 

765 
zadd_zminus_inverse2 ~> left_minus 

766 
zmult_zminus ~> mult_minus_left 

767 
zmult_commute ~> mult_commute 

768 
zmult_assoc ~> mult_assoc 

769 
zadd_zmult_distrib ~> left_distrib 

770 
zadd_zmult_distrib2 ~> right_distrib 

771 
zdiff_zmult_distrib ~> left_diff_distrib 

772 
zdiff_zmult_distrib2 ~> right_diff_distrib 

773 
zmult_1 ~> mult_1_left 

774 
zmult_1_right ~> mult_1_right 

775 
zle_refl ~> order_refl 

776 
zle_trans ~> order_trans 

777 
zle_antisym ~> order_antisym 

778 
zle_linear ~> linorder_linear 

779 
zless_linear ~> linorder_less_linear 

780 
zadd_left_mono ~> add_left_mono 

781 
zadd_strict_right_mono ~> add_strict_right_mono 

782 
zadd_zless_mono ~> add_less_le_mono 

783 
int_0_less_1 ~> zero_less_one 

784 
int_0_neq_1 ~> zero_neq_one 

785 
zless_le ~> less_le 

786 
zpower_zadd_distrib ~> power_add 

787 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

788 
zero_le_zpower_abs ~> zero_le_power_abs 

789 

790 
* Theory Deriv: Renamed 

791 

792 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

793 

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

795 

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

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

800 
INCOMPATIBILITY. 

801 

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

804 

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

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

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

809 
follows: 

47452  810 

811 
Operations: 

812 
bulkload > rbt_bulkload 

813 
del_from_left > rbt_del_from_left 

814 
del_from_right > rbt_del_from_right 

815 
del > rbt_del 

816 
delete > rbt_delete 

817 
ins > rbt_ins 

818 
insert > rbt_insert 

819 
insertw > rbt_insert_with 

820 
insert_with_key > rbt_insert_with_key 

821 
map_entry > rbt_map_entry 

822 
lookup > rbt_lookup 

823 
sorted > rbt_sorted 

824 
tree_greater > rbt_greater 

825 
tree_less > rbt_less 

826 
tree_less_symbol > rbt_less_symbol 

827 
union > rbt_union 

828 
union_with > rbt_union_with 

829 
union_with_key > rbt_union_with_key 

830 

831 
Lemmas: 

832 
balance_left_sorted > balance_left_rbt_sorted 

833 
balance_left_tree_greater > balance_left_rbt_greater 

834 
balance_left_tree_less > balance_left_rbt_less 

835 
balance_right_sorted > balance_right_rbt_sorted 

836 
balance_right_tree_greater > balance_right_rbt_greater 

837 
balance_right_tree_less > balance_right_rbt_less 

838 
balance_sorted > balance_rbt_sorted 

839 
balance_tree_greater > balance_rbt_greater 

840 
balance_tree_less > balance_rbt_less 

841 
bulkload_is_rbt > rbt_bulkload_is_rbt 

842 
combine_sorted > combine_rbt_sorted 

843 
combine_tree_greater > combine_rbt_greater 

844 
combine_tree_less > combine_rbt_less 

845 
delete_in_tree > rbt_delete_in_tree 

846 
delete_is_rbt > rbt_delete_is_rbt 

847 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

848 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

849 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

850 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

851 
del_in_tree > rbt_del_in_tree 

852 
del_inv1_inv2 > rbt_del_inv1_inv2 

853 
del_sorted > rbt_del_rbt_sorted 

854 
del_tree_greater > rbt_del_rbt_greater 

855 
del_tree_less > rbt_del_rbt_less 

856 
dom_lookup_Branch > dom_rbt_lookup_Branch 

857 
entries_lookup > entries_rbt_lookup 

858 
finite_dom_lookup > finite_dom_rbt_lookup 

859 
insert_sorted > rbt_insert_rbt_sorted 

860 
insertw_is_rbt > rbt_insertw_is_rbt 

861 
insertwk_is_rbt > rbt_insertwk_is_rbt 

862 
insertwk_sorted > rbt_insertwk_rbt_sorted 

863 
insertw_sorted > rbt_insertw_rbt_sorted 

864 
ins_sorted > ins_rbt_sorted 

865 
ins_tree_greater > ins_rbt_greater 

866 
ins_tree_less > ins_rbt_less 

867 
is_rbt_sorted > is_rbt_rbt_sorted 

868 
lookup_balance > rbt_lookup_balance 

869 
lookup_bulkload > rbt_lookup_rbt_bulkload 

870 
lookup_delete > rbt_lookup_rbt_delete 

871 
lookup_Empty > rbt_lookup_Empty 

872 
lookup_from_in_tree > rbt_lookup_from_in_tree 

873 
lookup_in_tree > rbt_lookup_in_tree 

874 
lookup_ins > rbt_lookup_ins 

875 
lookup_insert > rbt_lookup_rbt_insert 

876 
lookup_insertw > rbt_lookup_rbt_insertw 

877 
lookup_insertwk > rbt_lookup_rbt_insertwk 

878 
lookup_keys > rbt_lookup_keys 

879 
lookup_map > rbt_lookup_map 

880 
lookup_map_entry > rbt_lookup_rbt_map_entry 

881 
lookup_tree_greater > rbt_lookup_rbt_greater 

882 
lookup_tree_less > rbt_lookup_rbt_less 

883 
lookup_union > rbt_lookup_rbt_union 

884 
map_entry_color_of > rbt_map_entry_color_of 

885 
map_entry_inv1 > rbt_map_entry_inv1 

886 
map_entry_inv2 > rbt_map_entry_inv2 

887 
map_entry_is_rbt > rbt_map_entry_is_rbt 

888 
map_entry_sorted > rbt_map_entry_rbt_sorted 

889 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

890 
map_entry_tree_less > rbt_map_entry_rbt_less 

891 
map_tree_greater > map_rbt_greater 

892 
map_tree_less > map_rbt_less 

893 
map_sorted > map_rbt_sorted 

894 
paint_sorted > paint_rbt_sorted 

895 
paint_lookup > paint_rbt_lookup 

896 
paint_tree_greater > paint_rbt_greater 

897 
paint_tree_less > paint_rbt_less 

898 
sorted_entries > rbt_sorted_entries 

899 
tree_greater_eq_trans > rbt_greater_eq_trans 

900 
tree_greater_nit > rbt_greater_nit 

901 
tree_greater_prop > rbt_greater_prop 

902 
tree_greater_simps > rbt_greater_simps 

903 
tree_greater_trans > rbt_greater_trans 

904 
tree_less_eq_trans > rbt_less_eq_trans 

905 
tree_less_nit > rbt_less_nit 

906 
tree_less_prop > rbt_less_prop 

907 
tree_less_simps > rbt_less_simps 

908 
tree_less_trans > rbt_less_trans 

909 
tree_ord_props > rbt_ord_props 

910 
union_Branch > rbt_union_Branch 

911 
union_is_rbt > rbt_union_is_rbt 

912 
unionw_is_rbt > rbt_unionw_is_rbt 

913 
unionwk_is_rbt > rbt_unionwk_is_rbt 

914 
unionwk_sorted > rbt_unionwk_rbt_sorted 

915 

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

918 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  919 

920 
Changed Operations: 

47622  921 
float_abs > abs 
922 
float_nprt > nprt 

923 
float_pprt > pprt 

924 
pow2 > use powr 

925 
round_down > float_round_down 

926 
round_up > float_round_up 

927 
scale > exponent 

928 

929 
Removed Operations: 

930 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

931 

932 
Renamed Lemmas: 

933 
abs_float_def > Float.compute_float_abs 

934 
bitlen_ge0 > bitlen_nonneg 

935 
bitlen.simps > Float.compute_bitlen 

936 
float_components > Float_mantissa_exponent 

937 
float_divl.simps > Float.compute_float_divl 

938 
float_divr.simps > Float.compute_float_divr 

939 
float_eq_odd > mult_powr_eq_mult_powr_iff 

940 
float_power > real_of_float_power 

941 
lapprox_posrat_def > Float.compute_lapprox_posrat 

942 
lapprox_rat.simps > Float.compute_lapprox_rat 

943 
le_float_def' > Float.compute_float_le 

944 
le_float_def > less_eq_float.rep_eq 

945 
less_float_def' > Float.compute_float_less 

946 
less_float_def > less_float.rep_eq 

947 
normfloat_def > Float.compute_normfloat 

948 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

949 
normfloat > normfloat_def 

950 
normfloat_unique > use normfloat_def 

951 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

952 
one_float_def > Float.compute_float_one 

953 
plus_float_def > Float.compute_float_plus 

954 
rapprox_posrat_def > Float.compute_rapprox_posrat 

955 
rapprox_rat.simps > Float.compute_rapprox_rat 

956 
real_of_float_0 > zero_float.rep_eq 

957 
real_of_float_1 > one_float.rep_eq 

958 
real_of_float_abs > abs_float.rep_eq 

959 
real_of_float_add > plus_float.rep_eq 

960 
real_of_float_minus > uminus_float.rep_eq 

961 
real_of_float_mult > times_float.rep_eq 

962 
real_of_float_simp > Float.rep_eq 

963 
real_of_float_sub > minus_float.rep_eq 

964 
round_down.simps > Float.compute_float_round_down 

965 
round_up.simps > Float.compute_float_round_up 

966 
times_float_def > Float.compute_float_times 

967 
uminus_float_def > Float.compute_float_uminus 

968 
zero_float_def > Float.compute_float_zero 

969 

970 
Lemmas not necessary anymore, use the transfer method: 

971 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

972 
float_divr, float_le_simp, float_less1_mantissa_bound, 

973 
float_less_simp, float_less_zero, float_le_zero, 

974 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

975 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

976 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

977 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

978 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

979 
round_up, zero_le_float, zero_less_float 

47616  980 

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

45791  983 

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

986 

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

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

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

991 

992 
* Session HOLWord: Discontinued many redundant theorems specific to 

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

994 
instead. 

995 

996 
word_sub_alt ~> word_sub_wi 

997 
word_add_alt ~> word_add_def 

998 
word_mult_alt ~> word_mult_def 

999 
word_minus_alt ~> word_minus_def 

1000 
word_0_alt ~> word_0_wi 

1001 
word_1_alt ~> word_1_wi 

1002 
word_add_0 ~> add_0_left 

1003 
word_add_0_right ~> add_0_right 

1004 
word_mult_1 ~> mult_1_left 

1005 
word_mult_1_right ~> mult_1_right 

1006 
word_add_commute ~> add_commute 

1007 
word_add_assoc ~> add_assoc 

1008 
word_add_left_commute ~> add_left_commute 

1009 
word_mult_commute ~> mult_commute 

1010 
word_mult_assoc ~> mult_assoc 

1011 
word_mult_left_commute ~> mult_left_commute 

1012 
word_left_distrib ~> left_distrib 

1013 
word_right_distrib ~> right_distrib 

1014 
word_left_minus ~> left_minus 

1015 
word_diff_0_right ~> diff_0_right 

1016 
word_diff_self ~> diff_self 

1017 
word_sub_def ~> diff_minus 

1018 
word_diff_minus ~> diff_minus 

1019 
word_add_ac ~> add_ac 

1020 
word_mult_ac ~> mult_ac 

1021 
word_plus_ac0 ~> add_0_left add_0_right add_ac 

1022 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 

1023 
word_order_trans ~> order_trans 

1024 
word_order_refl ~> order_refl 

1025 
word_order_antisym ~> order_antisym 

1026 
word_order_linear ~> linorder_linear 

1027 
lenw1_zero_neq_one ~> zero_neq_one 

1028 
word_number_of_eq ~> number_of_eq 

1029 
word_of_int_add_hom ~> wi_hom_add 

1030 
word_of_int_sub_hom ~> wi_hom_sub 

1031 
word_of_int_mult_hom ~> wi_hom_mult 

1032 
word_of_int_minus_hom ~> wi_hom_neg 

1033 
word_of_int_succ_hom ~> wi_hom_succ 

1034 
word_of_int_pred_hom ~> wi_hom_pred 

1035 
word_of_int_0_hom ~> word_0_wi 

1036 
word_of_int_1_hom ~> word_1_wi 

1037 

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

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

1041 
multiplication, shifting by constants, bitwise operators and numeric 

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

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

1046 

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

1049 
measure_space. The locales based on subset_class now have two 

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

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

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

1055 
Measure space constructions for distributions and densities now got 

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

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

1058 
and point_measure is introduced. INCOMPATIBILITY. 

47694  1059 

1060 
Renamed constants: 

1061 
measure > emeasure 

1062 
finite_measure.\<mu>' > measure 

1063 
product_algebra_generator > prod_algebra 

1064 
product_prob_space.emb > prod_emb 

1065 
product_prob_space.infprod_algebra > PiM 

1066 

1067 
Removed locales: 

1068 
completeable_measure_space 

1069 
finite_measure_space 

1070 
finite_prob_space 

1071 
finite_product_finite_prob_space 

1072 
finite_product_sigma_algebra 

1073 
finite_sigma_algebra 

1074 
measure_space 

1075 
pair_finite_prob_space 

1076 
pair_finite_sigma_algebra 

1077 
pair_finite_space 

1078 
pair_sigma_algebra 

1079 
product_sigma_algebra 

1080 

1081 
Removed constants: 

47751  1082 
conditional_space 
47694  1083 
distribution > use distr measure, or distributed predicate 
47751  1084 
image_space 
47694  1085 
joint_distribution > use distr measure, or distributed predicate 
47751  1086 
pair_measure_generator 
47694  1087 
product_prob_space.infprod_algebra > use PiM 
1088 
subvimage 

1089 

1090 
Replacement theorems: 

47751  1091 
finite_additivity_sufficient > ring_of_sets.countably_additiveI_finite 
1092 
finite_measure.empty_measure > measure_empty 

1093 
finite_measure.finite_continuity_from_above > finite_measure.finite_Lim_measure_decseq 

1094 
finite_measure.finite_continuity_from_below > finite_measure.finite_Lim_measure_incseq 

1095 
finite_measure.finite_measure_countably_subadditive > finite_measure.finite_measure_subadditive_countably 

1096 
finite_measure.finite_measure_eq > finite_measure.emeasure_eq_measure 

1097 
finite_measure.finite_measure > finite_measure.emeasure_finite 

1098 
finite_measure.finite_measure_finite_singleton > finite_measure.finite_measure_eq_setsum_singleton 

1099 
finite_measure.positive_measure' > measure_nonneg 

1100 
finite_measure.real_measure > finite_measure.emeasure_real 

1101 
finite_product_prob_space.finite_measure_times > finite_product_prob_space.finite_measure_PiM_emb 

1102 
finite_product_sigma_algebra.in_P > sets_PiM_I_finite 

1103 
finite_product_sigma_algebra.P_empty > space_PiM_empty, sets_PiM_empty 

1104 
information_space.conditional_entropy_eq > information_space.conditional_entropy_simple_distributed 

1105 
information_space.conditional_entropy_positive > information_space.conditional_entropy_nonneg_simple 

1106 
information_space.conditional_mutual_information_eq_mutual_information > information_space.conditional_mutual_information_eq_mutual_information_simple 

1107 
information_space.conditional_mutual_information_generic_positive > information_space.conditional_mutual_information_nonneg_simple 

1108 
information_space.conditional_mutual_information_positive > information_space.conditional_mutual_information_nonneg_simple 

1109 
information_space.entropy_commute > information_space.entropy_commute_simple 

1110 
information_space.entropy_eq > information_space.entropy_simple_distributed 

1111 
information_space.entropy_generic_eq > information_space.entropy_simple_distributed 

1112 
information_space.entropy_positive > information_space.entropy_nonneg_simple 

1113 
information_space.entropy_uniform_max > information_space.entropy_uniform 

1114 
information_space.KL_eq_0_imp > information_space.KL_eq_0_iff_eq 

1115 
information_space.KL_eq_0 > information_space.KL_same_eq_0 

1116 
information_space.KL_ge_0 > information_space.KL_nonneg 

1117 
information_space.mutual_information_eq > information_space.mutual_information_simple_distributed 

1118 
information_space.mutual_information_positive > information_space.mutual_information_nonneg_simple 

1119 
Int_stable_cuboids > Int_stable_atLeastAtMost 

1120 
Int_stable_product_algebra_generator > positive_integral 

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

47694  1122 
measure_space.additive > emeasure_additive 
47751  1123 
measure_space.AE_iff_null_set > AE_iff_null 
1124 
measure_space.almost_everywhere_def > eventually_ae_filter 

1125 
measure_space.almost_everywhere_vimage > AE_distrD 

1126 
measure_space.continuity_from_above > INF_emeasure_decseq 

1127 
measure_space.continuity_from_above_Lim > Lim_emeasure_decseq 

1128 
measure_space.continuity_from_below_Lim > Lim_emeasure_incseq 

47694  1129 
measure_space.continuity_from_below > SUP_emeasure_incseq 
47751  1130 
measure_space_density > emeasure_density 
1131 
measure_space.density_is_absolutely_continuous > absolutely_continuousI_density 

1132 
measure_space.integrable_vimage > integrable_distr 

1133 
measure_space.integral_translated_density > integral_density 

1134 
measure_space.integral_vimage > integral_distr 

1135 
measure_space.measure_additive > plus_emeasure 

1136 
measure_space.measure_compl > emeasure_compl 

1137 
measure_space.measure_countable_increasing > emeasure_countable_increasing 

1138 
measure_space.measure_countably_subadditive > emeasure_subadditive_countably 

47694  1139 
measure_space.measure_decseq > decseq_emeasure 
47751  1140 
measure_space.measure_Diff > emeasure_Diff 
1141 
measure_space.measure_Diff_null_set > emeasure_Diff_null_set 

47694  1142 
measure_space.measure_eq_0 > emeasure_eq_0 
1143 
measure_space.measure_finitely_subadditive > emeasure_subadditive_finite 

47751  1144 
measure_space.measure_finite_singleton > emeasure_eq_setsum_singleton 
1145 
measure_space.measure_incseq > incseq_emeasure 

1146 
measure_space.measure_insert > emeasure_insert 

1147 
measure_space.measure_mono > emeasure_mono 

1148 
measure_space.measure_not_negative > emeasure_not_MInf 

1149 
measure_space.measure_preserving_Int_stable > measure_eqI_generator_eq 

1150 
measure_space.measure_setsum > setsum_emeasure 

1151 
measure_space.measure_setsum_split > setsum_emeasure_cover 

47694  1152 
measure_space.measure_space_vimage > emeasure_distr 
47751  1153 
measure_space.measure_subadditive_finite > emeasure_subadditive_finite 
1154 
measure_space.measure_subadditive > subadditive 

1155 
measure_space.measure_top > emeasure_space 

1156 
measure_space.measure_UN_eq_0 > emeasure_UN_eq_0 

1157 
measure_space.measure_Un_null_set > emeasure_Un_null_set 

1158 
measure_space.positive_integral_translated_density > positive_integral_density 

1159 
measure_space.positive_integral_vimage > positive_integral_distr 

47694  1160 
measure_space.real_continuity_from_above > Lim_measure_decseq 
47751  1161 
measure_space.real_continuity_from_below > Lim_measure_incseq 
47694  1162 
measure_space.real_measure_countably_subadditive > measure_subadditive_countably 
47751  1163 
measure_space.real_measure_Diff > measure_Diff 
1164 
measure_space.real_measure_finite_Union > measure_finite_Union 

1165 
measure_space.real_measure_setsum_singleton > measure_eq_setsum_singleton 

1166 
measure_space.real_measure_subadditive > measure_subadditive 

1167 
measure_space.real_measure_Union > measure_Union 

1168 
measure_space.real_measure_UNION > measure_UNION 

47694  1169 
measure_space.simple_function_vimage > simple_function_comp 
1170 
measure_space.simple_integral_vimage > simple_integral_distr 

47751  1171 
measure_space.simple_integral_vimage > simple_integral_distr 
1172 
measure_unique_Int_stable > measure_eqI_generator_eq 

1173 
measure_unique_Int_stable_vimage > measure_eqI_generator_eq 

47694  1174 
pair_sigma_algebra.measurable_cut_fst > sets_Pair1 
1175 
pair_sigma_algebra.measurable_cut_snd > sets_Pair2 

1176 
pair_sigma_algebra.measurable_pair_image_fst > measurable_Pair1 

1177 
pair_sigma_algebra.measurable_pair_image_snd > measurable_Pair2 

1178 
pair_sigma_algebra.measurable_product_swap > measurable_pair_swap_iff 

1179 
pair_sigma_algebra.pair_sigma_algebra_measurable > measurable_pair_swap 

1180 
pair_sigma_algebra.pair_sigma_algebra_swap_measurable > measurable_pair_swap' 

1181 
pair_sigma_algebra.sets_swap > sets_pair_swap 

47751  1182 
pair_sigma_finite.measure_cut_measurable_fst > pair_sigma_finite.measurable_emeasure_Pair1 
1183 
pair_sigma_finite.measure_cut_measurable_snd > pair_sigma_finite.measurable_emeasure_Pair2 

1184 
pair_sigma_finite.measure_preserving_swap > pair_sigma_finite.distr_pair_swap 

1185 
pair_sigma_finite.pair_measure_alt2 > pair_sigma_finite.emeasure_pair_measure_alt2 

1186 
pair_sigma_finite.pair_measure_alt > pair_sigma_finite.emeasure_pair_measure_alt 

1187 
pair_sigma_finite.pair_measure_times > pair_sigma_finite.emeasure_pair_measure_Times 

1188 
prob_space.indep_distribution_eq_measure > prob_space.indep_vars_iff_distr_eq_PiM 

1189 
prob_space.indep_var_distributionD > prob_space.indep_var_distribution_eq 

47694  1190 
prob_space.measure_space_1 > prob_space.emeasure_space_1 
1191 
prob_space.prob_space_vimage > prob_space_distr 

1192 
prob_space.random_variable_restrict > measurable_restrict 

47751  1193 
prob_space_unique_Int_stable > measure_eqI_prob_space 
1194 
product_algebraE > prod_algebraE_all 

1195 
product_algebra_generator_der > prod_algebra_eq_finite 

1196 
product_algebra_generator_into_space > prod_algebra_sets_into_space 

1197 
product_algebraI > sets_PiM_I_finite 

1198 
product_measure_exists > product_sigma_finite.sigma_finite 

47694  1199 
product_prob_space.finite_index_eq_finite_product > product_prob_space.sets_PiM_generator 
1200 
product_prob_space.finite_measure_infprod_emb_Pi > product_prob_space.measure_PiM_emb 

1201 
product_prob_space.infprod_spec > product_prob_space.emeasure_PiM_emb_not_empty 

1202 
product_prob_space.measurable_component > measurable_component_singleton 

1203 
product_prob_space.measurable_emb > measurable_prod_emb 

1204 
product_prob_space.measurable_into_infprod_algebra > measurable_PiM_single 

1205 
product_prob_space.measurable_singleton_infprod > measurable_component_singleton 

1206 
product_prob_space.measure_emb > emeasure_prod_emb 

47751  1207 
product_prob_space.measure_preserving_restrict > product_prob_space.distr_restrict 
1208 
product_sigma_algebra.product_algebra_into_space > space_closed 

1209 
product_sigma_finite.measure_fold > product_sigma_finite.distr_merge 

1210 
product_sigma_finite.measure_preserving_component_singelton > product_sigma_finite.distr_singleton 

1211 
product_sigma_finite.measure_preserving_merge > product_sigma_finite.distr_merge 

47694  1212 
sequence_space.measure_infprod > sequence_space.measure_PiM_countable 
47751  1213 
sets_product_algebra > sets_PiM 
1214 
sigma_algebra.measurable_sigma > measurable_measure_of 

1215 
sigma_finite_measure.disjoint_sigma_finite > sigma_finite_disjoint 

1216 
sigma_finite_measure.RN_deriv_vimage > sigma_finite_measure.RN_deriv_distr 

1217 
sigma_product_algebra_sigma_eq > sigma_prod_algebra_sigma_eq 

1218 
space_product_algebra > space_PiM 

47694  1219 

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

47413  1222 

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

1223 

45160  1224 
*** FOL *** 
1225 

45383  1226 
* New "case_product" attribute (see HOL). 
45160  1227 

45109  1228 

47463  1229 
*** ZF *** 
1230 

1231 
* Greater support for structured proofs involving induction or case 

1232 
analysis. 

1233 

1234 
* Much greater use of mathematical symbols. 

1235 

1236 
* Removal of many ML theorem bindings. INCOMPATIBILITY. 

1237 

1238 

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

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

1240 

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

1243 

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

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

1245 
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

1246 
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

1247 

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

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

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

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

1251 
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

1252 
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

1253 
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

1254 
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

1255 
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

1256 

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

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

1258 
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

1259 

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

1262 
declarations like Local_Theory.note. 

1263 

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

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

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

1266 

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

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

1268 
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

1269 
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

1270 

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

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

1272 

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

1273 
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

1274 
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

1275 
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

1276 
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

1277 
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

1278 
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

1279 
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

1280 
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

1281 
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

1282 
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

1283 
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

1284 
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

1285 

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

1286 

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

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

1288 

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

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

1290 
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

1291 
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

1292 
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

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

1294 
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

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

1296 

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

1299 

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

1302 

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

1303 

45109  1304 

44801  1305 
New in Isabelle20111 (October 2011) 
1306 
 

41651  1307 

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

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

1309 

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

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

1316 

44777  1317 
 Markup of formal entities within the text buffer, with semantic 
44760  1318 
highlighting, tooltips and hyperlinks to jump to defining source 
1319 
positions. 

1320 

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

1323 
theory output and other nonIsabelle text boxes). 

1324 

1325 
 Refined scheduling of proof checking and printing of results, 

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

1328 

44777  1329 
 Reduced CPU performance requirements, usable on machines with few 
44760  1330 
cores. 
1331 

44777  1332 
 Reduced memory requirements due to pruning of unused document 
44760  1333 
versions (garbage collection). 
1334 

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

1336 
including some remaining limitations. 

1337 

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

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

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

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

1343 
INCOMPATIBILITY. 

1344 

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

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

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

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

1348 

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

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

1350 
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

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

1352 

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

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

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

1355 

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

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

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

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

1359 

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

1360 
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

1361 

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

1362 
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

1363 

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

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

1367 

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

1370 

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

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

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

1375 
"Classical Reasoner". 

42633  1376 

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

1377 

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

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

1379 

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

1382 

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

1386 
Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in 

1387 
class complete_linorder. 

1388 

1389 
Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def, 

1390 
Sup_fun_def, Inf_apply, Sup_apply. 

1391 

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

1394 

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

1395 
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

1396 
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

1397 
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

1398 
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

1399 
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

1400 
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

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

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

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

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

1405 
INF_subset ~> INF_superset_mono [OF _ order_refl] 
44800  1406 

1407 
More consistent and comprehensive names: 

1408 

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

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

1410 
UNION_eq_Union_image ~> SUP_def 
43872  1411 
INFI_def ~> INF_def 
1412 
SUPR_def ~> SUP_def 

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

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

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

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

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

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

1418 
SUP_leI ~> SUP_least 
43873  1419 
INFI_bool_eq ~> INF_bool_eq 
1420 
SUPR_bool_eq ~> SUP_bool_eq 

< 