author  wenzelm 
Sat, 24 Nov 2012 15:49:43 +0100  
changeset 50184  5a16f42a9b44 
parent 50183  2b3e24e1c9e7 
child 50198  0c7b351a6871 
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 

85 
selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT. 

86 

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

89 
now bundled exclusively with Isabelle. 

90 

91 

48205  92 
*** Pure *** 
93 

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

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

95 
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

96 

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

99 
the rather arbitrary current working directory. 

100 
INCOMPATIBILITY. 

101 

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

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

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

106 
with some care where this is really required. 

107 

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

110 
given given sort. Example (in HOL): 

111 

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

113 

48205  114 

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

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

116 

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

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

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

119 

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

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

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

122 

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

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

124 
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

125 
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

126 
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

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

128 

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

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

130 

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

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

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

133 

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

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

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

136 

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

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

138 

49739  139 
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. 
140 

49738  141 
* Class "comm_monoid_diff" formalises properties of bounded 
49388  142 
subtraction, with natural numbers and multisets as typical instances. 
143 

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

146 

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

49145  149 
* Renamed theory Library/List_Prefix to Library/Sublist. 
150 
INCOMPATIBILITY. Related changes are: 

151 

152 
 Renamed constants: 

153 

154 
prefix ~> prefixeq 

155 
strict_prefix ~> prefix 

156 

157 
Renamed lemmas accordingly, INCOMPATIBILITY. 

158 

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

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

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

162 
accordingly. INCOMPATIBILITY. 

163 

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

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

166 

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

168 
instances for the prefix order (merely corresponding locale 

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

170 
Library/Prefix_Order. INCOMPATIBILITY. 

171 

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

173 
"Sublist.sub". Replaced lemmas: 

174 

175 
le_list_append_le_same_iff ~> Sublist.sub_append_le_same_iff 

176 
le_list_append_mono ~> Sublist.emb_append_mono 

177 
le_list_below_empty ~> Sublist.emb_Nil, Sublist.emb_Nil2 

178 
le_list_Cons_EX ~> Sublist.emb_ConsD 

179 
le_list_drop_Cons2 ~> Sublist.sub_Cons2' 

180 
le_list_drop_Cons_neq ~> Sublist.sub_Cons2_neq 

181 
le_list_drop_Cons ~> Sublist.sub_Cons' 

182 
le_list_drop_many ~> Sublist.sub_drop_many 

183 
le_list_filter_left ~> Sublist.sub_filter_left 

184 
le_list_rev_drop_many ~> Sublist.sub_rev_drop_many 

185 
le_list_rev_take_iff ~> Sublist.sub_append 

186 
le_list_same_length ~> Sublist.sub_same_length 

187 
le_list_take_many_iff ~> Sublist.sub_append' 

188 
less_eq_list.drop ~> less_eq_list_drop 

189 
less_eq_list.induct ~> less_eq_list_induct 

190 
not_le_list_length ~> Sublist.not_sub_length 

191 

192 
INCOMPATIBILITY. 

193 

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

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

195 

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

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

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

198 

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

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

200 

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

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

202 
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

203 
nonfree datatypes. 
48977  204 

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

48977  207 

50141  208 
* HOL/Probability: 
209 
 Add simproc "measurable" to automatically prove measurability 

210 

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

212 
and for Borelmeasurable functions (borel_measurable_induct). 

213 

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

215 

50140  216 
* Library/Countable_Set.thy: Theory of countable sets. 
217 

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

220 

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

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

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

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

224 

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

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

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

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

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

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

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

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

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

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

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

235 

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

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

237 

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

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

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

240 

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

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

242 
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

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

244 

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

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

246 
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

247 
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

248 

50138  249 
* Library/IArray.thy: immutable arrays with code generation. 
250 

48206  251 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
252 
expressions. 

48111  253 

50034  254 
* Preprocessing of the code generator rewrites set comprehensions into 
255 
pointfree expressions. 

256 

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

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

258 

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

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

260 
It is switched on by default, and can be switched off by setting 
48977  261 
the configuration quickcheck_optimise_equality to false. 
47887  262 

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

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

264 
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

265 
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

266 
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

267 
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

268 

48094  269 
* Sledgehammer: 
270 

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

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

276 
isar_proof ~> isar_proofs 
50020  277 
isar_shrink_factor ~> isar_shrink 
48294  278 
max_relevant ~> max_facts 
279 
relevance_thresholds ~> fact_thresholds 

48094  280 

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

281 

48206  282 
*** Document preparation *** 
283 

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

285 
slightly exotic babel/greek. 

286 

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

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

288 
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

289 
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

290 

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

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

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

293 

48206  294 

48992  295 
*** ML *** 
296 

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

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

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

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

300 

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

303 
necessarily printing visible text. 

304 

305 

48206  306 
*** System *** 
307 

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

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

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

310 

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

313 
for homemade configurations. 

314 

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

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

316 
Minor INCOMPATIBILITY in commandline options. 
48936  317 

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

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

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

322 

323 
* Discontinued obsolete "isabelle makeall". 

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

324 

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

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

326 
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

327 
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

328 
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

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

330 

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

333 

334 
isabelle build s b HOLCF 

335 

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

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

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

338 

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

341 
"isabelle usedir". 

342 

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

345 
version of Isabelle. 

346 

50132  347 
* The "isabelle install" tool has now a simpler commandline. Minor 
348 
INCOMPATIBILITY. 

349 

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

352 
configuration. 

353 

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

356 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

358 
bundled as Isabelle component. 

48206  359 

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

362 

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

363 

47462  364 
New in Isabelle2012 (May 2012) 
365 
 

45109  366 

45593  367 
*** General *** 
368 

45614  369 
* Prover IDE (PIDE) improvements: 
370 

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

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

45614  378 

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

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

46485  382 

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

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

384 
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

385 
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

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

387 
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

388 

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

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

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

391 
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

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

393 

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

394 
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

395 

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

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

401 
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

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

403 

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

404 
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

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

406 

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

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

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

47484  412 

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

415 
oldstyle "standard" after instantiation or composition of facts 

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

417 
indices of schematic variables. 

418 

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

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

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

422 
the historic accident of dynamic reevaluation in interpretations 

423 
etc. was exploited. 

424 

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

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

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

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

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

430 
of the material of that old tutorial. 

431 

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

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

434 
manual. 

435 

436 

437 
*** Pure *** 

438 

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

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

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

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

442 

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

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

446 
undocumented feature.) 

