author  wenzelm 
Wed, 23 May 2012 16:22:27 +0200  
changeset 47967  c422128d3889 
parent 47958  c5f7be4a1734 
child 47979  59ec72d3d0b9 
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 

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

12 

47887  13 

47462  14 
New in Isabelle2012 (May 2012) 
15 
 

45109  16 

45593  17 
*** General *** 
18 

45614  19 
* Prover IDE (PIDE) improvements: 
20 

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

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

45614  28 

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

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

46485  32 

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

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

34 
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

35 
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

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

37 
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

38 

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

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

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

41 
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

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

43 

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

44 
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

45 

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

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

47 

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

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

49 

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

50 
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

51 
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

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

53 

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

54 
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

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

56 

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

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

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

47484  62 

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

65 
oldstyle "standard" after instantiation or composition of facts 

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

67 
indices of schematic variables. 

68 

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

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

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

72 
the historic accident of dynamic reevaluation in interpretations 

73 
etc. was exploited. 

74 

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

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

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

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

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

80 
of the material of that old tutorial. 

81 

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

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

84 
manual. 

85 

86 

87 
*** Pure *** 

88 

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

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

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

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

92 

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

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

96 
undocumented feature.) 

97 

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

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

101 

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

103 

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

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

106 

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

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

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

110 
order to accommodate newly introduced premises.) 

111 

47806  112 
* Renamed some inner syntax categories: 
113 

114 
num ~> num_token 

115 
xnum ~> xnum_token 

116 
xstr ~> str_token 

117 

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

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

120 
position information via constraints). 

121 

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

124 
manual. Minor INCOMPATIBILITY. 

125 

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

45134  128 

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

131 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  132 

47464  133 
* Redundant attribute "code_inline" has been discontinued. Use 
134 
"code_unfold" instead. INCOMPATIBILITY. 

135 

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

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

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

138 

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

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

140 

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

141 
INCOMPATIBILITY. 
45383  142 

47856  143 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
144 
instead. INCOMPATIBILITY. 

145 

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

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

148 
legacy since Isabelle2011). 

47855  149 

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

150 

45122  151 
*** HOL *** 
152 

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

155 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

160 
tinkering with former theorems mem_def and Collect_def as far as 

161 
possible. 

162 

163 
For developments which deliberately mix predicates and sets, a 

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

166 
Isabelle20111 before jumping right into the current release. 

167 

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

170 

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

172 

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

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

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

178 
user theories may require adaptations as follows: 

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

179 

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

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

181 
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

182 

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

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

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

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

186 

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

187 
 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

188 
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

189 

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

190 
 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

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

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

193 

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

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

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

196 

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

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

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

201 
corresponding parts of the Quotient package.) 

47809  202 

203 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

205 
relate different type instances of the same polymorphic constant, 

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

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

208 

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

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

211 

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

213 
equivalent subgoal on the corresponding raw types. Constants are 

214 
replaced with corresponding ones according to the transfer rules. 

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

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

220 

221 
 relator_eq attribute: Collects identity laws for relators of 

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

223 
transfer method uses these lemmas to infer transfer rules for 

224 
nonpolymorphic constants on the fly. 

225 

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

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

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

229 
after unfolding the constant definitions. 

230 

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

232 
from type nat to type int. 

233 

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

47809  236 

237 
 lift_definition command: Defines operations on an abstract type in 

238 
terms of a corresponding operation on a representation 

239 
type. Example syntax: 

240 

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

242 
is List.insert 

243 

244 
Users must discharge a respectfulness proof obligation when each 

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

246 
the proof is discharged automatically.) The obligation is 

247 
presented in a userfriendly, readable form; a respectfulness 

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

249 
by the package. 

250 

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

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

253 
lift_definition generates a code certificate theorem and sets up 

254 
code generation for each constant. 

255 

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

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

258 
or a type_definition theorem. The package configures transfer 

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

260 
lift_definition command to work with the type. 

261 

262 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  263 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
264 
Word/Word.thy and Library/Float.thy. 

47809  265 

266 
* Quotient package: 

267 

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

269 
rep and abs functions, similar to typedef. 

270 

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

272 
Transfer packages, as with 'setup_lifting'. 

273 

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

275 
respectfulness property at the point where the constant is 

276 
defined, similar to lift_definition; INCOMPATIBILITY. 

277 

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

279 
accordingly, INCOMPATIBILITY. 

280 

281 
* New diagnostic command 'find_unused_assms' to find potentially 

282 
superfluous assumptions in theorems using Quickcheck. 

283 

284 
* Quickcheck: 

285 

286 
 Quickcheck returns variable assignments as counterexamples, which 

287 
allows to reveal the underspecification of functions under test. 

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

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

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

291 

292 
These counterexample are marked as potentially spurious, as 

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

294 
obvious theorem "hd xs = hd xs". 

295 

296 
After finding a potentially spurious counterexample, Quickcheck 

297 
continues searching for genuine ones. 

298 

299 
By default, Quickcheck shows potentially spurious and genuine 

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

301 
show genuine counterexamples. 

302 

303 
 The command 'quickcheck_generator' creates random and exhaustive 

304 
value generators for a given type and operations. 

305 

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

307 
constructors of that type. 

308 

309 
 Support for multisets. 

310 

311 
 Added "use_subtype" options. 

312 

313 
 Added "quickcheck_locale" configuration to specify how to process 

314 
conjectures in a locale context. 

315 

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

47809  318 

319 
* Sledgehammer: 

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

321 
paper "More SPASS with Isabelle". 

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

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

324 
TFF1), iProver, iProverEq. 

