author  wenzelm 
Mon, 26 Nov 2012 19:53:43 +0100  
changeset 50232  289a34f9c383 
parent 50231  81a067b188b8 
child 50406  c28753665b8e 
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 

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

96 
now bundled exclusively with Isabelle. 

97 

98 

48205  99 
*** Pure *** 
100 

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

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

102 
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

103 

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

106 
the rather arbitrary current working directory. 

107 
INCOMPATIBILITY. 

108 

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

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

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

113 
with some care where this is really required. 

114 

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

117 
given given sort. Example (in HOL): 

118 

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

120 

48205  121 

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

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

123 

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

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

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

126 

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

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

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

129 

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

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

131 
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

132 
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

133 
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

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

135 

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

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

137 

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

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

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

140 

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

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

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

143 

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

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

145 

49739  146 
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. 
147 

49738  148 
* Class "comm_monoid_diff" formalises properties of bounded 
49388  149 
subtraction, with natural numbers and multisets as typical instances. 
150 

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

153 

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

49145  156 
* Renamed theory Library/List_Prefix to Library/Sublist. 
157 
INCOMPATIBILITY. Related changes are: 

158 

159 
 Renamed constants: 

160 

161 
prefix ~> prefixeq 

162 
strict_prefix ~> prefix 

163 

164 
Renamed lemmas accordingly, INCOMPATIBILITY. 

165 

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

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

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

169 
accordingly. INCOMPATIBILITY. 

170 

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

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

173 

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

175 
instances for the prefix order (merely corresponding locale 

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

177 
Library/Prefix_Order. INCOMPATIBILITY. 

178 

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

180 
"Sublist.sub". Replaced lemmas: 

181 

182 
le_list_append_le_same_iff ~> Sublist.sub_append_le_same_iff 

183 
le_list_append_mono ~> Sublist.emb_append_mono 

184 
le_list_below_empty ~> Sublist.emb_Nil, Sublist.emb_Nil2 

185 
le_list_Cons_EX ~> Sublist.emb_ConsD 

186 
le_list_drop_Cons2 ~> Sublist.sub_Cons2' 

187 
le_list_drop_Cons_neq ~> Sublist.sub_Cons2_neq 

188 
le_list_drop_Cons ~> Sublist.sub_Cons' 

189 
le_list_drop_many ~> Sublist.sub_drop_many 

190 
le_list_filter_left ~> Sublist.sub_filter_left 

191 
le_list_rev_drop_many ~> Sublist.sub_rev_drop_many 

192 
le_list_rev_take_iff ~> Sublist.sub_append 

193 
le_list_same_length ~> Sublist.sub_same_length 

194 
le_list_take_many_iff ~> Sublist.sub_append' 

195 
less_eq_list.drop ~> less_eq_list_drop 

196 
less_eq_list.induct ~> less_eq_list_induct 

197 
not_le_list_length ~> Sublist.not_sub_length 

198 

199 
INCOMPATIBILITY. 

200 

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

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

202 

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

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

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

205 

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

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

207 

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

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

209 
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

210 
nonfree datatypes. 
48977  211 

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

48977  214 

50141  215 
* HOL/Probability: 
216 
 Add simproc "measurable" to automatically prove measurability 

217 

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

219 
and for Borelmeasurable functions (borel_measurable_induct). 

220 

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

222 

50140  223 
* Library/Countable_Set.thy: Theory of countable sets. 
224 

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

227 

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

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

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

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

231 

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

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

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

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

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

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

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

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

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

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

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

242 

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

244 

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

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

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

247 

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

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

249 
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

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

251 

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

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

253 
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

254 
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

255 

50138  256 
* Library/IArray.thy: immutable arrays with code generation. 
257 

48206  258 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
259 
expressions. 

48111  260 

50034  261 
* Preprocessing of the code generator rewrites set comprehensions into 
262 
pointfree expressions. 

263 

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

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

265 

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

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

267 
It is switched on by default, and can be switched off by setting 
48977  268 
the configuration quickcheck_optimise_equality to false. 
47887  269 

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

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

271 
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

272 
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

273 
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

274 
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

275 

48094  276 
* Sledgehammer: 
277 

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

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

284 
isar_proof ~> isar_proofs 
50020  285 
isar_shrink_factor ~> isar_shrink 
48294  286 
max_relevant ~> max_facts 
287 
relevance_thresholds ~> fact_thresholds 

48094  288 

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

289 

48206  290 
*** Document preparation *** 
291 

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

293 
slightly exotic babel/greek. 

294 

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

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

296 
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

297 
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

298 

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

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

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

301 

48206  302 

48992  303 
*** ML *** 
304 

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

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

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

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

308 

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

311 
necessarily printing visible text. 

312 

313 

48206  314 
*** System *** 
315 

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

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

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

318 

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

321 
for homemade configurations. 

322 

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

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

324 
Minor INCOMPATIBILITY in commandline options. 
48936  325 

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

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

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

330 

331 
* Discontinued obsolete "isabelle makeall". 

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

332 

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

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

334 
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

335 
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

336 
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

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

338 

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

341 

342 
isabelle build s b HOLCF 

343 

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

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

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

346 

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

349 
"isabelle usedir". 

350 

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

353 
version of Isabelle. 

354 

50132  355 
* The "isabelle install" tool has now a simpler commandline. Minor 
356 
INCOMPATIBILITY. 

357 

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

360 
configuration. 

361 

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

364 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

366 
bundled as Isabelle component. 

48206  367 

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

370 

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

371 

47462  372 
New in Isabelle2012 (May 2012) 
373 
 

45109  374 

45593  375 
*** General *** 
376 

45614  377 
* Prover IDE (PIDE) improvements: 
378 

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

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

45614  386 

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

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

46485  390 

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

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

392 
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

393 
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

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

395 
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

396 

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

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

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

399 
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

400 
begin 
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 
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

403 

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

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

405 

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

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

407 

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

408 
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

409 
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

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

411 

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

412 
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

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

414 

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

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

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

47484  420 

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

423 
oldstyle "standard" after instantiation or composition of facts 

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

425 
indices of schematic variables. 

426 

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

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

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

430 
the historic accident of dynamic reevaluation in interpretations 

431 
etc. was exploited. 

432 

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

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

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

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

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

438 
of the material of that old tutorial. 

439 

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

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

442 
manual. 

443 

444 

445 
*** Pure *** 

446 

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

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

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

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

450 

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

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

454 
undocumented feature.) 

