author  wenzelm 
Fri, 06 Jul 2012 16:20:54 +0200  
changeset 48205  09c2a3d9aa22 
parent 48171  28a6d67c93f0 
child 48206  937b53a339f0 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

47887  4 
New in this Isabelle version 
5 
 

6 

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

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

8 

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

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

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

11 

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

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

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

14 

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

15 

48205  16 
*** Pure *** 
17 

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

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

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

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

22 
with some care where this is really required. 

23 

24 

48171
28a6d67c93f0
default for \<euro> is now based on eurosym package, instead of slightly exotic babel/greek (which causes problems with the Gentoo installation on lxbroy2);
wenzelm
parents:
48120
diff
changeset

25 
*** Document preparation *** 
28a6d67c93f0
default for \<euro> is now based on eurosym package, instead of slightly exotic babel/greek (which causes problems with the Gentoo installation on lxbroy2);
wenzelm
parents:
48120
diff
changeset

26 

28a6d67c93f0
default for \<euro> is now based on eurosym package, instead of slightly exotic babel/greek (which causes problems with the Gentoo installation on lxbroy2);
wenzelm
parents:
48120
diff
changeset

27 
* Default for \<euro> is now based on eurosym package, instead of 
28a6d67c93f0
default for \<euro> is now based on eurosym package, instead of slightly exotic babel/greek (which causes problems with the Gentoo installation on lxbroy2);
wenzelm
parents:
48120
diff
changeset

28 
slightly exotic babel/greek. 
28a6d67c93f0
default for \<euro> is now based on eurosym package, instead of slightly exotic babel/greek (which causes problems with the Gentoo installation on lxbroy2);
wenzelm
parents:
48120
diff
changeset

29 

28a6d67c93f0
default for \<euro> is now based on eurosym package, instead of slightly exotic babel/greek (which causes problems with the Gentoo installation on lxbroy2);
wenzelm
parents:
48120
diff
changeset

30 

47979  31 
*** System *** 
32 

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

34 
without exception positions and advanced ML compiler/toplevel 

35 
configuration. 

36 

37 

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

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

39 

48111  40 
* Simproc for rewriting set comprehensions into pointfree expressions 
41 

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

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

43 

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

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

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

46 
the configuration quickcheck_optimise_equality to false. 
47887  47 

48069
e9b2782c4f99
restricted Z3 by default to a fragment where proof reconstruction should not fail (for better integration with Sledgehammer)  the full set of supported Z3 features can still be used by enabling the configuration option "z3_with_extensions"
boehmes
parents:
48013
diff
changeset

48 
* The SMT solver Z3 has now by default a restricted set of directly 
e9b2782c4f99
restricted Z3 by default to a fragment where proof reconstruction should not fail (for better integration with Sledgehammer)  the full set of supported Z3 features can still be used by enabling the configuration option "z3_with_extensions"
boehmes
parents:
48013
diff
changeset

49 
supported features. For the full set of features (div/mod, nonlinear 
e9b2782c4f99
restricted Z3 by default to a fragment where proof reconstruction should not fail (for better integration with Sledgehammer)  the full set of supported Z3 features can still be used by enabling the configuration option "z3_with_extensions"
boehmes
parents:
48013
diff
changeset

50 
arithmetic, datatypes/records) with potential proof reconstruction 
e9b2782c4f99
restricted Z3 by default to a fragment where proof reconstruction should not fail (for better integration with Sledgehammer)  the full set of supported Z3 features can still be used by enabling the configuration option "z3_with_extensions"
boehmes
parents:
48013
diff
changeset

51 
failures, enable the configuration option "z3_with_extensions". 
e9b2782c4f99
restricted Z3 by default to a fragment where proof reconstruction should not fail (for better integration with Sledgehammer)  the full set of supported Z3 features can still be used by enabling the configuration option "z3_with_extensions"
boehmes
parents:
48013
diff
changeset

52 
Minor INCOMPATIBILITY. 
e9b2782c4f99
restricted Z3 by default to a fragment where proof reconstruction should not fail (for better integration with Sledgehammer)  the full set of supported Z3 features can still be used by enabling the configuration option "z3_with_extensions"
boehmes
parents:
48013
diff
changeset

53 

48094  54 
* Sledgehammer: 
55 

56 
 Rationalized type encodings ("type_enc" option). 

57 

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

58 

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

59 

47462  60 
New in Isabelle2012 (May 2012) 
61 
 

45109  62 

45593  63 
*** General *** 
64 

45614  65 
* Prover IDE (PIDE) improvements: 
66 

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

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

45614  74 

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

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

46485  78 

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

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

80 
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

81 
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

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

83 
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

84 

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

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

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

87 
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

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

89 

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

90 
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

91 

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

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

93 

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

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

95 

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

96 
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

97 
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

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

99 

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

100 
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

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

102 

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

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

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

47484  108 

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

111 
oldstyle "standard" after instantiation or composition of facts 

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

113 
indices of schematic variables. 

114 

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

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

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

118 
the historic accident of dynamic reevaluation in interpretations 

119 
etc. was exploited. 

120 

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

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

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

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

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

126 
of the material of that old tutorial. 

127 

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

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

130 
manual. 

131 

132 

133 
*** Pure *** 

134 

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

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

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

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

138 

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

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

142 
undocumented feature.) 

143 

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

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

147 

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

149 

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

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

152 

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

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

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

156 
order to accommodate newly introduced premises.) 

157 

47806  158 
* Renamed some inner syntax categories: 
159 

160 
num ~> num_token 

161 
xnum ~> xnum_token 

162 
xstr ~> str_token 

163 

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

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

166 
position information via constraints). 

167 

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

170 
manual. Minor INCOMPATIBILITY. 

171 

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

45134  174 

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

