author  wenzelm 
Wed, 02 May 2012 20:43:57 +0200  
changeset 47856  57d1df2f2a0f 
parent 47855  1246d847b8c1 
child 47866  2cc26ddd8298 
child 47887  4e9c06c194d9 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

47462  4 
New in Isabelle2012 (May 2012) 
5 
 

45109  6 

45593  7 
*** General *** 
8 

45614  9 
* Prover IDE (PIDE) improvements: 
10 

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

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

45614  18 

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

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

46485  22 

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

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

24 
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

25 
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

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

27 
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

28 

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

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

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

31 
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

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

33 

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

34 
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

35 

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

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

37 

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

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

39 

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

40 
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

41 
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

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

43 

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

44 
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

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

46 

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

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

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

47484  52 

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

55 
oldstyle "standard" after instantiation or composition of facts 

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

57 
indices of schematic variables. 

58 

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

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

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

62 
the historic accident of dynamic reevaluation in interpretations 

63 
etc. was exploited. 

64 

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

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

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

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

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

70 
of the material of that old tutorial. 

71 

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

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

74 
manual. 

75 

76 

77 
*** Pure *** 

78 

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

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

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

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

82 

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

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

86 
undocumented feature.) 

87 

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

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

91 

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

93 

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

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

96 

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

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

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

100 
order to accommodate newly introduced premises.) 

101 

47806  102 
* Renamed some inner syntax categories: 
103 

104 
num ~> num_token 

105 
xnum ~> xnum_token 

106 
xstr ~> str_token 

107 

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

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

110 
position information via constraints). 

111 

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

114 
manual. Minor INCOMPATIBILITY. 

115 

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

45134  118 

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

121 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  122 

47464  123 
* Redundant attribute "code_inline" has been discontinued. Use 
124 
"code_unfold" instead. INCOMPATIBILITY. 

125 

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

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

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

128 

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

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

130 

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

131 
INCOMPATIBILITY. 
45383  132 

47856  133 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
134 
instead. INCOMPATIBILITY. 

135 

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

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

138 
legacy since Isabelle2011). 

47855  139 

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

140 

45122  141 
*** HOL *** 
142 

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

145 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

150 
tinkering with former theorems mem_def and Collect_def as far as 

151 
possible. 

152 

153 
For developments which deliberately mix predicates and sets, a 

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

156 
Isabelle20111 before jumping right into the current release. 

157 

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

160 

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

162 

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

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

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

168 
user theories may require adaptations as follows: 

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

169 

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

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

171 
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

172 

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

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

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

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

176 

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

177 
 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

178 
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

179 

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

180 
 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

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

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

183 

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

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

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

186 

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

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

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

191 
corresponding parts of the Quotient package.) 

47809  192 

193 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

195 
relate different type instances of the same polymorphic constant, 

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

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

198 

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

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

201 

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

203 
equivalent subgoal on the corresponding raw types. Constants are 

204 
replaced with corresponding ones according to the transfer rules. 

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

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

210 

211 
 relator_eq attribute: Collects identity laws for relators of 

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

213 
transfer method uses these lemmas to infer transfer rules for 

214 
nonpolymorphic constants on the fly. 

215 

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

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

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

219 
after unfolding the constant definitions. 

220 

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

222 
from type nat to type int. 

223 

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

47809  226 

227 
 lift_definition command: Defines operations on an abstract type in 

228 
terms of a corresponding operation on a representation 

229 
type. Example syntax: 

230 

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

232 
is List.insert 

233 

234 
Users must discharge a respectfulness proof obligation when each 

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

236 
the proof is discharged automatically.) The obligation is 

237 
presented in a userfriendly, readable form; a respectfulness 

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

239 
by the package. 

240 

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

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

243 
lift_definition generates a code certificate theorem and sets up 

244 
code generation for each constant. 

245 

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

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

248 
or a type_definition theorem. The package configures transfer 

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

250 
lift_definition command to work with the type. 

251 

252 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  253 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
254 
Word/Word.thy and Library/Float.thy. 

47809  255 

256 
* Quotient package: 

257 

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

259 
rep and abs functions, similar to typedef. 

260 

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

262 
Transfer packages, as with 'setup_lifting'. 

263 

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

265 
respectfulness property at the point where the constant is 

266 
defined, similar to lift_definition; INCOMPATIBILITY. 

267 

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

269 
accordingly, INCOMPATIBILITY. 

270 

271 
* New diagnostic command 'find_unused_assms' to find potentially 

272 
superfluous assumptions in theorems using Quickcheck. 

273 

274 
* Quickcheck: 

275 

276 
 Quickcheck returns variable assignments as counterexamples, which 

277 
allows to reveal the underspecification of functions under test. 

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

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

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

281 

282 
These counterexample are marked as potentially spurious, as 

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

284 
obvious theorem "hd xs = hd xs". 

285 

286 
After finding a potentially spurious counterexample, Quickcheck 

287 
continues searching for genuine ones. 

288 

289 
By default, Quickcheck shows potentially spurious and genuine 

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

291 
show genuine counterexamples. 

292 

293 
 The command 'quickcheck_generator' creates random and exhaustive 

294 
value generators for a given type and operations. 

295 

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

297 
constructors of that type. 

298 

299 
 Support for multisets. 

300 

301 
 Added "use_subtype" options. 

302 

303 
 Added "quickcheck_locale" configuration to specify how to process 

304 
conjectures in a locale context. 

305 

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

47809  308 

309 
* Sledgehammer: 

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

311 
paper "More SPASS with Isabelle". 

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

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

