author  wenzelm 
Sun, 25 Nov 2012 17:15:21 +0100  
changeset 50198  0c7b351a6871 
parent 50184  5a16f42a9b44 
child 50213  7b73c0509835 
child 50219  f6b95f0bba78 
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 

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

44 

49968  45 
*** Prover IDE  Isabelle/Scala/jEdit *** 
46 

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

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

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

50 
surface, while the prover is still crunching on internal 

51 
justifications. Unfinished / cancelled proofs are restarted as 

52 
required to complete full proof checking eventually. 

53 

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

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

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

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

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

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

60 

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

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

63 
comment delimiters works more conveniently with unfinished situations 

64 
that frequently occur in user interaction. 

65 

66 
* More efficient painting and improved reactivity when editing large 

67 
files. More scalable management of formal document content. 

68 

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

70 
accumulated messages; prover transactions are limited to emit maximum 

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

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

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

73 
potentially infinite message streams. 
49968  74 

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

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

77 
options, including tuning parameters for editor reactivity and color 

78 
schemes. 

79 

50184  80 
* Dockable window "Symbols" provides some editing support for Isabelle 
81 
symbols. 

82 

50183  83 
* Improved editing support for control styles: subscript, superscript, 
84 
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

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

86 

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

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

88 
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

89 
tooltips etc. Cf. keyboard shortcuts CPLUS and CMINUS. 
50183  90 

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

93 
now bundled exclusively with Isabelle. 

94 

95 

48205  96 
*** Pure *** 
97 

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

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

99 
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

100 

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

103 
the rather arbitrary current working directory. 

104 
INCOMPATIBILITY. 

105 

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

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

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

110 
with some care where this is really required. 

111 

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

114 
given given sort. Example (in HOL): 

115 

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

117 

48205  118 

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

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

120 

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

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

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

123 

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

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

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

126 

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

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

128 
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

129 
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

130 
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

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

132 

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

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

134 

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

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

136 
fold_mset ~> Multiset.fold  for coherence with other fold combinators 
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 facts 
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49770
diff
changeset

139 
fold_mset_commute ~> fold_mset_comm  for coherence with fold_comm 
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 
INCOMPATIBILITY. 
0cfc1651be25
simplified construction of fold combinator on multisets;
haftmann
parents:
49770
diff
changeset

142 

49739  143 
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. 
144 

49738  145 
* Class "comm_monoid_diff" formalises properties of bounded 
49388  146 
subtraction, with natural numbers and multisets as typical instances. 
147 

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

150 

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

49145  153 
* Renamed theory Library/List_Prefix to Library/Sublist. 
154 
INCOMPATIBILITY. Related changes are: 

155 

156 
 Renamed constants: 

157 

158 
prefix ~> prefixeq 

159 
strict_prefix ~> prefix 

160 

161 
Renamed lemmas accordingly, INCOMPATIBILITY. 

162 

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

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

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

166 
accordingly. INCOMPATIBILITY. 

167 

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

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

170 

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