447 

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

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

451 

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

453 

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

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

456 

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

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

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

460 
order to accommodate newly introduced premises.) 

461 

47806  462 
* Renamed some inner syntax categories: 
463 

464 
num ~> num_token 

465 
xnum ~> xnum_token 

466 
xstr ~> str_token 

467 

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

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

470 
position information via constraints). 

471 

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

474 
manual. Minor INCOMPATIBILITY. 

475 

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

45134  478 

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

481 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  482 

47464  483 
* Redundant attribute "code_inline" has been discontinued. Use 
484 
"code_unfold" instead. INCOMPATIBILITY. 

485 

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

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

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

488 

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

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

490 

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

491 
INCOMPATIBILITY. 
45383  492 

47856  493 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
494 
instead. INCOMPATIBILITY. 

495 

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

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

498 
legacy since Isabelle2011). 

47855  499 

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

500 

45122  501 
*** HOL *** 
502 

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

505 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

510 
tinkering with former theorems mem_def and Collect_def as far as 

511 
possible. 

512 

513 
For developments which deliberately mix predicates and sets, a 

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

516 
Isabelle20111 before jumping right into the current release. 

517 

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

520 

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

522 

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

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

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

528 
user theories may require adaptations as follows: 

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

529 

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

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

531 
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

532 

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

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

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

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

538 
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

539 

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

540 
 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

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

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

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

546 

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

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

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

551 
corresponding parts of the Quotient package.) 

47809  552 

553 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

555 
relate different type instances of the same polymorphic constant, 

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

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

558 

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

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

561 

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

563 
equivalent subgoal on the corresponding raw types. Constants are 

564 
replaced with corresponding ones according to the transfer rules. 

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

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

570 

571 
 relator_eq attribute: Collects identity laws for relators of 

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

573 
transfer method uses these lemmas to infer transfer rules for 

574 
nonpolymorphic constants on the fly. 

575 

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

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

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

579 
after unfolding the constant definitions. 

580 

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

582 
from type nat to type int. 

583 

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

47809  586 

587 
 lift_definition command: Defines operations on an abstract type in 

588 
terms of a corresponding operation on a representation 

589 
type. Example syntax: 

590 

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

592 
is List.insert 

593 

594 
Users must discharge a respectfulness proof obligation when each 

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

596 
the proof is discharged automatically.) The obligation is 

597 
presented in a userfriendly, readable form; a respectfulness 

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

599 
by the package. 

600 

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

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

603 
lift_definition generates a code certificate theorem and sets up 

604 
code generation for each constant. 

605 

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

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

608 
or a type_definition theorem. The package configures transfer 

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

610 
lift_definition command to work with the type. 

611 

612 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  613 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
614 
Word/Word.thy and Library/Float.thy. 

47809  615 

616 
* Quotient package: 

617 

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

619 
rep and abs functions, similar to typedef. 

620 

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

622 
Transfer packages, as with 'setup_lifting'. 

623 

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

625 
respectfulness property at the point where the constant is 

626 
defined, similar to lift_definition; INCOMPATIBILITY. 

627 

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

629 
accordingly, INCOMPATIBILITY. 

630 

631 
* New diagnostic command 'find_unused_assms' to find potentially 

632 
superfluous assumptions in theorems using Quickcheck. 

633 

634 
* Quickcheck: 

635 

636 
 Quickcheck returns variable assignments as counterexamples, which 

637 
allows to reveal the underspecification of functions under test. 

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

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

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

641 

642 
These counterexample are marked as potentially spurious, as 

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

644 
obvious theorem "hd xs = hd xs". 

645 

646 
After finding a potentially spurious counterexample, Quickcheck 

647 
continues searching for genuine ones. 

648 

649 
By default, Quickcheck shows potentially spurious and genuine 

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

651 
show genuine counterexamples. 

652 

653 
 The command 'quickcheck_generator' creates random and exhaustive 

654 
value generators for a given type and operations. 

655 

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

657 
constructors of that type. 

658 

659 
 Support for multisets. 

660 

661 
 Added "use_subtype" options. 

662 

663 
 Added "quickcheck_locale" configuration to specify how to process 

664 
conjectures in a locale context. 

665 

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

47809  668 

669 
* Sledgehammer: 

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

671 
paper "More SPASS with Isabelle". 

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

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

674 
TFF1), iProver, iProverEq. 

675 
 Sped up the minimizer. 

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

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

678 
 Renamed "sound" option to "strict". 

679 

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

682 

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

684 

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

47809  686 

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

689 

690 
list.exhaust [case_product nat.exhaust] 