455 

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

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

459 

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

461 

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

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

464 

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

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

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

468 
order to accommodate newly introduced premises.) 

469 

47806  470 
* Renamed some inner syntax categories: 
471 

472 
num ~> num_token 

473 
xnum ~> xnum_token 

474 
xstr ~> str_token 

475 

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

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

478 
position information via constraints). 

479 

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

482 
manual. Minor INCOMPATIBILITY. 

483 

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

45134  486 

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

489 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  490 

47464  491 
* Redundant attribute "code_inline" has been discontinued. Use 
492 
"code_unfold" instead. INCOMPATIBILITY. 

493 

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

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

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

496 

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

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

498 

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

499 
INCOMPATIBILITY. 
45383  500 

47856  501 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
502 
instead. INCOMPATIBILITY. 

503 

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

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

506 
legacy since Isabelle2011). 

47855  507 

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

508 

45122  509 
*** HOL *** 
510 

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

513 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

518 
tinkering with former theorems mem_def and Collect_def as far as 

519 
possible. 

520 

521 
For developments which deliberately mix predicates and sets, a 

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

524 
Isabelle20111 before jumping right into the current release. 

525 

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

528 

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

530 

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

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

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

536 
user theories may require adaptations as follows: 

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

537 

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

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

539 
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

540 

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

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

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

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

544 

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

545 
 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

546 
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

547 

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

548 
 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

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

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

551 

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

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

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

554 

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

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

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

559 
corresponding parts of the Quotient package.) 

47809  560 

561 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

563 
relate different type instances of the same polymorphic constant, 

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

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

566 

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

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

569 

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

571 
equivalent subgoal on the corresponding raw types. Constants are 

572 
replaced with corresponding ones according to the transfer rules. 

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

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

578 

579 
 relator_eq attribute: Collects identity laws for relators of 

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

581 
transfer method uses these lemmas to infer transfer rules for 

582 
nonpolymorphic constants on the fly. 

583 

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

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

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

587 
after unfolding the constant definitions. 

588 

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

590 
from type nat to type int. 

591 

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

47809  594 

595 
 lift_definition command: Defines operations on an abstract type in 

596 
terms of a corresponding operation on a representation 

597 
type. Example syntax: 

598 

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

600 
is List.insert 

601 

602 
Users must discharge a respectfulness proof obligation when each 

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

604 
the proof is discharged automatically.) The obligation is 

605 
presented in a userfriendly, readable form; a respectfulness 

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

607 
by the package. 

608 

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

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

611 
lift_definition generates a code certificate theorem and sets up 

612 
code generation for each constant. 

613 

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

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

616 
or a type_definition theorem. The package configures transfer 

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

618 
lift_definition command to work with the type. 

619 

620 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  621 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
622 
Word/Word.thy and Library/Float.thy. 

47809  623 

624 
* Quotient package: 

625 

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

627 
rep and abs functions, similar to typedef. 

628 

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

630 
Transfer packages, as with 'setup_lifting'. 

631 

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

633 
respectfulness property at the point where the constant is 

634 
defined, similar to lift_definition; INCOMPATIBILITY. 

635 

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

637 
accordingly, INCOMPATIBILITY. 

638 

639 
* New diagnostic command 'find_unused_assms' to find potentially 

640 
superfluous assumptions in theorems using Quickcheck. 

641 

642 
* Quickcheck: 

643 

644 
 Quickcheck returns variable assignments as counterexamples, which 

645 
allows to reveal the underspecification of functions under test. 

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

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

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

649 

650 
These counterexample are marked as potentially spurious, as 

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

652 
obvious theorem "hd xs = hd xs". 

653 

654 
After finding a potentially spurious counterexample, Quickcheck 

655 
continues searching for genuine ones. 

656 

657 
By default, Quickcheck shows potentially spurious and genuine 

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

659 
show genuine counterexamples. 

660 

661 
 The command 'quickcheck_generator' creates random and exhaustive 

662 
value generators for a given type and operations. 

663 

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

665 
constructors of that type. 

666 

667 
 Support for multisets. 

668 

669 
 Added "use_subtype" options. 

670 

671 
 Added "quickcheck_locale" configuration to specify how to process 

672 
conjectures in a locale context. 

673 

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

47809  676 

677 
* Sledgehammer: 

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

679 
paper "More SPASS with Isabelle". 

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

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

682 
TFF1), iProver, iProverEq. 

683 
 Sped up the minimizer. 

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

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

686 
 Renamed "sound" option to "strict". 

687 

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

