author  wenzelm 
Sun, 01 Jan 2017 13:38:20 +0100  
changeset 64734  12558536d977 
parent 64634  5bd30359e46e 
child 64785  ae0bbc8e45ad 
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 

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

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

27 
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

28 
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

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

30 

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

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

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

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

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

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

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

37 

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

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

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

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

41 

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

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

43 
 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

44 
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

45 
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

46 

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

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

48 
bij_swap_ompose_bij ~> bij_swap_compose_bij 
64602  49 

60331  50 

64072  51 
New in Isabelle20161 (December 2016) 
52 
 

62216  53 

62440  54 
*** General *** 
55 

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

58 
INCOMPATIBILITY. 

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

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

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

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

63 
result the subgoal may be split into several subgoals. 

64 

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

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

68 

69 
bundle foo 

70 
begin 

71 
declare a [simp] 

72 
declare b [intro] 

73 
end 

63272  74 

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

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

78 

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

81 
discontinued. 

82 

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

84 
delimited uniformly via cartouches. This works better than oldfashioned 

85 
quotes when sublanguages are nested. 

86 

87 
* Mixfix annotations support general block properties, with syntax 

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

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

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

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

63650  92 

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

95 

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

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

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

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

101 
examples. 

102 

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

104 
instances) are generated into companion object of corresponding type 

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

106 

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

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

109 

64602  110 

62904  111 
*** Prover IDE  Isabelle/Scala/jEdit *** 
112 

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

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

116 
reactivity and CPU usage. 

117 

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

120 
command keywords and some command substructure. Action 

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

122 
according to command keywords only; see also option 

123 
"jedit_indent_newline". 

124 

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

126 
number of subgoals. This requires information of ongoing document 

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

128 
quickly; see also option "jedit_script_indent" and 

129 
"jedit_script_indent_limit". 

130 

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

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

133 
structure of theory specifications is treated as well. 

134 

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

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

137 

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

139 
e.g. 'context', 'notepad'. 

140 

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

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

143 

63977  144 
* Highlighting of entity def/ref positions wrt. cursor. 
145 

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

64514  147 
occurrences of the formal entity at the caret position. This facilitates 
63977  148 
systematic renaming. 
149 

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

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

152 
theorem statement. 

153 

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

155 
situations where old ASCII notation may be updated. 

156 

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

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

160 
inaccessible via keyboard completion). 

161 

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

164 

165 
src/Pure/ROOT0.ML 

166 
src/Pure/ROOT.ML 

167 
src/Pure/Pure.thy 

168 
src/Pure/ML_Bootstrap.thy 

169 

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

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

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

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

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

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

63307  176 
dependencies of the above files are only observed for batch build. 
62904  177 

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

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

63461  181 

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

185 
new 'abbrevs' section. 

186 

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

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

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

63579  190 

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

193 
keymap; nonconflicting changes are always applied implicitly. This 

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

195 
increases chances that users see new keyboard shortcuts when reusing 

196 
old keymaps. 

197 

63675  198 
* ML and document antiquotations for filesystems paths are more uniform 
199 
and diverse: 

200 

201 
@{path NAME}  no filesystem check 

202 
@{file NAME}  check for plain file 

203 
@{dir NAME}  check for directory 

204 

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

206 
have to be changed. 

63669  207 

208 

63977  209 
*** Document preparation *** 
210 

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

212 

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

215 

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

218 

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

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

221 
derivatives. 

222 

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

224 

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

226 
Isabelle2015). 

227 

228 

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

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

230 

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

233 
'definition', 'inductive', 'function'. 

234 

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

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

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

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

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

240 

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

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

63039  245 

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

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

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

248 

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

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

250 
typesetting. E.g. to produce proof holes in examples and documentation. 
62216  251 

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

254 

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

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

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

258 

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

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

261 
INCOMPATIBILITY. 

62939  262 

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

265 
definitions. 

266 

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

63259  269 

270 
(use facts in simp) 

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

272 

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

275 

62216  276 

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

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

278 

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

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

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

283 

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

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

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

287 
regardless of the actual parameters that are provided. Rare 

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

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

290 

291 
* Typeinference improves sorts of newly introduced type variables for 

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

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

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

295 
INCOMPATIBILITY, need to provide explicit type constraints for Pure 

296 
types where this is really intended. 

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

297 

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

298 

62327  299 
*** HOL *** 
300 

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

303 
propositional logic, goals based on a combination of quantifierfree 

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