177 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  178 

47464  179 
* Redundant attribute "code_inline" has been discontinued. Use 
180 
"code_unfold" instead. INCOMPATIBILITY. 

181 

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

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

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

184 

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

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

186 

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

187 
INCOMPATIBILITY. 
45383  188 

47856  189 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
190 
instead. INCOMPATIBILITY. 

191 

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

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

194 
legacy since Isabelle2011). 

47855  195 

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

196 

45122  197 
*** HOL *** 
198 

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

201 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

206 
tinkering with former theorems mem_def and Collect_def as far as 

207 
possible. 

208 

209 
For developments which deliberately mix predicates and sets, a 

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

212 
Isabelle20111 before jumping right into the current release. 

213 

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

216 

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

218 

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

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

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

224 
user theories may require adaptations as follows: 

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

225 

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

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

227 
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

228 

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

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

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

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

232 

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

233 
 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

234 
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

235 

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

236 
 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

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

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

239 

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

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

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

242 

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

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

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

247 
corresponding parts of the Quotient package.) 

47809  248 

249 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

251 
relate different type instances of the same polymorphic constant, 

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

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

254 

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

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

257 

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

259 
equivalent subgoal on the corresponding raw types. Constants are 

260 
replaced with corresponding ones according to the transfer rules. 

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

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

266 

267 
 relator_eq attribute: Collects identity laws for relators of 

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

269 
transfer method uses these lemmas to infer transfer rules for 

270 
nonpolymorphic constants on the fly. 

271 

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

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

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

275 
after unfolding the constant definitions. 

276 

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

278 
from type nat to type int. 

279 

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

47809  282 

283 
 lift_definition command: Defines operations on an abstract type in 

284 
terms of a corresponding operation on a representation 

285 
type. Example syntax: 

286 

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

288 
is List.insert 

289 

290 
Users must discharge a respectfulness proof obligation when each 

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

292 
the proof is discharged automatically.) The obligation is 

293 
presented in a userfriendly, readable form; a respectfulness 

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

295 
by the package. 

296 

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

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

299 
lift_definition generates a code certificate theorem and sets up 

300 
code generation for each constant. 

301 

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

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

304 
or a type_definition theorem. The package configures transfer 

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

306 
lift_definition command to work with the type. 

307 

308 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  309 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
310 
Word/Word.thy and Library/Float.thy. 

47809  311 

312 
* Quotient package: 

313 

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

315 
rep and abs functions, similar to typedef. 

316 

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

318 
Transfer packages, as with 'setup_lifting'. 

319 

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

321 
respectfulness property at the point where the constant is 

322 
defined, similar to lift_definition; INCOMPATIBILITY. 

323 

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

325 
accordingly, INCOMPATIBILITY. 

326 

327 
* New diagnostic command 'find_unused_assms' to find potentially 

328 
superfluous assumptions in theorems using Quickcheck. 

329 

330 
* Quickcheck: 

331 

332 
 Quickcheck returns variable assignments as counterexamples, which 

333 
allows to reveal the underspecification of functions under test. 

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

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

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

337 

338 
These counterexample are marked as potentially spurious, as 

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

340 
obvious theorem "hd xs = hd xs". 

341 

342 
After finding a potentially spurious counterexample, Quickcheck 

343 
continues searching for genuine ones. 

344 

345 
By default, Quickcheck shows potentially spurious and genuine 

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

347 
show genuine counterexamples. 

348 

349 
 The command 'quickcheck_generator' creates random and exhaustive 

350 
value generators for a given type and operations. 

351 

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

353 
constructors of that type. 

354 

355 
 Support for multisets. 

356 

357 
 Added "use_subtype" options. 

358 

359 
 Added "quickcheck_locale" configuration to specify how to process 

360 
conjectures in a locale context. 

361 

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

47809  364 

365 
* Sledgehammer: 

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

367 
paper "More SPASS with Isabelle". 

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

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

370 
TFF1), iProver, iProverEq. 

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

372 
 Sped up the minimizer. 

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

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

375 
 Renamed "sound" option to "strict". 

376 

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

379 

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

381 

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

47809  383 

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

386 

387 
list.exhaust [case_product nat.exhaust] 

388 

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

390 
a list and a nat. 

391 

47809  392 
* New "eventually_elim" method as a generalized variant of the 
47855  393 
eventually_elim* rules. Supports structured proofs. 
394 

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

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

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

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

398 

47856  399 
* Record: code generation can be switched off manually with 
400 

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

402 

403 
* Datatype: type parameters allow explicit sort constraints. 

404 

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

407 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

409 
one_case. 

410 

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

412 
the result of the fact expression. 

413 

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

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

417 

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

418 
converse_def ~> converse_unfold 
47549  419 
rel_comp_def ~> relcomp_unfold 
47820  420 
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

421 
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

422 
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

423 
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

424 

46981  425 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
426 

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

47086  429 

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

430 
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

431 

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

46458  435 
rel_pow_1 ~> relpow_1 
46363  436 
rel_pow_0_I ~> relpow_0_I 
437 
rel_pow_Suc_I ~> relpow_Suc_I 

438 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

439 
rel_pow_0_E ~> relpow_0_E 

440 
rel_pow_Suc_E ~> relpow_Suc_E 

441 
rel_pow_E ~> relpow_E 

46458  442 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  443 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  444 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
445 
rel_pow_E2 ~> relpow_E2 

446 
rel_pow_add ~> relpow_add 

447 
rel_pow_commute ~> relpow 

448 
rel_pow_empty ~> relpow_empty: 

449 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

450 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

451 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

452 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

453 
rel_pow_fun_conv ~> relpow_fun_conv 

454 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

455 
rel_pow_finite_bounded ~> relpow_finite_bounded 

456 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