691 

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

693 
a list and a nat. 

694 

47809  695 
* New "eventually_elim" method as a generalized variant of the 
47855  696 
eventually_elim* rules. Supports structured proofs. 
697 

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

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

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

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

701 

47856  702 
* Record: code generation can be switched off manually with 
703 

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

705 

706 
* Datatype: type parameters allow explicit sort constraints. 

707 

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

710 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

712 
one_case. 

713 

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

715 
the result of the fact expression. 

716 

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

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

720 

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 
converse_def ~> converse_unfold 
47549  722 
rel_comp_def ~> relcomp_unfold 
47820  723 
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

724 
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

725 
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

726 
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

727 

46981  728 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
729 

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

47086  732 

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

733 
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

734 

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

46458  738 
rel_pow_1 ~> relpow_1 
46363  739 
rel_pow_0_I ~> relpow_0_I 
740 
rel_pow_Suc_I ~> relpow_Suc_I 

741 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

742 
rel_pow_0_E ~> relpow_0_E 

743 
rel_pow_Suc_E ~> relpow_Suc_E 

744 
rel_pow_E ~> relpow_E 

46458  745 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  746 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  747 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
748 
rel_pow_E2 ~> relpow_E2 

749 
rel_pow_add ~> relpow_add 

750 
rel_pow_commute ~> relpow 

751 
rel_pow_empty ~> relpow_empty: 

752 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

753 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

754 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

755 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

756 
rel_pow_fun_conv ~> relpow_fun_conv 

757 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

758 
rel_pow_finite_bounded ~> relpow_finite_bounded 

759 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

760 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

761 
single_valued_rel_pow ~> single_valued_relpow 

47463  762 

46363  763 
INCOMPATIBILITY. 
764 

47448  765 
* Theory Relation: Consolidated constant name for relation composition 
47464  766 
and corresponding theorem names: 
767 

47549  768 
 Renamed constant rel_comp to relcomp. 
47464  769 

47448  770 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  771 

47448  772 
 Renamed theorems: 
47464  773 

47448  774 
rel_compI ~> relcompI 
775 
rel_compEpair ~> relcompEpair 

776 
rel_compE ~> relcompE 

777 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

778 
rel_comp_empty1 ~> relcomp_empty1 

779 
rel_comp_mono ~> relcomp_mono 

780 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

781 
rel_comp_distrib ~> relcomp_distrib 

782 
rel_comp_distrib2 ~> relcomp_distrib2 

783 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

784 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

785 
single_valued_rel_comp ~> single_valued_relcomp 

47549  786 
rel_comp_def ~> relcomp_unfold 
47448  787 
converse_rel_comp ~> converse_relcomp 
788 
pred_compI ~> relcomppI 

789 
pred_compE ~> relcomppE 

790 
pred_comp_bot1 ~> relcompp_bot1 

791 
pred_comp_bot2 ~> relcompp_bot2 

792 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

793 
pred_comp_mono ~> relcompp_mono 

794 
pred_comp_distrib ~> relcompp_distrib 

795 
pred_comp_distrib2 ~> relcompp_distrib2 

796 
converse_pred_comp ~> converse_relcompp 

47464  797 

47448  798 
finite_rel_comp ~> finite_relcomp 
47464  799 

47448  800 
set_rel_comp ~> set_relcomp 
801 

802 
INCOMPATIBILITY. 

803 

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

806 

807 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

808 
zdiv_self ~> div_self 

809 
zmod_self ~> mod_self 

810 
zdiv_zero ~> div_0 

811 
zmod_zero ~> mod_0 

812 
zdiv_zmod_equality ~> div_mod_equality2 

813 
zdiv_zmod_equality2 ~> div_mod_equality 

814 
zmod_zdiv_trivial ~> mod_div_trivial 

815 
zdiv_zminus_zminus ~> div_minus_minus 

816 
zmod_zminus_zminus ~> mod_minus_minus 

817 
zdiv_zminus2 ~> div_minus_right 

818 
zmod_zminus2 ~> mod_minus_right 

819 
zdiv_minus1_right ~> div_minus1_right 

820 
zmod_minus1_right ~> mod_minus1_right 

821 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

822 
zmod_zmult1_eq ~> mod_mult_right_eq 

823 
zpower_zmod ~> power_mod 

824 
zdvd_zmod ~> dvd_mod 

825 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

826 
mod_mult_distrib ~> mult_mod_left 

827 
mod_mult_distrib2 ~> mult_mod_right 

828 

829 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

830 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

831 

47551  832 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
833 

47552  834 
* Consolidated theorem names concerning fold combinators: 
47550  835 

836 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

837 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

838 
INFI_fold_inf ~> INF_fold_inf 

839 
SUPR_fold_sup ~> SUP_fold_sup 

840 
union_set ~> union_set_fold 

841 
minus_set ~> minus_set_fold 

842 
INFI_set_fold ~> INF_set_fold 

843 
SUPR_set_fold ~> SUP_set_fold 

844 
INF_code ~> INF_set_foldr 

845 
SUP_code ~> SUP_set_foldr 

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

847 
foldr_fold_rev ~> foldr_conv_fold 

848 
foldl_fold ~> foldl_conv_fold 

849 
foldr_foldr ~> foldr_conv_foldl 

850 
foldl_foldr ~> foldl_conv_foldr 

47552  851 
fold_set_remdups ~> fold_set_fold_remdups 
852 
fold_set ~> fold_set_fold 

853 
fold1_set ~> fold1_set_fold 

47550  854 