305 
quantifierfree propositional logic with linear real arithmetic 

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

307 

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

310 

63977  311 
* Metis: The problem encoding has changed very slightly. This might 
63785  312 
break existing proofs. INCOMPATIBILITY. 
313 

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

315 
 The MaSh relevance filter is now faster than before. 
63116  316 
 Produce syntactically correct Vampire 4.0 problem files. 
317 

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

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

62842  322 
method. See 'isabelle doc corec'. 
63977  323 
 The predicator :: ('a \<Rightarrow> bool) \<Rightarrow> 'a F \<Rightarrow> bool is now a firstclass 
63855  324 
citizen in bounded natural functors. 
62693  325 
 'primrec' now allows nested calls through the predicator in addition 
62327  326 
to the map function. 
63855  327 
 'bnf' automatically discharges reflexive proof obligations. 
62693  328 
 'bnf' outputs a slightly modified proof obligation expressing rel in 
62332  329 
terms of map and set 
63855  330 
(not giving a specification for rel makes this one reflexive). 
62693  331 
 'bnf' outputs a new proof obligation expressing pred in terms of set 
63855  332 
(not giving a specification for pred makes this one reflexive). 
333 
INCOMPATIBILITY: manual 'bnf' declarations may need adjustment. 

62335  334 
 Renamed lemmas: 
335 
rel_prod_apply ~> rel_prod_inject 

336 
pred_prod_apply ~> pred_prod_inject 

337 
INCOMPATIBILITY. 

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

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

341 
INCOMPATIBILITY. 

62327  342 

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

345 
which exposed details of the internal fixpoint construction and was 

346 
hard to use. INCOMPATIBILITY. 

347 

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

349 

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

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

352 

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

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

355 
eliminated altogether. 

356 

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

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

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

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

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

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

363 
INCOMPATIBILITY in rare situations. 

364 

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

366 
INCOMPATIBILITY. 

367 

64390  368 
* Renamed constants and corresponding theorems: 
369 

370 
setsum ~> sum 

371 
setprod ~> prod 

372 
listsum ~> sum_list 

373 
listprod ~> prod_list 

374 

375 
INCOMPATIBILITY. 

376 

377 
* Sligthly more standardized theorem names: 

378 
sgn_times ~> sgn_mult 

379 
sgn_mult' ~> Real_Vector_Spaces.sgn_mult 

380 
divide_zero_left ~> div_0 

381 
zero_mod_left ~> mod_0 

382 
divide_zero ~> div_by_0 

383 
divide_1 ~> div_by_1 

384 
nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left 

385 
div_mult_self1_is_id ~> nonzero_mult_div_cancel_left 

386 
nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right 

387 
div_mult_self2_is_id ~> nonzero_mult_div_cancel_right 

388 
is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left 

389 
is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right 

390 
mod_div_equality ~> div_mult_mod_eq 

391 
mod_div_equality2 ~> mult_div_mod_eq 

392 
mod_div_equality3 ~> mod_div_mult_eq 

393 
mod_div_equality4 ~> mod_mult_div_eq 

394 
minus_div_eq_mod ~> minus_div_mult_eq_mod 

395 
minus_div_eq_mod2 ~> minus_mult_div_eq_mod 

396 
minus_mod_eq_div ~> minus_mod_eq_div_mult 

397 
minus_mod_eq_div2 ~> minus_mod_eq_mult_div 

398 
div_mod_equality' ~> minus_mod_eq_div_mult [symmetric] 

399 
mod_div_equality' ~> minus_div_mult_eq_mod [symmetric] 

400 
zmod_zdiv_equality ~> mult_div_mod_eq [symmetric] 

401 
zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric] 

402 
Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

403 
mult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

404 
zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

405 
div_1 ~> div_by_Suc_0 

406 
mod_1 ~> mod_by_Suc_0 

407 
INCOMPATIBILITY. 

408 

409 
* New type class "idom_abs_sgn" specifies algebraic properties 

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

411 
disappeared. Slight INCOMPATIBILITY. 

412 

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

414 

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

417 

418 
 Logical representation: 

419 
* 0 is instantiated to the ASCII zero character. 

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

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

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

423 
are noncanonical. 

424 
 Printing and parsing: 

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

426 
(as before). 

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

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

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

430 
is parsable for every numeral expression n. 

431 
* Noncanonical characters have no special syntax and are 

432 
printed as their logical representation. 

433 
 Explicit conversions from and to the natural numbers are 

434 
provided as char_of_nat, nat_of_char (as before). 

