author  wenzelm 
Mon, 10 Dec 2012 15:39:20 +0100  
changeset 50453  262dc5873f80 
parent 50406  c28753665b8e 
child 50455  c7f366a861ed 
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 

50126
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
50119
diff
changeset

9 
* Theorem status about oracles and unfinished/failed future proofs is 
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
50119
diff
changeset

10 
no longer printed by default, since it is incompatible with 
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
50119
diff
changeset

11 
incremental / parallel checking of the persistent document model. ML 
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
50119
diff
changeset

12 
function Thm.peek_status may be used to inspect a snapshot of the 
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
50119
diff
changeset

13 
ongoing evaluation process. Note that in batch mode  notably 
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
50119
diff
changeset

14 
isabelle build  the system ensures that future proofs of all 
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
50119
diff
changeset

15 
accessible theorems in the theory context are finished (as before). 
3dec88149176
theorem status about oracles/futures is no longer printed by default;
wenzelm
parents:
50119
diff
changeset

16 

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

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

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

21 

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

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

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

24 

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

27 
Tools that load their additional source files may imitate the 

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

29 
dependencies properly. 

30 

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

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

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

33 

50110  34 
* Updated and extended "isarref" and "implementation" manual, reduced 
35 
remaining material in old "ref" manual. 

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

36 

49841  37 
* Improved support for auxiliary contexts indicate block structure for 
38 
specifications: nesting of "context fixes ... context assumes ..." 

39 
and "class ... context ...". 

40 

49869
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset

41 
* More informative error messages for Isar proof commands involving 
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset

42 
lazy enumerations (method applications etc.). 
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset

43 

50213  44 
* Refined 'help' command to retrieve outer syntax commands according 
45 
to name patterns (with clickable results). 

46 

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

47 

49968  48 
*** Prover IDE  Isabelle/Scala/jEdit *** 
49 

50 
* Parallel terminal proofs ('by') are enabled by default, likewise 

51 
proofs that are built into packages like 'datatype', 'function'. This 

52 
allows to "run ahead" checking the theory specifications on the 

53 
surface, while the prover is still crunching on internal 

54 
justifications. Unfinished / cancelled proofs are restarted as 

55 
required to complete full proof checking eventually. 

56 

57 
* Improved output panel with tooltips, hyperlinks etc. based on the 

58 
same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of 

59 
tooltips leads to some window that supports the same recursively, 

60 
which can lead to stacks of tooltips as the semantic document content 

61 
is explored. ESCAPE closes the whole stack, individual windows may be 

62 
closed separately, or detached to become independent jEdit dockables. 

63 

64 
* More robust incremental parsing of outer syntax (partial comments, 

65 
malformed symbols). Changing the balance of open/close quotes and 

66 
comment delimiters works more conveniently with unfinished situations 

67 
that frequently occur in user interaction. 

68 

69 
* More efficient painting and improved reactivity when editing large 

70 
files. More scalable management of formal document content. 

71 

72 
* Smarter handling of tracing messages: output window informs about 

73 
accumulated messages; prover transactions are limited to emit maximum 

50119
5c370a036de7
more generous tracing_limit, with explicit system option;
wenzelm
parents:
50118
diff
changeset

74 
amount of output, before being canceled (cf. system option 
5c370a036de7
more generous tracing_limit, with explicit system option;
wenzelm
parents:
50118
diff
changeset

75 
"editor_tracing_limit"). This avoids swamping the frontend with 
5c370a036de7
more generous tracing_limit, with explicit system option;
wenzelm
parents:
50118
diff
changeset

76 
potentially infinite message streams. 
49968  77 

78 
* More plugin options and preferences, based on Isabelle/Scala. The 

79 
jEdit plugin option panel provides access to some Isabelle/Scala 

80 
options, including tuning parameters for editor reactivity and color 

81 
schemes. 

82 

50184  83 
* Dockable window "Symbols" provides some editing support for Isabelle 
84 
symbols. 

85 

50183  86 
* Improved editing support for control styles: subscript, superscript, 
87 
bold, reset of style  operating on single symbols or text 

50198
0c7b351a6871
added convenience actions isabelle.increasefontsize and isabelle.decreasefontsize;
wenzelm
parents:
50184
diff
changeset

88 
selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT. 
0c7b351a6871
added convenience actions isabelle.increasefontsize and isabelle.decreasefontsize;
wenzelm
parents:
50184
diff
changeset

89 

0c7b351a6871
added convenience actions isabelle.increasefontsize and isabelle.decreasefontsize;
wenzelm
parents:
50184
diff
changeset

90 
* Actions isabelle.increasefontsize and isabelle.decreasefontsize 
0c7b351a6871
added convenience actions isabelle.increasefontsize and isabelle.decreasefontsize;
wenzelm
parents:
50184
diff
changeset

91 
adjust the main text area font size, and its derivatives for output, 
0c7b351a6871
added convenience actions isabelle.increasefontsize and isabelle.decreasefontsize;
wenzelm
parents:
50184
diff
changeset

92 
tooltips etc. Cf. keyboard shortcuts CPLUS and CMINUS. 
50183  93 

50406
c28753665b8e
documentation for isabelle build_dialog and its implicit use in isabelle jedit;
wenzelm
parents:
50232
diff
changeset

94 
* Implicit check and build dialog of the specified logic session 
c28753665b8e
documentation for isabelle build_dialog and its implicit use in isabelle jedit;
wenzelm
parents:
50232
diff
changeset

95 
image. For example, HOL, HOLCF, HOLNominal can be produced on 
c28753665b8e
documentation for isabelle build_dialog and its implicit use in isabelle jedit;
wenzelm
parents:
50232
diff
changeset

96 
demand, without bundling big platformdependent heap images in the 
c28753665b8e
documentation for isabelle build_dialog and its implicit use in isabelle jedit;
wenzelm
parents:
50232
diff
changeset

97 
Isabelle distribution. 
c28753665b8e
documentation for isabelle build_dialog and its implicit use in isabelle jedit;
wenzelm
parents:
50232
diff
changeset

98 

49968  99 
* Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates 
100 
from Oracle provide better multiplatform experience. This version is 

101 
now bundled exclusively with Isabelle. 

102 

103 

48205  104 
*** Pure *** 
105 

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

106 
* Code generation for Haskell: restrict unqualified imports from 
6efff142bb54
restrict unqualified imports from Haskell Prelude to a small set of fundamental operations
haftmann
parents:
48428
diff
changeset

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

108 

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

111 
the rather arbitrary current working directory. 

112 
INCOMPATIBILITY. 

113 

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

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

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

118 
with some care where this is really required. 

119 

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

122 
given given sort. Example (in HOL): 

123 

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

125 

48205  126 

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

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

128 

49972
f11f8905d9fd
incorporated constant chars into instantiation proof for enum;
haftmann
parents:
49968
diff
changeset

129 
* Removed constant "chars". Prefer "Enum.enum" on type "char" 
f11f8905d9fd
incorporated constant chars into instantiation proof for enum;
haftmann
parents:
49968
diff
changeset

130 
directly. INCOMPATIBILITY. 
f11f8905d9fd
incorporated constant chars into instantiation proof for enum;
haftmann
parents:
49968
diff
changeset

131 

49948
744934b818c7
moved quite generic material from theory Enum to more appropriate places
haftmann
parents:
49918
diff
changeset