457 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

458 
single_valued_rel_pow ~> single_valued_relpow 

47463  459 

46363  460 
INCOMPATIBILITY. 
461 

47448  462 
* Theory Relation: Consolidated constant name for relation composition 
47464  463 
and corresponding theorem names: 
464 

47549  465 
 Renamed constant rel_comp to relcomp. 
47464  466 

47448  467 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  468 

47448  469 
 Renamed theorems: 
47464  470 

47448  471 
rel_compI ~> relcompI 
472 
rel_compEpair ~> relcompEpair 

473 
rel_compE ~> relcompE 

474 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

475 
rel_comp_empty1 ~> relcomp_empty1 

476 
rel_comp_mono ~> relcomp_mono 

477 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

478 
rel_comp_distrib ~> relcomp_distrib 

479 
rel_comp_distrib2 ~> relcomp_distrib2 

480 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

481 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

482 
single_valued_rel_comp ~> single_valued_relcomp 

47549  483 
rel_comp_def ~> relcomp_unfold 
47448  484 
converse_rel_comp ~> converse_relcomp 
485 
pred_compI ~> relcomppI 

486 
pred_compE ~> relcomppE 

487 
pred_comp_bot1 ~> relcompp_bot1 

488 
pred_comp_bot2 ~> relcompp_bot2 

489 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

490 
pred_comp_mono ~> relcompp_mono 

491 
pred_comp_distrib ~> relcompp_distrib 

492 
pred_comp_distrib2 ~> relcompp_distrib2 

493 
converse_pred_comp ~> converse_relcompp 

47464  494 

47448  495 
finite_rel_comp ~> finite_relcomp 
47464  496 

47448  497 
set_rel_comp ~> set_relcomp 
498 

499 
INCOMPATIBILITY. 

500 

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

503 

504 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

505 
zdiv_self ~> div_self 

506 
zmod_self ~> mod_self 

507 
zdiv_zero ~> div_0 

508 
zmod_zero ~> mod_0 

509 
zdiv_zmod_equality ~> div_mod_equality2 

510 
zdiv_zmod_equality2 ~> div_mod_equality 

511 
zmod_zdiv_trivial ~> mod_div_trivial 

512 
zdiv_zminus_zminus ~> div_minus_minus 

513 
zmod_zminus_zminus ~> mod_minus_minus 

514 
zdiv_zminus2 ~> div_minus_right 

515 
zmod_zminus2 ~> mod_minus_right 

516 
zdiv_minus1_right ~> div_minus1_right 

517 
zmod_minus1_right ~> mod_minus1_right 

518 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

519 
zmod_zmult1_eq ~> mod_mult_right_eq 

520 
zpower_zmod ~> power_mod 

521 
zdvd_zmod ~> dvd_mod 

522 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

523 
mod_mult_distrib ~> mult_mod_left 

524 
mod_mult_distrib2 ~> mult_mod_right 

525 

526 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

527 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

528 

47551  529 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
530 

47552  531 
* Consolidated theorem names concerning fold combinators: 
47550  532 

533 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

534 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

535 
INFI_fold_inf ~> INF_fold_inf 

536 
SUPR_fold_sup ~> SUP_fold_sup 

537 
union_set ~> union_set_fold 

538 
minus_set ~> minus_set_fold 

539 
INFI_set_fold ~> INF_set_fold 

540 
SUPR_set_fold ~> SUP_set_fold 

541 
INF_code ~> INF_set_foldr 

542 
SUP_code ~> SUP_set_foldr 

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

544 
foldr_fold_rev ~> foldr_conv_fold 

545 
foldl_fold ~> foldl_conv_fold 

546 
foldr_foldr ~> foldr_conv_foldl 

547 
foldl_foldr ~> foldl_conv_foldr 

47552  548 
fold_set_remdups ~> fold_set_fold_remdups 
549 
fold_set ~> fold_set_fold 

550 
fold1_set ~> fold1_set_fold 

47550  551 

552 
INCOMPATIBILITY. 

553 

554 
* Dropped rarely useful theorems concerning fold combinators: 

555 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

556 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

557 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

558 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

559 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

560 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

564 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

565 

566 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

567 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

568 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

569 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

571 
fold_conv_foldr and fold_rev. 

572 

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

574 
through option types. 

575 

47856  576 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
577 
relations. 

578 

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

580 

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

582 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

583 

584 
zminus_zminus ~> minus_minus 

585 
zminus_0 ~> minus_zero 

586 
zminus_zadd_distrib ~> minus_add_distrib 

587 
zadd_commute ~> add_commute 

588 
zadd_assoc ~> add_assoc 

589 
zadd_left_commute ~> add_left_commute 

590 
zadd_ac ~> add_ac 

591 
zmult_ac ~> mult_ac 

592 
zadd_0 ~> add_0_left 

593 
zadd_0_right ~> add_0_right 

594 
zadd_zminus_inverse2 ~> left_minus 

595 
zmult_zminus ~> mult_minus_left 

596 
zmult_commute ~> mult_commute 

597 
zmult_assoc ~> mult_assoc 

598 
zadd_zmult_distrib ~> left_distrib 

599 
zadd_zmult_distrib2 ~> right_distrib 

600 
zdiff_zmult_distrib ~> left_diff_distrib 

601 
zdiff_zmult_distrib2 ~> right_diff_distrib 

602 
zmult_1 ~> mult_1_left 

603 
zmult_1_right ~> mult_1_right 

604 
zle_refl ~> order_refl 

605 
zle_trans ~> order_trans 

606 
zle_antisym ~> order_antisym 

607 
zle_linear ~> linorder_linear 

608 
zless_linear ~> linorder_less_linear 

609 
zadd_left_mono ~> add_left_mono 

