author  wenzelm 
Tue, 16 Oct 2012 21:30:52 +0200  
changeset 49869  bd370af308f0 
parent 49841  18cb42182d3e 
child 49918  cf441f4a358b 
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 

49532  9 
* Prover IDE (PIDE) improvements: 
10 
. parallel terminal proofs ('by'); 

11 
. improved output panel with tooltips, hyperlinks etc.; 

49841  12 
. improved tooltips with nested tooltips, hyperlinks etc.; 
49532  13 
. more efficient painting, improved reactivity; 
14 
. more robust incremental parsing of outer syntax (partial 

15 
comments, malformed symbols); 

49647  16 
. smarter handling of tracing messages (via tracing_limit); 
49532  17 
. more plugin options and preferences, based on Isabelle/Scala; 
18 
. uniform Java 7 platform on Linux, Mac OS X, Windows; 

19 

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

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

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

24 

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

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

26 
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

27 

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

30 
Tools that load their additional source files may imitate the 

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

32 
dependencies properly. 

33 

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

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

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

36 

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

37 
* Updated and extended "isarref" manual, reduced remaining material 
9fe0e71052a0
updated "isarref" manual, reduced remaining material in "ref" manual.
wenzelm
parents:
48111
diff
changeset

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

39 

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

42 
and "class ... context ...". 

43 

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

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

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

46 

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

47 

48205  48 
*** Pure *** 
49 

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

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

51 
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

52 

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

55 
the rather arbitrary current working directory. 

56 
INCOMPATIBILITY. 

57 

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

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

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

62 
with some care where this is really required. 

63 

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

66 
given given sort. Example (in HOL): 

67 

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

69 

48205  70 

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

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

72 

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

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

74 
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

75 
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

76 
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

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

78 

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

79 

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

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

81 

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

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

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

84 

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

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

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

87 

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

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

89 

49739  90 
* Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY. 
91 

49738  92 
* Class "comm_monoid_diff" formalises properties of bounded 
49388  93 
subtraction, with natural numbers and multisets as typical instances. 
94 

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

97 

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

49145  100 
* Renamed theory Library/List_Prefix to Library/Sublist. 
101 
INCOMPATIBILITY. Related changes are: 

102 

103 
 Renamed constants: 

104 

105 
prefix ~> prefixeq 

106 
strict_prefix ~> prefix 

107 

108 
Renamed lemmas accordingly, INCOMPATIBILITY. 

109 

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

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

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

113 
accordingly. INCOMPATIBILITY. 

114 

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

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

117 

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

119 
instances for the prefix order (merely corresponding locale 

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

121 
Library/Prefix_Order. INCOMPATIBILITY. 

122 

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

124 
"Sublist.sub". Replaced lemmas: 

125 

126 
le_list_append_le_same_iff ~> Sublist.sub_append_le_same_iff 

127 
le_list_append_mono ~> Sublist.emb_append_mono 

128 
le_list_below_empty ~> Sublist.emb_Nil, Sublist.emb_Nil2 

129 
le_list_Cons_EX ~> Sublist.emb_ConsD 

130 
le_list_drop_Cons2 ~> Sublist.sub_Cons2' 

131 
le_list_drop_Cons_neq ~> Sublist.sub_Cons2_neq 

132 
le_list_drop_Cons ~> Sublist.sub_Cons' 

133 
le_list_drop_many ~> Sublist.sub_drop_many 

134 
le_list_filter_left ~> Sublist.sub_filter_left 

135 
le_list_rev_drop_many ~> Sublist.sub_rev_drop_many 

136 
le_list_rev_take_iff ~> Sublist.sub_append 

137 
le_list_same_length ~> Sublist.sub_same_length 

138 
le_list_take_many_iff ~> Sublist.sub_append' 

139 
less_eq_list.drop ~> less_eq_list_drop 

140 
less_eq_list.induct ~> less_eq_list_induct 

141 
not_le_list_length ~> Sublist.not_sub_length 

142 

143 
INCOMPATIBILITY. 

144 

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

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

146 
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

147 
nonfree datatypes. 
48977  148 

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

48977  151 

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

154 

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

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

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

157 

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

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

159 
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

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

161 

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

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

163 
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

164 
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

165 

48206  166 
* Simproc "finite_Collect" rewrites set comprehensions into pointfree 
167 
expressions. 

48111  168 

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

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

170 

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

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

172 
It is switched on by default, and can be switched off by setting 
48977  173 
the configuration quickcheck_optimise_equality to false. 
47887  174 

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

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

176 
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

177 
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

178 
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

179 
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

180 

48094  181 
* Sledgehammer: 
182 

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

48094  185 
 Rationalized type encodings ("type_enc" option). 
49365  186 
 Renamed "kill_provers" subcommand to "kill" 
48294  187 
 Renamed options: 
188 
max_relevant ~> max_facts 

189 
relevance_thresholds ~> fact_thresholds 

48094  190 

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

191 

48206  192 
*** Document preparation *** 
193 

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

195 
slightly exotic babel/greek. 

196 

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

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

198 
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

199 
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

200 

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

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

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

203 

48206  204 

48992  205 
*** ML *** 
206 

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

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

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

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

210 

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

213 
necessarily printing visible text. 

214 

215 

48206  216 
*** System *** 
217 

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

220 
for homemade configurations. 

221 

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

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

223 
Minor INCOMPATIBILITY in commandline options. 
48936  224 

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

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

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

229 

230 
* Discontinued obsolete "isabelle makeall". 

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

231 

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

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

233 
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

234 
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

235 
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

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

237 

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

240 

241 
isabelle build s b HOLCF 

242 

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

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

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

245 

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

248 
"isabelle usedir". 

249 

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

252 
version of Isabelle. 

253 

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

256 
configuration. 

257 

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

260 
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS 

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

262 
bundled as Isabelle component. 

48206  263 

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

264 

47462  265 
New in Isabelle2012 (May 2012) 
266 
 

45109  267 

45593  268 
*** General *** 
269 

45614  270 
* Prover IDE (PIDE) improvements: 
271 

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

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

45614  279 

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

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

46485  283 

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

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

285 
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

286 
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

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

288 
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

289 

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

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

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

292 
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

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

294 

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

295 
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

296 

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

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

298 

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

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

300 

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

301 
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

302 
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

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

304 

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

305 
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

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

307 

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

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

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

47484  313 

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

316 
oldstyle "standard" after instantiation or composition of facts 

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

318 
indices of schematic variables. 

319 

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

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

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

323 
the historic accident of dynamic reevaluation in interpretations 

324 
etc. was exploited. 

325 

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

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

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

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

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

331 
of the material of that old tutorial. 

332 

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

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

335 
manual. 

336 

337 

338 
*** Pure *** 

339 

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

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

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

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

343 

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

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

347 
undocumented feature.) 

