author  wenzelm 
Sat, 17 Nov 2012 20:19:34 +0100  
changeset 50110  c933c635843a 
parent 50034  c48b9b9f796d 
child 50118  89a14e495526 
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 

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

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

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

13 

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

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

15 
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

16 

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

19 
Tools that load their additional source files may imitate the 

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

21 
dependencies properly. 

22 

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

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

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

25 

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

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

28 

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

31 
and "class ... context ...". 

32 

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

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

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

35 

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

36 

49968  37 
*** Prover IDE  Isabelle/Scala/jEdit *** 
38 

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

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

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

42 
surface, while the prover is still crunching on internal 

43 
justifications. Unfinished / cancelled proofs are restarted as 

44 
required to complete full proof checking eventually. 

45 

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

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

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

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

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

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

52 

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

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

55 
comment delimiters works more conveniently with unfinished situations 

56 
that frequently occur in user interaction. 

57 

58 
* More efficient painting and improved reactivity when editing large 

59 
files. More scalable management of formal document content. 

60 

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

62 
accumulated messages; prover transactions are limited to emit maximum 

63 
amount of output, before being canceled (cf. tracing_limit option). 

64 
This avoids swamping the frontend with potentially infinite message 

65 
streams. 

66 

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

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

69 
options, including tuning parameters for editor reactivity and color 

70 
schemes. 

71 

72 
* Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates 

73 
from Oracle provide better multiplatform experience. This version is 

74 
now bundled exclusively with Isabelle. 

75 

76 

48205  77 
*** Pure *** 
78 

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

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

80 
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

81 

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

84 
the rather arbitrary current working directory. 

85 
INCOMPATIBILITY. 

86 

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

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

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

91 
with some care where this is really required. 

92 

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

95 
given given sort. Example (in HOL): 

96 

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

98 

48205  99 

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

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

101 

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

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

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

104 

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

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

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

107 

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

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

109 
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

110 
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

111 
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

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

113 

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

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

115 

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

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

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

118 

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

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

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

121 

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

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

123 

49739  124 
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. 
125 

49738  126 
* Class "comm_monoid_diff" formalises properties of bounded 
49388  127 
subtraction, with natural numbers and multisets as typical instances. 
128 

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

131 

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

49145  134 
* Renamed theory Library/List_Prefix to Library/Sublist. 
135 
INCOMPATIBILITY. Related changes are: 

136 

137 
 Renamed constants: 

138 

139 
prefix ~> prefixeq 

140 
strict_prefix ~> prefix 

141 

142 
Renamed lemmas accordingly, INCOMPATIBILITY. 

143 

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

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

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

147 
accordingly. INCOMPATIBILITY. 

148 

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

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

151 

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

153 
instances for the prefix order (merely corresponding locale 

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

155 
Library/Prefix_Order. INCOMPATIBILITY. 

156 

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

158 
"Sublist.sub". Replaced lemmas: 

159 

160 
le_list_append_le_same_iff ~> Sublist.sub_append_le_same_iff 

161 
le_list_append_mono ~> Sublist.emb_append_mono 

162 
le_list_below_empty ~> Sublist.emb_Nil, Sublist.emb_Nil2 

163 
le_list_Cons_EX ~> Sublist.emb_ConsD 

164 
le_list_drop_Cons2 ~> Sublist.sub_Cons2' 

165 
le_list_drop_Cons_neq ~> Sublist.sub_Cons2_neq 

166 
le_list_drop_Cons ~> Sublist.sub_Cons' 

167 
le_list_drop_many ~> Sublist.sub_drop_many 

168 
le_list_filter_left ~> Sublist.sub_filter_left 

169 
le_list_rev_drop_many ~> Sublist.sub_rev_drop_many 

170 
le_list_rev_take_iff ~> Sublist.sub_append 

171 
le_list_same_length ~> Sublist.sub_same_length 

172 
le_list_take_many_iff ~> Sublist.sub_append' 

173 
less_eq_list.drop ~> less_eq_list_drop 

174 
less_eq_list.induct ~> less_eq_list_induct 

175 
not_le_list_length ~> Sublist.not_sub_length 

176 

177 
INCOMPATIBILITY. 

178 

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

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

180 

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

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

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

183 

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

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

185 

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

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

187 
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

188 
nonfree datatypes. 
48977  189 

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

48977  192 

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

195 

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

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

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

198 

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

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

200 
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

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

202 

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

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

204 
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

205 
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

206 

48206  207 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
208 
expressions. 

48111  209 

50034  210 
* Preprocessing of the code generator rewrites set comprehensions into 
211 
pointfree expressions. 

212 

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

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

214 

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

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

216 
It is switched on by default, and can be switched off by setting 
48977  217 
the configuration quickcheck_optimise_equality to false. 
47887  218 

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

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

220 
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

221 
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

222 
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

223 
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

224 

48094  225 
* Sledgehammer: 
226 

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

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

232 
isar_proof ~> isar_proofs 
50020  233 
isar_shrink_factor ~> isar_shrink 
48294  234 
max_relevant ~> max_facts 
235 
relevance_thresholds ~> fact_thresholds 

48094  236 

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

237 

48206  238 
*** Document preparation *** 
239 

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

241 
slightly exotic babel/greek. 

242 

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

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

244 
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

245 
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

246 

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

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

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

249 

48206  250 

48992  251 
*** ML *** 
252 

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

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

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

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

256 

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

259 
necessarily printing visible text. 

260 

261 

48206  262 
*** System *** 
263 

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

266 
for homemade configurations. 

267 

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

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

269 
Minor INCOMPATIBILITY in commandline options. 
48936  270 

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

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

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

275 

276 
* Discontinued obsolete "isabelle makeall". 

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

277 

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

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

279 
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

280 
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

281 
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

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

283 

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

286 

287 
isabelle build s b HOLCF 

288 

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

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

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

291 

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

294 
"isabelle usedir". 

295 

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

298 
version of Isabelle. 

299 

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

302 
configuration. 

303 

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

306 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

308 
bundled as Isabelle component. 

48206  309 

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

310 

47462  311 
New in Isabelle2012 (May 2012) 
312 
 

45109  313 

45593  314 
*** General *** 
315 

45614  316 
* Prover IDE (PIDE) improvements: 
317 

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

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

45614  325 

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

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

46485  329 

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

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

331 
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

332 
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

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

334 
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

335 

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

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

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

338 
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

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

340 

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

341 
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

342 

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

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

344 

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

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

346 

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

347 
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

348 
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

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

350 

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

351 
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

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

353 

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

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

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

47484  359 

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

362 
oldstyle "standard" after instantiation or composition of facts 

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

364 
indices of schematic variables. 

365 

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

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

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

369 
the historic accident of dynamic reevaluation in interpretations 

370 
etc. was exploited. 

371 

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

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

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

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

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

377 
of the material of that old tutorial. 

378 

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

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

381 
manual. 

382 

383 

384 
*** Pure *** 

385 

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

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

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

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

389 

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

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

393 
undocumented feature.) 