610 
zadd_strict_right_mono ~> add_strict_right_mono 

611 
zadd_zless_mono ~> add_less_le_mono 

612 
int_0_less_1 ~> zero_less_one 

613 
int_0_neq_1 ~> zero_neq_one 

614 
zless_le ~> less_le 

615 
zpower_zadd_distrib ~> power_add 

616 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

617 
zero_le_zpower_abs ~> zero_le_power_abs 

618 

619 
* Theory Deriv: Renamed 

620 

621 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

622 

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

624 

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

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

629 
INCOMPATIBILITY. 

630 

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

633 

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

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

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

638 
follows: 

47452  639 

640 
Operations: 

641 
bulkload > rbt_bulkload 

642 
del_from_left > rbt_del_from_left 

643 
del_from_right > rbt_del_from_right 

644 
del > rbt_del 

645 
delete > rbt_delete 

646 
ins > rbt_ins 

647 
insert > rbt_insert 

648 
insertw > rbt_insert_with 

649 
insert_with_key > rbt_insert_with_key 

650 
map_entry > rbt_map_entry 

651 
lookup > rbt_lookup 

652 
sorted > rbt_sorted 

653 
tree_greater > rbt_greater 

654 
tree_less > rbt_less 

655 
tree_less_symbol > rbt_less_symbol 

656 
union > rbt_union 

657 
union_with > rbt_union_with 

658 
union_with_key > rbt_union_with_key 

659 

660 
Lemmas: 

661 
balance_left_sorted > balance_left_rbt_sorted 

662 
balance_left_tree_greater > balance_left_rbt_greater 

663 
balance_left_tree_less > balance_left_rbt_less 

664 
balance_right_sorted > balance_right_rbt_sorted 

665 
balance_right_tree_greater > balance_right_rbt_greater 

666 
balance_right_tree_less > balance_right_rbt_less 

667 
balance_sorted > balance_rbt_sorted 

668 
balance_tree_greater > balance_rbt_greater 

669 
balance_tree_less > balance_rbt_less 

670 
bulkload_is_rbt > rbt_bulkload_is_rbt 

671 
combine_sorted > combine_rbt_sorted 

672 
combine_tree_greater > combine_rbt_greater 

673 
combine_tree_less > combine_rbt_less 

674 
delete_in_tree > rbt_delete_in_tree 

675 
delete_is_rbt > rbt_delete_is_rbt 

676 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

677 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

678 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

679 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

680 
del_in_tree > rbt_del_in_tree 

681 
del_inv1_inv2 > rbt_del_inv1_inv2 

682 
del_sorted > rbt_del_rbt_sorted 

683 
del_tree_greater > rbt_del_rbt_greater 

684 
del_tree_less > rbt_del_rbt_less 

685 
dom_lookup_Branch > dom_rbt_lookup_Branch 

686 
entries_lookup > entries_rbt_lookup 

687 
finite_dom_lookup > finite_dom_rbt_lookup 

688 
insert_sorted > rbt_insert_rbt_sorted 

689 
insertw_is_rbt > rbt_insertw_is_rbt 

690 
insertwk_is_rbt > rbt_insertwk_is_rbt 

691 
insertwk_sorted > rbt_insertwk_rbt_sorted 

692 
insertw_sorted > rbt_insertw_rbt_sorted 

693 
ins_sorted > ins_rbt_sorted 

694 
ins_tree_greater > ins_rbt_greater 

695 
ins_tree_less > ins_rbt_less 

696 
is_rbt_sorted > is_rbt_rbt_sorted 

697 
lookup_balance > rbt_lookup_balance 

698 
lookup_bulkload > rbt_lookup_rbt_bulkload 

699 
lookup_delete > rbt_lookup_rbt_delete 

700 
lookup_Empty > rbt_lookup_Empty 

701 
lookup_from_in_tree > rbt_lookup_from_in_tree 

702 
lookup_in_tree > rbt_lookup_in_tree 

703 
lookup_ins > rbt_lookup_ins 

704 
lookup_insert > rbt_lookup_rbt_insert 

705 
lookup_insertw > rbt_lookup_rbt_insertw 

706 
lookup_insertwk > rbt_lookup_rbt_insertwk 

707 
lookup_keys > rbt_lookup_keys 

708 
lookup_map > rbt_lookup_map 

709 
lookup_map_entry > rbt_lookup_rbt_map_entry 

710 
lookup_tree_greater > rbt_lookup_rbt_greater 

711 
lookup_tree_less > rbt_lookup_rbt_less 

712 
lookup_union > rbt_lookup_rbt_union 

713 
map_entry_color_of > rbt_map_entry_color_of 

714 
map_entry_inv1 > rbt_map_entry_inv1 

715 
map_entry_inv2 > rbt_map_entry_inv2 

716 
map_entry_is_rbt > rbt_map_entry_is_rbt 

717 
map_entry_sorted > rbt_map_entry_rbt_sorted 

718 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

719 
map_entry_tree_less > rbt_map_entry_rbt_less 

720 
map_tree_greater > map_rbt_greater 

721 
map_tree_less > map_rbt_less 

722 
map_sorted > map_rbt_sorted 

723 
paint_sorted > paint_rbt_sorted 

724 
paint_lookup > paint_rbt_lookup 

725 
paint_tree_greater > paint_rbt_greater 

726 
paint_tree_less > paint_rbt_less 

727 
sorted_entries > rbt_sorted_entries 

728 
tree_greater_eq_trans > rbt_greater_eq_trans 

729 
tree_greater_nit > rbt_greater_nit 

730 
tree_greater_prop > rbt_greater_prop 

731 
tree_greater_simps > rbt_greater_simps 

732 
tree_greater_trans > rbt_greater_trans 

733 
tree_less_eq_trans > rbt_less_eq_trans 

