author  wenzelm 
Tue, 10 Jan 2017 16:53:05 +0100  
changeset 64867  e7220f4de11f 
parent 64846  de4e3df6693d 
child 64876  65a247444100 
permissions  rwrr 
57491  1 
Isabelle NEWS  history of userrelevant changes 
2 
================================================= 

2553  3 

62114
a7cf464933f7
generate HTML version of NEWS, with proper symbol rendering;
wenzelm
parents:
62111
diff
changeset

4 
(Note: Isabelle/jEdit shows a treeview of the NEWS file in Sidekick.) 
60007  5 

64603  6 

64439  7 
New in this Isabelle version 
8 
 

9 

64602  10 
*** Prover IDE  Isabelle/Scala/jEdit *** 
11 

12 
* Commandline invocation "isabelle jedit R l LOGIC" opens the ROOT 

13 
entry of the specified logic session in the editor, while its parent is 

14 
used for formal checking. 

15 

64842  16 
* The PIDE document model maintains file content independently of the 
17 
status of jEdit editor buffers. Reloading jEdit buffers no longer causes 

18 
changes of formal document content. Theory dependencies are always 

19 
resolved internally, without the need for corresponding editor buffers. 

20 
The system option "jedit_auto_load" has been discontinued: it is 

21 
effectively always enabled. 

22 

64867  23 
* The Theories dockable provides a "Purge" button, in order to restrict 
24 
the document model to theories that are required for open editor 

25 
buffers. 

26 

64602  27 

64593
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

28 
*** HOL *** 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

29 

64632  30 
* Dropped aliasses RangeP, DomainP for Rangep, Domainp respectively. 
31 
INCOMPATIBILITY. 

32 

64787  33 
* Dropped abbreviations transP, antisymP, single_valuedP; 
64634  34 
use constants transp, antisymp, single_valuedp instead. 
35 
INCOMPATIBILITY. 

64633
5ebcf6c525f1
prefer existing logical constant over abbreviation
haftmann
parents:
64632
diff
changeset

36 

64785  37 
* Algebraic type class hierarchy of euclidean (semi)rings in HOL: 
38 
euclidean_(semi)ring, euclidean_(semi)ring_cancel, 

39 
unique_euclidean_(semi)ring; instantiation requires 

40 
provision of a euclidean size. 

41 

64786
340db65fd2c1
reworked to provide auxiliary operations Euclidean_Algorithm.* to instantiate gcd etc. for euclidean rings
haftmann
parents:
64785
diff
changeset

42 
* Reworking of theory Euclidean_Algorithm in session HOLNumber_Theory: 
340db65fd2c1
reworked to provide auxiliary operations Euclidean_Algorithm.* to instantiate gcd etc. for euclidean rings
haftmann
parents:
64785
diff
changeset

43 
 Euclidean induction is available as rule eucl_induct; 
340db65fd2c1
reworked to provide auxiliary operations Euclidean_Algorithm.* to instantiate gcd etc. for euclidean rings
haftmann
parents:
64785
diff
changeset

44 
 Constants Euclidean_Algorithm.gcd, Euclidean_Algorithm.lcm, 
340db65fd2c1
reworked to provide auxiliary operations Euclidean_Algorithm.* to instantiate gcd etc. for euclidean rings
haftmann
parents:
64785
diff
changeset

45 
Euclidean_Algorithm.Gcd and Euclidean_Algorithm.Lcm allow 
340db65fd2c1
reworked to provide auxiliary operations Euclidean_Algorithm.* to instantiate gcd etc. for euclidean rings
haftmann
parents:
64785
diff
changeset

46 
easy instantiation of euclidean (semi)rings as GCD (semi)rings. 
340db65fd2c1
reworked to provide auxiliary operations Euclidean_Algorithm.* to instantiate gcd etc. for euclidean rings
haftmann
parents:
64785
diff
changeset

47 
 Coefficients obtained by extended euclidean algorithm are 
340db65fd2c1
reworked to provide auxiliary operations Euclidean_Algorithm.* to instantiate gcd etc. for euclidean rings
haftmann
parents:
64785
diff
changeset

48 
available as "bezout_coefficients". 
340db65fd2c1
reworked to provide auxiliary operations Euclidean_Algorithm.* to instantiate gcd etc. for euclidean rings
haftmann
parents:
64785
diff
changeset

49 
INCOMPATIBILITY. 
340db65fd2c1
reworked to provide auxiliary operations Euclidean_Algorithm.* to instantiate gcd etc. for euclidean rings
haftmann
parents:
64785
diff
changeset

50 

64787  51 
* Named collection mod_simps covers various congruence rules 
52 
concerning mod, replacing former zmod_simps. 

53 
INCOMPATIBILITY. 

54 

64593
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

55 
* Swapped orientation of congruence rules mod_add_left_eq, 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

56 
mod_add_right_eq, mod_add_eq, mod_mult_left_eq, mod_mult_right_eq, 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

57 
mod_mult_eq, mod_minus_eq, mod_diff_left_eq, mod_diff_right_eq, 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

58 
mod_diff_eq. INCOMPATIBILITY. 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

59 

50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

60 
* Generalized some facts: 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

61 
zminus_zmod ~> mod_minus_eq 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

62 
zdiff_zmod_left ~> mod_diff_left_eq 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

63 
zdiff_zmod_right ~> mod_diff_right_eq 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

64 
zmod_eq_dvd_iff ~> mod_eq_dvd_iff 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

65 
INCOMPATIBILITY. 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

66 

64532
fc2835a932d9
don't generate 'size_gen_o_map' property if its type variable is too limited anyway to be useful
blanchet
parents:
64529
diff
changeset

67 
* (Co)datatype package: 
fc2835a932d9
don't generate 'size_gen_o_map' property if its type variable is too limited anyway to be useful
blanchet
parents:
64529
diff
changeset

68 
 The 'size_gen_o_map' lemma is no longer generated for datatypes 
fc2835a932d9
don't generate 'size_gen_o_map' property if its type variable is too limited anyway to be useful
blanchet
parents:
64529
diff
changeset

69 
with type class annotations. As a result, the tactic that derives 
fc2835a932d9
don't generate 'size_gen_o_map' property if its type variable is too limited anyway to be useful
blanchet
parents:
64529
diff
changeset

70 
it no longer fails on nested datatypes. Slight INCOMPATIBILITY. 
fc2835a932d9
don't generate 'size_gen_o_map' property if its type variable is too limited anyway to be useful
blanchet
parents:
64529
diff
changeset

71 

64846  72 
* Session HOLAnalysis: more material involving arcs, paths, covering spaces, 
73 
innessential maps, retracts. Major results include the Jordan Curve Theorem. 

74 

64543
6b13586ef1a2
remove typo in bij_swap_compose_bij theorem name; tune proof
bulwahn
parents:
64532
diff
changeset

75 
* The theorem in Permutations has been renamed: 
6b13586ef1a2
remove typo in bij_swap_compose_bij theorem name; tune proof
bulwahn
parents:
64532
diff
changeset

76 
bij_swap_ompose_bij ~> bij_swap_compose_bij 
64602  77 

60331  78 

64844  79 
*** System *** 
80 

81 
* Prover IDE support for the Visual Studio Code editor and language 

82 
server protocol, via the "isabelle vscode_server" tool (see also 

83 
src/Tools/VSCode/README.md). The example application within the VS code 

84 
editor is called "Isabelle" and available from its online repository 

85 
(the "Marketplace"). It serves as example for further potential IDE 

86 
frontends. 

87 

88 

64072  89 
New in Isabelle20161 (December 2016) 
90 
 

62216  91 

62440  92 
*** General *** 
93 

64390  94 
* Splitter in proof methods "simp", "auto" and friends: 
95 
 The syntax "split add" has been discontinued, use plain "split", 

96 
INCOMPATIBILITY. 

97 
 For situations with many conditional or case expressions, there is 

98 
an alternative splitting strategy that can be much faster. It is 

99 
selected by writing "split!" instead of "split". It applies safe 

100 
introduction and elimination rules after each split rule. As a 

101 
result the subgoal may be split into several subgoals. 

102 

63273  103 
* Command 'bundle' provides a local theory target to define a bundle 
104 
from the body of specification commands (such as 'declare', 

105 
'declaration', 'notation', 'lemmas', 'lemma'). For example: 

106 

107 
bundle foo 

108 
begin 

109 
declare a [simp] 

110 
declare b [intro] 

111 
end 

63272  112 

63282  113 
* Command 'unbundle' is like 'include', but works within a local theory 
114 
context. Unlike "context includes ... begin", the effect of 'unbundle' 

115 
on the target context persists, until different declarations are given. 

116 

63977  117 
* Simplified outer syntax: uniform category "name" includes long 
118 
identifiers. Former "xname" / "nameref" / "name reference" has been 

119 
discontinued. 

120 

121 
* Embedded content (e.g. the inner syntax of types, terms, props) may be 

122 
delimited uniformly via cartouches. This works better than oldfashioned 

123 
quotes when sublanguages are nested. 

124 

125 
* Mixfix annotations support general block properties, with syntax 

126 
"(\<open>x=a y=b z \<dots>\<close>". Notable property names are "indent", "consistent", 

127 
"unbreakable", "markup". The existing notation "(DIGITS" is equivalent 

128 
to "(\<open>indent=DIGITS\<close>". The former notation "(00" for unbreakable blocks 

129 
is superseded by "(\<open>unbreabable\<close>"  rare INCOMPATIBILITY. 

63649  130 

63384  131 
* Proof method "blast" is more robust wrt. corner cases of Pure 
132 
statements without objectlogic judgment. 

133 

63624
994d1a1105ef
more informative 'prf' and 'full_prf', based on HOL/Proofs/ex/XML_Data.thy;
wenzelm
parents:
63610
diff
changeset

134 
* Commands 'prf' and 'full_prf' are somewhat more informative (again): 
63977  135 
proof terms are reconstructed and cleaned from administrative thm nodes. 
136 

137 
* Code generator: config option "code_timing" triggers measurements of 

138 
different phases of code generation. See src/HOL/ex/Code_Timing.thy for 

139 
examples. 

140 

141 
* Code generator: implicits in Scala (stemming from type class 

142 
instances) are generated into companion object of corresponding type 

143 
class, to resolve some situations where ambiguities may occur. 

144 

64390  145 
* Solve direct: option "solve_direct_strict_warnings" gives explicit 
146 
warnings for lemma statements with trivial proofs. 

64013
048b7dbfdfa3
option to report results of solve_direct as explicit warnings
haftmann
parents:
63995
diff
changeset

147 

64602  148 

62904  149 
*** Prover IDE  Isabelle/Scala/jEdit *** 
150 

64527  151 
* More aggressive flushing of machinegenerated input, according to 
152 
system option editor_generated_input_delay (in addition to existing 

153 
editor_input_delay for regular user edits). This may affect overall PIDE 

154 
reactivity and CPU usage. 

155 