394 

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

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

398 

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

400 

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

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

403 

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

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

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

407 
order to accommodate newly introduced premises.) 

408 

47806  409 
* Renamed some inner syntax categories: 
410 

411 
num ~> num_token 

412 
xnum ~> xnum_token 

413 
xstr ~> str_token 

414 

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

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

417 
position information via constraints). 

418 

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

421 
manual. Minor INCOMPATIBILITY. 

422 

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

45134  425 

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

428 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  429 

47464  430 
* Redundant attribute "code_inline" has been discontinued. Use 
431 
"code_unfold" instead. INCOMPATIBILITY. 

432 

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

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

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

435 

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

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

437 

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

438 
INCOMPATIBILITY. 
45383  439 

47856  440 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
441 
instead. INCOMPATIBILITY. 

442 

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

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

445 
legacy since Isabelle2011). 

47855  446 

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

447 

45122  448 
*** HOL *** 
449 

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

452 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

457 
tinkering with former theorems mem_def and Collect_def as far as 

458 
possible. 

459 

460 
For developments which deliberately mix predicates and sets, a 

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

463 
Isabelle20111 before jumping right into the current release. 

464 

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

467 

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

469 

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

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

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

475 
user theories may require adaptations as follows: 

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

476 

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

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

478 
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

479 

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

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

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

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

483 

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

484 
 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

485 
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

486 

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

487 
 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

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

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

490 

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

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

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

493 

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

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

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

498 
corresponding parts of the Quotient package.) 

47809  499 

500 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

502 
relate different type instances of the same polymorphic constant, 

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

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

505 

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

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

508 

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

510 
equivalent subgoal on the corresponding raw types. Constants are 

511 
replaced with corresponding ones according to the transfer rules. 

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

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

517 

518 
 relator_eq attribute: Collects identity laws for relators of 

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

520 
transfer method uses these lemmas to infer transfer rules for 

521 
nonpolymorphic constants on the fly. 

522 

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

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

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

526 
after unfolding the constant definitions. 

527 

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

529 
from type nat to type int. 

530 

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

47809  533 

534 
 lift_definition command: Defines operations on an abstract type in 

535 
terms of a corresponding operation on a representation 

536 
type. Example syntax: 

537 

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

539 
is List.insert 

540 

541 
Users must discharge a respectfulness proof obligation when each 

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

543 
the proof is discharged automatically.) The obligation is 

544 
presented in a userfriendly, readable form; a respectfulness 

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

546 
by the package. 

547 

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

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

550 
lift_definition generates a code certificate theorem and sets up 

551 
code generation for each constant. 

552 

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

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

555 
or a type_definition theorem. The package configures transfer 

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

557 
lift_definition command to work with the type. 

558 

559 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  560 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
561 
Word/Word.thy and Library/Float.thy. 

47809  562 

563 
* Quotient package: 

564 

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

566 
rep and abs functions, similar to typedef. 

567 

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

569 
Transfer packages, as with 'setup_lifting'. 

570 

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

572 
respectfulness property at the point where the constant is 

573 
defined, similar to lift_definition; INCOMPATIBILITY. 

574 

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

576 
accordingly, INCOMPATIBILITY. 

577 

578 
* New diagnostic command 'find_unused_assms' to find potentially 

579 
superfluous assumptions in theorems using Quickcheck. 

580 

581 
* Quickcheck: 

582 

583 
 Quickcheck returns variable assignments as counterexamples, which 

584 
allows to reveal the underspecification of functions under test. 

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

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

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

588 

589 
These counterexample are marked as potentially spurious, as 

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

591 
obvious theorem "hd xs = hd xs". 

592 

593 
After finding a potentially spurious counterexample, Quickcheck 

594 
continues searching for genuine ones. 

595 

596 
By default, Quickcheck shows potentially spurious and genuine 

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

598 
show genuine counterexamples. 

599 

600 
 The command 'quickcheck_generator' creates random and exhaustive 

601 
value generators for a given type and operations. 

602 

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

604 
constructors of that type. 

605 

606 
 Support for multisets. 

607 

608 
 Added "use_subtype" options. 

609 

610 
 Added "quickcheck_locale" configuration to specify how to process 

611 
conjectures in a locale context. 

612 

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

47809  615 

616 
* Sledgehammer: 

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

618 
paper "More SPASS with Isabelle". 

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

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

621 
TFF1), iProver, iProverEq. 

622 
 Sped up the minimizer. 

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

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

