author  haftmann 
Wed, 04 Jan 2017 21:28:29 +0100  
changeset 64786  340db65fd2c1 
parent 64785  ae0bbc8e45ad 
child 64787  067cacdd1117 
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.) 
60006  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 

16 

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

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

18 

64632  19 
* Dropped aliasses RangeP, DomainP for Rangep, Domainp respectively. 
20 
INCOMPATIBILITY. 

21 

64634  22 
* Dropped abbreviation transP, antisymP, single_valuedP; 
23 
use constants transp, antisymp, single_valuedp instead. 

24 
INCOMPATIBILITY. 

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

25 

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

28 
unique_euclidean_(semi)ring; instantiation requires 

29 
provision of a euclidean size. 

30 

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

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

32 
 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

33 
 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

34 
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

35 
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

36 
 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

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

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

39 

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

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

41 
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

42 
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

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

44 

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

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

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

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

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

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

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

51 

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

52 
* Named collection mod_simps covers various congruence rules 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

53 
concerning mod, replacing former zmod_simps. 
50c715579715
reoriented congruence rules in nonexplosive direction
haftmann
parents:
64555
diff
changeset

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

55 

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

56 
* (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

57 
 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

58 
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

59 
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

60 

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

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

62 
bij_swap_ompose_bij ~> bij_swap_compose_bij 
64602  63 

60331  64 

64072  65 
New in Isabelle20161 (December 2016) 
66 
 

62216  67 

62440  68 
*** General *** 
69 

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

72 
INCOMPATIBILITY. 

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

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

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

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

77 
result the subgoal may be split into several subgoals. 

78 

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

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

82 

83 
bundle foo 

84 
begin 

85 
declare a [simp] 

86 
declare b [intro] 

87 
end 

63272  88 

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

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

92 

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

95 
discontinued. 

96 

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

98 
delimited uniformly via cartouches. This works better than oldfashioned 

99 
quotes when sublanguages are nested. 

100 

101 
* Mixfix annotations support general block properties, with syntax 

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

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

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

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

63650  106 

63383  107 
* Proof method "blast" is more robust wrt. corner cases of Pure 
108 
statements without objectlogic judgment. 

109 

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

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

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

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

115 
examples. 

116 

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

118 
instances) are generated into companion object of corresponding type 

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

120 

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

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

123 

64602  124 

62904  125 
*** Prover IDE  Isabelle/Scala/jEdit *** 
126 

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

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

130 
reactivity and CPU usage. 

131 

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

134 
command keywords and some command substructure. Action 

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

136 
according to command keywords only; see also option 

137 
"jedit_indent_newline". 

138 

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

140 
number of subgoals. This requires information of ongoing document 

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

142 
quickly; see also option "jedit_script_indent" and 

143 
"jedit_script_indent_limit". 

144 

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

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

147 
structure of theory specifications is treated as well. 

148 

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

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

151 

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

153 
e.g. 'context', 'notepad'. 

154 

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

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

157 

63977  158 
* Highlighting of entity def/ref positions wrt. cursor. 
159 

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

64514  161 
occurrences of the formal entity at the caret position. This facilitates 
63977  162 
systematic renaming. 
163 

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

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

166 
theorem statement. 

167 

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

169 
situations where old ASCII notation may be updated. 

170 

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

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

174 
inaccessible via keyboard completion). 

175 

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

178 

179 
src/Pure/ROOT0.ML 

180 
src/Pure/ROOT.ML 

181 
src/Pure/Pure.thy 

182 
src/Pure/ML_Bootstrap.thy 

183 

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

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

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

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

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

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

63307  190 
dependencies of the above files are only observed for batch build. 
62904  191 

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

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

63461  195 

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

199 
new 'abbrevs' section. 

200 

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

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

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

63579  204 

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

207 
keymap; nonconflicting changes are always applied implicitly. This 

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

209 
increases chances that users see new keyboard shortcuts when reusing 

210 
old keymaps. 

211 

63675  212 
* ML and document antiquotations for filesystems paths are more uniform 
213 
and diverse: 

214 

215 
@{path NAME}  no filesystem check 

216 
@{file NAME}  check for plain file 

217 
@{dir NAME}  check for directory 

218 

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

220 
have to be changed. 

63669  221 

222 

63977  223 
*** Document preparation *** 
224 

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

226 

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

229 

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

232 

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

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

235 
derivatives. 

236 

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

238 

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

240 
Isabelle2015). 

241 

242 

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

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

244 

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

247 
'definition', 'inductive', 'function'. 

248 

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

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

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

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

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

254 