348 

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

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

352 

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

354 

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

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

357 

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

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

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

361 
order to accommodate newly introduced premises.) 

362 

47806  363 
* Renamed some inner syntax categories: 
364 

365 
num ~> num_token 

366 
xnum ~> xnum_token 

367 
xstr ~> str_token 

368 

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

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

371 
position information via constraints). 

372 

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

375 
manual. Minor INCOMPATIBILITY. 

376 

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

45134  379 

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

382 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  383 

47464  384 
* Redundant attribute "code_inline" has been discontinued. Use 
385 
"code_unfold" instead. INCOMPATIBILITY. 

386 

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

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

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

389 

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

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

391 

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

392 
INCOMPATIBILITY. 
45383  393 

47856  394 
* Obsolete 'types' command has been discontinued. Use 'type_synonym' 
395 
instead. INCOMPATIBILITY. 

396 

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

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

399 
legacy since Isabelle2011). 

47855  400 

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

401 

45122  402 
*** HOL *** 
403 

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

406 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

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

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

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

411 
tinkering with former theorems mem_def and Collect_def as far as 

412 
possible. 

413 

414 
For developments which deliberately mix predicates and sets, a 

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

417 
Isabelle20111 before jumping right into the current release. 

418 

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

421 

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

423 

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

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

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

429 
user theories may require adaptations as follows: 

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

430 

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

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

432 
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

433 

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

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

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

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

437 

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

438 
 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

439 
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

440 

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

441 
 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

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

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

444 

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

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

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

447 

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

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

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

452 
corresponding parts of the Quotient package.) 

47809  453 

454 
 transfer_rule attribute: Maintains a collection of transfer rules, 

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

456 
relate different type instances of the same polymorphic constant, 

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

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

459 

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

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

462 

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

464 
equivalent subgoal on the corresponding raw types. Constants are 

465 
replaced with corresponding ones according to the transfer rules. 

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

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

471 

472 
 relator_eq attribute: Collects identity laws for relators of 

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

474 
transfer method uses these lemmas to infer transfer rules for 

475 
nonpolymorphic constants on the fly. 

476 

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

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

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

480 
after unfolding the constant definitions. 

481 

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

483 
from type nat to type int. 

484 

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

47809  487 

488 
 lift_definition command: Defines operations on an abstract type in 

489 
terms of a corresponding operation on a representation 

490 
type. Example syntax: 

491 

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

493 
is List.insert 

494 

495 
Users must discharge a respectfulness proof obligation when each 

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

497 
the proof is discharged automatically.) The obligation is 

498 
presented in a userfriendly, readable form; a respectfulness 

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

500 
by the package. 

501 

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

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

504 
lift_definition generates a code certificate theorem and sets up 

505 
code generation for each constant. 

506 

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

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

509 
or a type_definition theorem. The package configures transfer 

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

511 
lift_definition command to work with the type. 

512 

513 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

47851  514 
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, 
515 
Word/Word.thy and Library/Float.thy. 

47809  516 

517 
* Quotient package: 

518 

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

520 
rep and abs functions, similar to typedef. 

521 

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

523 
Transfer packages, as with 'setup_lifting'. 

524 

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

526 
respectfulness property at the point where the constant is 

527 
defined, similar to lift_definition; INCOMPATIBILITY. 

528 

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

530 
accordingly, INCOMPATIBILITY. 

531 

532 
* New diagnostic command 'find_unused_assms' to find potentially 

533 
superfluous assumptions in theorems using Quickcheck. 

534 

535 
* Quickcheck: 

536 

537 
 Quickcheck returns variable assignments as counterexamples, which 

538 
allows to reveal the underspecification of functions under test. 

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

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

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

542 

543 
These counterexample are marked as potentially spurious, as 

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

545 
obvious theorem "hd xs = hd xs". 

546 

547 
After finding a potentially spurious counterexample, Quickcheck 

548 
continues searching for genuine ones. 

549 

550 
By default, Quickcheck shows potentially spurious and genuine 

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

552 
show genuine counterexamples. 

553 

554 
 The command 'quickcheck_generator' creates random and exhaustive 

555 
value generators for a given type and operations. 

556 

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

558 
constructors of that type. 

559 

560 
 Support for multisets. 

561 

562 
 Added "use_subtype" options. 

563 

564 
 Added "quickcheck_locale" configuration to specify how to process 

565 
conjectures in a locale context. 

566 

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

47809  569 

570 
* Sledgehammer: 

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

572 
paper "More SPASS with Isabelle". 

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

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

575 
TFF1), iProver, iProverEq. 

576 
 Sped up the minimizer. 

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

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

579 
 Renamed "sound" option to "strict". 

580 

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

583 

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

585 

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

47809  587 

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

590 

591 
list.exhaust [case_product nat.exhaust] 

592 

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

594 
a list and a nat. 

595 

47809  596 
* New "eventually_elim" method as a generalized variant of the 
47855  597 
eventually_elim* rules. Supports structured proofs. 
598 

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

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

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

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

602 

47856  603 
* Record: code generation can be switched off manually with 
604 

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

606 