314 
TFF1), iProver, iProverEq. 

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

316 
 Sped up the minimizer. 

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

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

319 
 Renamed "sound" option to "strict". 

320 

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

323 

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

325 

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

47809  327 

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

330 

331 
list.exhaust [case_product nat.exhaust] 

332 

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

334 
a list and a nat. 

335 

47809  336 
* New "eventually_elim" method as a generalized variant of the 
47855  337 
eventually_elim* rules. Supports structured proofs. 
338 

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

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

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

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

342 

47856  343 
* Record: code generation can be switched off manually with 
344 

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

346 

347 
* Datatype: type parameters allow explicit sort constraints. 

348 

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

351 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

353 
one_case. 

354 

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

356 
the result of the fact expression. 

357 

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

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

361 

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

362 
converse_def ~> converse_unfold 
47549  363 
rel_comp_def ~> relcomp_unfold 
47820  364 
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

365 
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

366 
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

367 
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

368 

46981  369 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
370 

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

47086  373 

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

374 
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

375 

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

46458  379 
rel_pow_1 ~> relpow_1 
46363  380 
rel_pow_0_I ~> relpow_0_I 
381 
rel_pow_Suc_I ~> relpow_Suc_I 

382 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

383 
rel_pow_0_E ~> relpow_0_E 

384 
rel_pow_Suc_E ~> relpow_Suc_E 

385 
rel_pow_E ~> relpow_E 

46458  386 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  387 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  388 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
389 
rel_pow_E2 ~> relpow_E2 

390 
rel_pow_add ~> relpow_add 

391 
rel_pow_commute ~> relpow 

392 
rel_pow_empty ~> relpow_empty: 

393 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

394 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

395 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

396 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

397 
rel_pow_fun_conv ~> relpow_fun_conv 

398 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

399 
rel_pow_finite_bounded ~> relpow_finite_bounded 

400 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

401 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

402 
single_valued_rel_pow ~> single_valued_relpow 

47463  403 

46363  404 
INCOMPATIBILITY. 
405 

47448  406 
* Theory Relation: Consolidated constant name for relation composition 
47464  407 
and corresponding theorem names: 
408 

47549  409 
 Renamed constant rel_comp to relcomp. 
47464  410 

47448  411 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  412 

47448  413 
 Renamed theorems: 
47464  414 

47448  415 
rel_compI ~> relcompI 
416 
rel_compEpair ~> relcompEpair 

417 
rel_compE ~> relcompE 

418 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

419 
rel_comp_empty1 ~> relcomp_empty1 

420 
rel_comp_mono ~> relcomp_mono 

421 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

422 
rel_comp_distrib ~> relcomp_distrib 

423 
rel_comp_distrib2 ~> relcomp_distrib2 

424 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

425 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

426 
single_valued_rel_comp ~> single_valued_relcomp 

47549  427 
rel_comp_def ~> relcomp_unfold 
47448  428 
converse_rel_comp ~> converse_relcomp 
429 
pred_compI ~> relcomppI 

430 
pred_compE ~> relcomppE 

431 
pred_comp_bot1 ~> relcompp_bot1 

432 
pred_comp_bot2 ~> relcompp_bot2 

433 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

434 
pred_comp_mono ~> relcompp_mono 

435 
pred_comp_distrib ~> relcompp_distrib 

436 
pred_comp_distrib2 ~> relcompp_distrib2 

437 
converse_pred_comp ~> converse_relcompp 

47464  438 

47448  439 
finite_rel_comp ~> finite_relcomp 
47464  440 

47448  441 
set_rel_comp ~> set_relcomp 
442 

443 
INCOMPATIBILITY. 

444 

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

447 

448 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

449 
zdiv_self ~> div_self 

450 
zmod_self ~> mod_self 

451 
zdiv_zero ~> div_0 

452 
zmod_zero ~> mod_0 

453 
zdiv_zmod_equality ~> div_mod_equality2 

454 
zdiv_zmod_equality2 ~> div_mod_equality 

455 
zmod_zdiv_trivial ~> mod_div_trivial 

456 
zdiv_zminus_zminus ~> div_minus_minus 

457 
zmod_zminus_zminus ~> mod_minus_minus 

458 
zdiv_zminus2 ~> div_minus_right 

459 
zmod_zminus2 ~> mod_minus_right 

460 
zdiv_minus1_right ~> div_minus1_right 

461 
zmod_minus1_right ~> mod_minus1_right 

462 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

463 
zmod_zmult1_eq ~> mod_mult_right_eq 

464 
zpower_zmod ~> power_mod 

465 
zdvd_zmod ~> dvd_mod 

466 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

467 
mod_mult_distrib ~> mult_mod_left 

468 
mod_mult_distrib2 ~> mult_mod_right 

469 

470 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

471 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

472 

47551  473 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
474 

47552  475 
* Consolidated theorem names concerning fold combinators: 
47550  476 

477 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

478 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

479 
INFI_fold_inf ~> INF_fold_inf 

480 
SUPR_fold_sup ~> SUP_fold_sup 

481 
union_set ~> union_set_fold 

482 
minus_set ~> minus_set_fold 

483 
INFI_set_fold ~> INF_set_fold 

484 
SUPR_set_fold ~> SUP_set_fold 

485 
INF_code ~> INF_set_foldr 

486 
SUP_code ~> SUP_set_foldr 

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

488 
foldr_fold_rev ~> foldr_conv_fold 

489 
foldl_fold ~> foldl_conv_fold 

490 
foldr_foldr ~> foldr_conv_foldl 