855 
INCOMPATIBILITY. 

856 

857 
* Dropped rarely useful theorems concerning fold combinators: 

858 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

859 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

860 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

861 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

862 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

863 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

867 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

868 

869 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

870 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

871 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

872 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

874 
fold_conv_foldr and fold_rev. 

875 

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

877 
through option types. 

878 

47856  879 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
880 
relations. 

881 

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

883 

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

885 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

886 

887 
zminus_zminus ~> minus_minus 

888 
zminus_0 ~> minus_zero 

889 
zminus_zadd_distrib ~> minus_add_distrib 

890 
zadd_commute ~> add_commute 

891 
zadd_assoc ~> add_assoc 

892 
zadd_left_commute ~> add_left_commute 

893 
zadd_ac ~> add_ac 

894 
zmult_ac ~> mult_ac 

895 
zadd_0 ~> add_0_left 

896 
zadd_0_right ~> add_0_right 

897 
zadd_zminus_inverse2 ~> left_minus 

898 
zmult_zminus ~> mult_minus_left 

899 
zmult_commute ~> mult_commute 

900 
zmult_assoc ~> mult_assoc 

901 
zadd_zmult_distrib ~> left_distrib 

902 
zadd_zmult_distrib2 ~> right_distrib 

903 
zdiff_zmult_distrib ~> left_diff_distrib 

904 
zdiff_zmult_distrib2 ~> right_diff_distrib 

905 
zmult_1 ~> mult_1_left 

906 
zmult_1_right ~> mult_1_right 

907 
zle_refl ~> order_refl 

908 
zle_trans ~> order_trans 

909 
zle_antisym ~> order_antisym 

910 
zle_linear ~> linorder_linear 

911 
zless_linear ~> linorder_less_linear 

912 
zadd_left_mono ~> add_left_mono 

913 
zadd_strict_right_mono ~> add_strict_right_mono 

914 
zadd_zless_mono ~> add_less_le_mono 

915 
int_0_less_1 ~> zero_less_one 

916 
int_0_neq_1 ~> zero_neq_one 

917 
zless_le ~> less_le 

918 
zpower_zadd_distrib ~> power_add 

919 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

920 
zero_le_zpower_abs ~> zero_le_power_abs 

921 

922 
* Theory Deriv: Renamed 

923 

924 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

925 

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

927 

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

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

932 
INCOMPATIBILITY. 

933 

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

936 

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

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

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

941 
follows: 

47452  942 

943 
Operations: 

944 
bulkload > rbt_bulkload 

945 
del_from_left > rbt_del_from_left 

946 
del_from_right > rbt_del_from_right 

947 
del > rbt_del 

948 
delete > rbt_delete 

949 
ins > rbt_ins 

950 
insert > rbt_insert 

951 
insertw > rbt_insert_with 

952 
insert_with_key > rbt_insert_with_key 

953 
map_entry > rbt_map_entry 

954 
lookup > rbt_lookup 

955 
sorted > rbt_sorted 

956 
tree_greater > rbt_greater 

957 
tree_less > rbt_less 

958 
tree_less_symbol > rbt_less_symbol 

959 
union > rbt_union 

960 
union_with > rbt_union_with 

961 
union_with_key > rbt_union_with_key 

962 

963 
Lemmas: 

964 
balance_left_sorted > balance_left_rbt_sorted 

965 
balance_left_tree_greater > balance_left_rbt_greater 

966 
balance_left_tree_less > balance_left_rbt_less 

967 
balance_right_sorted > balance_right_rbt_sorted 

968 
balance_right_tree_greater > balance_right_rbt_greater 

969 
balance_right_tree_less > balance_right_rbt_less 

970 
balance_sorted > balance_rbt_sorted 

971 
balance_tree_greater > balance_rbt_greater 

972 
balance_tree_less > balance_rbt_less 

973 
bulkload_is_rbt > rbt_bulkload_is_rbt 

974 
combine_sorted > combine_rbt_sorted 

975 
combine_tree_greater > combine_rbt_greater 

976 
combine_tree_less > combine_rbt_less 

977 
delete_in_tree > rbt_delete_in_tree 

978 
delete_is_rbt > rbt_delete_is_rbt 

979 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

980 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

981 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

982 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

983 
del_in_tree > rbt_del_in_tree 

984 
del_inv1_inv2 > rbt_del_inv1_inv2 

985 
del_sorted > rbt_del_rbt_sorted 

986 
del_tree_greater > rbt_del_rbt_greater 

987 
del_tree_less > rbt_del_rbt_less 

988 
dom_lookup_Branch > dom_rbt_lookup_Branch 

989 
entries_lookup > entries_rbt_lookup 

990 
finite_dom_lookup > finite_dom_rbt_lookup 

991 
insert_sorted > rbt_insert_rbt_sorted 

992 
insertw_is_rbt > rbt_insertw_is_rbt 

993 
insertwk_is_rbt > rbt_insertwk_is_rbt 

994 
insertwk_sorted > rbt_insertwk_rbt_sorted 

995 
insertw_sorted > rbt_insertw_rbt_sorted 

996 
ins_sorted > ins_rbt_sorted 

997 
ins_tree_greater > ins_rbt_greater 

998 
ins_tree_less > ins_rbt_less 

999 
is_rbt_sorted > is_rbt_rbt_sorted 

1000 
lookup_balance > rbt_lookup_balance 

1001 
lookup_bulkload > rbt_lookup_rbt_bulkload 

1002 
lookup_delete > rbt_lookup_rbt_delete 

