author  haftmann 
Sun, 16 Oct 2016 09:31:04 +0200  
changeset 64240  eabf80376aab 
parent 64122  74fde524799e 
child 64242  93c6f0da5c70 
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 

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

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

15 

16 
bundle foo 

17 
begin 

18 
declare a [simp] 

19 
declare b [intro] 

20 
end 

63272  21 

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

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

25 

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

28 
discontinued. 

29 

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

31 
delimited uniformly via cartouches. This works better than oldfashioned 

32 
quotes when sublanguages are nested. 

33 

34 
* Mixfix annotations support general block properties, with syntax 

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

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

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

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

63650  39 

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

42 

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

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

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

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

48 
examples. 

49 

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

51 
instances) are generated into companion object of corresponding type 

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

53 

54 
* Splitter in simp, auto and friends: 

55 
 The syntax "split add" has been discontinued, use plain "split", 

56 
INCOMPATIBILITY. 

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

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

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

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

61 
result the subgoal may be split into several subgoals. 

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

62 

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

63 
* Solve direct: option 'solve_direct_strict_warnings' gives explicit 
048b7dbfdfa3
option to report results of solve_direct as explicit warnings
haftmann
parents:
63995
diff
changeset

64 
warnings for lemma statements with trivial proofs. 
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 

63977  69 
* Highlighting of entity def/ref positions wrt. cursor. 
70 

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

72 
occurences of the formal entity at the caret position. This facilitates 

73 
systematic renaming. 

74 

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

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

77 
theorem statement. 

78 

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

80 
situations where old ASCII notation may be updated. 

81 

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

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

85 
inaccessible via keyboard completion). 

86 

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

89 

90 
src/Pure/ROOT0.ML 

91 
src/Pure/ROOT.ML 

92 
src/Pure/Pure.thy 

93 
src/Pure/ML_Bootstrap.thy 

94 

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

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

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

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

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

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

63307  101 
dependencies of the above files are only observed for batch build. 
62904  102 

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

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

63461  106 

63608  107 
* Sidekick parser "isabellecontext" shows nesting of context blocks 
108 
according to 'begin' and 'end' structure. 

109 

63474
f66e3c3b0fb1
semantic indentation for unstructured proof scripts;
wenzelm
parents:
63463
diff
changeset

110 
* Syntactic indentation according to Isabelle outer syntax. Action 
f66e3c3b0fb1
semantic indentation for unstructured proof scripts;
wenzelm
parents:
63463
diff
changeset

111 
"indentlines" (shortcut C+i) indents the current line according to 
f66e3c3b0fb1
semantic indentation for unstructured proof scripts;
wenzelm
parents:
63463
diff
changeset

112 
command keywords and some command substructure. Action 
63455
019856db2bb6
added action "isabelle.newline" (shortcut ENTER);
wenzelm
parents:
63453
diff
changeset

113 
"isabelle.newline" (shortcut ENTER) indents the old and the new line 
019856db2bb6
added action "isabelle.newline" (shortcut ENTER);
wenzelm
parents:
63453
diff
changeset

114 
according to command keywords only; see also option 
019856db2bb6
added action "isabelle.newline" (shortcut ENTER);
wenzelm
parents:
63453
diff
changeset

115 
"jedit_indent_newline". 
63452  116 

63474
f66e3c3b0fb1
semantic indentation for unstructured proof scripts;
wenzelm
parents:
63463
diff
changeset

117 
* Semantic indentation for unstructured proof scripts ('apply' etc.) via 
f66e3c3b0fb1
semantic indentation for unstructured proof scripts;
wenzelm
parents:
63463
diff
changeset

118 
number of subgoals. This requires information of ongoing document 
f66e3c3b0fb1
semantic indentation for unstructured proof scripts;
wenzelm
parents:
63463
diff
changeset

119 
processing and may thus lag behind, when the user is editing too 
f66e3c3b0fb1
semantic indentation for unstructured proof scripts;
wenzelm
parents:
63463
diff
changeset

120 
quickly; see also option "jedit_script_indent" and 
f66e3c3b0fb1
semantic indentation for unstructured proof scripts;
wenzelm
parents:
63463
diff
changeset

121 
"jedit_script_indent_limit". 
f66e3c3b0fb1
semantic indentation for unstructured proof scripts;
wenzelm
parents:
63463
diff
changeset

122 

63977  123 
* Refined folding mode "isabelle" based on Isar syntax: 'next' and 'qed' 
124 
are treated as delimiters for fold structure; 'begin' and 'end' 

125 
structure of theory specifications is treated as well. 

63236  126 

63751  127 
* Action "isabelle.keymapmerge" asks the user to resolve pending 
128 
Isabelle keymap changes that are in conflict with the current jEdit 

129 
keymap; nonconflicting changes are always applied implicitly. This 

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

131 
increases chances that users see new keyboard shortcuts when reusing 

132 
old keymaps. 

133 

63513
9f8d06f23c09
information about proof outline with cases (sendback);
wenzelm
parents:
63474
diff
changeset

134 
* Command 'proof' provides information about proof outline with cases, 
9f8d06f23c09
information about proof outline with cases (sendback);
wenzelm
parents:
63474
diff
changeset

135 
e.g. for proof methods "cases", "induct", "goal_cases". 
9f8d06f23c09
information about proof outline with cases (sendback);
wenzelm
parents:
63474
diff
changeset

136 

63528
0f39f59317c1
completion templates for commands involving "begin ... end" blocks;
wenzelm
parents:
63527
diff
changeset

137 
* Completion templates for commands involving "begin ... end" blocks, 
0f39f59317c1
completion templates for commands involving "begin ... end" blocks;
wenzelm
parents:
63527
diff
changeset

138 
e.g. 'context', 'notepad'. 
0f39f59317c1
completion templates for commands involving "begin ... end" blocks;
wenzelm
parents:
63527
diff
changeset

139 

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

143 
new 'abbrevs' section. 

144 

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

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

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

63579  148 

63675  149 
* ML and document antiquotations for filesystems paths are more uniform 
150 
and diverse: 

151 

152 
@{path NAME}  no filesystem check 

153 
@{file NAME}  check for plain file 

154 
@{dir NAME}  check for directory 

155 

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

157 
have to be changed. 

63669  158 

159 

63977  160 
*** Document preparation *** 
161 

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

163 

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

166 

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

169 

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

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

172 
derivatives. 

173 

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

175 

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

177 
Isabelle2015). 

178 

179 

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

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

181 

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

184 
'definition', 'inductive', 'function'. 

185 

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

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

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

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

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

191 

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

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

63039  196 

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

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

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