491 
foldl_foldr ~> foldl_conv_foldr 

47552  492 
fold_set_remdups ~> fold_set_fold_remdups 
493 
fold_set ~> fold_set_fold 

494 
fold1_set ~> fold1_set_fold 

47550  495 

496 
INCOMPATIBILITY. 

497 

498 
* Dropped rarely useful theorems concerning fold combinators: 

499 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

500 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

501 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

502 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

503 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

504 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

508 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

509 

510 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

511 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

512 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

513 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

515 
fold_conv_foldr and fold_rev. 

516 

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

518 
through option types. 

519 

47856  520 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
521 
relations. 

522 

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

524 

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

526 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

527 

528 
zminus_zminus ~> minus_minus 

529 
zminus_0 ~> minus_zero 

530 
zminus_zadd_distrib ~> minus_add_distrib 

531 
zadd_commute ~> add_commute 

532 
zadd_assoc ~> add_assoc 

533 
zadd_left_commute ~> add_left_commute 

534 
zadd_ac ~> add_ac 

535 
zmult_ac ~> mult_ac 

536 
zadd_0 ~> add_0_left 

537 
zadd_0_right ~> add_0_right 

538 
zadd_zminus_inverse2 ~> left_minus 

539 
zmult_zminus ~> mult_minus_left 

540 
zmult_commute ~> mult_commute 

541 
zmult_assoc ~> mult_assoc 

542 
zadd_zmult_distrib ~> left_distrib 

543 
zadd_zmult_distrib2 ~> right_distrib 

544 
zdiff_zmult_distrib ~> left_diff_distrib 

545 
zdiff_zmult_distrib2 ~> right_diff_distrib 

546 
zmult_1 ~> mult_1_left 

547 
zmult_1_right ~> mult_1_right 

548 
zle_refl ~> order_refl 

549 
zle_trans ~> order_trans 

550 
zle_antisym ~> order_antisym 

551 
zle_linear ~> linorder_linear 

552 
zless_linear ~> linorder_less_linear 

553 
zadd_left_mono ~> add_left_mono 

554 
zadd_strict_right_mono ~> add_strict_right_mono 

555 
zadd_zless_mono ~> add_less_le_mono 

556 
int_0_less_1 ~> zero_less_one 

557 
int_0_neq_1 ~> zero_neq_one 

558 
zless_le ~> less_le 

559 
zpower_zadd_distrib ~> power_add 

560 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

561 
zero_le_zpower_abs ~> zero_le_power_abs 

562 

563 
* Theory Deriv: Renamed 

564 

565 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

566 

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

568 

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

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

573 
INCOMPATIBILITY. 

574 

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

577 

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

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

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

582 
follows: 

47452  583 

584 
Operations: 

585 
bulkload > rbt_bulkload 

586 
del_from_left > rbt_del_from_left 

587 
del_from_right > rbt_del_from_right 

588 
del > rbt_del 

589 
delete > rbt_delete 

590 
ins > rbt_ins 

591 
insert > rbt_insert 

592 
insertw > rbt_insert_with 

593 
insert_with_key > rbt_insert_with_key 

594 
map_entry > rbt_map_entry 

595 
lookup > rbt_lookup 

596 
sorted > rbt_sorted 

597 
tree_greater > rbt_greater 

598 
tree_less > rbt_less 

599 
tree_less_symbol > rbt_less_symbol 

600 
union > rbt_union 

601 
union_with > rbt_union_with 

602 
union_with_key > rbt_union_with_key 

603 

604 
Lemmas: 

605 
balance_left_sorted > balance_left_rbt_sorted 

606 
balance_left_tree_greater > balance_left_rbt_greater 

607 
balance_left_tree_less > balance_left_rbt_less 

608 
balance_right_sorted > balance_right_rbt_sorted 

609 
balance_right_tree_greater > balance_right_rbt_greater 

610 
balance_right_tree_less > balance_right_rbt_less 

611 
balance_sorted > balance_rbt_sorted 

612 
balance_tree_greater > balance_rbt_greater 

613 
balance_tree_less > balance_rbt_less 

614 
bulkload_is_rbt > rbt_bulkload_is_rbt 

615 
combine_sorted > combine_rbt_sorted 

616 
combine_tree_greater > combine_rbt_greater 

617 
combine_tree_less > combine_rbt_less 

618 
delete_in_tree > rbt_delete_in_tree 

619 
delete_is_rbt > rbt_delete_is_rbt 

620 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

621 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

622 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

623 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

624 
del_in_tree > rbt_del_in_tree 

625 
del_inv1_inv2 > rbt_del_inv1_inv2 

626 
del_sorted > rbt_del_rbt_sorted 

627 
del_tree_greater > rbt_del_rbt_greater 

628 
del_tree_less > rbt_del_rbt_less 

629 
dom_lookup_Branch > dom_rbt_lookup_Branch 

630 
entries_lookup > entries_rbt_lookup 

631 
finite_dom_lookup > finite_dom_rbt_lookup 

632 
insert_sorted > rbt_insert_rbt_sorted 

633 
insertw_is_rbt > rbt_insertw_is_rbt 

634 
insertwk_is_rbt > rbt_insertwk_is_rbt 

635 
insertwk_sorted > rbt_insertwk_rbt_sorted 

636 
insertw_sorted > rbt_insertw_rbt_sorted 

637 
ins_sorted > ins_rbt_sorted 

638 
ins_tree_greater > ins_rbt_greater 

639 
ins_tree_less > ins_rbt_less 

