author  wenzelm 
Wed, 18 Jul 2012 20:01:55 +0200  
changeset 48341  752de4e10162 
parent 48317  e5420161d11d 
child 48371  3a5a5a992519 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

47887  4 
New in this Isabelle version 
5 
 

6 

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

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

8 

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

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

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

11 

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

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

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

14 

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

15 

48205  16 
*** Pure *** 
17 

18 
* Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY, 

19 
use regular rule composition via "OF" / "THEN", or explicit proof 

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

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

22 
with some care where this is really required. 

23 

24 

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

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

26 

48206  27 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
28 
expressions. 

48111  29 

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

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

31 

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

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

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

34 
the configuration quickcheck_optimise_equality to false. 
47887  35 

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

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

37 
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

38 
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

39 
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

40 
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

41 

48094  42 
* Sledgehammer: 
43 

44 
 Rationalized type encodings ("type_enc" option). 

48294  45 
 Renamed options: 
46 
max_relevant ~> max_facts 

47 
relevance_thresholds ~> fact_thresholds 

48094  48 

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

49 

48206  50 
*** Document preparation *** 
51 

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

53 
slightly exotic babel/greek. 

54 

55 

56 
*** System *** 

57 

58 
* Discontinued support for Poly/ML 5.2.1, which was the last version 

59 
without exception positions and advanced ML compiler/toplevel 

60 
configuration. 

61 

62 

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

63 

47462  64 
New in Isabelle2012 (May 2012) 
65 
 

45109  66 

45593  67 
*** General *** 
68 

45614  69 
* Prover IDE (PIDE) improvements: 
70 

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

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

45614  78 

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

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

46485  82 

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

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

84 
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

85 
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

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

87 
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

88 

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

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

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

91 
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

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

93 

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

94 
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

95 

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

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

97 

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

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

99 

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

100 
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

101 
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

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

103 

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

104 
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

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

106 

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

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

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

47484  112 

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

115 
oldstyle "standard" after instantiation or composition of facts 

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

117 
indices of schematic variables. 

118 

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

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

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

122 
the historic accident of dynamic reevaluation in interpretations 

123 
etc. was exploited. 

124 

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

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

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

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

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

130 
of the material of that old tutorial. 

131 

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

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

134 
manual. 

135 

136 

137 
*** Pure *** 

138 

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

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

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

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

142 

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

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

146 
undocumented feature.) 

147 

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

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

151 

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

153 

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

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

156 

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

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

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

160 
order to accommodate newly introduced premises.) 

161 

47806  162 
* Renamed some inner syntax categories: 
163 

164 
num ~> num_token 

165 
xnum ~> xnum_token 

166 
xstr ~> str_token 

167 

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

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

170 
position information via constraints). 

171 

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

174 
manual. Minor INCOMPATIBILITY. 

175 

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

45134  178 

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

181 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  182 

47464  183 
* Redundant attribute "code_inline" has been discontinued. Use 
184 
"code_unfold" instead. INCOMPATIBILITY. 

185 

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

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

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

188 

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

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

190 

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

191 
INCOMPATIBILITY. 
45383  192 

47856  193 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
194 
instead. INCOMPATIBILITY. 

195 

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

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

198 
legacy since Isabelle2011). 

47855  199 

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

200 

45122  201 
*** HOL *** 
202 

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

205 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

210 
tinkering with former theorems mem_def and Collect_def as far as 

211 
possible. 

212 

213 
For developments which deliberately mix predicates and sets, a 

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

216 
Isabelle20111 before jumping right into the current release. 

217 

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

220 

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

222 

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

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

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

228 
user theories may require adaptations as follows: 

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

229 

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

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

231 
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

232 

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

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

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

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

236 

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

237 
 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

238 
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

239 

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

240 
 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

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

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

243 

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

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

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

246 

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

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

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

251 
corresponding parts of the Quotient package.) 

47809  252 

253 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

255 
relate different type instances of the same polymorphic constant, 

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

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

258 

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

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

261 

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

263 
equivalent subgoal on the corresponding raw types. Constants are 

264 
replaced with corresponding ones according to the transfer rules. 

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

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

270 

271 
 relator_eq attribute: Collects identity laws for relators of 

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

273 
transfer method uses these lemmas to infer transfer rules for 

274 
nonpolymorphic constants on the fly. 

275 

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

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

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

279 
after unfolding the constant definitions. 

280 

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

282 
from type nat to type int. 

283 

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

47809  286 

287 
 lift_definition command: Defines operations on an abstract type in 

288 
terms of a corresponding operation on a representation 

289 
type. Example syntax: 

290 

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

292 
is List.insert 

293 

294 
Users must discharge a respectfulness proof obligation when each 

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

296 
the proof is discharged automatically.) The obligation is 

297 
presented in a userfriendly, readable form; a respectfulness 

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

299 
by the package. 

300 

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

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

303 
lift_definition generates a code certificate theorem and sets up 

304 
code generation for each constant. 

305 

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

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

308 
or a type_definition theorem. The package configures transfer 

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

310 
lift_definition command to work with the type. 

311 

312 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  313 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
314 
Word/Word.thy and Library/Float.thy. 

47809  315 

316 
* Quotient package: 

317 

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

319 
rep and abs functions, similar to typedef. 

320 

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

322 
Transfer packages, as with 'setup_lifting'. 

323 

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

325 
respectfulness property at the point where the constant is 

326 
defined, similar to lift_definition; INCOMPATIBILITY. 

327 

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

329 
accordingly, INCOMPATIBILITY. 

330 

331 
* New diagnostic command 'find_unused_assms' to find potentially 

