author  wenzelm 
Fri, 07 Oct 2016 10:31:34 +0200  
changeset 64073  cffd5f537206 
parent 64072  9f96e4da3064 
child 64074  7dccbbd8d71d 
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 

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

254 
propositional logic, goals based on a combination of quantifierfree 

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

256 
quantifierfree propositional logic with linear real arithmetic 

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

258 

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

63785  260 
break existing proofs. INCOMPATIBILITY. 
261 

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

263 
 The MaSh relevance filter is now faster than before. 
63116  264 
 Produce syntactically correct Vampire 4.0 problem files. 
265 

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

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

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

62335  282 
 Renamed lemmas: 
283 
rel_prod_apply ~> rel_prod_inject 

284 
pred_prod_apply ~> pred_prod_inject 

285 
INCOMPATIBILITY. 

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

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

289 
INCOMPATIBILITY. 

62327  290 

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

293 
which exposed details of the internal fixpoint construction and was 

294 
hard to use. INCOMPATIBILITY. 

295 

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

297 

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

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

300 

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

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

303 
eliminated altogether. 

304 

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

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

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

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

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

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

311 
INCOMPATIBILITY in rare situations. 

312 

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

314 
INCOMPATIBILITY. 

315 

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

317 
corresponding to {0..255}. 

318 

319 
 Logical representation: 

320 
* 0 is instantiated to the ASCII zero character. 

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

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

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

324 
are noncanonical. 

325 
 Printing and parsing: 

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

327 
(as before). 

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

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

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

331 
is parsable for every numeral expression n. 

332 
* Noncanonical characters have no special syntax and are 

333 
printed as their logical representation. 

334 
 Explicit conversions from and to the natural numbers are 

335 
provided as char_of_nat, nat_of_char (as before). 

336 
 The auxiliary nibble type has been discontinued. 

337 

338 
INCOMPATIBILITY. 

339 

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

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

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

343 
infix "mod" syntax. INCOMPATIBILITY. 

344 

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

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

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

349 
easily recovered by composition with eq_refl. Minor INCOMPATIBILITY. 

350 

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

353 

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

355 
which renders those abstract effectively. 

356 

357 
* Command 'export_code' checks given constants for abstraction 

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

359 
interface for the generated code. 

360 

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

362 
spelt out explicitly. 

363 

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

365 
explicitly provided auxiliary definitions for required type class 

366 
dictionaries rather than halfworking magic. INCOMPATIBILITY, see 

367 
the tutorial on code generation for details. 

368 

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

370 
and products. 

371 

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

373 
prod_list, INCOMPATIBILITY. 

374 

375 
* Locale bijection establishes convenient default simp rules such as 

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

377 

378 
* Abstract locales semigroup, abel_semigroup, semilattice, 

379 
semilattice_neutr, ordering, ordering_top, semilattice_order, 

380 
semilattice_neutr_order, comm_monoid_set, semilattice_set, 

381 
semilattice_neutr_set, semilattice_order_set, 

382 
semilattice_order_neutr_set monoid_list, comm_monoid_list, 

383 
comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified 

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

385 
INCOMPATIBILITY. 

386 

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

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

389 
lifting_syntax begin ... end". Minor INCOMPATIBILITY. 

390 

63807  391 
* Some old / obsolete theorems have been renamed / removed, potential 
392 
INCOMPATIBILITY. 

393 

394 
nat_less_cases  removed, use linorder_cases instead 

395 
inv_image_comp  removed, use image_inv_f_f instead 

396 
image_surj_f_inv_f ~> image_f_inv_f 

63113  397 

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

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

399 
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

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

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

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

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

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

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

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

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

408 

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

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

410 
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

411 
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

412 
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

413 
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

414 
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

415 
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

416 
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

417 
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

418 
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

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

420 

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

62396  423 

63977  424 
* Added class topological_monoid. 
425 

426 
* HOLLibrary: theory FinFun bundles "finfun_syntax" and 

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

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