172 
instances for the prefix order (merely corresponding locale 

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

174 
Library/Prefix_Order. INCOMPATIBILITY. 

175 

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

177 
"Sublist.sub". Replaced lemmas: 

178 

179 
le_list_append_le_same_iff ~> Sublist.sub_append_le_same_iff 

180 
le_list_append_mono ~> Sublist.emb_append_mono 

181 
le_list_below_empty ~> Sublist.emb_Nil, Sublist.emb_Nil2 

182 
le_list_Cons_EX ~> Sublist.emb_ConsD 

183 
le_list_drop_Cons2 ~> Sublist.sub_Cons2' 

184 
le_list_drop_Cons_neq ~> Sublist.sub_Cons2_neq 

185 
le_list_drop_Cons ~> Sublist.sub_Cons' 

186 
le_list_drop_many ~> Sublist.sub_drop_many 

187 
le_list_filter_left ~> Sublist.sub_filter_left 

188 
le_list_rev_drop_many ~> Sublist.sub_rev_drop_many 

189 
le_list_rev_take_iff ~> Sublist.sub_append 

190 
le_list_same_length ~> Sublist.sub_same_length 

191 
le_list_take_many_iff ~> Sublist.sub_append' 

192 
less_eq_list.drop ~> less_eq_list_drop 

193 
less_eq_list.induct ~> less_eq_list_induct 

194 
not_le_list_length ~> Sublist.not_sub_length 

195 

196 
INCOMPATIBILITY. 

197 

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

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

199 

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

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

201 
right_distrib ~> distrib_left 
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 
in class semiring. INCOMPATIBILITY. 
a8cc904a6820
Renamed {left,right}_distrib to distrib_{right,left}.
webertj
parents:
49918
diff
changeset

204 

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

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

206 
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

207 
nonfree datatypes. 
48977  208 

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

48977  211 

50141  212 
* HOL/Probability: 
213 
 Add simproc "measurable" to automatically prove measurability 

214 

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

216 
and for Borelmeasurable functions (borel_measurable_induct). 

217 

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

219 

50140  220 
* Library/Countable_Set.thy: Theory of countable sets. 
221 

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

224 

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

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

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

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

228 

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

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

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

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

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

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

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

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

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

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

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

239 

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

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

241 

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

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

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

244 

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

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

246 
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

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

248 

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

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

250 
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

251 
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

252 

50138  253 
* Library/IArray.thy: immutable arrays with code generation. 
254 

48206  255 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
256 
expressions. 

48111  257 

50034  258 
* Preprocessing of the code generator rewrites set comprehensions into 
259 
pointfree expressions. 

260 

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

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

262 

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

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

264 
It is switched on by default, and can be switched off by setting 
48977  265 
the configuration quickcheck_optimise_equality to false. 
47887  266 

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

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

268 
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

269 
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

270 
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

271 
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

272 

48094  273 
* Sledgehammer: 
274 

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

48094  277 
 Rationalized type encodings ("type_enc" option). 
49365  278 
 Renamed "kill_provers" subcommand to "kill" 
48294  279 
 Renamed options: 
49918
cf441f4a358b
renamed Isarproof related options + changed semantics of Isar shrinking
blanchet
parents:
49869
diff
changeset

280 
isar_proof ~> isar_proofs 
50020  281 
isar_shrink_factor ~> isar_shrink 
48294  282 
max_relevant ~> max_facts 
283 
relevance_thresholds ~> fact_thresholds 

48094  284 

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

285 

48206  286 
*** Document preparation *** 
287 

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

289 
slightly exotic babel/greek. 

290 

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

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

292 
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

293 
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

294 

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

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

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

297 

48206  298 

48992  299 
*** ML *** 
300 

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

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

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

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

304 

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

307 
necessarily printing visible text. 

308 

309 

48206  310 
*** System *** 
311 

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

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

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

314 

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

317 
for homemade configurations. 

318 

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

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

320 
Minor INCOMPATIBILITY in commandline options. 
48936  321 

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

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

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

326 

327 
* Discontinued obsolete "isabelle makeall". 

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

328 

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

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

330 
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

331 
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

332 
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

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

334 

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

337 

338 
isabelle build s b HOLCF 

339 

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

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

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

342 

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

345 
"isabelle usedir". 

346 

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

349 
version of Isabelle. 

350 

50132  351 
* The "isabelle install" tool has now a simpler commandline. Minor 
352 
INCOMPATIBILITY. 

353 

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

356 
configuration. 

357 

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

360 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

362 
bundled as Isabelle component. 

48206  363 

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

366 

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

367 

47462  368 
New in Isabelle2012 (May 2012) 
369 
 

45109  370 

45593  371 
*** General *** 
372 

45614  373 
* Prover IDE (PIDE) improvements: 
374 

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

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

45614  382 

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

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

46485  386 

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

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

388 
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

389 
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

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

391 
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

392 

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

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

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

395 
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

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

397 

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

398 
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

399 

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

400 
end 
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 
thm my_trans 
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 
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

405 
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

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

407 

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

408 
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

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

410 

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

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

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

47484  416 

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

419 
oldstyle "standard" after instantiation or composition of facts 

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

421 
indices of schematic variables. 

422 

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

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

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

426 
the historic accident of dynamic reevaluation in interpretations 

427 
etc. was exploited. 

428 

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

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

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

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

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

434 
of the material of that old tutorial. 

435 

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

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

438 
manual. 

439 

440 

441 
*** Pure *** 

442 

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

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

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

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

446 

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

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

450 
undocumented feature.) 

451 

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

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

455 

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

457 

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

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

460 

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

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

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

464 
order to accommodate newly introduced premises.) 

465 

47806  466 
* Renamed some inner syntax categories: 
467 

468 
num ~> num_token 

469 
xnum ~> xnum_token 

470 
xstr ~> str_token 

471 

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

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

474 
position information via constraints). 

475 

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

478 
manual. Minor INCOMPATIBILITY. 

479 

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

45134  482 

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

485 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  486 

47464  487 
* Redundant attribute "code_inline" has been discontinued. Use 
488 
"code_unfold" instead. INCOMPATIBILITY. 

489 

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

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

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

492 

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

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

494 

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

495 
INCOMPATIBILITY. 
45383  496 

47856  497 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
498 
instead. INCOMPATIBILITY. 

499 

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

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

502 
legacy since Isabelle2011). 

47855  503 

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

504 

45122  505 
*** HOL *** 
506 

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

509 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

514 
tinkering with former theorems mem_def and Collect_def as far as 

515 
possible. 

516 

517 
For developments which deliberately mix predicates and sets, a 

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

520 
Isabelle20111 before jumping right into the current release. 

521 

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

524 

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

526 

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

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

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

532 
user theories may require adaptations as follows: 

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

533 

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

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

535 
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

536 

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

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

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

539 
after classes one and semigroup_add have been instantiated. 
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 
 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

542 
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

543 

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

544 
 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

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

546 
simprocs may now apply within the proof. 
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 
 Definitions and theorems using old constructors Pls/Min/Bit0/Bit1: 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

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

550 

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

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

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

555 
corresponding parts of the Quotient package.) 

47809  556 

557 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

559 
relate different type instances of the same polymorphic constant, 

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

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

562 

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

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

565 

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

567 
equivalent subgoal on the corresponding raw types. Constants are 

568 
replaced with corresponding ones according to the transfer rules. 

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

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

574 

575 
 relator_eq attribute: Collects identity laws for relators of 

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

577 
transfer method uses these lemmas to infer transfer rules for 

578 
nonpolymorphic constants on the fly. 

579 

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

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

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

583 
after unfolding the constant definitions. 

584 

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

586 
from type nat to type int. 

587 

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

47809  590 

591 
 lift_definition command: Defines operations on an abstract type in 

592 
terms of a corresponding operation on a representation 

593 
type. Example syntax: 

594 

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

596 
is List.insert 

597 

598 
Users must discharge a respectfulness proof obligation when each 

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

600 
the proof is discharged automatically.) The obligation is 

601 
presented in a userfriendly, readable form; a respectfulness 

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

603 
by the package. 

604 

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

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

607 
lift_definition generates a code certificate theorem and sets up 

608 
code generation for each constant. 

609 

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

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

612 
or a type_definition theorem. The package configures transfer 

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

614 
lift_definition command to work with the type. 

615 

616 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  617 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
618 
Word/Word.thy and Library/Float.thy. 

