author  wenzelm 
Tue, 06 Dec 2016 17:38:46 +0100  
changeset 64549  964ac7439a52 
parent 64527  49708cffb98d 
child 64529  1c0b93961cb1 
child 64551  79e9587dbcca 
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 

60331  6 

64072  7 
New in Isabelle20161 (December 2016) 
8 
 

62216  9 

62440  10 
*** General *** 
11 

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

14 
INCOMPATIBILITY. 

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

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

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

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

19 
result the subgoal may be split into several subgoals. 

20 

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

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

24 

25 
bundle foo 

26 
begin 

27 
declare a [simp] 

28 
declare b [intro] 

29 
end 

63272  30 

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

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

34 

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

37 
discontinued. 

38 

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

40 
delimited uniformly via cartouches. This works better than oldfashioned 

41 
quotes when sublanguages are nested. 

42 

43 
* Mixfix annotations support general block properties, with syntax 

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

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

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

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

63650  48 

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

51 

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

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

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

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

57 
examples. 

58 

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

60 
instances) are generated into companion object of corresponding type 

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

62 

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

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

65 

62440  66 

62904  67 
*** Prover IDE  Isabelle/Scala/jEdit *** 
68 

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

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

72 
reactivity and CPU usage. 

73 

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

76 
command keywords and some command substructure. Action 

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

78 
according to command keywords only; see also option 

79 
"jedit_indent_newline". 

80 

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

82 
number of subgoals. This requires information of ongoing document 

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

84 
quickly; see also option "jedit_script_indent" and 

85 
"jedit_script_indent_limit". 

86 

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

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

89 
structure of theory specifications is treated as well. 

90 

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

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

93 

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

95 
e.g. 'context', 'notepad'. 

96 

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

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

99 

63977  100 
* Highlighting of entity def/ref positions wrt. cursor. 
101 

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

64514  103 
occurrences of the formal entity at the caret position. This facilitates 
63977  104 
systematic renaming. 
105 

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

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

108 
theorem statement. 

109 

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

111 
situations where old ASCII notation may be updated. 

112 

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

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

116 
inaccessible via keyboard completion). 

117 

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

120 

121 
src/Pure/ROOT0.ML 

122 
src/Pure/ROOT.ML 

123 
src/Pure/Pure.thy 

124 
src/Pure/ML_Bootstrap.thy 

125 

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

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

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

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

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

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

63307  132 
dependencies of the above files are only observed for batch build. 
62904  133 

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

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

63461  137 

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

141 
new 'abbrevs' section. 

142 

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

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

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

63579  146 

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

149 
keymap; nonconflicting changes are always applied implicitly. This 

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

151 
increases chances that users see new keyboard shortcuts when reusing 

152 
old keymaps. 

153 

63675  154 
* ML and document antiquotations for filesystems paths are more uniform 
155 
and diverse: 

156 

157 
@{path NAME}  no filesystem check 

158 
@{file NAME}  check for plain file 

159 
@{dir NAME}  check for directory 

160 

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

162 
have to be changed. 

63669  163 

164 

63977  165 
*** Document preparation *** 
166 

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

168 

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

171 

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

174 

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

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

177 
derivatives. 

178 

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

180 

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

182 
Isabelle2015). 

183 

184 

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

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

186 

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

189 
'definition', 'inductive', 'function'. 

190 

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

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

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

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

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

196 

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

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

63039  201 

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

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

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

204 

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

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

206 
typesetting. E.g. to produce proof holes in examples and documentation. 
62216  207 

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

210 

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

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

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

214 

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

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

217 
INCOMPATIBILITY. 

62939  218 

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

221 
definitions. 

222 

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

63259  225 

226 
(use facts in simp) 

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

228 

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

231 

62216  232 

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

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

234 

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

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

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

239 

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

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

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

243 
regardless of the actual parameters that are provided. Rare 

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

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

246 

247 
* Typeinference improves sorts of newly introduced type variables for 

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

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

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

251 
INCOMPATIBILITY, need to provide explicit type constraints for Pure 

252 
types where this is really intended. 

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

253 

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

254 

62327  255 
*** HOL *** 
256 

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

259 
propositional logic, goals based on a combination of quantifierfree 

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

261 
quantifierfree propositional logic with linear real arithmetic 

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

263 

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

266 

63977  267 
* Metis: The problem encoding has changed very slightly. This might 
63785  268 
break existing proofs. INCOMPATIBILITY. 
269 

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

271 
 The MaSh relevance filter is now faster than before. 
63116  272 
 Produce syntactically correct Vampire 4.0 problem files. 
273 

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

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