640 
is_rbt_sorted > is_rbt_rbt_sorted 

641 
lookup_balance > rbt_lookup_balance 

642 
lookup_bulkload > rbt_lookup_rbt_bulkload 

643 
lookup_delete > rbt_lookup_rbt_delete 

644 
lookup_Empty > rbt_lookup_Empty 

645 
lookup_from_in_tree > rbt_lookup_from_in_tree 

646 
lookup_in_tree > rbt_lookup_in_tree 

647 
lookup_ins > rbt_lookup_ins 

648 
lookup_insert > rbt_lookup_rbt_insert 

649 
lookup_insertw > rbt_lookup_rbt_insertw 

650 
lookup_insertwk > rbt_lookup_rbt_insertwk 

651 
lookup_keys > rbt_lookup_keys 

652 
lookup_map > rbt_lookup_map 

653 
lookup_map_entry > rbt_lookup_rbt_map_entry 

654 
lookup_tree_greater > rbt_lookup_rbt_greater 

655 
lookup_tree_less > rbt_lookup_rbt_less 

656 
lookup_union > rbt_lookup_rbt_union 

657 
map_entry_color_of > rbt_map_entry_color_of 

658 
map_entry_inv1 > rbt_map_entry_inv1 

659 
map_entry_inv2 > rbt_map_entry_inv2 

660 
map_entry_is_rbt > rbt_map_entry_is_rbt 

661 
map_entry_sorted > rbt_map_entry_rbt_sorted 

662 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

663 
map_entry_tree_less > rbt_map_entry_rbt_less 

664 
map_tree_greater > map_rbt_greater 

665 
map_tree_less > map_rbt_less 

666 
map_sorted > map_rbt_sorted 

667 
paint_sorted > paint_rbt_sorted 

668 
paint_lookup > paint_rbt_lookup 

669 
paint_tree_greater > paint_rbt_greater 

670 
paint_tree_less > paint_rbt_less 

671 
sorted_entries > rbt_sorted_entries 

672 
tree_greater_eq_trans > rbt_greater_eq_trans 

673 
tree_greater_nit > rbt_greater_nit 

674 
tree_greater_prop > rbt_greater_prop 

675 
tree_greater_simps > rbt_greater_simps 

676 
tree_greater_trans > rbt_greater_trans 

677 
tree_less_eq_trans > rbt_less_eq_trans 

678 
tree_less_nit > rbt_less_nit 

679 
tree_less_prop > rbt_less_prop 

680 
tree_less_simps > rbt_less_simps 

681 
tree_less_trans > rbt_less_trans 

682 
tree_ord_props > rbt_ord_props 

683 
union_Branch > rbt_union_Branch 

684 
union_is_rbt > rbt_union_is_rbt 

685 
unionw_is_rbt > rbt_unionw_is_rbt 

686 
unionwk_is_rbt > rbt_unionwk_is_rbt 

687 
unionwk_sorted > rbt_unionwk_rbt_sorted 

688 

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

691 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  692 

693 
Changed Operations: 

47622  694 
float_abs > abs 
695 
float_nprt > nprt 

696 
float_pprt > pprt 

697 
pow2 > use powr 

698 
round_down > float_round_down 

699 
round_up > float_round_up 

700 
scale > exponent 

701 

702 
Removed Operations: 

703 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

704 

705 
Renamed Lemmas: 

706 
abs_float_def > Float.compute_float_abs 

707 
bitlen_ge0 > bitlen_nonneg 

708 
bitlen.simps > Float.compute_bitlen 

709 
float_components > Float_mantissa_exponent 

710 
float_divl.simps > Float.compute_float_divl 

711 
float_divr.simps > Float.compute_float_divr 

712 
float_eq_odd > mult_powr_eq_mult_powr_iff 

713 
float_power > real_of_float_power 

714 
lapprox_posrat_def > Float.compute_lapprox_posrat 

715 
lapprox_rat.simps > Float.compute_lapprox_rat 

716 
le_float_def' > Float.compute_float_le 

717 
le_float_def > less_eq_float.rep_eq 

718 
less_float_def' > Float.compute_float_less 

719 
less_float_def > less_float.rep_eq 

720 
normfloat_def > Float.compute_normfloat 

721 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

722 
normfloat > normfloat_def 

723 
normfloat_unique > use normfloat_def 

724 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

725 
one_float_def > Float.compute_float_one 

726 
plus_float_def > Float.compute_float_plus 

727 
rapprox_posrat_def > Float.compute_rapprox_posrat 

728 
rapprox_rat.simps > Float.compute_rapprox_rat 

729 
real_of_float_0 > zero_float.rep_eq 

730 
real_of_float_1 > one_float.rep_eq 

731 
real_of_float_abs > abs_float.rep_eq 

732 
real_of_float_add > plus_float.rep_eq 

733 
real_of_float_minus > uminus_float.rep_eq 

734 
real_of_float_mult > times_float.rep_eq 

735 
real_of_float_simp > Float.rep_eq 

736 
real_of_float_sub > minus_float.rep_eq 

737 
round_down.simps > Float.compute_float_round_down 

738 
round_up.simps > Float.compute_float_round_up 

739 
times_float_def > Float.compute_float_times 

740 
uminus_float_def > Float.compute_float_uminus 

741 
zero_float_def > Float.compute_float_zero 

742 

743 
Lemmas not necessary anymore, use the transfer method: 

744 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

745 
float_divr, float_le_simp, float_less1_mantissa_bound, 

746 
float_less_simp, float_less_zero, float_le_zero, 

747 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

748 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