332 
superfluous assumptions in theorems using Quickcheck. 

333 

334 
* Quickcheck: 

335 

336 
 Quickcheck returns variable assignments as counterexamples, which 

337 
allows to reveal the underspecification of functions under test. 

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

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

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

341 

342 
These counterexample are marked as potentially spurious, as 

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

344 
obvious theorem "hd xs = hd xs". 

345 

346 
After finding a potentially spurious counterexample, Quickcheck 

347 
continues searching for genuine ones. 

348 

349 
By default, Quickcheck shows potentially spurious and genuine 

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

351 
show genuine counterexamples. 

352 

353 
 The command 'quickcheck_generator' creates random and exhaustive 

354 
value generators for a given type and operations. 

355 

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

357 
constructors of that type. 

358 

359 
 Support for multisets. 

360 

361 
 Added "use_subtype" options. 

362 

363 
 Added "quickcheck_locale" configuration to specify how to process 

364 
conjectures in a locale context. 

365 

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

47809  368 

369 
* Sledgehammer: 

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

371 
paper "More SPASS with Isabelle". 

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

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

374 
TFF1), iProver, iProverEq. 

375 
 Sped up the minimizer. 

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

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

378 
 Renamed "sound" option to "strict". 

379 

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

382 

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

384 

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

47809  386 

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

389 

390 
list.exhaust [case_product nat.exhaust] 

391 

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

393 
a list and a nat. 

394 

47809  395 
* New "eventually_elim" method as a generalized variant of the 
47855  396 
eventually_elim* rules. Supports structured proofs. 
397 

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

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

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

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

401 

47856  402 
* Record: code generation can be switched off manually with 
403 

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

405 

406 
* Datatype: type parameters allow explicit sort constraints. 

407 

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

410 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

412 
one_case. 

413 

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

415 
the result of the fact expression. 

416 

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

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

420 

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

421 
converse_def ~> converse_unfold 
47549  422 
rel_comp_def ~> relcomp_unfold 
47820  423 
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

424 
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

425 
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

426 
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

427 

46981  428 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
429 

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

47086  432 

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

433 
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

434 

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

46458  438 
rel_pow_1 ~> relpow_1 
46363  439 
rel_pow_0_I ~> relpow_0_I 
440 
rel_pow_Suc_I ~> relpow_Suc_I 

441 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

442 
rel_pow_0_E ~> relpow_0_E 

443 
rel_pow_Suc_E ~> relpow_Suc_E 

444 
rel_pow_E ~> relpow_E 

46458  445 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  446 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  447 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
448 
rel_pow_E2 ~> relpow_E2 

449 
rel_pow_add ~> relpow_add 

450 
rel_pow_commute ~> relpow 

451 
rel_pow_empty ~> relpow_empty: 

452 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

453 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

454 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

455 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

456 
rel_pow_fun_conv ~> relpow_fun_conv 

457 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

458 
rel_pow_finite_bounded ~> relpow_finite_bounded 

459 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

460 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

461 
single_valued_rel_pow ~> single_valued_relpow 

47463  462 

46363  463 
INCOMPATIBILITY. 
464 

47448  465 
* Theory Relation: Consolidated constant name for relation composition 
47464  466 
and corresponding theorem names: 
467 

47549  468 
 Renamed constant rel_comp to relcomp. 
47464  469 

47448  470 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  471 

47448  472 
 Renamed theorems: 
47464  473 

47448  474 
rel_compI ~> relcompI 
475 
rel_compEpair ~> relcompEpair 

476 
rel_compE ~> relcompE 

477 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

478 
rel_comp_empty1 ~> relcomp_empty1 

479 
rel_comp_mono ~> relcomp_mono 

480 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

481 
rel_comp_distrib ~> relcomp_distrib 

482 
rel_comp_distrib2 ~> relcomp_distrib2 

483 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

484 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

485 
single_valued_rel_comp ~> single_valued_relcomp 

47549  486 
rel_comp_def ~> relcomp_unfold 
47448  487 
converse_rel_comp ~> converse_relcomp 
488 
pred_compI ~> relcomppI 

489 
pred_compE ~> relcomppE 

490 
pred_comp_bot1 ~> relcompp_bot1 

491 
pred_comp_bot2 ~> relcompp_bot2 

492 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

493 
pred_comp_mono ~> relcompp_mono 

494 
pred_comp_distrib ~> relcompp_distrib 

495 
pred_comp_distrib2 ~> relcompp_distrib2 

496 
converse_pred_comp ~> converse_relcompp 

47464  497 

47448  498 
finite_rel_comp ~> finite_relcomp 
47464  499 

47448  500 
set_rel_comp ~> set_relcomp 
501 

502 
INCOMPATIBILITY. 

503 

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

506 

507 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

508 
zdiv_self ~> div_self 

509 
zmod_self ~> mod_self 

510 
zdiv_zero ~> div_0 

511 
zmod_zero ~> mod_0 

512 
zdiv_zmod_equality ~> div_mod_equality2 

513 
zdiv_zmod_equality2 ~> div_mod_equality 

514 
zmod_zdiv_trivial ~> mod_div_trivial 

515 
zdiv_zminus_zminus ~> div_minus_minus 

516 
zmod_zminus_zminus ~> mod_minus_minus 

517 
zdiv_zminus2 ~> div_minus_right 

518 
zmod_zminus2 ~> mod_minus_right 

519 
zdiv_minus1_right ~> div_minus1_right 

520 
zmod_minus1_right ~> mod_minus1_right 

521 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

522 
zmod_zmult1_eq ~> mod_mult_right_eq 