132 
* Moved operation product, sublists and n_lists from Enum.thy 
744934b818c7
moved quite generic material from theory Enum to more appropriate places
haftmann
parents:
49918
diff
changeset

133 
to List.thy. INCOMPATIBILITY. 
744934b818c7
moved quite generic material from theory Enum to more appropriate places
haftmann
parents:
49918
diff
changeset

134 

49836
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49822
diff
changeset

135 
* Simplified 'typedef' specifications: historical options for implicit 
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49822
diff
changeset

136 
set definition and alternative name have been discontinued. The 
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49822
diff
changeset

137 
former behavior of "typedef (open) t = A" is now the default, but 
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49822
diff
changeset

138 
written just "typedef t = A". INCOMPATIBILITY, need to adapt theories 
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49822
diff
changeset

139 
accordingly. 
c13b39542972
simplified 'typedef' specifications: discontinued implicit set definition and alternative name;
wenzelm
parents:
49822
diff
changeset

140 

49822
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49770
diff
changeset

141 
* Theory "Library/Multiset": 
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49770
diff
changeset

142 

0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49770
diff
changeset

143 
 Renamed constants 
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49770
diff
changeset

144 
fold_mset ~> Multiset.fold  for coherence with other fold combinators 
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49770
diff
changeset

145 

0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49770
diff
changeset

146 
 Renamed facts 
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49770
diff
changeset

147 
fold_mset_commute ~> fold_mset_comm  for coherence with fold_comm 
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49770
diff
changeset

148 

0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49770
diff
changeset

149 
INCOMPATIBILITY. 
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49770
diff
changeset

150 

49739  151 
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. 
152 

49738  153 
* Class "comm_monoid_diff" formalises properties of bounded 
49388  154 
subtraction, with natural numbers and multisets as typical instances. 
155 

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

158 

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

49145  161 
* Renamed theory Library/List_Prefix to Library/Sublist. 
162 
INCOMPATIBILITY. Related changes are: 

163 

164 
 Renamed constants: 

165 

166 
prefix ~> prefixeq 

167 
strict_prefix ~> prefix 

168 

169 
Renamed lemmas accordingly, INCOMPATIBILITY. 

170 

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

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

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

174 
accordingly. INCOMPATIBILITY. 

175 

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

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

178 

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