734 
tree_less_nit > rbt_less_nit 

735 
tree_less_prop > rbt_less_prop 

736 
tree_less_simps > rbt_less_simps 

737 
tree_less_trans > rbt_less_trans 

738 
tree_ord_props > rbt_ord_props 

739 
union_Branch > rbt_union_Branch 

740 
union_is_rbt > rbt_union_is_rbt 

741 
unionw_is_rbt > rbt_unionw_is_rbt 

742 
unionwk_is_rbt > rbt_unionwk_is_rbt 

743 
unionwk_sorted > rbt_unionwk_rbt_sorted 

744 

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

747 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  748 

749 
Changed Operations: 

47622  750 
float_abs > abs 
751 
float_nprt > nprt 

752 
float_pprt > pprt 

753 
pow2 > use powr 

754 
round_down > float_round_down 

755 
round_up > float_round_up 

756 
scale > exponent 

757 

758 
Removed Operations: 

759 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

760 

761 
Renamed Lemmas: 

762 
abs_float_def > Float.compute_float_abs 

763 
bitlen_ge0 > bitlen_nonneg 

764 
bitlen.simps > Float.compute_bitlen 

765 
float_components > Float_mantissa_exponent 

766 
float_divl.simps > Float.compute_float_divl 

767 
float_divr.simps > Float.compute_float_divr 

768 
float_eq_odd > mult_powr_eq_mult_powr_iff 

769 
float_power > real_of_float_power 

770 
lapprox_posrat_def > Float.compute_lapprox_posrat 

771 
lapprox_rat.simps > Float.compute_lapprox_rat 

772 
le_float_def' > Float.compute_float_le 

773 
le_float_def > less_eq_float.rep_eq 

774 
less_float_def' > Float.compute_float_less 

775 
less_float_def > less_float.rep_eq 

776 
normfloat_def > Float.compute_normfloat 

777 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

778 
normfloat > normfloat_def 

779 
normfloat_unique > use normfloat_def 

780 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

781 
one_float_def > Float.compute_float_one 

782 
plus_float_def > Float.compute_float_plus 

783 
rapprox_posrat_def > Float.compute_rapprox_posrat 

784 
rapprox_rat.simps > Float.compute_rapprox_rat 

785 
real_of_float_0 > zero_float.rep_eq 

786 
real_of_float_1 > one_float.rep_eq 

787 
real_of_float_abs > abs_float.rep_eq 

788 
real_of_float_add > plus_float.rep_eq 

789 
real_of_float_minus > uminus_float.rep_eq 

790 
real_of_float_mult > times_float.rep_eq 

791 
real_of_float_simp > Float.rep_eq 

792 
real_of_float_sub > minus_float.rep_eq 

793 
round_down.simps > Float.compute_float_round_down 

794 
round_up.simps > Float.compute_float_round_up 

795 
times_float_def > Float.compute_float_times 

796 
uminus_float_def > Float.compute_float_uminus 

797 
zero_float_def > Float.compute_float_zero 

798 

799 
Lemmas not necessary anymore, use the transfer method: 

800 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

801 
float_divr, float_le_simp, float_less1_mantissa_bound, 

802 
float_less_simp, float_less_zero, float_le_zero, 

803 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

804 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

805 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

806 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

807 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

808 
round_up, zero_le_float, zero_less_float 

47616  809 

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

45791  812 

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

815 

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

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

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

820 

821 
* Session HOLWord: Discontinued many redundant theorems specific to 

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

823 
instead. 

824 

825 
word_sub_alt ~> word_sub_wi 

826 
word_add_alt ~> word_add_def 

827 
word_mult_alt ~> word_mult_def 

828 
word_minus_alt ~> word_minus_def 

829 
word_0_alt ~> word_0_wi 

830 
word_1_alt ~> word_1_wi 

831 
word_add_0 ~> add_0_left 

832 
word_add_0_right ~> add_0_right 

833 
word_mult_1 ~> mult_1_left 

834 
word_mult_1_right ~> mult_1_right 

835 
word_add_commute ~> add_commute 

836 
word_add_assoc ~> add_assoc 

837 
word_add_left_commute ~> add_left_commute 

838 
word_mult_commute ~> mult_commute 

839 
word_mult_assoc ~> mult_assoc 

840 
word_mult_left_commute ~> mult_left_commute 

841 
word_left_distrib ~> left_distrib 

842 
word_right_distrib ~> right_distrib 

843 
word_left_minus ~> left_minus 

844 
word_diff_0_right ~> diff_0_right 

845 
word_diff_self ~> diff_self 

846 
word_sub_def ~> diff_minus 

847 
word_diff_minus ~> diff_minus 

848 
word_add_ac ~> add_ac 

849 
word_mult_ac ~> mult_ac 

850 
word_plus_ac0 ~> add_0_left add_0_right add_ac 

851 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 

852 
word_order_trans ~> order_trans 

853 
word_order_refl ~> order_refl 

854 
word_order_antisym ~> order_antisym 

855 
word_order_linear ~> linorder_linear 

856 
lenw1_zero_neq_one ~> zero_neq_one 

857 
word_number_of_eq ~> number_of_eq 

858 
word_of_int_add_hom ~> wi_hom_add 

859 
word_of_int_sub_hom ~> wi_hom_sub 

860 
word_of_int_mult_hom ~> wi_hom_mult 

861 
word_of_int_minus_hom ~> wi_hom_neg 

862 
word_of_int_succ_hom ~> wi_hom_succ 

863 
word_of_int_pred_hom ~> wi_hom_pred 

864 
word_of_int_0_hom ~> word_0_wi 

865 
word_of_int_1_hom ~> word_1_wi 

866 

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

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

870 
multiplication, shifting by constants, bitwise operators and numeric 

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

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