523 
zpower_zmod ~> power_mod 

524 
zdvd_zmod ~> dvd_mod 

525 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

526 
mod_mult_distrib ~> mult_mod_left 

527 
mod_mult_distrib2 ~> mult_mod_right 

528 

529 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

530 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

531 

47551  532 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
533 

47552  534 
* Consolidated theorem names concerning fold combinators: 
47550  535 

536 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

537 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

538 
INFI_fold_inf ~> INF_fold_inf 

539 
SUPR_fold_sup ~> SUP_fold_sup 

540 
union_set ~> union_set_fold 

541 
minus_set ~> minus_set_fold 

542 
INFI_set_fold ~> INF_set_fold 

543 
SUPR_set_fold ~> SUP_set_fold 

544 
INF_code ~> INF_set_foldr 

545 
SUP_code ~> SUP_set_foldr 

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

547 
foldr_fold_rev ~> foldr_conv_fold 

548 
foldl_fold ~> foldl_conv_fold 

549 
foldr_foldr ~> foldr_conv_foldl 

550 
foldl_foldr ~> foldl_conv_foldr 

47552  551 
fold_set_remdups ~> fold_set_fold_remdups 
552 
fold_set ~> fold_set_fold 

553 
fold1_set ~> fold1_set_fold 

47550  554 

555 
INCOMPATIBILITY. 

556 

557 
* Dropped rarely useful theorems concerning fold combinators: 

558 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

559 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

560 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

561 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

562 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

563 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

567 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

568 

569 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

570 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

571 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

572 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

574 
fold_conv_foldr and fold_rev. 

575 

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

577 
through option types. 

578 

47856  579 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
580 
relations. 

581 

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

583 

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

585 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

586 

587 
zminus_zminus ~> minus_minus 

588 
zminus_0 ~> minus_zero 

589 
zminus_zadd_distrib ~> minus_add_distrib 

590 
zadd_commute ~> add_commute 

591 
zadd_assoc ~> add_assoc 

592 
zadd_left_commute ~> add_left_commute 

593 
zadd_ac ~> add_ac 

594 
zmult_ac ~> mult_ac 

595 
zadd_0 ~> add_0_left 

596 
zadd_0_right ~> add_0_right 

597 
zadd_zminus_inverse2 ~> left_minus 

598 
zmult_zminus ~> mult_minus_left 

599 
zmult_commute ~> mult_commute 

600 
zmult_assoc ~> mult_assoc 

601 
zadd_zmult_distrib ~> left_distrib 

602 
zadd_zmult_distrib2 ~> right_distrib 

603 
zdiff_zmult_distrib ~> left_diff_distrib 

604 
zdiff_zmult_distrib2 ~> right_diff_distrib 

605 
zmult_1 ~> mult_1_left 

606 
zmult_1_right ~> mult_1_right 

607 
zle_refl ~> order_refl 

608 
zle_trans ~> order_trans 

609 
zle_antisym ~> order_antisym 

610 
zle_linear ~> linorder_linear 

611 
zless_linear ~> linorder_less_linear 

612 
zadd_left_mono ~> add_left_mono 

613 
zadd_strict_right_mono ~> add_strict_right_mono 

614 
zadd_zless_mono ~> add_less_le_mono 

615 
int_0_less_1 ~> zero_less_one 

616 
int_0_neq_1 ~> zero_neq_one 

617 
zless_le ~> less_le 

618 
zpower_zadd_distrib ~> power_add 

619 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

620 
zero_le_zpower_abs ~> zero_le_power_abs 

621 

622 
* Theory Deriv: Renamed 

623 

624 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

625 

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

627 

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

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

632 
INCOMPATIBILITY. 

633 

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

636 

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

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

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

641 
follows: 

47452  642 

643 
Operations: 

644 
bulkload > rbt_bulkload 

645 
del_from_left > rbt_del_from_left 

646 
del_from_right > rbt_del_from_right 

647 
del > rbt_del 

648 
delete > rbt_delete 

649 
ins > rbt_ins 

650 
insert > rbt_insert 

651 
insertw > rbt_insert_with 

652 
insert_with_key > rbt_insert_with_key 

653 
map_entry > rbt_map_entry 

654 
lookup > rbt_lookup 

655 
sorted > rbt_sorted 

656 
tree_greater > rbt_greater 

657 
tree_less > rbt_less 

658 
tree_less_symbol > rbt_less_symbol 

659 
union > rbt_union 

660 
union_with > rbt_union_with 

661 
union_with_key > rbt_union_with_key 

662 

663 
Lemmas: 

664 
balance_left_sorted > balance_left_rbt_sorted 

665 
balance_left_tree_greater > balance_left_rbt_greater 

666 
balance_left_tree_less > balance_left_rbt_less 

667 
balance_right_sorted > balance_right_rbt_sorted 

668 
balance_right_tree_greater > balance_right_rbt_greater 

669 
balance_right_tree_less > balance_right_rbt_less 

670 
balance_sorted > balance_rbt_sorted 

671 
balance_tree_greater > balance_rbt_greater 

672 
balance_tree_less > balance_rbt_less 

673 
bulkload_is_rbt > rbt_bulkload_is_rbt 

674 
combine_sorted > combine_rbt_sorted 

675 
combine_tree_greater > combine_rbt_greater 

676 
combine_tree_less > combine_rbt_less 

677 
delete_in_tree > rbt_delete_in_tree 

678 
delete_is_rbt > rbt_delete_is_rbt 

679 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

680 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

681 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

682 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

683 
del_in_tree > rbt_del_in_tree 

684 
del_inv1_inv2 > rbt_del_inv1_inv2 