199 

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

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

201 
typesetting. E.g. to produce proof holes in examples and documentation. 
62216  202 

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

205 

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

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

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

209 

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

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

212 
INCOMPATIBILITY. 

62939  213 

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

216 
definitions. 

217 

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

63259  220 

221 
(use facts in simp) 

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

223 

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

226 

62216  227 

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

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

229 

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

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

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

234 

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

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

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

238 
regardless of the actual parameters that are provided. Rare 

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

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

241 

242 
* Typeinference improves sorts of newly introduced type variables for 

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

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

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

246 
INCOMPATIBILITY, need to provide explicit type constraints for Pure 

247 
types where this is really intended. 

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

248 

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

249 

62327  250 
*** HOL *** 
251 

64240  252 
* Sligthly more standardized theorem names: 
253 
sgn_times ~> sgn_mult 

254 
sgn_mult' ~> Real_Vector_Spaces.sgn_mult 

255 
divide_zero_left ~> div_0 

256 
zero_mod_left ~> mod_0 

257 
divide_zero ~> div_by_0 

258 
divide_1 ~> div_by_1 

259 
nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left 

260 
div_mult_self1_is_id ~> nonzero_mult_div_cancel_left 

261 
nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right 

262 
div_mult_self2_is_id ~> nonzero_mult_div_cancel_right 

263 
is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left 

264 
is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right 

265 
INCOMPATIBILITY. 

266 