429 
"unbundle finfun_syntax" to imitate import of 

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

431 

432 
* HOLLibrary: theory Set_Permutations (executably) defines the set of 

433 
permutations of a set, i.e. the set of all lists that contain every 

434 
element of the carrier set exactly once. 

435 

436 
* HOLLibrary: multiset membership is now expressed using set_mset 

437 
rather than count. 

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

438 

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

439 
 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

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

441 

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

442 
 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

443 
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

444 

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

445 
 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

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

447 

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

448 
 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

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

450 

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

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

452 

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

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

456 
underscores. 

457 

458 
* HOLLibrary: theory Combinator_PER provides combinator to build 

459 
partial equivalence relations from a predicate and an equivalence 

460 
relation. 

461 

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

463 
fix bijections. 

464 

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

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

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

468 
normalized wrt. unit factors). 

469 

470 
* Session HOLNSA has been renamed to HOLNonstandard_Analysis. 

471 

472 
* Session HOLMultivariate_Analysis has been renamed to HOLAnalysis. 

473 

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

475 
When importing HOLAnalysis some theorems need additional name spaces 

476 
prefixes due to name clashes. INCOMPATIBILITY. 

477 

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

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

480 
Residue theorem, Schwarz Lemma. 

481 

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

483 
and the Kreinâ€“Milman Minkowski theorem. 

484 

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

486 
homeomorphisms, continuous function extensions and other advanced topics 

487 
in topology 

488 

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

490 
ereal to ennreal, INCOMPATIBILITY. 

491 

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

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

494 

495 
* HOLProbability: Code generation and QuickCheck for Probability Mass 

496 
Functions. 

497 

498 
* HOLProbability: theory Random_Permutations contains some theory about 

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

500 
list in random order. 

501 

502 
* HOLProbability: theory SPMF formalises discrete subprobability 

503 
distributions. 

504 

505 
* HOLNumber_Theory: algebraic foundation for primes: Generalisation of 

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

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

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

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

510 
"prime_nat_iff". INCOMPATIBILITY. 

511 

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

513 
distinguish which ordering the theorems are about 

514 

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

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

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

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

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

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

520 
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

521 
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

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

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

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

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

526 
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

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

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

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

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

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

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

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

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

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

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

537 
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

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

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

540 

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

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

543 

63977  544 
* 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

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

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

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

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

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

550 

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

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

554 
interpretations "multiset_linorder" and "multiset_wellorder" have been 

555 
replaced by instantiations. INCOMPATIBILITY. 

556 

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

558 
renamed: 

559 

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

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

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

562 
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

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

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

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

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

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

568 
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

569 

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

570 
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

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

572 
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

573 
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

574 
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

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

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

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

578 
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

579 
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

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

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

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

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

584 

63977  585 
* HOLLibrary: the lemma mset_map has now the attribute [simp]. 
586 
INCOMPATIBILITY. 

587 

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

589 
INCOMPATIBILITY, use the following replacements: 

590 

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

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

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

593 
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

594 
mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right 
63977  595 

596 
* HOLLibrary: some typeclass constraints about multisets have been 

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

598 
additional typeclasses order_bot, no_top, 

599 
ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add, 

600 
linordered_cancel_ab_semigroup_add, and 

601 
ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY. 

602 

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

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

605 
INCOMPATIBILITY. 

606 

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

608 
interpretations ordered_ab_semigroup_monoid_add_imp_le and 

609 
bounded_lattice_bot. INCOMPATIBILITY. 

610 

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

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

613 
changed: 

614 

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

615 
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

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

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

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

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

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

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

622 

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

625 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

666 

63977  667 
* HOLLibrary/Multiset. The definitions of some constants have changed 
668 
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

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

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

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

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

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

674 
rel_mset' 
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 
INCOMPATIBILITY. 
e68a0b651eb5
add_mset constructor in multisets
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63785
diff
changeset

677 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