62842  278 
method. See 'isabelle doc corec'. 
63977  279 
 The predicator :: ('a \<Rightarrow> bool) \<Rightarrow> 'a F \<Rightarrow> bool is now a firstclass 
63855  280 
citizen in bounded natural functors. 
62693  281 
 'primrec' now allows nested calls through the predicator in addition 
62327  282 
to the map function. 
63855  283 
 'bnf' automatically discharges reflexive proof obligations. 
62693  284 
 'bnf' outputs a slightly modified proof obligation expressing rel in 
62332  285 
terms of map and set 
63855  286 
(not giving a specification for rel makes this one reflexive). 
62693  287 
 'bnf' outputs a new proof obligation expressing pred in terms of set 
63855  288 
(not giving a specification for pred makes this one reflexive). 
289 
INCOMPATIBILITY: manual 'bnf' declarations may need adjustment. 

62335  290 
 Renamed lemmas: 
291 
rel_prod_apply ~> rel_prod_inject 

292 
pred_prod_apply ~> pred_prod_inject 

293 
INCOMPATIBILITY. 

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

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

297 
INCOMPATIBILITY. 

62327  298 

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

301 
which exposed details of the internal fixpoint construction and was 

302 
hard to use. INCOMPATIBILITY. 

303 

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

305 

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

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

308 

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

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

311 
eliminated altogether. 

312 

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

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

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

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

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

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

319 
INCOMPATIBILITY in rare situations. 

320 

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

322 
INCOMPATIBILITY. 

323 

64390  324 
* Renamed constants and corresponding theorems: 
325 

326 
setsum ~> sum 

327 
setprod ~> prod 

328 
listsum ~> sum_list 

329 
listprod ~> prod_list 

330 

331 
INCOMPATIBILITY. 

332 

333 
* Sligthly more standardized theorem names: 

334 
sgn_times ~> sgn_mult 

335 
sgn_mult' ~> Real_Vector_Spaces.sgn_mult 

336 
divide_zero_left ~> div_0 

337 
zero_mod_left ~> mod_0 

338 
divide_zero ~> div_by_0 

339 
divide_1 ~> div_by_1 

340 
nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left 

341 
div_mult_self1_is_id ~> nonzero_mult_div_cancel_left 

342 
nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right 

343 
div_mult_self2_is_id ~> nonzero_mult_div_cancel_right 

344 
is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left 

345 
is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right 

346 
mod_div_equality ~> div_mult_mod_eq 

347 
mod_div_equality2 ~> mult_div_mod_eq 

348 
mod_div_equality3 ~> mod_div_mult_eq 

349 
mod_div_equality4 ~> mod_mult_div_eq 

350 
minus_div_eq_mod ~> minus_div_mult_eq_mod 

351 
minus_div_eq_mod2 ~> minus_mult_div_eq_mod 

352 
minus_mod_eq_div ~> minus_mod_eq_div_mult 

353 
minus_mod_eq_div2 ~> minus_mod_eq_mult_div 

354 
div_mod_equality' ~> minus_mod_eq_div_mult [symmetric] 

355 
mod_div_equality' ~> minus_div_mult_eq_mod [symmetric] 

356 
zmod_zdiv_equality ~> mult_div_mod_eq [symmetric] 

357 
zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric] 

358 
Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

359 
mult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

360 
zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric] 

361 
div_1 ~> div_by_Suc_0 

362 
mod_1 ~> mod_by_Suc_0 

363 
INCOMPATIBILITY. 

364 

365 
* New type class "idom_abs_sgn" specifies algebraic properties 

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

367 
disappeared. Slight INCOMPATIBILITY. 

368 

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

370 

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

373 

374 
 Logical representation: 

375 
* 0 is instantiated to the ASCII zero character. 

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

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

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

379 
are noncanonical. 

380 
 Printing and parsing: 

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

382 
(as before). 

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

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

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

386 
is parsable for every numeral expression n. 

387 
* Noncanonical characters have no special syntax and are 

388 
printed as their logical representation. 

389 
 Explicit conversions from and to the natural numbers are 

390 
provided as char_of_nat, nat_of_char (as before). 

391 
 The auxiliary nibble type has been discontinued. 

392 

393 
INCOMPATIBILITY. 

394 

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

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

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

398 
infix "mod" syntax. INCOMPATIBILITY. 

399 

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

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

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

404 
easily recovered by composition with eq_refl. Minor INCOMPATIBILITY. 

405 

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

408 

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

410 
which renders those abstract effectively. 

411 

412 
* Command 'export_code' checks given constants for abstraction 

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