64390  156 
* Syntactic indentation according to Isabelle outer syntax. Action 
157 
"indentlines" (shortcut C+i) indents the current line according to 

158 
command keywords and some command substructure. Action 

159 
"isabelle.newline" (shortcut ENTER) indents the old and the new line 

160 
according to command keywords only; see also option 

161 
"jedit_indent_newline". 

162 

163 
* Semantic indentation for unstructured proof scripts ('apply' etc.) via 

164 
number of subgoals. This requires information of ongoing document 

165 
processing and may thus lag behind, when the user is editing too 

166 
quickly; see also option "jedit_script_indent" and 

167 
"jedit_script_indent_limit". 

168 

169 
* Refined folding mode "isabelle" based on Isar syntax: 'next' and 'qed' 

170 
are treated as delimiters for fold structure; 'begin' and 'end' 

171 
structure of theory specifications is treated as well. 

172 

173 
* Command 'proof' provides information about proof outline with cases, 

174 
e.g. for proof methods "cases", "induct", "goal_cases". 

175 

176 
* Completion templates for commands involving "begin ... end" blocks, 

177 
e.g. 'context', 'notepad'. 

178 

179 
* Sidekick parser "isabellecontext" shows nesting of context blocks 

180 
according to 'begin' and 'end' structure. 

181 

63977  182 
* Highlighting of entity def/ref positions wrt. cursor. 
183 

184 
* Action "isabelle.selectentity" (shortcut CS+ENTER) selects all 

64514  185 
occurrences of the formal entity at the caret position. This facilitates 
63977  186 
systematic renaming. 
187 

188 
* PIDE document markup works across multiple Isar commands, e.g. the 

189 
results established at the end of a proof are properly identified in the 

190 
theorem statement. 

191 

192 
* Cartouche abbreviations work both for " and ` to accomodate typical 

193 
situations where old ASCII notation may be updated. 

194 

63875  195 
* Dockable window "Symbols" also provides access to 'abbrevs' from the 
196 
outer syntax of the current theory buffer. This provides clickable 

197 
syntax templates, including entries with empty abbrevs name (which are 

198 
inaccessible via keyboard completion). 

199 

63022  200 
* IDE support for the Isabelle/Pure bootstrap process, with the 
201 
following independent stages: 

202 

203 
src/Pure/ROOT0.ML 

204 
src/Pure/ROOT.ML 

205 
src/Pure/Pure.thy 

206 
src/Pure/ML_Bootstrap.thy 

207 

208 
The ML ROOT files act like quasitheories in the context of theory 

209 
ML_Bootstrap: this allows continuous checking of all loaded ML files. 

210 
The theory files are presented with a modified header to import Pure 

211 
from the running Isabelle instance. Results from changed versions of 

212 
each stage are *not* propagated to the next stage, and isolated from the 

213 
actual Isabelle/Pure that runs the IDE itself. The sequential 

63308  214 
dependencies of the above files are only observed for batch build. 
62904  215 

63977  216 
* Isabelle/ML and Standard ML files are presented in Sidekick with the 
217 
tree structure of section headings: this special comment format is 

218 
described in "implementation" chapter 0, e.g. (*** section ***). 

63461  219 

63581  220 
* Additional abbreviations for syntactic completion may be specified 
63871  221 
within the theory header as 'abbrevs'. The theory syntax for 'keywords' 
222 
has been simplified accordingly: optional abbrevs need to go into the 

223 
new 'abbrevs' section. 

224 

225 
* Global abbreviations via $ISABELLE_HOME/etc/abbrevs and 

226 
$ISABELLE_HOME_USER/etc/abbrevs are no longer supported. Minor 

227 
INCOMPATIBILITY, use 'abbrevs' within theory header instead. 

63579  228 

64390  229 
* Action "isabelle.keymapmerge" asks the user to resolve pending 
230 
Isabelle keymap changes that are in conflict with the current jEdit 

231 
keymap; nonconflicting changes are always applied implicitly. This 

232 
action is automatically invoked on Isabelle/jEdit startup and thus 

233 
increases chances that users see new keyboard shortcuts when reusing 

234 
old keymaps. 

235 

63675  236 
* ML and document antiquotations for filesystems paths are more uniform 
237 
and diverse: 

238 

239 
@{path NAME}  no filesystem check 

240 
@{file NAME}  check for plain file 

241 
@{dir NAME}  check for directory 

242 

243 
Minor INCOMPATIBILITY, former uses of @{file} and @{file_unchecked} may 

244 
have to be changed. 

63669  245 

246 

63977  247 
*** Document preparation *** 
248 

249 
* New symbol \<circle>, e.g. for temporal operator. 

250 

64073  251 
* New document and ML antiquotation @{locale} for locales, similar to 
252 
existing antiquotation @{class}. 

253 

63977  254 
* Mixfix annotations support delimiters like \<^control>\<open>cartouche\<close>  
255 
this allows special forms of document output. 

256 

257 
* Raw LaTeX output now works via \<^latex>\<open>...\<close> instead of raw control 

258 
symbol \<^raw:...>. INCOMPATIBILITY, notably for LaTeXsugar.thy and its 

259 
derivatives. 

260 

261 
* \<^raw:...> symbols are no longer supported. 

262 

263 
* Old 'header' command is no longer supported (legacy since 

264 
Isabelle2015). 

265 

266 

62312
5e5a881ebc12
command '\<proof>' is an alias for 'sorry', with different typesetting;
wenzelm
parents:
62284
diff
changeset

267 
*** Isar *** 
5e5a881ebc12
command '\<proof>' is an alias for 'sorry', with different typesetting;
wenzelm
parents:
62284
diff
changeset

268 

63180  269 
* Many specification elements support structured statements with 'if' / 
270 
'for' eigencontext, e.g. 'axiomatization', 'abbreviation', 

271 
'definition', 'inductive', 'function'. 

272 

63094
056ea294c256
toplevel theorem statements support 'if'/'for' eigencontext;
wenzelm
parents:
63078
diff
changeset

273 
* Toplevel theorem statements support eigencontext notation with 'if' / 
63285  274 
'for' (in postfix), which corresponds to 'assumes' / 'fixes' in the 
63094
056ea294c256
toplevel theorem statements support 'if'/'for' eigencontext;
wenzelm
parents:
63078
diff
changeset

275 
traditional long statement form (in prefix). Local premises are called 
056ea294c256
toplevel theorem statements support 'if'/'for' eigencontext;
wenzelm
parents:
63078
diff
changeset

276 
"that" or "assms", respectively. Empty premises are *not* bound in the 
056ea294c256
toplevel theorem statements support 'if'/'for' eigencontext;
wenzelm
parents:
63078
diff
changeset

277 
context: INCOMPATIBILITY. 
056ea294c256
toplevel theorem statements support 'if'/'for' eigencontext;
wenzelm
parents:
63078
diff
changeset

278 

63043  279 
* Command 'define' introduces a local (nonpolymorphic) definition, with 
280 
optional abstraction over local parameters. The syntax resembles 

63047  281 
'definition' and 'obtain'. It fits better into the Isar language than 
282 
old 'def', which is now a legacy feature. 

63043  283 

63059
3f577308551e
'obtain' supports structured statements (similar to 'define');
wenzelm
parents:
63047
diff
changeset

284 
* Command 'obtain' supports structured statements with 'if' / 'for' 
3f577308551e
'obtain' supports structured statements (similar to 'define');
wenzelm
parents:
63047
diff
changeset

285 
context. 
3f577308551e
'obtain' supports structured statements (similar to 'define');
wenzelm
parents:
63047
diff
changeset

286 

62312
5e5a881ebc12
command '\<proof>' is an alias for 'sorry', with different typesetting;
wenzelm
parents:
62284
diff
changeset

287 
* Command '\<proof>' is an alias for 'sorry', with different 
5e5a881ebc12
command '\<proof>' is an alias for 'sorry', with different typesetting;
wenzelm
parents:
62284
diff
changeset

288 
typesetting. E.g. to produce proof holes in examples and documentation. 
62216  289 

63977  290 
* The defining position of a literal fact \<open>prop\<close> is maintained more 
291 
carefully, and made accessible as hyperlink in the Prover IDE. 

292 

293 
* Commands 'finally' and 'ultimately' used to expose the result as 

294 
literal fact: this accidental behaviour has been discontinued. Rare 

295 
INCOMPATIBILITY, use more explicit means to refer to facts in Isar. 

296 

297 
* Command 'axiomatization' has become more restrictive to correspond 

298 
better to internal axioms as singleton facts with mandatory name. Minor 

299 
INCOMPATIBILITY. 

62939  300 

63259  301 
* Proof methods may refer to the main facts via the dynamic fact 
302 
"method_facts". This is particularly useful for Eisbach method 

303 
definitions. 

304 

63528  305 
* Proof method "use" allows to modify the main facts of a given method 
306 
expression, e.g. 

63259  307 

308 
(use facts in simp) 

309 
(use facts in \<open>simp add: ...\<close>) 

310 

63977  311 
* The old proof method "default" has been removed (legacy since 
312 
Isabelle2016). INCOMPATIBILITY, use "standard" instead. 

313 

62216  314 

63165
c12845e8e80a
examples and documentation for code generator time measurements
haftmann
parents:
63161
diff
changeset

315 
*** Pure *** 
c12845e8e80a
examples and documentation for code generator time measurements
haftmann
parents:
63161
diff
changeset

316 

63977  317 
* Pure provides basic versions of proof methods "simp" and "simp_all" 
318 
that only know about metaequality (==). Potential INCOMPATIBILITY in 

319 
theory imports that merge Pure with e.g. Main of Isabelle/HOL: the order 

320 
is relevant to avoid confusion of Pure.simp vs. HOL.simp. 

321 

322 
* The command 'unfolding' and proof method "unfold" include a second 

323 
stage where given equations are passed through the attribute "abs_def" 

324 
before rewriting. This ensures that definitions are fully expanded, 

325 
regardless of the actual parameters that are provided. Rare 

326 
INCOMPATIBILITY in some corner cases: use proof method (simp only:) 

327 
instead, or declare [[unfold_abs_def = false]] in the proof context. 

328 

329 
* Typeinference improves sorts of newly introduced type variables for 

330 
the objectlogic, using its base sort (i.e. HOL.type for Isabelle/HOL). 

331 
Thus terms like "f x" or "\<And>x. P x" without any further syntactic context 

332 
produce x::'a::type in HOL instead of x::'a::{} in Pure. Rare 

333 
INCOMPATIBILITY, need to provide explicit type constraints for Pure 

334 
types where this is really intended. 

63350
705229ed856e
compiling implicit instances into companion objects for classes avoids ambiguities
haftmann
parents:
63343
diff
changeset

335 

63165
c12845e8e80a
examples and documentation for code generator time measurements
haftmann
parents:
63161
diff
changeset

336 

62327  337 
*** HOL *** 
338 