700 

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

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

704 

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

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

707 
INCOMPATIBILITY. 

708 

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

63830  710 
msetsum ~> sum_mset 
711 
msetprod ~> prod_mset 

712 

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

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

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

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

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

718 

63977  719 
* HOLLibrary/Multiset. The lemma one_step_implies_mult_aux on multisets 
720 
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

721 

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

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

723 
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

724 
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

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

726 

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

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

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

729 

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

732 

62345  733 
* Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY. 
734 

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

735 
* The type class ordered_comm_monoid_add is now called 
63977  736 
ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add 
737 
is introduced as the combination of ordered_ab_semigroup_add + 

738 
comm_monoid_add. INCOMPATIBILITY. 

739 

740 
* Introduced the type classes canonically_ordered_comm_monoid_add and 

741 
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

742 

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

743 
* Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When 
63977  744 
instantiating linordered_semiring_strict and ordered_ab_group_add, an 
745 
explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might 

746 
be required. INCOMPATIBILITY. 

747 

748 
* HOLLibrary: theory Complete_Partial_Order2 provides reasoning support 

749 
for monotonicity and continuity in chaincomplete partial orders and 

750 
about admissibility conditions for fixpoint inductions. 

751 

752 
* HOLLibrary: theory Polynomial contains also derivation of polynomials 

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

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

755 
possible future different type class instantiation for polynomials over 

756 
factorial rings. INCOMPATIBILITY. 

757 

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

759 
following renaming 

760 

63173  761 
prefixeq > prefix 
762 
prefix > strict_prefix 

763 
suffixeq > suffix 

764 
suffix > strict_suffix 

63977  765 

766 
Added theory of longest common prefixes. 

63117  767 

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

770 
lcm_left_commute_nat ~> lcm.left_commute 

771 
lcm_left_commute_int ~> lcm.left_commute 

772 
gcd_left_commute_nat ~> gcd.left_commute 

773 
gcd_left_commute_int ~> gcd.left_commute 

774 
gcd_greatest_iff_nat ~> gcd_greatest_iff 

775 
gcd_greatest_iff_int ~> gcd_greatest_iff 

776 
coprime_dvd_mult_nat ~> coprime_dvd_mult 

777 
coprime_dvd_mult_int ~> coprime_dvd_mult 

778 
zpower_numeral_even ~> power_numeral_even 

779 
gcd_mult_cancel_nat ~> gcd_mult_cancel 

780 
gcd_mult_cancel_int ~> gcd_mult_cancel 

781 
div_gcd_coprime_nat ~> div_gcd_coprime 

782 
div_gcd_coprime_int ~> div_gcd_coprime 

783 
zpower_numeral_odd ~> power_numeral_odd 

784 
zero_less_int_conv ~> of_nat_0_less_iff 

785 
gcd_greatest_nat ~> gcd_greatest 

786 
gcd_greatest_int ~> gcd_greatest 

787 
coprime_mult_nat ~> coprime_mult 

788 
coprime_mult_int ~> coprime_mult 

789 
lcm_commute_nat ~> lcm.commute 

790 
lcm_commute_int ~> lcm.commute 

791 
int_less_0_conv ~> of_nat_less_0_iff 

792 
gcd_commute_nat ~> gcd.commute 

793 
gcd_commute_int ~> gcd.commute 

794 
Gcd_insert_nat ~> Gcd_insert 

795 
Gcd_insert_int ~> Gcd_insert 

796 
of_int_int_eq ~> of_int_of_nat_eq 

797 
lcm_least_nat ~> lcm_least 

798 
lcm_least_int ~> lcm_least 

799 
lcm_assoc_nat ~> lcm.assoc 

800 
lcm_assoc_int ~> lcm.assoc 

801 
int_le_0_conv ~> of_nat_le_0_iff 

802 
int_eq_0_conv ~> of_nat_eq_0_iff 

803 
Gcd_empty_nat ~> Gcd_empty 