63039  255 
* Command 'define' introduces a local (nonpolymorphic) definition, with 
256 
optional abstraction over local parameters. The syntax resembles 

63043  257 
'definition' and 'obtain'. It fits better into the Isar language than 
258 
old 'def', which is now a legacy feature. 

63039  259 

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

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

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

262 

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

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

264 
typesetting. E.g. to produce proof holes in examples and documentation. 
62216  265 

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

268 

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

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

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

272 

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

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

275 
INCOMPATIBILITY. 

62939  276 

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

279 
definitions. 

280 

63527  281 
* Proof method "use" allows to modify the main facts of a given method 
282 
expression, e.g. 

63259  283 

284 
(use facts in simp) 

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

286 

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

289 

62216  290 

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

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

292 

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

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

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

297 

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

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

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

301 
regardless of the actual parameters that are provided. Rare 

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

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

304 

305 
* Typeinference improves sorts of newly introduced type variables for 

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

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

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

309 
INCOMPATIBILITY, need to provide explicit type constraints for Pure 

310 
types where this is really intended. 

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

311 

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

312 

62327  313 
*** HOL *** 
314 

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

317 
propositional logic, goals based on a combination of quantifierfree 

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

319 
quantifierfree propositional logic with linear real arithmetic 

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

321 

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

324 

63977  325 
* Metis: The problem encoding has changed very slightly. This might 
63785  326 
break existing proofs. INCOMPATIBILITY. 
327 

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

329 
 The MaSh relevance filter is now faster than before. 
63116  330 
 Produce syntactically correct Vampire 4.0 problem files. 
331 

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

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

62842  336 
method. See 'isabelle doc corec'. 
63977  337 
 The predicator :: ('a \<Rightarrow> bool) \<Rightarrow> 'a F \<Rightarrow> bool is now a firstclass 
63855  338 
citizen in bounded natural functors. 
62693  339 
 'primrec' now allows nested calls through the predicator in addition 
62327  340 
to the map function. 
63855  341 
 'bnf' automatically discharges reflexive proof obligations. 
62693  342 
 'bnf' outputs a slightly modified proof obligation expressing rel in 
62332  343 
terms of map and set 
63855  344 
(not giving a specification for rel makes this one reflexive). 
62693  345 
 'bnf' outputs a new proof obligation expressing pred in terms of set 
63855  346 
(not giving a specification for pred makes this one reflexive). 
347 
INCOMPATIBILITY: manual 'bnf' declarations may need adjustment. 

62335  348 
 Renamed lemmas: 
349 
rel_prod_apply ~> rel_prod_inject 

350 
pred_prod_apply ~> pred_prod_inject 

351 
INCOMPATIBILITY. 

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

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

355 
INCOMPATIBILITY. 

62327  356 

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

359 
which exposed details of the internal fixpoint construction and was 

360 
hard to use. INCOMPATIBILITY. 

361 

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

363 

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

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

366 

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

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

369 
eliminated altogether. 

370 

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

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

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

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

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

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

377 
INCOMPATIBILITY in rare situations. 

378 

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

380 
INCOMPATIBILITY. 

381 

64390  382 
* Renamed constants and corresponding theorems: 
383 

384 
setsum ~> sum 

385 
setprod ~> prod 

386 
listsum ~> sum_list 

387 
listprod ~> prod_list 

388 

389 
INCOMPATIBILITY. 

390 

391 
* Sligthly more standardized theorem names: 

392 
sgn_times ~> sgn_mult 

393 
sgn_mult' ~> Real_Vector_Spaces.sgn_mult 

394 
divide_zero_left ~> div_0 

395 
zero_mod_left ~> mod_0 

396 
divide_zero ~> div_by_0 

397 
divide_1 ~> div_by_1 

398 
nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left 

399 
div_mult_self1_is_id ~> nonzero_mult_div_cancel_left 

400 
nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right 

401 
div_mult_self2_is_id ~> nonzero_mult_div_cancel_right 

402 
is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left 

403 
is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right 

404 
mod_div_equality ~> div_mult_mod_eq 

405 
mod_div_equality2 ~> mult_div_mod_eq 

406 
mod_div_equality3 ~> mod_div_mult_eq 

407 
mod_div_equality4 ~> mod_mult_div_eq 

408 
minus_div_eq_mod ~> minus_div_mult_eq_mod 

409 
minus_div_eq_mod2 ~> minus_mult_div_eq_mod 

410 
minus_mod_eq_div ~> minus_mod_eq_div_mult 

411 
minus_mod_eq_div2 ~> minus_mod_eq_mult_div 

412 
div_mod_equality' ~> minus_mod_eq_div_mult [symmetric] 

413 
mod_div_equality' ~> minus_div_mult_eq_mod [symmetric] 

414 
zmod_zdiv_equality ~> mult_div_mod_eq [symmetric] 

415 
zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric] 