435 
 The auxiliary nibble type has been discontinued. 

436 

437 
INCOMPATIBILITY. 

438 

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

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

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

442 
infix "mod" syntax. INCOMPATIBILITY. 

443 

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

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

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

448 
easily recovered by composition with eq_refl. Minor INCOMPATIBILITY. 

449 

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

452 

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

454 
which renders those abstract effectively. 

455 

456 
* Command 'export_code' checks given constants for abstraction 

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

458 
interface for the generated code. 

459 

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

461 
spelt out explicitly. 

462 

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

464 
explicitly provided auxiliary definitions for required type class 

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

467 

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

469 
products. 

63977  470 

471 
* Locale bijection establishes convenient default simp rules such as 

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

473 

474 
* Abstract locales semigroup, abel_semigroup, semilattice, 

475 
semilattice_neutr, ordering, ordering_top, semilattice_order, 

476 
semilattice_neutr_order, comm_monoid_set, semilattice_set, 

477 
semilattice_neutr_set, semilattice_order_set, 

478 
semilattice_order_neutr_set monoid_list, comm_monoid_list, 

479 
comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified 

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

481 
INCOMPATIBILITY. 

482 

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

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

485 
lifting_syntax begin ... end". Minor INCOMPATIBILITY. 

486 

63807  487 
* Some old / obsolete theorems have been renamed / removed, potential 
488 
INCOMPATIBILITY. 

489 

490 
nat_less_cases  removed, use linorder_cases instead 

491 
inv_image_comp  removed, use image_inv_f_f instead 

492 
image_surj_f_inv_f ~> image_f_inv_f 

63113  493 

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

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

495 
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

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

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

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

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

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

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

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

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

504 

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

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

506 
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

507 
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

508 
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

509 
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

510 
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

511 
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

512 
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

513 
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

514 
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

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

516 

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

62396  519 

63977  520 
* Added class topological_monoid. 
521 

64391  522 
* The following theorems have been renamed: 
523 

64457  524 
setsum_left_distrib ~> sum_distrib_right 
525 
setsum_right_distrib ~> sum_distrib_left 

64391  526 

527 
INCOMPATIBILITY. 

528 

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

530 
INCOMPATIBILITY. 

531 

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

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

534 
A)". 

535 

536 
* Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY. 

537 

538 
* The type class ordered_comm_monoid_add is now called 

539 
ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add 

540 
is introduced as the combination of ordered_ab_semigroup_add + 

541 
comm_monoid_add. INCOMPATIBILITY. 

542 

543 
* Introduced the type classes canonically_ordered_comm_monoid_add and 

544 
dioid. 

545 

546 
* Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When 

547 
instantiating linordered_semiring_strict and ordered_ab_group_add, an 

548 
explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might 

549 
be required. INCOMPATIBILITY. 

63117  550 

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

553 
lcm_left_commute_nat ~> lcm.left_commute 

554 
lcm_left_commute_int ~> lcm.left_commute 

555 
gcd_left_commute_nat ~> gcd.left_commute 

556 
gcd_left_commute_int ~> gcd.left_commute 

557 
gcd_greatest_iff_nat ~> gcd_greatest_iff 

558 
gcd_greatest_iff_int ~> gcd_greatest_iff 

559 
coprime_dvd_mult_nat ~> coprime_dvd_mult 

560 
coprime_dvd_mult_int ~> coprime_dvd_mult 

561 
zpower_numeral_even ~> power_numeral_even 

562 
gcd_mult_cancel_nat ~> gcd_mult_cancel 

563 
gcd_mult_cancel_int ~> gcd_mult_cancel 

564 
div_gcd_coprime_nat ~> div_gcd_coprime 

565 
div_gcd_coprime_int ~> div_gcd_coprime 

566 
zpower_numeral_odd ~> power_numeral_odd 

567 
zero_less_int_conv ~> of_nat_0_less_iff 

568 
gcd_greatest_nat ~> gcd_greatest 

569 
gcd_greatest_int ~> gcd_greatest 

570 
coprime_mult_nat ~> coprime_mult 

571 
coprime_mult_int ~> coprime_mult 

572 
lcm_commute_nat ~> lcm.commute 

573 
lcm_commute_int ~> lcm.commute 

574 
int_less_0_conv ~> of_nat_less_0_iff 

575 
gcd_commute_nat ~> gcd.commute 

576 
gcd_commute_int ~> gcd.commute 

577 
Gcd_insert_nat ~> Gcd_insert 