685 
del_sorted > rbt_del_rbt_sorted 

686 
del_tree_greater > rbt_del_rbt_greater 

687 
del_tree_less > rbt_del_rbt_less 

688 
dom_lookup_Branch > dom_rbt_lookup_Branch 

689 
entries_lookup > entries_rbt_lookup 

690 
finite_dom_lookup > finite_dom_rbt_lookup 

691 
insert_sorted > rbt_insert_rbt_sorted 

692 
insertw_is_rbt > rbt_insertw_is_rbt 

693 
insertwk_is_rbt > rbt_insertwk_is_rbt 

694 
insertwk_sorted > rbt_insertwk_rbt_sorted 

695 
insertw_sorted > rbt_insertw_rbt_sorted 

696 
ins_sorted > ins_rbt_sorted 

697 
ins_tree_greater > ins_rbt_greater 

698 
ins_tree_less > ins_rbt_less 

699 
is_rbt_sorted > is_rbt_rbt_sorted 

700 
lookup_balance > rbt_lookup_balance 

701 
lookup_bulkload > rbt_lookup_rbt_bulkload 

702 
lookup_delete > rbt_lookup_rbt_delete 

703 
lookup_Empty > rbt_lookup_Empty 

704 
lookup_from_in_tree > rbt_lookup_from_in_tree 

705 
lookup_in_tree > rbt_lookup_in_tree 

706 
lookup_ins > rbt_lookup_ins 

707 
lookup_insert > rbt_lookup_rbt_insert 

708 
lookup_insertw > rbt_lookup_rbt_insertw 

709 
lookup_insertwk > rbt_lookup_rbt_insertwk 

710 
lookup_keys > rbt_lookup_keys 

711 
lookup_map > rbt_lookup_map 

712 
lookup_map_entry > rbt_lookup_rbt_map_entry 

713 
lookup_tree_greater > rbt_lookup_rbt_greater 

714 
lookup_tree_less > rbt_lookup_rbt_less 

715 
lookup_union > rbt_lookup_rbt_union 

716 
map_entry_color_of > rbt_map_entry_color_of 

717 
map_entry_inv1 > rbt_map_entry_inv1 

718 
map_entry_inv2 > rbt_map_entry_inv2 

719 
map_entry_is_rbt > rbt_map_entry_is_rbt 

720 
map_entry_sorted > rbt_map_entry_rbt_sorted 

721 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

722 
map_entry_tree_less > rbt_map_entry_rbt_less 

723 
map_tree_greater > map_rbt_greater 

724 
map_tree_less > map_rbt_less 

725 
map_sorted > map_rbt_sorted 

726 
paint_sorted > paint_rbt_sorted 

727 
paint_lookup > paint_rbt_lookup 

728 
paint_tree_greater > paint_rbt_greater 

729 
paint_tree_less > paint_rbt_less 

730 
sorted_entries > rbt_sorted_entries 

731 
tree_greater_eq_trans > rbt_greater_eq_trans 

732 
tree_greater_nit > rbt_greater_nit 

733 
tree_greater_prop > rbt_greater_prop 

734 
tree_greater_simps > rbt_greater_simps 

735 
tree_greater_trans > rbt_greater_trans 

736 
tree_less_eq_trans > rbt_less_eq_trans 

737 
tree_less_nit > rbt_less_nit 

738 
tree_less_prop > rbt_less_prop 

739 
tree_less_simps > rbt_less_simps 

740 
tree_less_trans > rbt_less_trans 

741 
tree_ord_props > rbt_ord_props 

742 
union_Branch > rbt_union_Branch 

743 
union_is_rbt > rbt_union_is_rbt 

744 
unionw_is_rbt > rbt_unionw_is_rbt 

745 
unionwk_is_rbt > rbt_unionwk_is_rbt 

746 
unionwk_sorted > rbt_unionwk_rbt_sorted 

747 

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

750 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  751 

752 
Changed Operations: 

47622  753 
float_abs > abs 
754 
float_nprt > nprt 

755 
float_pprt > pprt 

756 
pow2 > use powr 

757 
round_down > float_round_down 

758 
round_up > float_round_up 

759 
scale > exponent 

760 

761 
Removed Operations: 

762 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

763 

764 
Renamed Lemmas: 

765 
abs_float_def > Float.compute_float_abs 

766 
bitlen_ge0 > bitlen_nonneg 

767 
bitlen.simps > Float.compute_bitlen 

768 
float_components > Float_mantissa_exponent 

769 
float_divl.simps > Float.compute_float_divl 

770 
float_divr.simps > Float.compute_float_divr 

771 
float_eq_odd > mult_powr_eq_mult_powr_iff 

772 
float_power > real_of_float_power 

773 
lapprox_posrat_def > Float.compute_lapprox_posrat 

774 
lapprox_rat.simps > Float.compute_lapprox_rat 

775 
le_float_def' > Float.compute_float_le 

776 
le_float_def > less_eq_float.rep_eq 

777 
less_float_def' > Float.compute_float_less 

778 
less_float_def > less_float.rep_eq 

779 
normfloat_def > Float.compute_normfloat 

780 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

781 
normfloat > normfloat_def 

782 
normfloat_unique > use normfloat_def 

783 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

784 
one_float_def > Float.compute_float_one 

785 
plus_float_def > Float.compute_float_plus 

786 
rapprox_posrat_def > Float.compute_rapprox_posrat 

787 
rapprox_rat.simps > Float.compute_rapprox_rat 

788 
real_of_float_0 > zero_float.rep_eq 

789 
real_of_float_1 > one_float.rep_eq 