625 
 Renamed "sound" option to "strict". 

626 

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

629 

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

631 

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

47809  633 

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

636 

637 
list.exhaust [case_product nat.exhaust] 

638 

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

640 
a list and a nat. 

641 

47809  642 
* New "eventually_elim" method as a generalized variant of the 
47855  643 
eventually_elim* rules. Supports structured proofs. 
644 

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

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

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

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

648 

47856  649 
* Record: code generation can be switched off manually with 
650 

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

652 

653 
* Datatype: type parameters allow explicit sort constraints. 

654 

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

657 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

659 
one_case. 

660 

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

662 
the result of the fact expression. 

663 

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

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

667 

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

668 
converse_def ~> converse_unfold 
47549  669 
rel_comp_def ~> relcomp_unfold 
47820  670 
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

671 
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

672 
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

673 
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

674 

46981  675 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
676 

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

47086  679 

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

680 
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

681 

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

46458  685 
rel_pow_1 ~> relpow_1 
46363  686 
rel_pow_0_I ~> relpow_0_I 
687 
rel_pow_Suc_I ~> relpow_Suc_I 

688 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

689 
rel_pow_0_E ~> relpow_0_E 

690 
rel_pow_Suc_E ~> relpow_Suc_E 

691 
rel_pow_E ~> relpow_E 

46458  692 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  693 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  694 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
695 
rel_pow_E2 ~> relpow_E2 

696 
rel_pow_add ~> relpow_add 

697 
rel_pow_commute ~> relpow 

698 
rel_pow_empty ~> relpow_empty: 

699 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

700 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

701 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

702 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

703 
rel_pow_fun_conv ~> relpow_fun_conv 

704 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

705 
rel_pow_finite_bounded ~> relpow_finite_bounded 

706 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

707 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

708 
single_valued_rel_pow ~> single_valued_relpow 

47463  709 

46363  710 
INCOMPATIBILITY. 
711 

47448  712 
* Theory Relation: Consolidated constant name for relation composition 
47464  713 
and corresponding theorem names: 
714 

47549  715 
 Renamed constant rel_comp to relcomp. 
47464  716 

47448  717 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  718 

47448  719 
 Renamed theorems: 
47464  720 

47448  721 
rel_compI ~> relcompI 
722 
rel_compEpair ~> relcompEpair 

723 
rel_compE ~> relcompE 

724 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

725 
rel_comp_empty1 ~> relcomp_empty1 

726 
rel_comp_mono ~> relcomp_mono 

727 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

728 
rel_comp_distrib ~> relcomp_distrib 

729 
rel_comp_distrib2 ~> relcomp_distrib2 

730 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

731 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

732 
single_valued_rel_comp ~> single_valued_relcomp 

47549  733 
rel_comp_def ~> relcomp_unfold 
47448  734 
converse_rel_comp ~> converse_relcomp 
735 
pred_compI ~> relcomppI 

736 
pred_compE ~> relcomppE 

737 
pred_comp_bot1 ~> relcompp_bot1 

738 
pred_comp_bot2 ~> relcompp_bot2 

739 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

740 
pred_comp_mono ~> relcompp_mono 

741 
pred_comp_distrib ~> relcompp_distrib 

742 
pred_comp_distrib2 ~> relcompp_distrib2 

743 
converse_pred_comp ~> converse_relcompp 

47464  744 

47448  745 
finite_rel_comp ~> finite_relcomp 
47464  746 

47448  747 
set_rel_comp ~> set_relcomp 
748 

749 
INCOMPATIBILITY. 

750 

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

753 

754 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

755 
zdiv_self ~> div_self 

756 
zmod_self ~> mod_self 

757 
zdiv_zero ~> div_0 

758 
zmod_zero ~> mod_0 

759 
zdiv_zmod_equality ~> div_mod_equality2 

760 
zdiv_zmod_equality2 ~> div_mod_equality 

761 
zmod_zdiv_trivial ~> mod_div_trivial 

762 
zdiv_zminus_zminus ~> div_minus_minus 

763 
zmod_zminus_zminus ~> mod_minus_minus 

764 
zdiv_zminus2 ~> div_minus_right 

765 
zmod_zminus2 ~> mod_minus_right 

766 
zdiv_minus1_right ~> div_minus1_right 

767 
zmod_minus1_right ~> mod_minus1_right 

768 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

769 
zmod_zmult1_eq ~> mod_mult_right_eq 

770 
zpower_zmod ~> power_mod 

771 
zdvd_zmod ~> dvd_mod 

772 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

773 
mod_mult_distrib ~> mult_mod_left 

774 
mod_mult_distrib2 ~> mult_mod_right 

775 

776 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

777 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

778 

47551  779 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
780 

47552  781 
* Consolidated theorem names concerning fold combinators: 
47550  782 

783 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

784 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

785 
INFI_fold_inf ~> INF_fold_inf 

786 
SUPR_fold_sup ~> SUP_fold_sup 

787 
union_set ~> union_set_fold 

788 
minus_set ~> minus_set_fold 

789 
INFI_set_fold ~> INF_set_fold 

790 
SUPR_set_fold ~> SUP_set_fold 

791 
INF_code ~> INF_set_foldr 

792 
SUP_code ~> SUP_set_foldr 

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

794 
foldr_fold_rev ~> foldr_conv_fold 

795 
foldl_fold ~> foldl_conv_fold 

796 
foldr_foldr ~> foldr_conv_foldl 

797 
foldl_foldr ~> foldl_conv_foldr 

47552  798 
fold_set_remdups ~> fold_set_fold_remdups 
799 
fold_set ~> fold_set_fold 

800 
fold1_set ~> fold1_set_fold 

47550  801 