875 

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

878 
measure_space. The locales based on subset_class now have two 

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

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

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

884 
Measure space constructions for distributions and densities now got 

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

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

887 
and point_measure is introduced. INCOMPATIBILITY. 

47694  888 

889 
Renamed constants: 

890 
measure > emeasure 

891 
finite_measure.\<mu>' > measure 

892 
product_algebra_generator > prod_algebra 

893 
product_prob_space.emb > prod_emb 

894 
product_prob_space.infprod_algebra > PiM 

895 

896 
Removed locales: 

897 
completeable_measure_space 

898 
finite_measure_space 

899 
finite_prob_space 

900 
finite_product_finite_prob_space 

901 
finite_product_sigma_algebra 

902 
finite_sigma_algebra 

903 
measure_space 

904 
pair_finite_prob_space 

905 
pair_finite_sigma_algebra 

906 
pair_finite_space 

907 
pair_sigma_algebra 

908 
product_sigma_algebra 

909 

910 
Removed constants: 

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

918 

919 
Replacement theorems: 

47751  920 
finite_additivity_sufficient > ring_of_sets.countably_additiveI_finite 
921 
finite_measure.empty_measure > measure_empty 

922 
finite_measure.finite_continuity_from_above > finite_measure.finite_Lim_measure_decseq 

923 
finite_measure.finite_continuity_from_below > finite_measure.finite_Lim_measure_incseq 

924 
finite_measure.finite_measure_countably_subadditive > finite_measure.finite_measure_subadditive_countably 

925 
finite_measure.finite_measure_eq > finite_measure.emeasure_eq_measure 

926 
finite_measure.finite_measure > finite_measure.emeasure_finite 

927 
finite_measure.finite_measure_finite_singleton > finite_measure.finite_measure_eq_setsum_singleton 

928 
finite_measure.positive_measure' > measure_nonneg 

929 
finite_measure.real_measure > finite_measure.emeasure_real 

930 
finite_product_prob_space.finite_measure_times > finite_product_prob_space.finite_measure_PiM_emb 

931 
finite_product_sigma_algebra.in_P > sets_PiM_I_finite 

932 
finite_product_sigma_algebra.P_empty > space_PiM_empty, sets_PiM_empty 

933 
information_space.conditional_entropy_eq > information_space.conditional_entropy_simple_distributed 

934 
information_space.conditional_entropy_positive > information_space.conditional_entropy_nonneg_simple 

935 
information_space.conditional_mutual_information_eq_mutual_information > information_space.conditional_mutual_information_eq_mutual_information_simple 

936 
information_space.conditional_mutual_information_generic_positive > information_space.conditional_mutual_information_nonneg_simple 

937 
information_space.conditional_mutual_information_positive > information_space.conditional_mutual_information_nonneg_simple 

938 
information_space.entropy_commute > information_space.entropy_commute_simple 

939 
information_space.entropy_eq > information_space.entropy_simple_distributed 

940 
information_space.entropy_generic_eq > information_space.entropy_simple_distributed 

941 
information_space.entropy_positive > information_space.entropy_nonneg_simple 

942 
information_space.entropy_uniform_max > information_space.entropy_uniform 

943 
information_space.KL_eq_0_imp > information_space.KL_eq_0_iff_eq 

944 
information_space.KL_eq_0 > information_space.KL_same_eq_0 

945 
information_space.KL_ge_0 > information_space.KL_nonneg 

946 
information_space.mutual_information_eq > information_space.mutual_information_simple_distributed 

947 
information_space.mutual_information_positive > information_space.mutual_information_nonneg_simple 

948 
Int_stable_cuboids > Int_stable_atLeastAtMost 

949 
Int_stable_product_algebra_generator > positive_integral 

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

47694  951 
measure_space.additive > emeasure_additive 
47751  952 
measure_space.AE_iff_null_set > AE_iff_null 
953 
measure_space.almost_everywhere_def > eventually_ae_filter 

954 
measure_space.almost_everywhere_vimage > AE_distrD 

955 
measure_space.continuity_from_above > INF_emeasure_decseq 

956 
measure_space.continuity_from_above_Lim > Lim_emeasure_decseq 

957 
measure_space.continuity_from_below_Lim > Lim_emeasure_incseq 

47694  958 
measure_space.continuity_from_below > SUP_emeasure_incseq 
47751  959 
measure_space_density > emeasure_density 
960 
measure_space.density_is_absolutely_continuous > absolutely_continuousI_density 

961 
measure_space.integrable_vimage > integrable_distr 

962 
measure_space.integral_translated_density > integral_density 

963 
measure_space.integral_vimage > integral_distr 

964 
measure_space.measure_additive > plus_emeasure 

965 
measure_space.measure_compl > emeasure_compl 

966 
measure_space.measure_countable_increasing > emeasure_countable_increasing 

967 
measure_space.measure_countably_subadditive > emeasure_subadditive_countably 

47694  968 
measure_space.measure_decseq > decseq_emeasure 
47751  969 
measure_space.measure_Diff > emeasure_Diff 
970 
measure_space.measure_Diff_null_set > emeasure_Diff_null_set 

47694  971 
measure_space.measure_eq_0 > emeasure_eq_0 
972 
measure_space.measure_finitely_subadditive > emeasure_subadditive_finite 

47751  973 
measure_space.measure_finite_singleton > emeasure_eq_setsum_singleton 
974 
measure_space.measure_incseq > incseq_emeasure 

975 
measure_space.measure_insert > emeasure_insert 

976 
measure_space.measure_mono > emeasure_mono 

977 
measure_space.measure_not_negative > emeasure_not_MInf 

978 
measure_space.measure_preserving_Int_stable > measure_eqI_generator_eq 