325 
 Replaced remote ESInE with remote Satallax in the default setup. 

326 
 Sped up the minimizer. 

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

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

329 
 Renamed "sound" option to "strict". 

330 

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

333 

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

335 

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

47809  337 

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

340 

341 
list.exhaust [case_product nat.exhaust] 

342 

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

344 
a list and a nat. 

345 

47809  346 
* New "eventually_elim" method as a generalized variant of the 
47855  347 
eventually_elim* rules. Supports structured proofs. 
348 

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

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

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

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

352 

47856  353 
* Record: code generation can be switched off manually with 
354 

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

356 

357 
* Datatype: type parameters allow explicit sort constraints. 

358 

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

361 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

363 
one_case. 

364 

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

366 
the result of the fact expression. 

367 

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

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

371 

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

372 
converse_def ~> converse_unfold 
47549  373 
rel_comp_def ~> relcomp_unfold 
47820  374 
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

375 
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

376 
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

377 
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

378 

46981  379 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
380 

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

47086  383 

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

384 
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

385 

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

46458  389 
rel_pow_1 ~> relpow_1 
46363  390 
rel_pow_0_I ~> relpow_0_I 
391 
rel_pow_Suc_I ~> relpow_Suc_I 

392 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

393 
rel_pow_0_E ~> relpow_0_E 

394 
rel_pow_Suc_E ~> relpow_Suc_E 

395 
rel_pow_E ~> relpow_E 

46458  396 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  397 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  398 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
399 
rel_pow_E2 ~> relpow_E2 

400 
rel_pow_add ~> relpow_add 

401 
rel_pow_commute ~> relpow 

402 
rel_pow_empty ~> relpow_empty: 

403 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

404 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

405 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

406 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

407 
rel_pow_fun_conv ~> relpow_fun_conv 

408 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

409 
rel_pow_finite_bounded ~> relpow_finite_bounded 

410 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

411 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

412 
single_valued_rel_pow ~> single_valued_relpow 

47463  413 

46363  414 
INCOMPATIBILITY. 
415 

47448  416 
* Theory Relation: Consolidated constant name for relation composition 
47464  417 
and corresponding theorem names: 
418 

47549  419 
 Renamed constant rel_comp to relcomp. 
47464  420 

47448  421 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  422 

47448  423 
 Renamed theorems: 
47464  424 

47448  425 
rel_compI ~> relcompI 
426 
rel_compEpair ~> relcompEpair 

427 
rel_compE ~> relcompE 

428 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

429 
rel_comp_empty1 ~> relcomp_empty1 

430 
rel_comp_mono ~> relcomp_mono 

431 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

432 
rel_comp_distrib ~> relcomp_distrib 

433 
rel_comp_distrib2 ~> relcomp_distrib2 

434 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

435 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

436 
single_valued_rel_comp ~> single_valued_relcomp 

47549  437 
rel_comp_def ~> relcomp_unfold 
47448  438 
converse_rel_comp ~> converse_relcomp 
439 
pred_compI ~> relcomppI 

440 
pred_compE ~> relcomppE 

441 
pred_comp_bot1 ~> relcompp_bot1 

442 
pred_comp_bot2 ~> relcompp_bot2 

443 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

444 
pred_comp_mono ~> relcompp_mono 

445 
pred_comp_distrib ~> relcompp_distrib 

446 
pred_comp_distrib2 ~> relcompp_distrib2 

447 
converse_pred_comp ~> converse_relcompp 

47464  448 

47448  449 
finite_rel_comp ~> finite_relcomp 
47464  450 

47448  451 
set_rel_comp ~> set_relcomp 
452 

453 
INCOMPATIBILITY. 

454 

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

457 

458 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

459 
zdiv_self ~> div_self 

460 
zmod_self ~> mod_self 

461 
zdiv_zero ~> div_0 

462 
zmod_zero ~> mod_0 

463 
zdiv_zmod_equality ~> div_mod_equality2 

464 
zdiv_zmod_equality2 ~> div_mod_equality 

465 
zmod_zdiv_trivial ~> mod_div_trivial 

466 
zdiv_zminus_zminus ~> div_minus_minus 

467 
zmod_zminus_zminus ~> mod_minus_minus 

468 
zdiv_zminus2 ~> div_minus_right 

469 
zmod_zminus2 ~> mod_minus_right 

470 
zdiv_minus1_right ~> div_minus1_right 

471 
zmod_minus1_right ~> mod_minus1_right 

472 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

473 
zmod_zmult1_eq ~> mod_mult_right_eq 

474 
zpower_zmod ~> power_mod 

475 
zdvd_zmod ~> dvd_mod 

476 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

477 
mod_mult_distrib ~> mult_mod_left 

478 
mod_mult_distrib2 ~> mult_mod_right 

479 

480 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

481 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

482 

47551  483 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
484 

47552  485 
* Consolidated theorem names concerning fold combinators: 
47550  486 

487 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

488 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

489 
INFI_fold_inf ~> INF_fold_inf 

490 
SUPR_fold_sup ~> SUP_fold_sup 

491 
union_set ~> union_set_fold 

492 
minus_set ~> minus_set_fold 

493 
INFI_set_fold ~> INF_set_fold 

494 
SUPR_set_fold ~> SUP_set_fold 

495 
INF_code ~> INF_set_foldr 

496 
SUP_code ~> SUP_set_foldr 

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

498 
foldr_fold_rev ~> foldr_conv_fold 

499 
foldl_fold ~> foldl_conv_fold 

500 
foldr_foldr ~> foldr_conv_foldl 

501 
foldl_foldr ~> foldl_conv_foldr 