1003 
lookup_Empty > rbt_lookup_Empty 

1004 
lookup_from_in_tree > rbt_lookup_from_in_tree 

1005 
lookup_in_tree > rbt_lookup_in_tree 

1006 
lookup_ins > rbt_lookup_ins 

1007 
lookup_insert > rbt_lookup_rbt_insert 

1008 
lookup_insertw > rbt_lookup_rbt_insertw 

1009 
lookup_insertwk > rbt_lookup_rbt_insertwk 

1010 
lookup_keys > rbt_lookup_keys 

1011 
lookup_map > rbt_lookup_map 

1012 
lookup_map_entry > rbt_lookup_rbt_map_entry 

1013 
lookup_tree_greater > rbt_lookup_rbt_greater 

1014 
lookup_tree_less > rbt_lookup_rbt_less 

1015 
lookup_union > rbt_lookup_rbt_union 

1016 
map_entry_color_of > rbt_map_entry_color_of 

1017 
map_entry_inv1 > rbt_map_entry_inv1 

1018 
map_entry_inv2 > rbt_map_entry_inv2 

1019 
map_entry_is_rbt > rbt_map_entry_is_rbt 

1020 
map_entry_sorted > rbt_map_entry_rbt_sorted 

1021 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

1022 
map_entry_tree_less > rbt_map_entry_rbt_less 

1023 
map_tree_greater > map_rbt_greater 

1024 
map_tree_less > map_rbt_less 

1025 
map_sorted > map_rbt_sorted 

1026 
paint_sorted > paint_rbt_sorted 

1027 
paint_lookup > paint_rbt_lookup 

1028 
paint_tree_greater > paint_rbt_greater 

1029 
paint_tree_less > paint_rbt_less 

1030 
sorted_entries > rbt_sorted_entries 

1031 
tree_greater_eq_trans > rbt_greater_eq_trans 

1032 
tree_greater_nit > rbt_greater_nit 

1033 
tree_greater_prop > rbt_greater_prop 

1034 
tree_greater_simps > rbt_greater_simps 

1035 
tree_greater_trans > rbt_greater_trans 

1036 
tree_less_eq_trans > rbt_less_eq_trans 

1037 
tree_less_nit > rbt_less_nit 

1038 
tree_less_prop > rbt_less_prop 

1039 
tree_less_simps > rbt_less_simps 

1040 
tree_less_trans > rbt_less_trans 

1041 
tree_ord_props > rbt_ord_props 

1042 
union_Branch > rbt_union_Branch 

1043 
union_is_rbt > rbt_union_is_rbt 

1044 
unionw_is_rbt > rbt_unionw_is_rbt 

1045 
unionwk_is_rbt > rbt_unionwk_is_rbt 

1046 
unionwk_sorted > rbt_unionwk_rbt_sorted 

1047 

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

1050 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  1051 

1052 
Changed Operations: 

47622  1053 
float_abs > abs 
1054 
float_nprt > nprt 

1055 
float_pprt > pprt 

1056 
pow2 > use powr 

1057 
round_down > float_round_down 

1058 
round_up > float_round_up 

1059 
scale > exponent 

1060 

1061 
Removed Operations: 

1062 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

1063 

1064 
Renamed Lemmas: 

1065 
abs_float_def > Float.compute_float_abs 

1066 
bitlen_ge0 > bitlen_nonneg 

1067 
bitlen.simps > Float.compute_bitlen 

1068 
float_components > Float_mantissa_exponent 

1069 
float_divl.simps > Float.compute_float_divl 

1070 
float_divr.simps > Float.compute_float_divr 

1071 
float_eq_odd > mult_powr_eq_mult_powr_iff 

1072 
float_power > real_of_float_power 

1073 
lapprox_posrat_def > Float.compute_lapprox_posrat 

1074 
lapprox_rat.simps > Float.compute_lapprox_rat 

1075 
le_float_def' > Float.compute_float_le 

1076 
le_float_def > less_eq_float.rep_eq 

1077 
less_float_def' > Float.compute_float_less 

1078 
less_float_def > less_float.rep_eq 

1079 
normfloat_def > Float.compute_normfloat 

1080 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

1081 
normfloat > normfloat_def 

1082 
normfloat_unique > use normfloat_def 

1083 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

1084 
one_float_def > Float.compute_float_one 

1085 
plus_float_def > Float.compute_float_plus 

1086 
rapprox_posrat_def > Float.compute_rapprox_posrat 

1087 
rapprox_rat.simps > Float.compute_rapprox_rat 

1088 
real_of_float_0 > zero_float.rep_eq 

1089 
real_of_float_1 > one_float.rep_eq 

1090 
real_of_float_abs > abs_float.rep_eq 

1091 
real_of_float_add > plus_float.rep_eq 

1092 
real_of_float_minus > uminus_float.rep_eq 

1093 
real_of_float_mult > times_float.rep_eq 

1094 
real_of_float_simp > Float.rep_eq 

1095 
real_of_float_sub > minus_float.rep_eq 

1096 
round_down.simps > Float.compute_float_round_down 

1097 
round_up.simps > Float.compute_float_round_up 

1098 
times_float_def > Float.compute_float_times 

1099 
uminus_float_def > Float.compute_float_uminus 

1100 
zero_float_def > Float.compute_float_zero 

1101 

1102 
Lemmas not necessary anymore, use the transfer method: 

1103 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

1104 
float_divr, float_le_simp, float_less1_mantissa_bound, 

1105 
float_less_simp, float_less_zero, float_le_zero, 

1106 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

