author  blanchet 
Wed, 11 Jan 2017 16:43:31 +0100  
changeset 64876  65a247444100 
parent 64867  e7220f4de11f 
child 64898  49aa13b1b592 
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 

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

18 
changes of formal document content. Theory dependencies are always 

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

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

21 
effectively always enabled. 

22 

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

25 
buffers. 

26 

64602  27 

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

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

29 

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

32 

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

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

36 

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

39 
unique_euclidean_(semi)ring; instantiation requires 

40 
provision of a euclidean size. 

41 

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

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

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

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

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

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

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

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

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

50 

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

53 
INCOMPATIBILITY. 

54 

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

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

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

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

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

59 

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

60 
* Generalized some facts: 
64876  61 
measure_induct_rule 
62 
measure_induct 

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

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

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

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

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

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

68 

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

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

70 
 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

71 
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

72 
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

73 

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

76 

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

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

78 
bij_swap_ompose_bij ~> bij_swap_compose_bij 
64602  79 

60331  80 

64844  81 
*** System *** 
82 

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

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

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

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

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

88 
frontends. 

89 

90 

64072  91 
New in Isabelle20161 (December 2016) 
92 
 

62216  93 

62440  94 
*** General *** 
95 

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

98 
INCOMPATIBILITY. 

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

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

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

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

103 
result the subgoal may be split into several subgoals. 

104 

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

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

108 

109 
bundle foo 

110 
begin 

111 
declare a [simp] 

112 
declare b [intro] 

113 
end 

63272  114 

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

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

118 

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

121 
discontinued. 

122 

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

124 
delimited uniformly via cartouches. This works better than oldfashioned 

125 
quotes when sublanguages are nested. 

126 

127 
* Mixfix annotations support general block properties, with syntax 

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

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

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

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

63650  132 

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

135 

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

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

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

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

141 
examples. 

142 

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

144 
instances) are generated into companion object of corresponding type 

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

146 

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

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

149 

64602  150 

62904  151 
*** Prover IDE  Isabelle/Scala/jEdit *** 
152 

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

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

156 
reactivity and CPU usage. 

157 

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

160 
command keywords and some command substructure. Action 

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

162 
according to command keywords only; see also option 

163 
"jedit_indent_newline". 

164 

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

166 
number of subgoals. This requires information of ongoing document 

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

168 
quickly; see also option "jedit_script_indent" and 

169 
"jedit_script_indent_limit". 

170 

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

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

173 
structure of theory specifications is treated as well. 

174 

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

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

177 

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

179 
e.g. 'context', 'notepad'. 

180 

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

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

183 

63977  184 
* Highlighting of entity def/ref positions wrt. cursor. 
185 

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

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

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

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

192 
theorem statement. 

193 

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

195 
situations where old ASCII notation may be updated. 

196 

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

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

200 
inaccessible via keyboard completion). 

201 

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

204 

205 
src/Pure/ROOT0.ML 

206 
src/Pure/ROOT.ML 

207 
src/Pure/Pure.thy 

208 
src/Pure/ML_Bootstrap.thy 

209 

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

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

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

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

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

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

63307  216 
dependencies of the above files are only observed for batch build. 
62904  217 

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

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

63461  221 

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

225 
new 'abbrevs' section. 

226 

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

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

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

63579  230 

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

233 
keymap; nonconflicting changes are always applied implicitly. This 

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

235 
increases chances that users see new keyboard shortcuts when reusing 

236 
old keymaps. 

237 

63675  238 
* ML and document antiquotations for filesystems paths are more uniform 
239 
and diverse: 

240 

241 
@{path NAME}  no filesystem check 

242 
@{file NAME}  check for plain file 

243 
@{dir NAME}  check for directory 

244 

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

246 
have to be changed. 

63669  247 

248 

63977  249 
*** Document preparation *** 
250 

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

252 

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

255 

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

258 

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

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

261 
derivatives. 

262 

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

264 

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

266 
Isabelle2015). 

267 

268 

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

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

270 

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

273 
'definition', 'inductive', 'function'. 

274 

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

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

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

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

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

280 

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

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

63039  285 

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

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

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

288 

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

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