47809  619 

620 
* Quotient package: 

621 

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

623 
rep and abs functions, similar to typedef. 

624 

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

626 
Transfer packages, as with 'setup_lifting'. 

627 

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

629 
respectfulness property at the point where the constant is 

630 
defined, similar to lift_definition; INCOMPATIBILITY. 

631 

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

633 
accordingly, INCOMPATIBILITY. 

634 

635 
* New diagnostic command 'find_unused_assms' to find potentially 

636 
superfluous assumptions in theorems using Quickcheck. 

637 

638 
* Quickcheck: 

639 

640 
 Quickcheck returns variable assignments as counterexamples, which 

641 
allows to reveal the underspecification of functions under test. 

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

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

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

645 

646 
These counterexample are marked as potentially spurious, as 

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

648 
obvious theorem "hd xs = hd xs". 

649 

650 
After finding a potentially spurious counterexample, Quickcheck 

651 
continues searching for genuine ones. 

652 

653 
By default, Quickcheck shows potentially spurious and genuine 

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

655 
show genuine counterexamples. 

656 

657 
 The command 'quickcheck_generator' creates random and exhaustive 

658 
value generators for a given type and operations. 

659 

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

661 
constructors of that type. 

662 

663 
 Support for multisets. 

664 

665 
 Added "use_subtype" options. 

666 

667 
 Added "quickcheck_locale" configuration to specify how to process 

668 
conjectures in a locale context. 

669 

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

47809  672 

673 
* Sledgehammer: 

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

675 
paper "More SPASS with Isabelle". 

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

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

678 
TFF1), iProver, iProverEq. 

679 
 Sped up the minimizer. 

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

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

682 
 Renamed "sound" option to "strict". 

683 

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

686 

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

688 

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

47809  690 

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

693 

694 
list.exhaust [case_product nat.exhaust] 

695 

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

697 
a list and a nat. 

698 

47809  699 
* New "eventually_elim" method as a generalized variant of the 
47855  700 
eventually_elim* rules. Supports structured proofs. 
701 

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

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

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

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

705 

47856  706 
* Record: code generation can be switched off manually with 
707 

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

709 

710 
* Datatype: type parameters allow explicit sort constraints. 

711 

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

714 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

716 
one_case. 

717 

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

719 
the result of the fact expression. 

720 

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

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

724 

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 
converse_def ~> converse_unfold 
47549  726 
rel_comp_def ~> relcomp_unfold 
47820  727 
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

728 
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

729 
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

730 
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

731 

46981  732 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
733 

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

47086  736 

46752
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

737 
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

738 

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

46458  742 
rel_pow_1 ~> relpow_1 
46363  743 
rel_pow_0_I ~> relpow_0_I 
744 
rel_pow_Suc_I ~> relpow_Suc_I 

745 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

746 
rel_pow_0_E ~> relpow_0_E 

747 
rel_pow_Suc_E ~> relpow_Suc_E 

748 
rel_pow_E ~> relpow_E 

46458  749 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  750 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  751 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
752 
rel_pow_E2 ~> relpow_E2 

753 
rel_pow_add ~> relpow_add 

754 
rel_pow_commute ~> relpow 

755 
rel_pow_empty ~> relpow_empty: 

756 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

757 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

758 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

759 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

760 
rel_pow_fun_conv ~> relpow_fun_conv 

761 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

762 
rel_pow_finite_bounded ~> relpow_finite_bounded 

763 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

764 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

765 
single_valued_rel_pow ~> single_valued_relpow 

47463  766 

46363  767 
INCOMPATIBILITY. 
768 

47448  769 
* Theory Relation: Consolidated constant name for relation composition 
47464  770 
and corresponding theorem names: 
771 

47549  772 
 Renamed constant rel_comp to relcomp. 
47464  773 

47448  774 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  775 

47448  776 
 Renamed theorems: 
47464  777 

47448  778 
rel_compI ~> relcompI 
779 
rel_compEpair ~> relcompEpair 

780 
rel_compE ~> relcompE 

781 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

782 
rel_comp_empty1 ~> relcomp_empty1 

783 
rel_comp_mono ~> relcomp_mono 

784 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

785 
rel_comp_distrib ~> relcomp_distrib 

786 
rel_comp_distrib2 ~> relcomp_distrib2 

787 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

788 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

789 
single_valued_rel_comp ~> single_valued_relcomp 

47549  790 
rel_comp_def ~> relcomp_unfold 
47448  791 
converse_rel_comp ~> converse_relcomp 
792 
pred_compI ~> relcomppI 

793 
pred_compE ~> relcomppE 

794 
pred_comp_bot1 ~> relcompp_bot1 

795 
pred_comp_bot2 ~> relcompp_bot2 

796 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

797 
pred_comp_mono ~> relcompp_mono 

798 
pred_comp_distrib ~> relcompp_distrib 

799 
pred_comp_distrib2 ~> relcompp_distrib2 

800 
converse_pred_comp ~> converse_relcompp 

47464  801 

47448  802 
finite_rel_comp ~> finite_relcomp 
47464  803 

47448  804 
set_rel_comp ~> set_relcomp 
805 

806 
INCOMPATIBILITY. 

807 

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

810 

811 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

812 
zdiv_self ~> div_self 

813 
zmod_self ~> mod_self 

814 
zdiv_zero ~> div_0 

815 
zmod_zero ~> mod_0 

816 
zdiv_zmod_equality ~> div_mod_equality2 

817 
zdiv_zmod_equality2 ~> div_mod_equality 

818 
zmod_zdiv_trivial ~> mod_div_trivial 

819 
zdiv_zminus_zminus ~> div_minus_minus 

820 
zmod_zminus_zminus ~> mod_minus_minus 