1107 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

1108 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

1109 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

1110 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

1111 
round_up, zero_le_float, zero_less_float 

47616  1112 

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

45791  1115 

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

1118 

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

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

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

1123 

1124 
* Session HOLWord: Discontinued many redundant theorems specific to 

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

1126 
instead. 

1127 

1128 
word_sub_alt ~> word_sub_wi 

1129 
word_add_alt ~> word_add_def 

1130 
word_mult_alt ~> word_mult_def 

1131 
word_minus_alt ~> word_minus_def 

1132 
word_0_alt ~> word_0_wi 

1133 
word_1_alt ~> word_1_wi 

1134 
word_add_0 ~> add_0_left 

1135 
word_add_0_right ~> add_0_right 

1136 
word_mult_1 ~> mult_1_left 

1137 
word_mult_1_right ~> mult_1_right 

1138 
word_add_commute ~> add_commute 

1139 
word_add_assoc ~> add_assoc 

1140 
word_add_left_commute ~> add_left_commute 

1141 
word_mult_commute ~> mult_commute 

1142 
word_mult_assoc ~> mult_assoc 

1143 
word_mult_left_commute ~> mult_left_commute 

1144 
word_left_distrib ~> left_distrib 

1145 
word_right_distrib ~> right_distrib 

1146 
word_left_minus ~> left_minus 

1147 
word_diff_0_right ~> diff_0_right 

1148 
word_diff_self ~> diff_self 

1149 
word_sub_def ~> diff_minus 

1150 
word_diff_minus ~> diff_minus 

1151 
word_add_ac ~> add_ac 

1152 
word_mult_ac ~> mult_ac 

1153 
word_plus_ac0 ~> add_0_left add_0_right add_ac 

1154 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 

1155 
word_order_trans ~> order_trans 

1156 
word_order_refl ~> order_refl 

1157 
word_order_antisym ~> order_antisym 

1158 
word_order_linear ~> linorder_linear 

1159 
lenw1_zero_neq_one ~> zero_neq_one 

1160 
word_number_of_eq ~> number_of_eq 

1161 
word_of_int_add_hom ~> wi_hom_add 

1162 
word_of_int_sub_hom ~> wi_hom_sub 

1163 
word_of_int_mult_hom ~> wi_hom_mult 

1164 
word_of_int_minus_hom ~> wi_hom_neg 

1165 
word_of_int_succ_hom ~> wi_hom_succ 

1166 
word_of_int_pred_hom ~> wi_hom_pred 

1167 
word_of_int_0_hom ~> word_0_wi 

1168 
word_of_int_1_hom ~> word_1_wi 

1169 

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

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

1173 
multiplication, shifting by constants, bitwise operators and numeric 

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

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

1178 

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

1181 
measure_space. The locales based on subset_class now have two 

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

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

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

1187 
Measure space constructions for distributions and densities now got 

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

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

1190 
and point_measure is introduced. INCOMPATIBILITY. 

47694  1191 

1192 
Renamed constants: 

1193 
measure > emeasure 

1194 
finite_measure.\<mu>' > measure 

1195 
product_algebra_generator > prod_algebra 

1196 
product_prob_space.emb > prod_emb 

1197 
product_prob_space.infprod_algebra > PiM 

1198 

1199 
Removed locales: 

1200 
completeable_measure_space 

1201 
finite_measure_space 

1202 
finite_prob_space 

1203 
finite_product_finite_prob_space 

1204 
finite_product_sigma_algebra 

1205 
finite_sigma_algebra 

1206 
measure_space 

1207 
pair_finite_prob_space 

1208 
pair_finite_sigma_algebra 

1209 
pair_finite_space 

1210 
pair_sigma_algebra 

1211 
product_sigma_algebra 

1212 

1213 
Removed constants: 

47751  1214 
conditional_space 
47694  1215 
distribution > use distr measure, or distributed predicate 
47751  1216 
image_space 
47694  1217 
joint_distribution > use distr measure, or distributed predicate 
47751  1218 
pair_measure_generator 
47694  1219 
product_prob_space.infprod_algebra > use PiM 
1220 
subvimage 

1221 

1222 
Replacement theorems: 

47751  1223 
finite_additivity_sufficient > ring_of_sets.countably_additiveI_finite 
1224 
finite_measure.empty_measure > measure_empty 

1225 
finite_measure.finite_continuity_from_above > finite_measure.finite_Lim_measure_decseq 

1226 
finite_measure.finite_continuity_from_below > finite_measure.finite_Lim_measure_incseq 

1227 
finite_measure.finite_measure_countably_subadditive > finite_measure.finite_measure_subadditive_countably 

1228 
finite_measure.finite_measure_eq > finite_measure.emeasure_eq_measure 

1229 
finite_measure.finite_measure > finite_measure.emeasure_finite 

1230 
finite_measure.finite_measure_finite_singleton > finite_measure.finite_measure_eq_setsum_singleton 

1231 
finite_measure.positive_measure' > measure_nonneg 

1232 
finite_measure.real_measure > finite_measure.emeasure_real 

1233 
finite_product_prob_space.finite_measure_times > finite_product_prob_space.finite_measure_PiM_emb 

1234 
finite_product_sigma_algebra.in_P > sets_PiM_I_finite 

1235 
finite_product_sigma_algebra.P_empty > space_PiM_empty, sets_PiM_empty 

1236 
information_space.conditional_entropy_eq > information_space.conditional_entropy_simple_distributed 

1237 
information_space.conditional_entropy_positive > information_space.conditional_entropy_nonneg_simple 