47552  502 
fold_set_remdups ~> fold_set_fold_remdups 
503 
fold_set ~> fold_set_fold 

504 
fold1_set ~> fold1_set_fold 

47550  505 

506 
INCOMPATIBILITY. 

507 

508 
* Dropped rarely useful theorems concerning fold combinators: 

509 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

510 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

511 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

512 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

513 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

514 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

518 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

519 

520 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

521 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

522 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

523 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

525 
fold_conv_foldr and fold_rev. 

526 

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

528 
through option types. 

529 

47856  530 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
531 
relations. 

532 

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

534 

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

536 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

537 

538 
zminus_zminus ~> minus_minus 

539 
zminus_0 ~> minus_zero 

540 
zminus_zadd_distrib ~> minus_add_distrib 

541 
zadd_commute ~> add_commute 

542 
zadd_assoc ~> add_assoc 

543 
zadd_left_commute ~> add_left_commute 

544 
zadd_ac ~> add_ac 

545 
zmult_ac ~> mult_ac 

546 
zadd_0 ~> add_0_left 

547 
zadd_0_right ~> add_0_right 

548 
zadd_zminus_inverse2 ~> left_minus 

549 
zmult_zminus ~> mult_minus_left 

550 
zmult_commute ~> mult_commute 

551 
zmult_assoc ~> mult_assoc 

552 
zadd_zmult_distrib ~> left_distrib 

553 
zadd_zmult_distrib2 ~> right_distrib 

554 
zdiff_zmult_distrib ~> left_diff_distrib 

555 
zdiff_zmult_distrib2 ~> right_diff_distrib 

556 
zmult_1 ~> mult_1_left 

557 
zmult_1_right ~> mult_1_right 

558 
zle_refl ~> order_refl 

559 
zle_trans ~> order_trans 

560 
zle_antisym ~> order_antisym 

561 
zle_linear ~> linorder_linear 

562 
zless_linear ~> linorder_less_linear 

563 
zadd_left_mono ~> add_left_mono 

564 
zadd_strict_right_mono ~> add_strict_right_mono 

565 
zadd_zless_mono ~> add_less_le_mono 

566 
int_0_less_1 ~> zero_less_one 

567 
int_0_neq_1 ~> zero_neq_one 

568 
zless_le ~> less_le 

569 
zpower_zadd_distrib ~> power_add 

570 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

571 
zero_le_zpower_abs ~> zero_le_power_abs 

572 

573 
* Theory Deriv: Renamed 

574 

575 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

576 

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

578 

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

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

583 
INCOMPATIBILITY. 

584 

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

587 

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

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

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

592 
follows: 

47452  593 

594 
Operations: 

595 
bulkload > rbt_bulkload 

596 
del_from_left > rbt_del_from_left 

597 
del_from_right > rbt_del_from_right 

598 
del > rbt_del 

599 
delete > rbt_delete 

600 
ins > rbt_ins 

601 
insert > rbt_insert 

602 
insertw > rbt_insert_with 

603 
insert_with_key > rbt_insert_with_key 

604 
map_entry > rbt_map_entry 

605 
lookup > rbt_lookup 

606 
sorted > rbt_sorted 

607 
tree_greater > rbt_greater 

608 
tree_less > rbt_less 

609 
tree_less_symbol > rbt_less_symbol 

610 
union > rbt_union 

611 
union_with > rbt_union_with 

612 
union_with_key > rbt_union_with_key 

613 

614 
Lemmas: 

615 
balance_left_sorted > balance_left_rbt_sorted 

616 
balance_left_tree_greater > balance_left_rbt_greater 

617 
balance_left_tree_less > balance_left_rbt_less 

618 
balance_right_sorted > balance_right_rbt_sorted 

619 
balance_right_tree_greater > balance_right_rbt_greater 

620 
balance_right_tree_less > balance_right_rbt_less 

621 
balance_sorted > balance_rbt_sorted 

622 
balance_tree_greater > balance_rbt_greater 

623 
balance_tree_less > balance_rbt_less 

624 
bulkload_is_rbt > rbt_bulkload_is_rbt 

625 
combine_sorted > combine_rbt_sorted 

626 
combine_tree_greater > combine_rbt_greater 

627 
combine_tree_less > combine_rbt_less 

628 
delete_in_tree > rbt_delete_in_tree 

629 
delete_is_rbt > rbt_delete_is_rbt 

630 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

631 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

632 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

633 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

634 
del_in_tree > rbt_del_in_tree 

635 
del_inv1_inv2 > rbt_del_inv1_inv2 

636 
del_sorted > rbt_del_rbt_sorted 

637 
del_tree_greater > rbt_del_rbt_greater 

638 
del_tree_less > rbt_del_rbt_less 

639 
dom_lookup_Branch > dom_rbt_lookup_Branch 

640 
entries_lookup > entries_rbt_lookup 

641 
finite_dom_lookup > finite_dom_rbt_lookup 

642 
insert_sorted > rbt_insert_rbt_sorted 

643 
insertw_is_rbt > rbt_insertw_is_rbt 

644 
insertwk_is_rbt > rbt_insertwk_is_rbt 

645 
insertwk_sorted > rbt_insertwk_rbt_sorted 

646 
insertw_sorted > rbt_insertw_rbt_sorted 

647 
ins_sorted > ins_rbt_sorted 

648 
ins_tree_greater > ins_rbt_greater 

649 
ins_tree_less > ins_rbt_less 

650 
is_rbt_sorted > is_rbt_rbt_sorted 

651 
lookup_balance > rbt_lookup_balance 