821 
zdiv_zminus2 ~> div_minus_right 

822 
zmod_zminus2 ~> mod_minus_right 

823 
zdiv_minus1_right ~> div_minus1_right 

824 
zmod_minus1_right ~> mod_minus1_right 

825 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

826 
zmod_zmult1_eq ~> mod_mult_right_eq 

827 
zpower_zmod ~> power_mod 

828 
zdvd_zmod ~> dvd_mod 

829 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

830 
mod_mult_distrib ~> mult_mod_left 

831 
mod_mult_distrib2 ~> mult_mod_right 

832 

833 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

834 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

835 

47551  836 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
837 

47552  838 
* Consolidated theorem names concerning fold combinators: 
47550  839 

840 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

841 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

842 
INFI_fold_inf ~> INF_fold_inf 

843 
SUPR_fold_sup ~> SUP_fold_sup 

844 
union_set ~> union_set_fold 

845 
minus_set ~> minus_set_fold 

846 
INFI_set_fold ~> INF_set_fold 

847 
SUPR_set_fold ~> SUP_set_fold 

848 
INF_code ~> INF_set_foldr 

849 
SUP_code ~> SUP_set_foldr 

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

851 
foldr_fold_rev ~> foldr_conv_fold 

852 
foldl_fold ~> foldl_conv_fold 

853 
foldr_foldr ~> foldr_conv_foldl 

854 
foldl_foldr ~> foldl_conv_foldr 

47552  855 
fold_set_remdups ~> fold_set_fold_remdups 
856 
fold_set ~> fold_set_fold 

857 
fold1_set ~> fold1_set_fold 

47550  858 

859 
INCOMPATIBILITY. 

860 

861 
* Dropped rarely useful theorems concerning fold combinators: 

862 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

863 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

864 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

865 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

866 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

867 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

871 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

872 

873 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

874 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

875 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

876 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

878 
fold_conv_foldr and fold_rev. 

879 

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

881 
through option types. 

882 

47856  883 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
884 
relations. 

885 

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

887 

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

889 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

890 

891 
zminus_zminus ~> minus_minus 

892 
zminus_0 ~> minus_zero 

893 
zminus_zadd_distrib ~> minus_add_distrib 

894 
zadd_commute ~> add_commute 

895 
zadd_assoc ~> add_assoc 

896 
zadd_left_commute ~> add_left_commute 

897 
zadd_ac ~> add_ac 

898 
zmult_ac ~> mult_ac 

899 
zadd_0 ~> add_0_left 

900 
zadd_0_right ~> add_0_right 

901 
zadd_zminus_inverse2 ~> left_minus 

902 
zmult_zminus ~> mult_minus_left 

903 
zmult_commute ~> mult_commute 

904 
zmult_assoc ~> mult_assoc 

905 
zadd_zmult_distrib ~> left_distrib 

906 
zadd_zmult_distrib2 ~> right_distrib 

907 
zdiff_zmult_distrib ~> left_diff_distrib 

908 
zdiff_zmult_distrib2 ~> right_diff_distrib 

909 
zmult_1 ~> mult_1_left 

910 
zmult_1_right ~> mult_1_right 

911 
zle_refl ~> order_refl 

912 
zle_trans ~> order_trans 

913 
zle_antisym ~> order_antisym 

914 
zle_linear ~> linorder_linear 

915 
zless_linear ~> linorder_less_linear 

916 
zadd_left_mono ~> add_left_mono 

917 
zadd_strict_right_mono ~> add_strict_right_mono 

918 
zadd_zless_mono ~> add_less_le_mono 

919 
int_0_less_1 ~> zero_less_one 

920 
int_0_neq_1 ~> zero_neq_one 

921 
zless_le ~> less_le 

922 
zpower_zadd_distrib ~> power_add 

923 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

924 
zero_le_zpower_abs ~> zero_le_power_abs 

925 

926 
* Theory Deriv: Renamed 

927 

928 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

929 

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

931 

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

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

936 
INCOMPATIBILITY. 

937 

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

940 

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

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

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

945 
follows: 

47452  946 

947 
Operations: 

948 
bulkload > rbt_bulkload 

949 
del_from_left > rbt_del_from_left 

950 
del_from_right > rbt_del_from_right 

951 
del > rbt_del 

952 
delete > rbt_delete 

953 
ins > rbt_ins 

954 
insert > rbt_insert 

955 
insertw > rbt_insert_with 

956 
insert_with_key > rbt_insert_with_key 

957 
map_entry > rbt_map_entry 

958 
lookup > rbt_lookup 

959 
sorted > rbt_sorted 

960 
tree_greater > rbt_greater 

961 
tree_less > rbt_less 

962 
tree_less_symbol > rbt_less_symbol 

963 
union > rbt_union 

964 
union_with > rbt_union_with 

965 
union_with_key > rbt_union_with_key 

966 

967 
Lemmas: 

968 
balance_left_sorted > balance_left_rbt_sorted 

969 
balance_left_tree_greater > balance_left_rbt_greater 

970 
balance_left_tree_less > balance_left_rbt_less 

971 
balance_right_sorted > balance_right_rbt_sorted 

972 
balance_right_tree_greater > balance_right_rbt_greater 

973 
balance_right_tree_less > balance_right_rbt_less 

974 
balance_sorted > balance_rbt_sorted 

975 
balance_tree_greater > balance_rbt_greater 

976 
balance_tree_less > balance_rbt_less 

977 
bulkload_is_rbt > rbt_bulkload_is_rbt 

978 
combine_sorted > combine_rbt_sorted 

979 
combine_tree_greater > combine_rbt_greater 

980 
combine_tree_less > combine_rbt_less 

981 
delete_in_tree > rbt_delete_in_tree 