690 

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

692 

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

47809  694 

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

697 

698 
list.exhaust [case_product nat.exhaust] 

699 

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

701 
a list and a nat. 

702 

47809  703 
* New "eventually_elim" method as a generalized variant of the 
47855  704 
eventually_elim* rules. Supports structured proofs. 
705 

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

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

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

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

709 

47856  710 
* Record: code generation can be switched off manually with 
711 

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

713 

714 
* Datatype: type parameters allow explicit sort constraints. 

715 

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

718 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

720 
one_case. 

721 

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

723 
the result of the fact expression. 

724 

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

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

728 

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

729 
converse_def ~> converse_unfold 
47549  730 
rel_comp_def ~> relcomp_unfold 
47820  731 
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

732 
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

733 
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

734 
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

735 

46981  736 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
737 

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

47086  740 

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

741 
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

742 

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

46458  746 
rel_pow_1 ~> relpow_1 
46363  747 
rel_pow_0_I ~> relpow_0_I 
748 
rel_pow_Suc_I ~> relpow_Suc_I 

749 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

750 
rel_pow_0_E ~> relpow_0_E 

751 
rel_pow_Suc_E ~> relpow_Suc_E 

752 
rel_pow_E ~> relpow_E 

46458  753 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  754 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  755 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
756 
rel_pow_E2 ~> relpow_E2 

757 
rel_pow_add ~> relpow_add 

758 
rel_pow_commute ~> relpow 

759 
rel_pow_empty ~> relpow_empty: 

760 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

761 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

762 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

763 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

764 
rel_pow_fun_conv ~> relpow_fun_conv 

765 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

766 
rel_pow_finite_bounded ~> relpow_finite_bounded 

767 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

768 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

769 
single_valued_rel_pow ~> single_valued_relpow 

47463  770 

46363  771 
INCOMPATIBILITY. 
772 

47448  773 
* Theory Relation: Consolidated constant name for relation composition 
47464  774 
and corresponding theorem names: 
775 

47549  776 
 Renamed constant rel_comp to relcomp. 
47464  777 

47448  778 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  779 

47448  780 
 Renamed theorems: 
47464  781 

47448  782 
rel_compI ~> relcompI 
783 
rel_compEpair ~> relcompEpair 

784 
rel_compE ~> relcompE 

785 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

786 
rel_comp_empty1 ~> relcomp_empty1 

787 
rel_comp_mono ~> relcomp_mono 

788 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

789 
rel_comp_distrib ~> relcomp_distrib 

790 
rel_comp_distrib2 ~> relcomp_distrib2 

791 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

792 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

793 
single_valued_rel_comp ~> single_valued_relcomp 

47549  794 
rel_comp_def ~> relcomp_unfold 
47448  795 
converse_rel_comp ~> converse_relcomp 
796 
pred_compI ~> relcomppI 

797 
pred_compE ~> relcomppE 

798 
pred_comp_bot1 ~> relcompp_bot1 

799 
pred_comp_bot2 ~> relcompp_bot2 

800 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

801 
pred_comp_mono ~> relcompp_mono 

802 
pred_comp_distrib ~> relcompp_distrib 

803 
pred_comp_distrib2 ~> relcompp_distrib2 

804 
converse_pred_comp ~> converse_relcompp 

47464  805 

47448  806 
finite_rel_comp ~> finite_relcomp 
47464  807 

47448  808 
set_rel_comp ~> set_relcomp 
809 

810 
INCOMPATIBILITY. 

811 

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

814 

815 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

816 
zdiv_self ~> div_self 

817 
zmod_self ~> mod_self 

818 
zdiv_zero ~> div_0 

819 
zmod_zero ~> mod_0 

820 
zdiv_zmod_equality ~> div_mod_equality2 

821 
zdiv_zmod_equality2 ~> div_mod_equality 

822 
zmod_zdiv_trivial ~> mod_div_trivial 

823 
zdiv_zminus_zminus ~> div_minus_minus 

824 
zmod_zminus_zminus ~> mod_minus_minus 

825 
zdiv_zminus2 ~> div_minus_right 

826 
zmod_zminus2 ~> mod_minus_right 

827 
zdiv_minus1_right ~> div_minus1_right 

828 
zmod_minus1_right ~> mod_minus1_right 

829 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

830 
zmod_zmult1_eq ~> mod_mult_right_eq 

831 
zpower_zmod ~> power_mod 

832 
zdvd_zmod ~> dvd_mod 

833 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

834 
mod_mult_distrib ~> mult_mod_left 

835 
mod_mult_distrib2 ~> mult_mod_right 

836 

837 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

838 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

839 

47551  840 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
841 

47552  842 
* Consolidated theorem names concerning fold combinators: 
47550  843 

844 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

845 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

846 
INFI_fold_inf ~> INF_fold_inf 

847 
SUPR_fold_sup ~> SUP_fold_sup 

848 
union_set ~> union_set_fold 

849 
minus_set ~> minus_set_fold 

850 
INFI_set_fold ~> INF_set_fold 

851 
SUPR_set_fold ~> SUP_set_fold 

852 
INF_code ~> INF_set_foldr 

853 
SUP_code ~> SUP_set_foldr 

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

855 
foldr_fold_rev ~> foldr_conv_fold 

856 
foldl_fold ~> foldl_conv_fold 

857 
foldr_foldr ~> foldr_conv_foldl 

858 
foldl_foldr ~> foldl_conv_foldr 