607 
* Datatype: type parameters allow explicit sort constraints. 

608 

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

611 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

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

613 
one_case. 

614 

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

616 
the result of the fact expression. 

617 

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

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

621 

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

622 
converse_def ~> converse_unfold 
47549  623 
rel_comp_def ~> relcomp_unfold 
47820  624 
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

625 
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

626 
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

627 
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

628 

46981  629 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
630 

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

47086  633 

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

634 
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

635 

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

46458  639 
rel_pow_1 ~> relpow_1 
46363  640 
rel_pow_0_I ~> relpow_0_I 
641 
rel_pow_Suc_I ~> relpow_Suc_I 

642 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

643 
rel_pow_0_E ~> relpow_0_E 

644 
rel_pow_Suc_E ~> relpow_Suc_E 

645 
rel_pow_E ~> relpow_E 

46458  646 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  647 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  648 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
649 
rel_pow_E2 ~> relpow_E2 

650 
rel_pow_add ~> relpow_add 

651 
rel_pow_commute ~> relpow 

652 
rel_pow_empty ~> relpow_empty: 

653 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

654 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

655 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

656 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

657 
rel_pow_fun_conv ~> relpow_fun_conv 

658 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

659 
rel_pow_finite_bounded ~> relpow_finite_bounded 

660 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

661 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

662 
single_valued_rel_pow ~> single_valued_relpow 

47463  663 

46363  664 
INCOMPATIBILITY. 
665 

47448  666 
* Theory Relation: Consolidated constant name for relation composition 
47464  667 
and corresponding theorem names: 
668 

47549  669 
 Renamed constant rel_comp to relcomp. 
47464  670 

47448  671 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  672 

47448  673 
 Renamed theorems: 
47464  674 

47448  675 
rel_compI ~> relcompI 
676 
rel_compEpair ~> relcompEpair 

677 
rel_compE ~> relcompE 

678 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

679 
rel_comp_empty1 ~> relcomp_empty1 

680 
rel_comp_mono ~> relcomp_mono 

681 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

682 
rel_comp_distrib ~> relcomp_distrib 

683 
rel_comp_distrib2 ~> relcomp_distrib2 

684 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

685 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

686 
single_valued_rel_comp ~> single_valued_relcomp 

47549  687 
rel_comp_def ~> relcomp_unfold 
47448  688 
converse_rel_comp ~> converse_relcomp 
689 
pred_compI ~> relcomppI 

690 
pred_compE ~> relcomppE 

691 
pred_comp_bot1 ~> relcompp_bot1 

692 
pred_comp_bot2 ~> relcompp_bot2 

693 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

694 
pred_comp_mono ~> relcompp_mono 

695 
pred_comp_distrib ~> relcompp_distrib 

696 
pred_comp_distrib2 ~> relcompp_distrib2 

697 
converse_pred_comp ~> converse_relcompp 

47464  698 

47448  699 
finite_rel_comp ~> finite_relcomp 
47464  700 

47448  701 
set_rel_comp ~> set_relcomp 
702 

703 
INCOMPATIBILITY. 

704 

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

707 

708 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

709 
zdiv_self ~> div_self 

710 
zmod_self ~> mod_self 

711 
zdiv_zero ~> div_0 

712 
zmod_zero ~> mod_0 

713 
zdiv_zmod_equality ~> div_mod_equality2 

714 
zdiv_zmod_equality2 ~> div_mod_equality 

715 
zmod_zdiv_trivial ~> mod_div_trivial 

716 
zdiv_zminus_zminus ~> div_minus_minus 

717 
zmod_zminus_zminus ~> mod_minus_minus 

718 
zdiv_zminus2 ~> div_minus_right 

719 
zmod_zminus2 ~> mod_minus_right 

720 
zdiv_minus1_right ~> div_minus1_right 

721 
zmod_minus1_right ~> mod_minus1_right 

722 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

723 
zmod_zmult1_eq ~> mod_mult_right_eq 

724 
zpower_zmod ~> power_mod 

725 
zdvd_zmod ~> dvd_mod 

726 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

727 
mod_mult_distrib ~> mult_mod_left 

728 
mod_mult_distrib2 ~> mult_mod_right 

729 

730 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

731 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

732 

47551  733 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
734 

47552  735 
* Consolidated theorem names concerning fold combinators: 
47550  736 

737 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

738 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

739 
INFI_fold_inf ~> INF_fold_inf 

740 
SUPR_fold_sup ~> SUP_fold_sup 

741 
union_set ~> union_set_fold 

742 
minus_set ~> minus_set_fold 

743 
INFI_set_fold ~> INF_set_fold 

744 
SUPR_set_fold ~> SUP_set_fold 

745 
INF_code ~> INF_set_foldr 

746 
SUP_code ~> SUP_set_foldr 

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

748 
foldr_fold_rev ~> foldr_conv_fold 

749 
foldl_fold ~> foldl_conv_fold 

750 
foldr_foldr ~> foldr_conv_foldl 

751 
foldl_foldr ~> foldl_conv_foldr 

47552  752 
fold_set_remdups ~> fold_set_fold_remdups 
753 
fold_set ~> fold_set_fold 

754 
fold1_set ~> fold1_set_fold 

47550  755 

756 
INCOMPATIBILITY. 

757 

758 
* Dropped rarely useful theorems concerning fold combinators: 

759 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

760 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

761 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

762 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

763 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

764 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

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

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

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

768 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

769 

770 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

771 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

772 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

773 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

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

775 
fold_conv_foldr and fold_rev. 

776 

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

778 
through option types. 

779 

47856  780 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
781 
relations. 

782 

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

784 

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

786 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

787 

788 
zminus_zminus ~> minus_minus 

789 
zminus_0 ~> minus_zero 

790 
zminus_zadd_distrib ~> minus_add_distrib 

791 
zadd_commute ~> add_commute 

792 
zadd_assoc ~> add_assoc 

793 
zadd_left_commute ~> add_left_commute 