416 
Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

417 
mult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

418 
zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

419 
div_1 ~> div_by_Suc_0 

420 
mod_1 ~> mod_by_Suc_0 

421 
INCOMPATIBILITY. 

422 

423 
* New type class "idom_abs_sgn" specifies algebraic properties 

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

425 
disappeared. Slight INCOMPATIBILITY. 

426 

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

428 

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

431 

432 
 Logical representation: 

433 
* 0 is instantiated to the ASCII zero character. 

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

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

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

437 
are noncanonical. 

438 
 Printing and parsing: 

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

440 
(as before). 

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

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

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

444 
is parsable for every numeral expression n. 

445 
* Noncanonical characters have no special syntax and are 

446 
printed as their logical representation. 

447 
 Explicit conversions from and to the natural numbers are 

448 
provided as char_of_nat, nat_of_char (as before). 

449 
 The auxiliary nibble type has been discontinued. 

450 

451 
INCOMPATIBILITY. 

452 

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

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

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

456 
infix "mod" syntax. INCOMPATIBILITY. 

457 

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

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

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

462 
easily recovered by composition with eq_refl. Minor INCOMPATIBILITY. 

463 

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

466 

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

468 
which renders those abstract effectively. 

469 

470 
* Command 'export_code' checks given constants for abstraction 

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

472 
interface for the generated code. 

473 

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

475 
spelt out explicitly. 

476 

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

478 
explicitly provided auxiliary definitions for required type class 

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

481 

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

483 
products. 

63977  484 

485 
* Locale bijection establishes convenient default simp rules such as 

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

487 

488 
* Abstract locales semigroup, abel_semigroup, semilattice, 

489 
semilattice_neutr, ordering, ordering_top, semilattice_order, 

490 
semilattice_neutr_order, comm_monoid_set, semilattice_set, 

491 
semilattice_neutr_set, semilattice_order_set, 

492 
semilattice_order_neutr_set monoid_list, comm_monoid_list, 

493 
comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified 

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

495 
INCOMPATIBILITY. 

496 

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

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

499 
lifting_syntax begin ... end". Minor INCOMPATIBILITY. 

500 

63807  501 
* Some old / obsolete theorems have been renamed / removed, potential 
502 
INCOMPATIBILITY. 

503 

504 
nat_less_cases  removed, use linorder_cases instead 

505 
inv_image_comp  removed, use image_inv_f_f instead 

506 
image_surj_f_inv_f ~> image_f_inv_f 

63113  507 

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

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

509 
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

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

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

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

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

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

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

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

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

518 

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

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

520 
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

521 
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

522 
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

523 
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

524 
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

525 
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

526 
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

527 
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

528 
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

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

530 

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

62396  533 

63977  534 
* Added class topological_monoid. 
535 

64391  536 
* The following theorems have been renamed: 
537 

64457  538 
setsum_left_distrib ~> sum_distrib_right 
539 
setsum_right_distrib ~> sum_distrib_left 

64391  540 

541 
INCOMPATIBILITY. 

542 

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

544 
INCOMPATIBILITY. 

545 

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

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

548 
A)". 

549 

550 
* Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY. 

551 

552 
* The type class ordered_comm_monoid_add is now called 

553 
ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add 

554 
is introduced as the combination of ordered_ab_semigroup_add + 

555 
comm_monoid_add. INCOMPATIBILITY. 

556 

557 
* Introduced the type classes canonically_ordered_comm_monoid_add and 

558 
dioid. 

559 

560 
* Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When 

561 
instantiating linordered_semiring_strict and ordered_ab_group_add, an 

562 
explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might 

563 
be required. INCOMPATIBILITY. 

63117  564 

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

567 
lcm_left_commute_nat ~> lcm.left_commute 

568 
lcm_left_commute_int ~> lcm.left_commute 

569 
gcd_left_commute_nat ~> gcd.left_commute 

570 
gcd_left_commute_int ~> gcd.left_commute 

571 
gcd_greatest_iff_nat ~> gcd_greatest_iff 

572 
gcd_greatest_iff_int ~> gcd_greatest_iff 

573 
coprime_dvd_mult_nat ~> coprime_dvd_mult 

574 
coprime_dvd_mult_int ~> coprime_dvd_mult 

575 
zpower_numeral_even ~> power_numeral_even 