63977  339 
* New proof method "argo" using the builtin Argo solver based on SMT 
340 
technology. The method can be used to prove goals of quantifierfree 

341 
propositional logic, goals based on a combination of quantifierfree 

342 
propositional logic with equality, and goals based on a combination of 

343 
quantifierfree propositional logic with linear real arithmetic 

344 
including min/max/abs. See HOL/ex/Argo_Examples.thy for examples. 

345 

64390  346 
* The new "nunchaku" program integrates the Nunchaku model finder. The 
347 
tool is experimental. See ~~/src/HOL/Nunchaku/Nunchaku.thy for details. 

348 

63977  349 
* Metis: The problem encoding has changed very slightly. This might 
63785  350 
break existing proofs. INCOMPATIBILITY. 
351 

63116  352 
* Sledgehammer: 
63967
2aa42596edc3
new material on paths, etc. Also rationalisation
paulson <lp15@cam.ac.uk>
parents:
63963
diff
changeset

353 
 The MaSh relevance filter is now faster than before. 
63116  354 
 Produce syntactically correct Vampire 4.0 problem files. 
355 

62327  356 
* (Co)datatype package: 
62693  357 
 New commands for defining corecursive functions and reasoning about 
358 
them in "~~/src/HOL/Library/BNF_Corec.thy": 'corec', 'corecursive', 

359 
'friend_of_corec', and 'corecursion_upto'; and 'corec_unique' proof 

62842  360 
method. See 'isabelle doc corec'. 
63977  361 
 The predicator :: ('a \<Rightarrow> bool) \<Rightarrow> 'a F \<Rightarrow> bool is now a firstclass 
63855  362 
citizen in bounded natural functors. 
62693  363 
 'primrec' now allows nested calls through the predicator in addition 
62327  364 
to the map function. 
63855  365 
 'bnf' automatically discharges reflexive proof obligations. 
62693  366 
 'bnf' outputs a slightly modified proof obligation expressing rel in 
62332  367 
terms of map and set 
63855  368 
(not giving a specification for rel makes this one reflexive). 
62693  369 
 'bnf' outputs a new proof obligation expressing pred in terms of set 
63855  370 
(not giving a specification for pred makes this one reflexive). 
371 
INCOMPATIBILITY: manual 'bnf' declarations may need adjustment. 

62335  372 
 Renamed lemmas: 
373 
rel_prod_apply ~> rel_prod_inject 

374 
pred_prod_apply ~> pred_prod_inject 

375 
INCOMPATIBILITY. 

62536
656e9653c645
made 'size' plugin compatible with locales again (and added regression test)
blanchet
parents:
62525
diff
changeset

376 
 The "size" plugin has been made compatible again with locales. 
63855  377 
 The theorems about "rel" and "set" may have a slightly different (but 
378 
equivalent) form. 

379 
INCOMPATIBILITY. 

62327  380 

63977  381 
* The 'coinductive' command produces a proper coinduction rule for 
382 
mutual coinductive predicates. This new rule replaces the old rule, 

383 
which exposed details of the internal fixpoint construction and was 

384 
hard to use. INCOMPATIBILITY. 

385 

386 
* New abbreviations for negated existence (but not bounded existence): 

387 

388 
\<nexists>x. P x \<equiv> \<not> (\<exists>x. P x) 

389 
\<nexists>!x. P x \<equiv> \<not> (\<exists>!x. P x) 

390 

391 
* The print mode "HOL" for ASCII syntax of binders "!", "?", "?!", "@" 

392 
has been removed for output. It is retained for input only, until it is 

393 
eliminated altogether. 

394 

395 
* The unique existence quantifier no longer provides 'binder' syntax, 

396 
but uses syntax translations (as for bounded unique existence). Thus 

397 
iterated quantification \<exists>!x y. P x y with its slightly confusing 

398 
sequential meaning \<exists>!x. \<exists>!y. P x y is no longer possible. Instead, 

399 
pattern abstraction admits simultaneous unique existence \<exists>!(x, y). P x y 

400 
(analogous to existing notation \<exists>!(x, y)\<in>A. P x y). Potential 

401 
INCOMPATIBILITY in rare situations. 

402 

403 
* Conventional syntax "%(). t" for unit abstractions. Slight syntactic 

404 
INCOMPATIBILITY. 

405 

64390  406 
* Renamed constants and corresponding theorems: 
407 

408 
setsum ~> sum 

409 
setprod ~> prod 

410 
listsum ~> sum_list 

411 
listprod ~> prod_list 

412 

413 
INCOMPATIBILITY. 

414 

415 
* Sligthly more standardized theorem names: 

416 
sgn_times ~> sgn_mult 

417 
sgn_mult' ~> Real_Vector_Spaces.sgn_mult 

418 
divide_zero_left ~> div_0 

419 
zero_mod_left ~> mod_0 

420 
divide_zero ~> div_by_0 

421 
divide_1 ~> div_by_1 

422 
nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left 

423 
div_mult_self1_is_id ~> nonzero_mult_div_cancel_left 

424 
nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right 

425 
div_mult_self2_is_id ~> nonzero_mult_div_cancel_right 

426 
is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left 

427 
is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right 

428 
mod_div_equality ~> div_mult_mod_eq 

429 
mod_div_equality2 ~> mult_div_mod_eq 

430 
mod_div_equality3 ~> mod_div_mult_eq 

431 
mod_div_equality4 ~> mod_mult_div_eq 

432 
minus_div_eq_mod ~> minus_div_mult_eq_mod 

433 
minus_div_eq_mod2 ~> minus_mult_div_eq_mod 

434 
minus_mod_eq_div ~> minus_mod_eq_div_mult 

435 
minus_mod_eq_div2 ~> minus_mod_eq_mult_div 

436 
div_mod_equality' ~> minus_mod_eq_div_mult [symmetric] 

437 
mod_div_equality' ~> minus_div_mult_eq_mod [symmetric] 

438 
zmod_zdiv_equality ~> mult_div_mod_eq [symmetric] 

439 
zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric] 

440 
Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

441 
mult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

442 
zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

443 
div_1 ~> div_by_Suc_0 

444 
mod_1 ~> mod_by_Suc_0 

445 
INCOMPATIBILITY. 

446 

447 
* New type class "idom_abs_sgn" specifies algebraic properties 

448 
of sign and absolute value functions. Type class "sgn_if" has 

449 
disappeared. Slight INCOMPATIBILITY. 

450 

451 
* Dedicated syntax LENGTH('a) for length of types. 

452 

63977  453 
* Characters (type char) are modelled as finite algebraic type 
454 
corresponding to {0..255}. 

455 

456 
 Logical representation: 

457 
* 0 is instantiated to the ASCII zero character. 

458 
* All other characters are represented as "Char n" 

459 
with n being a raw numeral expression less than 256. 

460 
* Expressions of the form "Char n" with n greater than 255 

461 
are noncanonical. 

462 
 Printing and parsing: 

463 
* Printable characters are printed and parsed as "CHR ''\<dots>''" 

464 
(as before). 

465 
* The ASCII zero character is printed and parsed as "0". 

466 
* All other canonical characters are printed as "CHR 0xXX" 

467 
with XX being the hexadecimal character code. "CHR n" 

468 
is parsable for every numeral expression n. 

469 
* Noncanonical characters have no special syntax and are 

470 
printed as their logical representation. 

471 
 Explicit conversions from and to the natural numbers are 

472 
provided as char_of_nat, nat_of_char (as before). 

473 
 The auxiliary nibble type has been discontinued. 

474 

475 
INCOMPATIBILITY. 

476 

477 
* Type class "div" with operation "mod" renamed to type class "modulo" 

478 
with operation "modulo", analogously to type class "divide". This 

479 
eliminates the need to qualify any of those names in the presence of 

480 
infix "mod" syntax. INCOMPATIBILITY. 

481 

63979  482 
* Statements and proofs of KnasterTarski fixpoint combinators lfp/gfp 
483 
have been clarified. The fixpoint properties are lfp_fixpoint, its 

484 
symmetric lfp_unfold (as before), and the duals for gfp. Auxiliary items 

485 
for the proof (lfp_lemma2 etc.) are no longer exported, but can be 

486 
easily recovered by composition with eq_refl. Minor INCOMPATIBILITY. 

487 

63977  488 
* Constant "surj" is a mere input abbreviation, to avoid hiding an 
489 
equation in term output. Minor INCOMPATIBILITY. 

490 

491 
* Command 'code_reflect' accepts empty constructor lists for datatypes, 

492 
which renders those abstract effectively. 

493 

494 
* Command 'export_code' checks given constants for abstraction 

495 
violations: a small guarantee that given constants specify a safe 

496 
interface for the generated code. 

497 

498 
* Code generation for Scala: ambiguous implicts in class diagrams are 

499 
spelt out explicitly. 

500 

501 
* Static evaluators (Code_Evaluation.static_* in Isabelle/ML) rely on 

502 
explicitly provided auxiliary definitions for required type class 

64390  503 
dictionaries rather than halfworking magic. INCOMPATIBILITY, see the 
504 
tutorial on code generation for details. 

505 

506 
* Theory Set_Interval: substantial new theorems on indexed sums and 

507 
products. 

63977  508 

509 
* Locale bijection establishes convenient default simp rules such as 

510 
"inv f (f a) = a" for total bijections. 

511 

512 
* Abstract locales semigroup, abel_semigroup, semilattice, 

513 
semilattice_neutr, ordering, ordering_top, semilattice_order, 

514 
semilattice_neutr_order, comm_monoid_set, semilattice_set, 

515 
semilattice_neutr_set, semilattice_order_set, 

516 
semilattice_order_neutr_set monoid_list, comm_monoid_list, 

517 
comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified 

518 
syntax uniformly that does not clash with corresponding global syntax. 

519 
INCOMPATIBILITY. 

520 

521 
* Former locale lifting_syntax is now a bundle, which is easier to 

522 
include in a local context or theorem statement, e.g. "context includes 

523 
lifting_syntax begin ... end". Minor INCOMPATIBILITY. 

524 

63807  525 
* Some old / obsolete theorems have been renamed / removed, potential 
526 
INCOMPATIBILITY. 

527 

528 
nat_less_cases  removed, use linorder_cases instead 

529 
inv_image_comp  removed, use image_inv_f_f instead 

530 
image_surj_f_inv_f ~> image_f_inv_f 

63113  531 

63456
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

532 
* Some theorems about groups and orders have been generalised from 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

533 
groups to semigroups that are also monoids: 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

534 
le_add_same_cancel1 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

535 
le_add_same_cancel2 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

536 
less_add_same_cancel1 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

537 
less_add_same_cancel2 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

538 
add_le_same_cancel1 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

539 
add_le_same_cancel2 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

540 
add_less_same_cancel1 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

541 
add_less_same_cancel2 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

542 

3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

543 
* Some simplifications theorems about rings have been removed, since 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

544 
superseeded by a more general version: 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

545 
less_add_cancel_left_greater_zero ~> less_add_same_cancel1 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

546 
less_add_cancel_right_greater_zero ~> less_add_same_cancel2 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

547 
less_eq_add_cancel_left_greater_eq_zero ~> le_add_same_cancel1 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

548 
less_eq_add_cancel_right_greater_eq_zero ~> le_add_same_cancel2 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

549 
less_eq_add_cancel_left_less_eq_zero ~> add_le_same_cancel1 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

550 
less_eq_add_cancel_right_less_eq_zero ~> add_le_same_cancel2 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

551 
less_add_cancel_left_less_zero ~> add_less_same_cancel1 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

552 
less_add_cancel_right_less_zero ~> add_less_same_cancel2 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

553 
INCOMPATIBILITY. 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

554 

62407  555 
* Renamed split_if > if_split and split_if_asm > if_split_asm to 
556 
resemble the f.split naming convention, INCOMPATIBILITY. 

62396  557 

63977  558 
* Added class topological_monoid. 
559 

64391  560 
* The following theorems have been renamed: 
561 

64457  562 
setsum_left_distrib ~> sum_distrib_right 
563 
setsum_right_distrib ~> sum_distrib_left 

64391  564 

565 
INCOMPATIBILITY. 

566 

567 
* Compound constants INFIMUM and SUPREMUM are mere abbreviations now. 

568 
INCOMPATIBILITY. 

569 

570 
* "Gcd (f ` A)" and "Lcm (f ` A)" are printed with optional 

571 
comprehensionlike syntax analogously to "Inf (f ` A)" and "Sup (f ` 

572 
A)". 