794 
zadd_ac ~> add_ac 

795 
zmult_ac ~> mult_ac 

796 
zadd_0 ~> add_0_left 

797 
zadd_0_right ~> add_0_right 

798 
zadd_zminus_inverse2 ~> left_minus 

799 
zmult_zminus ~> mult_minus_left 

800 
zmult_commute ~> mult_commute 

801 
zmult_assoc ~> mult_assoc 

802 
zadd_zmult_distrib ~> left_distrib 

803 
zadd_zmult_distrib2 ~> right_distrib 

804 
zdiff_zmult_distrib ~> left_diff_distrib 

805 
zdiff_zmult_distrib2 ~> right_diff_distrib 

806 
zmult_1 ~> mult_1_left 

807 
zmult_1_right ~> mult_1_right 

808 
zle_refl ~> order_refl 

809 
zle_trans ~> order_trans 

810 
zle_antisym ~> order_antisym 

811 
zle_linear ~> linorder_linear 

812 
zless_linear ~> linorder_less_linear 

813 
zadd_left_mono ~> add_left_mono 

814 
zadd_strict_right_mono ~> add_strict_right_mono 

815 
zadd_zless_mono ~> add_less_le_mono 

816 
int_0_less_1 ~> zero_less_one 

817 
int_0_neq_1 ~> zero_neq_one 

818 
zless_le ~> less_le 

819 
zpower_zadd_distrib ~> power_add 

820 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

821 
zero_le_zpower_abs ~> zero_le_power_abs 

822 

823 
* Theory Deriv: Renamed 

824 

825 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

826 

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

828 

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

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

833 
INCOMPATIBILITY. 

834 

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

837 

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

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

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

842 
follows: 

47452  843 

844 
Operations: 

845 
bulkload > rbt_bulkload 

846 
del_from_left > rbt_del_from_left 

847 
del_from_right > rbt_del_from_right 

848 
del > rbt_del 

849 
delete > rbt_delete 

850 
ins > rbt_ins 

851 
insert > rbt_insert 

852 
insertw > rbt_insert_with 

853 
insert_with_key > rbt_insert_with_key 

854 
map_entry > rbt_map_entry 

855 
lookup > rbt_lookup 

856 
sorted > rbt_sorted 

857 
tree_greater > rbt_greater 

858 
tree_less > rbt_less 

859 
tree_less_symbol > rbt_less_symbol 

860 
union > rbt_union 

861 
union_with > rbt_union_with 

862 
union_with_key > rbt_union_with_key 

863 

864 
Lemmas: 

865 
balance_left_sorted > balance_left_rbt_sorted 

866 
balance_left_tree_greater > balance_left_rbt_greater 

867 
balance_left_tree_less > balance_left_rbt_less 

868 
balance_right_sorted > balance_right_rbt_sorted 

869 
balance_right_tree_greater > balance_right_rbt_greater 

870 
balance_right_tree_less > balance_right_rbt_less 

871 
balance_sorted > balance_rbt_sorted 

872 
balance_tree_greater > balance_rbt_greater 

873 
balance_tree_less > balance_rbt_less 

874 
bulkload_is_rbt > rbt_bulkload_is_rbt 

875 
combine_sorted > combine_rbt_sorted 

876 
combine_tree_greater > combine_rbt_greater 

877 
combine_tree_less > combine_rbt_less 

878 
delete_in_tree > rbt_delete_in_tree 

879 
delete_is_rbt > rbt_delete_is_rbt 

880 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

881 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

882 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

883 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

884 
del_in_tree > rbt_del_in_tree 

885 
del_inv1_inv2 > rbt_del_inv1_inv2 

886 
del_sorted > rbt_del_rbt_sorted 

887 
del_tree_greater > rbt_del_rbt_greater 

888 
del_tree_less > rbt_del_rbt_less 

889 
dom_lookup_Branch > dom_rbt_lookup_Branch 

890 
entries_lookup > entries_rbt_lookup 

891 
finite_dom_lookup > finite_dom_rbt_lookup 

892 
insert_sorted > rbt_insert_rbt_sorted 

893 
insertw_is_rbt > rbt_insertw_is_rbt 

894 
insertwk_is_rbt > rbt_insertwk_is_rbt 

895 
insertwk_sorted > rbt_insertwk_rbt_sorted 

896 
insertw_sorted > rbt_insertw_rbt_sorted 

897 
ins_sorted > ins_rbt_sorted 

898 
ins_tree_greater > ins_rbt_greater 

899 
ins_tree_less > ins_rbt_less 

900 
is_rbt_sorted > is_rbt_rbt_sorted 

901 
lookup_balance > rbt_lookup_balance 

902 
lookup_bulkload > rbt_lookup_rbt_bulkload 

903 
lookup_delete > rbt_lookup_rbt_delete 

904 
lookup_Empty > rbt_lookup_Empty 

905 
lookup_from_in_tree > rbt_lookup_from_in_tree 

906 
lookup_in_tree > rbt_lookup_in_tree 

907 
lookup_ins > rbt_lookup_ins 

908 
lookup_insert > rbt_lookup_rbt_insert 

909 
lookup_insertw > rbt_lookup_rbt_insertw 

910 
lookup_insertwk > rbt_lookup_rbt_insertwk 

911 
lookup_keys > rbt_lookup_keys 

912 
lookup_map > rbt_lookup_map 

913 
lookup_map_entry > rbt_lookup_rbt_map_entry 

914 
lookup_tree_greater > rbt_lookup_rbt_greater 

915 
lookup_tree_less > rbt_lookup_rbt_less 

916 
lookup_union > rbt_lookup_rbt_union 

917 
map_entry_color_of > rbt_map_entry_color_of 

918 
map_entry_inv1 > rbt_map_entry_inv1 

919 
map_entry_inv2 > rbt_map_entry_inv2 

920 
map_entry_is_rbt > rbt_map_entry_is_rbt 

921 
map_entry_sorted > rbt_map_entry_rbt_sorted 