982 
delete_is_rbt > rbt_delete_is_rbt 

983 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

984 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

985 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

986 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

987 
del_in_tree > rbt_del_in_tree 

988 
del_inv1_inv2 > rbt_del_inv1_inv2 

989 
del_sorted > rbt_del_rbt_sorted 

990 
del_tree_greater > rbt_del_rbt_greater 

991 
del_tree_less > rbt_del_rbt_less 

992 
dom_lookup_Branch > dom_rbt_lookup_Branch 

993 
entries_lookup > entries_rbt_lookup 

994 
finite_dom_lookup > finite_dom_rbt_lookup 

995 
insert_sorted > rbt_insert_rbt_sorted 

996 
insertw_is_rbt > rbt_insertw_is_rbt 

997 
insertwk_is_rbt > rbt_insertwk_is_rbt 

998 
insertwk_sorted > rbt_insertwk_rbt_sorted 

999 
insertw_sorted > rbt_insertw_rbt_sorted 

1000 
ins_sorted > ins_rbt_sorted 

1001 
ins_tree_greater > ins_rbt_greater 

1002 
ins_tree_less > ins_rbt_less 

1003 
is_rbt_sorted > is_rbt_rbt_sorted 

1004 
lookup_balance > rbt_lookup_balance 

1005 
lookup_bulkload > rbt_lookup_rbt_bulkload 

1006 
lookup_delete > rbt_lookup_rbt_delete 

1007 
lookup_Empty > rbt_lookup_Empty 

1008 
lookup_from_in_tree > rbt_lookup_from_in_tree 

1009 
lookup_in_tree > rbt_lookup_in_tree 

1010 
lookup_ins > rbt_lookup_ins 

1011 
lookup_insert > rbt_lookup_rbt_insert 

1012 
lookup_insertw > rbt_lookup_rbt_insertw 

1013 
lookup_insertwk > rbt_lookup_rbt_insertwk 

1014 
lookup_keys > rbt_lookup_keys 

1015 
lookup_map > rbt_lookup_map 

1016 
lookup_map_entry > rbt_lookup_rbt_map_entry 

1017 
lookup_tree_greater > rbt_lookup_rbt_greater 

1018 
lookup_tree_less > rbt_lookup_rbt_less 

1019 
lookup_union > rbt_lookup_rbt_union 

1020 
map_entry_color_of > rbt_map_entry_color_of 

1021 
map_entry_inv1 > rbt_map_entry_inv1 

1022 
map_entry_inv2 > rbt_map_entry_inv2 

1023 
map_entry_is_rbt > rbt_map_entry_is_rbt 

1024 
map_entry_sorted > rbt_map_entry_rbt_sorted 

1025 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

1026 
map_entry_tree_less > rbt_map_entry_rbt_less 

1027 
map_tree_greater > map_rbt_greater 

1028 
map_tree_less > map_rbt_less 

1029 
map_sorted > map_rbt_sorted 

1030 
paint_sorted > paint_rbt_sorted 

1031 
paint_lookup > paint_rbt_lookup 

1032 
paint_tree_greater > paint_rbt_greater 

1033 
paint_tree_less > paint_rbt_less 

1034 
sorted_entries > rbt_sorted_entries 

1035 
tree_greater_eq_trans > rbt_greater_eq_trans 

1036 
tree_greater_nit > rbt_greater_nit 

1037 
tree_greater_prop > rbt_greater_prop 

1038 
tree_greater_simps > rbt_greater_simps 

1039 
tree_greater_trans > rbt_greater_trans 

1040 
tree_less_eq_trans > rbt_less_eq_trans 

1041 
tree_less_nit > rbt_less_nit 

1042 
tree_less_prop > rbt_less_prop 

1043 
tree_less_simps > rbt_less_simps 

1044 
tree_less_trans > rbt_less_trans 

1045 
tree_ord_props > rbt_ord_props 

1046 
union_Branch > rbt_union_Branch 

1047 
union_is_rbt > rbt_union_is_rbt 

1048 
unionw_is_rbt > rbt_unionw_is_rbt 

1049 
unionwk_is_rbt > rbt_unionwk_is_rbt 

1050 
unionwk_sorted > rbt_unionwk_rbt_sorted 

1051 

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

1054 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  1055 

1056 
Changed Operations: 

47622  1057 
float_abs > abs 
1058 
float_nprt > nprt 

1059 
float_pprt > pprt 

1060 
pow2 > use powr 

1061 
round_down > float_round_down 

1062 
round_up > float_round_up 

1063 
scale > exponent 

1064 

1065 
Removed Operations: 

1066 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

1067 

1068 
Renamed Lemmas: 

1069 
abs_float_def > Float.compute_float_abs 

1070 
bitlen_ge0 > bitlen_nonneg 

1071 
bitlen.simps > Float.compute_bitlen 

1072 
float_components > Float_mantissa_exponent 

1073 
float_divl.simps > Float.compute_float_divl 

1074 
float_divr.simps > Float.compute_float_divr 

1075 
float_eq_odd > mult_powr_eq_mult_powr_iff 

1076 
float_power > real_of_float_power 

1077 
lapprox_posrat_def > Float.compute_lapprox_posrat 

1078 
lapprox_rat.simps > Float.compute_lapprox_rat 

1079 
le_float_def' > Float.compute_float_le 

1080 
le_float_def > less_eq_float.rep_eq 

1081 
less_float_def' > Float.compute_float_less 

1082 
less_float_def > less_float.rep_eq 

1083 
normfloat_def > Float.compute_normfloat 

1084 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

1085 
normfloat > normfloat_def 

1086 
normfloat_unique > use normfloat_def 

1087 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

1088 
one_float_def > Float.compute_float_one 