290 
typesetting. E.g. to produce proof holes in examples and documentation. 
62216  291 

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

294 

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

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

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

298 

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

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

301 
INCOMPATIBILITY. 

62939  302 

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

305 
definitions. 

306 

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

63259  309 

310 
(use facts in simp) 

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

312 

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

315 

62216  316 

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

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

318 

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

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

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

323 

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

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

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

327 
regardless of the actual parameters that are provided. Rare 

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

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

330 

331 
* Typeinference improves sorts of newly introduced type variables for 

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

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

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

335 
INCOMPATIBILITY, need to provide explicit type constraints for Pure 

336 
types where this is really intended. 

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

337 

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

338 

62327  339 
*** HOL *** 
340 

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

343 
propositional logic, goals based on a combination of quantifierfree 

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

345 
quantifierfree propositional logic with linear real arithmetic 

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

347 

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

350 

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

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

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

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

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

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

62335  374 
 Renamed lemmas: 
375 
rel_prod_apply ~> rel_prod_inject 

376 
pred_prod_apply ~> pred_prod_inject 

377 
INCOMPATIBILITY. 

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

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

381 
INCOMPATIBILITY. 

62327  382 

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

385 
which exposed details of the internal fixpoint construction and was 

386 
hard to use. INCOMPATIBILITY. 

387 

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

389 

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

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

392 

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

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

395 
eliminated altogether. 

396 

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

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

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

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

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

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

403 
INCOMPATIBILITY in rare situations. 

404 

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

406 
INCOMPATIBILITY. 

407 

64390  408 
* Renamed constants and corresponding theorems: 
409 

410 
setsum ~> sum 

411 
setprod ~> prod 

412 
listsum ~> sum_list 

413 
listprod ~> prod_list 

414 

415 
INCOMPATIBILITY. 

416 

417 
* Sligthly more standardized theorem names: 

418 
sgn_times ~> sgn_mult 

419 
sgn_mult' ~> Real_Vector_Spaces.sgn_mult 

420 
divide_zero_left ~> div_0 

421 
zero_mod_left ~> mod_0 

422 
divide_zero ~> div_by_0 

423 
divide_1 ~> div_by_1 

424 
nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left 

425 
div_mult_self1_is_id ~> nonzero_mult_div_cancel_left 

426 
nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right 

427 
div_mult_self2_is_id ~> nonzero_mult_div_cancel_right 

428 
is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left 

429 
is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right 

430 
mod_div_equality ~> div_mult_mod_eq 

431 
mod_div_equality2 ~> mult_div_mod_eq 

432 
mod_div_equality3 ~> mod_div_mult_eq 

433 
mod_div_equality4 ~> mod_mult_div_eq 

434 
minus_div_eq_mod ~> minus_div_mult_eq_mod 

435 
minus_div_eq_mod2 ~> minus_mult_div_eq_mod 

436 
minus_mod_eq_div ~> minus_mod_eq_div_mult 

437 
minus_mod_eq_div2 ~> minus_mod_eq_mult_div 

438 
div_mod_equality' ~> minus_mod_eq_div_mult [symmetric] 

439 
mod_div_equality' ~> minus_div_mult_eq_mod [symmetric] 

440 
zmod_zdiv_equality ~> mult_div_mod_eq [symmetric] 

441 
zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric] 

442 
Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

443 
mult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

444 
zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

445 
div_1 ~> div_by_Suc_0 

446 
mod_1 ~> mod_by_Suc_0 

447 
INCOMPATIBILITY. 

448 

449 
* New type class "idom_abs_sgn" specifies algebraic properties 

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

451 
disappeared. Slight INCOMPATIBILITY. 

452 

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

454 

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

457 

458 
 Logical representation: 

459 
* 0 is instantiated to the ASCII zero character. 

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

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

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

463 
are noncanonical. 

464 
 Printing and parsing: 

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

466 
(as before). 

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

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

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

470 
is parsable for every numeral expression n. 

471 
* Noncanonical characters have no special syntax and are 

472 
printed as their logical representation. 

473 
 Explicit conversions from and to the natural numbers are 

474 
provided as char_of_nat, nat_of_char (as before). 