922 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

923 
map_entry_tree_less > rbt_map_entry_rbt_less 

924 
map_tree_greater > map_rbt_greater 

925 
map_tree_less > map_rbt_less 

926 
map_sorted > map_rbt_sorted 

927 
paint_sorted > paint_rbt_sorted 

928 
paint_lookup > paint_rbt_lookup 

929 
paint_tree_greater > paint_rbt_greater 

930 
paint_tree_less > paint_rbt_less 

931 
sorted_entries > rbt_sorted_entries 

932 
tree_greater_eq_trans > rbt_greater_eq_trans 

933 
tree_greater_nit > rbt_greater_nit 

934 
tree_greater_prop > rbt_greater_prop 

935 
tree_greater_simps > rbt_greater_simps 

936 
tree_greater_trans > rbt_greater_trans 

937 
tree_less_eq_trans > rbt_less_eq_trans 

938 
tree_less_nit > rbt_less_nit 

939 
tree_less_prop > rbt_less_prop 

940 
tree_less_simps > rbt_less_simps 

941 
tree_less_trans > rbt_less_trans 

942 
tree_ord_props > rbt_ord_props 

943 
union_Branch > rbt_union_Branch 

944 
union_is_rbt > rbt_union_is_rbt 

945 
unionw_is_rbt > rbt_unionw_is_rbt 

946 
unionwk_is_rbt > rbt_unionwk_is_rbt 

947 
unionwk_sorted > rbt_unionwk_rbt_sorted 

948 

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

951 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  952 

953 
Changed Operations: 

47622  954 
float_abs > abs 
955 
float_nprt > nprt 

956 
float_pprt > pprt 

957 
pow2 > use powr 

958 
round_down > float_round_down 

959 
round_up > float_round_up 

960 
scale > exponent 

961 

962 
Removed Operations: 

963 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

964 

965 
Renamed Lemmas: 

966 
abs_float_def > Float.compute_float_abs 

967 
bitlen_ge0 > bitlen_nonneg 

968 
bitlen.simps > Float.compute_bitlen 

969 
float_components > Float_mantissa_exponent 

970 
float_divl.simps > Float.compute_float_divl 

971 
float_divr.simps > Float.compute_float_divr 

972 
float_eq_odd > mult_powr_eq_mult_powr_iff 

973 
float_power > real_of_float_power 

974 
lapprox_posrat_def > Float.compute_lapprox_posrat 

975 
lapprox_rat.simps > Float.compute_lapprox_rat 

976 
le_float_def' > Float.compute_float_le 

977 
le_float_def > less_eq_float.rep_eq 

978 
less_float_def' > Float.compute_float_less 

979 
less_float_def > less_float.rep_eq 

980 
normfloat_def > Float.compute_normfloat 

981 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

982 
normfloat > normfloat_def 

983 
normfloat_unique > use normfloat_def 

984 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

985 
one_float_def > Float.compute_float_one 

986 
plus_float_def > Float.compute_float_plus 

987 
rapprox_posrat_def > Float.compute_rapprox_posrat 

988 
rapprox_rat.simps > Float.compute_rapprox_rat 

989 
real_of_float_0 > zero_float.rep_eq 

990 
real_of_float_1 > one_float.rep_eq 

991 
real_of_float_abs > abs_float.rep_eq 

992 
real_of_float_add > plus_float.rep_eq 

993 
real_of_float_minus > uminus_float.rep_eq 

994 
real_of_float_mult > times_float.rep_eq 

995 
real_of_float_simp > Float.rep_eq 

996 
real_of_float_sub > minus_float.rep_eq 

997 
round_down.simps > Float.compute_float_round_down 

998 
round_up.simps > Float.compute_float_round_up 

999 
times_float_def > Float.compute_float_times 

1000 
uminus_float_def > Float.compute_float_uminus 

1001 
zero_float_def > Float.compute_float_zero 

1002 

1003 
Lemmas not necessary anymore, use the transfer method: 

1004 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

1005 
float_divr, float_le_simp, float_less1_mantissa_bound, 

1006 
float_less_simp, float_less_zero, float_le_zero, 

1007 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

1008 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

1009 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

1010 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

1011 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

1012 
round_up, zero_le_float, zero_less_float 

47616  1013 

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

45791  1016 

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

1019 

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

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

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

1024 

1025 
* Session HOLWord: Discontinued many redundant theorems specific to 

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

1027 
instead. 

1028 

1029 
word_sub_alt ~> word_sub_wi 

1030 
word_add_alt ~> word_add_def 

1031 
word_mult_alt ~> word_mult_def 

1032 
word_minus_alt ~> word_minus_def 

1033 
word_0_alt ~> word_0_wi 

1034 
word_1_alt ~> word_1_wi 

1035 
word_add_0 ~> add_0_left 

1036 
word_add_0_right ~> add_0_right 

1037 
word_mult_1 ~> mult_1_left 

1038 
word_mult_1_right ~> mult_1_right 

1039 
word_add_commute ~> add_commute 

1040 
word_add_assoc ~> add_assoc 

1041 
word_add_left_commute ~> add_left_commute 

1042 
word_mult_commute ~> mult_commute 

1043 
word_mult_assoc ~> mult_assoc 

1044 
word_mult_left_commute ~> mult_left_commute 

1045 
word_left_distrib ~> left_distrib 

1046 
word_right_distrib ~> right_distrib 

1047 
word_left_minus ~> left_minus 

1048 
word_diff_0_right ~> diff_0_right 

1049 
word_diff_self ~> diff_self 

1050 
word_sub_def ~> diff_minus 

1051 
word_diff_minus ~> diff_minus 

1052 
word_add_ac ~> add_ac 

1053 
word_mult_ac ~> mult_ac 

1054 
word_plus_ac0 ~> add_0_left add_0_right add_ac 

1055 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 

1056 
word_order_trans ~> order_trans 

1057 
word_order_refl ~> order_refl 