414 
interface for the generated code. 

415 

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

417 
spelt out explicitly. 

418 

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

420 
explicitly provided auxiliary definitions for required type class 

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

423 

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

425 
products. 

63977  426 

427 
* Locale bijection establishes convenient default simp rules such as 

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

429 

430 
* Abstract locales semigroup, abel_semigroup, semilattice, 

431 
semilattice_neutr, ordering, ordering_top, semilattice_order, 

432 
semilattice_neutr_order, comm_monoid_set, semilattice_set, 

433 
semilattice_neutr_set, semilattice_order_set, 

434 
semilattice_order_neutr_set monoid_list, comm_monoid_list, 

435 
comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified 

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

437 
INCOMPATIBILITY. 

438 

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

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

441 
lifting_syntax begin ... end". Minor INCOMPATIBILITY. 

442 

63807  443 
* Some old / obsolete theorems have been renamed / removed, potential 
444 
INCOMPATIBILITY. 

445 

446 
nat_less_cases  removed, use linorder_cases instead 

447 
inv_image_comp  removed, use image_inv_f_f instead 

448 
image_surj_f_inv_f ~> image_f_inv_f 

63113  449 

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

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

451 
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

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

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

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

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

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

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

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

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

460 

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

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

462 
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

463 
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

464 
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

465 
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

466 
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

467 
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

468 
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

469 
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

470 
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

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

472 

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

62396  475 

63977  476 
* Added class topological_monoid. 
477 

64391  478 
* The following theorems have been renamed: 
479 

64457  480 
setsum_left_distrib ~> sum_distrib_right 
481 
setsum_right_distrib ~> sum_distrib_left 

64391  482 

483 
INCOMPATIBILITY. 

484 

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

486 
INCOMPATIBILITY. 

487 

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

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

490 
A)". 

491 

492 
* Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY. 

493 

494 
* The type class ordered_comm_monoid_add is now called 

495 
ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add 

496 
is introduced as the combination of ordered_ab_semigroup_add + 

497 
comm_monoid_add. INCOMPATIBILITY. 

498 

499 
* Introduced the type classes canonically_ordered_comm_monoid_add and 

500 
dioid. 

501 

502 
* Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When 

503 
instantiating linordered_semiring_strict and ordered_ab_group_add, an 

504 
explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might 

505 
be required. INCOMPATIBILITY. 

63117  506 

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

509 
lcm_left_commute_nat ~> lcm.left_commute 

510 
lcm_left_commute_int ~> lcm.left_commute 

511 
gcd_left_commute_nat ~> gcd.left_commute 

512 
gcd_left_commute_int ~> gcd.left_commute 

513 
gcd_greatest_iff_nat ~> gcd_greatest_iff 

514 
gcd_greatest_iff_int ~> gcd_greatest_iff 

515 
coprime_dvd_mult_nat ~> coprime_dvd_mult 

516 
coprime_dvd_mult_int ~> coprime_dvd_mult 

517 
zpower_numeral_even ~> power_numeral_even 

518 
gcd_mult_cancel_nat ~> gcd_mult_cancel 

519 
gcd_mult_cancel_int ~> gcd_mult_cancel 

520 
div_gcd_coprime_nat ~> div_gcd_coprime 

521 
div_gcd_coprime_int ~> div_gcd_coprime 

522 
zpower_numeral_odd ~> power_numeral_odd 

523 
zero_less_int_conv ~> of_nat_0_less_iff 

524 
gcd_greatest_nat ~> gcd_greatest 

525 
gcd_greatest_int ~> gcd_greatest 

526 
coprime_mult_nat ~> coprime_mult 

527 
coprime_mult_int ~> coprime_mult 

528 
lcm_commute_nat ~> lcm.commute 

529 
lcm_commute_int ~> lcm.commute 

530 
int_less_0_conv ~> of_nat_less_0_iff 

531 
gcd_commute_nat ~> gcd.commute 

532 
gcd_commute_int ~> gcd.commute 

533 
Gcd_insert_nat ~> Gcd_insert 

534 
Gcd_insert_int ~> Gcd_insert 

535 
of_int_int_eq ~> of_int_of_nat_eq 

536 
lcm_least_nat ~> lcm_least 

537 
lcm_least_int ~> lcm_least 

538 
lcm_assoc_nat ~> lcm.assoc 

539 
lcm_assoc_int ~> lcm.assoc 

540 
int_le_0_conv ~> of_nat_le_0_iff 

541 
int_eq_0_conv ~> of_nat_eq_0_iff 

542 
Gcd_empty_nat ~> Gcd_empty 