475 
 The auxiliary nibble type has been discontinued. 

476 

477 
INCOMPATIBILITY. 

478 

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

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

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

482 
infix "mod" syntax. INCOMPATIBILITY. 

483 

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

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

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

488 
easily recovered by composition with eq_refl. Minor INCOMPATIBILITY. 

489 

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

492 

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

494 
which renders those abstract effectively. 

495 

496 
* Command 'export_code' checks given constants for abstraction 

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

498 
interface for the generated code. 

499 

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

501 
spelt out explicitly. 

502 

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

504 
explicitly provided auxiliary definitions for required type class 

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

507 

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

509 
products. 

63977  510 

511 
* Locale bijection establishes convenient default simp rules such as 

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

513 

514 
* Abstract locales semigroup, abel_semigroup, semilattice, 

515 
semilattice_neutr, ordering, ordering_top, semilattice_order, 

516 
semilattice_neutr_order, comm_monoid_set, semilattice_set, 

517 
semilattice_neutr_set, semilattice_order_set, 

518 
semilattice_order_neutr_set monoid_list, comm_monoid_list, 

519 
comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified 

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

521 
INCOMPATIBILITY. 

522 

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

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

525 
lifting_syntax begin ... end". Minor INCOMPATIBILITY. 

526 

63807  527 
* Some old / obsolete theorems have been renamed / removed, potential 
528 
INCOMPATIBILITY. 

529 

530 
nat_less_cases  removed, use linorder_cases instead 

531 
inv_image_comp  removed, use image_inv_f_f instead 

532 
image_surj_f_inv_f ~> image_f_inv_f 

63113  533 

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

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

535 
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

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

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

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

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

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

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

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

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

544 

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

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

546 
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

547 
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

548 
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

549 
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

550 
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

551 
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

552 
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

553 
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

554 
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

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

556 

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

62396  559 

63977  560 
* Added class topological_monoid. 
561 

64391  562 
* The following theorems have been renamed: 
563 

64457  564 
setsum_left_distrib ~> sum_distrib_right 
565 
setsum_right_distrib ~> sum_distrib_left 

64391  566 

567 
INCOMPATIBILITY. 

568 

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

570 
INCOMPATIBILITY. 

571 

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

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

574 
A)". 

575 

576 
* Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY. 

577 

578 
* The type class ordered_comm_monoid_add is now called 

579 
ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add 

580 
is introduced as the combination of ordered_ab_semigroup_add + 

581 
comm_monoid_add. INCOMPATIBILITY. 

582 

583 
* Introduced the type classes canonically_ordered_comm_monoid_add and 

584 
dioid. 

585 

586 
* Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When 

587 
instantiating linordered_semiring_strict and ordered_ab_group_add, an 

588 
explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might 

589 
be required. INCOMPATIBILITY. 

63117  590 

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

593 
lcm_left_commute_nat ~> lcm.left_commute 

594 
lcm_left_commute_int ~> lcm.left_commute 

595 
gcd_left_commute_nat ~> gcd.left_commute 

596 
gcd_left_commute_int ~> gcd.left_commute 

597 
gcd_greatest_iff_nat ~> gcd_greatest_iff 

598 
gcd_greatest_iff_int ~> gcd_greatest_iff 

599 
coprime_dvd_mult_nat ~> coprime_dvd_mult 

600 
coprime_dvd_mult_int ~> coprime_dvd_mult 

601 
zpower_numeral_even ~> power_numeral_even 

602 
gcd_mult_cancel_nat ~> gcd_mult_cancel 

603 
gcd_mult_cancel_int ~> gcd_mult_cancel 

604 
div_gcd_coprime_nat ~> div_gcd_coprime 

605 
div_gcd_coprime_int ~> div_gcd_coprime 

606 
zpower_numeral_odd ~> power_numeral_odd 

607 
zero_less_int_conv ~> of_nat_0_less_iff 

608 
gcd_greatest_nat ~> gcd_greatest 

609 
gcd_greatest_int ~> gcd_greatest 

610 
coprime_mult_nat ~> coprime_mult 

611 
coprime_mult_int ~> coprime_mult 