180 
instances for the prefix order (merely corresponding locale 

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

182 
Library/Prefix_Order. INCOMPATIBILITY. 

183 

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

185 
"Sublist.sub". Replaced lemmas: 

186 

187 
le_list_append_le_same_iff ~> Sublist.sub_append_le_same_iff 

188 
le_list_append_mono ~> Sublist.emb_append_mono 

189 
le_list_below_empty ~> Sublist.emb_Nil, Sublist.emb_Nil2 

190 
le_list_Cons_EX ~> Sublist.emb_ConsD 

191 
le_list_drop_Cons2 ~> Sublist.sub_Cons2' 

192 
le_list_drop_Cons_neq ~> Sublist.sub_Cons2_neq 

193 
le_list_drop_Cons ~> Sublist.sub_Cons' 

194 
le_list_drop_many ~> Sublist.sub_drop_many 

195 
le_list_filter_left ~> Sublist.sub_filter_left 

196 
le_list_rev_drop_many ~> Sublist.sub_rev_drop_many 

197 
le_list_rev_take_iff ~> Sublist.sub_append 

198 
le_list_same_length ~> Sublist.sub_same_length 

199 
le_list_take_many_iff ~> Sublist.sub_append' 

200 
less_eq_list.drop ~> less_eq_list_drop 

201 
less_eq_list.induct ~> less_eq_list_induct 

202 
not_le_list_length ~> Sublist.not_sub_length 

203 

204 
INCOMPATIBILITY. 

205 

49962
a8cc904a6820
Renamed {left,right}_distrib to distrib_{right,left}.
webertj
parents:
49918
diff
changeset

206 
* HOL/Rings: renamed lemmas 
a8cc904a6820
Renamed {left,right}_distrib to distrib_{right,left}.
webertj
parents:
49918
diff
changeset

207 

a8cc904a6820
Renamed {left,right}_distrib to distrib_{right,left}.
webertj
parents:
49918
diff
changeset

208 
left_distrib ~> distrib_right 
a8cc904a6820
Renamed {left,right}_distrib to distrib_{right,left}.
webertj
parents:
49918
diff
changeset

209 
right_distrib ~> distrib_left 
a8cc904a6820
Renamed {left,right}_distrib to distrib_{right,left}.
webertj
parents:
49918
diff
changeset

210 

a8cc904a6820
Renamed {left,right}_distrib to distrib_{right,left}.
webertj
parents:
49918
diff
changeset

211 
in class semiring. INCOMPATIBILITY. 
a8cc904a6820
Renamed {left,right}_distrib to distrib_{right,left}.
webertj
parents:
49918
diff
changeset

212 

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

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

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

215 
nonfree datatypes. 
48977  216 

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

48977  219 

50141  220 
* HOL/Probability: 
221 
 Add simproc "measurable" to automatically prove measurability 

222 

223 
 Add induction rules for sigma sets with disjoint union (sigma_sets_induct_disjoint) 

224 
and for Borelmeasurable functions (borel_measurable_induct). 

225 

226 
 The DaniellKolmogorov theorem (the existence the limit of a projective family) 

227 

50140  228 
* Library/Countable_Set.thy: Theory of countable sets. 
229 

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

232 

50139
7eb626617bbe
NEWS (changeset 69b35a75caf3): document changes in FuncSet
hoelzl
parents:
50138
diff
changeset

233 
* Library/FuncSet.thy: Extended support for Pi and extensional and introduce the 
7eb626617bbe
NEWS (changeset 69b35a75caf3): document changes in FuncSet
hoelzl
parents:
50138
diff
changeset

234 
extensional dependent function space "PiE". Replaces extensional_funcset by an 
7eb626617bbe
NEWS (changeset 69b35a75caf3): document changes in FuncSet
hoelzl
parents:
50138
diff
changeset

235 
abbreviation, rename a couple of lemmas from extensional_funcset to PiE: 
7eb626617bbe
NEWS (changeset 69b35a75caf3): document changes in FuncSet
hoelzl
parents:
50138
diff
changeset

236 

7eb626617bbe
NEWS (changeset 69b35a75caf3): document changes in FuncSet
hoelzl
parents:
50138
diff
changeset

237 
extensional_empty ~> PiE_empty 
7eb626617bbe
NEWS (changeset 69b35a75caf3): document changes in FuncSet
hoelzl
parents:
50138
diff
changeset

238 
extensional_funcset_empty_domain ~> PiE_empty_domain 
7eb626617bbe
NEWS (changeset 69b35a75caf3): document changes in FuncSet
hoelzl
parents:
50138
diff
changeset

239 
extensional_funcset_empty_range ~> PiE_empty_range 
7eb626617bbe
NEWS (changeset 69b35a75caf3): document changes in FuncSet
hoelzl
parents:
50138
diff
changeset

240 
extensional_funcset_arb ~> PiE_arb 
7eb626617bbe
NEWS (changeset 69b35a75caf3): document changes in FuncSet
hoelzl
parents:
50138
diff
changeset

241 
extensional_funcset_mem > PiE_mem 
7eb626617bbe
NEWS (changeset 69b35a75caf3): document changes in FuncSet
hoelzl
parents:
50138
diff
changeset

242 
extensional_funcset_extend_domainI ~> PiE_fun_upd 
7eb626617bbe
NEWS (changeset 69b35a75caf3): document changes in FuncSet
hoelzl
parents:
50138
diff
changeset

243 
extensional_funcset_restrict_domain ~> fun_upd_in_PiE 
7eb626617bbe
NEWS (changeset 69b35a75caf3): document changes in FuncSet
hoelzl
parents:
50138
diff
changeset

244 
extensional_funcset_extend_domain_eq ~> PiE_insert_eq 
7eb626617bbe
NEWS (changeset 69b35a75caf3): document changes in FuncSet
hoelzl
parents:
50138
diff
changeset

245 
card_extensional_funcset ~> card_PiE 
7eb626617bbe
NEWS (changeset 69b35a75caf3): document changes in FuncSet
hoelzl
parents:
50138
diff
changeset

246 
finite_extensional_funcset ~> finite_PiE 
7eb626617bbe
NEWS (changeset 69b35a75caf3): document changes in FuncSet
hoelzl
parents:
50138
diff
changeset

247 

50232  248 
INCOMPATIBILITY. 
50139
7eb626617bbe
NEWS (changeset 69b35a75caf3): document changes in FuncSet
hoelzl
parents:
50138
diff
changeset

249 

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

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

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

252 

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

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

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

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

256 

49770
cf6a78acf445
efficient construction of red black trees from sorted associative lists
Andreas Lochbihler
parents:
49739
diff
changeset

257 
* Library/RBT_Impl.thy: efficient construction of redblack trees 
cf6a78acf445
efficient construction of red black trees from sorted associative lists
Andreas Lochbihler
parents:
49739
diff
changeset

258 
from sorted associative lists. Merging two trees with rbt_union may 
cf6a78acf445
efficient construction of red black trees from sorted associative lists
Andreas Lochbihler
parents:
49739
diff
changeset

259 
return a structurally different tree than before. MINOR INCOMPATIBILITY. 
cf6a78acf445
efficient construction of red black trees from sorted associative lists
Andreas Lochbihler
parents:
49739
diff
changeset

260 

50138  261 
* Library/IArray.thy: immutable arrays with code generation. 
262 

48206  263 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
264 
expressions. 

48111  265 

50034  266 
* Preprocessing of the code generator rewrites set comprehensions into 
267 
pointfree expressions. 

268 

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

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

270 

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

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

272 
It is switched on by default, and can be switched off by setting 
48977  273 
the configuration quickcheck_optimise_equality to false. 
47887  274 

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

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

276 
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

277 
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

278 
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

279 
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

280 

48094  281 
* Sledgehammer: 
282 

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

50219  285 
 Polished Isar proofs generated with "isar_proofs" option. 
48094  286 
 Rationalized type encodings ("type_enc" option). 
50219  287 
 Renamed "kill_provers" subcommand to "kill". 
48294  288 
 Renamed options: 
49918
cf441f4a358b
renamed Isarproof related options + changed semantics of Isar shrinking
blanchet
parents:
49869
diff
changeset

289 
isar_proof ~> isar_proofs 
50020  290 
isar_shrink_factor ~> isar_shrink 
48294  291 
max_relevant ~> max_facts 
292 
relevance_thresholds ~> fact_thresholds 

48094  293 

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

294 

48206  295 
*** Document preparation *** 
296 

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

298 
slightly exotic babel/greek. 

299 

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

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

301 
document/root_NAME.tex if that file exists, instead of the common 
be8002ee43d8
document variant NAME may use different LaTeX entry point document/root_NAME.tex if that file exists;
wenzelm
parents:
48586
diff
changeset

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

303 

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

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

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

306 

48206  307 

48992  308 
*** ML *** 
309 

49869
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset

310 
* Type Seq.results and related operations support embedded error 
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset

311 
messages within lazy enumerations, and thus allow to provide 
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset

312 
informative errors in the absence of any usable results. 
bd370af308f0
support for more informative errors in lazy enumerations;
wenzelm
parents:
49841
diff
changeset

313 

48992  314 
* Renamed Position.str_of to Position.here to emphasize that this is a 
315 
formal device to inline positions into message text, but not 

316 
necessarily printing visible text. 

317 

318 

48206  319 
*** System *** 
320 

50118
89a14e495526
adjust max_threads_value to capabilities of Poly/ML 5.5 and current hardware;
wenzelm
parents:
50110
diff
changeset

321 
* The default limit for maximum number of worker threads is now 8, 
89a14e495526
adjust max_threads_value to capabilities of Poly/ML 5.5 and current hardware;
wenzelm
parents:
50110
diff
changeset

322 
instead of 4. 
89a14e495526
adjust max_threads_value to capabilities of Poly/ML 5.5 and current hardware;
wenzelm
parents:
50110
diff
changeset

323 

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

326 
for homemade configurations. 

327 

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

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

329 
Minor INCOMPATIBILITY in commandline options. 
48936  330 

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

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

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

335 

336 
* Discontinued obsolete "isabelle makeall". 

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

337 

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

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

339 
Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that 
a5e3ba7cbb2a
discontinued obsolete IsaMakefile and ROOT.ML files from the Isabelle distribution;
wenzelm
parents:
48693
diff
changeset

340 
provides some traditional targets that invoke "isabelle build". Note 
a5e3ba7cbb2a
discontinued obsolete IsaMakefile and ROOT.ML files from the Isabelle distribution;
wenzelm
parents:
48693
diff
changeset

341 
that this is inefficient! Applications of Isabelle/HOL involving 
a5e3ba7cbb2a
discontinued obsolete IsaMakefile and ROOT.ML files from the Isabelle distribution;
wenzelm
parents:
48693
diff
changeset

342 
"isabelle make" should be upgraded to use "isabelle build" directly. 
a5e3ba7cbb2a
discontinued obsolete IsaMakefile and ROOT.ML files from the Isabelle distribution;
wenzelm
parents:
48693
diff
changeset

343 

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

346 

347 
isabelle build s b HOLCF 

348 

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

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

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

351 

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

354 
"isabelle usedir". 

355 

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

358 
version of Isabelle. 

359 

50132  360 
* The "isabelle install" tool has now a simpler commandline. Minor 
361 
INCOMPATIBILITY. 

362 

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

365 
configuration. 

366 

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

369 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

371 
bundled as Isabelle component. 

48206  372 

50182  373 
* Settings variable ISABELLE_PLATFORM_FAMILY refers to the general 
374 
platform family: "linux", "macos", "windows". 

375 

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

376 

47462  377 
New in Isabelle2012 (May 2012) 
378 
 

45109  379 

45593  380 
*** General *** 
381 

45614  382 
* Prover IDE (PIDE) improvements: 
383 

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

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

45614  391 

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

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

46485  395 

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

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

397 
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

398 
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

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

400 
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

401 

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

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

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

404 
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

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

406 

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

407 
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

408 

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

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

410 

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

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

412 

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

413 
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

414 
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

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

416 

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

417 
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

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

419 

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

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

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

47484  425 

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

428 
oldstyle "standard" after instantiation or composition of facts 

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

430 
indices of schematic variables. 

431 

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

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

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

435 
the historic accident of dynamic reevaluation in interpretations 

436 
etc. was exploited. 

437 

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

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

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

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

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

443 
of the material of that old tutorial. 

444 

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

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

447 
manual. 

448 

449 

450 
*** Pure *** 

451 

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

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

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

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

455 

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

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

459 
undocumented feature.) 