543 
Gcd_empty_int ~> Gcd_empty 

544 
gcd_assoc_nat ~> gcd.assoc 

545 
gcd_assoc_int ~> gcd.assoc 

546 
zero_zle_int ~> of_nat_0_le_iff 

547 
lcm_dvd2_nat ~> dvd_lcm2 

548 
lcm_dvd2_int ~> dvd_lcm2 

549 
lcm_dvd1_nat ~> dvd_lcm1 

550 
lcm_dvd1_int ~> dvd_lcm1 

551 
gcd_zero_nat ~> gcd_eq_0_iff 

552 
gcd_zero_int ~> gcd_eq_0_iff 

553 
gcd_dvd2_nat ~> gcd_dvd2 

554 
gcd_dvd2_int ~> gcd_dvd2 

555 
gcd_dvd1_nat ~> gcd_dvd1 

556 
gcd_dvd1_int ~> gcd_dvd1 

557 
int_numeral ~> of_nat_numeral 

558 
lcm_ac_nat ~> ac_simps 

559 
lcm_ac_int ~> ac_simps 

560 
gcd_ac_nat ~> ac_simps 

561 
gcd_ac_int ~> ac_simps 

562 
abs_int_eq ~> abs_of_nat 

563 
zless_int ~> of_nat_less_iff 

564 
zdiff_int ~> of_nat_diff 

565 
zadd_int ~> of_nat_add 

566 
int_mult ~> of_nat_mult 

567 
int_Suc ~> of_nat_Suc 

568 
inj_int ~> inj_of_nat 

569 
int_1 ~> of_nat_1 

570 
int_0 ~> of_nat_0 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

593 
coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff 
62348  594 
realpow_minus_mult ~> power_minus_mult 
595 
realpow_Suc_le_self ~> power_Suc_le_self 

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

596 
dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest 
62347  597 
INCOMPATIBILITY. 
598 

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

599 
* Renamed HOL/Quotient_Examples/FSet.thy to 
63977  600 
HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY. 
601 

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

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

605 
"unbundle finfun_syntax" to imitate import of 

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

607 

608 
* Session HOLLibrary: theory Multiset_Permutations (executably) defines 

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

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

611 
once. 

612 

613 
* Session HOLLibrary: multiset membership is now expressed using 

614 
set_mset rather than count. 

615 

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

617 
by default. 

618 

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

620 
equations count_eq_zero_iff and not_in_iff. 

621 

622 
 Rules count_inI and in_countE obtain facts of the form 

623 
"count M a = n" from membership. 

624 

625 
 Rules count_in_diffI and in_diff_countE obtain facts of the form 

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

627 

628 
INCOMPATIBILITY. 

629 

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

631 
displaying equations in functional programming style  variables 

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

633 
underscores. 

634 

635 
* Session HOLLibrary: theory Combinator_PER provides combinator to 

636 
build partial equivalence relations from a predicate and an equivalence 

637 
relation. 

638 

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

640 
everywhere fix bijections. 

641 

642 
* Session HOLLibrary: theory Normalized_Fraction allows viewing an 

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

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

645 
denominator is normalized wrt. unit factors). 

646 

647 
* Session HOLNSA has been renamed to HOLNonstandard_Analysis. 

648 

649 
* Session HOLMultivariate_Analysis has been renamed to HOLAnalysis. 

650 

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

652 
HOLProbability. When importing HOLAnalysis some theorems need 

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

654 

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

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

657 
principle, Residue theorem, Schwarz Lemma. 

658 

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

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

661 

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

663 
libraries: homeomorphisms, continuous function extensions, invariance of 

664 
domain. 

665 

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

667 
changed from ereal to ennreal, INCOMPATIBILITY. 

668 

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

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

671 

672 
* Session HOLProbability: Code generation and QuickCheck for 

673 
Probability Mass Functions. 

674 

675 
* Session HOLProbability: theory Random_Permutations contains some 

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

677 
folding over a list in random order. 

678 

679 
* Session HOLProbability: theory SPMF formalises discrete 

680 
subprobability distributions. 

681 

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

683 
normalised to distinguish which ordering the theorems are about 

684 

685 
mset_less_eqI ~> mset_subset_eqI 

686 
mset_less_insertD ~> mset_subset_insertD 

687 
mset_less_eq_count ~> mset_subset_eq_count 

688 
mset_less_diff_self ~> mset_subset_diff_self 

689 
mset_le_exists_conv ~> mset_subset_eq_exists_conv 

690 
mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel 

691 
mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel 

692 
mset_le_mono_add ~> mset_subset_eq_mono_add 