64113  267 
* Dedicated syntax LENGTH('a) for length of types. 
268 

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

271 
propositional logic, goals based on a combination of quantifierfree 

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

273 
quantifierfree propositional logic with linear real arithmetic 

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

275 

276 
* Metis: The problem encoding has changed very slightly. This might 

63785  277 
break existing proofs. INCOMPATIBILITY. 
278 

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

280 
 The MaSh relevance filter is now faster than before. 
63116  281 
 Produce syntactically correct Vampire 4.0 problem files. 
282 

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

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

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

62335  299 
 Renamed lemmas: 
300 
rel_prod_apply ~> rel_prod_inject 

301 
pred_prod_apply ~> pred_prod_inject 

302 
INCOMPATIBILITY. 

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

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

306 
INCOMPATIBILITY. 

62327  307 

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

310 
which exposed details of the internal fixpoint construction and was 

311 
hard to use. INCOMPATIBILITY. 

312 

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

314 

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

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

317 

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

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

320 
eliminated altogether. 

321 

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

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

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

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

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

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

328 
INCOMPATIBILITY in rare situations. 

329 

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

331 
INCOMPATIBILITY. 

332 

333 
* Characters (type char) are modelled as finite algebraic type 

334 
corresponding to {0..255}. 

335 

336 
 Logical representation: 

337 
* 0 is instantiated to the ASCII zero character. 

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

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

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

341 
are noncanonical. 

342 
 Printing and parsing: 

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

344 
(as before). 

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

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

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

348 
is parsable for every numeral expression n. 

349 
* Noncanonical characters have no special syntax and are 

350 
printed as their logical representation. 

351 
 Explicit conversions from and to the natural numbers are 

352 
provided as char_of_nat, nat_of_char (as before). 

353 
 The auxiliary nibble type has been discontinued. 

354 

355 
INCOMPATIBILITY. 

356 

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

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

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

360 
infix "mod" syntax. INCOMPATIBILITY. 

361 

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

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

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

366 
easily recovered by composition with eq_refl. Minor INCOMPATIBILITY. 

367 

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

370 

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

372 
which renders those abstract effectively. 

373 

374 
* Command 'export_code' checks given constants for abstraction 

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

376 
interface for the generated code. 

377 

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

379 
spelt out explicitly. 

380 

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

382 
explicitly provided auxiliary definitions for required type class 

383 
dictionaries rather than halfworking magic. INCOMPATIBILITY, see 

384 
the tutorial on code generation for details. 

385 

386 
* Theory Set_Interval.thy: substantial new theorems on indexed sums 

387 
and products. 

388 

389 
* Theory List.thy: ranaming of listsum ~> sum_list, listprod ~> 

390 
prod_list, INCOMPATIBILITY. 

391 

392 
* Locale bijection establishes convenient default simp rules such as 

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

394 

395 
* Abstract locales semigroup, abel_semigroup, semilattice, 

396 
semilattice_neutr, ordering, ordering_top, semilattice_order, 

397 
semilattice_neutr_order, comm_monoid_set, semilattice_set, 

398 
semilattice_neutr_set, semilattice_order_set, 

399 
semilattice_order_neutr_set monoid_list, comm_monoid_list, 

400 
comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified 

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

402 
INCOMPATIBILITY. 

403 

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

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

406 
lifting_syntax begin ... end". Minor INCOMPATIBILITY. 

407 

63807  408 
* Some old / obsolete theorems have been renamed / removed, potential 
409 
INCOMPATIBILITY. 

410 

411 
nat_less_cases  removed, use linorder_cases instead 

412 
inv_image_comp  removed, use image_inv_f_f instead 

413 
image_surj_f_inv_f ~> image_f_inv_f 

63113  414 

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

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

416 
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

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

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

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

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

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

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

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

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

425 

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

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

427 
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

428 
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

429 
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

430 
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

431 
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

432 
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

433 
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

434 
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

435 
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

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

437 

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

62396  440 

63977  441 
* Added class topological_monoid. 
442 

443 
* HOLLibrary: theory FinFun bundles "finfun_syntax" and 

444 
"no_finfun_syntax" allow to control optional syntax in local contexts; 

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

446 
"unbundle finfun_syntax" to imitate import of 

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

448 

64074
7dccbbd8d71d
Set_Permutations > Multiset_Permutations in NEWS
eberlm <eberlm@in.tum.de>
parents:
64073
diff
changeset

449 
* HOLLibrary: theory Multiset_Permutations (executably) defines the set of 
64122  450 
permutations of a given set or multiset, i.e. the set of all lists that 
64074
7dccbbd8d71d
Set_Permutations > Multiset_Permutations in NEWS
eberlm <eberlm@in.tum.de>
parents:
64073
diff
changeset

451 
contain every element of the carrier (multi)set exactly once. 
63977  452 

453 
* HOLLibrary: multiset membership is now expressed using set_mset 

454 
rather than count. 

62430
9527ff088c15
more succint formulation of membership for multisets, similar to lists;
haftmann
parents:
62415
diff
changeset

455 

9527ff088c15
more succint formulation of membership for multisets, similar to lists;
haftmann
parents:
62415
diff
changeset

456 
 Expressions "count M a > 0" and similar simplify to membership 
9527ff088c15
more succint formulation of membership for multisets, similar to lists;
haftmann
parents:
62415
diff
changeset

457 
by default. 
9527ff088c15
more succint formulation of membership for multisets, similar to lists;
haftmann
parents:
62415
diff
changeset

458 

9527ff088c15
more succint formulation of membership for multisets, similar to lists;
haftmann
parents:
62415
diff
changeset

459 
 Converting between "count M a = 0" and nonmembership happens using 
9527ff088c15
more succint formulation of membership for multisets, similar to lists;
haftmann
parents:
62415
diff
changeset

460 
equations count_eq_zero_iff and not_in_iff. 
9527ff088c15
more succint formulation of membership for multisets, similar to lists;
haftmann
parents:
62415
diff
changeset

461 

9527ff088c15
more succint formulation of membership for multisets, similar to lists;
haftmann
parents:
62415
diff
changeset

462 
 Rules count_inI and in_countE obtain facts of the form 
9527ff088c15
more succint formulation of membership for multisets, similar to lists;
haftmann
parents:
62415
diff
changeset

463 
"count M a = n" from membership. 
9527ff088c15
more succint formulation of membership for multisets, similar to lists;
haftmann
parents:
62415
diff
changeset

464 

9527ff088c15
more succint formulation of membership for multisets, similar to lists;
haftmann
parents:
62415
diff
changeset

465 
 Rules count_in_diffI and in_diff_countE obtain facts of the form 
9527ff088c15
more succint formulation of membership for multisets, similar to lists;
haftmann
parents:
62415
diff
changeset

466 
"count M a = n + count N a" from membership on difference sets. 
9527ff088c15
more succint formulation of membership for multisets, similar to lists;
haftmann
parents:
62415
diff
changeset

467 

9527ff088c15
more succint formulation of membership for multisets, similar to lists;
haftmann
parents:
62415
diff
changeset

468 
INCOMPATIBILITY. 
9527ff088c15
more succint formulation of membership for multisets, similar to lists;
haftmann
parents:
62415
diff
changeset

469 

63977  470 
* HOLLibrary: theory LaTeXsugar uses newstyle "dummy_pats" for 
471 
displaying equations in functional programming style  variables 

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

473 
underscores. 

474 

475 
* HOLLibrary: theory Combinator_PER provides combinator to build 

476 
partial equivalence relations from a predicate and an equivalence 

477 
relation. 

478 

479 
* HOLLibrary: theory Perm provides basic facts about almost everywhere 

480 
fix bijections. 

481 

482 
* HOLLibrary: theory Normalized_Fraction allows viewing an element of a 

483 
field of fractions as a normalized fraction (i.e. a pair of numerator 

484 
and denominator such that the two are coprime and the denominator is 

485 
normalized wrt. unit factors). 

486 

487 
* Session HOLNSA has been renamed to HOLNonstandard_Analysis. 

488 

489 
* Session HOLMultivariate_Analysis has been renamed to HOLAnalysis. 

490 

491 
* HOLAnalysis: measure theory has been moved here from HOLProbability. 

492 
When importing HOLAnalysis some theorems need additional name spaces 

493 
prefixes due to name clashes. INCOMPATIBILITY. 

494 

495 
* HOLAnalysis: more complex analysis including Cauchy's inequality, 

496 
Liouville theorem, open mapping theorem, maximum modulus principle, 

497 
Residue theorem, Schwarz Lemma. 

498 

499 
* HOLAnalysis: Theory of polyhedra: faces, extreme points, polytopes, 

500 
and the Kreinâ€“Milman Minkowski theorem. 

501 

502 
* HOLAnalysis: Numerous results ported from the HOL Light libraries: 

64122  503 
homeomorphisms, continuous function extensions, invariance of domain. 
63977  504 

505 
* HOLProbability: the type of emeasure and nn_integral was changed from 

506 
ereal to ennreal, INCOMPATIBILITY. 

507 

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

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

510 

511 
* HOLProbability: Code generation and QuickCheck for Probability Mass 

512 
Functions. 

513 

514 
* HOLProbability: theory Random_Permutations contains some theory about 

515 
choosing a permutation of a set uniformly at random and folding over a 

516 
list in random order. 

517 

518 
* HOLProbability: theory SPMF formalises discrete subprobability 

519 
distributions. 

520 

521 
* HOLNumber_Theory: algebraic foundation for primes: Generalisation of 

522 
predicate "prime" and introduction of predicates "prime_elem", 

523 
"irreducible", a "prime_factorization" function, and the 

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

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

526 
"prime_nat_iff". INCOMPATIBILITY. 

527 

528 
* HOLLibrary: the names of multiset theorems have been normalised to 

529 
distinguish which ordering the theorems are about 

530 

63310
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

531 
mset_less_eqI ~> mset_subset_eqI 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

532 
mset_less_insertD ~> mset_subset_insertD 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

533 
mset_less_eq_count ~> mset_subset_eq_count 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

534 
mset_less_diff_self ~> mset_subset_diff_self 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

535 
mset_le_exists_conv ~> mset_subset_eq_exists_conv 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

536 
mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

537 
mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

538 
mset_le_mono_add ~> mset_subset_eq_mono_add 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

539 
mset_le_add_left ~> mset_subset_eq_add_left 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

540 
mset_le_add_right ~> mset_subset_eq_add_right 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

541 
mset_le_single ~> mset_subset_eq_single 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

542 
mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

543 
diff_le_self ~> diff_subset_eq_self 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

544 
mset_leD ~> mset_subset_eqD 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

545 
mset_lessD ~> mset_subsetD 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

546 
mset_le_insertD ~> mset_subset_eq_insertD 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

547 
mset_less_of_empty ~> mset_subset_of_empty 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

548 
mset_less_size ~> mset_subset_size 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

549 
wf_less_mset_rel ~> wf_subset_mset_rel 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

550 
count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

551 
mset_remdups_le ~> mset_remdups_subset_eq 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

552 
ms_lesseq_impl ~> subset_eq_mset_impl 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

553 

63977  554 
Some functions have been renamed: 
63310
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

555 
ms_lesseq_impl > subset_eq_mset_impl 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

556 

63977  557 
* HOLLibrary: multisets are now ordered with the multiset ordering 
63388
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

558 
#\<subseteq># ~> \<le> 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

559 
#\<subset># ~> < 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

560 
le_multiset ~> less_eq_multiset 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

561 
less_multiset ~> le_multiset 
63407
89dd1345a04f
leverage new 'order' type class instantiation in multiset
blanchet
parents:
63388
diff
changeset

562 
INCOMPATIBILITY. 
63388
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

563 

63977  564 
* HOLLibrary: the prefix multiset_order has been discontinued: the 
565 
theorems can be directly accessed. As a consequence, the lemmas 

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

567 
interpretations "multiset_linorder" and "multiset_wellorder" have been 

568 
replaced by instantiations. INCOMPATIBILITY. 

569 

570 
* HOLLibrary: some theorems about the multiset ordering have been 

571 
renamed: 

572 

63388
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

573 
le_multiset_def ~> less_eq_multiset_def 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

574 
less_multiset_def ~> le_multiset_def 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

575 
less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

576 
mult_less_not_refl ~> mset_le_not_refl 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

577 
mult_less_trans ~> mset_le_trans 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

578 
mult_less_not_sym ~> mset_le_not_sym 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

579 
mult_less_asym ~> mset_le_asym 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

580 
mult_less_irrefl ~> mset_le_irrefl 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

581 
union_less_mono2{,1,2} ~> union_le_mono2{,1,2} 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

582 

a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

583 
le_multiset\<^sub>H\<^sub>O ~> less_eq_multiset\<^sub>H\<^sub>O 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

584 
le_multiset_total ~> less_eq_multiset_total 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

585 
less_multiset_right_total ~> subset_eq_imp_le_multiset 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

586 
le_multiset_empty_left ~> less_eq_multiset_empty_left 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

587 
le_multiset_empty_right ~> less_eq_multiset_empty_right 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

588 
less_multiset_empty_right ~> le_multiset_empty_left 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

589 
less_multiset_empty_left ~> le_multiset_empty_right 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

590 
union_less_diff_plus ~> union_le_diff_plus 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

591 
ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

592 
less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

593 
le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty 
63407
89dd1345a04f
leverage new 'order' type class instantiation in multiset
blanchet
parents:
63388
diff
changeset

594 
INCOMPATIBILITY. 
63388
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

595 

63977  596 
* HOLLibrary: the lemma mset_map has now the attribute [simp]. 
597 
INCOMPATIBILITY. 

598 

599 
* HOLLibrary: some theorems about multisets have been removed. 

600 
INCOMPATIBILITY, use the following replacements: 

601 

63525
f01d1e393f3f
more instantiations for multiset
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63524
diff
changeset

602 
le_multiset_plus_plus_left_iff ~> add_less_cancel_right 
64097
331fbf2a0d2d
clarifying NEWS file
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
64076
diff
changeset

603 
less_multiset_plus_plus_left_iff ~> add_less_cancel_right 
63525
f01d1e393f3f
more instantiations for multiset
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63524
diff
changeset

604 
le_multiset_plus_plus_right_iff ~> add_less_cancel_left 
64097
331fbf2a0d2d
clarifying NEWS file
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
64076
diff
changeset

605 
less_multiset_plus_plus_right_iff ~> add_less_cancel_left 
63525
f01d1e393f3f
more instantiations for multiset
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63524
diff
changeset

606 
add_eq_self_empty_iff ~> add_cancel_left_right 
63793
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

607 
mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right 
64097
331fbf2a0d2d
clarifying NEWS file
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
64076
diff
changeset

608 
mset_less_add_bothsides ~> subset_mset.add_less_cancel_right 
331fbf2a0d2d
clarifying NEWS file
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
64076
diff
changeset

609 
mset_le_add_bothsides ~> subset_mset.add_less_cancel_right 
64076  610 
empty_inter ~> subset_mset.inf_bot_left 
611 
inter_empty ~> subset_mset.inf_bot_right 

612 
empty_sup ~> subset_mset.sup_bot_left 

613 
sup_empty ~> subset_mset.sup_bot_right 

614 
bdd_below_multiset ~> subset_mset.bdd_above_bot 

615 
subset_eq_empty ~> subset_mset.le_zero_eq 

64097
331fbf2a0d2d
clarifying NEWS file
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
64076
diff
changeset

616 
le_empty ~> subset_mset.le_zero_eq 
64076  617 
mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero 
64097
331fbf2a0d2d
clarifying NEWS file
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
64076
diff
changeset

618 
mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero 
63977  619 

620 
* HOLLibrary: some typeclass constraints about multisets have been 

621 
reduced from ordered or linordered to preorder. Multisets have the 

622 
additional typeclasses order_bot, no_top, 

623 
ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add, 

624 
linordered_cancel_ab_semigroup_add, and 

625 
ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY. 

626 

627 
* HOLLibrary: there are some new simplification rules about multisets, 

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

629 
INCOMPATIBILITY. 

630 

631 
* HOLLibrary: the subset ordering on multisets has now the 

632 
interpretations ordered_ab_semigroup_monoid_add_imp_le and 

633 
bounded_lattice_bot. INCOMPATIBILITY. 

634 

635 
* HOLLibrary/Multiset: single has been removed in favor of add_mset 

636 
that roughly corresponds to Set.insert. Some theorems have removed or 

637 
changed: 

638 

63793
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

639 
single_not_empty ~> add_mset_not_empty or empty_not_add_mset 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

640 
fold_mset_insert ~> fold_mset_add_mset 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

641 
image_mset_insert ~> image_mset_add_mset 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

642 
union_single_eq_diff 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

643 
multi_self_add_other_not_self 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

644 
diff_single_eq_union 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

645 
INCOMPATIBILITY. 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

646 

63977  647 
* HOLLibrary/Multiset: some theorems have been changed to use add_mset 
648 
instead of single: 

649 

63793
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

650 
mset_add 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

651 
multi_self_add_other_not_self 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

652 
diff_single_eq_union 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

653 
union_single_eq_diff 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

654 
union_single_eq_member 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

655 
add_eq_conv_diff 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

656 
insert_noteq_member 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

657 
add_eq_conv_ex 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

658 
multi_member_split 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

659 
multiset_add_sub_el_shuffle 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

660 
mset_subset_eq_insertD 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

661 
mset_subset_insertD 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

662 
insert_subset_eq_iff 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

663 
insert_union_subset_iff 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

664 
multi_psub_of_add_self 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

665 
inter_add_left1 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

666 
inter_add_left2 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

667 
inter_add_right1 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

668 
inter_add_right2 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

669 
sup_union_left1 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

670 
sup_union_left2 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

671 
sup_union_right1 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

672 
sup_union_right2 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

673 
size_eq_Suc_imp_eq_union 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

674 
multi_nonempty_split 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

675 
mset_insort 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

676 
mset_update 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

677 
mult1I 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

678 
less_add 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

679 
mset_zip_take_Cons_drop_twice 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

680 
rel_mset_Zero 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

681 
msed_map_invL 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

682 
msed_map_invR 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

683 
msed_rel_invL 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

684 
msed_rel_invR 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

685 
le_multiset_right_total 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

686 
multiset_induct 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

687 
multiset_induct2_size 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

688 
multiset_induct2 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

689 
INCOMPATIBILITY. 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

690 

63977  691 
* HOLLibrary/Multiset. The definitions of some constants have changed 
692 
to use add_mset instead of adding a single element: 

63793
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

693 
image_mset 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

694 
mset 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

695 
replicate_mset 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

696 
mult1 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

697 
pred_mset 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

698 
rel_mset' 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

699 
mset_insort 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

700 
INCOMPATIBILITY. 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

701 

63977  702 
* HOLLibrary/Multiset. Due to the above changes, the attributes of some 
703 
multiset theorems have been changed: 

63793
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

704 
insert_DiffM [] ~> [simp] 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

705 
insert_DiffM2 [simp] ~> [] 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

706 
diff_add_mset_swap [simp] 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

707 
fold_mset_add_mset [simp] 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

708 
diff_diff_add [simp] (for multisets only) 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

709 
diff_cancel [simp] ~> [] 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

710 
count_single [simp] ~> [] 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

711 
set_mset_single [simp] ~> [] 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

712 
size_multiset_single [simp] ~> [] 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

713 
size_single [simp] ~> [] 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

714 
image_mset_single [simp] ~> [] 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

715 
mset_subset_eq_mono_add_right_cancel [simp] ~> [] 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

716 
mset_subset_eq_mono_add_left_cancel [simp] ~> [] 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

717 
fold_mset_single [simp] ~> [] 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

718 
subset_eq_empty [simp] ~> [] 
63795
7f6128adfe67
tuning multisets; more interpretations
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63793
diff
changeset

719 
empty_sup [simp] ~> [] 
7f6128adfe67
tuning multisets; more interpretations
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63793
diff
changeset

720 
sup_empty [simp] ~> [] 
7f6128adfe67
tuning multisets; more interpretations
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63793
diff
changeset

721 
inter_empty [simp] ~> [] 
7f6128adfe67
tuning multisets; more interpretations
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63793
diff
changeset

722 
empty_inter [simp] ~> [] 
63793
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

723 
INCOMPATIBILITY. 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

724 

63977  725 
* HOLLibrary/Multiset. The order of the variables in the second cases 
726 
of multiset_induct, multiset_induct2_size, multiset_induct2 has been 

727 
changed (e.g. Add A a ~> Add a A). INCOMPATIBILITY. 

728 

729 
* HOLLibrary/Multiset. There is now a simplification procedure on 

730 
multisets. It mimics the behavior of the procedure on natural numbers. 

731 
INCOMPATIBILITY. 

732 

733 
* HOLLibrary/Multiset. Renamed sums and products of multisets: 

63830  734 
msetsum ~> sum_mset 
735 
msetprod ~> prod_mset 

736 

63977  737 
* HOLLibrary/Multiset. The notation for intersection and union of 
738 
multisets have been changed: 

63919
9aed2da07200
# after multiset intersection and union symbol
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63918
diff
changeset

739 
#\<inter> ~> \<inter># 
9aed2da07200
# after multiset intersection and union symbol
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63918
diff
changeset

740 
#\<union> ~> \<union># 
9aed2da07200
# after multiset intersection and union symbol
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63918
diff
changeset

741 
INCOMPATIBILITY. 
9aed2da07200
# after multiset intersection and union symbol
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63918
diff
changeset

742 

63977  743 
* HOLLibrary/Multiset. The lemma one_step_implies_mult_aux on multisets 
744 
has been removed, use one_step_implies_mult instead. INCOMPATIBILITY. 

63795
7f6128adfe67
tuning multisets; more interpretations
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63793
diff
changeset

745 

63918
6bf55e6e0b75
left_distrib ~> distrib_right, right_distrib ~> distrib_left
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63917
diff
changeset

746 
* The following theorems have been renamed: 
6bf55e6e0b75
left_distrib ~> distrib_right, right_distrib ~> distrib_left
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63917
diff
changeset

747 
setsum_left_distrib ~> setsum_distrib_right 
6bf55e6e0b75
left_distrib ~> distrib_right, right_distrib ~> distrib_left
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63917
diff
changeset

748 
setsum_right_distrib ~> setsum_distrib_left 
6bf55e6e0b75
left_distrib ~> distrib_right, right_distrib ~> distrib_left
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63917
diff
changeset

749 
INCOMPATIBILITY. 
6bf55e6e0b75
left_distrib ~> distrib_right, right_distrib ~> distrib_left
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63917
diff
changeset

750 

62343
24106dc44def
prefer abbreviations for compound operators INFIMUM and SUPREMUM
haftmann
parents:
62335
diff
changeset

751 
* Compound constants INFIMUM and SUPREMUM are mere abbreviations now. 
24106dc44def
prefer abbreviations for compound operators INFIMUM and SUPREMUM
haftmann
parents:
62335
diff
changeset

752 
INCOMPATIBILITY. 
24106dc44def
prefer abbreviations for compound operators INFIMUM and SUPREMUM
haftmann
parents:
62335
diff
changeset

753 

62358  754 
* "Gcd (f ` A)" and "Lcm (f ` A)" are printed with optional 
755 
comprehensionlike syntax analogously to "Inf (f ` A)" and "Sup (f ` A)". 

756 

62345  757 
* Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY. 
758 

62376
85f38d5f8807
Rename ordered_comm_monoid_add to ordered_cancel_comm_monoid_add. Introduce ordreed_comm_monoid_add, canonically_ordered_comm_monoid and dioid. Setup nat, entat and ennreal as dioids.
hoelzl
parents:
62358
diff
changeset

759 
* The type class ordered_comm_monoid_add is now called 
63977  760 
ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add 
761 
is introduced as the combination of ordered_ab_semigroup_add + 

762 
comm_monoid_add. INCOMPATIBILITY. 

763 

764 
* Introduced the type classes canonically_ordered_comm_monoid_add and 

765 
dioid. 

62376
85f38d5f8807
Rename ordered_comm_monoid_add to ordered_cancel_comm_monoid_add. Introduce ordreed_comm_monoid_add, canonically_ordered_comm_monoid and dioid. Setup nat, entat and ennreal as dioids.
hoelzl
parents:
62358
diff
changeset

766 

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

767 
* Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When 
63977  768 
instantiating linordered_semiring_strict and ordered_ab_group_add, an 
769 
explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might 

770 
be required. INCOMPATIBILITY. 

771 

772 
* HOLLibrary: theory Complete_Partial_Order2 provides reasoning support 

773 
for monotonicity and continuity in chaincomplete partial orders and 

774 
about admissibility conditions for fixpoint inductions. 

775 

776 
* HOLLibrary: theory Polynomial contains also derivation of polynomials 

777 
but not gcd/lcm on polynomials over fields. This has been moved to a 

778 
separate theory Library/Polynomial_GCD_euclidean.thy, to pave way for a 

779 
possible future different type class instantiation for polynomials over 

780 
factorial rings. INCOMPATIBILITY. 

781 

782 
* HOLLibrary: theory Sublist.thy provides function "prefixes" with the 

783 
following renaming 

784 

63173  785 
prefixeq > prefix 
786 
prefix > strict_prefix 

787 
suffixeq > suffix 

788 
suffix > strict_suffix 

63977  789 

790 
Added theory of longest common prefixes. 

63117  791 

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

794 
lcm_left_commute_nat ~> lcm.left_commute 

795 
lcm_left_commute_int ~> lcm.left_commute 

796 
gcd_left_commute_nat ~> gcd.left_commute 

797 
gcd_left_commute_int ~> gcd.left_commute 

798 
gcd_greatest_iff_nat ~> gcd_greatest_iff 

799 
gcd_greatest_iff_int ~> gcd_greatest_iff 

800 
coprime_dvd_mult_nat ~> coprime_dvd_mult 

801 
coprime_dvd_mult_int ~> coprime_dvd_mult 

802 
zpower_numeral_even ~> power_numeral_even 

803 
gcd_mult_cancel_nat ~> gcd_mult_cancel 

804 
gcd_mult_cancel_int ~> gcd_mult_cancel 

805 
div_gcd_coprime_nat ~> div_gcd_coprime 

806 
div_gcd_coprime_int ~> div_gcd_coprime 

807 
zpower_numeral_odd ~> power_numeral_odd 

808 
zero_less_int_conv ~> of_nat_0_less_iff 

809 
gcd_greatest_nat ~> gcd_greatest 

810 
gcd_greatest_int ~> gcd_greatest 

811 
coprime_mult_nat ~> coprime_mult 

812 
coprime_mult_int ~> coprime_mult 

813 
lcm_commute_nat ~> lcm.commute 

814 
lcm_commute_int ~> lcm.commute 

815 
int_less_0_conv ~> of_nat_less_0_iff 

816 
gcd_commute_nat ~> gcd.commute 

817 
gcd_commute_int ~> gcd.commute 

818 
Gcd_insert_nat ~> Gcd_insert 

819 
Gcd_insert_int ~> Gcd_insert 

820 
of_int_int_eq ~> of_int_of_nat_eq 

821 
lcm_least_nat ~> lcm_least 

822 
lcm_least_int ~> lcm_least 

823 
lcm_assoc_nat ~> lcm.assoc 

824 
lcm_assoc_int ~> lcm.assoc 

825 
int_le_0_conv ~> of_nat_le_0_iff 

826 
int_eq_0_conv ~> of_nat_eq_0_iff 

827 
Gcd_empty_nat ~> Gcd_empty 

828 
Gcd_empty_int ~> Gcd_empty 

829 
gcd_assoc_nat ~> gcd.assoc 

830 
gcd_assoc_int ~> gcd.assoc 

831 
zero_zle_int ~> of_nat_0_le_iff 

832 
lcm_dvd2_nat ~> dvd_lcm2 

833 
lcm_dvd2_int ~> dvd_lcm2 

834 
lcm_dvd1_nat ~> dvd_lcm1 

835 
lcm_dvd1_int ~> dvd_lcm1 

836 
gcd_zero_nat ~> gcd_eq_0_iff 

837 
gcd_zero_int ~> gcd_eq_0_iff 

838 
gcd_dvd2_nat ~> gcd_dvd2 

839 
gcd_dvd2_int ~> gcd_dvd2 

840 
gcd_dvd1_nat ~> gcd_dvd1 

841 
gcd_dvd1_int ~> gcd_dvd1 

842 
int_numeral ~> of_nat_numeral 

843 
lcm_ac_nat ~> ac_simps 

844 
lcm_ac_int ~> ac_simps 

845 
gcd_ac_nat ~> ac_simps 

846 
gcd_ac_int ~> ac_simps 

847 
abs_int_eq ~> abs_of_nat 

848 
zless_int ~> of_nat_less_iff 

849 
zdiff_int ~> of_nat_diff 

850 
zadd_int ~> of_nat_add 

851 
int_mult ~> of_nat_mult 

852 
int_Suc ~> of_nat_Suc 

853 
inj_int ~> inj_of_nat 

854 
int_1 ~> of_nat_1 

855 
int_0 ~> of_nat_0 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

878 
coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff 
62348  879 
realpow_minus_mult ~> power_minus_mult 
880 
realpow_Suc_le_self ~> power_Suc_le_self 

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

881 
dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest 
62347  882 
INCOMPATIBILITY. 
883 

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

884 
* Renamed HOL/Quotient_Examples/FSet.thy to 
63977  885 
HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY. 
886 

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

887 

62498  888 
*** ML *** 
889 

63669  890 
* ML antiquotation @{path} is superseded by @{file}, which ensures that 
891 
the argument is a plain file. Minor INCOMPATIBILITY. 

892 

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

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

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

897 
INCOMPATIBILITY. 

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

898 

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

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

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

906 

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

909 
requiring separate files. 

910 

62851  911 
* Lowlevel ML system structures (like PolyML and RunCall) are no longer 
62886
72c475e03e22
simplified bootstrap: critical structures remain accessible in ML_Root context;
wenzelm
parents:
62875
diff
changeset

912 
exposed to Isabelle/ML userspace. Potential INCOMPATIBILITY. 
62851  913 

62662
291cc01f56f5
@{make_string} is available during Pure bootstrap;
wenzelm
parents:
62645
diff
changeset

914 
* Antiquotation @{make_string} is available during Pure bootstrap  
291cc01f56f5
@{make_string} is available during Pure bootstrap;
wenzelm
parents:
62645
diff
changeset

915 
with approximative output quality. 
291cc01f56f5
@{make_string} is available during Pure bootstrap;
wenzelm
parents:
62645
diff
changeset

916 

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

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

920 
debugger information requires consirable time and space: main 

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

922 

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

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

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

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

928 
balanced blocks of Local_Theory.open_target versus 

929 
Local_Theory.close_target instead. Rare INCOMPATIBILITY. 

930 

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

933 
INCOMPATIBILITY. 

934 

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

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

938 
File.full_path). Potential INCOMPATIBILITY. 