1058 
word_order_antisym ~> order_antisym 

1059 
word_order_linear ~> linorder_linear 

1060 
lenw1_zero_neq_one ~> zero_neq_one 

1061 
word_number_of_eq ~> number_of_eq 

1062 
word_of_int_add_hom ~> wi_hom_add 

1063 
word_of_int_sub_hom ~> wi_hom_sub 

1064 
word_of_int_mult_hom ~> wi_hom_mult 

1065 
word_of_int_minus_hom ~> wi_hom_neg 

1066 
word_of_int_succ_hom ~> wi_hom_succ 

1067 
word_of_int_pred_hom ~> wi_hom_pred 

1068 
word_of_int_0_hom ~> word_0_wi 

1069 
word_of_int_1_hom ~> word_1_wi 

1070 

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

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

1074 
multiplication, shifting by constants, bitwise operators and numeric 

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

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

1079 

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

1082 
measure_space. The locales based on subset_class now have two 

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

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

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

1088 
Measure space constructions for distributions and densities now got 

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

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

1091 
and point_measure is introduced. INCOMPATIBILITY. 

47694  1092 

1093 
Renamed constants: 

1094 
measure > emeasure 

1095 
finite_measure.\<mu>' > measure 

1096 
product_algebra_generator > prod_algebra 

1097 
product_prob_space.emb > prod_emb 

1098 
product_prob_space.infprod_algebra > PiM 

1099 

1100 
Removed locales: 

1101 
completeable_measure_space 

1102 
finite_measure_space 

1103 
finite_prob_space 

1104 
finite_product_finite_prob_space 

1105 
finite_product_sigma_algebra 

1106 
finite_sigma_algebra 

1107 
measure_space 

1108 
pair_finite_prob_space 

1109 
pair_finite_sigma_algebra 

1110 
pair_finite_space 

1111 
pair_sigma_algebra 

1112 
product_sigma_algebra 

1113 

1114 
Removed constants: 

47751  1115 
conditional_space 
47694  1116 
distribution > use distr measure, or distributed predicate 
47751  1117 
image_space 
47694  1118 
joint_distribution > use distr measure, or distributed predicate 
47751  1119 
pair_measure_generator 
47694  1120 
product_prob_space.infprod_algebra > use PiM 
1121 
subvimage 

1122 

1123 
Replacement theorems: 

47751  1124 
finite_additivity_sufficient > ring_of_sets.countably_additiveI_finite 
1125 
finite_measure.empty_measure > measure_empty 

1126 
finite_measure.finite_continuity_from_above > finite_measure.finite_Lim_measure_decseq 

1127 
finite_measure.finite_continuity_from_below > finite_measure.finite_Lim_measure_incseq 

1128 
finite_measure.finite_measure_countably_subadditive > finite_measure.finite_measure_subadditive_countably 

1129 
finite_measure.finite_measure_eq > finite_measure.emeasure_eq_measure 

1130 
finite_measure.finite_measure > finite_measure.emeasure_finite 

1131 
finite_measure.finite_measure_finite_singleton > finite_measure.finite_measure_eq_setsum_singleton 

1132 
finite_measure.positive_measure' > measure_nonneg 

1133 
finite_measure.real_measure > finite_measure.emeasure_real 

1134 
finite_product_prob_space.finite_measure_times > finite_product_prob_space.finite_measure_PiM_emb 

1135 
finite_product_sigma_algebra.in_P > sets_PiM_I_finite 

1136 
finite_product_sigma_algebra.P_empty > space_PiM_empty, sets_PiM_empty 

1137 
information_space.conditional_entropy_eq > information_space.conditional_entropy_simple_distributed 

1138 
information_space.conditional_entropy_positive > information_space.conditional_entropy_nonneg_simple 

1139 
information_space.conditional_mutual_information_eq_mutual_information > information_space.conditional_mutual_information_eq_mutual_information_simple 

1140 
information_space.conditional_mutual_information_generic_positive > information_space.conditional_mutual_information_nonneg_simple 

1141 
information_space.conditional_mutual_information_positive > information_space.conditional_mutual_information_nonneg_simple 

1142 
information_space.entropy_commute > information_space.entropy_commute_simple 

1143 
information_space.entropy_eq > information_space.entropy_simple_distributed 

1144 
information_space.entropy_generic_eq > information_space.entropy_simple_distributed 

1145 
information_space.entropy_positive > information_space.entropy_nonneg_simple 

1146 
information_space.entropy_uniform_max > information_space.entropy_uniform 

1147 
information_space.KL_eq_0_imp > information_space.KL_eq_0_iff_eq 

1148 
information_space.KL_eq_0 > information_space.KL_same_eq_0 

1149 
information_space.KL_ge_0 > information_space.KL_nonneg 

1150 
information_space.mutual_information_eq > information_space.mutual_information_simple_distributed 

1151 
information_space.mutual_information_positive > information_space.mutual_information_nonneg_simple 

1152 
Int_stable_cuboids > Int_stable_atLeastAtMost 

1153 
Int_stable_product_algebra_generator > positive_integral 

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

47694  1155 
measure_space.additive > emeasure_additive 
47751  1156 
measure_space.AE_iff_null_set > AE_iff_null 
1157 
measure_space.almost_everywhere_def > eventually_ae_filter 

1158 
measure_space.almost_everywhere_vimage > AE_distrD 

1159 
measure_space.continuity_from_above > INF_emeasure_decseq 

1160 
measure_space.continuity_from_above_Lim > Lim_emeasure_decseq 

1161 
measure_space.continuity_from_below_Lim > Lim_emeasure_incseq 

47694  1162 
measure_space.continuity_from_below > SUP_emeasure_incseq 
47751  1163 
measure_space_density > emeasure_density 
1164 
measure_space.density_is_absolutely_continuous > absolutely_continuousI_density 

1165 
measure_space.integrable_vimage > integrable_distr 

1166 
measure_space.integral_translated_density > integral_density 