460 

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

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

464 

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

466 

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

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

469 

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

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

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

473 
order to accommodate newly introduced premises.) 

474 

47806  475 
* Renamed some inner syntax categories: 
476 

477 
num ~> num_token 

478 
xnum ~> xnum_token 

479 
xstr ~> str_token 

480 

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

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

483 
position information via constraints). 

484 

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

487 
manual. Minor INCOMPATIBILITY. 

488 

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

45134  491 

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

494 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  495 

47464  496 
* Redundant attribute "code_inline" has been discontinued. Use 
497 
"code_unfold" instead. INCOMPATIBILITY. 

498 

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

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

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

501 

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

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

503 

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

504 
INCOMPATIBILITY. 
45383  505 

47856  506 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
507 
instead. INCOMPATIBILITY. 

508 

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

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

511 
legacy since Isabelle2011). 

47855  512 

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

513 

45122  514 
*** HOL *** 
515 

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

518 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

523 
tinkering with former theorems mem_def and Collect_def as far as 

524 
possible. 

525 

526 
For developments which deliberately mix predicates and sets, a 

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

529 
Isabelle20111 before jumping right into the current release. 

530 

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

533 

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

535 

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

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

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

541 
user theories may require adaptations as follows: 

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

542 

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

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

544 
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

545 

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

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

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

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

549 

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

550 
 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

551 
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

552 

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

553 
 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

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

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

556 

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

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

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

559 

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

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

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

564 
corresponding parts of the Quotient package.) 

47809  565 

566 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

568 
relate different type instances of the same polymorphic constant, 

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

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

571 

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

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

574 

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

576 
equivalent subgoal on the corresponding raw types. Constants are 

577 
replaced with corresponding ones according to the transfer rules. 

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

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

583 

584 
 relator_eq attribute: Collects identity laws for relators of 

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

586 
transfer method uses these lemmas to infer transfer rules for 

587 
nonpolymorphic constants on the fly. 

588 

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

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

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

592 
after unfolding the constant definitions. 

593 

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

595 
from type nat to type int. 

596 

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

47809  599 

600 
 lift_definition command: Defines operations on an abstract type in 

601 
terms of a corresponding operation on a representation 

602 
type. Example syntax: 

603 

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

605 
is List.insert 

606 

607 
Users must discharge a respectfulness proof obligation when each 

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

609 
the proof is discharged automatically.) The obligation is 

610 
presented in a userfriendly, readable form; a respectfulness 

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

612 
by the package. 

613 

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

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

616 
lift_definition generates a code certificate theorem and sets up 

617 
code generation for each constant. 

618 

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

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

621 
or a type_definition theorem. The package configures transfer 

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

623 
lift_definition command to work with the type. 

624 

625 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  626 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
627 
Word/Word.thy and Library/Float.thy. 

47809  628 

629 
* Quotient package: 

630 

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

632 
rep and abs functions, similar to typedef. 

633 

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

635 
Transfer packages, as with 'setup_lifting'. 

636 

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

638 
respectfulness property at the point where the constant is 

639 
defined, similar to lift_definition; INCOMPATIBILITY. 

640 

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

642 
accordingly, INCOMPATIBILITY. 

643 

644 
* New diagnostic command 'find_unused_assms' to find potentially 

645 
superfluous assumptions in theorems using Quickcheck. 

646 

647 
* Quickcheck: 

648 

649 
 Quickcheck returns variable assignments as counterexamples, which 

650 
allows to reveal the underspecification of functions under test. 

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

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

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

654 

655 
These counterexample are marked as potentially spurious, as 

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

657 
obvious theorem "hd xs = hd xs". 

658 

659 
After finding a potentially spurious counterexample, Quickcheck 

660 
continues searching for genuine ones. 

661 

662 
By default, Quickcheck shows potentially spurious and genuine 

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

664 
show genuine counterexamples. 

665 

666 
 The command 'quickcheck_generator' creates random and exhaustive 

667 
value generators for a given type and operations. 

668 

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

670 
constructors of that type. 

671 

672 
 Support for multisets. 

673 

674 
 Added "use_subtype" options. 

675 

676 
 Added "quickcheck_locale" configuration to specify how to process 

677 
conjectures in a locale context. 

678 

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

47809  681 

682 
* Sledgehammer: 

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

684 
paper "More SPASS with Isabelle". 

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

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

687 
TFF1), iProver, iProverEq. 

688 
 Sped up the minimizer. 

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

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

691 
 Renamed "sound" option to "strict". 

692 

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

695 

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

697 

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

47809  699 

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

702 

703 
list.exhaust [case_product nat.exhaust] 

704 

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

706 
a list and a nat. 

707 

47809  708 
* New "eventually_elim" method as a generalized variant of the 
47855  709 
eventually_elim* rules. Supports structured proofs. 
710 

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

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

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

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

714 

47856  715 
* Record: code generation can be switched off manually with 
716 

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

718 

719 
* Datatype: type parameters allow explicit sort constraints. 

720 

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

723 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

725 
one_case. 

726 

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

728 
the result of the fact expression. 

729 

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

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

733 

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

734 
converse_def ~> converse_unfold 
47549  735 
rel_comp_def ~> relcomp_unfold 
47820  736 
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

737 
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

738 
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

739 
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

740 

46981  741 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
742 

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

47086  745 

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

746 
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

747 

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

46458  751 
rel_pow_1 ~> relpow_1 
46363  752 
rel_pow_0_I ~> relpow_0_I 
753 
rel_pow_Suc_I ~> relpow_Suc_I 

754 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

755 
rel_pow_0_E ~> relpow_0_E 

756 
rel_pow_Suc_E ~> relpow_Suc_E 

757 
rel_pow_E ~> relpow_E 

46458  758 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  759 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  760 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
761 
rel_pow_E2 ~> relpow_E2 

762 
rel_pow_add ~> relpow_add 

763 
rel_pow_commute ~> relpow 

764 
rel_pow_empty ~> relpow_empty: 

765 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

766 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

767 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

768 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

769 
rel_pow_fun_conv ~> relpow_fun_conv 

770 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

771 
rel_pow_finite_bounded ~> relpow_finite_bounded 

772 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

773 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

774 
single_valued_rel_pow ~> single_valued_relpow 

47463  775 

46363  776 
INCOMPATIBILITY. 
777 

47448  778 
* Theory Relation: Consolidated constant name for relation composition 
47464  779 
and corresponding theorem names: 
780 

47549  781 
 Renamed constant rel_comp to relcomp. 
47464  782 

47448  783 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  784 

47448  785 
 Renamed theorems: 
47464  786 

47448  787 
rel_compI ~> relcompI 
788 
rel_compEpair ~> relcompEpair 

789 
rel_compE ~> relcompE 

790 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

791 
rel_comp_empty1 ~> relcomp_empty1 

792 
rel_comp_mono ~> relcomp_mono 

793 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

794 
rel_comp_distrib ~> relcomp_distrib 

795 
rel_comp_distrib2 ~> relcomp_distrib2 

796 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

797 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

798 
single_valued_rel_comp ~> single_valued_relcomp 

47549  799 
rel_comp_def ~> relcomp_unfold 
47448  800 
converse_rel_comp ~> converse_relcomp 
801 
pred_compI ~> relcomppI 

802 
pred_compE ~> relcomppE 