576 
gcd_mult_cancel_nat ~> gcd_mult_cancel 

577 
gcd_mult_cancel_int ~> gcd_mult_cancel 

578 
div_gcd_coprime_nat ~> div_gcd_coprime 

579 
div_gcd_coprime_int ~> div_gcd_coprime 

580 
zpower_numeral_odd ~> power_numeral_odd 

581 
zero_less_int_conv ~> of_nat_0_less_iff 

582 
gcd_greatest_nat ~> gcd_greatest 

583 
gcd_greatest_int ~> gcd_greatest 

584 
coprime_mult_nat ~> coprime_mult 

585 
coprime_mult_int ~> coprime_mult 

586 
lcm_commute_nat ~> lcm.commute 

587 
lcm_commute_int ~> lcm.commute 

588 
int_less_0_conv ~> of_nat_less_0_iff 

589 
gcd_commute_nat ~> gcd.commute 

590 
gcd_commute_int ~> gcd.commute 

591 
Gcd_insert_nat ~> Gcd_insert 

592 
Gcd_insert_int ~> Gcd_insert 

593 
of_int_int_eq ~> of_int_of_nat_eq 

594 
lcm_least_nat ~> lcm_least 

595 
lcm_least_int ~> lcm_least 

596 
lcm_assoc_nat ~> lcm.assoc 

597 
lcm_assoc_int ~> lcm.assoc 

598 
int_le_0_conv ~> of_nat_le_0_iff 

599 
int_eq_0_conv ~> of_nat_eq_0_iff 

600 
Gcd_empty_nat ~> Gcd_empty 

601 
Gcd_empty_int ~> Gcd_empty 

602 
gcd_assoc_nat ~> gcd.assoc 

603 
gcd_assoc_int ~> gcd.assoc 

604 
zero_zle_int ~> of_nat_0_le_iff 

605 
lcm_dvd2_nat ~> dvd_lcm2 

606 
lcm_dvd2_int ~> dvd_lcm2 

607 
lcm_dvd1_nat ~> dvd_lcm1 

608 
lcm_dvd1_int ~> dvd_lcm1 

609 
gcd_zero_nat ~> gcd_eq_0_iff 

610 
gcd_zero_int ~> gcd_eq_0_iff 

611 
gcd_dvd2_nat ~> gcd_dvd2 

612 
gcd_dvd2_int ~> gcd_dvd2 

613 
gcd_dvd1_nat ~> gcd_dvd1 

614 
gcd_dvd1_int ~> gcd_dvd1 

615 
int_numeral ~> of_nat_numeral 

616 
lcm_ac_nat ~> ac_simps 

617 
lcm_ac_int ~> ac_simps 

618 
gcd_ac_nat ~> ac_simps 

619 
gcd_ac_int ~> ac_simps 

620 
abs_int_eq ~> abs_of_nat 

621 
zless_int ~> of_nat_less_iff 

622 
zdiff_int ~> of_nat_diff 

623 
zadd_int ~> of_nat_add 

624 
int_mult ~> of_nat_mult 

625 
int_Suc ~> of_nat_Suc 

626 
inj_int ~> inj_of_nat 

627 
int_1 ~> of_nat_1 

628 
int_0 ~> of_nat_0 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

651 
coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff 
62348  652 
realpow_minus_mult ~> power_minus_mult 
653 
realpow_Suc_le_self ~> power_Suc_le_self 

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

654 
dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest 
62347  655 
INCOMPATIBILITY. 
656 

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

657 
* Renamed HOL/Quotient_Examples/FSet.thy to 
63977  658 
HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY. 
659 

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

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

663 
"unbundle finfun_syntax" to imitate import of 

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

665 

666 
* Session HOLLibrary: theory Multiset_Permutations (executably) defines 

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

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

669 
once. 

670 

671 
* Session HOLLibrary: multiset membership is now expressed using 

672 
set_mset rather than count. 

673 

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

675 
by default. 

676 

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

678 
equations count_eq_zero_iff and not_in_iff. 

679 

680 
 Rules count_inI and in_countE obtain facts of the form 

681 
"count M a = n" from membership. 

682 

683 
 Rules count_in_diffI and in_diff_countE obtain facts of the form 

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

685 

686 
INCOMPATIBILITY. 

687 

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

689 
displaying equations in functional programming style  variables 

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

691 
underscores. 

692 

693 
* Session HOLLibrary: theory Combinator_PER provides combinator to 

694 
build partial equivalence relations from a predicate and an equivalence 

695 
relation. 

696 

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

698 
everywhere fix bijections. 

699 