578 
Gcd_insert_int ~> Gcd_insert 

579 
of_int_int_eq ~> of_int_of_nat_eq 

580 
lcm_least_nat ~> lcm_least 

581 
lcm_least_int ~> lcm_least 

582 
lcm_assoc_nat ~> lcm.assoc 

583 
lcm_assoc_int ~> lcm.assoc 

584 
int_le_0_conv ~> of_nat_le_0_iff 

585 
int_eq_0_conv ~> of_nat_eq_0_iff 

586 
Gcd_empty_nat ~> Gcd_empty 

587 
Gcd_empty_int ~> Gcd_empty 

588 
gcd_assoc_nat ~> gcd.assoc 

589 
gcd_assoc_int ~> gcd.assoc 

590 
zero_zle_int ~> of_nat_0_le_iff 

591 
lcm_dvd2_nat ~> dvd_lcm2 

592 
lcm_dvd2_int ~> dvd_lcm2 

593 
lcm_dvd1_nat ~> dvd_lcm1 

594 
lcm_dvd1_int ~> dvd_lcm1 

595 
gcd_zero_nat ~> gcd_eq_0_iff 

596 
gcd_zero_int ~> gcd_eq_0_iff 

597 
gcd_dvd2_nat ~> gcd_dvd2 

598 
gcd_dvd2_int ~> gcd_dvd2 

599 
gcd_dvd1_nat ~> gcd_dvd1 

600 
gcd_dvd1_int ~> gcd_dvd1 

601 
int_numeral ~> of_nat_numeral 

602 
lcm_ac_nat ~> ac_simps 

603 
lcm_ac_int ~> ac_simps 

604 
gcd_ac_nat ~> ac_simps 

605 
gcd_ac_int ~> ac_simps 

606 
abs_int_eq ~> abs_of_nat 

607 
zless_int ~> of_nat_less_iff 

608 
zdiff_int ~> of_nat_diff 

609 
zadd_int ~> of_nat_add 

610 
int_mult ~> of_nat_mult 

611 
int_Suc ~> of_nat_Suc 

612 
inj_int ~> inj_of_nat 

613 
int_1 ~> of_nat_1 

614 
int_0 ~> of_nat_0 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

637 
coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff 
62348  638 
realpow_minus_mult ~> power_minus_mult 
639 
realpow_Suc_le_self ~> power_Suc_le_self 

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

640 
dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest 
62347  641 
INCOMPATIBILITY. 
642 

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

643 
* Renamed HOL/Quotient_Examples/FSet.thy to 
63977  644 
HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY. 
645 

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

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

649 
"unbundle finfun_syntax" to imitate import of 

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

651 

652 
* Session HOLLibrary: theory Multiset_Permutations (executably) defines 

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

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

655 
once. 

656 

657 
* Session HOLLibrary: multiset membership is now expressed using 

658 
set_mset rather than count. 

659 

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

661 
by default. 

662 

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

664 
equations count_eq_zero_iff and not_in_iff. 

665 

666 
 Rules count_inI and in_countE obtain facts of the form 

667 
"count M a = n" from membership. 

668 

669 
 Rules count_in_diffI and in_diff_countE obtain facts of the form 

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

671 

672 
INCOMPATIBILITY. 

673 

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

675 
displaying equations in functional programming style  variables 

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

677 
underscores. 

678 

679 
* Session HOLLibrary: theory Combinator_PER provides combinator to 

680 
build partial equivalence relations from a predicate and an equivalence 

681 
relation. 

682 

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

684 
everywhere fix bijections. 

685 

686 
* Session HOLLibrary: theory Normalized_Fraction allows viewing an 

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

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

689 
denominator is normalized wrt. unit factors). 

690 

691 
* Session HOLNSA has been renamed to HOLNonstandard_Analysis. 

692 

693 
* Session HOLMultivariate_Analysis has been renamed to HOLAnalysis. 

694 

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

696 
HOLProbability. When importing HOLAnalysis some theorems need 

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

698 

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

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

701 
principle, Residue theorem, Schwarz Lemma. 

702 

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

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

705 

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

707 
libraries: homeomorphisms, continuous function extensions, invariance of 

708 
domain. 

709 

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

711 
changed from ereal to ennreal, INCOMPATIBILITY. 

712 

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

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

715 

716 
* Session HOLProbability: Code generation and QuickCheck for 

717 
Probability Mass Functions. 

718 

719 
* Session HOLProbability: theory Random_Permutations contains some 

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