790 
real_of_float_abs > abs_float.rep_eq 

791 
real_of_float_add > plus_float.rep_eq 

792 
real_of_float_minus > uminus_float.rep_eq 

793 
real_of_float_mult > times_float.rep_eq 

794 
real_of_float_simp > Float.rep_eq 

795 
real_of_float_sub > minus_float.rep_eq 

796 
round_down.simps > Float.compute_float_round_down 

797 
round_up.simps > Float.compute_float_round_up 

798 
times_float_def > Float.compute_float_times 

799 
uminus_float_def > Float.compute_float_uminus 

800 
zero_float_def > Float.compute_float_zero 

801 

802 
Lemmas not necessary anymore, use the transfer method: 

803 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

804 
float_divr, float_le_simp, float_less1_mantissa_bound, 

805 
float_less_simp, float_less_zero, float_le_zero, 

806 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

807 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

808 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

809 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

810 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

811 
round_up, zero_le_float, zero_less_float 

47616  812 

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

45791  815 

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

818 

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

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

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

823 

824 
* Session HOLWord: Discontinued many redundant theorems specific to 

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

826 
instead. 

827 

828 
word_sub_alt ~> word_sub_wi 

829 
word_add_alt ~> word_add_def 

830 
word_mult_alt ~> word_mult_def 

831 
word_minus_alt ~> word_minus_def 

832 
word_0_alt ~> word_0_wi 

833 
word_1_alt ~> word_1_wi 

834 
word_add_0 ~> add_0_left 

835 
word_add_0_right ~> add_0_right 

836 
word_mult_1 ~> mult_1_left 

837 
word_mult_1_right ~> mult_1_right 

838 
word_add_commute ~> add_commute 

839 
word_add_assoc ~> add_assoc 

840 
word_add_left_commute ~> add_left_commute 

841 
word_mult_commute ~> mult_commute 

842 
word_mult_assoc ~> mult_assoc 

843 
word_mult_left_commute ~> mult_left_commute 

844 
word_left_distrib ~> left_distrib 

845 
word_right_distrib ~> right_distrib 

846 
word_left_minus ~> left_minus 

847 
word_diff_0_right ~> diff_0_right 

848 
word_diff_self ~> diff_self 

849 
word_sub_def ~> diff_minus 

850 
word_diff_minus ~> diff_minus 

851 
word_add_ac ~> add_ac 

852 
word_mult_ac ~> mult_ac 

853 
word_plus_ac0 ~> add_0_left add_0_right add_ac 

854 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 

855 
word_order_trans ~> order_trans 

856 
word_order_refl ~> order_refl 

857 
word_order_antisym ~> order_antisym 

858 
word_order_linear ~> linorder_linear 

859 
lenw1_zero_neq_one ~> zero_neq_one 

860 
word_number_of_eq ~> number_of_eq 

861 
word_of_int_add_hom ~> wi_hom_add 

862 
word_of_int_sub_hom ~> wi_hom_sub 

863 
word_of_int_mult_hom ~> wi_hom_mult 

864 
word_of_int_minus_hom ~> wi_hom_neg 

865 
word_of_int_succ_hom ~> wi_hom_succ 

866 
word_of_int_pred_hom ~> wi_hom_pred 

867 
word_of_int_0_hom ~> word_0_wi 

868 
word_of_int_1_hom ~> word_1_wi 

869 

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

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

873 
multiplication, shifting by constants, bitwise operators and numeric 

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

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

878 

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

881 
measure_space. The locales based on subset_class now have two 

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

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

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

887 
Measure space constructions for distributions and densities now got 

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

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

890 
and point_measure is introduced. INCOMPATIBILITY. 

47694  891 

892 
Renamed constants: 

893 
measure > emeasure 

894 
finite_measure.\<mu>' > measure 

895 
product_algebra_generator > prod_algebra 

896 
product_prob_space.emb > prod_emb 

897 
product_prob_space.infprod_algebra > PiM 

898 

899 
Removed locales: 

900 
completeable_measure_space 

901 
finite_measure_space 

902 
finite_prob_space 

903 
finite_product_finite_prob_space 

904 
finite_product_sigma_algebra 

905 
finite_sigma_algebra 

906 
measure_space 

907 
pair_finite_prob_space 

908 
pair_finite_sigma_algebra 

909 
pair_finite_space 

910 
pair_sigma_algebra 

911 
product_sigma_algebra 

912 

913 
Removed constants: 

47751  914 
conditional_space 
47694  915 
distribution > use distr measure, or distributed predicate 
47751  916 
image_space 
47694  917 
joint_distribution > use distr measure, or distributed predicate 
47751  918 
pair_measure_generator 
47694  919 
product_prob_space.infprod_algebra > use PiM 
920 
subvimage 

921 

922 
Replacement theorems: 

47751  923 
finite_additivity_sufficient > ring_of_sets.countably_additiveI_finite 
924 
finite_measure.empty_measure > measure_empty 

925 
finite_measure.finite_continuity_from_above > finite_measure.finite_Lim_measure_decseq 

926 
finite_measure.finite_continuity_from_below > finite_measure.finite_Lim_measure_incseq 

927 
finite_measure.finite_measure_countably_subadditive > finite_measure.finite_measure_subadditive_countably 

928 
finite_measure.finite_measure_eq > finite_measure.emeasure_eq_measure 

929 
finite_measure.finite_measure > finite_measure.emeasure_finite 

930 
finite_measure.finite_measure_finite_singleton > finite_measure.finite_measure_eq_setsum_singleton 

931 
finite_measure.positive_measure' > measure_nonneg 

932 
finite_measure.real_measure > finite_measure.emeasure_real 