1167 
measure_space.integral_vimage > integral_distr 

1168 
measure_space.measure_additive > plus_emeasure 

1169 
measure_space.measure_compl > emeasure_compl 

1170 
measure_space.measure_countable_increasing > emeasure_countable_increasing 

1171 
measure_space.measure_countably_subadditive > emeasure_subadditive_countably 

47694  1172 
measure_space.measure_decseq > decseq_emeasure 
47751  1173 
measure_space.measure_Diff > emeasure_Diff 
1174 
measure_space.measure_Diff_null_set > emeasure_Diff_null_set 

47694  1175 
measure_space.measure_eq_0 > emeasure_eq_0 
1176 
measure_space.measure_finitely_subadditive > emeasure_subadditive_finite 

47751  1177 
measure_space.measure_finite_singleton > emeasure_eq_setsum_singleton 
1178 
measure_space.measure_incseq > incseq_emeasure 

1179 
measure_space.measure_insert > emeasure_insert 

1180 
measure_space.measure_mono > emeasure_mono 

1181 
measure_space.measure_not_negative > emeasure_not_MInf 

1182 
measure_space.measure_preserving_Int_stable > measure_eqI_generator_eq 

1183 
measure_space.measure_setsum > setsum_emeasure 

1184 
measure_space.measure_setsum_split > setsum_emeasure_cover 

47694  1185 
measure_space.measure_space_vimage > emeasure_distr 
47751  1186 
measure_space.measure_subadditive_finite > emeasure_subadditive_finite 
1187 
measure_space.measure_subadditive > subadditive 

1188 
measure_space.measure_top > emeasure_space 

1189 
measure_space.measure_UN_eq_0 > emeasure_UN_eq_0 

1190 
measure_space.measure_Un_null_set > emeasure_Un_null_set 

1191 
measure_space.positive_integral_translated_density > positive_integral_density 

1192 
measure_space.positive_integral_vimage > positive_integral_distr 

47694  1193 
measure_space.real_continuity_from_above > Lim_measure_decseq 
47751  1194 
measure_space.real_continuity_from_below > Lim_measure_incseq 
47694  1195 
measure_space.real_measure_countably_subadditive > measure_subadditive_countably 
47751  1196 
measure_space.real_measure_Diff > measure_Diff 
1197 
measure_space.real_measure_finite_Union > measure_finite_Union 

1198 
measure_space.real_measure_setsum_singleton > measure_eq_setsum_singleton 

1199 
measure_space.real_measure_subadditive > measure_subadditive 

1200 
measure_space.real_measure_Union > measure_Union 

1201 
measure_space.real_measure_UNION > measure_UNION 

47694  1202 
measure_space.simple_function_vimage > simple_function_comp 
1203 
measure_space.simple_integral_vimage > simple_integral_distr 

47751  1204 
measure_space.simple_integral_vimage > simple_integral_distr 
1205 
measure_unique_Int_stable > measure_eqI_generator_eq 

1206 
measure_unique_Int_stable_vimage > measure_eqI_generator_eq 

47694  1207 
pair_sigma_algebra.measurable_cut_fst > sets_Pair1 
1208 
pair_sigma_algebra.measurable_cut_snd > sets_Pair2 

1209 
pair_sigma_algebra.measurable_pair_image_fst > measurable_Pair1 

1210 
pair_sigma_algebra.measurable_pair_image_snd > measurable_Pair2 

1211 
pair_sigma_algebra.measurable_product_swap > measurable_pair_swap_iff 

1212 
pair_sigma_algebra.pair_sigma_algebra_measurable > measurable_pair_swap 

1213 
pair_sigma_algebra.pair_sigma_algebra_swap_measurable > measurable_pair_swap' 

1214 
pair_sigma_algebra.sets_swap > sets_pair_swap 

47751  1215 
pair_sigma_finite.measure_cut_measurable_fst > pair_sigma_finite.measurable_emeasure_Pair1 
1216 
pair_sigma_finite.measure_cut_measurable_snd > pair_sigma_finite.measurable_emeasure_Pair2 

1217 
pair_sigma_finite.measure_preserving_swap > pair_sigma_finite.distr_pair_swap 

1218 
pair_sigma_finite.pair_measure_alt2 > pair_sigma_finite.emeasure_pair_measure_alt2 

1219 
pair_sigma_finite.pair_measure_alt > pair_sigma_finite.emeasure_pair_measure_alt 

1220 
pair_sigma_finite.pair_measure_times > pair_sigma_finite.emeasure_pair_measure_Times 

1221 
prob_space.indep_distribution_eq_measure > prob_space.indep_vars_iff_distr_eq_PiM 

1222 
prob_space.indep_var_distributionD > prob_space.indep_var_distribution_eq 

47694  1223 
prob_space.measure_space_1 > prob_space.emeasure_space_1 
1224 
prob_space.prob_space_vimage > prob_space_distr 

1225 
prob_space.random_variable_restrict > measurable_restrict 

47751  1226 
prob_space_unique_Int_stable > measure_eqI_prob_space 
1227 
product_algebraE > prod_algebraE_all 

1228 
product_algebra_generator_der > prod_algebra_eq_finite 

1229 
product_algebra_generator_into_space > prod_algebra_sets_into_space 

1230 
product_algebraI > sets_PiM_I_finite 

1231 
product_measure_exists > product_sigma_finite.sigma_finite 

47694  1232 
product_prob_space.finite_index_eq_finite_product > product_prob_space.sets_PiM_generator 
1233 
product_prob_space.finite_measure_infprod_emb_Pi > product_prob_space.measure_PiM_emb 

1234 
product_prob_space.infprod_spec > product_prob_space.emeasure_PiM_emb_not_empty 

1235 
product_prob_space.measurable_component > measurable_component_singleton 

1236 
product_prob_space.measurable_emb > measurable_prod_emb 

1237 
product_prob_space.measurable_into_infprod_algebra > measurable_PiM_single 

1238 
product_prob_space.measurable_singleton_infprod > measurable_component_singleton 