47552  859 
fold_set_remdups ~> fold_set_fold_remdups 
860 
fold_set ~> fold_set_fold 

861 
fold1_set ~> fold1_set_fold 

47550  862 

863 
INCOMPATIBILITY. 

864 

865 
* Dropped rarely useful theorems concerning fold combinators: 

866 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

867 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

868 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

869 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

870 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

871 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

875 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

876 

877 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

878 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

879 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

880 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

882 
fold_conv_foldr and fold_rev. 

883 

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

885 
through option types. 

886 

47856  887 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
888 
relations. 

889 

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

891 

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

893 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

894 

895 
zminus_zminus ~> minus_minus 

896 
zminus_0 ~> minus_zero 

897 
zminus_zadd_distrib ~> minus_add_distrib 

898 
zadd_commute ~> add_commute 

899 
zadd_assoc ~> add_assoc 

900 
zadd_left_commute ~> add_left_commute 

901 
zadd_ac ~> add_ac 

902 
zmult_ac ~> mult_ac 

903 
zadd_0 ~> add_0_left 

904 
zadd_0_right ~> add_0_right 

905 
zadd_zminus_inverse2 ~> left_minus 

906 
zmult_zminus ~> mult_minus_left 

907 
zmult_commute ~> mult_commute 

908 
zmult_assoc ~> mult_assoc 

909 
zadd_zmult_distrib ~> left_distrib 

910 
zadd_zmult_distrib2 ~> right_distrib 

911 
zdiff_zmult_distrib ~> left_diff_distrib 

912 
zdiff_zmult_distrib2 ~> right_diff_distrib 

913 
zmult_1 ~> mult_1_left 

914 
zmult_1_right ~> mult_1_right 

915 
zle_refl ~> order_refl 

916 
zle_trans ~> order_trans 

917 
zle_antisym ~> order_antisym 

918 
zle_linear ~> linorder_linear 

919 
zless_linear ~> linorder_less_linear 

920 
zadd_left_mono ~> add_left_mono 

921 
zadd_strict_right_mono ~> add_strict_right_mono 

922 
zadd_zless_mono ~> add_less_le_mono 

923 
int_0_less_1 ~> zero_less_one 

924 
int_0_neq_1 ~> zero_neq_one 

925 
zless_le ~> less_le 

926 
zpower_zadd_distrib ~> power_add 

927 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

928 
zero_le_zpower_abs ~> zero_le_power_abs 

929 

930 
* Theory Deriv: Renamed 

931 

932 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

933 

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

935 

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

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

940 
INCOMPATIBILITY. 

941 

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

944 

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

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

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

949 
follows: 

47452  950 

951 
Operations: 

952 
bulkload > rbt_bulkload 

953 
del_from_left > rbt_del_from_left 

954 
del_from_right > rbt_del_from_right 

955 
del > rbt_del 

956 
delete > rbt_delete 

957 
ins > rbt_ins 

958 
insert > rbt_insert 

959 
insertw > rbt_insert_with 

960 
insert_with_key > rbt_insert_with_key 

961 
map_entry > rbt_map_entry 

962 
lookup > rbt_lookup 

963 
sorted > rbt_sorted 

964 
tree_greater > rbt_greater 

965 
tree_less > rbt_less 

966 
tree_less_symbol > rbt_less_symbol 

967 
union > rbt_union 

968 
union_with > rbt_union_with 

969 
union_with_key > rbt_union_with_key 

970 

971 
Lemmas: 

972 
balance_left_sorted > balance_left_rbt_sorted 

973 
balance_left_tree_greater > balance_left_rbt_greater 

974 
balance_left_tree_less > balance_left_rbt_less 

975 
balance_right_sorted > balance_right_rbt_sorted 

976 
balance_right_tree_greater > balance_right_rbt_greater 

977 
balance_right_tree_less > balance_right_rbt_less 

978 
balance_sorted > balance_rbt_sorted 

979 
balance_tree_greater > balance_rbt_greater 

980 
balance_tree_less > balance_rbt_less 

981 
bulkload_is_rbt > rbt_bulkload_is_rbt 

982 
combine_sorted > combine_rbt_sorted 

983 
combine_tree_greater > combine_rbt_greater 

984 
combine_tree_less > combine_rbt_less 

985 
delete_in_tree > rbt_delete_in_tree 

986 
delete_is_rbt > rbt_delete_is_rbt 

987 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

988 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

989 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

990 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

991 
del_in_tree > rbt_del_in_tree 

992 
del_inv1_inv2 > rbt_del_inv1_inv2 

993 
del_sorted > rbt_del_rbt_sorted 

994 
del_tree_greater > rbt_del_rbt_greater 

995 
del_tree_less > rbt_del_rbt_less 

996 
dom_lookup_Branch > dom_rbt_lookup_Branch 

997 
entries_lookup > entries_rbt_lookup 

998 
finite_dom_lookup > finite_dom_rbt_lookup 

999 
insert_sorted > rbt_insert_rbt_sorted 

1000 
insertw_is_rbt > rbt_insertw_is_rbt 

1001 
insertwk_is_rbt > rbt_insertwk_is_rbt 

1002 
insertwk_sorted > rbt_insertwk_rbt_sorted 

1003 
insertw_sorted > rbt_insertw_rbt_sorted 

1004 
ins_sorted > ins_rbt_sorted 

1005 
ins_tree_greater > ins_rbt_greater 

1006 
ins_tree_less > ins_rbt_less 

1007 
is_rbt_sorted > is_rbt_rbt_sorted 