802 
INCOMPATIBILITY. 

803 

804 
* Dropped rarely useful theorems concerning fold combinators: 

805 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

806 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

807 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

808 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

809 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

810 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

814 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

815 

816 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

817 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

818 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

819 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

821 
fold_conv_foldr and fold_rev. 

822 

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

824 
through option types. 

825 

47856  826 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
827 
relations. 

828 

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

830 

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

832 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

833 

834 
zminus_zminus ~> minus_minus 

835 
zminus_0 ~> minus_zero 

836 
zminus_zadd_distrib ~> minus_add_distrib 

837 
zadd_commute ~> add_commute 

838 
zadd_assoc ~> add_assoc 

839 
zadd_left_commute ~> add_left_commute 

840 
zadd_ac ~> add_ac 

841 
zmult_ac ~> mult_ac 

842 
zadd_0 ~> add_0_left 

843 
zadd_0_right ~> add_0_right 

844 
zadd_zminus_inverse2 ~> left_minus 

845 
zmult_zminus ~> mult_minus_left 

846 
zmult_commute ~> mult_commute 

847 
zmult_assoc ~> mult_assoc 

848 
zadd_zmult_distrib ~> left_distrib 

849 
zadd_zmult_distrib2 ~> right_distrib 

850 
zdiff_zmult_distrib ~> left_diff_distrib 

851 
zdiff_zmult_distrib2 ~> right_diff_distrib 

852 
zmult_1 ~> mult_1_left 

853 
zmult_1_right ~> mult_1_right 

854 
zle_refl ~> order_refl 

855 
zle_trans ~> order_trans 

856 
zle_antisym ~> order_antisym 

857 
zle_linear ~> linorder_linear 

858 
zless_linear ~> linorder_less_linear 

859 
zadd_left_mono ~> add_left_mono 

860 
zadd_strict_right_mono ~> add_strict_right_mono 

861 
zadd_zless_mono ~> add_less_le_mono 

862 
int_0_less_1 ~> zero_less_one 

863 
int_0_neq_1 ~> zero_neq_one 

864 
zless_le ~> less_le 

865 
zpower_zadd_distrib ~> power_add 

866 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

867 
zero_le_zpower_abs ~> zero_le_power_abs 

868 

869 
* Theory Deriv: Renamed 

870 

871 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

872 

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

874 

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

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

879 
INCOMPATIBILITY. 

880 

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

883 

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

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

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

888 
follows: 

47452  889 

890 
Operations: 

891 
bulkload > rbt_bulkload 

892 
del_from_left > rbt_del_from_left 

893 
del_from_right > rbt_del_from_right 

894 
del > rbt_del 

895 
delete > rbt_delete 

896 
ins > rbt_ins 

897 
insert > rbt_insert 

898 
insertw > rbt_insert_with 

899 
insert_with_key > rbt_insert_with_key 

900 
map_entry > rbt_map_entry 

901 
lookup > rbt_lookup 

902 
sorted > rbt_sorted 

903 
tree_greater > rbt_greater 

904 
tree_less > rbt_less 

905 
tree_less_symbol > rbt_less_symbol 

906 
union > rbt_union 

907 
union_with > rbt_union_with 

908 
union_with_key > rbt_union_with_key 

909 

910 
Lemmas: 

911 
balance_left_sorted > balance_left_rbt_sorted 

912 
balance_left_tree_greater > balance_left_rbt_greater 

913 
balance_left_tree_less > balance_left_rbt_less 

914 
balance_right_sorted > balance_right_rbt_sorted 

915 
balance_right_tree_greater > balance_right_rbt_greater 

916 
balance_right_tree_less > balance_right_rbt_less 

917 
balance_sorted > balance_rbt_sorted 

918 
balance_tree_greater > balance_rbt_greater 

919 
balance_tree_less > balance_rbt_less 

920 
bulkload_is_rbt > rbt_bulkload_is_rbt 

921 
combine_sorted > combine_rbt_sorted 

922 
combine_tree_greater > combine_rbt_greater 

923 
combine_tree_less > combine_rbt_less 

924 
delete_in_tree > rbt_delete_in_tree 

925 
delete_is_rbt > rbt_delete_is_rbt 

926 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

927 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

928 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

929 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

930 
del_in_tree > rbt_del_in_tree 

931 
del_inv1_inv2 > rbt_del_inv1_inv2 

932 
del_sorted > rbt_del_rbt_sorted 

933 
del_tree_greater > rbt_del_rbt_greater 

934 
del_tree_less > rbt_del_rbt_less 

935 
dom_lookup_Branch > dom_rbt_lookup_Branch 

936 
entries_lookup > entries_rbt_lookup 

937 
finite_dom_lookup > finite_dom_rbt_lookup 

938 
insert_sorted > rbt_insert_rbt_sorted 

939 
insertw_is_rbt > rbt_insertw_is_rbt 

940 
insertwk_is_rbt > rbt_insertwk_is_rbt 

941 
insertwk_sorted > rbt_insertwk_rbt_sorted 

942 
insertw_sorted > rbt_insertw_rbt_sorted 

943 
ins_sorted > ins_rbt_sorted 

944 
ins_tree_greater > ins_rbt_greater 

945 
ins_tree_less > ins_rbt_less 

946 
is_rbt_sorted > is_rbt_rbt_sorted 

947 
lookup_balance > rbt_lookup_balance 

948 
lookup_bulkload > rbt_lookup_rbt_bulkload 

949 
lookup_delete > rbt_lookup_rbt_delete 

950 
lookup_Empty > rbt_lookup_Empty 

951 
lookup_from_in_tree > rbt_lookup_from_in_tree 

952 
lookup_in_tree > rbt_lookup_in_tree 

953 
lookup_ins > rbt_lookup_ins 