612 
lcm_commute_nat ~> lcm.commute 

613 
lcm_commute_int ~> lcm.commute 

614 
int_less_0_conv ~> of_nat_less_0_iff 

615 
gcd_commute_nat ~> gcd.commute 

616 
gcd_commute_int ~> gcd.commute 

617 
Gcd_insert_nat ~> Gcd_insert 

618 
Gcd_insert_int ~> Gcd_insert 

619 
of_int_int_eq ~> of_int_of_nat_eq 

620 
lcm_least_nat ~> lcm_least 

621 
lcm_least_int ~> lcm_least 

622 
lcm_assoc_nat ~> lcm.assoc 

623 
lcm_assoc_int ~> lcm.assoc 

624 
int_le_0_conv ~> of_nat_le_0_iff 

625 
int_eq_0_conv ~> of_nat_eq_0_iff 

626 
Gcd_empty_nat ~> Gcd_empty 

627 
Gcd_empty_int ~> Gcd_empty 

628 
gcd_assoc_nat ~> gcd.assoc 

629 
gcd_assoc_int ~> gcd.assoc 

630 
zero_zle_int ~> of_nat_0_le_iff 

631 
lcm_dvd2_nat ~> dvd_lcm2 

632 
lcm_dvd2_int ~> dvd_lcm2 

633 
lcm_dvd1_nat ~> dvd_lcm1 

634 
lcm_dvd1_int ~> dvd_lcm1 

635 
gcd_zero_nat ~> gcd_eq_0_iff 

636 
gcd_zero_int ~> gcd_eq_0_iff 

637 
gcd_dvd2_nat ~> gcd_dvd2 

638 
gcd_dvd2_int ~> gcd_dvd2 

639 
gcd_dvd1_nat ~> gcd_dvd1 

640 
gcd_dvd1_int ~> gcd_dvd1 

641 
int_numeral ~> of_nat_numeral 

642 
lcm_ac_nat ~> ac_simps 

643 
lcm_ac_int ~> ac_simps 

644 
gcd_ac_nat ~> ac_simps 

645 
gcd_ac_int ~> ac_simps 

646 
abs_int_eq ~> abs_of_nat 

647 
zless_int ~> of_nat_less_iff 

648 
zdiff_int ~> of_nat_diff 

649 
zadd_int ~> of_nat_add 

650 
int_mult ~> of_nat_mult 

651 
int_Suc ~> of_nat_Suc 

652 
inj_int ~> inj_of_nat 

653 
int_1 ~> of_nat_1 

654 
int_0 ~> of_nat_0 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

677 
coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff 
62348  678 
realpow_minus_mult ~> power_minus_mult 
679 
realpow_Suc_le_self ~> power_Suc_le_self 

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

680 
dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest 
62347  681 
INCOMPATIBILITY. 
682 

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

683 
* Renamed HOL/Quotient_Examples/FSet.thy to 
63977  684 
HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY. 
685 

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

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

689 
"unbundle finfun_syntax" to imitate import of 

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

691 

692 
* Session HOLLibrary: theory Multiset_Permutations (executably) defines 

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

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

695 
once. 

696 

697 
* Session HOLLibrary: multiset membership is now expressed using 

698 
set_mset rather than count. 

699 

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

701 
by default. 

702 

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

704 
equations count_eq_zero_iff and not_in_iff. 

705 

706 
 Rules count_inI and in_countE obtain facts of the form 

707 
"count M a = n" from membership. 

708 

709 
 Rules count_in_diffI and in_diff_countE obtain facts of the form 

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

711 

712 
INCOMPATIBILITY. 

713 

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

715 
displaying equations in functional programming style  variables 

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

717 
underscores. 

718 

719 
* Session HOLLibrary: theory Combinator_PER provides combinator to 

720 
build partial equivalence relations from a predicate and an equivalence 

721 
relation. 

722 

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

724 
everywhere fix bijections. 

725 

726 
* Session HOLLibrary: theory Normalized_Fraction allows viewing an 

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

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

729 
denominator is normalized wrt. unit factors). 

730 

731 
* Session HOLNSA has been renamed to HOLNonstandard_Analysis. 