749 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

750 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

751 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

752 
round_up, zero_le_float, zero_less_float 

47616  753 

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

45791  756 

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

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

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

761 

762 
* Session HOLWord: Discontinued many redundant theorems specific to 

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

764 
instead. 

765 

766 
word_sub_alt ~> word_sub_wi 

767 
word_add_alt ~> word_add_def 

768 
word_mult_alt ~> word_mult_def 

769 
word_minus_alt ~> word_minus_def 

770 
word_0_alt ~> word_0_wi 

771 
word_1_alt ~> word_1_wi 

772 
word_add_0 ~> add_0_left 

773 
word_add_0_right ~> add_0_right 

774 
word_mult_1 ~> mult_1_left 

775 
word_mult_1_right ~> mult_1_right 

776 
word_add_commute ~> add_commute 

777 
word_add_assoc ~> add_assoc 

778 
word_add_left_commute ~> add_left_commute 

779 
word_mult_commute ~> mult_commute 

780 
word_mult_assoc ~> mult_assoc 

781 
word_mult_left_commute ~> mult_left_commute 

782 
word_left_distrib ~> left_distrib 

783 
word_right_distrib ~> right_distrib 

784 
word_left_minus ~> left_minus 

785 
word_diff_0_right ~> diff_0_right 

786 
word_diff_self ~> diff_self 

787 
word_sub_def ~> diff_minus 

788 
word_diff_minus ~> diff_minus 

789 
word_add_ac ~> add_ac 

790 
word_mult_ac ~> mult_ac 

791 
word_plus_ac0 ~> add_0_left add_0_right add_ac 

792 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 

793 
word_order_trans ~> order_trans 

794 
word_order_refl ~> order_refl 

795 
word_order_antisym ~> order_antisym 

796 
word_order_linear ~> linorder_linear 

797 
lenw1_zero_neq_one ~> zero_neq_one 

798 
word_number_of_eq ~> number_of_eq 

799 
word_of_int_add_hom ~> wi_hom_add 

800 
word_of_int_sub_hom ~> wi_hom_sub 

801 
word_of_int_mult_hom ~> wi_hom_mult 

802 
word_of_int_minus_hom ~> wi_hom_neg 

803 
word_of_int_succ_hom ~> wi_hom_succ 

804 
word_of_int_pred_hom ~> wi_hom_pred 

805 
word_of_int_0_hom ~> word_0_wi 

806 
word_of_int_1_hom ~> word_1_wi 

807 

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

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

811 
multiplication, shifting by constants, bitwise operators and numeric 

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

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

816 

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

819 
measure_space. The locales based on subset_class now have two 

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

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

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

825 
Measure space constructions for distributions and densities now got 

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

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

828 
and point_measure is introduced. INCOMPATIBILITY. 

47694  829 

830 
Renamed constants: 

831 
measure > emeasure 

832 
finite_measure.\<mu>' > measure 

833 
product_algebra_generator > prod_algebra 

834 
product_prob_space.emb > prod_emb 

835 
product_prob_space.infprod_algebra > PiM 

836 

837 
Removed locales: 

838 
completeable_measure_space 

839 
finite_measure_space 

840 
finite_prob_space 

841 
finite_product_finite_prob_space 

842 
finite_product_sigma_algebra 

843 
finite_sigma_algebra 

844 
measure_space 

845 
pair_finite_prob_space 

846 
pair_finite_sigma_algebra 

847 
pair_finite_space 

848 
pair_sigma_algebra 

849 
product_sigma_algebra 

850 

851 
Removed constants: 

47751  852 
conditional_space 
47694  853 
distribution > use distr measure, or distributed predicate 
47751  854 
image_space 
47694  855 
joint_distribution > use distr measure, or distributed predicate 
47751  856 
pair_measure_generator 
47694  857 
product_prob_space.infprod_algebra > use PiM 
858 
subvimage 

859 

860 
Replacement theorems: 

47751  861 
finite_additivity_sufficient > ring_of_sets.countably_additiveI_finite 
862 
finite_measure.empty_measure > measure_empty 

863 
finite_measure.finite_continuity_from_above > finite_measure.finite_Lim_measure_decseq 

864 
finite_measure.finite_continuity_from_below > finite_measure.finite_Lim_measure_incseq 

865 
finite_measure.finite_measure_countably_subadditive > finite_measure.finite_measure_subadditive_countably 

866 
finite_measure.finite_measure_eq > finite_measure.emeasure_eq_measure 

867 
finite_measure.finite_measure > finite_measure.emeasure_finite 

868 
finite_measure.finite_measure_finite_singleton > finite_measure.finite_measure_eq_setsum_singleton 

869 
finite_measure.positive_measure' > measure_nonneg 

870 
finite_measure.real_measure > finite_measure.emeasure_real 

871 
finite_product_prob_space.finite_measure_times > finite_product_prob_space.finite_measure_PiM_emb 

872 
finite_product_sigma_algebra.in_P > sets_PiM_I_finite 

873 
finite_product_sigma_algebra.P_empty > space_PiM_empty, sets_PiM_empty 

874 
information_space.conditional_entropy_eq > information_space.conditional_entropy_simple_distributed 

875 
information_space.conditional_entropy_positive > information_space.conditional_entropy_nonneg_simple 

876 
information_space.conditional_mutual_information_eq_mutual_information > information_space.conditional_mutual_information_eq_mutual_information_simple 

877 
information_space.conditional_mutual_information_generic_positive > information_space.conditional_mutual_information_nonneg_simple 