803 
pred_comp_bot1 ~> relcompp_bot1 

804 
pred_comp_bot2 ~> relcompp_bot2 

805 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

806 
pred_comp_mono ~> relcompp_mono 

807 
pred_comp_distrib ~> relcompp_distrib 

808 
pred_comp_distrib2 ~> relcompp_distrib2 

809 
converse_pred_comp ~> converse_relcompp 

47464  810 

47448  811 
finite_rel_comp ~> finite_relcomp 
47464  812 

47448  813 
set_rel_comp ~> set_relcomp 
814 

815 
INCOMPATIBILITY. 

816 

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

819 

820 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

821 
zdiv_self ~> div_self 

822 
zmod_self ~> mod_self 

823 
zdiv_zero ~> div_0 

824 
zmod_zero ~> mod_0 

825 
zdiv_zmod_equality ~> div_mod_equality2 

826 
zdiv_zmod_equality2 ~> div_mod_equality 

827 
zmod_zdiv_trivial ~> mod_div_trivial 

828 
zdiv_zminus_zminus ~> div_minus_minus 

829 
zmod_zminus_zminus ~> mod_minus_minus 

830 
zdiv_zminus2 ~> div_minus_right 

831 
zmod_zminus2 ~> mod_minus_right 

832 
zdiv_minus1_right ~> div_minus1_right 

833 
zmod_minus1_right ~> mod_minus1_right 

834 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

835 
zmod_zmult1_eq ~> mod_mult_right_eq 

836 
zpower_zmod ~> power_mod 

837 
zdvd_zmod ~> dvd_mod 

838 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

839 
mod_mult_distrib ~> mult_mod_left 

840 
mod_mult_distrib2 ~> mult_mod_right 

841 

842 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

843 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

844 

47551  845 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
846 

47552  847 
* Consolidated theorem names concerning fold combinators: 
47550  848 

849 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

850 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

851 
INFI_fold_inf ~> INF_fold_inf 

852 
SUPR_fold_sup ~> SUP_fold_sup 

853 
union_set ~> union_set_fold 

854 
minus_set ~> minus_set_fold 

855 
INFI_set_fold ~> INF_set_fold 

856 
SUPR_set_fold ~> SUP_set_fold 

857 
INF_code ~> INF_set_foldr 

858 
SUP_code ~> SUP_set_foldr 

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

860 
foldr_fold_rev ~> foldr_conv_fold 

861 
foldl_fold ~> foldl_conv_fold 

862 
foldr_foldr ~> foldr_conv_foldl 

863 
foldl_foldr ~> foldl_conv_foldr 

47552  864 
fold_set_remdups ~> fold_set_fold_remdups 
865 
fold_set ~> fold_set_fold 

866 
fold1_set ~> fold1_set_fold 

47550  867 

868 
INCOMPATIBILITY. 

869 

870 
* Dropped rarely useful theorems concerning fold combinators: 

871 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

872 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

873 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

874 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

875 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

876 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

880 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

881 

882 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

883 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

884 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

885 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

887 
fold_conv_foldr and fold_rev. 

888 

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

890 
through option types. 

891 

47856  892 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
893 
relations. 

894 

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

896 

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

898 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

899 

900 
zminus_zminus ~> minus_minus 

901 
zminus_0 ~> minus_zero 

902 
zminus_zadd_distrib ~> minus_add_distrib 

903 
zadd_commute ~> add_commute 

904 
zadd_assoc ~> add_assoc 

905 
zadd_left_commute ~> add_left_commute 

906 
zadd_ac ~> add_ac 

907 
zmult_ac ~> mult_ac 

908 
zadd_0 ~> add_0_left 

909 
zadd_0_right ~> add_0_right 

910 
zadd_zminus_inverse2 ~> left_minus 

911 
zmult_zminus ~> mult_minus_left 

912 
zmult_commute ~> mult_commute 

913 
zmult_assoc ~> mult_assoc 

914 
zadd_zmult_distrib ~> left_distrib 

915 
zadd_zmult_distrib2 ~> right_distrib 

916 
zdiff_zmult_distrib ~> left_diff_distrib 

917 
zdiff_zmult_distrib2 ~> right_diff_distrib 

918 
zmult_1 ~> mult_1_left 

919 
zmult_1_right ~> mult_1_right 

920 
zle_refl ~> order_refl 

921 
zle_trans ~> order_trans 

922 
zle_antisym ~> order_antisym 

923 
zle_linear ~> linorder_linear 

924 
zless_linear ~> linorder_less_linear 

925 
zadd_left_mono ~> add_left_mono 

926 
zadd_strict_right_mono ~> add_strict_right_mono 

927 
zadd_zless_mono ~> add_less_le_mono 

928 
int_0_less_1 ~> zero_less_one 

929 
int_0_neq_1 ~> zero_neq_one 

930 
zless_le ~> less_le 

931 
zpower_zadd_distrib ~> power_add 

932 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

933 
zero_le_zpower_abs ~> zero_le_power_abs 

934 

935 
* Theory Deriv: Renamed 

936 

937 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

938 

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

940 

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

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

945 
INCOMPATIBILITY. 

946 

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

949 

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

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

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

954 
follows: 

47452  955 

956 
Operations: 

957 
bulkload > rbt_bulkload 

958 
del_from_left > rbt_del_from_left 

959 
del_from_right > rbt_del_from_right 

960 
del > rbt_del 

961 
delete > rbt_delete 

962 
ins > rbt_ins 

963 
insert > rbt_insert 

964 
insertw > rbt_insert_with 

965 
insert_with_key > rbt_insert_with_key 

966 
map_entry > rbt_map_entry 

967 
lookup > rbt_lookup 

968 
sorted > rbt_sorted 

969 
tree_greater > rbt_greater 

970 
tree_less > rbt_less 

971 
tree_less_symbol > rbt_less_symbol 

972 
union > rbt_union 

973 
union_with > rbt_union_with 

974 
union_with_key > rbt_union_with_key 

975 

976 
Lemmas: 

977 
balance_left_sorted > balance_left_rbt_sorted 

978 
balance_left_tree_greater > balance_left_rbt_greater 

979 
balance_left_tree_less > balance_left_rbt_less 

980 
balance_right_sorted > balance_right_rbt_sorted 

981 
balance_right_tree_greater > balance_right_rbt_greater 

982 
balance_right_tree_less > balance_right_rbt_less 

983 
balance_sorted > balance_rbt_sorted 

984 
balance_tree_greater > balance_rbt_greater 

985 
balance_tree_less > balance_rbt_less 

986 
bulkload_is_rbt > rbt_bulkload_is_rbt 

987 
combine_sorted > combine_rbt_sorted 

988 
combine_tree_greater > combine_rbt_greater 

989 
combine_tree_less > combine_rbt_less 

990 
delete_in_tree > rbt_delete_in_tree 

991 
delete_is_rbt > rbt_delete_is_rbt 

992 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

993 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

994 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

995 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

996 
del_in_tree > rbt_del_in_tree 

997 
del_inv1_inv2 > rbt_del_inv1_inv2 

998 
del_sorted > rbt_del_rbt_sorted 

999 
del_tree_greater > rbt_del_rbt_greater 

1000 
del_tree_less > rbt_del_rbt_less 

1001 
dom_lookup_Branch > dom_rbt_lookup_Branch 

1002 
entries_lookup > entries_rbt_lookup 