954 
lookup_insert > rbt_lookup_rbt_insert 

955 
lookup_insertw > rbt_lookup_rbt_insertw 

956 
lookup_insertwk > rbt_lookup_rbt_insertwk 

957 
lookup_keys > rbt_lookup_keys 

958 
lookup_map > rbt_lookup_map 

959 
lookup_map_entry > rbt_lookup_rbt_map_entry 

960 
lookup_tree_greater > rbt_lookup_rbt_greater 

961 
lookup_tree_less > rbt_lookup_rbt_less 

962 
lookup_union > rbt_lookup_rbt_union 

963 
map_entry_color_of > rbt_map_entry_color_of 

964 
map_entry_inv1 > rbt_map_entry_inv1 

965 
map_entry_inv2 > rbt_map_entry_inv2 

966 
map_entry_is_rbt > rbt_map_entry_is_rbt 

967 
map_entry_sorted > rbt_map_entry_rbt_sorted 

968 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

969 
map_entry_tree_less > rbt_map_entry_rbt_less 

970 
map_tree_greater > map_rbt_greater 

971 
map_tree_less > map_rbt_less 

972 
map_sorted > map_rbt_sorted 

973 
paint_sorted > paint_rbt_sorted 

974 
paint_lookup > paint_rbt_lookup 

975 
paint_tree_greater > paint_rbt_greater 

976 
paint_tree_less > paint_rbt_less 

977 
sorted_entries > rbt_sorted_entries 

978 
tree_greater_eq_trans > rbt_greater_eq_trans 

979 
tree_greater_nit > rbt_greater_nit 

980 
tree_greater_prop > rbt_greater_prop 

981 
tree_greater_simps > rbt_greater_simps 

982 
tree_greater_trans > rbt_greater_trans 

983 
tree_less_eq_trans > rbt_less_eq_trans 

984 
tree_less_nit > rbt_less_nit 

985 
tree_less_prop > rbt_less_prop 

986 
tree_less_simps > rbt_less_simps 

987 
tree_less_trans > rbt_less_trans 

988 
tree_ord_props > rbt_ord_props 

989 
union_Branch > rbt_union_Branch 

990 
union_is_rbt > rbt_union_is_rbt 

991 
unionw_is_rbt > rbt_unionw_is_rbt 

992 
unionwk_is_rbt > rbt_unionwk_is_rbt 

993 
unionwk_sorted > rbt_unionwk_rbt_sorted 

994 

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

997 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  998 

999 
Changed Operations: 

47622  1000 
float_abs > abs 
1001 
float_nprt > nprt 

1002 
float_pprt > pprt 

1003 
pow2 > use powr 

1004 
round_down > float_round_down 

1005 
round_up > float_round_up 

1006 
scale > exponent 

1007 

1008 
Removed Operations: 

1009 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

1010 

1011 
Renamed Lemmas: 

1012 
abs_float_def > Float.compute_float_abs 

1013 
bitlen_ge0 > bitlen_nonneg 

1014 
bitlen.simps > Float.compute_bitlen 

1015 
float_components > Float_mantissa_exponent 

1016 
float_divl.simps > Float.compute_float_divl 

1017 
float_divr.simps > Float.compute_float_divr 

1018 
float_eq_odd > mult_powr_eq_mult_powr_iff 

1019 
float_power > real_of_float_power 

1020 
lapprox_posrat_def > Float.compute_lapprox_posrat 

1021 
lapprox_rat.simps > Float.compute_lapprox_rat 

1022 
le_float_def' > Float.compute_float_le 

1023 
le_float_def > less_eq_float.rep_eq 

1024 
less_float_def' > Float.compute_float_less 

1025 
less_float_def > less_float.rep_eq 

1026 
normfloat_def > Float.compute_normfloat 

1027 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

1028 
normfloat > normfloat_def 

1029 
normfloat_unique > use normfloat_def 

1030 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

1031 
one_float_def > Float.compute_float_one 

1032 
plus_float_def > Float.compute_float_plus 

1033 
rapprox_posrat_def > Float.compute_rapprox_posrat 

1034 
rapprox_rat.simps > Float.compute_rapprox_rat 

1035 
real_of_float_0 > zero_float.rep_eq 

1036 
real_of_float_1 > one_float.rep_eq 

1037 
real_of_float_abs > abs_float.rep_eq 

1038 
real_of_float_add > plus_float.rep_eq 

1039 
real_of_float_minus > uminus_float.rep_eq 

1040 
real_of_float_mult > times_float.rep_eq 

1041 
real_of_float_simp > Float.rep_eq 

1042 
real_of_float_sub > minus_float.rep_eq 

1043 
round_down.simps > Float.compute_float_round_down 

1044 
round_up.simps > Float.compute_float_round_up 

1045 
times_float_def > Float.compute_float_times 

1046 
uminus_float_def > Float.compute_float_uminus 

1047 
zero_float_def > Float.compute_float_zero 

1048 

1049 
Lemmas not necessary anymore, use the transfer method: 

1050 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

1051 
float_divr, float_le_simp, float_less1_mantissa_bound, 

1052 
float_less_simp, float_less_zero, float_le_zero, 

1053 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

1054 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

1055 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

1056 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

1057 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

1058 
round_up, zero_le_float, zero_less_float 

47616  1059 

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

45791  1062 

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

1065 

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

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

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

1070 

1071 
* Session HOLWord: Discontinued many redundant theorems specific to 

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

1073 
instead. 

1074 

1075 
word_sub_alt ~> word_sub_wi 

1076 
word_add_alt ~> word_add_def 

1077 
word_mult_alt ~> word_mult_def 

1078 
word_minus_alt ~> word_minus_def 

1079 
word_0_alt ~> word_0_wi 