1089 
plus_float_def > Float.compute_float_plus 

1090 
rapprox_posrat_def > Float.compute_rapprox_posrat 

1091 
rapprox_rat.simps > Float.compute_rapprox_rat 

1092 
real_of_float_0 > zero_float.rep_eq 

1093 
real_of_float_1 > one_float.rep_eq 

1094 
real_of_float_abs > abs_float.rep_eq 

1095 
real_of_float_add > plus_float.rep_eq 

1096 
real_of_float_minus > uminus_float.rep_eq 

1097 
real_of_float_mult > times_float.rep_eq 

1098 
real_of_float_simp > Float.rep_eq 

1099 
real_of_float_sub > minus_float.rep_eq 

1100 
round_down.simps > Float.compute_float_round_down 

1101 
round_up.simps > Float.compute_float_round_up 

1102 
times_float_def > Float.compute_float_times 

1103 
uminus_float_def > Float.compute_float_uminus 

1104 
zero_float_def > Float.compute_float_zero 

1105 

1106 
Lemmas not necessary anymore, use the transfer method: 

1107 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

1108 
float_divr, float_le_simp, float_less1_mantissa_bound, 

1109 
float_less_simp, float_less_zero, float_le_zero, 

1110 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

1111 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

1112 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

1113 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

1114 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

1115 
round_up, zero_le_float, zero_less_float 

47616  1116 

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

45791  1119 

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

1122 

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

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

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

1127 

1128 
* Session HOLWord: Discontinued many redundant theorems specific to 

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

1130 
instead. 

1131 

1132 
word_sub_alt ~> word_sub_wi 

1133 
word_add_alt ~> word_add_def 

1134 
word_mult_alt ~> word_mult_def 

1135 
word_minus_alt ~> word_minus_def 

1136 
word_0_alt ~> word_0_wi 

1137 
word_1_alt ~> word_1_wi 

1138 
word_add_0 ~> add_0_left 

1139 
word_add_0_right ~> add_0_right 

1140 
word_mult_1 ~> mult_1_left 

1141 
word_mult_1_right ~> mult_1_right 

1142 
word_add_commute ~> add_commute 

1143 
word_add_assoc ~> add_assoc 

1144 
word_add_left_commute ~> add_left_commute 

1145 
word_mult_commute ~> mult_commute 

1146 
word_mult_assoc ~> mult_assoc 

1147 
word_mult_left_commute ~> mult_left_commute 

1148 
word_left_distrib ~> left_distrib 

1149 
word_right_distrib ~> right_distrib 

1150 
word_left_minus ~> left_minus 

1151 
word_diff_0_right ~> diff_0_right 

1152 
word_diff_self ~> diff_self 

1153 
word_sub_def ~> diff_minus 

1154 
word_diff_minus ~> diff_minus 

1155 
word_add_ac ~> add_ac 

1156 
word_mult_ac ~> mult_ac 

1157 
word_plus_ac0 ~> add_0_left add_0_right add_ac 

1158 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 

1159 
word_order_trans ~> order_trans 

1160 
word_order_refl ~> order_refl 

1161 
word_order_antisym ~> order_antisym 

1162 
word_order_linear ~> linorder_linear 

1163 
lenw1_zero_neq_one ~> zero_neq_one 

1164 
word_number_of_eq ~> number_of_eq 

1165 
word_of_int_add_hom ~> wi_hom_add 

1166 
word_of_int_sub_hom ~> wi_hom_sub 

1167 
word_of_int_mult_hom ~> wi_hom_mult 

1168 
word_of_int_minus_hom ~> wi_hom_neg 

1169 
word_of_int_succ_hom ~> wi_hom_succ 

1170 
word_of_int_pred_hom ~> wi_hom_pred 

1171 
word_of_int_0_hom ~> word_0_wi 

1172 
word_of_int_1_hom ~> word_1_wi 

1173 

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

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

1177 
multiplication, shifting by constants, bitwise operators and numeric 

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

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

1182 

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

1185 
measure_space. The locales based on subset_class now have two 

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

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

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

1191 
Measure space constructions for distributions and densities now got 

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

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

1194 
and point_measure is introduced. INCOMPATIBILITY. 

47694  1195 

1196 
Renamed constants: 

1197 
measure > emeasure 

1198 
finite_measure.\<mu>' > measure 

1199 
product_algebra_generator > prod_algebra 

1200 
product_prob_space.emb > prod_emb 

1201 
product_prob_space.infprod_algebra > PiM 

1202 

1203 
Removed locales: 

1204 
completeable_measure_space 

1205 
finite_measure_space 

1206 
finite_prob_space 

1207 
finite_product_finite_prob_space 

1208 
finite_product_sigma_algebra 

1209 
finite_sigma_algebra 

1210 
measure_space 

1211 
pair_finite_prob_space 

1212 
pair_finite_sigma_algebra 

1213 
pair_finite_space 

1214 
pair_sigma_algebra 

1215 
product_sigma_algebra 

1216 

1217 
Removed constants: 

47751  1218 
conditional_space 
47694  1219 
distribution > use distr measure, or distributed predicate 
47751  1220 
image_space 
47694  1221 
joint_distribution > use distr measure, or distributed predicate 
47751  1222 
pair_measure_generator 
47694  1223 
product_prob_space.infprod_algebra > use PiM 
1224 
subvimage 

1225 

1226 
Replacement theorems: 

47751  1227 
finite_additivity_sufficient > ring_of_sets.countably_additiveI_finite 
1228 
finite_measure.empty_measure > measure_empty 

1229 
finite_measure.finite_continuity_from_above > finite_measure.finite_Lim_measure_decseq 