804 
Gcd_empty_int ~> Gcd_empty 

805 
gcd_assoc_nat ~> gcd.assoc 

806 
gcd_assoc_int ~> gcd.assoc 

807 
zero_zle_int ~> of_nat_0_le_iff 

808 
lcm_dvd2_nat ~> dvd_lcm2 

809 
lcm_dvd2_int ~> dvd_lcm2 

810 
lcm_dvd1_nat ~> dvd_lcm1 

811 
lcm_dvd1_int ~> dvd_lcm1 

812 
gcd_zero_nat ~> gcd_eq_0_iff 

813 
gcd_zero_int ~> gcd_eq_0_iff 

814 
gcd_dvd2_nat ~> gcd_dvd2 

815 
gcd_dvd2_int ~> gcd_dvd2 

816 
gcd_dvd1_nat ~> gcd_dvd1 

817 
gcd_dvd1_int ~> gcd_dvd1 

818 
int_numeral ~> of_nat_numeral 

819 
lcm_ac_nat ~> ac_simps 

820 
lcm_ac_int ~> ac_simps 

821 
gcd_ac_nat ~> ac_simps 

822 
gcd_ac_int ~> ac_simps 

823 
abs_int_eq ~> abs_of_nat 

824 
zless_int ~> of_nat_less_iff 

825 
zdiff_int ~> of_nat_diff 

826 
zadd_int ~> of_nat_add 

827 
int_mult ~> of_nat_mult 

828 
int_Suc ~> of_nat_Suc 

829 
inj_int ~> inj_of_nat 

830 
int_1 ~> of_nat_1 

831 
int_0 ~> of_nat_0 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

854 
coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff 
62348  855 
realpow_minus_mult ~> power_minus_mult 
856 
realpow_Suc_le_self ~> power_Suc_le_self 

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

857 
dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest 
62347  858 
INCOMPATIBILITY. 
859 

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

860 
* Renamed HOL/Quotient_Examples/FSet.thy to 
63977  861 
HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY. 
862 

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

863 

62498  864 
*** ML *** 
865 

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

868 

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

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

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

873 
INCOMPATIBILITY. 

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

874 

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

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

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

882 

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

885 
requiring separate files. 

886 

62851  887 
* 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

888 
exposed to Isabelle/ML userspace. Potential INCOMPATIBILITY. 
62851  889 

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

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

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

892 

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

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

896 
debugger information requires consirable time and space: main 

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

898 

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

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

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

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

904 
balanced blocks of Local_Theory.open_target versus 

905 
Local_Theory.close_target instead. Rare INCOMPATIBILITY. 

906 

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

909 
INCOMPATIBILITY. 

910 

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

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

914 
File.full_path). Potential INCOMPATIBILITY. 

915 

63352  916 
* Binding.empty_atts supersedes Thm.empty_binding and 
917 
Attrib.empty_binding. Minor INCOMPATIBILITY. 

918 

62498  919 

62354  920 
*** System *** 
921 

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

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

923 
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

924 
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

925 
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

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

927 

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

930 
"isabelle_scala_script". 

931 

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

934 
Isabelle_Tool.Body. 

935 

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

938 
particular: 

939 

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

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

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

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

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

944 

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

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

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

948 

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

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

950 
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

951 
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

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

953 

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

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

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

956 

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

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

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

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

960 

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

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

962 
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

963 
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

964 
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

965 
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

966 
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

967 
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

968 

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

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

973 

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

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

975 
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

976 
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

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

978 

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

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

980 
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

981 
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

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

983 

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

986 
but without the Isabelle settings environment. 

987 

62354  988 

989 

62031  990 
New in Isabelle2016 (February 2016) 
62016  991 
 
60138  992 

61337  993 
*** General *** 
994 

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

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

996 
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

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

998 
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

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

1000 

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

1003 

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

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

1007 
has been removed (see below). 

1008 

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

62017  1011 

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

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

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

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

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