933 
finite_product_prob_space.finite_measure_times > finite_product_prob_space.finite_measure_PiM_emb 

934 
finite_product_sigma_algebra.in_P > sets_PiM_I_finite 

935 
finite_product_sigma_algebra.P_empty > space_PiM_empty, sets_PiM_empty 

936 
information_space.conditional_entropy_eq > information_space.conditional_entropy_simple_distributed 

937 
information_space.conditional_entropy_positive > information_space.conditional_entropy_nonneg_simple 

938 
information_space.conditional_mutual_information_eq_mutual_information > information_space.conditional_mutual_information_eq_mutual_information_simple 

939 
information_space.conditional_mutual_information_generic_positive > information_space.conditional_mutual_information_nonneg_simple 

940 
information_space.conditional_mutual_information_positive > information_space.conditional_mutual_information_nonneg_simple 

941 
information_space.entropy_commute > information_space.entropy_commute_simple 

942 
information_space.entropy_eq > information_space.entropy_simple_distributed 

943 
information_space.entropy_generic_eq > information_space.entropy_simple_distributed 

944 
information_space.entropy_positive > information_space.entropy_nonneg_simple 

945 
information_space.entropy_uniform_max > information_space.entropy_uniform 

946 
information_space.KL_eq_0_imp > information_space.KL_eq_0_iff_eq 

947 
information_space.KL_eq_0 > information_space.KL_same_eq_0 

948 
information_space.KL_ge_0 > information_space.KL_nonneg 

949 
information_space.mutual_information_eq > information_space.mutual_information_simple_distributed 

950 
information_space.mutual_information_positive > information_space.mutual_information_nonneg_simple 

951 
Int_stable_cuboids > Int_stable_atLeastAtMost 

952 
Int_stable_product_algebra_generator > positive_integral 

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

47694  954 
measure_space.additive > emeasure_additive 
47751  955 
measure_space.AE_iff_null_set > AE_iff_null 
956 
measure_space.almost_everywhere_def > eventually_ae_filter 

957 
measure_space.almost_everywhere_vimage > AE_distrD 

958 
measure_space.continuity_from_above > INF_emeasure_decseq 

959 
measure_space.continuity_from_above_Lim > Lim_emeasure_decseq 

960 
measure_space.continuity_from_below_Lim > Lim_emeasure_incseq 

47694  961 
measure_space.continuity_from_below > SUP_emeasure_incseq 
47751  962 
measure_space_density > emeasure_density 
963 
measure_space.density_is_absolutely_continuous > absolutely_continuousI_density 

964 
measure_space.integrable_vimage > integrable_distr 

965 
measure_space.integral_translated_density > integral_density 

966 
measure_space.integral_vimage > integral_distr 

967 
measure_space.measure_additive > plus_emeasure 

968 
measure_space.measure_compl > emeasure_compl 

969 
measure_space.measure_countable_increasing > emeasure_countable_increasing 

970 
measure_space.measure_countably_subadditive > emeasure_subadditive_countably 

47694  971 
measure_space.measure_decseq > decseq_emeasure 
47751  972 
measure_space.measure_Diff > emeasure_Diff 
973 
measure_space.measure_Diff_null_set > emeasure_Diff_null_set 

47694  974 
measure_space.measure_eq_0 > emeasure_eq_0 
975 
measure_space.measure_finitely_subadditive > emeasure_subadditive_finite 

47751  976 
measure_space.measure_finite_singleton > emeasure_eq_setsum_singleton 
977 
measure_space.measure_incseq > incseq_emeasure 

978 
measure_space.measure_insert > emeasure_insert 

979 
measure_space.measure_mono > emeasure_mono 

980 
measure_space.measure_not_negative > emeasure_not_MInf 

981 
measure_space.measure_preserving_Int_stable > measure_eqI_generator_eq 

982 
measure_space.measure_setsum > setsum_emeasure 

983 
measure_space.measure_setsum_split > setsum_emeasure_cover 

47694  984 
measure_space.measure_space_vimage > emeasure_distr 
47751  985 
measure_space.measure_subadditive_finite > emeasure_subadditive_finite 
986 
measure_space.measure_subadditive > subadditive 

987 
measure_space.measure_top > emeasure_space 

988 
measure_space.measure_UN_eq_0 > emeasure_UN_eq_0 

989 
measure_space.measure_Un_null_set > emeasure_Un_null_set 

990 
measure_space.positive_integral_translated_density > positive_integral_density 

991 
measure_space.positive_integral_vimage > positive_integral_distr 

47694  992 
measure_space.real_continuity_from_above > Lim_measure_decseq 
47751  993 
measure_space.real_continuity_from_below > Lim_measure_incseq 
47694  994 
measure_space.real_measure_countably_subadditive > measure_subadditive_countably 
47751  995 
measure_space.real_measure_Diff > measure_Diff 
996 
measure_space.real_measure_finite_Union > measure_finite_Union 

997 
measure_space.real_measure_setsum_singleton > measure_eq_setsum_singleton 

998 
measure_space.real_measure_subadditive > measure_subadditive 

999 
measure_space.real_measure_Union > measure_Union 

1000 
measure_space.real_measure_UNION > measure_UNION 

47694  1001 
measure_space.simple_function_vimage > simple_function_comp 
1002 
measure_space.simple_integral_vimage > simple_integral_distr 

47751  1003 
measure_space.simple_integral_vimage > simple_integral_distr 
1004 
measure_unique_Int_stable > measure_eqI_generator_eq 

1005 
measure_unique_Int_stable_vimage > measure_eqI_generator_eq 