732 

733 
* Session HOLMultivariate_Analysis has been renamed to HOLAnalysis. 

734 

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

736 
HOLProbability. When importing HOLAnalysis some theorems need 

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

738 

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

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

741 
principle, Residue theorem, Schwarz Lemma. 

742 

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

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

745 

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

747 
libraries: homeomorphisms, continuous function extensions, invariance of 

748 
domain. 

749 

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

751 
changed from ereal to ennreal, INCOMPATIBILITY. 

752 

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

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

755 

756 
* Session HOLProbability: Code generation and QuickCheck for 

757 
Probability Mass Functions. 

758 

759 
* Session HOLProbability: theory Random_Permutations contains some 

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

761 
folding over a list in random order. 

762 

763 
* Session HOLProbability: theory SPMF formalises discrete 

764 
subprobability distributions. 

765 

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

767 
normalised to distinguish which ordering the theorems are about 

768 

769 
mset_less_eqI ~> mset_subset_eqI 

770 
mset_less_insertD ~> mset_subset_insertD 

771 
mset_less_eq_count ~> mset_subset_eq_count 

772 
mset_less_diff_self ~> mset_subset_diff_self 

773 
mset_le_exists_conv ~> mset_subset_eq_exists_conv 

774 
mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel 

775 
mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel 

776 
mset_le_mono_add ~> mset_subset_eq_mono_add 

777 
mset_le_add_left ~> mset_subset_eq_add_left 

778 
mset_le_add_right ~> mset_subset_eq_add_right 

779 
mset_le_single ~> mset_subset_eq_single 

780 
mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute 

781 
diff_le_self ~> diff_subset_eq_self 

782 
mset_leD ~> mset_subset_eqD 

783 
mset_lessD ~> mset_subsetD 

784 
mset_le_insertD ~> mset_subset_eq_insertD 

785 
mset_less_of_empty ~> mset_subset_of_empty 

786 
mset_less_size ~> mset_subset_size 

787 
wf_less_mset_rel ~> wf_subset_mset_rel 

788 
count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq 

789 
mset_remdups_le ~> mset_remdups_subset_eq 

790 
ms_lesseq_impl ~> subset_eq_mset_impl 

791 

792 
Some functions have been renamed: 

793 
ms_lesseq_impl > subset_eq_mset_impl 

794 

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

796 
#\<subseteq># ~> \<le> 

797 
#\<subset># ~> < 

798 
le_multiset ~> less_eq_multiset 

799 
less_multiset ~> le_multiset 

800 
INCOMPATIBILITY. 

801 

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

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

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

805 
interpretations "multiset_linorder" and "multiset_wellorder" have been 

806 
replaced by instantiations. INCOMPATIBILITY. 

807 

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

809 
been renamed: 

810 

811 
le_multiset_def ~> less_eq_multiset_def 

812 
less_multiset_def ~> le_multiset_def 

813 
less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset 

814 
mult_less_not_refl ~> mset_le_not_refl 

815 
mult_less_trans ~> mset_le_trans 

816 
mult_less_not_sym ~> mset_le_not_sym 

817 
mult_less_asym ~> mset_le_asym 

818 
mult_less_irrefl ~> mset_le_irrefl 

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

820 

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

822 
le_multiset_total ~> less_eq_multiset_total 

823 
less_multiset_right_total ~> subset_eq_imp_le_multiset 

824 
le_multiset_empty_left ~> less_eq_multiset_empty_left 

825 
le_multiset_empty_right ~> less_eq_multiset_empty_right 

826 
less_multiset_empty_right ~> le_multiset_empty_left 

827 
less_multiset_empty_left ~> le_multiset_empty_right 

828 
union_less_diff_plus ~> union_le_diff_plus 

829 
ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset 

830 
less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty 

831 
le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty 

832 
INCOMPATIBILITY. 

833 

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

835 
INCOMPATIBILITY. 

836 

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

838 
INCOMPATIBILITY, use the following replacements: 

839 

840 
le_multiset_plus_plus_left_iff ~> add_less_cancel_right 

841 
less_multiset_plus_plus_left_iff ~> add_less_cancel_right 