1008 
lookup_balance > rbt_lookup_balance 

1009 
lookup_bulkload > rbt_lookup_rbt_bulkload 

1010 
lookup_delete > rbt_lookup_rbt_delete 

1011 
lookup_Empty > rbt_lookup_Empty 

1012 
lookup_from_in_tree > rbt_lookup_from_in_tree 

1013 
lookup_in_tree > rbt_lookup_in_tree 

1014 
lookup_ins > rbt_lookup_ins 

1015 
lookup_insert > rbt_lookup_rbt_insert 

1016 
lookup_insertw > rbt_lookup_rbt_insertw 

1017 
lookup_insertwk > rbt_lookup_rbt_insertwk 

1018 
lookup_keys > rbt_lookup_keys 

1019 
lookup_map > rbt_lookup_map 

1020 
lookup_map_entry > rbt_lookup_rbt_map_entry 

1021 
lookup_tree_greater > rbt_lookup_rbt_greater 

1022 
lookup_tree_less > rbt_lookup_rbt_less 

1023 
lookup_union > rbt_lookup_rbt_union 

1024 
map_entry_color_of > rbt_map_entry_color_of 

1025 
map_entry_inv1 > rbt_map_entry_inv1 

1026 
map_entry_inv2 > rbt_map_entry_inv2 

1027 
map_entry_is_rbt > rbt_map_entry_is_rbt 

1028 
map_entry_sorted > rbt_map_entry_rbt_sorted 

1029 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

1030 
map_entry_tree_less > rbt_map_entry_rbt_less 

1031 
map_tree_greater > map_rbt_greater 

1032 
map_tree_less > map_rbt_less 

1033 
map_sorted > map_rbt_sorted 

1034 
paint_sorted > paint_rbt_sorted 

1035 
paint_lookup > paint_rbt_lookup 

1036 
paint_tree_greater > paint_rbt_greater 

1037 
paint_tree_less > paint_rbt_less 

1038 
sorted_entries > rbt_sorted_entries 

1039 
tree_greater_eq_trans > rbt_greater_eq_trans 

1040 
tree_greater_nit > rbt_greater_nit 

1041 
tree_greater_prop > rbt_greater_prop 

1042 
tree_greater_simps > rbt_greater_simps 

1043 
tree_greater_trans > rbt_greater_trans 

1044 
tree_less_eq_trans > rbt_less_eq_trans 

1045 
tree_less_nit > rbt_less_nit 

1046 
tree_less_prop > rbt_less_prop 

1047 
tree_less_simps > rbt_less_simps 

1048 
tree_less_trans > rbt_less_trans 

1049 
tree_ord_props > rbt_ord_props 

1050 
union_Branch > rbt_union_Branch 

1051 
union_is_rbt > rbt_union_is_rbt 

1052 
unionw_is_rbt > rbt_unionw_is_rbt 

1053 
unionwk_is_rbt > rbt_unionwk_is_rbt 

1054 
unionwk_sorted > rbt_unionwk_rbt_sorted 

1055 

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

1058 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  1059 

1060 
Changed Operations: 

47622  1061 
float_abs > abs 
1062 
float_nprt > nprt 

1063 
float_pprt > pprt 

1064 
pow2 > use powr 

1065 
round_down > float_round_down 

1066 
round_up > float_round_up 

1067 
scale > exponent 

1068 

1069 
Removed Operations: 

1070 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

1071 

1072 
Renamed Lemmas: 

1073 
abs_float_def > Float.compute_float_abs 

1074 
bitlen_ge0 > bitlen_nonneg 

1075 
bitlen.simps > Float.compute_bitlen 

1076 
float_components > Float_mantissa_exponent 

1077 
float_divl.simps > Float.compute_float_divl 

1078 
float_divr.simps > Float.compute_float_divr 

1079 
float_eq_odd > mult_powr_eq_mult_powr_iff 

1080 
float_power > real_of_float_power 

1081 
lapprox_posrat_def > Float.compute_lapprox_posrat 

1082 
lapprox_rat.simps > Float.compute_lapprox_rat 

1083 
le_float_def' > Float.compute_float_le 

1084 
le_float_def > less_eq_float.rep_eq 

1085 
less_float_def' > Float.compute_float_less 

1086 
less_float_def > less_float.rep_eq 

1087 
normfloat_def > Float.compute_normfloat 

1088 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

1089 
normfloat > normfloat_def 

1090 
normfloat_unique > use normfloat_def 

1091 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

1092 
one_float_def > Float.compute_float_one 

1093 
plus_float_def > Float.compute_float_plus 

1094 
rapprox_posrat_def > Float.compute_rapprox_posrat 

1095 
rapprox_rat.simps > Float.compute_rapprox_rat 

1096 
real_of_float_0 > zero_float.rep_eq 

1097 
real_of_float_1 > one_float.rep_eq 

1098 
real_of_float_abs > abs_float.rep_eq 

1099 
real_of_float_add > plus_float.rep_eq 

1100 
real_of_float_minus > uminus_float.rep_eq 

1101 
real_of_float_mult > times_float.rep_eq 

1102 
real_of_float_simp > Float.rep_eq 

1103 
real_of_float_sub > minus_float.rep_eq 

1104 
round_down.simps > Float.compute_float_round_down 

1105 
round_up.simps > Float.compute_float_round_up 

1106 
times_float_def > Float.compute_float_times 

1107 
uminus_float_def > Float.compute_float_uminus 

1108 
zero_float_def > Float.compute_float_zero 

1109 