1230 
finite_measure.finite_continuity_from_below > finite_measure.finite_Lim_measure_incseq 

1231 
finite_measure.finite_measure_countably_subadditive > finite_measure.finite_measure_subadditive_countably 

1232 
finite_measure.finite_measure_eq > finite_measure.emeasure_eq_measure 

1233 
finite_measure.finite_measure > finite_measure.emeasure_finite 

1234 
finite_measure.finite_measure_finite_singleton > finite_measure.finite_measure_eq_setsum_singleton 

1235 
finite_measure.positive_measure' > measure_nonneg 

1236 
finite_measure.real_measure > finite_measure.emeasure_real 

1237 
finite_product_prob_space.finite_measure_times > finite_product_prob_space.finite_measure_PiM_emb 

1238 
finite_product_sigma_algebra.in_P > sets_PiM_I_finite 

1239 
finite_product_sigma_algebra.P_empty > space_PiM_empty, sets_PiM_empty 

1240 
information_space.conditional_entropy_eq > information_space.conditional_entropy_simple_distributed 

1241 
information_space.conditional_entropy_positive > information_space.conditional_entropy_nonneg_simple 

1242 
information_space.conditional_mutual_information_eq_mutual_information > information_space.conditional_mutual_information_eq_mutual_information_simple 

1243 
information_space.conditional_mutual_information_generic_positive > information_space.conditional_mutual_information_nonneg_simple 

1244 
information_space.conditional_mutual_information_positive > information_space.conditional_mutual_information_nonneg_simple 

1245 
information_space.entropy_commute > information_space.entropy_commute_simple 

1246 
information_space.entropy_eq > information_space.entropy_simple_distributed 

1247 
information_space.entropy_generic_eq > information_space.entropy_simple_distributed 

1248 
information_space.entropy_positive > information_space.entropy_nonneg_simple 

1249 
information_space.entropy_uniform_max > information_space.entropy_uniform 

1250 
information_space.KL_eq_0_imp > information_space.KL_eq_0_iff_eq 

1251 
information_space.KL_eq_0 > information_space.KL_same_eq_0 

1252 
information_space.KL_ge_0 > information_space.KL_nonneg 

1253 
information_space.mutual_information_eq > information_space.mutual_information_simple_distributed 

1254 
information_space.mutual_information_positive > information_space.mutual_information_nonneg_simple 

1255 
Int_stable_cuboids > Int_stable_atLeastAtMost 

1256 
Int_stable_product_algebra_generator > positive_integral 

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

47694  1258 
measure_space.additive > emeasure_additive 
47751  1259 
measure_space.AE_iff_null_set > AE_iff_null 
1260 
measure_space.almost_everywhere_def > eventually_ae_filter 

1261 
measure_space.almost_everywhere_vimage > AE_distrD 

1262 
measure_space.continuity_from_above > INF_emeasure_decseq 

1263 
measure_space.continuity_from_above_Lim > Lim_emeasure_decseq 

1264 
measure_space.continuity_from_below_Lim > Lim_emeasure_incseq 

47694  1265 
measure_space.continuity_from_below > SUP_emeasure_incseq 
47751  1266 
measure_space_density > emeasure_density 
1267 
measure_space.density_is_absolutely_continuous > absolutely_continuousI_density 

1268 
measure_space.integrable_vimage > integrable_distr 

1269 
measure_space.integral_translated_density > integral_density 

1270 
measure_space.integral_vimage > integral_distr 

1271 
measure_space.measure_additive > plus_emeasure 

1272 
measure_space.measure_compl > emeasure_compl 

1273 
measure_space.measure_countable_increasing > emeasure_countable_increasing 

1274 
measure_space.measure_countably_subadditive > emeasure_subadditive_countably 

47694  1275 
measure_space.measure_decseq > decseq_emeasure 
47751  1276 
measure_space.measure_Diff > emeasure_Diff 
1277 
measure_space.measure_Diff_null_set > emeasure_Diff_null_set 

47694  1278 
measure_space.measure_eq_0 > emeasure_eq_0 
1279 
measure_space.measure_finitely_subadditive > emeasure_subadditive_finite 

47751  1280 
measure_space.measure_finite_singleton > emeasure_eq_setsum_singleton 
1281 
measure_space.measure_incseq > incseq_emeasure 

1282 
measure_space.measure_insert > emeasure_insert 

1283 
measure_space.measure_mono > emeasure_mono 

1284 
measure_space.measure_not_negative > emeasure_not_MInf 

1285 
measure_space.measure_preserving_Int_stable > measure_eqI_generator_eq 

1286 
measure_space.measure_setsum > setsum_emeasure 

1287 
measure_space.measure_setsum_split > setsum_emeasure_cover 

47694  1288 
measure_space.measure_space_vimage > emeasure_distr 
47751  1289 
measure_space.measure_subadditive_finite > emeasure_subadditive_finite 
1290 
measure_space.measure_subadditive > subadditive 

1291 
measure_space.measure_top > emeasure_space 

1292 
measure_space.measure_UN_eq_0 > emeasure_UN_eq_0 

1293 
measure_space.measure_Un_null_set > emeasure_Un_null_set 

1294 
measure_space.positive_integral_translated_density > positive_integral_density 

1295 
measure_space.positive_integral_vimage > positive_integral_distr 

47694  1296 
measure_space.real_continuity_from_above > Lim_measure_decseq 
47751  1297 
measure_space.real_continuity_from_below > Lim_measure_incseq 
47694  1298 
measure_space.real_measure_countably_subadditive > measure_subadditive_countably 
47751  1299 
measure_space.real_measure_Diff > measure_Diff 
1300 
measure_space.real_measure_finite_Union > measure_finite_Union 

1301 
measure_space.real_measure_setsum_singleton > measure_eq_setsum_singleton 