47694  1006 
pair_sigma_algebra.measurable_cut_fst > sets_Pair1 
1007 
pair_sigma_algebra.measurable_cut_snd > sets_Pair2 

1008 
pair_sigma_algebra.measurable_pair_image_fst > measurable_Pair1 

1009 
pair_sigma_algebra.measurable_pair_image_snd > measurable_Pair2 

1010 
pair_sigma_algebra.measurable_product_swap > measurable_pair_swap_iff 

1011 
pair_sigma_algebra.pair_sigma_algebra_measurable > measurable_pair_swap 

1012 
pair_sigma_algebra.pair_sigma_algebra_swap_measurable > measurable_pair_swap' 

1013 
pair_sigma_algebra.sets_swap > sets_pair_swap 

47751  1014 
pair_sigma_finite.measure_cut_measurable_fst > pair_sigma_finite.measurable_emeasure_Pair1 
1015 
pair_sigma_finite.measure_cut_measurable_snd > pair_sigma_finite.measurable_emeasure_Pair2 

1016 
pair_sigma_finite.measure_preserving_swap > pair_sigma_finite.distr_pair_swap 

1017 
pair_sigma_finite.pair_measure_alt2 > pair_sigma_finite.emeasure_pair_measure_alt2 

1018 
pair_sigma_finite.pair_measure_alt > pair_sigma_finite.emeasure_pair_measure_alt 

1019 
pair_sigma_finite.pair_measure_times > pair_sigma_finite.emeasure_pair_measure_Times 

1020 
prob_space.indep_distribution_eq_measure > prob_space.indep_vars_iff_distr_eq_PiM 

1021 
prob_space.indep_var_distributionD > prob_space.indep_var_distribution_eq 

47694  1022 
prob_space.measure_space_1 > prob_space.emeasure_space_1 
1023 
prob_space.prob_space_vimage > prob_space_distr 

1024 
prob_space.random_variable_restrict > measurable_restrict 

47751  1025 
prob_space_unique_Int_stable > measure_eqI_prob_space 
1026 
product_algebraE > prod_algebraE_all 

1027 
product_algebra_generator_der > prod_algebra_eq_finite 

1028 
product_algebra_generator_into_space > prod_algebra_sets_into_space 

1029 
product_algebraI > sets_PiM_I_finite 

1030 
product_measure_exists > product_sigma_finite.sigma_finite 

47694  1031 
product_prob_space.finite_index_eq_finite_product > product_prob_space.sets_PiM_generator 
1032 
product_prob_space.finite_measure_infprod_emb_Pi > product_prob_space.measure_PiM_emb 

1033 
product_prob_space.infprod_spec > product_prob_space.emeasure_PiM_emb_not_empty 

1034 
product_prob_space.measurable_component > measurable_component_singleton 

1035 
product_prob_space.measurable_emb > measurable_prod_emb 

1036 
product_prob_space.measurable_into_infprod_algebra > measurable_PiM_single 

1037 
product_prob_space.measurable_singleton_infprod > measurable_component_singleton 

1038 
product_prob_space.measure_emb > emeasure_prod_emb 

47751  1039 
product_prob_space.measure_preserving_restrict > product_prob_space.distr_restrict 
1040 
product_sigma_algebra.product_algebra_into_space > space_closed 

1041 
product_sigma_finite.measure_fold > product_sigma_finite.distr_merge 

1042 
product_sigma_finite.measure_preserving_component_singelton > product_sigma_finite.distr_singleton 

1043 
product_sigma_finite.measure_preserving_merge > product_sigma_finite.distr_merge 

47694  1044 
sequence_space.measure_infprod > sequence_space.measure_PiM_countable 
47751  1045 
sets_product_algebra > sets_PiM 
1046 
sigma_algebra.measurable_sigma > measurable_measure_of 

1047 
sigma_finite_measure.disjoint_sigma_finite > sigma_finite_disjoint 

1048 
sigma_finite_measure.RN_deriv_vimage > sigma_finite_measure.RN_deriv_distr 

1049 
sigma_product_algebra_sigma_eq > sigma_prod_algebra_sigma_eq 

1050 
space_product_algebra > space_PiM 

47694  1051 

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

47413  1054 

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

1055 

45160  1056 
*** FOL *** 
1057 

45383  1058 
* New "case_product" attribute (see HOL). 
45160  1059 

45109  1060 

47463  1061 
*** ZF *** 
1062 

1063 
* Greater support for structured proofs involving induction or case 

1064 
analysis. 

1065 

1066 
* Much greater use of mathematical symbols. 

1067 

1068 
* Removal of many ML theorem bindings. INCOMPATIBILITY. 

1069 

1070 

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

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

1072 

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

1075 

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

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

1077 
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

1078 
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

1079 

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

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

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

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

1083 
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

1084 
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

1085 
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

1086 
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

1087 
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

1088 

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

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

1090 
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

1091 

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

1094 
declarations like Local_Theory.note. 

1095 

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

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

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

1098 

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

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

1100 
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

1101 
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

1102 

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

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

1104 

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

1105 
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

1106 
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

1107 
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

1108 
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

1109 
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

1110 
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

1111 
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

1112 
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

1113 
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

1114 
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

1115 
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

1116 
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

1117 

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

1118 

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

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

1120 

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

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

1122 
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

1123 
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

1124 
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

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

1126 
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

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

1128 

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

1131 

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

1134 

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

1135 

45109  1136 

44801  1137 
New in Isabelle20111 (October 2011) 
1138 
 

41651  1139 

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

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

1141 

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

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

1148 

44777  1149 
 Markup of formal entities within the text buffer, with semantic 