693 
mset_le_add_left ~> mset_subset_eq_add_left 

694 
mset_le_add_right ~> mset_subset_eq_add_right 

695 
mset_le_single ~> mset_subset_eq_single 

696 
mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute 

697 
diff_le_self ~> diff_subset_eq_self 

698 
mset_leD ~> mset_subset_eqD 

699 
mset_lessD ~> mset_subsetD 

700 
mset_le_insertD ~> mset_subset_eq_insertD 

701 
mset_less_of_empty ~> mset_subset_of_empty 

702 
mset_less_size ~> mset_subset_size 

703 
wf_less_mset_rel ~> wf_subset_mset_rel 

704 
count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq 

705 
mset_remdups_le ~> mset_remdups_subset_eq 

706 
ms_lesseq_impl ~> subset_eq_mset_impl 

707 

708 
Some functions have been renamed: 

709 
ms_lesseq_impl > subset_eq_mset_impl 

710 

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

712 
#\<subseteq># ~> \<le> 

713 
#\<subset># ~> < 

714 
le_multiset ~> less_eq_multiset 

715 
less_multiset ~> le_multiset 

716 
INCOMPATIBILITY. 

717 

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

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

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

721 
interpretations "multiset_linorder" and "multiset_wellorder" have been 

722 
replaced by instantiations. INCOMPATIBILITY. 

723 

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

725 
been renamed: 

726 

727 
le_multiset_def ~> less_eq_multiset_def 

728 
less_multiset_def ~> le_multiset_def 

729 
less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset 

730 
mult_less_not_refl ~> mset_le_not_refl 

731 
mult_less_trans ~> mset_le_trans 

732 
mult_less_not_sym ~> mset_le_not_sym 

733 
mult_less_asym ~> mset_le_asym 

734 
mult_less_irrefl ~> mset_le_irrefl 

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

736 

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

738 
le_multiset_total ~> less_eq_multiset_total 

739 
less_multiset_right_total ~> subset_eq_imp_le_multiset 

740 
le_multiset_empty_left ~> less_eq_multiset_empty_left 

741 
le_multiset_empty_right ~> less_eq_multiset_empty_right 

742 
less_multiset_empty_right ~> le_multiset_empty_left 

743 
less_multiset_empty_left ~> le_multiset_empty_right 

744 
union_less_diff_plus ~> union_le_diff_plus 

745 
ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset 

746 
less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty 

747 
le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty 

748 
INCOMPATIBILITY. 

749 

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

751 
INCOMPATIBILITY. 

752 

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

754 
INCOMPATIBILITY, use the following replacements: 

755 

756 
le_multiset_plus_plus_left_iff ~> add_less_cancel_right 

757 
less_multiset_plus_plus_left_iff ~> add_less_cancel_right 

758 
le_multiset_plus_plus_right_iff ~> add_less_cancel_left 

759 
less_multiset_plus_plus_right_iff ~> add_less_cancel_left 

760 
add_eq_self_empty_iff ~> add_cancel_left_right 

761 
mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right 

762 
mset_less_add_bothsides ~> subset_mset.add_less_cancel_right 

763 
mset_le_add_bothsides ~> subset_mset.add_less_cancel_right 

764 
empty_inter ~> subset_mset.inf_bot_left 

765 
inter_empty ~> subset_mset.inf_bot_right 

766 
empty_sup ~> subset_mset.sup_bot_left 

767 
sup_empty ~> subset_mset.sup_bot_right 

768 
bdd_below_multiset ~> subset_mset.bdd_above_bot 

769 
subset_eq_empty ~> subset_mset.le_zero_eq 

770 
le_empty ~> subset_mset.le_zero_eq 

771 
mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero 

772 
mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero 

773 

774 
* Session HOLLibrary: some typeclass constraints about multisets have 

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

776 
additional typeclasses order_bot, no_top, 

777 
ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add, 

778 
linordered_cancel_ab_semigroup_add, and 

779 
ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY. 

780 

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

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

783 
INCOMPATIBILITY. 

784 

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

786 
interpretations ordered_ab_semigroup_monoid_add_imp_le and 

787 
bounded_lattice_bot. INCOMPATIBILITY. 

788 

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

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

791 
removed or changed: 

792 

793 
single_not_empty ~> add_mset_not_empty or empty_not_add_mset 

794 
fold_mset_insert ~> fold_mset_add_mset 

795 
image_mset_insert ~> image_mset_add_mset 

796 
union_single_eq_diff 

797 
multi_self_add_other_not_self 

798 
diff_single_eq_union 

799 
INCOMPATIBILITY. 