1238 
information_space.conditional_mutual_information_eq_mutual_information > information_space.conditional_mutual_information_eq_mutual_information_simple 

1239 
information_space.conditional_mutual_information_generic_positive > information_space.conditional_mutual_information_nonneg_simple 

1240 
information_space.conditional_mutual_information_positive > information_space.conditional_mutual_information_nonneg_simple 

1241 
information_space.entropy_commute > information_space.entropy_commute_simple 

1242 
information_space.entropy_eq > information_space.entropy_simple_distributed 

1243 
information_space.entropy_generic_eq > information_space.entropy_simple_distributed 

1244 
information_space.entropy_positive > information_space.entropy_nonneg_simple 

1245 
information_space.entropy_uniform_max > information_space.entropy_uniform 

1246 
information_space.KL_eq_0_imp > information_space.KL_eq_0_iff_eq 

1247 
information_space.KL_eq_0 > information_space.KL_same_eq_0 

1248 
information_space.KL_ge_0 > information_space.KL_nonneg 

1249 
information_space.mutual_information_eq > information_space.mutual_information_simple_distributed 

1250 
information_space.mutual_information_positive > information_space.mutual_information_nonneg_simple 

1251 
Int_stable_cuboids > Int_stable_atLeastAtMost 

1252 
Int_stable_product_algebra_generator > positive_integral 

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

47694  1254 
measure_space.additive > emeasure_additive 
47751  1255 
measure_space.AE_iff_null_set > AE_iff_null 
1256 
measure_space.almost_everywhere_def > eventually_ae_filter 

1257 
measure_space.almost_everywhere_vimage > AE_distrD 

1258 
measure_space.continuity_from_above > INF_emeasure_decseq 

1259 
measure_space.continuity_from_above_Lim > Lim_emeasure_decseq 

1260 
measure_space.continuity_from_below_Lim > Lim_emeasure_incseq 

47694  1261 
measure_space.continuity_from_below > SUP_emeasure_incseq 
47751  1262 
measure_space_density > emeasure_density 
1263 
measure_space.density_is_absolutely_continuous > absolutely_continuousI_density 

1264 
measure_space.integrable_vimage > integrable_distr 

1265 
measure_space.integral_translated_density > integral_density 

1266 
measure_space.integral_vimage > integral_distr 

1267 
measure_space.measure_additive > plus_emeasure 

1268 
measure_space.measure_compl > emeasure_compl 

1269 
measure_space.measure_countable_increasing > emeasure_countable_increasing 

1270 
measure_space.measure_countably_subadditive > emeasure_subadditive_countably 

47694  1271 
measure_space.measure_decseq > decseq_emeasure 
47751  1272 
measure_space.measure_Diff > emeasure_Diff 
1273 
measure_space.measure_Diff_null_set > emeasure_Diff_null_set 

47694  1274 
measure_space.measure_eq_0 > emeasure_eq_0 
1275 
measure_space.measure_finitely_subadditive > emeasure_subadditive_finite 

47751  1276 
measure_space.measure_finite_singleton > emeasure_eq_setsum_singleton 
1277 
measure_space.measure_incseq > incseq_emeasure 

1278 
measure_space.measure_insert > emeasure_insert 

1279 
measure_space.measure_mono > emeasure_mono 

1280 
measure_space.measure_not_negative > emeasure_not_MInf 

1281 
measure_space.measure_preserving_Int_stable > measure_eqI_generator_eq 

1282 
measure_space.measure_setsum > setsum_emeasure 

1283 
measure_space.measure_setsum_split > setsum_emeasure_cover 

47694  1284 
measure_space.measure_space_vimage > emeasure_distr 
47751  1285 
measure_space.measure_subadditive_finite > emeasure_subadditive_finite 
1286 
measure_space.measure_subadditive > subadditive 

1287 
measure_space.measure_top > emeasure_space 

1288 
measure_space.measure_UN_eq_0 > emeasure_UN_eq_0 

1289 
measure_space.measure_Un_null_set > emeasure_Un_null_set 

1290 
measure_space.positive_integral_translated_density > positive_integral_density 

1291 
measure_space.positive_integral_vimage > positive_integral_distr 

47694  1292 
measure_space.real_continuity_from_above > Lim_measure_decseq 
47751  1293 
measure_space.real_continuity_from_below > Lim_measure_incseq 
47694  1294 
measure_space.real_measure_countably_subadditive > measure_subadditive_countably 
47751  1295 
measure_space.real_measure_Diff > measure_Diff 
1296 
measure_space.real_measure_finite_Union > measure_finite_Union 

1297 
measure_space.real_measure_setsum_singleton > measure_eq_setsum_singleton 

1298 
measure_space.real_measure_subadditive > measure_subadditive 

1299 
measure_space.real_measure_Union > measure_Union 

1300 
measure_space.real_measure_UNION > measure_UNION 

47694  1301 
measure_space.simple_function_vimage > simple_function_comp 
1302 
measure_space.simple_integral_vimage > simple_integral_distr 

47751  1303 
measure_space.simple_integral_vimage > simple_integral_distr 
1304 
measure_unique_Int_stable > measure_eqI_generator_eq 

1305 
measure_unique_Int_stable_vimage > measure_eqI_generator_eq 

47694  1306 
pair_sigma_algebra.measurable_cut_fst > sets_Pair1 
1307 
pair_sigma_algebra.measurable_cut_snd > sets_Pair2 

1308 
pair_sigma_algebra.measurable_pair_image_fst > measurable_Pair1 