652 
lookup_bulkload > rbt_lookup_rbt_bulkload 

653 
lookup_delete > rbt_lookup_rbt_delete 

654 
lookup_Empty > rbt_lookup_Empty 

655 
lookup_from_in_tree > rbt_lookup_from_in_tree 

656 
lookup_in_tree > rbt_lookup_in_tree 

657 
lookup_ins > rbt_lookup_ins 

658 
lookup_insert > rbt_lookup_rbt_insert 

659 
lookup_insertw > rbt_lookup_rbt_insertw 

660 
lookup_insertwk > rbt_lookup_rbt_insertwk 

661 
lookup_keys > rbt_lookup_keys 

662 
lookup_map > rbt_lookup_map 

663 
lookup_map_entry > rbt_lookup_rbt_map_entry 

664 
lookup_tree_greater > rbt_lookup_rbt_greater 

665 
lookup_tree_less > rbt_lookup_rbt_less 

666 
lookup_union > rbt_lookup_rbt_union 

667 
map_entry_color_of > rbt_map_entry_color_of 

668 
map_entry_inv1 > rbt_map_entry_inv1 

669 
map_entry_inv2 > rbt_map_entry_inv2 

670 
map_entry_is_rbt > rbt_map_entry_is_rbt 

671 
map_entry_sorted > rbt_map_entry_rbt_sorted 

672 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

673 
map_entry_tree_less > rbt_map_entry_rbt_less 

674 
map_tree_greater > map_rbt_greater 

675 
map_tree_less > map_rbt_less 

676 
map_sorted > map_rbt_sorted 

677 
paint_sorted > paint_rbt_sorted 

678 
paint_lookup > paint_rbt_lookup 

679 
paint_tree_greater > paint_rbt_greater 

680 
paint_tree_less > paint_rbt_less 

681 
sorted_entries > rbt_sorted_entries 

682 
tree_greater_eq_trans > rbt_greater_eq_trans 

683 
tree_greater_nit > rbt_greater_nit 

684 
tree_greater_prop > rbt_greater_prop 

685 
tree_greater_simps > rbt_greater_simps 

686 
tree_greater_trans > rbt_greater_trans 

687 
tree_less_eq_trans > rbt_less_eq_trans 

688 
tree_less_nit > rbt_less_nit 

689 
tree_less_prop > rbt_less_prop 

690 
tree_less_simps > rbt_less_simps 

691 
tree_less_trans > rbt_less_trans 

692 
tree_ord_props > rbt_ord_props 

693 
union_Branch > rbt_union_Branch 

694 
union_is_rbt > rbt_union_is_rbt 

695 
unionw_is_rbt > rbt_unionw_is_rbt 

696 
unionwk_is_rbt > rbt_unionwk_is_rbt 

697 
unionwk_sorted > rbt_unionwk_rbt_sorted 

698 

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

701 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  702 

703 
Changed Operations: 

47622  704 
float_abs > abs 
705 
float_nprt > nprt 

706 
float_pprt > pprt 

707 
pow2 > use powr 

708 
round_down > float_round_down 

709 
round_up > float_round_up 

710 
scale > exponent 

711 

712 
Removed Operations: 

713 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

714 

715 
Renamed Lemmas: 

716 
abs_float_def > Float.compute_float_abs 

717 
bitlen_ge0 > bitlen_nonneg 

718 
bitlen.simps > Float.compute_bitlen 

719 
float_components > Float_mantissa_exponent 

720 
float_divl.simps > Float.compute_float_divl 

721 
float_divr.simps > Float.compute_float_divr 

722 
float_eq_odd > mult_powr_eq_mult_powr_iff 

723 
float_power > real_of_float_power 

724 
lapprox_posrat_def > Float.compute_lapprox_posrat 

725 
lapprox_rat.simps > Float.compute_lapprox_rat 

726 
le_float_def' > Float.compute_float_le 

727 
le_float_def > less_eq_float.rep_eq 

728 
less_float_def' > Float.compute_float_less 

729 
less_float_def > less_float.rep_eq 

730 
normfloat_def > Float.compute_normfloat 

731 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

732 
normfloat > normfloat_def 

733 
normfloat_unique > use normfloat_def 

734 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

735 
one_float_def > Float.compute_float_one 

736 
plus_float_def > Float.compute_float_plus 

737 
rapprox_posrat_def > Float.compute_rapprox_posrat 

738 
rapprox_rat.simps > Float.compute_rapprox_rat 

739 
real_of_float_0 > zero_float.rep_eq 

740 
real_of_float_1 > one_float.rep_eq 

741 
real_of_float_abs > abs_float.rep_eq 

742 
real_of_float_add > plus_float.rep_eq 

743 
real_of_float_minus > uminus_float.rep_eq 

744 
real_of_float_mult > times_float.rep_eq 

745 
real_of_float_simp > Float.rep_eq 

746 
real_of_float_sub > minus_float.rep_eq 

747 
round_down.simps > Float.compute_float_round_down 

748 
round_up.simps > Float.compute_float_round_up 

749 
times_float_def > Float.compute_float_times 

750 
uminus_float_def > Float.compute_float_uminus 

751 
zero_float_def > Float.compute_float_zero 

752 

753 
Lemmas not necessary anymore, use the transfer method: 

754 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

755 
float_divr, float_le_simp, float_less1_mantissa_bound, 

756 
float_less_simp, float_less_zero, float_le_zero, 

757 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

758 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

759 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

760 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

761 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

762 
round_up, zero_le_float, zero_less_float 

47616  763 

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

45791  766 

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

769 

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

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

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

774 