800 

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

802 
to use add_mset instead of single: 

803 

804 
mset_add 

805 
multi_self_add_other_not_self 

806 
diff_single_eq_union 

807 
union_single_eq_diff 

808 
union_single_eq_member 

809 
add_eq_conv_diff 

810 
insert_noteq_member 

811 
add_eq_conv_ex 

812 
multi_member_split 

813 
multiset_add_sub_el_shuffle 

814 
mset_subset_eq_insertD 

815 
mset_subset_insertD 

816 
insert_subset_eq_iff 

817 
insert_union_subset_iff 

818 
multi_psub_of_add_self 

819 
inter_add_left1 

820 
inter_add_left2 

821 
inter_add_right1 

822 
inter_add_right2 

823 
sup_union_left1 

824 
sup_union_left2 

825 
sup_union_right1 

826 
sup_union_right2 

827 
size_eq_Suc_imp_eq_union 

828 
multi_nonempty_split 

829 
mset_insort 

830 
mset_update 

831 
mult1I 

832 
less_add 

833 
mset_zip_take_Cons_drop_twice 

834 
rel_mset_Zero 

835 
msed_map_invL 

836 
msed_map_invR 

837 
msed_rel_invL 

838 
msed_rel_invR 

839 
le_multiset_right_total 

840 
multiset_induct 

841 
multiset_induct2_size 

842 
multiset_induct2 

843 
INCOMPATIBILITY. 

844 

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

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

847 
element: 

848 

849 
image_mset 

850 
mset 

851 
replicate_mset 

852 
mult1 

853 
pred_mset 

854 
rel_mset' 

855 
mset_insort 

856 

857 
INCOMPATIBILITY. 

858 

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

860 
attributes of some multiset theorems have been changed: 

861 

862 
insert_DiffM [] ~> [simp] 

863 
insert_DiffM2 [simp] ~> [] 

864 
diff_add_mset_swap [simp] 

865 
fold_mset_add_mset [simp] 

866 
diff_diff_add [simp] (for multisets only) 

867 
diff_cancel [simp] ~> [] 

868 
count_single [simp] ~> [] 

869 
set_mset_single [simp] ~> [] 

870 
size_multiset_single [simp] ~> [] 

871 
size_single [simp] ~> [] 

872 
image_mset_single [simp] ~> [] 

873 
mset_subset_eq_mono_add_right_cancel [simp] ~> [] 

874 
mset_subset_eq_mono_add_left_cancel [simp] ~> [] 

875 
fold_mset_single [simp] ~> [] 

876 
subset_eq_empty [simp] ~> [] 

877 
empty_sup [simp] ~> [] 

878 
sup_empty [simp] ~> [] 

879 
inter_empty [simp] ~> [] 

880 
empty_inter [simp] ~> [] 

881 
INCOMPATIBILITY. 

882 

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

886 
INCOMPATIBILITY. 

887 

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

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

890 
natural numbers. INCOMPATIBILITY. 

891 

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

893 
multisets: 

894 

895 
msetsum ~> sum_mset 

896 
msetprod ~> prod_mset 

897 

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

899 
and union of multisets have been changed: 

900 

901 
#\<inter> ~> \<inter># 

902 
#\<union> ~> \<union># 

903 

904 
INCOMPATIBILITY. 

905 

906 
* Session HOLLibrary, theory Multiset: the lemma 

907 
one_step_implies_mult_aux on multisets has been removed, use 

908 
one_step_implies_mult instead. INCOMPATIBILITY. 

909 

910 
* Session HOLLibrary: theory Complete_Partial_Order2 provides reasoning 

911 
support for monotonicity and continuity in chaincomplete partial orders 

912 
and about admissibility conditions for fixpoint inductions. 

913 

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

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

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

918 
future different type class instantiation for polynomials over factorial 

919 
rings. INCOMPATIBILITY. 

64390  920 

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

922 
the following renaming 

923 

924 
prefixeq > prefix 

925 
prefix > strict_prefix 

926 
suffixeq > suffix 

927 
suffix > strict_suffix 

928 

929 
Added theory of longest common prefixes. 

64389  930 

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

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

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

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

936 
"prime_nat_iff". INCOMPATIBILITY. 

937 

938 
* Session Old_Number_Theory has been removed, after porting remaining 

939 
theories. 

940 

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

941 

62498  942 
*** ML *** 
943 

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

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

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

948 
INCOMPATIBILITY. 

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

949 

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

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

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

957 

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

960 

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

962 
with approximative output quality. 

963 

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

965 
exposed to Isabelle/ML userspace. Potential INCOMPATIBILITY. 