878 
information_space.conditional_mutual_information_positive > information_space.conditional_mutual_information_nonneg_simple 

879 
information_space.entropy_commute > information_space.entropy_commute_simple 

880 
information_space.entropy_eq > information_space.entropy_simple_distributed 

881 
information_space.entropy_generic_eq > information_space.entropy_simple_distributed 

882 
information_space.entropy_positive > information_space.entropy_nonneg_simple 

883 
information_space.entropy_uniform_max > information_space.entropy_uniform 

884 
information_space.KL_eq_0_imp > information_space.KL_eq_0_iff_eq 

885 
information_space.KL_eq_0 > information_space.KL_same_eq_0 

886 
information_space.KL_ge_0 > information_space.KL_nonneg 

887 
information_space.mutual_information_eq > information_space.mutual_information_simple_distributed 

888 
information_space.mutual_information_positive > information_space.mutual_information_nonneg_simple 

889 
Int_stable_cuboids > Int_stable_atLeastAtMost 

890 
Int_stable_product_algebra_generator > positive_integral 

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

47694  892 
measure_space.additive > emeasure_additive 
47751  893 
measure_space.AE_iff_null_set > AE_iff_null 
894 
measure_space.almost_everywhere_def > eventually_ae_filter 

895 
measure_space.almost_everywhere_vimage > AE_distrD 

896 
measure_space.continuity_from_above > INF_emeasure_decseq 

897 
measure_space.continuity_from_above_Lim > Lim_emeasure_decseq 

898 
measure_space.continuity_from_below_Lim > Lim_emeasure_incseq 

47694  899 
measure_space.continuity_from_below > SUP_emeasure_incseq 
47751  900 
measure_space_density > emeasure_density 
901 
measure_space.density_is_absolutely_continuous > absolutely_continuousI_density 

902 
measure_space.integrable_vimage > integrable_distr 

903 
measure_space.integral_translated_density > integral_density 

904 
measure_space.integral_vimage > integral_distr 

905 
measure_space.measure_additive > plus_emeasure 

906 
measure_space.measure_compl > emeasure_compl 

907 
measure_space.measure_countable_increasing > emeasure_countable_increasing 

908 
measure_space.measure_countably_subadditive > emeasure_subadditive_countably 

47694  909 
measure_space.measure_decseq > decseq_emeasure 
47751  910 
measure_space.measure_Diff > emeasure_Diff 
911 
measure_space.measure_Diff_null_set > emeasure_Diff_null_set 

47694  912 
measure_space.measure_eq_0 > emeasure_eq_0 
913 
measure_space.measure_finitely_subadditive > emeasure_subadditive_finite 

47751  914 
measure_space.measure_finite_singleton > emeasure_eq_setsum_singleton 
915 
measure_space.measure_incseq > incseq_emeasure 

916 
measure_space.measure_insert > emeasure_insert 

917 
measure_space.measure_mono > emeasure_mono 

918 
measure_space.measure_not_negative > emeasure_not_MInf 

919 
measure_space.measure_preserving_Int_stable > measure_eqI_generator_eq 

920 
measure_space.measure_setsum > setsum_emeasure 

921 
measure_space.measure_setsum_split > setsum_emeasure_cover 

47694  922 
measure_space.measure_space_vimage > emeasure_distr 
47751  923 
measure_space.measure_subadditive_finite > emeasure_subadditive_finite 
924 
measure_space.measure_subadditive > subadditive 

925 
measure_space.measure_top > emeasure_space 

926 
measure_space.measure_UN_eq_0 > emeasure_UN_eq_0 

927 
measure_space.measure_Un_null_set > emeasure_Un_null_set 

928 
measure_space.positive_integral_translated_density > positive_integral_density 

929 
measure_space.positive_integral_vimage > positive_integral_distr 

47694  930 
measure_space.real_continuity_from_above > Lim_measure_decseq 
47751  931 
measure_space.real_continuity_from_below > Lim_measure_incseq 
47694  932 
measure_space.real_measure_countably_subadditive > measure_subadditive_countably 
47751  933 
measure_space.real_measure_Diff > measure_Diff 
934 
measure_space.real_measure_finite_Union > measure_finite_Union 

935 
measure_space.real_measure_setsum_singleton > measure_eq_setsum_singleton 

936 
measure_space.real_measure_subadditive > measure_subadditive 

937 
measure_space.real_measure_Union > measure_Union 

938 
measure_space.real_measure_UNION > measure_UNION 

47694  939 
measure_space.simple_function_vimage > simple_function_comp 
940 
measure_space.simple_integral_vimage > simple_integral_distr 

47751  941 
measure_space.simple_integral_vimage > simple_integral_distr 
942 
measure_unique_Int_stable > measure_eqI_generator_eq 

943 
measure_unique_Int_stable_vimage > measure_eqI_generator_eq 

47694  944 
pair_sigma_algebra.measurable_cut_fst > sets_Pair1 
945 
pair_sigma_algebra.measurable_cut_snd > sets_Pair2 

946 
pair_sigma_algebra.measurable_pair_image_fst > measurable_Pair1 

947 
pair_sigma_algebra.measurable_pair_image_snd > measurable_Pair2 

948 
pair_sigma_algebra.measurable_product_swap > measurable_pair_swap_iff 

949 
pair_sigma_algebra.pair_sigma_algebra_measurable > measurable_pair_swap 

950 
pair_sigma_algebra.pair_sigma_algebra_swap_measurable > measurable_pair_swap' 

951 
pair_sigma_algebra.sets_swap > sets_pair_swap 