979 
measure_space.measure_setsum > setsum_emeasure 

980 
measure_space.measure_setsum_split > setsum_emeasure_cover 

47694  981 
measure_space.measure_space_vimage > emeasure_distr 
47751  982 
measure_space.measure_subadditive_finite > emeasure_subadditive_finite 
983 
measure_space.measure_subadditive > subadditive 

984 
measure_space.measure_top > emeasure_space 

985 
measure_space.measure_UN_eq_0 > emeasure_UN_eq_0 

986 
measure_space.measure_Un_null_set > emeasure_Un_null_set 

987 
measure_space.positive_integral_translated_density > positive_integral_density 

988 
measure_space.positive_integral_vimage > positive_integral_distr 

47694  989 
measure_space.real_continuity_from_above > Lim_measure_decseq 
47751  990 
measure_space.real_continuity_from_below > Lim_measure_incseq 
47694  991 
measure_space.real_measure_countably_subadditive > measure_subadditive_countably 
47751  992 
measure_space.real_measure_Diff > measure_Diff 
993 
measure_space.real_measure_finite_Union > measure_finite_Union 

994 
measure_space.real_measure_setsum_singleton > measure_eq_setsum_singleton 

995 
measure_space.real_measure_subadditive > measure_subadditive 

996 
measure_space.real_measure_Union > measure_Union 

997 
measure_space.real_measure_UNION > measure_UNION 

47694  998 
measure_space.simple_function_vimage > simple_function_comp 
999 
measure_space.simple_integral_vimage > simple_integral_distr 

47751  1000 
measure_space.simple_integral_vimage > simple_integral_distr 
1001 
measure_unique_Int_stable > measure_eqI_generator_eq 

1002 
measure_unique_Int_stable_vimage > measure_eqI_generator_eq 

47694  1003 
pair_sigma_algebra.measurable_cut_fst > sets_Pair1 
1004 
pair_sigma_algebra.measurable_cut_snd > sets_Pair2 

1005 
pair_sigma_algebra.measurable_pair_image_fst > measurable_Pair1 

1006 
pair_sigma_algebra.measurable_pair_image_snd > measurable_Pair2 

1007 
pair_sigma_algebra.measurable_product_swap > measurable_pair_swap_iff 

1008 
pair_sigma_algebra.pair_sigma_algebra_measurable > measurable_pair_swap 

1009 
pair_sigma_algebra.pair_sigma_algebra_swap_measurable > measurable_pair_swap' 

1010 
pair_sigma_algebra.sets_swap > sets_pair_swap 

47751  1011 
pair_sigma_finite.measure_cut_measurable_fst > pair_sigma_finite.measurable_emeasure_Pair1 
1012 
pair_sigma_finite.measure_cut_measurable_snd > pair_sigma_finite.measurable_emeasure_Pair2 

1013 
pair_sigma_finite.measure_preserving_swap > pair_sigma_finite.distr_pair_swap 

1014 
pair_sigma_finite.pair_measure_alt2 > pair_sigma_finite.emeasure_pair_measure_alt2 

1015 
pair_sigma_finite.pair_measure_alt > pair_sigma_finite.emeasure_pair_measure_alt 

1016 
pair_sigma_finite.pair_measure_times > pair_sigma_finite.emeasure_pair_measure_Times 

1017 
prob_space.indep_distribution_eq_measure > prob_space.indep_vars_iff_distr_eq_PiM 

1018 
prob_space.indep_var_distributionD > prob_space.indep_var_distribution_eq 

47694  1019 
prob_space.measure_space_1 > prob_space.emeasure_space_1 
1020 
prob_space.prob_space_vimage > prob_space_distr 

1021 
prob_space.random_variable_restrict > measurable_restrict 

47751  1022 
prob_space_unique_Int_stable > measure_eqI_prob_space 
1023 
product_algebraE > prod_algebraE_all 

1024 
product_algebra_generator_der > prod_algebra_eq_finite 

1025 
product_algebra_generator_into_space > prod_algebra_sets_into_space 

1026 
product_algebraI > sets_PiM_I_finite 

1027 
product_measure_exists > product_sigma_finite.sigma_finite 

47694  1028 
product_prob_space.finite_index_eq_finite_product > product_prob_space.sets_PiM_generator 
1029 
product_prob_space.finite_measure_infprod_emb_Pi > product_prob_space.measure_PiM_emb 

1030 
product_prob_space.infprod_spec > product_prob_space.emeasure_PiM_emb_not_empty 

1031 
product_prob_space.measurable_component > measurable_component_singleton 

1032 
product_prob_space.measurable_emb > measurable_prod_emb 

1033 
product_prob_space.measurable_into_infprod_algebra > measurable_PiM_single 

1034 
product_prob_space.measurable_singleton_infprod > measurable_component_singleton 

1035 
product_prob_space.measure_emb > emeasure_prod_emb 

47751  1036 
product_prob_space.measure_preserving_restrict > product_prob_space.distr_restrict 
1037 
product_sigma_algebra.product_algebra_into_space > space_closed 

1038 
product_sigma_finite.measure_fold > product_sigma_finite.distr_merge 

1039 
product_sigma_finite.measure_preserving_component_singelton > product_sigma_finite.distr_singleton 

1040 
product_sigma_finite.measure_preserving_merge > product_sigma_finite.distr_merge 

47694  1041 
sequence_space.measure_infprod > sequence_space.measure_PiM_countable 
47751  1042 
sets_product_algebra > sets_PiM 
1043 
sigma_algebra.measurable_sigma > measurable_measure_of 

1044 
sigma_finite_measure.disjoint_sigma_finite > sigma_finite_disjoint 

1045 
sigma_finite_measure.RN_deriv_vimage > sigma_finite_measure.RN_deriv_distr 