700 
* Session HOLLibrary: theory Normalized_Fraction allows viewing an 

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

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

703 
denominator is normalized wrt. unit factors). 

704 

705 
* Session HOLNSA has been renamed to HOLNonstandard_Analysis. 

706 

707 
* Session HOLMultivariate_Analysis has been renamed to HOLAnalysis. 

708 

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

710 
HOLProbability. When importing HOLAnalysis some theorems need 

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

712 

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

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

715 
principle, Residue theorem, Schwarz Lemma. 

716 

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

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

719 

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

721 
libraries: homeomorphisms, continuous function extensions, invariance of 

722 
domain. 

723 

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

725 
changed from ereal to ennreal, INCOMPATIBILITY. 

726 

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

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

729 

730 
* Session HOLProbability: Code generation and QuickCheck for 

731 
Probability Mass Functions. 

732 

733 
* Session HOLProbability: theory Random_Permutations contains some 

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

735 
folding over a list in random order. 

736 

737 
* Session HOLProbability: theory SPMF formalises discrete 

738 
subprobability distributions. 

739 

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

741 
normalised to distinguish which ordering the theorems are about 

742 

743 
mset_less_eqI ~> mset_subset_eqI 

744 
mset_less_insertD ~> mset_subset_insertD 

745 
mset_less_eq_count ~> mset_subset_eq_count 

746 
mset_less_diff_self ~> mset_subset_diff_self 

747 
mset_le_exists_conv ~> mset_subset_eq_exists_conv 

748 
mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel 

749 
mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel 

750 
mset_le_mono_add ~> mset_subset_eq_mono_add 

751 
mset_le_add_left ~> mset_subset_eq_add_left 

752 
mset_le_add_right ~> mset_subset_eq_add_right 

753 
mset_le_single ~> mset_subset_eq_single 

754 
mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute 

755 
diff_le_self ~> diff_subset_eq_self 

756 
mset_leD ~> mset_subset_eqD 

757 
mset_lessD ~> mset_subsetD 

758 
mset_le_insertD ~> mset_subset_eq_insertD 

759 
mset_less_of_empty ~> mset_subset_of_empty 

760 
mset_less_size ~> mset_subset_size 

761 
wf_less_mset_rel ~> wf_subset_mset_rel 

762 
count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq 

763 
mset_remdups_le ~> mset_remdups_subset_eq 

764 
ms_lesseq_impl ~> subset_eq_mset_impl 

765 

766 
Some functions have been renamed: 

767 
ms_lesseq_impl > subset_eq_mset_impl 

768 

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

770 
#\<subseteq># ~> \<le> 

771 
#\<subset># ~> < 

772 
le_multiset ~> less_eq_multiset 

773 
less_multiset ~> le_multiset 

774 
INCOMPATIBILITY. 

775 

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

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

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

779 
interpretations "multiset_linorder" and "multiset_wellorder" have been 

780 
replaced by instantiations. INCOMPATIBILITY. 

781 

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

783 
been renamed: 

784 

785 
le_multiset_def ~> less_eq_multiset_def 

786 
less_multiset_def ~> le_multiset_def 

787 
less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset 

788 
mult_less_not_refl ~> mset_le_not_refl 

789 
mult_less_trans ~> mset_le_trans 

790 
mult_less_not_sym ~> mset_le_not_sym 

791 
mult_less_asym ~> mset_le_asym 

792 
mult_less_irrefl ~> mset_le_irrefl 

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

794 

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

796 
le_multiset_total ~> less_eq_multiset_total 

797 
less_multiset_right_total ~> subset_eq_imp_le_multiset 

798 
le_multiset_empty_left ~> less_eq_multiset_empty_left 

799 
le_multiset_empty_right ~> less_eq_multiset_empty_right 

800 
less_multiset_empty_right ~> le_multiset_empty_left 

801 
less_multiset_empty_left ~> le_multiset_empty_right 

802 
union_less_diff_plus ~> union_le_diff_plus 

803 
ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset 

804 
less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty 

805 
le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty 

806 
INCOMPATIBILITY. 

807 

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

809 
INCOMPATIBILITY. 

810 

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

812 
INCOMPATIBILITY, use the following replacements: 

813 

814 
le_multiset_plus_plus_left_iff ~> add_less_cancel_right 

815 
less_multiset_plus_plus_left_iff ~> add_less_cancel_right 

816 
le_multiset_plus_plus_right_iff ~> add_less_cancel_left 

817 
less_multiset_plus_plus_right_iff ~> add_less_cancel_left 

818 
add_eq_self_empty_iff ~> add_cancel_left_right 