966 

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

969 
requiring separate files. 

970 

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

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

974 
debugger information requires consirable time and space: main 

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

976 

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

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

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

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

982 
balanced blocks of Local_Theory.open_target versus 

983 
Local_Theory.close_target instead. Rare INCOMPATIBILITY. 

984 

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

987 
INCOMPATIBILITY. 

988 

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

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

992 
File.full_path). Potential INCOMPATIBILITY. 

993 

63352  994 
* Binding.empty_atts supersedes Thm.empty_binding and 
995 
Attrib.empty_binding. Minor INCOMPATIBILITY. 

996 

62498  997 

62354  998 
*** System *** 
999 

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

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

1003 
much less disk space. 

63226  1004 

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

1007 
particular: 

1008 

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

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

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

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

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

1013 

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

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

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

1017 

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

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

1019 
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

1020 
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

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

1022 

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

1025 
servers with separate CPU/memory modules. 

1026 

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

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

64274  1029 
unless there is already a default provided via ML_OPTIONS settings. 
1030 

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

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

1032 
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

1033 
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

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

1035 

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

1039 
resulting log files. 

64308  1040 

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

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

1042 
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

1043 
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

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

1045 

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

1048 

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

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

1051 
Isabelle/ML or Isabelle/Scala. 

1052 

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

1054 
settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64, 

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

1056 
ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been 

1057 
discontinued. Potential INCOMPATIBILITY. 

1058 

1059 
* The Isabelle system environment always ensures that the main 

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

1061 
"isabelle_scala_script". 

1062 

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

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

1065 
Isabelle_Tool.Body. 

1066 

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

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

1069 
produce robust shell scripts under program control, without worrying 

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

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

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

1073 
been discontinued. 

1074 

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

1077 
but without the Isabelle settings environment. 

1078 

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

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

1082 
that Path specifications need to be resolved remotely via 

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

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

1085 

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

1087 
regular hg commandline interface. The repositroy clone and working 

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

1089 
connection). 

64265  1090 

62354  1091 

1092 

62031  1093 
New in Isabelle2016 (February 2016) 
62016  1094 
 
60138  1095 

61337  1096 
*** General *** 
1097 

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

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

1099 
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

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

1101 
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

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

1103 

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

1106 

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

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

1110 
has been removed (see below). 

1111 

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

62017  1114 

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

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

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

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

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

1119 

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

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

1121 
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

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

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

1124 

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

1127 
to update old sources. 

1128 

61337  1129 
* Toplevel theorem statements have been simplified as follows: 
1130 

1131 
theorems ~> lemmas 

1132 
schematic_lemma ~> schematic_goal 

1133 
schematic_theorem ~> schematic_goal 

1134 
schematic_corollary ~> schematic_goal 

1135 

1136 
Commandline tool "isabelle update_theorems" updates theory sources 

1137 
accordingly. 

1138 

61338  1139 
* Toplevel theorem statement 'proposition' is another alias for 
1140 
'theorem'. 

1141 

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

1144 
deferred definitions require a surrounding 'overloading' block. 

1145 

61337  1146 

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

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

1148 

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

1152 
'SML_file_no_debug' control compilation of sources with or without 

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

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

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

1156 
any effect on the running ML program. 

60984  1157 

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

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

1161 
update. 

61729  1162 

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

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

1165 
enable option "editor_output_state". 

61215  1166 

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

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

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

1171 
visibility. 

1172 

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

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

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

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

1177 
panel. 

1178 

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

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

1180 
state output, interactive queries) wrt. longrunning background tasks. 
62017  1181 

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

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

1184 
implicit: a popup will show up unconditionally. 

1185 

1186 
* Additional abbreviations for syntactic completion may be specified in 

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

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

1189 

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

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

1191 
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

1192 
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

1193 
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

1194 

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

1197 
the editor. 

1198 

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

1200 
instead of former C+e LEFT. 

1201 

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

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

1204 
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

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

1206 

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

1209 
singleinstance applications seen on common GUI desktops. 

1210 

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

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

1212 
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

1213 
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

1214 

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

1217 

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

1220 

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

1221 

61405  1222 
*** Document preparation *** 
1223 

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

1226 

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

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

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

1230 

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

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

1233 
follows: 

1234 

1235 
\<^item> itemize 

1236 
\<^enum> enumerate 

1237 
\<^descr> description 

1238 

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

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

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

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

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

1245 

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

1248 
standard LaTeX macros of the same names. 

1249 

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

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

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

1254 
cartouche tokens seen in theory sources. 

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

1255 

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

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

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

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

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

1261 

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

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