1046 
sigma_product_algebra_sigma_eq > sigma_prod_algebra_sigma_eq 

1047 
space_product_algebra > space_PiM 

47694  1048 

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

47413  1051 

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

1052 

45160  1053 
*** FOL *** 
1054 

45383  1055 
* New "case_product" attribute (see HOL). 
45160  1056 

45109  1057 

47463  1058 
*** ZF *** 
1059 

1060 
* Greater support for structured proofs involving induction or case 

1061 
analysis. 

1062 

1063 
* Much greater use of mathematical symbols. 

1064 

1065 
* Removal of many ML theorem bindings. INCOMPATIBILITY. 

1066 

1067 

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

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

1069 

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

1072 

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

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

1074 
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

1075 
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

1076 

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

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

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

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

1080 
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

1081 
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

1082 
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

1083 
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

1084 
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

1085 

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

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

1087 
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

1088 

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

1091 
declarations like Local_Theory.note. 

1092 

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

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

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

1095 

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

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

1097 
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

1098 
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

1099 

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

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

1101 

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

1102 
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

1103 
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

1104 
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

1105 
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

1106 
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

1107 
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

1108 
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

1109 
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

1110 
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

1111 
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

1112 
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

1113 
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

1114 

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

1115 

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

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

1117 

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

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

1119 
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

1120 
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

1121 
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

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

1123 
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

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

1125 

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

1128 

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

1131 

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

1132 

45109  1133 

44801  1134 
New in Isabelle20111 (October 2011) 
1135 
 

41651  1136 

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

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

1138 

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

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

1145 

44777  1146 
 Markup of formal entities within the text buffer, with semantic 
44760  1147 
highlighting, tooltips and hyperlinks to jump to defining source 
1148 
positions. 

1149 

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

1152 
theory output and other nonIsabelle text boxes). 

1153 

1154 
 Refined scheduling of proof checking and printing of results, 

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

1157 

44777  1158 
 Reduced CPU performance requirements, usable on machines with few 
44760  1159 
cores. 
1160 

44777  1161 
 Reduced memory requirements due to pruning of unused document 
44760  1162 
versions (garbage collection). 
1163 

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

1165 
including some remaining limitations. 

1166 

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

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

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

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

1172 
INCOMPATIBILITY. 

1173 

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

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

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

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

1177 

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

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

1179 
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

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

1181 

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

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

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

1184 

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

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

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

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

1188 

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

1189 
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

1190 

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

1191 
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

1192 

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

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

1196 

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

1199 

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

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

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

1204 
"Classical Reasoner". 

42633  1205 

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

1206 

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

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

1208 

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

1211 

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

1215 
Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in 

1216 
class complete_linorder. 

1217 

1218 
Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def, 

1219 
Sup_fun_def, Inf_apply, Sup_apply. 

1220 

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

1223 

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

1224 
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

1225 
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

1226 
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

1227 
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

1228 
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

1229 
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

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

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

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

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

1234 
INF_subset ~> INF_superset_mono [OF _ order_refl] 
44800  1235 

1236 
More consistent and comprehensive names: 

1237 

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

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

1239 
UNION_eq_Union_image ~> SUP_def 
43872  1240 
INFI_def ~> INF_def 
1241 
SUPR_def ~> SUP_def 

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

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

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

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

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

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

1247 
SUP_leI ~> SUP_least 
43873  1248 
INFI_bool_eq ~> INF_bool_eq 
1249 
SUPR_bool_eq ~> SUP_bool_eq 

1250 
INFI_apply ~> INF_apply 

1251 
SUPR_apply ~> SUP_apply 

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

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

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

1254 

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

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

1256 

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

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

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

1259 

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

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

1261 
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

1262 
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

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

1264 

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

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

1266 
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

1267 
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

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

1269 

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

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

1273 

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

1276 
UN_ball_bex_simps. INCOMPATIBILITY. 

1277 

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

1279 
separate type class floor_ceiling. 

1280 

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

42874  1282 

1283 
locale fun_left_comm ~> locale comp_fun_commute 

1284 
locale fun_left_comm_idem ~> locale comp_fun_idem 

44800  1285 

1286 
Both use pointfree characterization; interpretation proofs may need 

1287 
adjustment. INCOMPATIBILITY. 

42874  1288 

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

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

1291 

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

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

1295 
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

1296 

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

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

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

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

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

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

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

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

1304 

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

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

1307 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1327 
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

1328 
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

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

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

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

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

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

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

1335 
exp_ln_eq ~> ln_unique 
44711  1336 
expi_add ~> exp_add 
1337 
expi_zero ~> exp_zero 

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

1338 
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

1339 
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

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

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

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

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

1344 
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

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

1346 
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

1347 
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

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

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

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

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

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

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

1354 
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

1355 
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

1356 
LIMSEQ_imp_rabs ~> tendsto_rabs 
44710  1357 
LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus] 
1358 
LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const] 

1359 
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

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

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

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

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

1364 
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

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

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

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

1368 
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

1369 
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

1370 
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

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

1372 
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

1373 
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

1374 
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

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

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

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

1378 
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

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

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

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

1382 
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

1383 
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

1384 
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

1385 
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

1386 
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

1387 
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

1388 
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

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

1390 

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

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

42484  1394 

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

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

1398 

44968  1399 
* Code generation: 
1400 

1401 
 Theory Library/Code_Char_ord provides native ordering of 

1402 
characters in the target language. 

1403 

1404 
 Commands code_module and code_library are legacy, use export_code 

1405 
instead. 

1406 

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

1408 

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

1410 
reactivated by the following theory command: 

1411 

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

1413 

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

1415 

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

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

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

1420 
syntax. 

1421 

44968  1422 
* Method "fastsimp" has been renamed 