1302 
measure_space.real_measure_subadditive > measure_subadditive 

1303 
measure_space.real_measure_Union > measure_Union 

1304 
measure_space.real_measure_UNION > measure_UNION 

47694  1305 
measure_space.simple_function_vimage > simple_function_comp 
1306 
measure_space.simple_integral_vimage > simple_integral_distr 

47751  1307 
measure_space.simple_integral_vimage > simple_integral_distr 
1308 
measure_unique_Int_stable > measure_eqI_generator_eq 

1309 
measure_unique_Int_stable_vimage > measure_eqI_generator_eq 

47694  1310 
pair_sigma_algebra.measurable_cut_fst > sets_Pair1 
1311 
pair_sigma_algebra.measurable_cut_snd > sets_Pair2 

1312 
pair_sigma_algebra.measurable_pair_image_fst > measurable_Pair1 

1313 
pair_sigma_algebra.measurable_pair_image_snd > measurable_Pair2 

1314 
pair_sigma_algebra.measurable_product_swap > measurable_pair_swap_iff 

1315 
pair_sigma_algebra.pair_sigma_algebra_measurable > measurable_pair_swap 

1316 
pair_sigma_algebra.pair_sigma_algebra_swap_measurable > measurable_pair_swap' 

1317 
pair_sigma_algebra.sets_swap > sets_pair_swap 

47751  1318 
pair_sigma_finite.measure_cut_measurable_fst > pair_sigma_finite.measurable_emeasure_Pair1 
1319 
pair_sigma_finite.measure_cut_measurable_snd > pair_sigma_finite.measurable_emeasure_Pair2 

1320 
pair_sigma_finite.measure_preserving_swap > pair_sigma_finite.distr_pair_swap 

1321 
pair_sigma_finite.pair_measure_alt2 > pair_sigma_finite.emeasure_pair_measure_alt2 

1322 
pair_sigma_finite.pair_measure_alt > pair_sigma_finite.emeasure_pair_measure_alt 

1323 
pair_sigma_finite.pair_measure_times > pair_sigma_finite.emeasure_pair_measure_Times 

1324 
prob_space.indep_distribution_eq_measure > prob_space.indep_vars_iff_distr_eq_PiM 

1325 
prob_space.indep_var_distributionD > prob_space.indep_var_distribution_eq 

47694  1326 
prob_space.measure_space_1 > prob_space.emeasure_space_1 
1327 
prob_space.prob_space_vimage > prob_space_distr 

1328 
prob_space.random_variable_restrict > measurable_restrict 

47751  1329 
prob_space_unique_Int_stable > measure_eqI_prob_space 
1330 
product_algebraE > prod_algebraE_all 

1331 
product_algebra_generator_der > prod_algebra_eq_finite 

1332 
product_algebra_generator_into_space > prod_algebra_sets_into_space 

1333 
product_algebraI > sets_PiM_I_finite 

1334 
product_measure_exists > product_sigma_finite.sigma_finite 

47694  1335 
product_prob_space.finite_index_eq_finite_product > product_prob_space.sets_PiM_generator 
1336 
product_prob_space.finite_measure_infprod_emb_Pi > product_prob_space.measure_PiM_emb 

1337 
product_prob_space.infprod_spec > product_prob_space.emeasure_PiM_emb_not_empty 

1338 
product_prob_space.measurable_component > measurable_component_singleton 

1339 
product_prob_space.measurable_emb > measurable_prod_emb 

1340 
product_prob_space.measurable_into_infprod_algebra > measurable_PiM_single 

1341 
product_prob_space.measurable_singleton_infprod > measurable_component_singleton 

1342 
product_prob_space.measure_emb > emeasure_prod_emb 

47751  1343 
product_prob_space.measure_preserving_restrict > product_prob_space.distr_restrict 
1344 
product_sigma_algebra.product_algebra_into_space > space_closed 

1345 
product_sigma_finite.measure_fold > product_sigma_finite.distr_merge 

1346 
product_sigma_finite.measure_preserving_component_singelton > product_sigma_finite.distr_singleton 

1347 
product_sigma_finite.measure_preserving_merge > product_sigma_finite.distr_merge 

47694  1348 
sequence_space.measure_infprod > sequence_space.measure_PiM_countable 
47751  1349 
sets_product_algebra > sets_PiM 
1350 
sigma_algebra.measurable_sigma > measurable_measure_of 

1351 
sigma_finite_measure.disjoint_sigma_finite > sigma_finite_disjoint 

1352 
sigma_finite_measure.RN_deriv_vimage > sigma_finite_measure.RN_deriv_distr 

1353 
sigma_product_algebra_sigma_eq > sigma_prod_algebra_sigma_eq 

1354 
space_product_algebra > space_PiM 

47694  1355 

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

47413  1358 

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

1359 

45160  1360 
*** FOL *** 
1361 

45383  1362 
* New "case_product" attribute (see HOL). 
45160  1363 

45109  1364 

47463  1365 
*** ZF *** 
1366 

1367 
* Greater support for structured proofs involving induction or case 

1368 
analysis. 

1369 

1370 
* Much greater use of mathematical symbols. 

1371 

1372 
* Removal of many ML theorem bindings. INCOMPATIBILITY. 

1373 

1374 

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

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

1376 

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

1379 

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

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

1381 
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

1382 
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

1383 

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

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

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

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

1387 
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

1388 
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

1389 
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

1390 
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

1391 
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

1392 

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

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

1394 
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

1395 

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

1398 
declarations like Local_Theory.note. 

1399 

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

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

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

1402 

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

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

1404 
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

1405 
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

1406 

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

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

1408 

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

1409 
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

1410 
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

1411 
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

1412 
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