47751  952 
pair_sigma_finite.measure_cut_measurable_fst > pair_sigma_finite.measurable_emeasure_Pair1 
953 
pair_sigma_finite.measure_cut_measurable_snd > pair_sigma_finite.measurable_emeasure_Pair2 

954 
pair_sigma_finite.measure_preserving_swap > pair_sigma_finite.distr_pair_swap 

955 
pair_sigma_finite.pair_measure_alt2 > pair_sigma_finite.emeasure_pair_measure_alt2 

956 
pair_sigma_finite.pair_measure_alt > pair_sigma_finite.emeasure_pair_measure_alt 

957 
pair_sigma_finite.pair_measure_times > pair_sigma_finite.emeasure_pair_measure_Times 

958 
prob_space.indep_distribution_eq_measure > prob_space.indep_vars_iff_distr_eq_PiM 

959 
prob_space.indep_var_distributionD > prob_space.indep_var_distribution_eq 

47694  960 
prob_space.measure_space_1 > prob_space.emeasure_space_1 
961 
prob_space.prob_space_vimage > prob_space_distr 

962 
prob_space.random_variable_restrict > measurable_restrict 

47751  963 
prob_space_unique_Int_stable > measure_eqI_prob_space 
964 
product_algebraE > prod_algebraE_all 

965 
product_algebra_generator_der > prod_algebra_eq_finite 

966 
product_algebra_generator_into_space > prod_algebra_sets_into_space 

967 
product_algebraI > sets_PiM_I_finite 

968 
product_measure_exists > product_sigma_finite.sigma_finite 

47694  969 
product_prob_space.finite_index_eq_finite_product > product_prob_space.sets_PiM_generator 
970 
product_prob_space.finite_measure_infprod_emb_Pi > product_prob_space.measure_PiM_emb 

971 
product_prob_space.infprod_spec > product_prob_space.emeasure_PiM_emb_not_empty 

972 
product_prob_space.measurable_component > measurable_component_singleton 

973 
product_prob_space.measurable_emb > measurable_prod_emb 

974 
product_prob_space.measurable_into_infprod_algebra > measurable_PiM_single 

975 
product_prob_space.measurable_singleton_infprod > measurable_component_singleton 

976 
product_prob_space.measure_emb > emeasure_prod_emb 

47751  977 
product_prob_space.measure_preserving_restrict > product_prob_space.distr_restrict 
978 
product_sigma_algebra.product_algebra_into_space > space_closed 

979 
product_sigma_finite.measure_fold > product_sigma_finite.distr_merge 

980 
product_sigma_finite.measure_preserving_component_singelton > product_sigma_finite.distr_singleton 

981 
product_sigma_finite.measure_preserving_merge > product_sigma_finite.distr_merge 

47694  982 
sequence_space.measure_infprod > sequence_space.measure_PiM_countable 
47751  983 
sets_product_algebra > sets_PiM 
984 
sigma_algebra.measurable_sigma > measurable_measure_of 

985 
sigma_finite_measure.disjoint_sigma_finite > sigma_finite_disjoint 

986 
sigma_finite_measure.RN_deriv_vimage > sigma_finite_measure.RN_deriv_distr 

987 
sigma_product_algebra_sigma_eq > sigma_prod_algebra_sigma_eq 

988 
space_product_algebra > space_PiM 

47694  989 

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

47413  992 

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

993 

45160  994 
*** FOL *** 
995 

45383  996 
* New "case_product" attribute (see HOL). 
45160  997 

45109  998 

47463  999 
*** ZF *** 
1000 

1001 
* Greater support for structured proofs involving induction or case 

1002 
analysis. 

1003 

1004 
* Much greater use of mathematical symbols. 

1005 

1006 
* Removal of many ML theorem bindings. INCOMPATIBILITY. 

1007 

1008 

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

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

1010 

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

1013 

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

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

1015 
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

1016 
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

1017 

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

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

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

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

1021 
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

1022 
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

1023 
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

1024 
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

1025 
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

1026 

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

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

1028 
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

1029 

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

1032 
declarations like Local_Theory.note. 

1033 

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

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

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

1036 

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

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

1038 
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

1039 
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

1040 

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

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

1042 

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

1043 
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

1044 
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

1045 
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

1046 
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

1047 
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

1048 
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

1049 
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

1050 
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

1051 
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

1052 
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

1053 
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

1054 
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

1055 

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

1056 

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

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

1058 

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

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

1060 
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

1061 
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

1062 
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

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

1064 
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

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

1066 

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

1069 

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

1072 

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

1073 

45109  1074 

44801  1075 
New in Isabelle20111 (October 2011) 
1076 
 

41651  1077 

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

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

1079 

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

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

1086 

44777  1087 
 Markup of formal entities within the text buffer, with semantic 
44760  1088 
highlighting, tooltips and hyperlinks to jump to defining source 
1089 
positions. 

1090 

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

1093 
theory output and other nonIsabelle text boxes). 

1094 

1095 
 Refined scheduling of proof checking and printing of results, 

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

1098 

44777  1099 
 Reduced CPU performance requirements, usable on machines with few 
44760  1100 
cores. 
1101 

44777  1102 
 Reduced memory requirements due to pruning of unused document 
44760  1103 
versions (garbage collection). 
1104 

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

1106 
including some remaining limitations. 

1107 

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

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

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

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

1113 
INCOMPATIBILITY. 

1114 

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

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

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

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

1118 

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

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

1120 
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

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

1122 

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

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

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

1125 

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

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

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

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

1129 

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

1130 
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