1110 
Lemmas not necessary anymore, use the transfer method: 

1111 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

1112 
float_divr, float_le_simp, float_less1_mantissa_bound, 

1113 
float_less_simp, float_less_zero, float_le_zero, 

1114 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

1115 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

1116 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

1117 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

1118 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

1119 
round_up, zero_le_float, zero_less_float 

47616  1120 

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

45791  1123 

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

1126 

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

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

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

1131 

1132 
* Session HOLWord: Discontinued many redundant theorems specific to 

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

1134 
instead. 

1135 

1136 
word_sub_alt ~> word_sub_wi 

1137 
word_add_alt ~> word_add_def 

1138 
word_mult_alt ~> word_mult_def 

1139 
word_minus_alt ~> word_minus_def 

1140 
word_0_alt ~> word_0_wi 

1141 
word_1_alt ~> word_1_wi 

1142 
word_add_0 ~> add_0_left 

1143 
word_add_0_right ~> add_0_right 

1144 
word_mult_1 ~> mult_1_left 

1145 
word_mult_1_right ~> mult_1_right 

1146 
word_add_commute ~> add_commute 

1147 
word_add_assoc ~> add_assoc 

1148 
word_add_left_commute ~> add_left_commute 

1149 
word_mult_commute ~> mult_commute 

1150 
word_mult_assoc ~> mult_assoc 

1151 
word_mult_left_commute ~> mult_left_commute 

1152 
word_left_distrib ~> left_distrib 

1153 
word_right_distrib ~> right_distrib 

1154 
word_left_minus ~> left_minus 

1155 
word_diff_0_right ~> diff_0_right 

1156 
word_diff_self ~> diff_self 

1157 
word_sub_def ~> diff_minus 

1158 
word_diff_minus ~> diff_minus 

1159 
word_add_ac ~> add_ac 

1160 
word_mult_ac ~> mult_ac 

1161 
word_plus_ac0 ~> add_0_left add_0_right add_ac 

1162 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 

1163 
word_order_trans ~> order_trans 

1164 
word_order_refl ~> order_refl 

1165 
word_order_antisym ~> order_antisym 

1166 
word_order_linear ~> linorder_linear 

1167 
lenw1_zero_neq_one ~> zero_neq_one 

1168 
word_number_of_eq ~> number_of_eq 

1169 
word_of_int_add_hom ~> wi_hom_add 

1170 
word_of_int_sub_hom ~> wi_hom_sub 

1171 
word_of_int_mult_hom ~> wi_hom_mult 

1172 
word_of_int_minus_hom ~> wi_hom_neg 

1173 
word_of_int_succ_hom ~> wi_hom_succ 

1174 
word_of_int_pred_hom ~> wi_hom_pred 

1175 
word_of_int_0_hom ~> word_0_wi 

1176 
word_of_int_1_hom ~> word_1_wi 

1177 

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

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

1181 
multiplication, shifting by constants, bitwise operators and numeric 

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

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

1186 

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

1189 
measure_space. The locales based on subset_class now have two 

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

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

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

1195 
Measure space constructions for distributions and densities now got 

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

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

1198 
and point_measure is introduced. INCOMPATIBILITY. 

47694  1199 

1200 
Renamed constants: 

1201 
measure > emeasure 

1202 
finite_measure.\<mu>' > measure 

1203 
product_algebra_generator > prod_algebra 

1204 
product_prob_space.emb > prod_emb 

1205 
product_prob_space.infprod_algebra > PiM 

1206 

1207 
Removed locales: 

1208 
completeable_measure_space 

1209 
finite_measure_space 

1210 
finite_prob_space 

1211 
finite_product_finite_prob_space 

1212 
finite_product_sigma_algebra 

1213 
finite_sigma_algebra 

1214 
measure_space 

1215 
pair_finite_prob_space 

1216 
pair_finite_sigma_algebra 

1217 
pair_finite_space 

1218 
pair_sigma_algebra 

1219 
product_sigma_algebra 

1220 

1221 
Removed constants: 

47751  1222 
conditional_space 
47694  1223 
distribution > use distr measure, or distributed predicate 
47751  1224 
image_space 
47694  1225 
joint_distribution > use distr measure, or distributed predicate 
47751  1226 
pair_measure_generator 
47694  1227 
product_prob_space.infprod_algebra > use PiM 
1228 
subvimage 

1229 

1230 
Replacement theorems: 

47751  1231 
finite_additivity_sufficient > ring_of_sets.countably_additiveI_finite 
1232 
finite_measure.empty_measure > measure_empty 

1233 
finite_measure.finite_continuity_from_above > finite_measure.finite_Lim_measure_decseq 

1234 
finite_measure.finite_continuity_from_below > finite_measure.finite_Lim_measure_incseq 

1235 
finite_measure.finite_measure_countably_subadditive > finite_measure.finite_measure_subadditive_countably 

1236 
finite_measure.finite_measure_eq > finite_measure.emeasure_eq_measure 

1237 
finite_measure.finite_measure > finite_measure.emeasure_finite 

1238 
finite_measure.finite_measure_finite_singleton > finite_measure.finite_measure_eq_setsum_singleton 

1239 
finite_measure.positive_measure' > measure_nonneg 

1240 
finite_measure.real_measure > finite_measure.emeasure_real 

1241 
finite_product_prob_space.finite_measure_times > finite_product_prob_space.finite_measure_PiM_emb 

1242 
finite_product_sigma_algebra.in_P > sets_PiM_I_finite 