842 
le_multiset_plus_plus_right_iff ~> add_less_cancel_left 

843 
less_multiset_plus_plus_right_iff ~> add_less_cancel_left 

844 
add_eq_self_empty_iff ~> add_cancel_left_right 

845 
mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right 

846 
mset_less_add_bothsides ~> subset_mset.add_less_cancel_right 

847 
mset_le_add_bothsides ~> subset_mset.add_less_cancel_right 

848 
empty_inter ~> subset_mset.inf_bot_left 

849 
inter_empty ~> subset_mset.inf_bot_right 

850 
empty_sup ~> subset_mset.sup_bot_left 

851 
sup_empty ~> subset_mset.sup_bot_right 

852 
bdd_below_multiset ~> subset_mset.bdd_above_bot 

853 
subset_eq_empty ~> subset_mset.le_zero_eq 

854 
le_empty ~> subset_mset.le_zero_eq 

855 
mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero 

856 
mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero 

857 

858 
* Session HOLLibrary: some typeclass constraints about multisets have 

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

860 
additional typeclasses order_bot, no_top, 

861 
ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add, 

862 
linordered_cancel_ab_semigroup_add, and 

863 
ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY. 

864 

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

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

867 
INCOMPATIBILITY. 

868 

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

870 
interpretations ordered_ab_semigroup_monoid_add_imp_le and 

871 
bounded_lattice_bot. INCOMPATIBILITY. 

872 

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

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

875 
removed or changed: 

876 

877 
single_not_empty ~> add_mset_not_empty or empty_not_add_mset 

878 
fold_mset_insert ~> fold_mset_add_mset 

879 
image_mset_insert ~> image_mset_add_mset 

880 
union_single_eq_diff 

881 
multi_self_add_other_not_self 

882 
diff_single_eq_union 

883 
INCOMPATIBILITY. 

884 

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

886 
to use add_mset instead of single: 

887 

888 
mset_add 

889 
multi_self_add_other_not_self 

890 
diff_single_eq_union 

891 
union_single_eq_diff 

892 
union_single_eq_member 

893 
add_eq_conv_diff 

894 
insert_noteq_member 

895 
add_eq_conv_ex 

896 
multi_member_split 

897 
multiset_add_sub_el_shuffle 

898 
mset_subset_eq_insertD 

899 
mset_subset_insertD 

900 
insert_subset_eq_iff 

901 
insert_union_subset_iff 

902 
multi_psub_of_add_self 

903 
inter_add_left1 

904 
inter_add_left2 

905 
inter_add_right1 

906 
inter_add_right2 

907 
sup_union_left1 

908 
sup_union_left2 

909 
sup_union_right1 

910 
sup_union_right2 

911 
size_eq_Suc_imp_eq_union 

912 
multi_nonempty_split 

913 
mset_insort 

914 
mset_update 

915 
mult1I 

916 
less_add 

917 
mset_zip_take_Cons_drop_twice 

918 
rel_mset_Zero 

919 
msed_map_invL 

920 
msed_map_invR 

921 
msed_rel_invL 

922 
msed_rel_invR 

923 
le_multiset_right_total 

924 
multiset_induct 

925 
multiset_induct2_size 

926 
multiset_induct2 

927 
INCOMPATIBILITY. 

928 

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

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

931 
element: 

932 

933 
image_mset 

934 
mset 

935 
replicate_mset 

936 
mult1 

937 
pred_mset 

938 
rel_mset' 

939 
mset_insort 

940 

941 
INCOMPATIBILITY. 

942 

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

944 
attributes of some multiset theorems have been changed: 

945 

946 
insert_DiffM [] ~> [simp] 

947 
insert_DiffM2 [simp] ~> [] 

948 
diff_add_mset_swap [simp] 

949 
fold_mset_add_mset [simp] 

950 
diff_diff_add [simp] (for multisets only) 

951 
diff_cancel [simp] ~> [] 

952 
count_single [simp] ~> [] 

953 
set_mset_single [simp] ~> [] 

954 
size_multiset_single [simp] ~> [] 

955 
size_single [simp] ~> [] 

956 
image_mset_single [simp] ~> [] 