939 

63352  940 
* Binding.empty_atts supersedes Thm.empty_binding and 
941 
Attrib.empty_binding. Minor INCOMPATIBILITY. 

942 

62498  943 

62354  944 
*** System *** 
945 

62840
d9744f41a4ec
renamed ISABELLE_BUILD_JAVA_OPTIONS to ISABELLE_TOOL_JAVA_OPTIONS;
wenzelm
parents:
62807
diff
changeset

946 
* Many Isabelle tools that require a Java runtime system refer to the 
d9744f41a4ec
renamed ISABELLE_BUILD_JAVA_OPTIONS to ISABELLE_TOOL_JAVA_OPTIONS;
wenzelm
parents:
62807
diff
changeset

947 
settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64, 
d9744f41a4ec
renamed ISABELLE_BUILD_JAVA_OPTIONS to ISABELLE_TOOL_JAVA_OPTIONS;
wenzelm
parents:
62807
diff
changeset

948 
depending on the underlying platform. The settings for "isabelle build" 
d9744f41a4ec
renamed ISABELLE_BUILD_JAVA_OPTIONS to ISABELLE_TOOL_JAVA_OPTIONS;
wenzelm
parents:
62807
diff
changeset

949 
ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been 
d9744f41a4ec
renamed ISABELLE_BUILD_JAVA_OPTIONS to ISABELLE_TOOL_JAVA_OPTIONS;
wenzelm
parents:
62807
diff
changeset