1003 
finite_dom_lookup > finite_dom_rbt_lookup 

1004 
insert_sorted > rbt_insert_rbt_sorted 

1005 
insertw_is_rbt > rbt_insertw_is_rbt 

1006 
insertwk_is_rbt > rbt_insertwk_is_rbt 

1007 
insertwk_sorted > rbt_insertwk_rbt_sorted 

1008 
insertw_sorted > rbt_insertw_rbt_sorted 

1009 
ins_sorted > ins_rbt_sorted 

1010 
ins_tree_greater > ins_rbt_greater 

1011 
ins_tree_less > ins_rbt_less 

1012 
is_rbt_sorted > is_rbt_rbt_sorted 

1013 
lookup_balance > rbt_lookup_balance 

1014 
lookup_bulkload > rbt_lookup_rbt_bulkload 

1015 
lookup_delete > rbt_lookup_rbt_delete 

1016 
lookup_Empty > rbt_lookup_Empty 

1017 
lookup_from_in_tree > rbt_lookup_from_in_tree 

1018 
lookup_in_tree > rbt_lookup_in_tree 

1019 
lookup_ins > rbt_lookup_ins 

1020 
lookup_insert > rbt_lookup_rbt_insert 

1021 
lookup_insertw > rbt_lookup_rbt_insertw 

1022 
lookup_insertwk > rbt_lookup_rbt_insertwk 

1023 
lookup_keys > rbt_lookup_keys 

1024 
lookup_map > rbt_lookup_map 

1025 
lookup_map_entry > rbt_lookup_rbt_map_entry 

1026 
lookup_tree_greater > rbt_lookup_rbt_greater 

1027 
lookup_tree_less > rbt_lookup_rbt_less 

1028 
lookup_union > rbt_lookup_rbt_union 

1029 
map_entry_color_of > rbt_map_entry_color_of 

1030 
map_entry_inv1 > rbt_map_entry_inv1 

1031 
map_entry_inv2 > rbt_map_entry_inv2 

1032 
map_entry_is_rbt > rbt_map_entry_is_rbt 

1033 
map_entry_sorted > rbt_map_entry_rbt_sorted 

1034 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

1035 
map_entry_tree_less > rbt_map_entry_rbt_less 

1036 
map_tree_greater > map_rbt_greater 

1037 
map_tree_less > map_rbt_less 

1038 
map_sorted > map_rbt_sorted 

1039 
paint_sorted > paint_rbt_sorted 

1040 
paint_lookup > paint_rbt_lookup 

1041 
paint_tree_greater > paint_rbt_greater 

1042 
paint_tree_less > paint_rbt_less 

1043 
sorted_entries > rbt_sorted_entries 

1044 
tree_greater_eq_trans > rbt_greater_eq_trans 

1045 
tree_greater_nit > rbt_greater_nit 

1046 
tree_greater_prop > rbt_greater_prop 

1047 
tree_greater_simps > rbt_greater_simps 

1048 
tree_greater_trans > rbt_greater_trans 

1049 
tree_less_eq_trans > rbt_less_eq_trans 

1050 
tree_less_nit > rbt_less_nit 

1051 
tree_less_prop > rbt_less_prop 

1052 
tree_less_simps > rbt_less_simps 

1053 
tree_less_trans > rbt_less_trans 

1054 
tree_ord_props > rbt_ord_props 

1055 
union_Branch > rbt_union_Branch 

1056 
union_is_rbt > rbt_union_is_rbt 

1057 
unionw_is_rbt > rbt_unionw_is_rbt 

1058 
unionwk_is_rbt > rbt_unionwk_is_rbt 

1059 
unionwk_sorted > rbt_unionwk_rbt_sorted 

1060 

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

1063 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  1064 

1065 
Changed Operations: 

47622  1066 
float_abs > abs 
1067 
float_nprt > nprt 

1068 
float_pprt > pprt 

1069 
pow2 > use powr 

1070 
round_down > float_round_down 

1071 
round_up > float_round_up 

1072 
scale > exponent 

1073 

1074 
Removed Operations: 

1075 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

1076 

1077 
Renamed Lemmas: 

1078 
abs_float_def > Float.compute_float_abs 

1079 
bitlen_ge0 > bitlen_nonneg 

1080 
bitlen.simps > Float.compute_bitlen 

1081 
float_components > Float_mantissa_exponent 

1082 
float_divl.simps > Float.compute_float_divl 

1083 
float_divr.simps > Float.compute_float_divr 

1084 
float_eq_odd > mult_powr_eq_mult_powr_iff 

1085 
float_power > real_of_float_power 

1086 
lapprox_posrat_def > Float.compute_lapprox_posrat 

1087 
lapprox_rat.simps > Float.compute_lapprox_rat 

1088 
le_float_def' > Float.compute_float_le 

1089 
le_float_def > less_eq_float.rep_eq 

1090 
less_float_def' > Float.compute_float_less 

1091 
less_float_def > less_float.rep_eq 

1092 
normfloat_def > Float.compute_normfloat 

1093 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

1094 
normfloat > normfloat_def 

1095 
normfloat_unique > use normfloat_def 

1096 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

1097 
one_float_def > Float.compute_float_one 

1098 
plus_float_def > Float.compute_float_plus 

1099 
rapprox_posrat_def > Float.compute_rapprox_posrat 

1100 
rapprox_rat.simps > Float.compute_rapprox_rat 

1101 
real_of_float_0 > zero_float.rep_eq 

1102 
real_of_float_1 > one_float.rep_eq 

1103 
real_of_float_abs > abs_float.rep_eq 

1104 
real_of_float_add > plus_float.rep_eq 

1105 
real_of_float_minus > uminus_float.rep_eq 

1106 
real_of_float_mult > times_float.rep_eq 

1107 
real_of_float_simp > Float.rep_eq 

1108 
real_of_float_sub > minus_float.rep_eq 

1109 
round_down.simps > Float.compute_float_round_down 

1110 
round_up.simps > Float.compute_float_round_up 

1111 
times_float_def > Float.compute_float_times 

1112 
uminus_float_def > Float.compute_float_uminus 

1113 
zero_float_def > Float.compute_float_zero 

1114 

1115 
Lemmas not necessary anymore, use the transfer method: 

1116 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

1117 
float_divr, float_le_simp, float_less1_mantissa_bound, 

1118 
float_less_simp, float_less_zero, float_le_zero, 

1119 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

1120 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

1121 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

1122 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

1123 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

1124 
round_up, zero_le_float, zero_less_float 

47616  1125 

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

45791  1128 

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

1131 

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

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

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

1136 

1137 
* Session HOLWord: Discontinued many redundant theorems specific to 

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

1139 
instead. 

1140 

1141 
word_sub_alt ~> word_sub_wi 

1142 
word_add_alt ~> word_add_def 

1143 
word_mult_alt ~> word_mult_def 

1144 
word_minus_alt ~> word_minus_def 

1145 
word_0_alt ~> word_0_wi 

1146 
word_1_alt ~> word_1_wi 

1147 
word_add_0 ~> add_0_left 

1148 
word_add_0_right ~> add_0_right 

1149 
word_mult_1 ~> mult_1_left 

1150 
word_mult_1_right ~> mult_1_right 

1151 
word_add_commute ~> add_commute 

1152 
word_add_assoc ~> add_assoc 

1153 
word_add_left_commute ~> add_left_commute 