573 

574 
* Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY. 

575 

576 
* The type class ordered_comm_monoid_add is now called 

577 
ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add 

578 
is introduced as the combination of ordered_ab_semigroup_add + 

579 
comm_monoid_add. INCOMPATIBILITY. 

580 

581 
* Introduced the type classes canonically_ordered_comm_monoid_add and 

582 
dioid. 

583 

584 
* Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When 

585 
instantiating linordered_semiring_strict and ordered_ab_group_add, an 

586 
explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might 

587 
be required. INCOMPATIBILITY. 

63117  588 

62348  589 
* Dropped various legacy fact bindings, whose replacements are often 
590 
of a more general type also: 

591 
lcm_left_commute_nat ~> lcm.left_commute 

592 
lcm_left_commute_int ~> lcm.left_commute 

593 
gcd_left_commute_nat ~> gcd.left_commute 

594 
gcd_left_commute_int ~> gcd.left_commute 

595 
gcd_greatest_iff_nat ~> gcd_greatest_iff 

596 
gcd_greatest_iff_int ~> gcd_greatest_iff 

597 
coprime_dvd_mult_nat ~> coprime_dvd_mult 

598 
coprime_dvd_mult_int ~> coprime_dvd_mult 

599 
zpower_numeral_even ~> power_numeral_even 

600 
gcd_mult_cancel_nat ~> gcd_mult_cancel 

601 
gcd_mult_cancel_int ~> gcd_mult_cancel 

602 
div_gcd_coprime_nat ~> div_gcd_coprime 

603 
div_gcd_coprime_int ~> div_gcd_coprime 

604 
zpower_numeral_odd ~> power_numeral_odd 

605 
zero_less_int_conv ~> of_nat_0_less_iff 

606 
gcd_greatest_nat ~> gcd_greatest 

607 
gcd_greatest_int ~> gcd_greatest 

608 
coprime_mult_nat ~> coprime_mult 

609 
coprime_mult_int ~> coprime_mult 

610 
lcm_commute_nat ~> lcm.commute 

611 
lcm_commute_int ~> lcm.commute 

612 
int_less_0_conv ~> of_nat_less_0_iff 

613 
gcd_commute_nat ~> gcd.commute 

614 
gcd_commute_int ~> gcd.commute 

615 
Gcd_insert_nat ~> Gcd_insert 

616 
Gcd_insert_int ~> Gcd_insert 

617 
of_int_int_eq ~> of_int_of_nat_eq 

618 
lcm_least_nat ~> lcm_least 

619 
lcm_least_int ~> lcm_least 

620 
lcm_assoc_nat ~> lcm.assoc 

621 
lcm_assoc_int ~> lcm.assoc 

622 
int_le_0_conv ~> of_nat_le_0_iff 

623 
int_eq_0_conv ~> of_nat_eq_0_iff 

624 
Gcd_empty_nat ~> Gcd_empty 

625 
Gcd_empty_int ~> Gcd_empty 

626 
gcd_assoc_nat ~> gcd.assoc 

627 
gcd_assoc_int ~> gcd.assoc 

628 
zero_zle_int ~> of_nat_0_le_iff 

629 
lcm_dvd2_nat ~> dvd_lcm2 

630 
lcm_dvd2_int ~> dvd_lcm2 

631 
lcm_dvd1_nat ~> dvd_lcm1 

632 
lcm_dvd1_int ~> dvd_lcm1 

633 
gcd_zero_nat ~> gcd_eq_0_iff 

634 
gcd_zero_int ~> gcd_eq_0_iff 

635 
gcd_dvd2_nat ~> gcd_dvd2 

636 
gcd_dvd2_int ~> gcd_dvd2 

637 
gcd_dvd1_nat ~> gcd_dvd1 

638 
gcd_dvd1_int ~> gcd_dvd1 

639 
int_numeral ~> of_nat_numeral 

640 
lcm_ac_nat ~> ac_simps 

641 
lcm_ac_int ~> ac_simps 

642 
gcd_ac_nat ~> ac_simps 

643 
gcd_ac_int ~> ac_simps 

644 
abs_int_eq ~> abs_of_nat 

645 
zless_int ~> of_nat_less_iff 

646 
zdiff_int ~> of_nat_diff 

647 
zadd_int ~> of_nat_add 

648 
int_mult ~> of_nat_mult 

649 
int_Suc ~> of_nat_Suc 

650 
inj_int ~> inj_of_nat 

651 
int_1 ~> of_nat_1 

652 
int_0 ~> of_nat_0 

62353
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

653 
Lcm_empty_nat ~> Lcm_empty 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

654 
Lcm_empty_int ~> Lcm_empty 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

655 
Lcm_insert_nat ~> Lcm_insert 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

656 
Lcm_insert_int ~> Lcm_insert 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

657 
comp_fun_idem_gcd_nat ~> comp_fun_idem_gcd 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

658 
comp_fun_idem_gcd_int ~> comp_fun_idem_gcd 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

659 
comp_fun_idem_lcm_nat ~> comp_fun_idem_lcm 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

660 
comp_fun_idem_lcm_int ~> comp_fun_idem_lcm 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

661 
Lcm_eq_0 ~> Lcm_eq_0_I 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

662 
Lcm0_iff ~> Lcm_0_iff 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

663 
Lcm_dvd_int ~> Lcm_least 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

664 
divides_mult_nat ~> divides_mult 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

665 
divides_mult_int ~> divides_mult 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

666 
lcm_0_nat ~> lcm_0_right 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

667 
lcm_0_int ~> lcm_0_right 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

668 
lcm_0_left_nat ~> lcm_0_left 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

669 
lcm_0_left_int ~> lcm_0_left 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

670 
dvd_gcd_D1_nat ~> dvd_gcdD1 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

671 
dvd_gcd_D1_int ~> dvd_gcdD1 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

672 
dvd_gcd_D2_nat ~> dvd_gcdD2 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

673 
dvd_gcd_D2_int ~> dvd_gcdD2 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

674 
coprime_dvd_mult_iff_nat ~> coprime_dvd_mult_iff 
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

675 
coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff 
62348  676 
realpow_minus_mult ~> power_minus_mult 
677 
realpow_Suc_le_self ~> power_Suc_le_self 

62353
7f927120b5a2
dropped various legacy fact bindings and tuned proofs
haftmann
parents:
62352
diff
changeset

678 
dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest 
62347  679 
INCOMPATIBILITY. 
680 

63967
2aa42596edc3
new material on paths, etc. Also rationalisation
paulson <lp15@cam.ac.uk>
parents:
63963
diff
changeset

681 
* Renamed HOL/Quotient_Examples/FSet.thy to 
63977  682 
HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY. 
683 

64390  684 
* Session HOLLibrary: theory FinFun bundles "finfun_syntax" and 
685 
"no_finfun_syntax" allow to control optional syntax in local contexts; 

686 
this supersedes former theory FinFun_Syntax. INCOMPATIBILITY, e.g. use 

687 
"unbundle finfun_syntax" to imitate import of 

688 
"~~/src/HOL/Library/FinFun_Syntax". 

689 

690 
* Session HOLLibrary: theory Multiset_Permutations (executably) defines 

691 
the set of permutations of a given set or multiset, i.e. the set of all 

692 
lists that contain every element of the carrier (multi)set exactly 

693 
once. 

694 

695 
* Session HOLLibrary: multiset membership is now expressed using 

696 
set_mset rather than count. 

697 

698 
 Expressions "count M a > 0" and similar simplify to membership 

699 
by default. 

700 

701 
 Converting between "count M a = 0" and nonmembership happens using 

702 
equations count_eq_zero_iff and not_in_iff. 

703 

704 
 Rules count_inI and in_countE obtain facts of the form 

705 
"count M a = n" from membership. 

706 

707 
 Rules count_in_diffI and in_diff_countE obtain facts of the form 

708 
"count M a = n + count N a" from membership on difference sets. 

709 

710 
INCOMPATIBILITY. 

711 

712 
* Session HOLLibrary: theory LaTeXsugar uses newstyle "dummy_pats" for 

713 
displaying equations in functional programming style  variables 

714 
present on the lefthand but not on the righhand side are replaced by 

715 
underscores. 

716 

717 
* Session HOLLibrary: theory Combinator_PER provides combinator to 

718 
build partial equivalence relations from a predicate and an equivalence 

719 
relation. 

720 

721 
* Session HOLLibrary: theory Perm provides basic facts about almost 

722 
everywhere fix bijections. 

723 

724 
* Session HOLLibrary: theory Normalized_Fraction allows viewing an 

725 
element of a field of fractions as a normalized fraction (i.e. a pair of 

726 
numerator and denominator such that the two are coprime and the 

727 
denominator is normalized wrt. unit factors). 

728 

729 
* Session HOLNSA has been renamed to HOLNonstandard_Analysis. 

730 

731 
* Session HOLMultivariate_Analysis has been renamed to HOLAnalysis. 

732 

733 
* Session HOLAnalysis: measure theory has been moved here from 

734 
HOLProbability. When importing HOLAnalysis some theorems need 

735 
additional name spaces prefixes due to name clashes. INCOMPATIBILITY. 

736 

737 
* Session HOLAnalysis: more complex analysis including Cauchy's 

738 
inequality, Liouville theorem, open mapping theorem, maximum modulus 

739 
principle, Residue theorem, Schwarz Lemma. 

740 

741 
* Session HOLAnalysis: Theory of polyhedra: faces, extreme points, 