721 
folding over a list in random order. 

722 

723 
* Session HOLProbability: theory SPMF formalises discrete 

724 
subprobability distributions. 

725 

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

727 
normalised to distinguish which ordering the theorems are about 

728 

729 
mset_less_eqI ~> mset_subset_eqI 

730 
mset_less_insertD ~> mset_subset_insertD 

731 
mset_less_eq_count ~> mset_subset_eq_count 

732 
mset_less_diff_self ~> mset_subset_diff_self 

733 
mset_le_exists_conv ~> mset_subset_eq_exists_conv 

734 
mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel 

735 
mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel 

736 
mset_le_mono_add ~> mset_subset_eq_mono_add 

737 
mset_le_add_left ~> mset_subset_eq_add_left 

738 
mset_le_add_right ~> mset_subset_eq_add_right 

739 
mset_le_single ~> mset_subset_eq_single 

740 
mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute 

741 
diff_le_self ~> diff_subset_eq_self 

742 
mset_leD ~> mset_subset_eqD 

743 
mset_lessD ~> mset_subsetD 

744 
mset_le_insertD ~> mset_subset_eq_insertD 

745 
mset_less_of_empty ~> mset_subset_of_empty 

746 
mset_less_size ~> mset_subset_size 

747 
wf_less_mset_rel ~> wf_subset_mset_rel 

748 
count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq 

749 
mset_remdups_le ~> mset_remdups_subset_eq 

750 
ms_lesseq_impl ~> subset_eq_mset_impl 

751 

752 
Some functions have been renamed: 

753 
ms_lesseq_impl > subset_eq_mset_impl 

754 

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

756 
#\<subseteq># ~> \<le> 

757 
#\<subset># ~> < 

758 
le_multiset ~> less_eq_multiset 

759 
less_multiset ~> le_multiset 

760 
INCOMPATIBILITY. 

761 

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

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

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

765 
interpretations "multiset_linorder" and "multiset_wellorder" have been 

766 
replaced by instantiations. INCOMPATIBILITY. 

767 

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

769 
been renamed: 

770 

771 
le_multiset_def ~> less_eq_multiset_def 

772 
less_multiset_def ~> le_multiset_def 

773 
less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset 

774 
mult_less_not_refl ~> mset_le_not_refl 

775 
mult_less_trans ~> mset_le_trans 

776 
mult_less_not_sym ~> mset_le_not_sym 

777 
mult_less_asym ~> mset_le_asym 

778 
mult_less_irrefl ~> mset_le_irrefl 

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

780 

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

782 
le_multiset_total ~> less_eq_multiset_total 

783 
less_multiset_right_total ~> subset_eq_imp_le_multiset 

784 
le_multiset_empty_left ~> less_eq_multiset_empty_left 

785 
le_multiset_empty_right ~> less_eq_multiset_empty_right 

786 
less_multiset_empty_right ~> le_multiset_empty_left 

787 
less_multiset_empty_left ~> le_multiset_empty_right 

788 
union_less_diff_plus ~> union_le_diff_plus 

789 
ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset 

790 
less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty 

791 
le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty 

792 
INCOMPATIBILITY. 

793 

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

795 
INCOMPATIBILITY. 

796 

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

798 
INCOMPATIBILITY, use the following replacements: 

799 

800 
le_multiset_plus_plus_left_iff ~> add_less_cancel_right 

801 
less_multiset_plus_plus_left_iff ~> add_less_cancel_right 

802 
le_multiset_plus_plus_right_iff ~> add_less_cancel_left 

803 
less_multiset_plus_plus_right_iff ~> add_less_cancel_left 

804 
add_eq_self_empty_iff ~> add_cancel_left_right 

805 
mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right 

806 
mset_less_add_bothsides ~> subset_mset.add_less_cancel_right 

807 
mset_le_add_bothsides ~> subset_mset.add_less_cancel_right 

808 
empty_inter ~> subset_mset.inf_bot_left 

809 
inter_empty ~> subset_mset.inf_bot_right 

810 
empty_sup ~> subset_mset.sup_bot_left 

811 
sup_empty ~> subset_mset.sup_bot_right 

812 
bdd_below_multiset ~> subset_mset.bdd_above_bot 

813 
subset_eq_empty ~> subset_mset.le_zero_eq 

814 
le_empty ~> subset_mset.le_zero_eq 

815 
mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero 

816 
mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero 

817 

818 
* Session HOLLibrary: some typeclass constraints about multisets have 

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