1080 
word_1_alt ~> word_1_wi 

1081 
word_add_0 ~> add_0_left 

1082 
word_add_0_right ~> add_0_right 

1083 
word_mult_1 ~> mult_1_left 

1084 
word_mult_1_right ~> mult_1_right 

1085 
word_add_commute ~> add_commute 

1086 
word_add_assoc ~> add_assoc 

1087 
word_add_left_commute ~> add_left_commute 

1088 
word_mult_commute ~> mult_commute 

1089 
word_mult_assoc ~> mult_assoc 

1090 
word_mult_left_commute ~> mult_left_commute 

1091 
word_left_distrib ~> left_distrib 

1092 
word_right_distrib ~> right_distrib 

1093 
word_left_minus ~> left_minus 

1094 
word_diff_0_right ~> diff_0_right 

1095 
word_diff_self ~> diff_self 

1096 
word_sub_def ~> diff_minus 

1097 
word_diff_minus ~> diff_minus 

1098 
word_add_ac ~> add_ac 

1099 
word_mult_ac ~> mult_ac 

1100 
word_plus_ac0 ~> add_0_left add_0_right add_ac 

1101 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 

1102 
word_order_trans ~> order_trans 

1103 
word_order_refl ~> order_refl 

1104 
word_order_antisym ~> order_antisym 

1105 
word_order_linear ~> linorder_linear 

1106 
lenw1_zero_neq_one ~> zero_neq_one 

1107 
word_number_of_eq ~> number_of_eq 

1108 
word_of_int_add_hom ~> wi_hom_add 

1109 
word_of_int_sub_hom ~> wi_hom_sub 

1110 
word_of_int_mult_hom ~> wi_hom_mult 

1111 
word_of_int_minus_hom ~> wi_hom_neg 

1112 
word_of_int_succ_hom ~> wi_hom_succ 

1113 
word_of_int_pred_hom ~> wi_hom_pred 

1114 
word_of_int_0_hom ~> word_0_wi 

1115 
word_of_int_1_hom ~> word_1_wi 

1116 

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

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

1120 
multiplication, shifting by constants, bitwise operators and numeric 

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

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

1125 

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

1128 
measure_space. The locales based on subset_class now have two 

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

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

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

1134 
Measure space constructions for distributions and densities now got 

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

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

1137 
and point_measure is introduced. INCOMPATIBILITY. 

47694  1138 

1139 
Renamed constants: 

1140 
measure > emeasure 

1141 
finite_measure.\<mu>' > measure 

1142 
product_algebra_generator > prod_algebra 

1143 
product_prob_space.emb > prod_emb 

1144 
product_prob_space.infprod_algebra > PiM 

1145 

1146 
Removed locales: 

1147 
completeable_measure_space 

1148 
finite_measure_space 

1149 
finite_prob_space 

1150 
finite_product_finite_prob_space 

1151 
finite_product_sigma_algebra 

1152 
finite_sigma_algebra 

1153 
measure_space 

1154 
pair_finite_prob_space 

1155 
pair_finite_sigma_algebra 

1156 
pair_finite_space 

1157 
pair_sigma_algebra 

1158 
product_sigma_algebra 

1159 

1160 
Removed constants: 

47751  1161 
conditional_space 
47694  1162 
distribution > use distr measure, or distributed predicate 
47751  1163 
image_space 
47694  1164 
joint_distribution > use distr measure, or distributed predicate 
47751  1165 
pair_measure_generator 
47694  1166 
product_prob_space.infprod_algebra > use PiM 
1167 
subvimage 

1168 

1169 
Replacement theorems: 

47751  1170 
finite_additivity_sufficient > ring_of_sets.countably_additiveI_finite 
1171 
finite_measure.empty_measure > measure_empty 

1172 
finite_measure.finite_continuity_from_above > finite_measure.finite_Lim_measure_decseq 

1173 
finite_measure.finite_continuity_from_below > finite_measure.finite_Lim_measure_incseq 

1174 
finite_measure.finite_measure_countably_subadditive > finite_measure.finite_measure_subadditive_countably 

1175 
finite_measure.finite_measure_eq > finite_measure.emeasure_eq_measure 

1176 
finite_measure.finite_measure > finite_measure.emeasure_finite 

1177 
finite_measure.finite_measure_finite_singleton > finite_measure.finite_measure_eq_setsum_singleton 

1178 
finite_measure.positive_measure' > measure_nonneg 

1179 
finite_measure.real_measure > finite_measure.emeasure_real 

1180 
finite_product_prob_space.finite_measure_times > finite_product_prob_space.finite_measure_PiM_emb 

1181 
finite_product_sigma_algebra.in_P > sets_PiM_I_finite 

1182 
finite_product_sigma_algebra.P_empty > space_PiM_empty, sets_PiM_empty 

1183 
information_space.conditional_entropy_eq > information_space.conditional_entropy_simple_distributed 

1184 
information_space.conditional_entropy_positive > information_space.conditional_entropy_nonneg_simple 

1185 
information_space.conditional_mutual_information_eq_mutual_information > information_space.conditional_mutual_information_eq_mutual_information_simple 

1186 
information_space.conditional_mutual_information_generic_positive > information_space.conditional_mutual_information_nonneg_simple 

1187 
information_space.conditional_mutual_information_positive > information_space.conditional_mutual_information_nonneg_simple 

1188 
information_space.entropy_commute > information_space.entropy_commute_simple 

1189 
information_space.entropy_eq > information_space.entropy_simple_distributed 

1190 
information_space.entropy_generic_eq > information_space.entropy_simple_distributed 

1191 
information_space.entropy_positive > information_space.entropy_nonneg_simple 

1192 
information_space.entropy_uniform_max > information_space.entropy_uniform 