775 
* Session HOLWord: Discontinued many redundant theorems specific to 

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

777 
instead. 

778 

779 
word_sub_alt ~> word_sub_wi 

780 
word_add_alt ~> word_add_def 

781 
word_mult_alt ~> word_mult_def 

782 
word_minus_alt ~> word_minus_def 

783 
word_0_alt ~> word_0_wi 

784 
word_1_alt ~> word_1_wi 

785 
word_add_0 ~> add_0_left 

786 
word_add_0_right ~> add_0_right 

787 
word_mult_1 ~> mult_1_left 

788 
word_mult_1_right ~> mult_1_right 

789 
word_add_commute ~> add_commute 

790 
word_add_assoc ~> add_assoc 

791 
word_add_left_commute ~> add_left_commute 

792 
word_mult_commute ~> mult_commute 

793 
word_mult_assoc ~> mult_assoc 

794 
word_mult_left_commute ~> mult_left_commute 

795 
word_left_distrib ~> left_distrib 

796 
word_right_distrib ~> right_distrib 

797 
word_left_minus ~> left_minus 

798 
word_diff_0_right ~> diff_0_right 

799 
word_diff_self ~> diff_self 

800 
word_sub_def ~> diff_minus 

801 
word_diff_minus ~> diff_minus 

802 
word_add_ac ~> add_ac 

803 
word_mult_ac ~> mult_ac 

804 
word_plus_ac0 ~> add_0_left add_0_right add_ac 

805 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 

806 
word_order_trans ~> order_trans 

807 
word_order_refl ~> order_refl 

808 
word_order_antisym ~> order_antisym 

809 
word_order_linear ~> linorder_linear 

810 
lenw1_zero_neq_one ~> zero_neq_one 

811 
word_number_of_eq ~> number_of_eq 

812 
word_of_int_add_hom ~> wi_hom_add 

813 
word_of_int_sub_hom ~> wi_hom_sub 

814 
word_of_int_mult_hom ~> wi_hom_mult 

815 
word_of_int_minus_hom ~> wi_hom_neg 

816 
word_of_int_succ_hom ~> wi_hom_succ 

817 
word_of_int_pred_hom ~> wi_hom_pred 

818 
word_of_int_0_hom ~> word_0_wi 

819 
word_of_int_1_hom ~> word_1_wi 

820 

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

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

824 
multiplication, shifting by constants, bitwise operators and numeric 

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

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

829 

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

832 
measure_space. The locales based on subset_class now have two 

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

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

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

838 
Measure space constructions for distributions and densities now got 

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

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

841 
and point_measure is introduced. INCOMPATIBILITY. 

47694  842 

843 
Renamed constants: 

844 
measure > emeasure 

845 
finite_measure.\<mu>' > measure 

846 
product_algebra_generator > prod_algebra 

847 
product_prob_space.emb > prod_emb 

848 
product_prob_space.infprod_algebra > PiM 

849 

850 
Removed locales: 

851 
completeable_measure_space 

852 
finite_measure_space 

853 
finite_prob_space 

854 
finite_product_finite_prob_space 

855 
finite_product_sigma_algebra 

856 
finite_sigma_algebra 

857 
measure_space 

858 
pair_finite_prob_space 

859 
pair_finite_sigma_algebra 

860 
pair_finite_space 

861 
pair_sigma_algebra 

862 
product_sigma_algebra 

863 

864 
Removed constants: 

47751  865 
conditional_space 
47694  866 
distribution > use distr measure, or distributed predicate 
47751  867 
image_space 
47694  868 
joint_distribution > use distr measure, or distributed predicate 
47751  869 
pair_measure_generator 
47694  870 
product_prob_space.infprod_algebra > use PiM 
871 
subvimage 

872 

873 
Replacement theorems: 

47751  874 
finite_additivity_sufficient > ring_of_sets.countably_additiveI_finite 
875 
finite_measure.empty_measure > measure_empty 

876 
finite_measure.finite_continuity_from_above > finite_measure.finite_Lim_measure_decseq 

877 
finite_measure.finite_continuity_from_below > finite_measure.finite_Lim_measure_incseq 

878 
finite_measure.finite_measure_countably_subadditive > finite_measure.finite_measure_subadditive_countably 

879 
finite_measure.finite_measure_eq > finite_measure.emeasure_eq_measure 

880 
finite_measure.finite_measure > finite_measure.emeasure_finite 

881 
finite_measure.finite_measure_finite_singleton > finite_measure.finite_measure_eq_setsum_singleton 

882 
finite_measure.positive_measure' > measure_nonneg 

883 
finite_measure.real_measure > finite_measure.emeasure_real 

884 
finite_product_prob_space.finite_measure_times > finite_product_prob_space.finite_measure_PiM_emb 

885 
finite_product_sigma_algebra.in_P > sets_PiM_I_finite 

886 
finite_product_sigma_algebra.P_empty > space_PiM_empty, sets_PiM_empty 

887 
information_space.conditional_entropy_eq > information_space.conditional_entropy_simple_distributed 

888 
information_space.conditional_entropy_positive > information_space.conditional_entropy_nonneg_simple 

889 
information_space.conditional_mutual_information_eq_mutual_information > information_space.conditional_mutual_information_eq_mutual_information_simple 

890 
information_space.conditional_mutual_information_generic_positive > information_space.conditional_mutual_information_nonneg_simple 

891 
information_space.conditional_mutual_information_positive > information_space.conditional_mutual_information_nonneg_simple 

892 
information_space.entropy_commute > information_space.entropy_commute_simple 

893 
information_space.entropy_eq > information_space.entropy_simple_distributed 