820 
additional typeclasses order_bot, no_top, 

821 
ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add, 

822 
linordered_cancel_ab_semigroup_add, and 

823 
ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY. 

824 

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

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

827 
INCOMPATIBILITY. 

828 

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

830 
interpretations ordered_ab_semigroup_monoid_add_imp_le and 

831 
bounded_lattice_bot. INCOMPATIBILITY. 

832 

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

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

835 
removed or changed: 

836 

837 
single_not_empty ~> add_mset_not_empty or empty_not_add_mset 

838 
fold_mset_insert ~> fold_mset_add_mset 

839 
image_mset_insert ~> image_mset_add_mset 

840 
union_single_eq_diff 

841 
multi_self_add_other_not_self 

842 
diff_single_eq_union 

843 
INCOMPATIBILITY. 

844 

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

846 
to use add_mset instead of single: 

847 

848 
mset_add 

849 
multi_self_add_other_not_self 

850 
diff_single_eq_union 

851 
union_single_eq_diff 

852 
union_single_eq_member 

853 
add_eq_conv_diff 

854 
insert_noteq_member 

855 
add_eq_conv_ex 

856 
multi_member_split 

857 
multiset_add_sub_el_shuffle 

858 
mset_subset_eq_insertD 

859 
mset_subset_insertD 

860 
insert_subset_eq_iff 

861 
insert_union_subset_iff 

862 
multi_psub_of_add_self 

863 
inter_add_left1 

864 
inter_add_left2 

865 
inter_add_right1 

866 
inter_add_right2 

867 
sup_union_left1 

868 
sup_union_left2 

869 
sup_union_right1 

870 
sup_union_right2 

871 
size_eq_Suc_imp_eq_union 

872 
multi_nonempty_split 

873 
mset_insort 

874 
mset_update 

875 
mult1I 

876 
less_add 

877 
mset_zip_take_Cons_drop_twice 

878 
rel_mset_Zero 

879 
msed_map_invL 

880 
msed_map_invR 

881 
msed_rel_invL 

882 
msed_rel_invR 

883 
le_multiset_right_total 

884 
multiset_induct 

885 
multiset_induct2_size 

886 
multiset_induct2 

887 
INCOMPATIBILITY. 

888 

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

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

891 
element: 

892 

893 
image_mset 

894 
mset 

895 
replicate_mset 

896 
mult1 

897 
pred_mset 

898 
rel_mset' 

899 
mset_insort 

900 

901 
INCOMPATIBILITY. 

902 

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

904 
attributes of some multiset theorems have been changed: 

905 

906 
insert_DiffM [] ~> [simp] 

907 
insert_DiffM2 [simp] ~> [] 

908 
diff_add_mset_swap [simp] 

909 
fold_mset_add_mset [simp] 

910 
diff_diff_add [simp] (for multisets only) 

911 
diff_cancel [simp] ~> [] 

912 
count_single [simp] ~> [] 

913 
set_mset_single [simp] ~> [] 

914 
size_multiset_single [simp] ~> [] 

915 
size_single [simp] ~> [] 

916 
image_mset_single [simp] ~> [] 

917 
mset_subset_eq_mono_add_right_cancel [simp] ~> [] 

918 
mset_subset_eq_mono_add_left_cancel [simp] ~> [] 

919 
fold_mset_single [simp] ~> [] 

920 
subset_eq_empty [simp] ~> [] 

921 
empty_sup [simp] ~> [] 

922 
sup_empty [simp] ~> [] 

923 
inter_empty [simp] ~> [] 

924 
empty_inter [simp] ~> [] 

925 
INCOMPATIBILITY. 

926 

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

930 
INCOMPATIBILITY. 

931 

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

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

934 
natural numbers. INCOMPATIBILITY. 

935 

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

937 
multisets: 

938 

939 
msetsum ~> sum_mset 

940 
msetprod ~> prod_mset 

941 

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

943 
and union of multisets have been changed: 

944 

945 
#\<inter> ~> \<inter># 

946 
#\<union> ~> \<union># 

947 

948 
INCOMPATIBILITY. 

949 

950 
* Session HOLLibrary, theory Multiset: the lemma 

951 
one_step_implies_mult_aux on multisets has been removed, use 

952 
one_step_implies_mult instead. INCOMPATIBILITY. 

953 

954 
* Session HOLLibrary: theory Complete_Partial_Order2 provides reasoning 

955 
support for monotonicity and continuity in chaincomplete partial orders 