1193 
information_space.KL_eq_0_imp > information_space.KL_eq_0_iff_eq 

1194 
information_space.KL_eq_0 > information_space.KL_same_eq_0 

1195 
information_space.KL_ge_0 > information_space.KL_nonneg 

1196 
information_space.mutual_information_eq > information_space.mutual_information_simple_distributed 

1197 
information_space.mutual_information_positive > information_space.mutual_information_nonneg_simple 

1198 
Int_stable_cuboids > Int_stable_atLeastAtMost 

1199 
Int_stable_product_algebra_generator > positive_integral 

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

47694  1201 
measure_space.additive > emeasure_additive 
47751  1202 
measure_space.AE_iff_null_set > AE_iff_null 
1203 
measure_space.almost_everywhere_def > eventually_ae_filter 

1204 
measure_space.almost_everywhere_vimage > AE_distrD 

1205 
measure_space.continuity_from_above > INF_emeasure_decseq 

1206 
measure_space.continuity_from_above_Lim > Lim_emeasure_decseq 

1207 
measure_space.continuity_from_below_Lim > Lim_emeasure_incseq 

47694  1208 
measure_space.continuity_from_below > SUP_emeasure_incseq 
47751  1209 
measure_space_density > emeasure_density 
1210 
measure_space.density_is_absolutely_continuous > absolutely_continuousI_density 

1211 
measure_space.integrable_vimage > integrable_distr 

1212 
measure_space.integral_translated_density > integral_density 

1213 
measure_space.integral_vimage > integral_distr 

1214 
measure_space.measure_additive > plus_emeasure 

1215 
measure_space.measure_compl > emeasure_compl 

1216 
measure_space.measure_countable_increasing > emeasure_countable_increasing 

1217 
measure_space.measure_countably_subadditive > emeasure_subadditive_countably 

47694  1218 
measure_space.measure_decseq > decseq_emeasure 
47751  1219 
measure_space.measure_Diff > emeasure_Diff 
1220 
measure_space.measure_Diff_null_set > emeasure_Diff_null_set 

47694  1221 
measure_space.measure_eq_0 > emeasure_eq_0 
1222 
measure_space.measure_finitely_subadditive > emeasure_subadditive_finite 

47751  1223 
measure_space.measure_finite_singleton > emeasure_eq_setsum_singleton 
1224 
measure_space.measure_incseq > incseq_emeasure 

1225 
measure_space.measure_insert > emeasure_insert 

1226 
measure_space.measure_mono > emeasure_mono 

1227 
measure_space.measure_not_negative > emeasure_not_MInf 

1228 
measure_space.measure_preserving_Int_stable > measure_eqI_generator_eq 

1229 
measure_space.measure_setsum > setsum_emeasure 

1230 
measure_space.measure_setsum_split > setsum_emeasure_cover 

47694  1231 
measure_space.measure_space_vimage > emeasure_distr 
47751  1232 
measure_space.measure_subadditive_finite > emeasure_subadditive_finite 
1233 
measure_space.measure_subadditive > subadditive 

1234 
measure_space.measure_top > emeasure_space 

1235 
measure_space.measure_UN_eq_0 > emeasure_UN_eq_0 

1236 
measure_space.measure_Un_null_set > emeasure_Un_null_set 

1237 
measure_space.positive_integral_translated_density > positive_integral_density 

1238 
measure_space.positive_integral_vimage > positive_integral_distr 

47694  1239 
measure_space.real_continuity_from_above > Lim_measure_decseq 
47751  1240 
measure_space.real_continuity_from_below > Lim_measure_incseq 
47694  1241 
measure_space.real_measure_countably_subadditive > measure_subadditive_countably 
47751  1242 
measure_space.real_measure_Diff > measure_Diff 
1243 
measure_space.real_measure_finite_Union > measure_finite_Union 

1244 
measure_space.real_measure_setsum_singleton > measure_eq_setsum_singleton 

1245 
measure_space.real_measure_subadditive > measure_subadditive 

1246 
measure_space.real_measure_Union > measure_Union 

1247 
measure_space.real_measure_UNION > measure_UNION 

47694  1248 
measure_space.simple_function_vimage > simple_function_comp 
1249 
measure_space.simple_integral_vimage > simple_integral_distr 

47751  1250 
measure_space.simple_integral_vimage > simple_integral_distr 
1251 
measure_unique_Int_stable > measure_eqI_generator_eq 

1252 
measure_unique_Int_stable_vimage > measure_eqI_generator_eq 

47694  1253 
pair_sigma_algebra.measurable_cut_fst > sets_Pair1 
1254 
pair_sigma_algebra.measurable_cut_snd > sets_Pair2 

1255 
pair_sigma_algebra.measurable_pair_image_fst > measurable_Pair1 

1256 
pair_sigma_algebra.measurable_pair_image_snd > measurable_Pair2 

1257 
pair_sigma_algebra.measurable_product_swap > measurable_pair_swap_iff 

1258 
pair_sigma_algebra.pair_sigma_algebra_measurable > measurable_pair_swap 

1259 
pair_sigma_algebra.pair_sigma_algebra_swap_measurable > measurable_pair_swap' 

1260 
pair_sigma_algebra.sets_swap > sets_pair_swap 

47751  1261 
pair_sigma_finite.measure_cut_measurable_fst > pair_sigma_finite.measurable_emeasure_Pair1 
1262 
pair_sigma_finite.measure_cut_measurable_snd > pair_sigma_finite.measurable_emeasure_Pair2 

1263 
pair_sigma_finite.measure_preserving_swap > pair_sigma_finite.distr_pair_swap 

1264 
pair_sigma_finite.pair_measure_alt2 > pair_sigma_finite.emeasure_pair_measure_alt2 