819 
mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right 

820 
mset_less_add_bothsides ~> subset_mset.add_less_cancel_right 

821 
mset_le_add_bothsides ~> subset_mset.add_less_cancel_right 

822 
empty_inter ~> subset_mset.inf_bot_left 

823 
inter_empty ~> subset_mset.inf_bot_right 

824 
empty_sup ~> subset_mset.sup_bot_left 

825 
sup_empty ~> subset_mset.sup_bot_right 

826 
bdd_below_multiset ~> subset_mset.bdd_above_bot 

827 
subset_eq_empty ~> subset_mset.le_zero_eq 

828 
le_empty ~> subset_mset.le_zero_eq 

829 
mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero 

830 
mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero 

831 

832 
* Session HOLLibrary: some typeclass constraints about multisets have 

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

834 
additional typeclasses order_bot, no_top, 

835 
ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add, 

836 
linordered_cancel_ab_semigroup_add, and 

837 
ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY. 

838 

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

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

841 
INCOMPATIBILITY. 

842 

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

844 
interpretations ordered_ab_semigroup_monoid_add_imp_le and 

845 
bounded_lattice_bot. INCOMPATIBILITY. 

846 

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

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

849 
removed or changed: 

850 

851 
single_not_empty ~> add_mset_not_empty or empty_not_add_mset 

852 
fold_mset_insert ~> fold_mset_add_mset 

853 
image_mset_insert ~> image_mset_add_mset 

854 
union_single_eq_diff 

855 
multi_self_add_other_not_self 

856 
diff_single_eq_union 

857 
INCOMPATIBILITY. 

858 

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

860 
to use add_mset instead of single: 

861 

862 
mset_add 

863 
multi_self_add_other_not_self 

864 
diff_single_eq_union 

865 
union_single_eq_diff 

866 
union_single_eq_member 

867 
add_eq_conv_diff 

868 
insert_noteq_member 

869 
add_eq_conv_ex 

870 
multi_member_split 

871 
multiset_add_sub_el_shuffle 

872 
mset_subset_eq_insertD 

873 
mset_subset_insertD 

874 
insert_subset_eq_iff 

875 
insert_union_subset_iff 

876 
multi_psub_of_add_self 

877 
inter_add_left1 

878 
inter_add_left2 

879 
inter_add_right1 

880 
inter_add_right2 

881 
sup_union_left1 

882 
sup_union_left2 

883 
sup_union_right1 

884 
sup_union_right2 

885 
size_eq_Suc_imp_eq_union 

886 
multi_nonempty_split 

887 
mset_insort 

888 
mset_update 

889 
mult1I 

890 
less_add 

891 
mset_zip_take_Cons_drop_twice 

892 
rel_mset_Zero 

893 
msed_map_invL 

894 
msed_map_invR 

895 
msed_rel_invL 

896 
msed_rel_invR 

897 
le_multiset_right_total 

898 
multiset_induct 

899 
multiset_induct2_size 

900 
multiset_induct2 

901 
INCOMPATIBILITY. 

902 

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

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

905 
element: 

906 

907 
image_mset 

908 
mset 

909 
replicate_mset 

910 
mult1 

911 
pred_mset 

912 
rel_mset' 

913 
mset_insort 

914 

915 
INCOMPATIBILITY. 

916 

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

918 
attributes of some multiset theorems have been changed: 

919 

920 
insert_DiffM [] ~> [simp] 

921 
insert_DiffM2 [simp] ~> [] 

922 
diff_add_mset_swap [simp] 

923 
fold_mset_add_mset [simp] 

924 
diff_diff_add [simp] (for multisets only) 

925 
diff_cancel [simp] ~> [] 

926 
count_single [simp] ~> [] 

927 
set_mset_single [simp] ~> [] 

928 
size_multiset_single [simp] ~> [] 

929 
size_single [simp] ~> [] 

930 
image_mset_single [simp] ~> [] 

931 
mset_subset_eq_mono_add_right_cancel [simp] ~> [] 

932 
mset_subset_eq_mono_add_left_cancel [simp] ~> [] 

933 
fold_mset_single [simp] ~> [] 

934 
subset_eq_empty [simp] ~> [] 

935 
empty_sup [simp] ~> [] 

936 
sup_empty [simp] ~> [] 

937 
inter_empty [simp] ~> [] 

938 
empty_inter [simp] ~> [] 

939 
INCOMPATIBILITY. 

940 

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

944 
INCOMPATIBILITY. 

945 

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

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

948 
natural numbers. INCOMPATIBILITY. 

949 

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

951 
multisets: 

952 