950 
discontinued. Potential INCOMPATIBILITY. 
d9744f41a4ec
renamed ISABELLE_BUILD_JAVA_OPTIONS to ISABELLE_TOOL_JAVA_OPTIONS;
wenzelm
parents:
62807
diff
changeset

951 

62591  952 
* The Isabelle system environment always ensures that the main 
953 
executables are found within the shell search $PATH: "isabelle" and 

954 
"isabelle_scala_script". 

955 

63226  956 
* Isabelle tools may consist of .scala files: the Scala compiler is 
957 
invoked on the spot. The source needs to define some object that extends 

958 
Isabelle_Tool.Body. 

959 

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

962 
particular: 

963 

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

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

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

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

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

968 

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

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

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

972 

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

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

974 
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

975 
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

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

977 

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

978 
* Commandline tool "isabelle console" provides option r to help to 
cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

979 
bootstrapping Isabelle/Pure interactively. 
cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

980 

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

981 
* Commandline tool "isabelle yxml" has been discontinued. 
cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

982 
INCOMPATIBILITY, use operations from the modules "XML" and "YXML" in 
cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

983 
Isabelle/ML or Isabelle/Scala. 
cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

984 

62549
9498623b27f0
File.bash_string operations in ML as in Scala  exclusively for GNU bash, not perl and not user output;
wenzelm
parents:
62525
diff
changeset