956 
and about admissibility conditions for fixpoint inductions. 

957 

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

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

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

962 
future different type class instantiation for polynomials over factorial 

963 
rings. INCOMPATIBILITY. 

64390  964 

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

966 
the following renaming 

967 

968 
prefixeq > prefix 

969 
prefix > strict_prefix 

970 
suffixeq > suffix 

971 
suffix > strict_suffix 

972 

973 
Added theory of longest common prefixes. 

64389  974 

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

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

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

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

980 
"prime_nat_iff". INCOMPATIBILITY. 

981 

982 
* Session Old_Number_Theory has been removed, after porting remaining 

983 
theories. 

984 

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

987 

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

988 

62498  989 
*** ML *** 
990 

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

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

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

995 
INCOMPATIBILITY. 

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

996 

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

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

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

1004 

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

1007 

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

1009 
with approximative output quality. 

1010 

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

1012 
exposed to Isabelle/ML userspace. Potential INCOMPATIBILITY. 

1013 

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

1016 
requiring separate files. 

1017 

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

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

1021 
debugger information requires consirable time and space: main 

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

1023 

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

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

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

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

1029 
balanced blocks of Local_Theory.open_target versus 

1030 
Local_Theory.close_target instead. Rare INCOMPATIBILITY. 

1031 

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

1034 
INCOMPATIBILITY. 

1035 

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

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

1039 
File.full_path). Potential INCOMPATIBILITY. 

1040 

63352  1041 
* Binding.empty_atts supersedes Thm.empty_binding and 
1042 
Attrib.empty_binding. Minor INCOMPATIBILITY. 

1043 

62498  1044 

62354  1045 
*** System *** 
1046 

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

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

1050 
much less disk space. 

63226  1051 

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

1054 
particular: 

1055 

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

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

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

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

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

1060 

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

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

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

1064 

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

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

1066 
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

1067 
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

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

1069 

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

1072 
servers with separate CPU/memory modules. 

1073 

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

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

64274  1076 
unless there is already a default provided via ML_OPTIONS settings. 
1077 

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

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

1079 
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

1080 
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

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

1082 

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

1086 
resulting log files. 

64308  1087 

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

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

1089 
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

1090 
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

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

1092 

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

1095 

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

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

1098 
Isabelle/ML or Isabelle/Scala. 

1099 

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

1101 
settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64, 

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

1103 
ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been 

1104 
discontinued. Potential INCOMPATIBILITY. 

1105 

1106 
* The Isabelle system environment always ensures that the main 

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

1108 
"isabelle_scala_script". 

1109 

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

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

1112 
Isabelle_Tool.Body. 

1113 

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

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

1116 
produce robust shell scripts under program control, without worrying 

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

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

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

1120 
been discontinued. 

1121 

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

1124 
but without the Isabelle settings environment. 

1125 

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

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

1129 
that Path specifications need to be resolved remotely via 

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

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

1132 

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

1134 
regular hg commandline interface. The repositroy clone and working 

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

1136 
connection). 

64265  1137 

62354  1138 

1139 

62031  1140 
New in Isabelle2016 (February 2016) 
62016  1141 
 
60138  1142 

61337  1143 
*** General *** 
1144 

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

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

1146 
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

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

1148 
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

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

1150 

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

1153 

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

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

1157 
has been removed (see below). 

1158 

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

62017  1161 

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

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

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

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

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

1166 

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

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

1168 
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

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

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

1171 

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

1174 
to update old sources. 

1175 

61337  1176 
* Toplevel theorem statements have been simplified as follows: 
1177 

1178 
theorems ~> lemmas 

1179 
schematic_lemma ~> schematic_goal 

1180 
schematic_theorem ~> schematic_goal 

1181 
schematic_corollary ~> schematic_goal 

1182 

1183 
Commandline tool "isabelle update_theorems" updates theory sources 

1184 
accordingly. 

1185 

61338  1186 
* Toplevel theorem statement 'proposition' is another alias for 
1187 
'theorem'. 

1188 

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

1191 
deferred definitions require a surrounding 'overloading' block. 

1192 

61337  1193 

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

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

1195 

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

1199 
'SML_file_no_debug' control compilation of sources with or without 

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

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

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

1203 
any effect on the running ML program. 

60984  1204 

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

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

1208 
update. 

61729  1209 

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

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

1212 
enable option "editor_output_state". 

61215  1213 

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

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

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

1218 
visibility. 

1219 

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

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

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

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

1224 
panel. 

1225 

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

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