742 
polytopes, and the Kreinâ€“Milman Minkowski theorem. 

743 

744 
* Session HOLAnalysis: Numerous results ported from the HOL Light 

745 
libraries: homeomorphisms, continuous function extensions, invariance of 

746 
domain. 

747 

748 
* Session HOLProbability: the type of emeasure and nn_integral was 

749 
changed from ereal to ennreal, INCOMPATIBILITY. 

750 

751 
emeasure :: 'a measure \<Rightarrow> 'a set \<Rightarrow> ennreal 

752 
nn_integral :: 'a measure \<Rightarrow> ('a \<Rightarrow> ennreal) \<Rightarrow> ennreal 

753 

754 
* Session HOLProbability: Code generation and QuickCheck for 

755 
Probability Mass Functions. 

756 

757 
* Session HOLProbability: theory Random_Permutations contains some 

758 
theory about choosing a permutation of a set uniformly at random and 

759 
folding over a list in random order. 

760 

761 
* Session HOLProbability: theory SPMF formalises discrete 

762 
subprobability distributions. 

763 

764 
* Session HOLLibrary: the names of multiset theorems have been 

765 
normalised to distinguish which ordering the theorems are about 

766 

767 
mset_less_eqI ~> mset_subset_eqI 

768 
mset_less_insertD ~> mset_subset_insertD 

769 
mset_less_eq_count ~> mset_subset_eq_count 

770 
mset_less_diff_self ~> mset_subset_diff_self 

771 
mset_le_exists_conv ~> mset_subset_eq_exists_conv 

772 
mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel 

773 
mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel 

774 
mset_le_mono_add ~> mset_subset_eq_mono_add 

775 
mset_le_add_left ~> mset_subset_eq_add_left 

776 
mset_le_add_right ~> mset_subset_eq_add_right 

777 
mset_le_single ~> mset_subset_eq_single 

778 
mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute 

779 
diff_le_self ~> diff_subset_eq_self 

780 
mset_leD ~> mset_subset_eqD 

781 
mset_lessD ~> mset_subsetD 

782 
mset_le_insertD ~> mset_subset_eq_insertD 

783 
mset_less_of_empty ~> mset_subset_of_empty 

784 
mset_less_size ~> mset_subset_size 

785 
wf_less_mset_rel ~> wf_subset_mset_rel 

786 
count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq 

787 
mset_remdups_le ~> mset_remdups_subset_eq 

788 
ms_lesseq_impl ~> subset_eq_mset_impl 

789 

790 
Some functions have been renamed: 

791 
ms_lesseq_impl > subset_eq_mset_impl 

792 

793 
* HOLLibrary: multisets are now ordered with the multiset ordering 

794 
#\<subseteq># ~> \<le> 

795 
#\<subset># ~> < 

796 
le_multiset ~> less_eq_multiset 

797 
less_multiset ~> le_multiset 

798 
INCOMPATIBILITY. 

799 

800 
* Session HOLLibrary: the prefix multiset_order has been discontinued: 

801 
the theorems can be directly accessed. As a consequence, the lemmas 

802 
"order_multiset" and "linorder_multiset" have been discontinued, and the 

803 
interpretations "multiset_linorder" and "multiset_wellorder" have been 

804 
replaced by instantiations. INCOMPATIBILITY. 

805 

806 
* Session HOLLibrary: some theorems about the multiset ordering have 

807 
been renamed: 

808 

809 
le_multiset_def ~> less_eq_multiset_def 

810 
less_multiset_def ~> le_multiset_def 

811 
less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset 

812 
mult_less_not_refl ~> mset_le_not_refl 

813 
mult_less_trans ~> mset_le_trans 

814 
mult_less_not_sym ~> mset_le_not_sym 

815 
mult_less_asym ~> mset_le_asym 

816 
mult_less_irrefl ~> mset_le_irrefl 

817 
union_less_mono2{,1,2} ~> union_le_mono2{,1,2} 

818 

819 
le_multiset\<^sub>H\<^sub>O ~> less_eq_multiset\<^sub>H\<^sub>O 

820 
le_multiset_total ~> less_eq_multiset_total 

821 
less_multiset_right_total ~> subset_eq_imp_le_multiset 

822 
le_multiset_empty_left ~> less_eq_multiset_empty_left 

823 
le_multiset_empty_right ~> less_eq_multiset_empty_right 

824 
less_multiset_empty_right ~> le_multiset_empty_left 

825 
less_multiset_empty_left ~> le_multiset_empty_right 

826 
union_less_diff_plus ~> union_le_diff_plus 

827 
ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset 

828 
less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty 

829 
le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty 

830 
INCOMPATIBILITY. 

831 

832 
* Session HOLLibrary: the lemma mset_map has now the attribute [simp]. 

833 
INCOMPATIBILITY. 

834 

835 
* Session HOLLibrary: some theorems about multisets have been removed. 

836 
INCOMPATIBILITY, use the following replacements: 

837 

838 
le_multiset_plus_plus_left_iff ~> add_less_cancel_right 

839 
less_multiset_plus_plus_left_iff ~> add_less_cancel_right 

840 
le_multiset_plus_plus_right_iff ~> add_less_cancel_left 

841 
less_multiset_plus_plus_right_iff ~> add_less_cancel_left 

842 
add_eq_self_empty_iff ~> add_cancel_left_right 

843 
mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right 

844 
mset_less_add_bothsides ~> subset_mset.add_less_cancel_right 

845 
mset_le_add_bothsides ~> subset_mset.add_less_cancel_right 

846 
empty_inter ~> subset_mset.inf_bot_left 

847 
inter_empty ~> subset_mset.inf_bot_right 

848 
empty_sup ~> subset_mset.sup_bot_left 

849 
sup_empty ~> subset_mset.sup_bot_right 

850 
bdd_below_multiset ~> subset_mset.bdd_above_bot 

851 
subset_eq_empty ~> subset_mset.le_zero_eq 

852 
le_empty ~> subset_mset.le_zero_eq 

853 
mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero 

854 
mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero 

855 

856 
* Session HOLLibrary: some typeclass constraints about multisets have 

857 
been reduced from ordered or linordered to preorder. Multisets have the 

858 
additional typeclasses order_bot, no_top, 

859 
ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add, 

860 
linordered_cancel_ab_semigroup_add, and 

861 
ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY. 

862 

863 
* Session HOLLibrary: there are some new simplification rules about 

864 
multisets, the multiset ordering, and the subset ordering on multisets. 

865 
INCOMPATIBILITY. 

866 

867 
* Session HOLLibrary: the subset ordering on multisets has now the 

868 
interpretations ordered_ab_semigroup_monoid_add_imp_le and 

869 
bounded_lattice_bot. INCOMPATIBILITY. 

870 

871 
* Session HOLLibrary, theory Multiset: single has been removed in favor 

872 
of add_mset that roughly corresponds to Set.insert. Some theorems have 

873 
removed or changed: 

874 

875 
single_not_empty ~> add_mset_not_empty or empty_not_add_mset 

876 
fold_mset_insert ~> fold_mset_add_mset 

877 
image_mset_insert ~> image_mset_add_mset 

878 
union_single_eq_diff 

879 
multi_self_add_other_not_self 

880 
diff_single_eq_union 

881 
INCOMPATIBILITY. 

882 

883 
* Session HOLLibrary, theory Multiset: some theorems have been changed 

884 
to use add_mset instead of single: 

885 

886 
mset_add 

887 
multi_self_add_other_not_self 

888 
diff_single_eq_union 

889 
union_single_eq_diff 

890 
union_single_eq_member 

891 
add_eq_conv_diff 

892 
insert_noteq_member 

893 
add_eq_conv_ex 

894 
multi_member_split 

895 
multiset_add_sub_el_shuffle 

896 
mset_subset_eq_insertD 

897 
mset_subset_insertD 

898 
insert_subset_eq_iff 

899 
insert_union_subset_iff 

900 
multi_psub_of_add_self 

901 
inter_add_left1 

902 
inter_add_left2 

903 
inter_add_right1 

904 
inter_add_right2 

905 
sup_union_left1 

906 
sup_union_left2 

907 
sup_union_right1 

908 
sup_union_right2 

909 
size_eq_Suc_imp_eq_union 

910 
multi_nonempty_split 

911 
mset_insort 

912 
mset_update 

913 
mult1I 

914 
less_add 

915 
mset_zip_take_Cons_drop_twice 

916 
rel_mset_Zero 

917 
msed_map_invL 

918 
msed_map_invR 

919 
msed_rel_invL 

920 
msed_rel_invR 

921 
le_multiset_right_total 

922 
multiset_induct 

923 
multiset_induct2_size 

924 
multiset_induct2 

925 
INCOMPATIBILITY. 

926 

927 
* Session HOLLibrary, theory Multiset: the definitions of some 

928 
constants have changed to use add_mset instead of adding a single 

929 
element: 

930 

931 
image_mset 

932 
mset 

933 
replicate_mset 

934 
mult1 

935 
pred_mset 

936 
rel_mset' 

937 
mset_insort 

938 

939 
INCOMPATIBILITY. 

940 

941 
* Session HOLLibrary, theory Multiset: due to the above changes, the 

942 
attributes of some multiset theorems have been changed: 

943 

944 
insert_DiffM [] ~> [simp] 

945 
insert_DiffM2 [simp] ~> [] 

946 
diff_add_mset_swap [simp] 

947 
fold_mset_add_mset [simp] 

948 
diff_diff_add [simp] (for multisets only) 

949 
diff_cancel [simp] ~> [] 

950 
count_single [simp] ~> [] 

951 
set_mset_single [simp] ~> [] 

952 
size_multiset_single [simp] ~> [] 

953 
size_single [simp] ~> [] 

954 
image_mset_single [simp] ~> [] 

955 
mset_subset_eq_mono_add_right_cancel [simp] ~> [] 

956 
mset_subset_eq_mono_add_left_cancel [simp] ~> [] 

957 
fold_mset_single [simp] ~> [] 

958 
subset_eq_empty [simp] ~> [] 

959 
empty_sup [simp] ~> [] 

960 
sup_empty [simp] ~> [] 

961 
inter_empty [simp] ~> [] 

962 
empty_inter [simp] ~> [] 

963 
INCOMPATIBILITY. 

964 

64391  965 
* Session HOLLibrary, theory Multiset: the order of the variables in 
64390  966 
the second cases of multiset_induct, multiset_induct2_size, 
967 
multiset_induct2 has been changed (e.g. Add A a ~> Add a A). 

968 
INCOMPATIBILITY. 

969 

970 
* Session HOLLibrary, theory Multiset: there is now a simplification 

971 
procedure on multisets. It mimics the behavior of the procedure on 

972 
natural numbers. INCOMPATIBILITY. 

973 

974 
* Session HOLLibrary, theory Multiset: renamed sums and products of 

975 
multisets: 

976 

977 
msetsum ~> sum_mset 