953 
msetsum ~> sum_mset 

954 
msetprod ~> prod_mset 

955 

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

957 
and union of multisets have been changed: 

958 

959 
#\<inter> ~> \<inter># 

960 
#\<union> ~> \<union># 

961 

962 
INCOMPATIBILITY. 

963 

964 
* Session HOLLibrary, theory Multiset: the lemma 

965 
one_step_implies_mult_aux on multisets has been removed, use 

966 
one_step_implies_mult instead. INCOMPATIBILITY. 

967 

968 
* Session HOLLibrary: theory Complete_Partial_Order2 provides reasoning 

969 
support for monotonicity and continuity in chaincomplete partial orders 

970 
and about admissibility conditions for fixpoint inductions. 

971 

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

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

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

976 
future different type class instantiation for polynomials over factorial 

977 
rings. INCOMPATIBILITY. 

64390  978 

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

980 
the following renaming 

981 

982 
prefixeq > prefix 

983 
prefix > strict_prefix 

984 
suffixeq > suffix 

985 
suffix > strict_suffix 

986 

987 
Added theory of longest common prefixes. 

64389  988 

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

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

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

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

994 
"prime_nat_iff". INCOMPATIBILITY. 

995 

996 
* Session Old_Number_Theory has been removed, after porting remaining 

997 
theories. 

998 

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

1001 

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

1002 

62498  1003 
*** ML *** 
1004 

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

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

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

1009 
INCOMPATIBILITY. 

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

1010 

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

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

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

1018 

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

1021 

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

1023 
with approximative output quality. 

1024 

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

1026 
exposed to Isabelle/ML userspace. Potential INCOMPATIBILITY. 

1027 

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

1030 
requiring separate files. 

1031 

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

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

1035 
debugger information requires consirable time and space: main 

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

1037 

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

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

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

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

1043 
balanced blocks of Local_Theory.open_target versus 

1044 
Local_Theory.close_target instead. Rare INCOMPATIBILITY. 

1045 

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

1048 
INCOMPATIBILITY. 

1049 

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

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

1053 
File.full_path). Potential INCOMPATIBILITY. 

1054 

63352  1055 
* Binding.empty_atts supersedes Thm.empty_binding and 
1056 
Attrib.empty_binding. Minor INCOMPATIBILITY. 

1057 

62498  1058 

62354  1059 
*** System *** 
1060 

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

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

1064 
much less disk space. 

63226  1065 

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

1068 
particular: 

1069 

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

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

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

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

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

1074 

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

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

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

1078 

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

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

1080 
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

1081 
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

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

1083 

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

1086 
servers with separate CPU/memory modules. 

1087 

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

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

64274  1090 
unless there is already a default provided via ML_OPTIONS settings. 
1091 

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

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

1093 
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

1094 
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

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

1096 

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

1100 
resulting log files. 

64308  1101 

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

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

1103 
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

1104 
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

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

1106 

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

1109 

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

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

1112 
Isabelle/ML or Isabelle/Scala. 

1113 

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

1115 
settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64, 

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

1117 
ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been 

1118 
discontinued. Potential INCOMPATIBILITY. 

1119 

1120 
* The Isabelle system environment always ensures that the main 

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

1122 
"isabelle_scala_script". 

1123 

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

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

1126 
Isabelle_Tool.Body. 

1127 

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

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

1130 
produce robust shell scripts under program control, without worrying 

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

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

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

1134 
been discontinued. 

1135 

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

1138 
but without the Isabelle settings environment. 

1139 

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

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

1143 
that Path specifications need to be resolved remotely via 

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

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

1146 

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

1148 
regular hg commandline interface. The repositroy clone and working 

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

1150 
connection). 

64265  1151 

62354  1152 

1153 

62031  1154 
New in Isabelle2016 (February 2016) 
62016  1155 
 
60138  1156 

61337  1157 
*** General *** 
1158 

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

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

1160 
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

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

1162 
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

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

1164 

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

1167 

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

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

1171 
has been removed (see below). 

1172 

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

62017  1175 

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

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

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

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

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

1180 

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

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

1182 
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

1183 
\<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

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

1185 

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

1188 
to update old sources. 

1189 

61337  1190 
* Toplevel theorem statements have been simplified as follows: 
1191 

1192 
theorems ~> lemmas 

1193 
schematic_lemma ~> schematic_goal 

1194 
schematic_theorem ~> schematic_goal 

1195 
schematic_corollary ~> schematic_goal 

1196 

1197 
Commandline tool "isabelle update_theorems" updates theory sources 

1198 
accordingly. 

1199 