985 
* File.bash_string, File.bash_path etc. represent Isabelle/ML and 
9498623b27f0
File.bash_string operations in ML as in Scala  exclusively for GNU bash, not perl and not user output;
wenzelm
parents:
62525
diff
changeset

986 
Isabelle/Scala strings authentically within GNU bash. This is useful to 
9498623b27f0
File.bash_string operations in ML as in Scala  exclusively for GNU bash, not perl and not user output;
wenzelm
parents:
62525
diff
changeset

987 
produce robust shell scripts under program control, without worrying 
9498623b27f0
File.bash_string operations in ML as in Scala  exclusively for GNU bash, not perl and not user output;
wenzelm
parents:
62525
diff
changeset

988 
about spaces or special characters. Note that user output works via 
9498623b27f0
File.bash_string operations in ML as in Scala  exclusively for GNU bash, not perl and not user output;
wenzelm
parents:
62525
diff
changeset

989 
Path.print (ML) or Path.toString (Scala). INCOMPATIBILITY, the old (and 
9498623b27f0
File.bash_string operations in ML as in Scala  exclusively for GNU bash, not perl and not user output;
wenzelm
parents:
62525
diff
changeset

990 
less versatile) operations File.shell_quote, File.shell_path etc. have 
9498623b27f0
File.bash_string operations in ML as in Scala  exclusively for GNU bash, not perl and not user output;
wenzelm
parents:
62525
diff
changeset