978 
msetprod ~> prod_mset 

979 

980 
* Session HOLLibrary, theory Multiset: the notation for intersection 

981 
and union of multisets have been changed: 

982 

983 
#\<inter> ~> \<inter># 

984 
#\<union> ~> \<union># 

985 

986 
INCOMPATIBILITY. 

987 

988 
* Session HOLLibrary, theory Multiset: the lemma 

989 
one_step_implies_mult_aux on multisets has been removed, use 

990 
one_step_implies_mult instead. INCOMPATIBILITY. 

991 

992 
* Session HOLLibrary: theory Complete_Partial_Order2 provides reasoning 

993 
support for monotonicity and continuity in chaincomplete partial orders 

994 
and about admissibility conditions for fixpoint inductions. 

995 

64523  996 
* Session HOLLibrary: theory Library/Polynomial contains also 
997 
derivation of polynomials (formerly in Library/Poly_Deriv) but not 

998 
gcd/lcm on polynomials over fields. This has been moved to a separate 

999 
theory Library/Polynomial_GCD_euclidean.thy, to pave way for a possible 

1000 
future different type class instantiation for polynomials over factorial 

1001 
rings. INCOMPATIBILITY. 

64390  1002 

1003 
* Session HOLLibrary: theory Sublist provides function "prefixes" with 

1004 
the following renaming 

1005 

1006 
prefixeq > prefix 

1007 
prefix > strict_prefix 

1008 
suffixeq > suffix 

1009 
suffix > strict_suffix 

1010 

1011 
Added theory of longest common prefixes. 

64389  1012 

64391  1013 
* Session HOLNumber_Theory: algebraic foundation for primes: 
1014 
Generalisation of predicate "prime" and introduction of predicates 

1015 
"prime_elem", "irreducible", a "prime_factorization" function, and the 

1016 
"factorial_ring" typeclass with instance proofs for nat, int, poly. Some 

1017 
theorems now have different names, most notably "prime_def" is now 

1018 
"prime_nat_iff". INCOMPATIBILITY. 

1019 

1020 
* Session Old_Number_Theory has been removed, after porting remaining 

1021 
theories. 

1022 

64551  1023 
* Session HOLTypes_To_Sets provides an experimental extension of 
1024 
HigherOrder Logic to allow translation of types to sets. 

1025 

63198
c583ca33076a
adhoc overloading for standard operations on type Rat.rat;
wenzelm
parents:
63184
diff
changeset

1026 

62498  1027 
*** ML *** 
1028 

63227
d3ed7f00e818
Integer.lcm normalizes the sign as in HOL/GCD.thy;
wenzelm
parents:
63226
diff
changeset

1029 
* Integer.gcd and Integer.lcm use efficient operations from the Poly/ML 
63228  1030 
library (notably for big integers). Subtle change of semantics: 
1031 
Integer.gcd and Integer.lcm both normalize the sign, results are never 

1032 
negative. This coincides with the definitions in HOL/GCD.thy. 

1033 
INCOMPATIBILITY. 

63227
d3ed7f00e818
Integer.lcm normalizes the sign as in HOL/GCD.thy;
wenzelm
parents:
63226
diff
changeset

1034 

63212  1035 
* Structure Rat for rational numbers is now an integral part of 
63215  1036 
Isabelle/ML, with special notation @int/nat or @int for numerals (an 
1037 
abbreviation for antiquotation @{Pure.rat argument}) and ML pretty 

63212  1038 
printing. Standard operations on type Rat.rat are provided via adhoc 
63215  1039 
overloading of +  * / < <= > >= ~ abs. INCOMPATIBILITY, need to 
63212  1040 
use + instead of +/ etc. Moreover, exception Rat.DIVZERO has been 
1041 
superseded by General.Div. 

63198
c583ca33076a
adhoc overloading for standard operations on type Rat.rat;
wenzelm
parents:
63184
diff
changeset

1042 

64390  1043 
* ML antiquotation @{path} is superseded by @{file}, which ensures that 
1044 
the argument is a plain file. Minor INCOMPATIBILITY. 

1045 

1046 
* Antiquotation @{make_string} is available during Pure bootstrap  

1047 
with approximative output quality. 

1048 

1049 
* Lowlevel ML system structures (like PolyML and RunCall) are no longer 

1050 
exposed to Isabelle/ML userspace. Potential INCOMPATIBILITY. 

1051 

62861  1052 
* The ML function "ML" provides easy access to runtime compilation. 
1053 
This is particularly useful for conditional compilation, without 

1054 
requiring separate files. 

1055 

62498  1056 
* Option ML_exception_debugger controls detailed exception trace via the 
1057 
Poly/ML debugger. Relevant ML modules need to be compiled beforehand 

1058 
with ML_file_debug, or with ML_file and option ML_debugger enabled. Note 

1059 
debugger information requires consirable time and space: main 

1060 
Isabelle/HOL with full debugger support may need ML_system_64. 

1061 

62514  1062 
* Local_Theory.restore has been renamed to Local_Theory.reset to 
1063 
emphasize its disruptive impact on the cumulative context, notably the 

1064 
scope of 'private' or 'qualified' names. Note that Local_Theory.reset is 

1065 
only appropriate when targets are managed, e.g. starting from a global 

1066 
theory and returning to it. Regular definitional packages should use 

1067 
balanced blocks of Local_Theory.open_target versus 

1068 
Local_Theory.close_target instead. Rare INCOMPATIBILITY. 

1069 

62519  1070 
* Structure TimeLimit (originally from the SML/NJ library) has been 
1071 
replaced by structure Timeout, with slightly different signature. 

1072 
INCOMPATIBILITY. 

1073 

62551  1074 
* Discontinued cd and pwd operations, which are not welldefined in a 
1075 
multithreaded environment. Note that files are usually located 

1076 
relatively to the master directory of a theory (see also 

1077 
File.full_path). Potential INCOMPATIBILITY. 

1078 

63352  1079 
* Binding.empty_atts supersedes Thm.empty_binding and 
1080 
Attrib.empty_binding. Minor INCOMPATIBILITY. 

1081 

62498  1082 

62354  1083 
*** System *** 
1084 

64390  1085 
* SML/NJ and old versions of Poly/ML are no longer supported. 
1086 

1087 
* Poly/ML heaps now follow the hierarchy of sessions, and thus require 

1088 
much less disk space. 

63226  1089 

62591  1090 
* The Isabelle ML process is now managed directly by Isabelle/Scala, and 
1091 
shell scripts merely provide optional commandline access. In 

1092 
particular: 

1093 

1094 
. Scala module ML_Process to connect to the raw ML process, 

1095 
with interaction via stdin/stdout/stderr or in batch mode; 

1096 
. commandline tool "isabelle console" as interactive wrapper; 

1097 
. commandline tool "isabelle process" as batch mode wrapper. 

62588
cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

1098 

cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

1099 
* The executable "isabelle_process" has been discontinued. Tools and 
cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

1100 
prover frontends should use ML_Process or Isabelle_Process in 
62591  1101 
Isabelle/Scala. INCOMPATIBILITY. 
62588
cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

1102 

cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

1103 
* New commandline tool "isabelle process" supports ML evaluation of 
cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

1104 
literal expressions (option e) or files (option f) in the context of a 
cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

1105 
given heap image. Errors lead to premature exit of the ML process with 
cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

1106 
return code 1. 
cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

1107 

64390  1108 
* The commandline tool "isabelle build" supports option N for cyclic 
1109 
shuffling of NUMA CPU nodes. This may help performance tuning on Linux 

1110 
servers with separate CPU/memory modules. 

1111 

1112 
* System option "threads" (for the size of the Isabelle/ML thread farm) 

1113 
is also passed to the underlying ML runtime system as gcthreads, 

64274  1114 
unless there is already a default provided via ML_OPTIONS settings. 
1115 

63827
b24d0e53dd03
option "checkpoint" helps to finetune global heap space management;
wenzelm
parents:
63821
diff
changeset

1116 
* System option "checkpoint" helps to finetune the global heap space 
b24d0e53dd03
option "checkpoint" helps to finetune global heap space management;
wenzelm
parents:
63821
diff
changeset

1117 
management of isabelle build. This is relevant for big sessions that may 
b24d0e53dd03
option "checkpoint" helps to finetune global heap space management;
wenzelm
parents:
63821
diff
changeset

1118 
exhaust the small 32bit address space of the ML process (which is used 
b24d0e53dd03
option "checkpoint" helps to finetune global heap space management;
wenzelm
parents:
63821
diff
changeset

1119 
by default). 
b24d0e53dd03
option "checkpoint" helps to finetune global heap space management;
wenzelm
parents:
63821
diff
changeset

1120 

64308  1121 
* System option "profiling" specifies the mode for global ML profiling 
64342  1122 
in "isabelle build". Possible values are "time", "allocations". The 
1123 
commandline tool "isabelle profiling_report" helps to digest the 

1124 
resulting log files. 

64308  1125 

63986
c7a4b03727ae
options for process policy, notably for multiprocessor machines;
wenzelm
parents:
63979
diff
changeset

1126 
* System option "ML_process_policy" specifies an optional command prefix 
c7a4b03727ae
options for process policy, notably for multiprocessor machines;
wenzelm
parents:
63979
diff
changeset

1127 
for the underlying ML process, e.g. to control CPU affinity on 
63987
ac96fe9224f6
just one option is enough  "isabelle jedit" java process may be prefixed directly in the shell;
wenzelm
parents:
63986
diff
changeset

1128 
multiprocessor systems. The "isabelle jedit" tool allows to override the 
ac96fe9224f6
just one option is enough  "isabelle jedit" java process may be prefixed directly in the shell;
wenzelm
parents:
63986
diff
changeset

1129 
implicit default via option p. 
63986
c7a4b03727ae
options for process policy, notably for multiprocessor machines;
wenzelm
parents:
63979
diff
changeset

1130 

64390  1131 
* Commandline tool "isabelle console" provides option r to help to 
1132 
bootstrapping Isabelle/Pure interactively. 

1133 

1134 
* Commandline tool "isabelle yxml" has been discontinued. 

1135 
INCOMPATIBILITY, use operations from the modules "XML" and "YXML" in 

1136 
Isabelle/ML or Isabelle/Scala. 

1137 

1138 
* Many Isabelle tools that require a Java runtime system refer to the 

1139 
settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64, 

1140 
depending on the underlying platform. The settings for "isabelle build" 

1141 
ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been 

1142 
discontinued. Potential INCOMPATIBILITY. 

1143 

1144 
* The Isabelle system environment always ensures that the main 

1145 
executables are found within the shell search $PATH: "isabelle" and 

1146 
"isabelle_scala_script". 

1147 

1148 
* Isabelle tools may consist of .scala files: the Scala compiler is 

1149 
invoked on the spot. The source needs to define some object that extends 

1150 
Isabelle_Tool.Body. 

1151 

1152 
* File.bash_string, File.bash_path etc. represent Isabelle/ML and 