894 
information_space.entropy_generic_eq > information_space.entropy_simple_distributed 

895 
information_space.entropy_positive > information_space.entropy_nonneg_simple 

896 
information_space.entropy_uniform_max > information_space.entropy_uniform 

897 
information_space.KL_eq_0_imp > information_space.KL_eq_0_iff_eq 

898 
information_space.KL_eq_0 > information_space.KL_same_eq_0 

899 
information_space.KL_ge_0 > information_space.KL_nonneg 

900 
information_space.mutual_information_eq > information_space.mutual_information_simple_distributed 

901 
information_space.mutual_information_positive > information_space.mutual_information_nonneg_simple 

902 
Int_stable_cuboids > Int_stable_atLeastAtMost 

903 
Int_stable_product_algebra_generator > positive_integral 

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

47694  905 
measure_space.additive > emeasure_additive 
47751  906 
measure_space.AE_iff_null_set > AE_iff_null 
907 
measure_space.almost_everywhere_def > eventually_ae_filter 

908 
measure_space.almost_everywhere_vimage > AE_distrD 

909 
measure_space.continuity_from_above > INF_emeasure_decseq 

910 
measure_space.continuity_from_above_Lim > Lim_emeasure_decseq 

911 
measure_space.continuity_from_below_Lim > Lim_emeasure_incseq 

47694  912 
measure_space.continuity_from_below > SUP_emeasure_incseq 
47751  913 
measure_space_density > emeasure_density 
914 
measure_space.density_is_absolutely_continuous > absolutely_continuousI_density 

915 
measure_space.integrable_vimage > integrable_distr 

916 
measure_space.integral_translated_density > integral_density 

917 
measure_space.integral_vimage > integral_distr 

918 
measure_space.measure_additive > plus_emeasure 

919 
measure_space.measure_compl > emeasure_compl 

920 
measure_space.measure_countable_increasing > emeasure_countable_increasing 

921 
measure_space.measure_countably_subadditive > emeasure_subadditive_countably 

47694  922 
measure_space.measure_decseq > decseq_emeasure 
47751  923 
measure_space.measure_Diff > emeasure_Diff 
924 
measure_space.measure_Diff_null_set > emeasure_Diff_null_set 

47694  925 
measure_space.measure_eq_0 > emeasure_eq_0 
926 
measure_space.measure_finitely_subadditive > emeasure_subadditive_finite 

47751  927 
measure_space.measure_finite_singleton > emeasure_eq_setsum_singleton 
928 
measure_space.measure_incseq > incseq_emeasure 

929 
measure_space.measure_insert > emeasure_insert 

930 
measure_space.measure_mono > emeasure_mono 

931 
measure_space.measure_not_negative > emeasure_not_MInf 

932 
measure_space.measure_preserving_Int_stable > measure_eqI_generator_eq 

933 
measure_space.measure_setsum > setsum_emeasure 

934 
measure_space.measure_setsum_split > setsum_emeasure_cover 

47694  935 
measure_space.measure_space_vimage > emeasure_distr 
47751  936 
measure_space.measure_subadditive_finite > emeasure_subadditive_finite 
937 
measure_space.measure_subadditive > subadditive 

938 
measure_space.measure_top > emeasure_space 

939 
measure_space.measure_UN_eq_0 > emeasure_UN_eq_0 

940 
measure_space.measure_Un_null_set > emeasure_Un_null_set 

941 
measure_space.positive_integral_translated_density > positive_integral_density 

942 
measure_space.positive_integral_vimage > positive_integral_distr 

47694  943 
measure_space.real_continuity_from_above > Lim_measure_decseq 
47751  944 
measure_space.real_continuity_from_below > Lim_measure_incseq 
47694  945 
measure_space.real_measure_countably_subadditive > measure_subadditive_countably 
47751  946 
measure_space.real_measure_Diff > measure_Diff 
947 
measure_space.real_measure_finite_Union > measure_finite_Union 

948 
measure_space.real_measure_setsum_singleton > measure_eq_setsum_singleton 

949 
measure_space.real_measure_subadditive > measure_subadditive 

950 
measure_space.real_measure_Union > measure_Union 

951 
measure_space.real_measure_UNION > measure_UNION 

47694  952 
measure_space.simple_function_vimage > simple_function_comp 
953 
measure_space.simple_integral_vimage > simple_integral_distr 

47751  954 
measure_space.simple_integral_vimage > simple_integral_distr 
955 
measure_unique_Int_stable > measure_eqI_generator_eq 

956 
measure_unique_Int_stable_vimage > measure_eqI_generator_eq 

47694  957 
pair_sigma_algebra.measurable_cut_fst > sets_Pair1 
958 
pair_sigma_algebra.measurable_cut_snd > sets_Pair2 

959 
pair_sigma_algebra.measurable_pair_image_fst > measurable_Pair1 

960 
pair_sigma_algebra.measurable_pair_image_snd > measurable_Pair2 

961 
pair_sigma_algebra.measurable_product_swap > measurable_pair_swap_iff 

962 
pair_sigma_algebra.pair_sigma_algebra_measurable > measurable_pair_swap 

963 
pair_sigma_algebra.pair_sigma_algebra_swap_measurable > measurable_pair_swap' 

964 
pair_sigma_algebra.sets_swap > sets_pair_swap 

47751  965 
pair_sigma_finite.measure_cut_measurable_fst > pair_sigma_finite.measurable_emeasure_Pair1 
966 
pair_sigma_finite.measure_cut_measurable_snd > pair_sigma_finite.measurable_emeasure_Pair2 