1227 
state output, interactive queries) wrt. longrunning background tasks. 
62017  1228 

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

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

1231 
implicit: a popup will show up unconditionally. 

1232 

1233 
* Additional abbreviations for syntactic completion may be specified in 

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

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

1236 

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

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

1238 
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

1239 
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

1240 
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

1241 

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

1244 
the editor. 

1245 

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

1247 
instead of former C+e LEFT. 

1248 

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

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

1251 
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

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

1253 

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

1256 
singleinstance applications seen on common GUI desktops. 

1257 

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

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

1259 
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

1260 
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

1261 

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

1264 

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

1267 

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

1268 

61405  1269 
*** Document preparation *** 
1270 

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

1273 

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

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

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

1277 

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

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

1280 
follows: 

1281 

1282 
\<^item> itemize 

1283 
\<^enum> enumerate 

1284 
\<^descr> description 

1285 

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

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

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

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

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

1292 

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

1295 
standard LaTeX macros of the same names. 

1296 

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

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

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

1301 
cartouche tokens seen in theory sources. 

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

1302 

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

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

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

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

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

1308 

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

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

1312 

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

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

1315 

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

1317 

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

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

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

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

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

1323 
documentation, with a hyperlink in the Prover IDE. 

1324 

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

1326 
entities of the Isar language. 

1327 

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

61488  1330 
print mode "HTML" loses its special meaning. 
61471  1331 

61405  1332 

60406  1333 
*** Isar *** 
1334 

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

1337 
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

1338 
example: 
60414  1339 

1340 
have result: "C x y" 

1341 
if "A x" and "B y" 

1342 
for x :: 'a and y :: 'a 

1343 
<proof> 

1344 

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

60414  1347 
corresponds to a raw proof block like this: 
1348 

1349 
{ 

1350 
fix x :: 'a and y :: 'a 

60449  1351 
assume that: "A x" "B y" 
60414  1352 
have "C x y" <proof> 
1353 
} 

1354 
note result = this 

60406  1355 

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

1356 
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

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

1358 

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

61658  1361 

1362 
assume result: "C x y" 

1363 
if "A x" and "B y" 

1364 
for x :: 'a and y :: 'a 

1365 

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

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

1368 

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

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

1371 
example: 

1372 

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

1374 

1375 
is equivalent to: 

1376 

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

1378 

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

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

60595  1383 

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

1385 

1386 
or: 

1387 

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

1389 

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

1391 

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

1393 

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

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

1397 
of the local context elements yet. 

1398 

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

1401 

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

1403 
then have something 

1404 
proof cases 

1405 
case a 

1406 
then show ?thesis <proof> 

1407 
next 

1408 
case b 

1409 
then show ?thesis <proof> 

1410 
next 

1411 
case c 

1412 
then show ?thesis <proof> 

1413 
qed 

1414 

60565  1415 
* Command 'case' allows fact name and attribute specification like this: 
1416 

1417 
case a: (c xs) 

1418 
case a [attributes]: (c xs) 

1419 

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

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

1422 
form "case (c xs) [attributes]" is no longer supported. Rare 

1423 
INCOMPATIBILITY, need to adapt uses of case facts in exotic situations, 

1424 
and always put attributes in front. 

1425 

60618
4c79543cc376
renamed "default" to "standard", to make semantically clear what it is;
wenzelm
parents:
60617
diff
changeset

1426 
* The standard proof method of commands 'proof' and '..' is now called 
4c79543cc376
renamed "default" to "standard", to make semantically clear what it is;
wenzelm
parents:
60617
diff
changeset

1427 
"standard" to make semantically clear what it is; the old name "default" 
4c79543cc376
renamed "default" to "standard", to make semantically clear what it is;
wenzelm
parents:
60617
diff
changeset

1428 
is still available as legacy for some time. Documentation now explains 
4c79543cc376
renamed "default" to "standard", to make semantically clear what it is;
wenzelm
parents:
60617
diff
changeset

1429 
'..' more accurately as "by standard" instead of "by rule". 
4c79543cc376
renamed "default" to "standard", to make semantically clear what it is;
wenzelm
parents:
60617
diff
changeset

1430 

62017  1431 
* Nesting of Isar goal structure has been clarified: the context after 
1432 
the initial backwards refinement is retained for the whole proof, within 

1433 
all its context sections (as indicated via 'next'). This is e.g. 

1434 
relevant for 'using', 'including', 'supply': 

1435 

1436 
have "A \<and> A" if a: A for A 