957 
mset_subset_eq_mono_add_right_cancel [simp] ~> [] 

958 
mset_subset_eq_mono_add_left_cancel [simp] ~> [] 

959 
fold_mset_single [simp] ~> [] 

960 
subset_eq_empty [simp] ~> [] 

961 
empty_sup [simp] ~> [] 

962 
sup_empty [simp] ~> [] 

963 
inter_empty [simp] ~> [] 

964 
empty_inter [simp] ~> [] 

965 
INCOMPATIBILITY. 

966 

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

970 
INCOMPATIBILITY. 

971 

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

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

974 
natural numbers. INCOMPATIBILITY. 

975 

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

977 
multisets: 

978 

979 
msetsum ~> sum_mset 

980 
msetprod ~> prod_mset 

981 

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

983 
and union of multisets have been changed: 

984 

985 
#\<inter> ~> \<inter># 

986 
#\<union> ~> \<union># 

987 

988 
INCOMPATIBILITY. 

989 

990 
* Session HOLLibrary, theory Multiset: the lemma 

991 
one_step_implies_mult_aux on multisets has been removed, use 

992 
one_step_implies_mult instead. INCOMPATIBILITY. 

993 

994 
* Session HOLLibrary: theory Complete_Partial_Order2 provides reasoning 

995 
support for monotonicity and continuity in chaincomplete partial orders 

996 
and about admissibility conditions for fixpoint inductions. 

997 

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

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

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

1002 
future different type class instantiation for polynomials over factorial 

1003 
rings. INCOMPATIBILITY. 

64390  1004 

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

1006 
the following renaming 

1007 

1008 
prefixeq > prefix 

1009 
prefix > strict_prefix 

1010 
suffixeq > suffix 

1011 
suffix > strict_suffix 

1012 

1013 
Added theory of longest common prefixes. 

64389  1014 

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

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

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

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

1020 
"prime_nat_iff". INCOMPATIBILITY. 

1021 

1022 
* Session Old_Number_Theory has been removed, after porting remaining 

1023 
theories. 

1024 

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

1027 

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

1028 

62498  1029 
*** ML *** 
1030 

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

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

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

1035 
INCOMPATIBILITY. 

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

1036 

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

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

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

1044 

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

1047 

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

1049 
with approximative output quality. 

1050 

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

1052 
exposed to Isabelle/ML userspace. Potential INCOMPATIBILITY. 

1053 

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

1056 
requiring separate files. 

1057 

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

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

1061 
debugger information requires consirable time and space: main 

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

1063 

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

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

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

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

1069 
balanced blocks of Local_Theory.open_target versus 

1070 
Local_Theory.close_target instead. Rare INCOMPATIBILITY. 

1071 

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

1074 
INCOMPATIBILITY. 

1075 

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

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

1079 
File.full_path). Potential INCOMPATIBILITY. 

1080 

63352  1081 
* Binding.empty_atts supersedes Thm.empty_binding and 
1082 
Attrib.empty_binding. Minor INCOMPATIBILITY. 

1083 

62498  1084 

62354  1085 
*** System *** 
1086 

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

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

1090 
much less disk space. 

63226  1091 

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

1094 
particular: 

1095 

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

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

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

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

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

1100 

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

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

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

1104 

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

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

1106 
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

1107 
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

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

1109 

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

1112 
servers with separate CPU/memory modules. 

1113 

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

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

64274  1116 
unless there is already a default provided via ML_OPTIONS settings. 
1117 

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

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

1119 
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

1120 
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

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

1122 

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

1126 
resulting log files. 

64308  1127 

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

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

1129 
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

1130 
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

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

1132 

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

1135 

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

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

1138 
Isabelle/ML or Isabelle/Scala. 

1139 

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

1141 
settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64, 

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

1143 
ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been 

1144 
discontinued. Potential INCOMPATIBILITY. 

1145 

1146 
* The Isabelle system environment always ensures that the main 

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

1148 
"isabelle_scala_script". 

1149 

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

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

1152 
Isabelle_Tool.Body. 

1153 

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

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

1156 
produce robust shell scripts under program control, without worrying 

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

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

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

1160 
been discontinued. 