61338  1200 
* Toplevel theorem statement 'proposition' is another alias for 
1201 
'theorem'. 

1202 

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

1205 
deferred definitions require a surrounding 'overloading' block. 

1206 

61337  1207 

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

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

1209 

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

1213 
'SML_file_no_debug' control compilation of sources with or without 

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

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

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

1217 
any effect on the running ML program. 

60984  1218 

61803  1219 
* The State panel manages explicit proof state output, with dynamic 
1220 
autoupdate according to cursor movement. Alternatively, the jEdit 

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

1222 
update. 

61729  1223 

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

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

1226 
enable option "editor_output_state". 

61215  1227 

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

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

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

1232 
visibility. 

1233 

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

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

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

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

1238 
panel. 

1239 

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

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

1241 
state output, interactive queries) wrt. longrunning background tasks. 
62017  1242 

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

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

1245 
implicit: a popup will show up unconditionally. 

1246 

1247 
* Additional abbreviations for syntactic completion may be specified in 

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

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

1250 

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

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

1252 
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

1253 
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

1254 
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

1255 

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

1258 
the editor. 

1259 

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

1261 
instead of former C+e LEFT. 

1262 

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

1263 
* The commandline tool "isabelle jedit" and the isabelle.Main 
62027  1264 
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

1265 
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

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

1267 

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

1270 
singleinstance applications seen on common GUI desktops. 

1271 

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

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

1273 
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

1274 
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

1275 

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

1278 

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

1281 

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

1282 

61405  1283 
*** Document preparation *** 
1284 

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

1287 

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

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

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

1291 

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

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

1294 
follows: 

1295 

1296 
\<^item> itemize 

1297 
\<^enum> enumerate 

1298 
\<^descr> description 

1299 

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

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

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

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

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

1306 

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

1309 
standard LaTeX macros of the same names. 

1310 

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

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

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

1315 
cartouche tokens seen in theory sources. 

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

1316 

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

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

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

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

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

1322 

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

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

1326 

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

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

1329 

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

1331 

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

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

1333 
(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

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

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

1337 
documentation, with a hyperlink in the Prover IDE. 

1338 

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

1340 
entities of the Isar language. 

1341 

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

61488  1344 
print mode "HTML" loses its special meaning. 
61471  1345 

61405  1346 

60406  1347 
*** Isar *** 
1348 

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

1351 
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

1352 
example: 
60414  1353 

1354 
have result: "C x y" 

1355 
if "A x" and "B y" 

1356 
for x :: 'a and y :: 'a 

1357 
<proof> 

1358 

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

60414  1361 
corresponds to a raw proof block like this: 
1362 

1363 
{ 

1364 
fix x :: 'a and y :: 'a 

60449  1365 
assume that: "A x" "B y" 
60414  1366 
have "C x y" <proof> 
1367 
} 

1368 
note result = this 

60406  1369 

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

1370 
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

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

1372 

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

61658  1375 

1376 
assume result: "C x y" 

1377 
if "A x" and "B y" 

1378 
for x :: 'a and y :: 'a 

1379 

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

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

1382 

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

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

1385 
example: 

1386 

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

1388 

1389 
is equivalent to: 

1390 

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

1392 

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

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

60595  1397 

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

1399 

1400 
or: 

1401 

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

1403 

1404 
Rare INCOMPATIBILITY, the old behaviour may be recovered as follows: 

1405 

1406 
show "C x" when "A x" "B x" for x 

1407 

60459  1408 
* New command 'consider' states rules for generalized elimination and 
1409 
case splitting. This is like a toplevel statement "theorem obtains" used 

1410 
within a proof body; or like a multibranch 'obtain' without activation 

1411 
of the local context elements yet. 

1412 

60455  1413 
* Proof method "cases" allows to specify the rule as first entry of 
1414 
chained facts. This is particularly useful with 'consider': 

1415 

1416 
consider (a) A  (b) B  (c) C <proof> 

1417 
then have something 

1418 
proof cases 

1419 
case a 

1420 
then show ?thesis <proof> 

1421 
next 

1422 
case b 

1423 
then show ?thesis <proof> 

1424 
next 

1425 
case c 

1426 
then show ?thesis <proof> 

1427 
qed 

1428 

60565  1429 
* Command 'case' allows fact name and attribute specification like this: 
1430 

1431 
case a: (c xs) 

1432 
case a [attributes]: (c xs) 

1433 

1434 
Facts that are introduced by invoking the case context are uniformly 

1435 
qualified by "a"; the same name is used for the cumulative fact. The old 

1436 
form "case (c xs) [attributes]" is no longer 