1153 
Isabelle/Scala strings authentically within GNU bash. This is useful to 

1154 
produce robust shell scripts under program control, without worrying 

1155 
about spaces or special characters. Note that user output works via 

1156 
Path.print (ML) or Path.toString (Scala). INCOMPATIBILITY, the old (and 

1157 
less versatile) operations File.shell_quote, File.shell_path etc. have 

1158 
been discontinued. 

1159 

63995  1160 
* The isabelle_java executable allows to run a Java process within the 
1161 
name space of Java and Scala components that are bundled with Isabelle, 

1162 
but without the Isabelle settings environment. 

1163 

64390  1164 
* Isabelle/Scala: the SSH module supports ssh and sftp connections, for 
1165 
remote commandexecution and filesystem access. This resembles 

1166 
operations from module File and Isabelle_System to some extent. Note 

1167 
that Path specifications need to be resolved remotely via 

1168 
ssh.remote_path instead of File.standard_path: the implicit process 

1169 
environment is different, Isabelle settings are not available remotely. 

1170 

1171 
* Isabelle/Scala: the Mercurial module supports repositories via the 

1172 
regular hg commandline interface. The repositroy clone and working 

1173 
directory may reside on a local or remote filesystem (via ssh 

1174 
connection). 

64265  1175 

62354  1176 

1177 

62031  1178 
New in Isabelle2016 (February 2016) 
62016  1179 
 
60138  1180 

61337  1181 
*** General *** 
1182 

62168
e97452d79102
Eisbach works for other objectlogics, e.g. Eisbach_FOL.thy;
wenzelm
parents:
62163
diff
changeset

1183 
* Eisbach is now based on Pure instead of HOL. Objectslogics may import 
e97452d79102
Eisbach works for other objectlogics, e.g. Eisbach_FOL.thy;
wenzelm
parents:
62163
diff
changeset

1184 
either the theory ~~/src/HOL/Eisbach/Eisbach (for HOL etc.) or 
e97452d79102
Eisbach works for other objectlogics, e.g. Eisbach_FOL.thy;
wenzelm
parents:
62163
diff
changeset

1185 
~~/src/HOL/Eisbach/Eisbach_Old_Appl_Syntax (for FOL, ZF etc.). Note that 
e97452d79102
Eisbach works for other objectlogics, e.g. Eisbach_FOL.thy;
wenzelm
parents:
62163
diff
changeset

1186 
the HOLEisbach session located in ~~/src/HOL/Eisbach/ contains further 
e97452d79102
Eisbach works for other objectlogics, e.g. Eisbach_FOL.thy;
wenzelm
parents:
62163
diff
changeset

1187 
examples that do require HOL. 
e97452d79102
Eisbach works for other objectlogics, e.g. Eisbach_FOL.thy;
wenzelm
parents:
62163
diff
changeset

1188 

62157  1189 
* Better resource usage on all platforms (Linux, Windows, Mac OS X) for 
1190 
both Isabelle/ML and Isabelle/Scala. Slightly reduced heap space usage. 

1191 

62017  1192 
* Former "xsymbols" syntax with Isabelle symbols is used by default, 
1193 
without any special print mode. Important ASCII replacement syntax 

1194 
remains available under print mode "ASCII", but less important syntax 

1195 
has been removed (see below). 

1196 

62109  1197 
* Support for more arrow symbols, with rendering in LaTeX and Isabelle 
1198 
fonts: \<Lleftarrow> \<Rrightarrow> \<longlongleftarrow> \<longlongrightarrow> \<longlonglongleftarrow> \<longlonglongrightarrow>. 

62017  1199 

62108
0046bacc5f5b
\<struct> loses its rendering and is superseded by \<diamondop>;
wenzelm
parents:
62107
diff
changeset

1200 
* Special notation \<struct> for the first implicit 'structure' in the 
0046bacc5f5b
\<struct> loses its rendering and is superseded by \<diamondop>;
wenzelm
parents:
62107
diff
changeset

1201 
context has been discontinued. Rare INCOMPATIBILITY, use explicit 
0046bacc5f5b
\<struct> loses its rendering and is superseded by \<diamondop>;
wenzelm
parents:
62107
diff
changeset

1202 
structure name instead, notably in indexed notation with blocksubscript 
0046bacc5f5b
\<struct> loses its rendering and is superseded by \<diamondop>;
wenzelm
parents:
62107
diff
changeset

1203 
(e.g. \<odot>\<^bsub>A\<^esub>). 
0046bacc5f5b
\<struct> loses its rendering and is superseded by \<diamondop>;
wenzelm
parents:
62107
diff
changeset

1204 

0046bacc5f5b
\<struct> loses its rendering and is superseded by \<diamondop>;
wenzelm
parents:
62107
diff
changeset

1205 
* The glyph for \<diamond> in the IsabelleText font now corresponds better to its 
0046bacc5f5b
\<struct> loses its rendering and is superseded by \<diamondop>;
wenzelm
parents:
62107
diff
changeset

1206 
counterpart \<box> as quantifierlike symbol. A small diamond is available as 
0046bacc5f5b
\<struct> loses its rendering and is superseded by \<diamondop>;
wenzelm
parents:
62107
diff
changeset

1207 
\<diamondop>; the old symbol \<struct> loses this rendering and any special 
0046bacc5f5b
\<struct> loses its rendering and is superseded by \<diamondop>;
wenzelm
parents:
62107
diff
changeset

1208 
meaning. 
0046bacc5f5b
\<struct> loses its rendering and is superseded by \<diamondop>;
wenzelm
parents:
62107
diff
changeset

1209 

62017  1210 
* Syntax for formal comments " text" now also supports the symbolic 
1211 
form "\<comment> text". Commandline tool "isabelle update_cartouches c" helps 

1212 
to update old sources. 

1213 

61337  1214 
* Toplevel theorem statements have been simplified as follows: 
1215 

1216 
theorems ~> lemmas 

1217 
schematic_lemma ~> schematic_goal 

1218 
schematic_theorem ~> schematic_goal 

1219 
schematic_corollary ~> schematic_goal 

1220 

1221 
Commandline tool "isabelle update_theorems" updates theory sources 

1222 
accordingly. 

1223 

61338  1224 
* Toplevel theorem statement 'proposition' is another alias for 
1225 
'theorem'. 

1226 

62169  1227 
* The old 'defs' command has been removed (legacy since Isabelle2014). 
1228 
INCOMPATIBILITY, use regular 'definition' instead. Overloaded and/or 

1229 
deferred definitions require a surrounding 'overloading' block. 

1230 

61337  1231 

60610
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
60595
diff
changeset

1232 
*** Prover IDE  Isabelle/Scala/jEdit *** 
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
60595
diff
changeset

1233 

60986  1234 
* IDE support for the sourcelevel debugger of Poly/ML, to work with 
62253  1235 
Isabelle/ML and official Standard ML. Option "ML_debugger" and commands 
1236 
'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug', 

1237 
'SML_file_no_debug' control compilation of sources with or without 

1238 
debugging information. The Debugger panel allows to set breakpoints (via 

1239 
context menu), step through stopped threads, evaluate local ML 

1240 
expressions etc. At least one Debugger view needs to be active to have 

1241 
any effect on the running ML program. 

60984  1242 

61804  1243 
* The State panel manages explicit proof state output, with dynamic 
1244 
autoupdate according to cursor movement. Alternatively, the jEdit 

1245 
action "isabelle.updatestate" (shortcut S+ENTER) triggers manual 

1246 
update. 

61729  1247 

1248 
* The Output panel no longer shows proof state output by default, to 

1249 
avoid GUI overcrowding. INCOMPATIBILITY, use the State panel instead or 

1250 
enable option "editor_output_state". 

61215  1251 

61804  1252 
* The text overview column (status of errors, warnings etc.) is updated 
1253 
asynchronously, leading to much better editor reactivity. Moreover, the 

1254 
full document node content is taken into account. The width of the 

1255 
column is scaled according to the main text area font, for improved 

1256 
visibility. 

1257 

1258 
* The main text area no longer changes its color hue in outdated 

1259 
situations. The text overview column takes over the role to indicate 

1260 
unfinished edits in the PIDE pipeline. This avoids flashing text display 

1261 
due to adhoc updates by auxiliary GUI components, such as the State 

1262 
panel. 

1263 

62254
81cbea2babd9
tuned NEWS: longrunning tasks can still prevent urgent tasks from being started, due to start_execution pri = 0;
wenzelm
parents:
62253
diff
changeset

1264 
* Slightly improved scheduling for urgent print tasks (e.g. command 
81cbea2babd9
tuned NEWS: longrunning tasks can still prevent urgent tasks from being started, due to start_execution pri = 0;
wenzelm
parents:
62253
diff
changeset

1265 
state output, interactive queries) wrt. longrunning background tasks. 
62017  1266 

1267 
* Completion of symbols via prefix of \<name> or \<^name> or \name is 

1268 
always possible, independently of the language context. It is never 

1269 
implicit: a popup will show up unconditionally. 

1270 

1271 
* Additional abbreviations for syntactic completion may be specified in 

1272 
$ISABELLE_HOME/etc/abbrevs and $ISABELLE_HOME_USER/etc/abbrevs, with 

1273 
support for simple templates using ASCII 007 (bell) as placeholder. 

1274 

62234
7cc9d7b822ae
discontinued irregular abbrevs: ".o" counts as word, "+o", "*o", "o" are occasionally used as ASCII notation, "*o" is in conflict with "(*o" in comments;
wenzelm
parents:
62231
diff
changeset

1275 
* Symbols \<oplus>, \<Oplus>, \<otimes>, \<Otimes>, \<odot>, \<Odot>, \<ominus>, \<oslash> no longer provide abbreviations for 
7cc9d7b822ae
discontinued irregular abbrevs: ".o" counts as word, "+o", "*o", "o" are occasionally used as ASCII notation, "*o" is in conflict with "(*o" in comments;
wenzelm
parents:
62231
diff
changeset

1276 
completion like "+o", "*o", ".o" etc.  due to conflicts with other 
7cc9d7b822ae
discontinued irregular abbrevs: ".o" counts as word, "+o", "*o", "o" are occasionally used as ASCII notation, "*o" is in conflict with "(*o" in comments;
wenzelm
parents:
62231
diff
changeset

1277 
ASCII syntax. INCOMPATIBILITY, use plain backslashcompletion or define 
7cc9d7b822ae
discontinued irregular abbrevs: ".o" counts as word, "+o", "*o", "o" are occasionally used as ASCII notation, "*o" is in conflict with "(*o" in comments;
wenzelm
parents:
62231
diff
changeset

1278 
suitable abbreviations in $ISABELLE_HOME_USER/etc/abbrevs. 
7cc9d7b822ae
discontinued irregular abbrevs: ".o" counts as word, "+o", "*o", "o" are occasionally used as ASCII notation, "*o" is in conflict with "(*o" in comments;
wenzelm
parents:
62231
diff
changeset