1243 
finite_product_sigma_algebra.P_empty > space_PiM_empty, sets_PiM_empty 

1244 
information_space.conditional_entropy_eq > information_space.conditional_entropy_simple_distributed 

1245 
information_space.conditional_entropy_positive > information_space.conditional_entropy_nonneg_simple 

1246 
information_space.conditional_mutual_information_eq_mutual_information > information_space.conditional_mutual_information_eq_mutual_information_simple 

1247 
information_space.conditional_mutual_information_generic_positive > information_space.conditional_mutual_information_nonneg_simple 

1248 
information_space.conditional_mutual_information_positive > information_space.conditional_mutual_information_nonneg_simple 

1249 
information_space.entropy_commute > information_space.entropy_commute_simple 

1250 
information_space.entropy_eq > information_space.entropy_simple_distributed 

1251 
information_space.entropy_generic_eq > information_space.entropy_simple_distributed 

1252 
information_space.entropy_positive > information_space.entropy_nonneg_simple 

1253 
information_space.entropy_uniform_max > information_space.entropy_uniform 

1254 
information_space.KL_eq_0_imp > information_space.KL_eq_0_iff_eq 

1255 
information_space.KL_eq_0 > information_space.KL_same_eq_0 

1256 
information_space.KL_ge_0 > information_space.KL_nonneg 

1257 
information_space.mutual_information_eq > information_space.mutual_information_simple_distributed 

1258 
information_space.mutual_information_positive > information_space.mutual_information_nonneg_simple 

1259 
Int_stable_cuboids > Int_stable_atLeastAtMost 

1260 
Int_stable_product_algebra_generator > positive_integral 

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

47694  1262 
measure_space.additive > emeasure_additive 
47751  1263 
measure_space.AE_iff_null_set > AE_iff_null 
1264 
measure_space.almost_everywhere_def > eventually_ae_filter 

1265 
measure_space.almost_everywhere_vimage > AE_distrD 

1266 
measure_space.continuity_from_above > INF_emeasure_decseq 

1267 
measure_space.continuity_from_above_Lim > Lim_emeasure_decseq 

1268 
measure_space.continuity_from_below_Lim > Lim_emeasure_incseq 

47694  1269 
measure_space.continuity_from_below > SUP_emeasure_incseq 
47751  1270 
measure_space_density > emeasure_density 
1271 
measure_space.density_is_absolutely_continuous > absolutely_continuousI_density 

1272 
measure_space.integrable_vimage > integrable_distr 

1273 
measure_space.integral_translated_density > integral_density 

1274 
measure_space.integral_vimage > integral_distr 

1275 
measure_space.measure_additive > plus_emeasure 

1276 
measure_space.measure_compl > emeasure_compl 

1277 
measure_space.measure_countable_increasing > emeasure_countable_increasing 

1278 
measure_space.measure_countably_subadditive > emeasure_subadditive_countably 

47694  1279 
measure_space.measure_decseq > decseq_emeasure 
47751  1280 
measure_space.measure_Diff > emeasure_Diff 
1281 
measure_space.measure_Diff_null_set > emeasure_Diff_null_set 

47694  1282 
measure_space.measure_eq_0 > emeasure_eq_0 
1283 
measure_space.measure_finitely_subadditive > emeasure_subadditive_finite 

47751  1284 
measure_space.measure_finite_singleton > emeasure_eq_setsum_singleton 
1285 
measure_space.measure_incseq > incseq_emeasure 

1286 
measure_space.measure_insert > emeasure_insert 

1287 
measure_space.measure_mono > emeasure_mono 

1288 
measure_space.measure_not_negative > emeasure_not_MInf 

1289 
measure_space.measure_preserving_Int_stable > measure_eqI_generator_eq 

1290 
measure_space.measure_setsum > setsum_emeasure 

1291 
measure_space.measure_setsum_split > setsum_emeasure_cover 

47694  1292 
measure_space.measure_space_vimage > emeasure_distr 
47751  1293 
measure_space.measure_subadditive_finite > emeasure_subadditive_finite 
1294 
measure_space.measure_subadditive > subadditive 

1295 
measure_space.measure_top > emeasure_space 

1296 
measure_space.measure_UN_eq_0 > emeasure_UN_eq_0 

1297 
measure_space.measure_Un_null_set > emeasure_Un_null_set 

1298 
measure_space.positive_integral_translated_density > positive_integral_density 

1299 
measure_space.positive_integral_vimage > positive_integral_distr 

47694  1300 
measure_space.real_continuity_from_above > Lim_measure_decseq 
47751  1301 
measure_space.real_continuity_from_below > Lim_measure_incseq 
47694  1302 
measure_space.real_measure_countably_subadditive > measure_subadditive_countably 
47751  1303 
measure_space.real_measure_Diff > measure_Diff 
1304 
measure_space.real_measure_finite_Union > measure_finite_Union 

1305 
measure_space.real_measure_setsum_singleton > measure_eq_setsum_singleton 

1306 
measure_space.real_measure_subadditive > measure_subadditive 

1307 
measure_space.real_measure_Union > measure_Union 

1308 
measure_space.real_measure_UNION > measure_UNION 

47694  1309 
measure_space.simple_function_vimage > simple_function_comp 
1310 
measure_space.simple_integral_vimage > simple_integral_distr 

47751  1311 
measure_space.simple_integral_vimage > simple_integral_distr 
1312 
measure_unique_Int_stable > measure_eqI_generator_eq 