991 
been discontinued. 
9498623b27f0
File.bash_string operations in ML as in Scala  exclusively for GNU bash, not perl and not user output;
wenzelm
parents:
62525
diff
changeset

992 

62591  993 
* SML/NJ and old versions of Poly/ML are no longer supported. 
994 

62642  995 
* Poly/ML heaps now follow the hierarchy of sessions, and thus require 
996 
much less disk space. 

997 

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

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

999 
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

1000 
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

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

1002 

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

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

1004 
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

1005 
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

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

1007 

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

1010 
but without the Isabelle settings environment. 

1011 

62354  1012 

1013 

62031  1014 
New in Isabelle2016 (February 2016) 
62016  1015 
 
60138  1016 

61337  1017 
*** General *** 
1018 

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

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

1020 
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

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

1022 
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

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

1024 

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

1027 

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

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

1031 
has been removed (see below). 

1032 

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

62017  1035 

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

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

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

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

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

1040 

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

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

1042 
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

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

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

1045 

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

1048 
to update old sources. 

1049 

61337  1050 
* Toplevel theorem statements have been simplified as follows: 
1051 

1052 
theorems ~> lemmas 

1053 
schematic_lemma ~> schematic_goal 

1054 
schematic_theorem ~> schematic_goal 

1055 
schematic_corollary ~> schematic_goal 

1056 

1057 
Commandline tool "isabelle update_theorems" updates theory sources 

1058 
accordingly. 

1059 

61338  1060 
* Toplevel theorem statement 'proposition' is another alias for 
1061 
'theorem'. 

1062 

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

1065 
deferred definitions require a surrounding 'overloading' block. 

1066 

61337  1067 

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

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

1069 

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

1073 
'SML_file_no_debug' control compilation of sources with or without 

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

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

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

1077 
any effect on the running ML program. 

60984  1078 

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

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

1082 
update. 

61729  1083 

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

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

1086 
enable option "editor_output_state". 

61215  1087 

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

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

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

1092 
visibility. 

1093 

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

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

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

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

1098 
panel. 

1099 

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

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

1101 
state output, interactive queries) wrt. longrunning background tasks. 
62017  1102 

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

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

1105 
implicit: a popup will show up unconditionally. 

1106 

1107 
* Additional abbreviations for syntactic completion may be specified in 

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

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