1239 
product_prob_space.measure_emb > emeasure_prod_emb 

47751  1240 
product_prob_space.measure_preserving_restrict > product_prob_space.distr_restrict 
1241 
product_sigma_algebra.product_algebra_into_space > space_closed 

1242 
product_sigma_finite.measure_fold > product_sigma_finite.distr_merge 

1243 
product_sigma_finite.measure_preserving_component_singelton > product_sigma_finite.distr_singleton 

1244 
product_sigma_finite.measure_preserving_merge > product_sigma_finite.distr_merge 

47694  1245 
sequence_space.measure_infprod > sequence_space.measure_PiM_countable 
47751  1246 
sets_product_algebra > sets_PiM 
1247 
sigma_algebra.measurable_sigma > measurable_measure_of 

1248 
sigma_finite_measure.disjoint_sigma_finite > sigma_finite_disjoint 

1249 
sigma_finite_measure.RN_deriv_vimage > sigma_finite_measure.RN_deriv_distr 

1250 
sigma_product_algebra_sigma_eq > sigma_prod_algebra_sigma_eq 

1251 
space_product_algebra > space_PiM 

47694  1252 

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

47413  1255 

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

1256 

45160  1257 
*** FOL *** 
1258 

45383  1259 
* New "case_product" attribute (see HOL). 
45160  1260 

45109  1261 

47463  1262 
*** ZF *** 
1263 

1264 
* Greater support for structured proofs involving induction or case 

1265 
analysis. 

1266 

1267 
* Much greater use of mathematical symbols. 

1268 

1269 
* Removal of many ML theorem bindings. INCOMPATIBILITY. 

1270 

1271 

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

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

1273 

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

1276 

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

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

1278 
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

1279 
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

1280 

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

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

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

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

1284 
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

1285 
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

1286 
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

1287 
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

1288 
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

1289 

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

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

1291 
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

1292 

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

1295 
declarations like Local_Theory.note. 

1296 

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

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

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

1299 

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

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

1301 
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

1302 
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

1303 

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

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

1305 

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

1306 
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

1307 
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

1308 
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

1309 
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

1310 
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

1311 
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

1312 
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

1313 
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

1314 
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

1315 
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

1316 
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

1317 
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

1318 

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

1319 

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

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

1321 

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

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

1323 
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

1324 
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

1325 
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

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

1327 
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

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

1329 

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

1332 

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

1335 

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

1336 

45109  1337 

44801  1338 
New in Isabelle20111 (October 2011) 
1339 
 

41651  1340 

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

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

1342 

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

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

1349 

44777  1350 
 Markup of formal entities within the text buffer, with semantic 
44760  1351 
highlighting, tooltips and hyperlinks to jump to defining source 
1352 
positions. 

1353 

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

1356 
theory output and other nonIsabelle text boxes). 

1357 

1358 
 Refined scheduling of proof checking and printing of results, 

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

1361 

44777  1362 
 Reduced CPU performance requirements, usable on machines with few 
44760  1363 
cores. 
1364 

44777  1365 
 Reduced memory requirements due to pruning of unused document 
44760  1366 
versions (garbage collection). 
1367 

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

1369 
including some remaining limitations. 

1370 

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

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

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

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

1376 
INCOMPATIBILITY. 

1377 

41955
703ea96b13c6
files are identified via SHA1 digests  discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset

1378 
* Theory loader: source files are identified by content via SHA1 
703ea96b13c6
files are identified via SHA1 digests  discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset

1379 
digests. Discontinued former path/modtime identification and optional 
703ea96b13c6
files are identified via SHA1 digests  discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset

1380 
ISABELLE_FILE_IDENT plugin scripts. 
703ea96b13c6
files are identified via SHA1 digests  discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset

1381 

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

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

1383 
Goal.parallel_proofs_threshold (default 100). See also isabelle 
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

1384 
usedir option Q. 
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

1385 

42669
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1386 
* Name space: former unsynchronized references are now proper 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1387 
configuration options, with more conventional names: 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1388 

04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1389 
long_names ~> names_long 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1390 
short_names ~> names_short 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1391 
unique_names ~> names_unique 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1392 

04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1393 
Minor INCOMPATIBILITY, need to declare options in context like this: 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1394 

04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1395 
declare [[names_unique = false]] 
42358
b47d41d9f4b5
Name_Space: proper configuration options long_names, short_names, unique_names instead of former unsynchronized references;
wenzelm
parents:
42290
diff
changeset

1396 

42502  1397 
* Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note 
1398 
that the result needs to be unique, which means fact specifications 

1399 
may have to be refined after enriching a proof context. 

1400 

44800  1401 
* Attribute "case_names" has been refined: the assumptions in each case 
1402 
can be named now by following the case name with [name1 name2 ...]. 

1403 

44968  1404 
* Isabelle/Isar reference manual has been updated and extended: 
1405 
 "Synopsis" provides a catalog of main Isar language concepts. 

1406 
 Formal references in syntax diagrams, via @{rail} antiquotation. 

1407 
 Updated material from classic "ref" manual, notably about 

1408 
"Classical Reasoner". 

42633  1409 

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

1410 

41727
ab3f6d76fb23
available_provers ~> supported_provers (for clarity)
blanchet
parents:
41703
diff
changeset

1411 
*** HOL *** 
ab3f6d76fb23
available_provers ~> supported_provers (for clarity)
blanchet
parents:
41703
diff
changeset

1412 

44968  1413 
* Class bot and top require underlying partial order rather than 
44800  1414 
preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY. 
43815
4f6e2965d821
adjusted to tightened specification of classes bot and top
haftmann
parents:
43752
diff
changeset

1415 

43940  1416 
* Class complete_lattice: generalized a couple of lemmas from sets; 
44800  1417 
generalized theorems INF_cong and SUP_cong. New type classes for 
1418 
complete boolean algebras and complete linear orders. Lemmas 

1419 
Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in 