1313 
measure_unique_Int_stable_vimage > measure_eqI_generator_eq 

47694  1314 
pair_sigma_algebra.measurable_cut_fst > sets_Pair1 
1315 
pair_sigma_algebra.measurable_cut_snd > sets_Pair2 

1316 
pair_sigma_algebra.measurable_pair_image_fst > measurable_Pair1 

1317 
pair_sigma_algebra.measurable_pair_image_snd > measurable_Pair2 

1318 
pair_sigma_algebra.measurable_product_swap > measurable_pair_swap_iff 

1319 
pair_sigma_algebra.pair_sigma_algebra_measurable > measurable_pair_swap 

1320 
pair_sigma_algebra.pair_sigma_algebra_swap_measurable > measurable_pair_swap' 

1321 
pair_sigma_algebra.sets_swap > sets_pair_swap 

47751  1322 
pair_sigma_finite.measure_cut_measurable_fst > pair_sigma_finite.measurable_emeasure_Pair1 
1323 
pair_sigma_finite.measure_cut_measurable_snd > pair_sigma_finite.measurable_emeasure_Pair2 

1324 
pair_sigma_finite.measure_preserving_swap > pair_sigma_finite.distr_pair_swap 

1325 
pair_sigma_finite.pair_measure_alt2 > pair_sigma_finite.emeasure_pair_measure_alt2 

1326 
pair_sigma_finite.pair_measure_alt > pair_sigma_finite.emeasure_pair_measure_alt 

1327 
pair_sigma_finite.pair_measure_times > pair_sigma_finite.emeasure_pair_measure_Times 

1328 
prob_space.indep_distribution_eq_measure > prob_space.indep_vars_iff_distr_eq_PiM 

1329 
prob_space.indep_var_distributionD > prob_space.indep_var_distribution_eq 

47694  1330 
prob_space.measure_space_1 > prob_space.emeasure_space_1 
1331 
prob_space.prob_space_vimage > prob_space_distr 

1332 
prob_space.random_variable_restrict > measurable_restrict 

47751  1333 
prob_space_unique_Int_stable > measure_eqI_prob_space 
1334 
product_algebraE > prod_algebraE_all 

1335 
product_algebra_generator_der > prod_algebra_eq_finite 

1336 
product_algebra_generator_into_space > prod_algebra_sets_into_space 

1337 
product_algebraI > sets_PiM_I_finite 

1338 
product_measure_exists > product_sigma_finite.sigma_finite 

47694  1339 
product_prob_space.finite_index_eq_finite_product > product_prob_space.sets_PiM_generator 
1340 
product_prob_space.finite_measure_infprod_emb_Pi > product_prob_space.measure_PiM_emb 

1341 
product_prob_space.infprod_spec > product_prob_space.emeasure_PiM_emb_not_empty 

1342 
product_prob_space.measurable_component > measurable_component_singleton 

1343 
product_prob_space.measurable_emb > measurable_prod_emb 

1344 
product_prob_space.measurable_into_infprod_algebra > measurable_PiM_single 

1345 
product_prob_space.measurable_singleton_infprod > measurable_component_singleton 

1346 
product_prob_space.measure_emb > emeasure_prod_emb 

47751  1347 
product_prob_space.measure_preserving_restrict > product_prob_space.distr_restrict 
1348 
product_sigma_algebra.product_algebra_into_space > space_closed 

1349 
product_sigma_finite.measure_fold > product_sigma_finite.distr_merge 

1350 
product_sigma_finite.measure_preserving_component_singelton > product_sigma_finite.distr_singleton 

1351 
product_sigma_finite.measure_preserving_merge > product_sigma_finite.distr_merge 

47694  1352 
sequence_space.measure_infprod > sequence_space.measure_PiM_countable 
47751  1353 
sets_product_algebra > sets_PiM 
1354 
sigma_algebra.measurable_sigma > measurable_measure_of 

1355 
sigma_finite_measure.disjoint_sigma_finite > sigma_finite_disjoint 

1356 
sigma_finite_measure.RN_deriv_vimage > sigma_finite_measure.RN_deriv_distr 

1357 
sigma_product_algebra_sigma_eq > sigma_prod_algebra_sigma_eq 

1358 
space_product_algebra > space_PiM 

47694  1359 

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

47413  1362 

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

1363 

45160  1364 
*** FOL *** 
1365 

45383  1366 
* New "case_product" attribute (see HOL). 
45160  1367 

45109  1368 

47463  1369 
*** ZF *** 
1370 

1371 
* Greater support for structured proofs involving induction or case 

1372 
analysis. 

1373 

1374 
* Much greater use of mathematical symbols. 

1375 

1376 
* Removal of many ML theorem bindings. INCOMPATIBILITY. 

1377 

1378 

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

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

1380 

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

1383 

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

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

1385 
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

1386 
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

1387 

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

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

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

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

1391 
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

1392 
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

1393 
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

1394 
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

1395 
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

1396 

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

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

1398 
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

1399 

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

1402 
declarations like Local_Theory.note. 

1403 

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

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

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

1406 

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

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

1408 
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

1409 
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

1410 

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

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

1412 

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

1413 
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

1414 
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

1415 
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

1416 
delcongs ~> Simplifier.del_cong 
45625
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

1417 
setmksimps ~> Simplifier.set_mksimps 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

1418 
setmkcong ~> Simplifier.set_mkcong 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

1419 
setmksym ~> Simplifier.set_mksym 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

1420 
setmkeqTrue ~> Simplifier.set_mkeqTrue 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