1309 
pair_sigma_algebra.measurable_pair_image_snd > measurable_Pair2 

1310 
pair_sigma_algebra.measurable_product_swap > measurable_pair_swap_iff 

1311 
pair_sigma_algebra.pair_sigma_algebra_measurable > measurable_pair_swap 

1312 
pair_sigma_algebra.pair_sigma_algebra_swap_measurable > measurable_pair_swap' 

1313 
pair_sigma_algebra.sets_swap > sets_pair_swap 

47751  1314 
pair_sigma_finite.measure_cut_measurable_fst > pair_sigma_finite.measurable_emeasure_Pair1 
1315 
pair_sigma_finite.measure_cut_measurable_snd > pair_sigma_finite.measurable_emeasure_Pair2 

1316 
pair_sigma_finite.measure_preserving_swap > pair_sigma_finite.distr_pair_swap 

1317 
pair_sigma_finite.pair_measure_alt2 > pair_sigma_finite.emeasure_pair_measure_alt2 

1318 
pair_sigma_finite.pair_measure_alt > pair_sigma_finite.emeasure_pair_measure_alt 

1319 
pair_sigma_finite.pair_measure_times > pair_sigma_finite.emeasure_pair_measure_Times 

1320 
prob_space.indep_distribution_eq_measure > prob_space.indep_vars_iff_distr_eq_PiM 

1321 
prob_space.indep_var_distributionD > prob_space.indep_var_distribution_eq 

47694  1322 
prob_space.measure_space_1 > prob_space.emeasure_space_1 
1323 
prob_space.prob_space_vimage > prob_space_distr 

1324 
prob_space.random_variable_restrict > measurable_restrict 

47751  1325 
prob_space_unique_Int_stable > measure_eqI_prob_space 
1326 
product_algebraE > prod_algebraE_all 

1327 
product_algebra_generator_der > prod_algebra_eq_finite 

1328 
product_algebra_generator_into_space > prod_algebra_sets_into_space 

1329 
product_algebraI > sets_PiM_I_finite 

1330 
product_measure_exists > product_sigma_finite.sigma_finite 

47694  1331 
product_prob_space.finite_index_eq_finite_product > product_prob_space.sets_PiM_generator 
1332 
product_prob_space.finite_measure_infprod_emb_Pi > product_prob_space.measure_PiM_emb 

1333 
product_prob_space.infprod_spec > product_prob_space.emeasure_PiM_emb_not_empty 

1334 
product_prob_space.measurable_component > measurable_component_singleton 

1335 
product_prob_space.measurable_emb > measurable_prod_emb 

1336 
product_prob_space.measurable_into_infprod_algebra > measurable_PiM_single 

1337 
product_prob_space.measurable_singleton_infprod > measurable_component_singleton 

1338 
product_prob_space.measure_emb > emeasure_prod_emb 

47751  1339 
product_prob_space.measure_preserving_restrict > product_prob_space.distr_restrict 
1340 
product_sigma_algebra.product_algebra_into_space > space_closed 

1341 
product_sigma_finite.measure_fold > product_sigma_finite.distr_merge 

1342 
product_sigma_finite.measure_preserving_component_singelton > product_sigma_finite.distr_singleton 

1343 
product_sigma_finite.measure_preserving_merge > product_sigma_finite.distr_merge 

47694  1344 
sequence_space.measure_infprod > sequence_space.measure_PiM_countable 
47751  1345 
sets_product_algebra > sets_PiM 
1346 
sigma_algebra.measurable_sigma > measurable_measure_of 

1347 
sigma_finite_measure.disjoint_sigma_finite > sigma_finite_disjoint 

1348 
sigma_finite_measure.RN_deriv_vimage > sigma_finite_measure.RN_deriv_distr 

1349 
sigma_product_algebra_sigma_eq > sigma_prod_algebra_sigma_eq 

1350 
space_product_algebra > space_PiM 

47694  1351 

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

47413  1354 

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

1355 

45160  1356 
*** FOL *** 
1357 

45383  1358 
* New "case_product" attribute (see HOL). 
45160  1359 

45109  1360 

47463  1361 
*** ZF *** 
1362 

1363 
* Greater support for structured proofs involving induction or case 

1364 
analysis. 

1365 

1366 
* Much greater use of mathematical symbols. 

1367 

1368 
* Removal of many ML theorem bindings. INCOMPATIBILITY. 

1369 

1370 

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

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

1372 

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

1375 

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

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

1377 
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

1378 
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

1379 

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

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

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

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

1383 
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

1384 
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

1385 
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

1386 
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

1387 
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

1388 

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

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

1390 
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

1391 

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

1394 
declarations like Local_Theory.note. 

1395 

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

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

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

1398 

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

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

1400 
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

1401 
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

1402 

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

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

1404 

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

1405 
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

1406 
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

1407 
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

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

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

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

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

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

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

1414 
setsubgoaler ~> Simplifier.set_subgoaler 
45620
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1415 
addsplits ~> Splitter.add_split 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1416 
delsplits ~> Splitter.del_split 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1417 

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

1418 

47461
5a7903ba2dac
more robust treatment of ISABELLE_HOME on windows: eliminate spaces and funny unicode characters in directory name via DOS~1 notation;
wenzelm
parents:
47453
diff
changeset

1419 
*** System *** 
5a7903ba2dac
more robust treatment of ISABELLE_HOME on windows: eliminate spaces and funny unicode characters in directory name via DOS~1 notation;
wenzelm
parents:
47453
diff
changeset

1420 

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