1279 

61483  1280 
* Action "isabelleemph" (with keyboard shortcut C+e LEFT) controls 
1281 
emphasized text style; the effect is visible in document output, not in 

1282 
the editor. 

1283 

1284 
* Action "isabellereset" now uses keyboard shortcut C+e BACK_SPACE, 

1285 
instead of former C+e LEFT. 

1286 

61512
933463440449
more uniform commandline for "isabelle jedit" and the isabelle.Main app wrapper;
wenzelm
parents:
61501
diff
changeset

1287 
* The commandline tool "isabelle jedit" and the isabelle.Main 
62027  1288 
application wrapper treat the default $USER_HOME/Scratch.thy more 
61512
933463440449
more uniform commandline for "isabelle jedit" and the isabelle.Main app wrapper;
wenzelm
parents:
61501
diff
changeset

1289 
uniformly, and allow the dummy file argument ":" to open an empty buffer 
933463440449
more uniform commandline for "isabelle jedit" and the isabelle.Main app wrapper;
wenzelm
parents:
61501
diff
changeset

1290 
instead. 
933463440449
more uniform commandline for "isabelle jedit" and the isabelle.Main app wrapper;
wenzelm
parents:
61501
diff
changeset

1291 

62017  1292 
* New commandline tool "isabelle jedit_client" allows to connect to an 
1293 
already running Isabelle/jEdit process. This achieves the effect of 

1294 
singleinstance applications seen on common GUI desktops. 

1295 

61530
82fc5a6231a2
back to traditional Metal as default, and thus evade current problems with Nimbus scrollbar slider;
wenzelm
parents:
61520
diff
changeset

1296 
* The default lookandfeel for Linux is the traditional "Metal", which 
82fc5a6231a2
back to traditional Metal as default, and thus evade current problems with Nimbus scrollbar slider;
wenzelm
parents:
61520
diff
changeset

1297 
works better with GUI scaling for very highresolution displays (e.g. 
82fc5a6231a2
back to traditional Metal as default, and thus evade current problems with Nimbus scrollbar slider;
wenzelm
parents:
61520
diff
changeset

1298 
4K). Moreover, it is generally more robust than "Nimbus". 
82fc5a6231a2
back to traditional Metal as default, and thus evade current problems with Nimbus scrollbar slider;
wenzelm
parents:
61520
diff
changeset

1299 

62163  1300 
* Update to jedit5.3.0, with improved GUI scaling and support of 
1301 
highresolution displays (e.g. 4K). 

1302 

62034  1303 
* The main Isabelle executable is managed as singleinstance Desktop 
1304 
application uniformly on all platforms: Linux, Windows, Mac OS X. 

1305 

60610
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
60595
diff
changeset

1306 

61405  1307 
*** Document preparation *** 
1308 

62017  1309 
* Commands 'paragraph' and 'subparagraph' provide additional section 
1310 
headings. Thus there are 6 levels of standard headings, as in HTML. 

1311 

1312 
* Command 'text_raw' has been clarified: input text is processed as in 

1313 
'text' (with antiquotations and control symbols). The key difference is 

1314 
the lack of the surrounding isabelle markup environment in output. 

1315 

1316 
* Text is structured in paragraphs and nested lists, using notation that 

1317 
is similar to Markdown. The control symbols for list items are as 

1318 
follows: 

1319 

1320 
\<^item> itemize 

1321 
\<^enum> enumerate 

1322 
\<^descr> description 

1323 

61491
97261e6c1d42
another antiquotation short form: undecorated cartouche as alias for @{text};
wenzelm
parents:
61488
diff
changeset

1324 
* There is a new short form for antiquotations with a single argument 
97261e6c1d42
another antiquotation short form: undecorated cartouche as alias for @{text};
wenzelm
parents:
61488
diff
changeset

1325 
that is a cartouche: \<^name>\<open>...\<close> is equivalent to @{name \<open>...\<close>} and 
61595  1326 
\<open>...\<close> without control symbol is equivalent to @{cartouche \<open>...\<close>}. 
1327 
\<^name> without following cartouche is equivalent to @{name}. The 

61501  1328 
standard Isabelle fonts provide glyphs to render important control 
1329 
symbols, e.g. "\<^verbatim>", "\<^emph>", "\<^bold>". 

61491
97261e6c1d42
another antiquotation short form: undecorated cartouche as alias for @{text};
wenzelm
parents:
61488
diff
changeset

1330 

61595  1331 
* Antiquotations @{noindent}, @{smallskip}, @{medskip}, @{bigskip} with 
1332 
corresponding control symbols \<^noindent>, \<^smallskip>, \<^medskip>, \<^bigskip> specify spacing formally, using 

1333 
standard LaTeX macros of the same names. 

1334 

61491
97261e6c1d42
another antiquotation short form: undecorated cartouche as alias for @{text};
wenzelm
parents:
61488
diff
changeset

1335 
* Antiquotation @{cartouche} in Isabelle/Pure is the same as @{text}. 
97261e6c1d42
another antiquotation short form: undecorated cartouche as alias for @{text};
wenzelm
parents:
61488
diff
changeset

1336 
Consequently, \<open>...\<close> without any decoration prints literal quasiformal 
61492  1337 
text. Commandline tool "isabelle update_cartouches t" helps to update 
1338 
old sources, by approximative patching of the content of string and 

1339 
cartouche tokens seen in theory sources. 

61491
97261e6c1d42
another antiquotation short form: undecorated cartouche as alias for @{text};
wenzelm
parents:
61488
diff
changeset

1340 

97261e6c1d42
another antiquotation short form: undecorated cartouche as alias for @{text};
wenzelm
parents:
61488
diff
changeset

1341 
* The @{text} antiquotation now ignores the antiquotation option 
97261e6c1d42
another antiquotation short form: undecorated cartouche as alias for @{text};
wenzelm
parents:
61488
diff
changeset

1342 
"source". The given text content is output unconditionally, without any 
97261e6c1d42
another antiquotation short form: undecorated cartouche as alias for @{text};
wenzelm
parents:
61488
diff
changeset

1343 
surrounding quotes etc. Subtle INCOMPATIBILITY, put quotes into the 
61494  1344 
argument where they are really intended, e.g. @{text \<open>"foo"\<close>}. Initial 
1345 
or terminal spaces are ignored. 

61491
97261e6c1d42
another antiquotation short form: undecorated cartouche as alias for @{text};
wenzelm
parents:
61488
diff
changeset

1346 

62017  1347 
* Antiquotations @{emph} and @{bold} output LaTeX source recursively, 
1348 
adding appropriate text style markup. These may be used in the short 

1349 
form \<^emph>\<open>...\<close> and \<^bold>\<open>...\<close>. 

1350 

1351 
* Document antiquotation @{footnote} outputs LaTeX source recursively, 

1352 
marked as \footnote{}. This may be used in the short form \<^footnote>\<open>...\<close>. 

1353 

1354 
* Antiquotation @{verbatim [display]} supports option "indent". 

1355 

1356 
* Antiquotation @{theory_text} prints uninterpreted theory source text 

62231
25f4a9cd8b68
tuned markup, e.g. relevant for Rendering.tooltip;
wenzelm
parents:
62209
diff
changeset

1357 
(Isar outer syntax with command keywords etc.). This may be used in the 
25f4a9cd8b68
tuned markup, e.g. relevant for Rendering.tooltip;
wenzelm
parents:
62209
diff
changeset

1358 
short form \<^theory_text>\<open>...\<close>. @{theory_text [display]} supports option "indent". 
62017  1359 

1360 
* Antiquotation @{doc ENTRY} provides a reference to the given 

1361 
documentation, with a hyperlink in the Prover IDE. 

1362 

1363 
* Antiquotations @{command}, @{method}, @{attribute} print checked 

1364 
entities of the Isar language. 

1365 

61471  1366 
* HTML presentation uses the standard IsabelleText font and Unicode 
1367 
rendering of Isabelle symbols like Isabelle/Scala/jEdit. The former 

61488  1368 
print mode "HTML" loses its special meaning. 
61471  1369 

61405  1370 

60406  1371 
*** Isar *** 
1372 

62205  1373 
* Local goals ('have', 'show', 'hence', 'thus') allow structured rule 
1374 
statements like fixes/assumes/shows in theorem specifications, but the 

1375 
notation is postfix with keywords 'if' (or 'when') and 'for'. For 

60555
51a6997b1384
support 'when' statement, which corresponds to 'presume';
wenzelm
parents:
60554
diff
changeset

1376 
example: 
60414  1377 

1378 
have result: "C x y" 

1379 
if "A x" and "B y" 

1380 
for x :: 'a and y :: 'a 

1381 
<proof> 

1382 

60449  1383 
The local assumptions are bound to the name "that". The result is 
1384 
exported from context of the statement as usual. The above roughly 

60414  1385 
corresponds to a raw proof block like this: 
1386 

1387 
{ 

1388 
fix x :: 'a and y :: 'a 

60449  1389 
assume that: "A x" "B y" 
60414  1390 
have "C x y" <proof> 
1391 
} 

1392 
note result = this 

60406  1393 

60555
51a6997b1384
support 'when' statement, which corresponds to 'presume';
wenzelm
parents:
60554
diff
changeset

1394 
The keyword 'when' may be used instead of 'if', to indicate 'presume' 
51a6997b1384
support 'when' statement, which corresponds to 'presume';
wenzelm
parents:
60554
diff
changeset

1395 
instead of 'assume' above. 
51a6997b1384
support 'when' statement, which corresponds to 'presume';
wenzelm
parents:
60554
diff
changeset

1396 

61733  1397 
* Assumptions ('assume', 'presume') allow structured rule statements 
1398 
using 'if' and 'for', similar to 'have' etc. above. For example: 

61658  1399 

1400 
assume result: "C x y" 

1401 
if "A x" and "B y" 

1402 
for x :: 'a and y :: 'a 

1403 

1404 
This assumes "\<And>x y::'a. A x \<Longrightarrow> B y \<Longrightarrow> C x y" and produces a general 

1405 
result as usual: "A ?x \<Longrightarrow> B ?y \<Longrightarrow> C ?x ?y". 

1406 

1407 
Vacuous quantification in assumptions is omitted, i.e. a forcontext 

1408 
only effects propositions according to actual use of variables. For 

1409 
example: 

1410 

1411 
assume "A x" and "B y" for x and y 

1412 

1413 
is equivalent to: 

1414 

1415 
assume "\<And>x. A x" and "\<And>y. B y" 

1416 

60595  1417 
* The meaning of 'show' with Pure rule statements has changed: premises 
1418 
are treated in the sense of 'assume', instead of 'presume'. This means, 

62205  1419 
a goal like "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x" can be solved completely as 
1420 
follows: 

60595  1421 

1422 
show "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x" 

1423 

1424 
or: 

1425 

1426 
show "C x" if "A x" "B x" for x 

1427 