967 
pair_sigma_finite.measure_preserving_swap > pair_sigma_finite.distr_pair_swap 

968 
pair_sigma_finite.pair_measure_alt2 > pair_sigma_finite.emeasure_pair_measure_alt2 

969 
pair_sigma_finite.pair_measure_alt > pair_sigma_finite.emeasure_pair_measure_alt 

970 
pair_sigma_finite.pair_measure_times > pair_sigma_finite.emeasure_pair_measure_Times 

971 
prob_space.indep_distribution_eq_measure > prob_space.indep_vars_iff_distr_eq_PiM 

972 
prob_space.indep_var_distributionD > prob_space.indep_var_distribution_eq 

47694  973 
prob_space.measure_space_1 > prob_space.emeasure_space_1 
974 
prob_space.prob_space_vimage > prob_space_distr 

975 
prob_space.random_variable_restrict > measurable_restrict 

47751  976 
prob_space_unique_Int_stable > measure_eqI_prob_space 
977 
product_algebraE > prod_algebraE_all 

978 
product_algebra_generator_der > prod_algebra_eq_finite 

979 
product_algebra_generator_into_space > prod_algebra_sets_into_space 

980 
product_algebraI > sets_PiM_I_finite 

981 
product_measure_exists > product_sigma_finite.sigma_finite 

47694  982 
product_prob_space.finite_index_eq_finite_product > product_prob_space.sets_PiM_generator 
983 
product_prob_space.finite_measure_infprod_emb_Pi > product_prob_space.measure_PiM_emb 

984 
product_prob_space.infprod_spec > product_prob_space.emeasure_PiM_emb_not_empty 

985 
product_prob_space.measurable_component > measurable_component_singleton 

986 
product_prob_space.measurable_emb > measurable_prod_emb 

987 
product_prob_space.measurable_into_infprod_algebra > measurable_PiM_single 

988 
product_prob_space.measurable_singleton_infprod > measurable_component_singleton 

989 
product_prob_space.measure_emb > emeasure_prod_emb 

47751  990 
product_prob_space.measure_preserving_restrict > product_prob_space.distr_restrict 
991 
product_sigma_algebra.product_algebra_into_space > space_closed 

992 
product_sigma_finite.measure_fold > product_sigma_finite.distr_merge 

993 
product_sigma_finite.measure_preserving_component_singelton > product_sigma_finite.distr_singleton 

994 
product_sigma_finite.measure_preserving_merge > product_sigma_finite.distr_merge 

47694  995 
sequence_space.measure_infprod > sequence_space.measure_PiM_countable 
47751  996 
sets_product_algebra > sets_PiM 
997 
sigma_algebra.measurable_sigma > measurable_measure_of 

998 
sigma_finite_measure.disjoint_sigma_finite > sigma_finite_disjoint 

999 
sigma_finite_measure.RN_deriv_vimage > sigma_finite_measure.RN_deriv_distr 

1000 
sigma_product_algebra_sigma_eq > sigma_prod_algebra_sigma_eq 

1001 
space_product_algebra > space_PiM 

47694  1002 

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

47413  1005 

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

1006 

45160  1007 
*** FOL *** 
1008 

45383  1009 
* New "case_product" attribute (see HOL). 
45160  1010 

45109  1011 

47463  1012 
*** ZF *** 
1013 

1014 
* Greater support for structured proofs involving induction or case 

1015 
analysis. 

1016 

1017 
* Much greater use of mathematical symbols. 

1018 

1019 
* Removal of many ML theorem bindings. INCOMPATIBILITY. 

1020 

1021 

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

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

1023 

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

1026 

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

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

1028 
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

1029 
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

1030 

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

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

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

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

1034 
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

1035 
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

1036 
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

1037 
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

1038 
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

1039 

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

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

1041 
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

1042 

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

1045 
declarations like Local_Theory.note. 

1046 

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

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

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

1049 

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

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

1051 
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

1052 
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

1053 

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

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

1055 

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

1056 
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

1057 
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

1058 
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

1059 
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

1060 
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

1061 
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

1062 
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

1063 
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

1064 
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

1065 
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

1066 
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

1067 
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

1068 

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

1069 

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

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

1071 

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

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

1073 
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

1074 
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

1075 
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

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

1077 
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

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

1079 

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

1082 

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

1085 

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

1086 

45109  1087 

44801  1088 
New in Isabelle20111 (October 2011) 
1089 
 

41651  1090 

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

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

1092 

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

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

1099 

44777  1100 
 Markup of formal entities within the text buffer, with semantic 
44760  1101 
highlighting, tooltips and hyperlinks to jump to defining source 
1102 
positions. 

1103 

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

1106 
theory output and other nonIsabelle text boxes). 

1107 

1108 
 Refined scheduling of proof checking and printing of results, 

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

1111 

44777  1112 
 Reduced CPU performance requirements, usable on machines with few 
44760  1113 
cores. 
1114 

44777  1115 
 Reduced memory requirements due to pruning of unused document 
44760  1116 
versions (garbage collection). 
1117 

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

1119 
including some remaining limitations. 

1120 

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

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

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

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

1126 
INCOMPATIBILITY. 

1127 

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

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

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

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

1131 

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

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

1133 
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

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

1135 

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

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

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

1138 

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

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

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

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

1142 

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

1143 
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

1144 

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

1145 
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

1146 

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

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

1150 

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

1153 

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

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

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

1158 
"Classical Reasoner". 

42633  1159 

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

1160 

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

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

1162 

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

1165 

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

1169 
Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in 

1170 
class complete_linorder. 

1171 

1172 
Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def, 