1154 
word_mult_commute ~> mult_commute 

1155 
word_mult_assoc ~> mult_assoc 

1156 
word_mult_left_commute ~> mult_left_commute 

1157 
word_left_distrib ~> left_distrib 

1158 
word_right_distrib ~> right_distrib 

1159 
word_left_minus ~> left_minus 

1160 
word_diff_0_right ~> diff_0_right 

1161 
word_diff_self ~> diff_self 

1162 
word_sub_def ~> diff_minus 

1163 
word_diff_minus ~> diff_minus 

1164 
word_add_ac ~> add_ac 

1165 
word_mult_ac ~> mult_ac 

1166 
word_plus_ac0 ~> add_0_left add_0_right add_ac 

1167 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 

1168 
word_order_trans ~> order_trans 

1169 
word_order_refl ~> order_refl 

1170 
word_order_antisym ~> order_antisym 

1171 
word_order_linear ~> linorder_linear 

1172 
lenw1_zero_neq_one ~> zero_neq_one 

1173 
word_number_of_eq ~> number_of_eq 

1174 
word_of_int_add_hom ~> wi_hom_add 

1175 
word_of_int_sub_hom ~> wi_hom_sub 

1176 
word_of_int_mult_hom ~> wi_hom_mult 

1177 
word_of_int_minus_hom ~> wi_hom_neg 

1178 
word_of_int_succ_hom ~> wi_hom_succ 

1179 
word_of_int_pred_hom ~> wi_hom_pred 

1180 
word_of_int_0_hom ~> word_0_wi 

1181 
word_of_int_1_hom ~> word_1_wi 

1182 

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

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

1186 
multiplication, shifting by constants, bitwise operators and numeric 

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

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

1191 

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

1194 
measure_space. The locales based on subset_class now have two 

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

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

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

1200 
Measure space constructions for distributions and densities now got 

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

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

1203 
and point_measure is introduced. INCOMPATIBILITY. 

47694  1204 

1205 
Renamed constants: 

1206 
measure > emeasure 

1207 
finite_measure.\<mu>' > measure 

1208 
product_algebra_generator > prod_algebra 

1209 
product_prob_space.emb > prod_emb 

1210 
product_prob_space.infprod_algebra > PiM 

1211 

1212 
Removed locales: 

1213 
completeable_measure_space 

1214 
finite_measure_space 

1215 
finite_prob_space 

1216 
finite_product_finite_prob_space 

1217 
finite_product_sigma_algebra 

1218 
finite_sigma_algebra 

1219 
measure_space 

1220 
pair_finite_prob_space 

1221 
pair_finite_sigma_algebra 

1222 
pair_finite_space 

1223 
pair_sigma_algebra 

1224 
product_sigma_algebra 

1225 

1226 
Removed constants: 

47751  1227 
conditional_space 
47694  1228 
distribution > use distr measure, or distributed predicate 
47751  1229 
image_space 
47694  1230 
joint_distribution > use distr measure, or distributed predicate 
47751  1231 
pair_measure_generator 
47694  1232 
product_prob_space.infprod_algebra > use PiM 
1233 
subvimage 

1234 

1235 
Replacement theorems: 

47751  1236 
finite_additivity_sufficient > ring_of_sets.countably_additiveI_finite 
1237 
finite_measure.empty_measure > measure_empty 

1238 
finite_measure.finite_continuity_from_above > finite_measure.finite_Lim_measure_decseq 

1239 
finite_measure.finite_continuity_from_below > finite_measure.finite_Lim_measure_incseq 

1240 
finite_measure.finite_measure_countably_subadditive > finite_measure.finite_measure_subadditive_countably 

1241 
finite_measure.finite_measure_eq > finite_measure.emeasure_eq_measure 

1242 
finite_measure.finite_measure > finite_measure.emeasure_finite 

1243 
finite_measure.finite_measure_finite_singleton > finite_measure.finite_measure_eq_setsum_singleton 

1244 
finite_measure.positive_measure' > measure_nonneg 

1245 
finite_measure.real_measure > finite_measure.emeasure_real 

1246 
finite_product_prob_space.finite_measure_times > finite_product_prob_space.finite_measure_PiM_emb 

1247 
finite_product_sigma_algebra.in_P > sets_PiM_I_finite 

1248 
finite_product_sigma_algebra.P_empty > space_PiM_empty, sets_PiM_empty 

1249 
information_space.conditional_entropy_eq > information_space.conditional_entropy_simple_distributed 

1250 
information_space.conditional_entropy_positive > information_space.conditional_entropy_nonneg_simple 

1251 
information_space.conditional_mutual_information_eq_mutual_information > information_space.conditional_mutual_information_eq_mutual_information_simple 

1252 
information_space.conditional_mutual_information_generic_positive > information_space.conditional_mutual_information_nonneg_simple 

1253 
information_space.conditional_mutual_information_positive > information_space.conditional_mutual_information_nonneg_simple 

1254 
information_space.entropy_commute > information_space.entropy_commute_simple 

1255 
information_space.entropy_eq > information_space.entropy_simple_distributed 

1256 
information_space.entropy_generic_eq > information_space.entropy_simple_distributed 

1257 
information_space.entropy_positive > information_space.entropy_nonneg_simple 

1258 
information_space.entropy_uniform_max > information_space.entropy_uniform 

1259 
information_space.KL_eq_0_imp > information_space.KL_eq_0_iff_eq 

1260 
information_space.KL_eq_0 > information_space.KL_same_eq_0 

1261 
information_space.KL_ge_0 > information_space.KL_nonneg 

1262 
information_space.mutual_information_eq > information_space.mutual_information_simple_distributed 

1263 
information_space.mutual_information_positive > information_space.mutual_information_nonneg_simple 

1264 
Int_stable_cuboids > Int_stable_atLeastAtMost 

1265 
Int_stable_product_algebra_generator > positive_integral 

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

47694  1267 
measure_space.additive > emeasure_additive 
47751  1268 
measure_space.AE_iff_null_set > AE_iff_null 
1269 
measure_space.almost_everywhere_def > eventually_ae_filter 

1270 
measure_space.almost_everywhere_vimage > AE_distrD 

1271 
measure_space.continuity_from_above > INF_emeasure_decseq 

1272 
measure_space.continuity_from_above_Lim > Lim_emeasure_decseq 

1273 
measure_space.continuity_from_below_Lim > Lim_emeasure_incseq 

47694  1274 
measure_space.continuity_from_below > SUP_emeasure_incseq 
47751  1275 
measure_space_density > emeasure_density 
1276 
measure_space.density_is_absolutely_continuous > absolutely_continuousI_density 

1277 
measure_space.integrable_vimage > integrable_distr 

1278 
measure_space.integral_translated_density > integral_density 

1279 
measure_space.integral_vimage > integral_distr 

1280 
measure_space.measure_additive > plus_emeasure 

1281 
measure_space.measure_compl > emeasure_compl 

1282 
measure_space.measure_countable_increasing > emeasure_countable_increasing 

1283 
measure_space.measure_countably_subadditive > emeasure_subadditive_countably 

47694  1284 
measure_space.measure_decseq > decseq_emeasure 
47751  1285 
measure_space.measure_Diff > emeasure_Diff 
1286 
measure_space.measure_Diff_null_set > emeasure_Diff_null_set 

47694  1287 
measure_space.measure_eq_0 > emeasure_eq_0 
1288 
measure_space.measure_finitely_subadditive > emeasure_subadditive_finite 