1016 

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

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

1018 
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

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

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

1021 

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

1024 
to update old sources. 

1025 

61337  1026 
* Toplevel theorem statements have been simplified as follows: 
1027 

1028 
theorems ~> lemmas 

1029 
schematic_lemma ~> schematic_goal 

1030 
schematic_theorem ~> schematic_goal 

1031 
schematic_corollary ~> schematic_goal 

1032 

1033 
Commandline tool "isabelle update_theorems" updates theory sources 

1034 
accordingly. 

1035 

61338  1036 
* Toplevel theorem statement 'proposition' is another alias for 
1037 
'theorem'. 

1038 

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

1041 
deferred definitions require a surrounding 'overloading' block. 

1042 

61337  1043 

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

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

1045 

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

1049 
'SML_file_no_debug' control compilation of sources with or without 

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

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

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

1053 
any effect on the running ML program. 

60984  1054 

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

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

1058 
update. 

61729  1059 

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

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

1062 
enable option "editor_output_state". 

61215  1063 

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

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

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

1068 
visibility. 

1069 

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

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

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

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

1074 
panel. 

1075 

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

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

1077 
state output, interactive queries) wrt. longrunning background tasks. 
62017  1078 

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

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

1081 
implicit: a popup will show up unconditionally. 

1082 

1083 
* Additional abbreviations for syntactic completion may be specified in 

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

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

1086 

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

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

1088 
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

1089 
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

1090 
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

1091 

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

1094 
the editor. 

1095 

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

1097 
instead of former C+e LEFT. 

1098 

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

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

1101 
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

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

1103 

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

1106 
singleinstance applications seen on common GUI desktops. 

1107 

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

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

1109 
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

1110 
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

1111 

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

1114 

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

1117 

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

1118 

61405  1119 
*** Document preparation *** 
1120 

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

1123 

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

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

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

1127 

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

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

1130 
follows: 

1131 

1132 
\<^item> itemize 

1133 
\<^enum> enumerate 

1134 
\<^descr> description 

1135 

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

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

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

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

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

1142 

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

1145 
standard LaTeX macros of the same names. 

1146 

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

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

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

1151 
cartouche tokens seen in theory sources. 

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

1152 

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

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

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

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

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

1158 

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

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

1162 

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

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

1165 

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

1167 

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

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

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

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

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

1173 
documentation, with a hyperlink in the Prover IDE. 

1174 

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

1176 
entities of the Isar language. 

1177 

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

61488  1180 
print mode "HTML" loses its special meaning. 
61471  1181 

61405  1182 

60406  1183 
*** Isar *** 
1184 

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

1187 
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

1188 
example: 
60414  1189 

1190 
have result: "C x y" 

1191 
if "A x" and "B y" 

1192 
for x :: 'a and y :: 'a 

1193 
<proof> 

1194 

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

60414  1197 
corresponds to a raw proof block like this: 
1198 

1199 
{ 

1200 
fix x :: 'a and y :: 'a 

60449  1201 
assume that: "A x" "B y" 
60414  1202 
have "C x y" <proof> 
1203 
} 

1204 
note result = this 

60406  1205 

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

1206 
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

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

1208 

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

61658  1211 

1212 
assume result: "C x y" 

1213 
if "A x" and "B y" 

1214 
for x :: 'a and y :: 'a 

1215 

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

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

1218 

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

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

1221 
example: 

1222 

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

1224 

1225 
is equivalent to: 

1226 

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

1228 

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

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

60595  1233 

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

1235 

1236 
or: 

1237 

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

1239 

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

1241 

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

1243 

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

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

1247 
of the local context elements yet. 

1248 

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

1251 

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

1253 
then have something 

1254 
proof cases 

1255 
case a 

1256 
then show ?thesis <proof> 

1257 
next 

1258 
case b 

1259 
then show ?thesis <proof> 

1260 
next 

1261 
case c 

1262 
then show ?thesis <proof> 