1265 

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

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

1268 

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

1270 

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

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

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

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

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

1276 
documentation, with a hyperlink in the Prover IDE. 

1277 

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

1279 
entities of the Isar language. 

1280 

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

61488  1283 
print mode "HTML" loses its special meaning. 
61471  1284 

61405  1285 

60406  1286 
*** Isar *** 
1287 

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

1290 
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

1291 
example: 
60414  1292 

1293 
have result: "C x y" 

1294 
if "A x" and "B y" 

1295 
for x :: 'a and y :: 'a 

1296 
<proof> 

1297 

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

60414  1300 
corresponds to a raw proof block like this: 
1301 

1302 
{ 

1303 
fix x :: 'a and y :: 'a 

60449  1304 
assume that: "A x" "B y" 
60414  1305 
have "C x y" <proof> 
1306 
} 

1307 
note result = this 

60406  1308 

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

1309 
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

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

1311 

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

61658  1314 

1315 
assume result: "C x y" 

1316 
if "A x" and "B y" 

1317 
for x :: 'a and y :: 'a 

1318 

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

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

1321 

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

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

1324 
example: 

1325 

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

1327 

1328 
is equivalent to: 

1329 

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

1331 

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

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

60595  1336 

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

1338 

1339 
or: 

1340 

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

1342 

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

1344 

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

1346 

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

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

1350 
of the local context elements yet. 

1351 

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

1354 

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

1356 
then have something 

1357 
proof cases 

1358 
case a 

1359 
then show ?thesis <proof> 

1360 
next 

1361 
case b 

1362 
then show ?thesis <proof> 

1363 
next 

1364 
case c 

1365 
then show ?thesis <proof> 

1366 
qed 

1367 

60565  1368 
* Command 'case' allows fact name and attribute specification like this: 
1369 

1370 
case a: (c xs) 

1371 
case a [attributes]: (c xs) 

1372 

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

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

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

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

1377 
and always put attributes in front. 

1378 

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

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

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

1381 
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

1382 
'..' 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

1383 

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

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

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

1388 

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

1390 
supply [simp] = a 

1391 
proof 

1392 
show A by simp 

1393 
next 

1394 
show A by simp 

1395 
qed 

1396 

1397 
* Command 'obtain' binds term abbreviations (via 'is' patterns) in the 

1398 
proof body as well, abstracted over relevant parameters. 

1399 

1400 
* Improved typeinference for theorem statement 'obtains': separate 

1401 
parameter scope for of each clause. 

1402 

1403 
* Term abbreviations via 'is' patterns also work for schematic 

1404 
statements: result is abstracted over unknowns. 

1405 

60631  1406 
* Command 'subgoal' allows to impose some structure on backward 
1407 
refinements, to avoid proof scripts degenerating into long of 'apply' 

1408 
sequences. Further explanations and examples are given in the isarref 

1409 
manual. 

1410 

62017  1411 
* Command 'supply' supports fact definitions during goal refinement 
1412 
('apply' scripts). 

1413 

61166
5976fe402824
renamed method "goals" to "goal_cases" to emphasize its meaning;
wenzelm
parents:
61158
diff
changeset

1414 
* Proof method "goal_cases" turns the current subgoals into cases within 
5976fe402824
renamed method "goals" to "goal_cases" to emphasize its meaning;
wenzelm
parents:
61158
diff
changeset

1415 
the context; the conclusion is bound to variable ?case in each case. For 
5976fe402824
renamed method "goals" to "goal_cases" to emphasize its meaning;
wenzelm
parents:
61158
diff
changeset

1416 
example: 
60617  1417 

1418 
lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x" 

60622  1419 
and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z" 
61166
5976fe402824
renamed method "goals" to "goal_cases" to emphasize its meaning;
wenzelm
parents:
61158
diff
changeset

1420 
proof goal_cases 
60622  1421 
case (1 x) 
1422 
then show ?case using \<open>A x\<close> \<open>B x\<close> sorry 

1423 
next 

1424 
case (2 y z) 

1425 
then show ?case using \<open>U y\<close> \<open>V z\<close> sorry 

1426 
qed 

1427 

1428 
lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x" 

1429 
and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z" 

61166
5976fe402824
renamed method "goals" to "goal_cases" to emphasize its meaning;
wenzelm
parents:
61158
diff
changeset

1430 
proof goal_cases 
60617  1431 
case prems: 1 
1432 
then show ?case using prems sorry 

1433 
next 

1434 
case prems: 2 

1435 
then show ?case using prems sorry 

1436 
qed 

60578  1437 

60581  1438 
* The 