1161 

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

1164 
but without the Isabelle settings environment. 

1165 

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

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

1169 
that Path specifications need to be resolved remotely via 

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

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

1172 

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

1174 
regular hg commandline interface. The repositroy clone and working 

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

1176 
connection). 

64265  1177 

62354  1178 

1179 

62031  1180 
New in Isabelle2016 (February 2016) 
62016  1181 
 
60138  1182 

61337  1183 
*** General *** 
1184 

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

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

1186 
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

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

1188 
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

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

1190 

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

1193 

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

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

1197 
has been removed (see below). 

1198 

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

62017  1201 

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

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

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

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

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

1206 

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

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

1208 
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

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

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

1211 

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

1214 
to update old sources. 

1215 

61337  1216 
* Toplevel theorem statements have been simplified as follows: 
1217 

1218 
theorems ~> lemmas 

1219 
schematic_lemma ~> schematic_goal 

1220 
schematic_theorem ~> schematic_goal 

1221 
schematic_corollary ~> schematic_goal 

1222 

1223 
Commandline tool "isabelle update_theorems" updates theory sources 

1224 
accordingly. 

1225 

61338  1226 
* Toplevel theorem statement 'proposition' is another alias for 
1227 
'theorem'. 

1228 

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

1231 
deferred definitions require a surrounding 'overloading' block. 

1232 

61337  1233 

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

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

1235 

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

1239 
'SML_file_no_debug' control compilation of sources with or without 

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

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

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

1243 
any effect on the running ML program. 

60984  1244 

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

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

1248 
update. 

61729  1249 

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

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

1252 
enable option "editor_output_state". 

61215  1253 

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

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

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

1258 
visibility. 

1259 

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

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

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

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

1264 
panel. 

1265 

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

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

1267 
state output, interactive queries) wrt. longrunning background tasks. 
62017  1268 

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

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

1271 
implicit: a popup will show up unconditionally. 

1272 

1273 
* Additional abbreviations for syntactic completion may be specified in 

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

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

1276 

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

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

1278 
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

1279 
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

1280 
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

1281 

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

1284 
the editor. 

1285 

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

1287 
instead of former C+e LEFT. 

1288 

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

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

1291 
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

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

1293 

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

1296 
singleinstance applications seen on common GUI desktops. 

1297 

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

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

1299 
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

1300 
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

1301 

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

1304 

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

1307 

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

1308 

61405  1309 
*** Document preparation *** 
1310 

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

1313 

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

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

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

1317 

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

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

1320 
follows: 

1321 

1322 
\<^item> itemize 

1323 
\<^enum> enumerate 

1324 
\<^descr> description 

1325 

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

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

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

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

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

1332 

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

1335 
standard LaTeX macros of the same names. 

1336 

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

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

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

1341 
cartouche tokens seen in theory sources. 

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

1342 

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

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

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

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

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

1348 

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

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

1352 

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

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

1355 

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

1357 

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

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

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

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

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

1363 
documentation, with a hyperlink in the Prover IDE. 

1364 

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

1366 
entities of the Isar language. 

1367 

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

61488  1370 
print mode "HTML" loses its special meaning. 
61471  1371 

61405  1372 

60406  1373 
*** Isar *** 
1374 

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

1377 
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

1378 
example: 
60414  1379 

1380 
have result: "C x y" 

1381 
if "A x" and "B y" 

1382 
for x :: 'a and y :: 'a 

1383 
<proof> 

1384 

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

60414  1387 
corresponds to a raw proof block like this: 
1388 

1389 
{ 

1390 
fix x :: 'a and y :: 'a 

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

1394 
note result = this 

60406  1395 

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

1396 
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

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

1398 

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

61658  1401 

1402 
assume result: "C x y" 

1403 
if "A x" and "B y" 

1404 
for x :: 'a and y :: 'a 

1405 

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

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

1408 

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

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

1411 
example: 

1412 

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

1414 

1415 
is equivalent to: 

1416 

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

1418 

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

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

60595  1423 

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

1425 

1426 
or: 

1427 

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

1429 

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

1431 

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

1433 

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

2761a2249c83
more on 'consider' and r 