1263 
qed 

1264 

60565  1265 
* Command 'case' allows fact name and attribute specification like this: 
1266 

1267 
case a: (c xs) 

1268 
case a [attributes]: (c xs) 

1269 

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

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

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

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

1274 
and always put attributes in front. 

1275 

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

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

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

1278 
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

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

1280 

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

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

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

1285 

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

1287 
supply [simp] = a 

1288 
proof 

1289 
show A by simp 

1290 
next 

1291 
show A by simp 

1292 
qed 

1293 

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

1295 
proof body as well, abstracted over relevant parameters. 

1296 

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

1298 
parameter scope for of each clause. 

1299 

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

1301 
statements: result is abstracted over unknowns. 

1302 

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

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

1306 
manual. 

1307 

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

1310 

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

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

1312 
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

1313 
example: 
60617  1314 

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

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

1317 
proof goal_cases 
60622  1318 
case (1 x) 
1319 
then show ?case using \<open>A x\<close> \<open>B x\<close> sorry 

1320 
next 

1321 
case (2 y z) 

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

1323 
qed 

1324 

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

1326 
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

1327 
proof goal_cases 
60617  1328 
case prems: 1 
1329 
then show ?case using prems sorry 

1330 
next 

1331 
case prems: 2 

1332 
then show ?case using prems sorry 

1333 
qed 

60578  1334 

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

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

60581  1339 

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

60551  1342 

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

1345 

60406  1346 

60331  1347 
*** Pure *** 
1348 

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

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

1350 
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

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

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

1353 

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

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

1356 

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

1357 
* More gentle suppression of syntax along locale morphisms while 
62017  1358 
printing terms. Previously 'abbreviation' and 'notation' declarations 
1359 
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
diff
changeset

1360 
'abbreviation' is also kept for morphims that only change the involved 
62017  1361 
parameters, and only 'notation' is suppressed. This can be of great help 
1362 
when working with complex locale hierarchies, because proof states are 

1363 
displayed much more succinctly. It also means that only notation needs 

1364 
to be redeclared if desired, as illustrated by this example: 

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

1365 

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

1366 
locale struct = fixes composition :: "'a => 'a => 'a" (infixl "\<cdot>" 65) 
e89cfc004f18
Refine the supression of abbreviations for morphisms that are not identities.
ballarin
parents:
61694
diff
changeset

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

1368 
definition derived (infixl "\<odot>" 65) where ... 
e89cfc004f18
Refine the supression of abbreviations for morphisms that are not identities.
ballarin
parents:
61694
diff
changeset

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

1370 

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

1371 
locale morphism = 
e89cfc004f18
Refine the supression of abbreviations for morphisms that are not identities.
ballarin
parents:
61694
diff
changeset

1372 
left: struct composition + right: struct composition' 
e89cfc004f18
Refine the supression of abbreviations for morphisms that are not identities.
ballarin
parents:
61694
diff
changeset

1373 
for composition (infix "\<cdot>" 65) and composition' (infix "\<cdot>''" 65) 
e89cfc004f18
Refine the supression of abbreviations for morphisms that are not identities.
ballarin
parents:
61694
diff
changeset

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

1375 
notation right.derived ("\<odot>''") 
e89cfc004f18
Refine the supression of abbreviations for morphisms that are not identities.
ballarin
parents:
61694
diff
changeset

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

1377 

61895  1378 
* Command 'global_interpretation' issues interpretations into global 
1379 
theories, with optional rewrite definitions following keyword 'defines'. 

1380 

1381 
* Command 'sublocale' accepts optional rewrite definitions after keyword 

61675  1382 
'defines'. 
1383 

61895  1384 
* Command 'permanent_interpretation' has been discontinued. Use 
1385 
'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY. 

61670
301e0b4ecd45
coalesce permanent_interpretation.ML with interpretation.ML
haftmann
parents:
61660
diff
changeset

1386 

61252
c165f0472d57
separate command 