1131 

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

1132 
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

1133 

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

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

1137 

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

1140 

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

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

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

1145 
"Classical Reasoner". 

42633  1146 

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

1147 

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

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

1149 

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

1152 

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

1156 
Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in 

1157 
class complete_linorder. 

1158 

1159 
Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def, 

1160 
Sup_fun_def, Inf_apply, Sup_apply. 

1161 

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

1164 

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

1165 
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

1166 
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

1167 
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

1168 
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

1169 
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

1170 
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

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

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

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

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

1175 
INF_subset ~> INF_superset_mono [OF _ order_refl] 
44800  1176 

1177 
More consistent and comprehensive names: 

1178 

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

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

1180 
UNION_eq_Union_image ~> SUP_def 
43872  1181 
INFI_def ~> INF_def 
1182 
SUPR_def ~> SUP_def 

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

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

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

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

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

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

1188 
SUP_leI ~> SUP_least 
43873  1189 
INFI_bool_eq ~> INF_bool_eq 
1190 
SUPR_bool_eq ~> SUP_bool_eq 

1191 
INFI_apply ~> INF_apply 

1192 
SUPR_apply ~> SUP_apply 

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

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

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

1195 

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

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

1197 

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

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

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

1200 

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

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

1202 
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

1203 
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

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

1205 

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

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

1207 
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

1208 
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

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

1210 

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

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

1214 

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

1217 
UN_ball_bex_simps. INCOMPATIBILITY. 

1218 

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

1220 
separate type class floor_ceiling. 

1221 

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

42874  1223 

1224 
locale fun_left_comm ~> locale comp_fun_commute 

1225 
locale fun_left_comm_idem ~> locale comp_fun_idem 

44800  1226 

1227 
Both use pointfree characterization; interpretation proofs may need 

1228 
adjustment. INCOMPATIBILITY. 

42874  1229 

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

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

1232 

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

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

1236 
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

1237 

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

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

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

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

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

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

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

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

1245 

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

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

1248 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1268 
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

1269 
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

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

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

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

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

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

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

1276 
exp_ln_eq ~> ln_unique 
44711  1277 
expi_add ~> exp_add 
1278 
expi_zero ~> exp_zero 

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

1279 
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

1280 
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

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

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

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

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

1285 
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

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

1287 
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

1288 
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

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

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

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

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

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

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

1295 
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

1296 
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

1297 
LIMSEQ_imp_rabs ~> tendsto_rabs 
44710  1298 
LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus] 
1299 
LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const] 

1300 
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

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

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

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

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

1305 
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

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

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

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

1309 
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

1310 
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

1311 
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

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

1313 
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

1314 
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

1315 
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

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

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

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

1319 
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

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

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

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

1323 
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

1324 
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

1325 
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

1326 
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

1327 
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

1328 
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

1329 
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

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

1331 

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

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

42484  1335 

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

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

1339 

44968  1340 
* Code generation: 
1341 

1342 
 Theory Library/Code_Char_ord provides native ordering of 

1343 
characters in the target language. 

1344 

1345 
 Commands code_module and code_library are legacy, use export_code 

1346 
instead. 

1347 

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

1349 

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

1351 
reactivated by the following theory command: 

1352 

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

1354 

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

1356 

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

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

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

1361 
syntax. 

1362 

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

1365 

1366 
* Nitpick: 

1367 
 Added "need" and "total_consts" options. 

1368 
 Reintroduced "show_skolems" option by popular demand. 

1369 
 Renamed attribute: nitpick_def ~> nitpick_unfold. 

1370 
INCOMPATIBILITY. 

1371 

1372 
* Sledgehammer: 

1373 
 Use quasisound (and efficient) translations by default. 

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

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

1376 
 Automatically preplay and minimize proofs before showing them if 

1377 
this can be done within reasonable time. 

1378 
 sledgehammer available_provers ~> sledgehammer supported_provers. 

1379 
INCOMPATIBILITY. 

1380 
 Added "preplay_timeout", "slicing", "type_enc", "sound", 

1381 
"max_mono_iters", and "max_new_mono_instances" options. 

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

1383 
Types" Proof General menu item. INCOMPATIBILITY. 

1384 

1385 
* Metis: 

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

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

1388 
INCOMPATIBILITY. 

1389 

1390 
* Command 'try': 

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

1392 
"elim:" options. INCOMPATIBILITY. 

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

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

1395 

1396 
* Quickcheck: 

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

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

1399 
 Added postprocessing of terms to obtain readable counterexamples 

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

1401 
 New counterexample generator quickcheck[narrowing] enables 

1402 
narrowingbased testing. Requires the Glasgow Haskell compiler 

1403 
with its installation location defined in the Isabelle settings 

1404 
environment as ISABELLE_GHC. 

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

1406 
(formly in HOL/Library). 

1407 

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

1409 
use 'partial_function' instead. 

1410 

1411 
* Theory Library/Extended_Reals replaces now the positive extended 

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

1413 
Multivariate_Analysis/Extended_Real_Limits. 

1414 

44974  1415 
* Theory Library/Old_Recdef: old 'recdef' package has been moved here, 
1416 
from where it must be imported explicitly if it is really required. 

1417 
INCOMPATIBILITY. 

44968  1418 

1419 
* Theory Library/Wfrec: wellfounded recursion combinator "wfrec" has 

1420 
been moved here. INCOMPATIBILITY. 

1421 

1422 
* Theory Library/Saturated provides type of numbers with saturated 

1423 
arithmetic. 

1424 

52744e144432
some tuning and reordering for re 