1265 
pair_sigma_finite.pair_measure_alt > pair_sigma_finite.emeasure_pair_measure_alt 

1266 
pair_sigma_finite.pair_measure_times > pair_sigma_finite.emeasure_pair_measure_Times 

1267 
prob_space.indep_distribution_eq_measure > prob_space.indep_vars_iff_distr_eq_PiM 

1268 
prob_space.indep_var_distributionD > prob_space.indep_var_distribution_eq 

47694  1269 
prob_space.measure_space_1 > prob_space.emeasure_space_1 
1270 
prob_space.prob_space_vimage > prob_space_distr 

1271 
prob_space.random_variable_restrict > measurable_restrict 

47751  1272 
prob_space_unique_Int_stable > measure_eqI_prob_space 
1273 
product_algebraE > prod_algebraE_all 

1274 
product_algebra_generator_der > prod_algebra_eq_finite 

1275 
product_algebra_generator_into_space > prod_algebra_sets_into_space 

1276 
product_algebraI > sets_PiM_I_finite 

1277 
product_measure_exists > product_sigma_finite.sigma_finite 

47694  1278 
product_prob_space.finite_index_eq_finite_product > product_prob_space.sets_PiM_generator 
1279 
product_prob_space.finite_measure_infprod_emb_Pi > product_prob_space.measure_PiM_emb 

1280 
product_prob_space.infprod_spec > product_prob_space.emeasure_PiM_emb_not_empty 

1281 
product_prob_space.measurable_component > measurable_component_singleton 

1282 
product_prob_space.measurable_emb > measurable_prod_emb 

1283 
product_prob_space.measurable_into_infprod_algebra > measurable_PiM_single 

1284 
product_prob_space.measurable_singleton_infprod > measurable_component_singleton 

1285 
product_prob_space.measure_emb > emeasure_prod_emb 

47751  1286 
product_prob_space.measure_preserving_restrict > product_prob_space.distr_restrict 
1287 
product_sigma_algebra.product_algebra_into_space > space_closed 

1288 
product_sigma_finite.measure_fold > product_sigma_finite.distr_merge 

1289 
product_sigma_finite.measure_preserving_component_singelton > product_sigma_finite.distr_singleton 

1290 
product_sigma_finite.measure_preserving_merge > product_sigma_finite.distr_merge 

47694  1291 
sequence_space.measure_infprod > sequence_space.measure_PiM_countable 
47751  1292 
sets_product_algebra > sets_PiM 
1293 
sigma_algebra.measurable_sigma > measurable_measure_of 

1294 
sigma_finite_measure.disjoint_sigma_finite > sigma_finite_disjoint 

1295 
sigma_finite_measure.RN_deriv_vimage > sigma_finite_measure.RN_deriv_distr 

1296 
sigma_product_algebra_sigma_eq > sigma_prod_algebra_sigma_eq 

1297 
space_product_algebra > space_PiM 

47694  1298 

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

47413  1301 

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

1302 

45160  1303 
*** FOL *** 
1304 

45383  1305 
* New "case_product" attribute (see HOL). 
45160  1306 

45109  1307 

47463  1308 
*** ZF *** 
1309 

1310 
* Greater support for structured proofs involving induction or case 

1311 
analysis. 

1312 

1313 
* Much greater use of mathematical symbols. 

1314 

1315 
* Removal of many ML theorem bindings. INCOMPATIBILITY. 

1316 

1317 

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

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

1319 

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

1322 

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

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

1324 
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

1325 
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

1326 

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

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

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

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

1330 
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

1331 
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

1332 
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

1333 
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

1334 
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

1335 

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

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

1337 
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

1338 

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

1341 
declarations like Local_Theory.note. 

1342 

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

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

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

1345 

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

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

1347 
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

1348 
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

1349 

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

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

1351 

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

1352 
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

1353 
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

1354 
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

1355 
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

1356 
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

1357 
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

1358 
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

1359 
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

1360 
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

1361 
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

1362 
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

1363 
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

1364 

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

1365 

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

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

1367 

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

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

1369 
directory, which coincides with HOME on POSIX systems only. Likewise, 
012a887997f3
USER_HOME settings variable points to crossplatform user home directory;
wenzelm
parents:
47659
diff
changeset

1370 
the Isabelle path specification "~" now expands to $USER_HOME, instead 
012a887997f3
USER_HOME settings variable points to crossplatform user home directory;
wenzelm
parents:
47659
diff
changeset

1371 
of former $HOME. A different default for USER_HOME may be set 
012a887997f3
USER_HOME settings variable points to crossplatform user home directory;
wenzelm
parents:
47659
diff
changeset

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

1373 
evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where 
012a887997f3
USER_HOME settings variable points to crossplatform user home directory;
wenzelm
parents:
47659
diff
changeset

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

1375 

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

1378 

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

1381 

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

1382 

45109  1383 

44801  1384 
New in Isabelle20111 (October 2011) 
1385 
 

41651  1386 

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

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

1388 

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

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

1395 

44777  1396 
 Markup of formal entities within the text buffer, with semantic 
44760  1397 
highlighting, tooltips and hyperlinks to jump to defining source 
1398 
positions. 

1399 

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

1402 
theory output and other nonIsabelle text boxes). 

1403 

1404 
 Refined scheduling of proof checking and printing of results, 

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

1407 

44777  1408 
 Reduced CPU performance requirements, usable on machines with few 
44760  1409 
cores. 
1410 

44777  1411 
 Reduced memory requirements due to pruning of unused document 
44760  1412 
versions (garbage collection). 
1413 

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

1415 
including some remaining limitations. 

1416 

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

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

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

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

0472f2367efb
some tuning for release;
wenzelm