1110 

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

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

1112 
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

1113 
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

1114 
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

1115 

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

1118 
the editor. 

1119 

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

1121 
instead of former C+e LEFT. 

1122 

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

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

1125 
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

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

1127 

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

1130 
singleinstance applications seen on common GUI desktops. 

1131 

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

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

1133 
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

1134 
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

1135 

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

1138 

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

1141 

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

1142 

61405  1143 
*** Document preparation *** 
1144 

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

1147 

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

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

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

1151 

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

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

1154 
follows: 

1155 

1156 
\<^item> itemize 

1157 
\<^enum> enumerate 

1158 
\<^descr> description 

1159 

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

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

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

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

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

1166 

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

1169 
standard LaTeX macros of the same names. 

1170 

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

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

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

1175 
cartouche tokens seen in theory sources. 

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

1176 

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

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

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

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

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

1182 

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

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

1186 

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

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

1189 

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

1191 

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

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

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

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

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

1197 
documentation, with a hyperlink in the Prover IDE. 

1198 

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

1200 
entities of the Isar language. 

1201 

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

61488  1204 
print mode "HTML" loses its special meaning. 
61471  1205 

61405  1206 

60406  1207 
*** Isar *** 
1208 

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

1211 
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

1212 
example: 
60414  1213 

1214 
have result: "C x y" 

1215 
if "A x" and "B y" 

1216 
for x :: 'a and y :: 'a 

1217 
<proof> 

1218 

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

60414  1221 
corresponds to a raw proof block like this: 
1222 

1223 
{ 

1224 
fix x :: 'a and y :: 'a 

60449  1225 
assume that: "A x" "B y" 
60414  1226 
have "C x y" <proof> 
1227 
} 

1228 
note result = this 

60406  1229 

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

1230 
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

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

1232 

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

61658  1235 

1236 
assume result: "C x y" 

1237 
if "A x" and "B y" 

1238 
for x :: 'a and y :: 'a 

1239 

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

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

1242 

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

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

1245 
example: 

1246 

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

1248 

1249 
is equivalent to: 

1250 

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

1252 

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

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

60595  1257 

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

1259 

1260 
or: 

1261 

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

1263 

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

1265 

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

1267 

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

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

1271 
of the local context elements yet. 

1272 

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

1275 

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

1277 
then have something 

1278 
proof cases 

1279 
case a 

1280 
then show ?thesis <proof> 

1281 
next 

1282 
case b 

1283 
then show ?thesis <proof> 

1284 
next 

1285 
case c 

1286 
then show ?thesis <proof> 

1287 
qed 

1288 

60565  1289 
* Command 'case' allows fact name and attribute specification like this: 
1290 

1291 
case a: (c xs) 

1292 
case a [attributes]: (c xs) 

1293 

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

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

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

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

1298 
and always put attributes in front. 

1299 

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

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

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

1302 
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

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

1304 

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

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

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

1309 

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

1311 
supply [simp] = a 

1312 
proof 

1313 
show A by simp 

1314 
next 

1315 
show A by simp 

1316 
qed 

1317 

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

1319 
proof body as well, abstracted over relevant parameters. 

1320 

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

1322 
parameter scope for of each clause. 

1323 

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

1325 
statements: result is abstracted over unknowns. 

1326 

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

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

1330 
manual. 

1331 

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

1334 

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

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

1336 
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

1337 
example: 
60617  1338 

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

60622  1340 
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

1341 
proof goal_cases 
60622  1342 
case (1 x) 
1343 
then show ?case using \<open>A x\<close> \<open>B x\<close> sorry 

1344 
next 

1345 
case (2 y z) 

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

1347 
qed 

1348 

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

1350 
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

1351 
proof goal_cases 
60617  1352 
case prems: 1 
1353 
then show ?case using prems sorry 

1354 
next 

1355 
case prems: 2 

1356 
then show ?case using prems sorry 

1357 
qed 

60578  1358 

60581  1359 
* The undocumented feature of implicit cases goal1, goal2, goal3, etc. 
60617  1360 
is marked as legacy, and will be removed eventually. The proof method 
1361 
"goals" achieves a similar effect within regular Isar; often it can be 

1362 
done more adequately by other means (e.g. 'consider'). 

60581  1363 

62017  1364 
* The vacuous fact "TERM x" may be established "by fact" or as `TERM x` 
1365 
as well, not just "by this" or "." as before. 

60551  1366 

60554  1367 
* Method "sleep" succeeds after a realtime delay (in seconds). This is 
1368 
occasionally useful for demonstration and testing purposes. 

1369 

60406  1370 

60331  1371 
*** Pure *** 
1372 

61606
6d5213bd9709
uniform mandatory qualifier for all locale expressions, including 'statespace' parent;
wenzelm
parents:
61604
diff
changeset

1373 
* Qualifiers in locale expressions default to mandatory ('!') regardless 
6d5213bd9709
uniform mandatory qualifier for all locale expressions, including 'statespace' parent;
wenzelm
parents:
61604
diff
changeset

1374 
of the command. Previously, for 'locale' and 'sublocale' the default was 
6d5213bd9709
uniform mandatory qualifier for all locale expressions, including 'statespace' parent;
wenzelm
parents:
61604
diff
changeset

1375 
optional ('?'). The old synatx '!' has been discontinued. 
6d5213bd9709
uniform mandatory qualifier for all locale expressions, including 'statespace' parent;
wenzelm
parents:
61604
diff
changeset

1376 
INCOMPATIBILITY, remove '!' and add '?' as required. 
61565
352c73a689da
Qualifiers in locale expressions default to mandatory regardless of the command.
ballarin
parents:
61551
diff
changeset

1377 

61566
c3d6e570ccef
Keyword 'rewrites' identifies rewrite morphisms.
ballarin
parents:
61565
diff
changeset

1378 
* Keyword 'rewrites' identifies rewrite morphisms in interpretation 
62017  1379 
commands. Previously, the keyword was 'where'. INCOMPATIBILITY. 
61566
c3d6e570ccef
Keyword 'rewrites' identifies rewrite morphisms.
ballarin
parents:
61565
diff
changeset

1380 

61701
e89cfc004f18
Refine the supression of abbreviations for morphisms that are not identities.
ballarin
parents:
61694
diff
changeset

1381 
* More gentle suppression of syntax along locale morphisms while 
62017  1382 
printing terms. Previously 'abbreviation' and 'notation' declarations 
1383 
would be suppressed for morphisms except term identity. Now 

61701
e89cfc004f18
Refine the supression of abbreviations for morphisms that are not identities.
ballarin
parents:
61694 