47751  1289 
measure_space.measure_finite_singleton > emeasure_eq_setsum_singleton 
1290 
measure_space.measure_incseq > incseq_emeasure 

1291 
measure_space.measure_insert > emeasure_insert 

1292 
measure_space.measure_mono > emeasure_mono 

1293 
measure_space.measure_not_negative > emeasure_not_MInf 

1294 
measure_space.measure_preserving_Int_stable > measure_eqI_generator_eq 

1295 
measure_space.measure_setsum > setsum_emeasure 

1296 
measure_space.measure_setsum_split > setsum_emeasure_cover 

47694  1297 
measure_space.measure_space_vimage > emeasure_distr 
47751  1298 
measure_space.measure_subadditive_finite > emeasure_subadditive_finite 
1299 
measure_space.measure_subadditive > subadditive 

1300 
measure_space.measure_top > emeasure_space 

1301 
measure_space.measure_UN_eq_0 > emeasure_UN_eq_0 

1302 
measure_space.measure_Un_null_set > emeasure_Un_null_set 

1303 
measure_space.positive_integral_translated_density > positive_integral_density 

1304 
measure_space.positive_integral_vimage > positive_integral_distr 

47694  1305 
measure_space.real_continuity_from_above > Lim_measure_decseq 
47751  1306 
measure_space.real_continuity_from_below > Lim_measure_incseq 
47694  1307 
measure_space.real_measure_countably_subadditive > measure_subadditive_countably 
47751  1308 
measure_space.real_measure_Diff > measure_Diff 
1309 
measure_space.real_measure_finite_Union > measure_finite_Union 

1310 
measure_space.real_measure_setsum_singleton > measure_eq_setsum_singleton 

1311 
measure_space.real_measure_subadditive > measure_subadditive 

1312 
measure_space.real_measure_Union > measure_Union 

1313 
measure_space.real_measure_UNION > measure_UNION 

47694  1314 
measure_space.simple_function_vimage > simple_function_comp 
1315 
measure_space.simple_integral_vimage > simple_integral_distr 

47751  1316 
measure_space.simple_integral_vimage > simple_integral_distr 
1317 
measure_unique_Int_stable > measure_eqI_generator_eq 

1318 
measure_unique_Int_stable_vimage > measure_eqI_generator_eq 

47694  1319 
pair_sigma_algebra.measurable_cut_fst > sets_Pair1 
1320 
pair_sigma_algebra.measurable_cut_snd > sets_Pair2 

1321 
pair_sigma_algebra.measurable_pair_image_fst > measurable_Pair1 

1322 
pair_sigma_algebra.measurable_pair_image_snd > measurable_Pair2 

1323 
pair_sigma_algebra.measurable_product_swap > measurable_pair_swap_iff 

1324 
pair_sigma_algebra.pair_sigma_algebra_measurable > measurable_pair_swap 

1325 
pair_sigma_algebra.pair_sigma_algebra_swap_measurable > measurable_pair_swap' 

1326 
pair_sigma_algebra.sets_swap > sets_pair_swap 

47751  1327 
pair_sigma_finite.measure_cut_measurable_fst > pair_sigma_finite.measurable_emeasure_Pair1 
1328 
pair_sigma_finite.measure_cut_measurable_snd > pair_sigma_finite.measurable_emeasure_Pair2 

1329 
pair_sigma_finite.measure_preserving_swap > pair_sigma_finite.distr_pair_swap 

1330 
pair_sigma_finite.pair_measure_alt2 > pair_sigma_finite.emeasure_pair_measure_alt2 

1331 
pair_sigma_finite.pair_measure_alt > pair_sigma_finite.emeasure_pair_measure_alt 

1332 
pair_sigma_finite.pair_measure_times > pair_sigma_finite.emeasure_pair_measure_Times 

1333 
prob_space.indep_distribution_eq_measure > prob_space.indep_vars_iff_distr_eq_PiM 

1334 
prob_space.indep_var_distributionD > prob_space.indep_var_distribution_eq 

47694  1335 
prob_space.measure_space_1 > prob_space.emeasure_space_1 
1336 
prob_space.prob_space_vimage > prob_space_distr 

1337 
prob_space.random_variable_restrict > measurable_restrict 

47751  1338 
prob_space_unique_Int_stable > measure_eqI_prob_space 
1339 
product_algebraE > prod_algebraE_all 

1340 
product_algebra_generator_der > prod_algebra_eq_finite 

1341 
product_algebra_generator_into_space > prod_algebra_sets_into_space 

1342 
product_algebraI > sets_PiM_I_finite 

1343 
product_measure_exists > product_sigma_finite.sigma_finite 

47694  1344 
product_prob_space.finite_index_eq_finite_product > product_prob_space.sets_PiM_generator 
1345 
product_prob_space.finite_measure_infprod_emb_Pi > product_prob_space.measure_PiM_emb 

1346 
product_prob_space.infprod_spec > product_prob_space.emeasure_PiM_emb_not_empty 

1347 
product_prob_space.measurable_component > measurable_component_singleton 

1348 
product_prob_space.measurable_emb > measurable_prod_emb 

1349 
product_prob_space.measurable_into_infprod_algebra > measurable_PiM_single 

1350 
product_prob_space.measurable_singleton_infprod > measurable_component_singleton 

1351 
product_prob_space.measure_emb > emeasure_prod_emb 

47751  1352 
product_prob_space.measure_preserving_restrict > product_prob_space.distr_restrict 
1353 
product_sigma_algebra.product_algebra_into_space > space_closed 

1354 
product_sigma_finite.measure_fold > product_sigma_finite.distr_merge 

1355 
product_sigma_finite.measure_preserving_component_singelton > product_sigma_finite.distr_singleton 

1356 
product_sigma_finite.measure_preserving_merge > product_sigma_finite.distr_merge 

47694  1357 
sequence_space.measure_infprod > sequence_space.measure_PiM_countable 
47751  1358 
sets_product_algebra > sets_PiM 
1359 
sigma_algebra.measurable_sigma > measurable_measure_of 

1360 
sigma_finite_measure.disjoint_sigma_finite > sigma_finite_disjoint 

1361 
sigma_finite_measure.RN_deriv_vimage > sigma_finite_measure.RN_deriv_distr 

1362 
sigma_product_algebra_sigma_eq > sigma_prod_algebra_sigma_eq 

1363 
space_product_algebra > space_PiM 

47694  1364 

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

47413  1367 

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

1368 

45160  1369 
*** FOL *** 
1370 

45383  1371 
* New "case_product" attribute (see HOL). 
45160  1372 

45109  1373 

47463  1374 
*** ZF *** 
1375 

1376 
* Greater support for structured proofs involving induction or case 

1377 
analysis. 

1378 

1379 
* Much greater use of mathematical symbols. 

1380 

1381 
* Removal of many ML theorem bindings. INCOMPATIBILITY. 

1382 

1383 

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

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

1385 

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

1388 

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

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

1390 
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

1391 
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

1392 

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

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

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

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

1396 
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

1397 
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

1398 
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

1399 
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

1400 
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

1401 

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

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

1403 
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

1404 

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

1407 
declarations like Local_Theory.note. 

1408 

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

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

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

1411 

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

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

1413 
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

1414 
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

1415 

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

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

1417 

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

1418 
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

1419 
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

1420 
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