44760  1150 
highlighting, tooltips and hyperlinks to jump to defining source 
1151 
positions. 

1152 

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

1155 
theory output and other nonIsabelle text boxes). 

1156 

1157 
 Refined scheduling of proof checking and printing of results, 

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

1160 

44777  1161 
 Reduced CPU performance requirements, usable on machines with few 
44760  1162 
cores. 
1163 

44777  1164 
 Reduced memory requirements due to pruning of unused document 
44760  1165 
versions (garbage collection). 
1166 

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

1168 
including some remaining limitations. 

1169 

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

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

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

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

1175 
INCOMPATIBILITY. 

1176 

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

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

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

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

1180 

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

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

1182 
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

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

1184 

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

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

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

1187 

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

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

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

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

1191 

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

1192 
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

1193 

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

1194 
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

1195 

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

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

1199 

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

1202 

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

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

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

1207 
"Classical Reasoner". 

42633  1208 

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

1209 

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

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

1211 

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

1214 

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

1218 
Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in 

1219 
class complete_linorder. 

1220 

1221 
Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def, 

1222 
Sup_fun_def, Inf_apply, Sup_apply. 

1223 

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

1226 

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

1227 
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

1228 
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

1229 
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

1230 
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

1231 
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

1232 
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

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

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

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

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

1237 
INF_subset ~> INF_superset_mono [OF _ order_refl] 
44800  1238 

1239 
More consistent and comprehensive names: 

1240 

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

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

1242 
UNION_eq_Union_image ~> SUP_def 
43872  1243 
INFI_def ~> INF_def 
1244 
SUPR_def ~> SUP_def 

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

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

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

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

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

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

1250 
SUP_leI ~> SUP_least 
43873  1251 
INFI_bool_eq ~> INF_bool_eq 
1252 
SUPR_bool_eq ~> SUP_bool_eq 

1253 
INFI_apply ~> INF_apply 

1254 
SUPR_apply ~> SUP_apply 

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

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

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

1257 

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

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

1259 

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

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

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

1262 

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

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

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

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

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

1267 

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

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

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

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

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

1272 

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

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

1276 

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

1279 
UN_ball_bex_simps. INCOMPATIBILITY. 

1280 

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

1282 
separate type class floor_ceiling. 

1283 

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

42874  1285 

1286 
locale fun_left_comm ~> locale comp_fun_commute 

1287 
locale fun_left_comm_idem ~> locale comp_fun_idem 

44800  1288 

1289 
Both use pointfree characterization; interpretation proofs may need 

1290 
adjustment. INCOMPATIBILITY. 

42874  1291 

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

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

1294 

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

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

1298 
original names for distributivity theorems, potential INCOMPATIBILITY. 

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

1299 

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

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

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

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

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

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

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

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

1307 

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

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

1310 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1338 
exp_ln_eq ~> ln_unique 
44711  1339 
expi_add ~> exp_add 
1340 
expi_zero ~> exp_zero 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1359 
LIMSEQ_imp_rabs ~> tendsto_rabs 
44710  1360 
LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus] 
1361 
LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const] 

1362 
LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const] 

44748
7f6838b3474a
remove redundant lemma LIMSEQ_Complex in favor of tendsto_Complex
huffman
parents:
44711
diff
changeset

1363 
LIMSEQ_Complex ~> tendsto_Complex 
44568
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1364 
LIM_ident ~> tendsto_ident_at 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

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

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

1367 
LIM_add_zero ~> tendsto_add_zero 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

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

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

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

1371 
LIM_norm_zero ~> tendsto_norm_zero 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1372 
LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

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

1374 
LIM_rabs ~> tendsto_rabs 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1375 
LIM_rabs_zero ~> tendsto_rabs_zero 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1376 
LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

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

1378 
LIM_compose ~> tendsto_compose 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

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

1380 
LIM_scaleR ~> tendsto_scaleR 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1381 
LIM_of_real ~> tendsto_of_real 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

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

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

1384 
LIM_sgn ~> tendsto_sgn 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1385 
isCont_LIM_compose ~> isCont_tendsto_compose 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

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

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

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

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

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

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

1392 
LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at] 
44522
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1393 

44967  1394 
* Theory Complex_Main: The definition of infinite series was 
1395 
generalized. Now it is defined on the type class {topological_space, 

1396 
comm_monoid_add}. Hence it is useable also for extended real numbers. 

42484  1397 

44908  1398 
* Theory Complex_Main: The complex exponential function "expi" is now 
1399 
a typeconstrained abbreviation for "exp :: complex => complex"; thus 

1400 
several polymorphic lemmas about "exp" are now applicable to "expi". 

1401 

44968  1402 
* Code generation: 
1403 

1404 
 Theory Library/Code_Char_ord provides native ordering of 

1405 
characters in the target language. 

1406 

1407 
 Commands code_module and code_library are legacy, use export_code 

1408 
instead. 

1409 

1410 
 Method "evaluation" is legacy, use method "eval" instead. 

1411 

1412 
 Legacy evaluator "SML" is deactivated by default. May be 

1413 
reactivated by the following theory command: 

1414 

1415 
setup {* Value.add_evaluator ("SML", Codegen.eval_term) *} 

1416 

1417 
* Declare ext [intro] by default. Rare INCOMPATIBILITY. 

1418 

45088  1419 
* New proof method "induction" that gives induction hypotheses the 
1420 
name "IH", thus distinguishing them from further hypotheses that come 

1421 
from rule induction. The latter are still called "hyps". Method 

1422 
"induction" is a thin wrapper around "induct" and follows the same 

1423 
syntax. 