1173 
Sup_fun_def, Inf_apply, Sup_apply. 

1174 

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

1177 

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

1178 
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

1179 
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

1180 
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

1181 
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

1182 
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

1183 
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

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

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

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

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

1188 
INF_subset ~> INF_superset_mono [OF _ order_refl] 
44800  1189 

1190 
More consistent and comprehensive names: 

1191 

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

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

1193 
UNION_eq_Union_image ~> SUP_def 
43872  1194 
INFI_def ~> INF_def 
1195 
SUPR_def ~> SUP_def 

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

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

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

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

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

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

1201 
SUP_leI ~> SUP_least 
43873  1202 
INFI_bool_eq ~> INF_bool_eq 
1203 
SUPR_bool_eq ~> SUP_bool_eq 

1204 
INFI_apply ~> INF_apply 

1205 
SUPR_apply ~> SUP_apply 

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

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

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

1208 

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

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

1210 

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

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

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

1213 

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

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

1215 
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

1216 
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

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

1218 

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

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

1220 
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

1221 
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

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

1223 

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

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

1227 

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

1230 
UN_ball_bex_simps. INCOMPATIBILITY. 

1231 

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

1233 
separate type class floor_ceiling. 

1234 

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

42874  1236 

1237 
locale fun_left_comm ~> locale comp_fun_commute 

1238 
locale fun_left_comm_idem ~> locale comp_fun_idem 

44800  1239 

1240 
Both use pointfree characterization; interpretation proofs may need 

1241 
adjustment. INCOMPATIBILITY. 

42874  1242 

44800  1243 
* 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

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

1245 

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

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

1249 
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

1250 

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

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

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

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

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

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

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

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

1258 

44800  1259 
* 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

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

1261 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1281 
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

1282 
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

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

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

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

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

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

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

1289 
exp_ln_eq ~> ln_unique 
44711  1290 
expi_add ~> exp_add 
1291 
expi_zero ~> exp_zero 

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

1292 
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

1293 
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

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

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

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

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

1298 
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

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

1300 
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

1301 
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

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

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

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

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

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

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

1308 
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

1309 
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

1310 
LIMSEQ_imp_rabs ~> tendsto_rabs 
44710  1311 
LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus] 
1312 
LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const] 

1313 
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

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

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

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

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

1318 
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

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

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

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

1322 
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

1323 
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

1324 
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

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

1326 
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

1327 
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

1328 
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

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

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

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

1332 
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

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

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

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

1336 
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

1337 
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

1338 
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

1339 
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

1340 
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

1341 
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

1342 
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

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

1344 

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

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

42484  1348 

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

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

1352 

44968  1353 
* Code generation: 
1354 

1355 
 Theory Library/Code_Char_ord provides native ordering of 

1356 
characters in the target language. 

1357 

1358 
 Commands code_module and code_library are legacy, use export_code 

1359 
instead. 

1360 

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

1362 

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

1364 
reactivated by the following theory command: 

1365 

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

1367 

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

1369 

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

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

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

1374 
syntax. 

1375 

44968  1376 
* Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is 
1377 
still available as a legacy feature for some time. 

1378 

1379 
* Nitpick: 

1380 
 Added "need" and "total_consts" options. 

1381 
 Reintroduced "show_skolems" option by popular demand. 

1382 
 Renamed attribute: nitpick_def ~> nitpick_unfold. 

1383 
INCOMPATIBILITY. 

1384 

1385 
* Sledgehammer: 

1386 
 Use quasisound (and efficient) translations by default. 

1387 
 Added support for the following provers: EToFoF, LEOII, 

1388 
Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax. 

1389 
 Automatically preplay and minimize proofs before showing them if 

1390 
this can be done within reasonable time. 

1391 
 sledgehammer available_provers ~> sledgehammer supported_provers. 

1392 
INCOMPATIBILITY. 

1393 
 Added "preplay_timeout", "slicing", "type_enc", "sound", 

1394 
"max_mono_iters", and "max_new_mono_instances" options. 

1395 
 Removed "explicit_apply" and "full_types" options as well as "Full 

1396 
Types" Proof General menu item. INCOMPATIBILITY. 

1397 

1398 
* Metis: 

1399 
 Removed "metisF"  use "metis" instead. INCOMPATIBILITY. 

1400 
 Obsoleted "metisFT"  use "metis (full_types)" instead. 

1401 
INCOMPATIBILITY. 

1402 

1403 
* Command 'try': 

1404 
 Renamed 'try_methods' and added "simp:", "intro:", "dest:", and 

1405 
"elim:" options. INCOMPATIBILITY. 

1406 
 Introduced 'try' that not only runs 'try_methods' but also 

1407 
'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'. 

1408 

1409 
* Quickcheck: 

1410 
 Added "eval" option to evaluate terms for the found counterexample 

1411 
(currently only supported by the default (exhaustive) tester). 

1412 
 Added postprocessing of terms to obtain readable counterexamples 

1413 
(currently only supported by the default (exhaustive) tester). 

1414 
 New counterexample generator quickcheck[narrowing] enables 

1415 
narrowingbased testing. Requires the Glasgow Haskell compiler 

1416 
with its installation location defined in the Isabelle settings 

1417 
environment as ISABELLE_GHC. 

1418 
 Removed quickcheck tester "SML" based on the SML code generator 

1419 
(formly in HOL/Library). 

1420 

1421 
* Function package: discontinued option "tailrec". INCOMPATIBILITY, 

1422 
use 'partial_function' instead. 

1423 

1424 
* Theory Library/Extended_Reals replaces now the positive extended 

1425 
reals found in probability theory. This file is extended by 

