author  nipkow 
Fri, 08 Jul 2016 19:35:31 +0200  
changeset 63414  beb987127d0f 
parent 63410  9789ccc2a477 
child 63416  6af79184bef3 
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 

62216  7 
New in this Isabelle version 
8 
 

9 

62440  10 
*** General *** 
11 

63120
629a4c5e953e
embedded content may be delimited via cartouches;
wenzelm
parents:
63113
diff
changeset

12 
* Embedded content (e.g. the inner syntax of types, terms, props) may be 
629a4c5e953e
embedded content may be delimited via cartouches;
wenzelm
parents:
63113
diff
changeset

13 
delimited uniformly via cartouches. This works better than oldfashioned 
629a4c5e953e
embedded content may be delimited via cartouches;
wenzelm
parents:
63113
diff
changeset

14 
quotes when sublanguages are nested. 
629a4c5e953e
embedded content may be delimited via cartouches;
wenzelm
parents:
63113
diff
changeset

15 

62958
b41c1cb5e251
Type_Infer.object_logic controls improvement of type inference result;
wenzelm
parents:
62939
diff
changeset

16 
* Typeinference improves sorts of newly introduced type variables for 
b41c1cb5e251
Type_Infer.object_logic controls improvement of type inference result;
wenzelm
parents:
62939
diff
changeset

17 
the objectlogic, using its base sort (i.e. HOL.type for Isabelle/HOL). 
b41c1cb5e251
Type_Infer.object_logic controls improvement of type inference result;
wenzelm
parents:
62939
diff
changeset

18 
Thus terms like "f x" or "\<And>x. P x" without any further syntactic context 
b41c1cb5e251
Type_Infer.object_logic controls improvement of type inference result;
wenzelm
parents:
62939
diff
changeset

19 
produce x::'a::type in HOL instead of x::'a::{} in Pure. Rare 
b41c1cb5e251
Type_Infer.object_logic controls improvement of type inference result;
wenzelm
parents:
62939
diff
changeset

20 
INCOMPATIBILITY, need to provide explicit type constraints for Pure 
b41c1cb5e251
Type_Infer.object_logic controls improvement of type inference result;
wenzelm
parents:
62939
diff
changeset

21 
types where this is really intended. 
b41c1cb5e251
Type_Infer.object_logic controls improvement of type inference result;
wenzelm
parents:
62939
diff
changeset

22 

62969  23 
* Simplified outer syntax: uniform category "name" includes long 
24 
identifiers. Former "xname" / "nameref" / "name reference" has been 

25 
discontinued. 

26 

62807  27 
* Mixfix annotations support general block properties, with syntax 
28 
"(\<open>x=a y=b z \<dots>\<close>". Notable property names are "indent", "consistent", 

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

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

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

62789  32 

62440  33 
* New symbol \<circle>, e.g. for temporal operator. 
34 

62453  35 
* Old 'header' command is no longer supported (legacy since 
36 
Isabelle2015). 

37 

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

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

41 

42 
bundle foo 

43 
begin 

44 
declare a [simp] 

45 
declare b [intro] 

46 
end 

63272  47 

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

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

51 

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

54 

62440  55 

62904  56 
*** Prover IDE  Isabelle/Scala/jEdit *** 
57 

63135  58 
* Cartouche abbreviations work both for " and ` to accomodate typical 
59 
situations where old ASCII notation may be updated. 

60 

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

63 

64 
src/Pure/ROOT0.ML 

65 
src/Pure/ROOT.ML 

66 
src/Pure/Pure.thy 

67 
src/Pure/ML_Bootstrap.thy 

68 

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

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

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

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

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

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

63307  75 
dependencies of the above files are only observed for batch build. 
62904  76 

62987
dc8a8a7559e7
highlighting of entity def/ref positions wrt. cursor;
wenzelm
parents:
62969
diff
changeset

77 
* Highlighting of entity def/ref positions wrt. cursor. 
dc8a8a7559e7
highlighting of entity def/ref positions wrt. cursor;
wenzelm
parents:
62969
diff
changeset

78 

63236  79 
* Action "isabelle.selectentity" (shortcut CS+ENTER) selects all 
80 
occurences of the formal entity at the caret position. This facilitates 

81 
systematic renaming. 

82 

63032
e0fa59bbc956
reactivated other_id reports (see also db929027e701, 8eda56033203);
wenzelm
parents:
63022
diff
changeset

83 
* Document markup works across multiple Isar commands, e.g. the results 
e0fa59bbc956
reactivated other_id reports (see also db929027e701, 8eda56033203);
wenzelm
parents:
63022
diff
changeset

84 
established at the end of a proof are properly identified in the theorem 
e0fa59bbc956
reactivated other_id reports (see also db929027e701, 8eda56033203);
wenzelm
parents:
63022
diff
changeset

85 
statement. 
e0fa59bbc956
reactivated other_id reports (see also db929027e701, 8eda56033203);
wenzelm
parents:
63022
diff
changeset

86 

62904  87 

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

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

89 

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

92 

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

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

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

96 

63178  97 
* Command 'axiomatization' has become more restrictive to correspond 
98 
better to internal axioms as singleton facts with mandatory name. Minor 

99 
INCOMPATIBILITY. 

100 

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

103 
'definition', 'inductive', 'function'. 

104 

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

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

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

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

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

110 

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

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

63039  115 

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

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

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

118 

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

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

120 
typesetting. E.g. to produce proof holes in examples and documentation. 
62216  121 

62939  122 
* The old proof method "default" has been removed (legacy since 
123 
Isabelle2016). INCOMPATIBILITY, use "standard" instead. 

124 

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

127 
definitions. 

128 

129 
* Eisbach provides method "use" to modify the main facts of a given 

130 
method expression, e.g. 

131 

132 
(use facts in simp) 

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

134 

62216  135 

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

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

137 

63166  138 
* Code generator: config option "code_timing" triggers measurements of 
139 
different phases of code generation. See src/HOL/ex/Code_Timing.thy for 

140 
examples. 

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

141 

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

142 
* Code generator: implicits in Scala (stemming from type class instances) 
705229ed856e
compiling implicit instances into companion objects for classes avoids ambiguities
haftmann
parents:
63343
diff
changeset

143 
are generated into companion object of corresponding type class, to resolve 
705229ed856e
compiling implicit instances into companion objects for classes avoids ambiguities
haftmann
parents:
63343
diff
changeset

144 
some situations where ambiguities may occur. 
705229ed856e
compiling implicit instances into companion objects for classes avoids ambiguities
haftmann
parents:
63343
diff
changeset

145 

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

146 

62327  147 
*** HOL *** 
148 

63414  149 
* Theory Library/LaTeXsugar.thy: New style "dummy_pats" for displaying 
150 
equations in functional programming style: variables present on the 

151 
lefthand but not on the righhand side are replaced by underscores. 

152 

63377
64adf4ba9526
combinator to build partial equivalence relations from a predicate and an equivalenc relation
haftmann
parents:
63375
diff
changeset

153 
* Theory Library/Combinator_PER.thy: combinator to build partial 
63378  154 
equivalence relations from a predicate and an equivalence relation. 
63377
64adf4ba9526
combinator to build partial equivalence relations from a predicate and an equivalenc relation
haftmann
parents:
63375
diff
changeset

155 

63375
59803048b0e8
basic facts about almost everywhere fix bijections
haftmann
parents:
63374
diff
changeset

156 
* Theory Library/Perm.thy: basic facts about almost everywhere fix 
59803048b0e8
basic facts about almost everywhere fix bijections
haftmann
parents:
63374
diff
changeset

157 
bijections. 
59803048b0e8
basic facts about almost everywhere fix bijections
haftmann
parents:
63374
diff
changeset

158 

63374  159 
* Locale bijection establishes convenient default simp rules 
160 
like "inv f (f a) = a" for total bijections. 

161 

63343  162 
* Former locale lifting_syntax is now a bundle, which is easier to 
163 
include in a local context or theorem statement, e.g. "context includes 

164 
lifting_syntax begin ... end". Minor INCOMPATIBILITY. 

165 

63303  166 
* Code generation for scala: ambiguous implicts in class diagrams 
167 
are spelt out explicitly. 

168 

63290
9ac558ab0906
boldify syntax in abstract algebraic structures, to avoid clashes with concrete syntax in corresponding type classes
haftmann
parents:
63284
diff
changeset

169 
* Abstract locales semigroup, abel_semigroup, semilattice, 
9ac558ab0906
boldify syntax in abstract algebraic structures, to avoid clashes with concrete syntax in corresponding type classes
haftmann
parents:
63284
diff
changeset

170 
semilattice_neutr, ordering, ordering_top, semilattice_order, 
9ac558ab0906
boldify syntax in abstract algebraic structures, to avoid clashes with concrete syntax in corresponding type classes
haftmann
parents:
63284
diff
changeset

171 
semilattice_neutr_order, comm_monoid_set, semilattice_set, 
9ac558ab0906
boldify syntax in abstract algebraic structures, to avoid clashes with concrete syntax in corresponding type classes
haftmann
parents:
63284
diff
changeset

172 
semilattice_neutr_set, semilattice_order_set, semilattice_order_neutr_set 
9ac558ab0906
boldify syntax in abstract algebraic structures, to avoid clashes with concrete syntax in corresponding type classes
haftmann
parents:
63284
diff
changeset

173 
monoid_list, comm_monoid_list, comm_monoid_list_set, comm_monoid_mset, 
9ac558ab0906
boldify syntax in abstract algebraic structures, to avoid clashes with concrete syntax in corresponding type classes
haftmann
parents:
63284
diff
changeset

174 
comm_monoid_fun use boldified syntax uniformly that does not clash 
9ac558ab0906
boldify syntax in abstract algebraic structures, to avoid clashes with concrete syntax in corresponding type classes
haftmann
parents:
63284
diff
changeset

175 
with corresponding global syntax. INCOMPATIBILITY. 
9ac558ab0906
boldify syntax in abstract algebraic structures, to avoid clashes with concrete syntax in corresponding type classes
haftmann
parents:
63284
diff
changeset

176 

63237  177 
* Conventional syntax "%(). t" for unit abstractions. Slight syntactic 
178 
INCOMPATIBILITY. 

179 

63174
57c0d60e491c
do not export abstract constructors in code_reflect
haftmann
parents:
63173
diff
changeset

180 
* Command 'code_reflect' accepts empty constructor lists for datatypes, 
57c0d60e491c
do not export abstract constructors in code_reflect
haftmann
parents:
63173
diff
changeset

181 
which renders those abstract effectively. 
57c0d60e491c
do not export abstract constructors in code_reflect
haftmann
parents:
63173
diff
changeset

182 

63175
d191892b1c23
explicit check that abstract constructors cannot be part of official interface
haftmann
parents:
63174
diff
changeset

183 
* Command 'export_code' checks given constants for abstraction violations: 
d191892b1c23
explicit check that abstract constructors cannot be part of official interface
haftmann
parents:
63174
diff
changeset

184 
a small guarantee that given constants specify a safe interface for the 
d191892b1c23
explicit check that abstract constructors cannot be part of official interface
haftmann
parents:
63174
diff
changeset

185 
generated code. 
d191892b1c23
explicit check that abstract constructors cannot be part of official interface
haftmann
parents:
63174
diff
changeset

186 

63144  187 
* Probability/Random_Permutations.thy contains some theory about 
188 
choosing a permutation of a set uniformly at random and folding over a 

189 
list in random order. 

190 

63246  191 
* Probability/SPMF formalises discrete subprobability distributions. 
192 

63283
a59801b7f125
bundles "finfun_syntax" and "no_finfun_syntax" for optional syntax;
wenzelm
parents:
63282
diff
changeset

193 
* Library/FinFun.thy: bundles "finfun_syntax" and "no_finfun_syntax" 
a59801b7f125
bundles "finfun_syntax" and "no_finfun_syntax" for optional syntax;
wenzelm
parents:
63282
diff
changeset

194 
allow to control optional syntax in local contexts; this supersedes 
a59801b7f125
bundles "finfun_syntax" and "no_finfun_syntax" for optional syntax;
wenzelm
parents:
63282
diff
changeset

195 
former Library/FinFun_Syntax.thy. INCOMPATIBILITY, e.g. use "unbundle 
a59801b7f125
bundles "finfun_syntax" and "no_finfun_syntax" for optional syntax;
wenzelm
parents:
63282
diff
changeset

196 
finfun_syntax" to imitate import of "~~/src/HOL/Library/FinFun_Syntax". 
a59801b7f125
bundles "finfun_syntax" and "no_finfun_syntax" for optional syntax;
wenzelm
parents:
63282
diff
changeset

197 

63144  198 
* Library/Set_Permutations.thy (executably) defines the set of 
199 
permutations of a set, i.e. the set of all lists that contain every 

200 
element of the carrier set exactly once. 

201 

63161
2660ba498798
delegate inclusion of required dictionaries to userspace instead of halfworking magic
haftmann
parents:
63155
diff
changeset

202 
* Static evaluators (Code_Evaluation.static_* in Isabelle/ML) rely on 
2660ba498798
delegate inclusion of required dictionaries to userspace instead of halfworking magic
haftmann
parents:
63155
diff
changeset

203 
explicitly provided auxiliary definitions for required type class 
2660ba498798
delegate inclusion of required dictionaries to userspace instead of halfworking magic
haftmann
parents:
63155
diff
changeset

204 
dictionaries rather than halfworking magic. INCOMPATIBILITY, see 
2660ba498798
delegate inclusion of required dictionaries to userspace instead of halfworking magic
haftmann
parents:
63155
diff
changeset

205 
the tutorial on code generation for details. 
2660ba498798
delegate inclusion of required dictionaries to userspace instead of halfworking magic
haftmann
parents:
63155
diff
changeset

206 

62522  207 
* New abbreviations for negated existence (but not bounded existence): 
208 

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

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

211 

62521  212 
* The print mode "HOL" for ASCII syntax of binders "!", "?", "?!", "@" 
213 
has been removed for output. It is retained for input only, until it is 

214 
eliminated altogether. 

215 

63116  216 
* Sledgehammer: 
217 
 Produce syntactically correct Vampire 4.0 problem files. 

218 

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

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

62842  223 
method. See 'isabelle doc corec'. 
62693  224 
 The predicator :: ('a => bool) => 'a F => bool is now a firstclass 
62332  225 
citizen in bounded natural functors 
62693  226 
 'primrec' now allows nested calls through the predicator in addition 
62327  227 
to the map function. 
62693  228 
 'bnf' automatically discharges reflexive proof obligations 
229 
 'bnf' outputs a slightly modified proof obligation expressing rel in 

62332  230 
terms of map and set 
231 
(not giving a specification for rel makes this one reflexive) 

62693  232 
 'bnf' outputs a new proof obligation expressing pred in terms of set 
62332  233 
(not giving a specification for pred makes this one reflexive) 
62693  234 
INCOMPATIBILITY: manual 'bnf' declarations may need adjustment 
62335  235 
 Renamed lemmas: 
236 
rel_prod_apply ~> rel_prod_inject 

237 
pred_prod_apply ~> pred_prod_inject 

238 
INCOMPATIBILITY. 

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

239 
 The "size" plugin has been made compatible again with locales. 
62327  240 

63113  241 
* Removed obsolete theorem nat_less_cases. INCOMPATIBILITY, use 
242 
linorder_cases instead. 

243 

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

62396  246 

62597  247 
* Characters (type char) are modelled as finite algebraic type 
248 
corresponding to {0..255}. 

249 

250 
 Logical representation: 

251 
* 0 is instantiated to the ASCII zero character. 

62645
a2351f82bc48
eliminated spurious Unicode, which is in conflict with Isabelle symbol interpretation;
wenzelm
parents:
62642
diff
changeset

252 
* All other characters are represented as "Char n" 
62597  253 
with n being a raw numeral expression less than 256. 
62645
a2351f82bc48
eliminated spurious Unicode, which is in conflict with Isabelle symbol interpretation;
wenzelm
parents:
62642
diff
changeset

254 
* Expressions of the form "Char n" with n greater than 255 
62597  255 
are noncanonical. 
256 
 Printing and parsing: 

62645
a2351f82bc48
eliminated spurious Unicode, which is in conflict with Isabelle symbol interpretation;
wenzelm
parents:
62642
diff
changeset

257 
* Printable characters are printed and parsed as "CHR ''\<dots>''" 
62597  258 
(as before). 
62645
a2351f82bc48
eliminated spurious Unicode, which is in conflict with Isabelle symbol interpretation;
wenzelm
parents:
62642
diff
changeset

259 
* The ASCII zero character is printed and parsed as "0". 
62678  260 
* All other canonical characters are printed as "CHR 0xXX" 
261 
with XX being the hexadecimal character code. "CHR n" 

62597  262 
is parsable for every numeral expression n. 
62598  263 
* Noncanonical characters have no special syntax and are 
62597  264 
printed as their logical representation. 
265 
 Explicit conversions from and to the natural numbers are 

266 
provided as char_of_nat, nat_of_char (as before). 

267 
 The auxiliary nibble type has been discontinued. 

268 

269 
INCOMPATIBILITY. 

270 

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

271 
* Multiset membership is now expressed using set_mset rather than count. 
9527ff088c15
more succint formulation of membership for multisets, similar to lists;
haftmann
parents:
62415
diff
changeset

272 

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

273 
 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

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

275 

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

276 
 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

277 
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

278 

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

279 
 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

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

281 

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

282 
 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

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

284 

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

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

286 

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

287 
* The names of multiset theorems have been normalised to distinguish which 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

288 
ordering the theorems are about 
caaacf37943f
normalising multiset theorem names
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63307
diff
changeset

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

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

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

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

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

294 
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

295 
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

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

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

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

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

300 
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

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

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

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

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

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

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

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

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

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

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

311 
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

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

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

314 

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

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

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

317 

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

318 
* Multisets are now ordered with the multiset ordering 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

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

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

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

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

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

324 

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

325 
* The prefix multiset_order has been discontinued: the theorems can be directly 
63407
89dd1345a04f
leverage new 'order' type class instantiation in multiset
blanchet
parents:
63388
diff
changeset

326 
accessed. As a consequence, the lemmas "order_multiset" and "linorder_multiset" 
89dd1345a04f
leverage new 'order' type class instantiation in multiset
blanchet
parents:
63388
diff
changeset

327 
have been discontinued, and the interpretations "multiset_linorder" and 
89dd1345a04f
leverage new 'order' type class instantiation in multiset
blanchet
parents:
63388
diff
changeset

328 
"multiset_wellorder" have been replaced by instantiations. 
89dd1345a04f
leverage new 'order' type class instantiation in multiset
blanchet
parents:
63388
diff
changeset

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

330 

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

331 
* Some theorems about the multiset ordering have been renamed: 
a095acd4cfbf
instantiate multiset with multiset ordering
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63384
diff
changeset

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

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

334 
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

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

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

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

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

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

340 
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

341 

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

342 
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

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

344 
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

345 
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

346 
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

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

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

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

350 
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

351 
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

352 
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

353 
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

354 
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

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

356 

63410
9789ccc2a477
more instantiations for multiset
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63407
diff
changeset

357 
* Some typeclass constraints about multisets have been reduced from ordered or 
9789ccc2a477
more instantiations for multiset
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63407
diff
changeset

358 
linordered to preorder. Multisets have the additional typeclasses order_bot, 
9789ccc2a477
more instantiations for multiset
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63407
diff
changeset

359 
no_top, ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add, 
9789ccc2a477
more instantiations for multiset
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63407
diff
changeset

360 
and linordered_cancel_ab_semigroup_add. 
9789ccc2a477
more instantiations for multiset
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63407
diff
changeset

361 
INCOMPATIBILITY. 
9789ccc2a477
more instantiations for multiset
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63407
diff
changeset

362 

9789ccc2a477
more instantiations for multiset
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63407
diff
changeset

363 
* There are some new simplification rules about multisets and the multiset 
9789ccc2a477
more instantiations for multiset
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63407
diff
changeset

364 
ordering. 
9789ccc2a477
more instantiations for multiset
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63407
diff
changeset

365 
INCOMPATIBILITY. 
9789ccc2a477
more instantiations for multiset
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63407
diff
changeset

366 

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

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

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

369 

62408
86f27b264d3d
Conformal_mappings: a big development in complex analysis (+ some lemmas)
paulson <lp15@cam.ac.uk>
parents:
62407
diff
changeset

370 
* More complex analysis including Cauchy's inequality, Liouville theorem, 
63078
e49dc94eb624
Theory of polyhedra: faces, extreme points, polytopes, and the Kreinâ€“Milman
paulson <lp15@cam.ac.uk>
parents:
63066
diff
changeset

371 
open mapping theorem, maximum modulus principle, Residue theorem, Schwarz Lemma. 
e49dc94eb624
Theory of polyhedra: faces, extreme points, polytopes, and the Kreinâ€“Milman
paulson <lp15@cam.ac.uk>
parents:
63066
diff
changeset

372 

e49dc94eb624
Theory of polyhedra: faces, extreme points, polytopes, and the Kreinâ€“Milman
paulson <lp15@cam.ac.uk>
parents:
63066
diff
changeset

373 
* Theory of polyhedra: faces, extreme points, polytopes, and the Kreinâ€“Milman 
e49dc94eb624
Theory of polyhedra: faces, extreme points, polytopes, and the Kreinâ€“Milman
paulson <lp15@cam.ac.uk>
parents:
63066
diff
changeset

374 
Minkowski theorem. 
62408
86f27b264d3d
Conformal_mappings: a big development in complex analysis (+ some lemmas)
paulson <lp15@cam.ac.uk>
parents:
62407
diff
changeset

375 

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

378 

62345  379 
* Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY. 
380 

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

381 
* The type class ordered_comm_monoid_add is now called 
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

382 
ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add is 
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

383 
introduced as the combination of ordered_ab_semigroup_add + comm_monoid_add. 
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

384 
INCOMPATIBILITY. 
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

385 

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

386 
* Introduced the type classes canonically_ordered_comm_monoid_add and dioid. 
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

387 

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

388 
* Added topological_monoid 
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

389 

62652
7248d106c607
move Complete_Partial_Orders2 from AFP/Coinductive to HOL/Library
Andreas Lochbihler
parents:
62645
diff
changeset

390 
* Library/Complete_Partial_Order2.thy provides reasoning support for 
7248d106c607
move Complete_Partial_Orders2 from AFP/Coinductive to HOL/Library
Andreas Lochbihler
parents:
62645
diff
changeset

391 
proofs about monotonicity and continuity in chaincomplete partial 
7248d106c607
move Complete_Partial_Orders2 from AFP/Coinductive to HOL/Library
Andreas Lochbihler
parents:
62645
diff
changeset

392 
orders and about admissibility conditions for fixpoint inductions. 
7248d106c607
move Complete_Partial_Orders2 from AFP/Coinductive to HOL/Library
Andreas Lochbihler
parents:
62645
diff
changeset

393 

62352
35a9e1cbb5b3
separated potentially conflicting type class instance into separate theory
haftmann
parents:
62348
diff
changeset

394 
* Library/Polynomial.thy contains also derivation of polynomials 
35a9e1cbb5b3
separated potentially conflicting type class instance into separate theory
haftmann
parents:
62348
diff
changeset

395 
but not gcd/lcm on polynomials over fields. This has been moved 
35a9e1cbb5b3
separated potentially conflicting type class instance into separate theory
haftmann
parents:
62348
diff
changeset

396 
to a separate theory Library/Polynomial_GCD_euclidean.thy, to 
35a9e1cbb5b3
separated potentially conflicting type class instance into separate theory
haftmann
parents:
62348
diff
changeset

397 
pave way for a possible future different type class instantiation 
35a9e1cbb5b3
separated potentially conflicting type class instance into separate theory
haftmann
parents:
62348
diff
changeset

398 
for polynomials over factorial rings. INCOMPATIBILITY. 
35a9e1cbb5b3
separated potentially conflicting type class instance into separate theory
haftmann
parents:
62348
diff
changeset

399 

63155  400 
* Library/Sublist.thy: added function "prefixes" and renamed 
63173  401 
prefixeq > prefix 
402 
prefix > strict_prefix 

403 
suffixeq > suffix 

404 
suffix > strict_suffix 

405 
Added theory of longest common prefixes. 

63117  406 

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

409 
lcm_left_commute_nat ~> lcm.left_commute 

410 
lcm_left_commute_int ~> lcm.left_commute 

411 
gcd_left_commute_nat ~> gcd.left_commute 

412 
gcd_left_commute_int ~> gcd.left_commute 

413 
gcd_greatest_iff_nat ~> gcd_greatest_iff 

414 
gcd_greatest_iff_int ~> gcd_greatest_iff 

415 
coprime_dvd_mult_nat ~> coprime_dvd_mult 

416 
coprime_dvd_mult_int ~> coprime_dvd_mult 

417 
zpower_numeral_even ~> power_numeral_even 

418 
gcd_mult_cancel_nat ~> gcd_mult_cancel 

419 
gcd_mult_cancel_int ~> gcd_mult_cancel 

420 
div_gcd_coprime_nat ~> div_gcd_coprime 

421 
div_gcd_coprime_int ~> div_gcd_coprime 

422 
zpower_numeral_odd ~> power_numeral_odd 

423 
zero_less_int_conv ~> of_nat_0_less_iff 

424 
gcd_greatest_nat ~> gcd_greatest 

425 
gcd_greatest_int ~> gcd_greatest 

426 
coprime_mult_nat ~> coprime_mult 

427 
coprime_mult_int ~> coprime_mult 

428 
lcm_commute_nat ~> lcm.commute 

429 
lcm_commute_int ~> lcm.commute 

430 
int_less_0_conv ~> of_nat_less_0_iff 

431 
gcd_commute_nat ~> gcd.commute 

432 
gcd_commute_int ~> gcd.commute 

433 
Gcd_insert_nat ~> Gcd_insert 

434 
Gcd_insert_int ~> Gcd_insert 

435 
of_int_int_eq ~> of_int_of_nat_eq 

436 
lcm_least_nat ~> lcm_least 

437 
lcm_least_int ~> lcm_least 

438 
lcm_assoc_nat ~> lcm.assoc 

439 
lcm_assoc_int ~> lcm.assoc 

440 
int_le_0_conv ~> of_nat_le_0_iff 

441 
int_eq_0_conv ~> of_nat_eq_0_iff 

442 
Gcd_empty_nat ~> Gcd_empty 

443 
Gcd_empty_int ~> Gcd_empty 

444 
gcd_assoc_nat ~> gcd.assoc 

445 
gcd_assoc_int ~> gcd.assoc 

446 
zero_zle_int ~> of_nat_0_le_iff 

447 
lcm_dvd2_nat ~> dvd_lcm2 

448 
lcm_dvd2_int ~> dvd_lcm2 

449 
lcm_dvd1_nat ~> dvd_lcm1 

450 
lcm_dvd1_int ~> dvd_lcm1 

451 
gcd_zero_nat ~> gcd_eq_0_iff 

452 
gcd_zero_int ~> gcd_eq_0_iff 

453 
gcd_dvd2_nat ~> gcd_dvd2 

454 
gcd_dvd2_int ~> gcd_dvd2 

455 
gcd_dvd1_nat ~> gcd_dvd1 

456 
gcd_dvd1_int ~> gcd_dvd1 

457 
int_numeral ~> of_nat_numeral 

458 
lcm_ac_nat ~> ac_simps 

459 
lcm_ac_int ~> ac_simps 

460 
gcd_ac_nat ~> ac_simps 

461 
gcd_ac_int ~> ac_simps 

462 
abs_int_eq ~> abs_of_nat 

463 
zless_int ~> of_nat_less_iff 

464 
zdiff_int ~> of_nat_diff 

465 
zadd_int ~> of_nat_add 

466 
int_mult ~> of_nat_mult 

467 
int_Suc ~> of_nat_Suc 

468 
inj_int ~> inj_of_nat 

469 
int_1 ~> of_nat_1 

470 
int_0 ~> of_nat_0 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

493 
coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff 
62348  494 
realpow_minus_mult ~> power_minus_mult 
495 
realpow_Suc_le_self ~> power_Suc_le_self 

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

496 
dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest 
62347  497 
INCOMPATIBILITY. 
498 

62479  499 
* Session HOLNSA has been renamed to HOLNonstandard_Analysis. 
500 

62975
1d066f6ab25d
Probability: move emeasure and nn_integral from ereal to ennreal
hoelzl
parents:
62969
diff
changeset

501 
* In HOLProbability the type of emeasure and nn_integral was changed 
1d066f6ab25d
Probability: move emeasure and nn_integral from ereal to ennreal
hoelzl
parents:
62969
diff
changeset

502 
from ereal to ennreal: 
1d066f6ab25d
Probability: move emeasure and nn_integral from ereal to ennreal
hoelzl
parents:
62969
diff
changeset

503 
emeasure :: 'a measure => 'a set => ennreal 
1d066f6ab25d
Probability: move emeasure and nn_integral from ereal to ennreal
hoelzl
parents:
62969
diff
changeset

504 
nn_integral :: 'a measure => ('a => ennreal) => ennreal 
62976  505 
INCOMPATIBILITY. 
62327  506 

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

507 

62498  508 
*** ML *** 
509 

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

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

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

514 
INCOMPATIBILITY. 

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

515 

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

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

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

523 

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

526 
requiring separate files. 

527 

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

529 
exposed to Isabelle/ML userspace. Potential INCOMPATIBILITY. 
62851  530 

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

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

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

533 

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

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

537 
debugger information requires consirable time and space: main 

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

539 

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

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

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

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

545 
balanced blocks of Local_Theory.open_target versus 

546 
Local_Theory.close_target instead. Rare INCOMPATIBILITY. 

547 

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

550 
INCOMPATIBILITY. 

551 

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

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

555 
File.full_path). Potential INCOMPATIBILITY. 

556 

63352  557 
* Binding.empty_atts supersedes Thm.empty_binding and 
558 
Attrib.empty_binding. Minor INCOMPATIBILITY. 

559 

62498  560 

62354  561 
*** System *** 
562 

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

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

564 
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

565 
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

566 
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

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

568 

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

571 
"isabelle_scala_script". 

572 

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

575 
Isabelle_Tool.Body. 

576 

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

579 
particular: 

580 

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

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

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

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

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

585 

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

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

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

589 

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

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

591 
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

592 
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

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

594 

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

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

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

597 

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

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

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

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

601 

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

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

603 
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

604 
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

605 
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

606 
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

607 
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

608 
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

609 

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

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

614 

62354  615 

616 

62031  617 
New in Isabelle2016 (February 2016) 
62016  618 
 
60138  619 

61337  620 
*** General *** 
621 

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

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

623 
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

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

625 
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

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

627 

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

630 

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

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

634 
has been removed (see below). 

635 

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

62017  638 

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

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

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

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

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

643 

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

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

645 
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

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

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

648 

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

651 
to update old sources. 

652 

61337  653 
* Toplevel theorem statements have been simplified as follows: 
654 

655 
theorems ~> lemmas 

656 
schematic_lemma ~> schematic_goal 

657 
schematic_theorem ~> schematic_goal 

658 
schematic_corollary ~> schematic_goal 

659 

660 
Commandline tool "isabelle update_theorems" updates theory sources 

661 
accordingly. 

662 

61338  663 
* Toplevel theorem statement 'proposition' is another alias for 
664 
'theorem'. 

665 

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

668 
deferred definitions require a surrounding 'overloading' block. 

669 

61337  670 

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

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

672 

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

676 
'SML_file_no_debug' control compilation of sources with or without 

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

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

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

680 
any effect on the running ML program. 

60984  681 

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

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

685 
update. 

61729  686 

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

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

689 
enable option "editor_output_state". 

61215  690 

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

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

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

695 
visibility. 

696 

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

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

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

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

701 
panel. 

702 

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

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

704 
state output, interactive queries) wrt. longrunning background tasks. 
62017  705 

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

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

708 
implicit: a popup will show up unconditionally. 

709 

710 
* Additional abbreviations for syntactic completion may be specified in 

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

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

713 

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

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

715 
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

716 
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

717 
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

718 

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

721 
the editor. 

722 

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

724 
instead of former C+e LEFT. 

725 

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

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

728 
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

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

730 

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

733 
singleinstance applications seen on common GUI desktops. 

734 

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

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

736 
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

737 
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

738 

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

741 

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

744 

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

745 

61405  746 
*** Document preparation *** 
747 

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

750 

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

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

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

754 

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

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

757 
follows: 

758 

759 
\<^item> itemize 

760 
\<^enum> enumerate 

761 
\<^descr> description 

762 

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

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

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

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

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

769 

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

772 
standard LaTeX macros of the same names. 

773 

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

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

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

778 
cartouche tokens seen in theory sources. 

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

779 

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

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

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

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

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

785 

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

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

789 

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

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

792 

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

794 

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

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

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

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

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

800 
documentation, with a hyperlink in the Prover IDE. 

801 

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

803 
entities of the Isar language. 

804 

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

61488  807 
print mode "HTML" loses its special meaning. 
61471  808 

61405  809 

60406  810 
*** Isar *** 
811 

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

814 
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

815 
example: 
60414  816 

817 
have result: "C x y" 

818 
if "A x" and "B y" 

819 
for x :: 'a and y :: 'a 

820 
<proof> 

821 

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

60414  824 
corresponds to a raw proof block like this: 
825 

826 
{ 

827 
fix x :: 'a and y :: 'a 

60449  828 
assume that: "A x" "B y" 
60414  829 
have "C x y" <proof> 
830 
} 

831 
note result = this 

60406  832 

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

833 
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

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

835 

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

61658  838 

839 
assume result: "C x y" 

840 
if "A x" and "B y" 

841 
for x :: 'a and y :: 'a 

842 

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

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

845 

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

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

848 
example: 

849 

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

851 

852 
is equivalent to: 

853 

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

855 

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

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

60595  860 

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

862 

863 
or: 

864 

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

866 

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

868 

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

870 

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

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

874 
of the local context elements yet. 

875 

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

878 

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

880 
then have something 

881 
proof cases 

882 
case a 

883 
then show ?thesis <proof> 

884 
next 

885 
case b 

886 
then show ?thesis <proof> 

887 
next 

888 
case c 

889 
then show ?thesis <proof> 

890 
qed 

891 

60565  892 
* Command 'case' allows fact name and attribute specification like this: 
893 

894 
case a: (c xs) 

895 
case a [attributes]: (c xs) 

896 

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

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

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

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

901 
and always put attributes in front. 

902 

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

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

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

905 
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

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

907 

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

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

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

912 

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

914 
supply [simp] = a 

915 
proof 

916 
show A by simp 

917 
next 

918 
show A by simp 

919 
qed 

920 

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

922 
proof body as well, abstracted over relevant parameters. 

923 

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

925 
parameter scope for of each clause. 

926 

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

928 
statements: result is abstracted over unknowns. 

929 

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

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

933 
manual. 

934 

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

937 

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

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

939 
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

940 
example: 
60617  941 

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

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

944 
proof goal_cases 
60622  945 
case (1 x) 
946 
then show ?case using \<open>A x\<close> \<open>B x\<close> sorry 

947 
next 

948 
case (2 y z) 

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

950 
qed 

951 

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

953 
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

954 
proof goal_cases 
60617  955 
case prems: 1 
956 
then show ?case using prems sorry 

957 
next 

958 
case prems: 2 

959 
then show ?case using prems sorry 

960 
qed 

60578  961 

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

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

60581  966 

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

60551  969 

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

972 

60406  973 

60331  974 
*** Pure *** 
975 

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

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

977 
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

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

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

980 

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

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

983 

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

984 
* More gentle suppression of syntax along locale morphisms while 
62017  985 
printing terms. Previously 'abbreviation' and 'notation' declarations 
986 
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

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

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

991 
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

992 

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

993 
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

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

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

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

997 

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

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

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

1000 
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

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

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

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

1004 

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

1007 

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

61675  1009 
'defines'. 
1010 

61895  1011 
* Command 'permanent_interpretation' has been discontinued. Use 
1012 
'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY. 

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

1013 

61252  1014 
* Command 'print_definitions' prints dependencies of definitional 
1015 
specifications. This functionality used to be part of 'print_theory'. 

1016 

60331  1017 
* Configuration option rule_insts_schematic has been discontinued 
62017  1018 
(intermediate legacy feature in Isabelle2015). INCOMPATIBILITY. 
60331  1019 

62205  1020 
* Abbreviations in type classes now carry proper sort constraint. Rare 
1021 
INCOMPATIBILITY in situations where the previous misbehaviour has been 

1022 
exploited. 

60347  1023 

1024 
* Refinement of userspace type system in type classes: pseudolocal 

62205  1025 
operations behave more similar to abbreviations. Potential 
60347  1026 
INCOMPATIBILITY in exotic situations. 
1027 

1028 

60171  1029 
*** HOL *** 
1030 

62017  1031 
* The 'typedef' command has been upgraded from a partially checked 
1032 
"axiomatization", to a full definitional specification that takes the 

1033 
global collection of overloaded constant / type definitions into 

1034 
account. Type definitions with open dependencies on overloaded 

1035 
definitions need to be specified as "typedef (overloaded)". This 

1036 
provides extra robustness in theory construction. Rare INCOMPATIBILITY. 

1037 

1038 
* Qualification of various formal entities in the libraries is done more 

1039 
uniformly via "context begin qualified definition ... end" instead of 

1040 
oldstyle "hide_const (open) ...". Consequently, both the defined 

1041 
constant and its defining fact become qualified, e.g. Option.is_none and 

1042 
Option.is_none_def. Occasional INCOMPATIBILITY in applications. 

1043 

1044 
* Some old and rarely used ASCII replacement syntax has been removed. 

1045 
INCOMPATIBILITY, standard syntax with symbols should be used instead. 

1046 
The subsequent commands help to reproduce the old forms, e.g. to 

1047 
simplify porting old theories: 

1048 

1049 
notation iff (infixr "<>" 25) 

1050 

1051 
notation Times (infixr "<*>" 80) 

1052 

1053 
type_notation Map.map (infixr "~=>" 0) 

1054 
notation Map.map_comp (infixl "o'_m" 55) 

1055 

1056 
type_notation FinFun.finfun ("(_ =>f /_)" [22, 21] 21) 

1057 

1058 
notation FuncSet.funcset (infixr ">" 60) 

1059 
notation FuncSet.extensional_funcset (infixr ">\<^sub>E" 60) 

1060 

1061 
notation Omega_Words_Fun.conc (infixr "conc" 65) 

1062 

1063 
notation Preorder.equiv ("op ~~") 

1064 
and Preorder.equiv ("(_/ ~~ _)" [51, 51] 50) 

1065 

1066 
notation (in topological_space) tendsto (infixr ">" 55) 

1067 
notation (in topological_space) LIMSEQ ("((_)/ > (_))" [60, 60] 60) 

1068 
notation LIM ("((_)/  (_)/ > (_))" [60, 0, 60] 60) 

1069 

1070 
notation NSA.approx (infixl "@=" 50) 

1071 
notation NSLIMSEQ ("((_)/ NS> (_))" [60, 60] 60) 

1072 
notation NSLIM ("((_)/  (_)/ NS> (_))" [60, 0, 60] 60) 

1073 

1074 
* The alternative notation "\<Colon>" for type and sort constraints has been 

1075 
removed: in LaTeX document output it looks the same as "::". 

1076 
INCOMPATIBILITY, use plain "::" instead. 

1077 

1078 
* Commands 'inductive' and 'inductive_set' work better when names for 

1079 
intro rules are omitted: the "cases" and "induct" rules no longer 

1080 
declare empty case_names, but no case_names at all. This allows to use 

1081 
numbered cases in proofs, without requiring method "goal_cases". 

1082 

1083 
* Inductive definitions ('inductive', 'coinductive', etc.) expose 

1084 
lowlevel facts of the internal construction only if the option 

62093  1085 
"inductive_internals" is enabled. This refers to the internal predicate 
62017  1086 
definition and its monotonicity result. Rare INCOMPATIBILITY. 
1087 

1088 
* Recursive function definitions ('fun', 'function', 'partial_function') 

1089 
expose lowlevel facts of the internal construction only if the option 

62205  1090 
"function_internals" is enabled. Its internal inductive definition is 
1091 
also subject to "inductive_internals". Rare INCOMPATIBILITY. 

62093  1092 

1093 
* BNF datatypes ('datatype', 'codatatype', etc.) expose lowlevel facts 

1094 
of the internal construction only if the option "bnf_internals" is 

1095 
enabled. This supersedes the former option "bnf_note_all". Rare 

1096 
INCOMPATIBILITY. 

62017  1097 

1098 
* Combinator to represent case distinction on products is named 

1099 
"case_prod", uniformly, discontinuing any input aliasses. Very popular 

1100 
theorem aliasses have been retained. 

1101 

61424
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1102 
Consolidated facts: 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1103 
PairE ~> prod.exhaust 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1104 
Pair_eq ~> prod.inject 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1105 
pair_collapse ~> prod.collapse 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1106 
Pair_fst_snd_eq ~> prod_eq_iff 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1107 
split_twice ~> prod.case_distrib 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1108 
split_weak_cong ~> prod.case_cong_weak 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1109 
split_split ~> prod.split 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1110 
split_split_asm ~> prod.split_asm 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1111 
splitI ~> case_prodI 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1112 
splitD ~> case_prodD 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1113 
splitI2 ~> case_prodI2 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1114 
splitI2' ~> case_prodI2' 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1115 
splitE ~> case_prodE 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1116 
splitE' ~> case_prodE' 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1117 
split_pair ~> case_prod_Pair 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1118 
split_eta ~> case_prod_eta 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1119 
split_comp ~> case_prod_comp 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1120 
mem_splitI ~> mem_case_prodI 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1121 
mem_splitI2 ~> mem_case_prodI2 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1122 
mem_splitE ~> mem_case_prodE 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1123 
The_split ~> The_case_prod 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1124 
cond_split_eta ~> cond_case_prod_eta 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1125 
Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1126 
Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1127 
in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1128 
Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1129 
Collect_split_Grp_inD ~> Collect_case_prod_Grp_in 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1130 
Domain_Collect_split ~> Domain_Collect_case_prod 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1131 
Image_Collect_split ~> Image_Collect_case_prod 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1132 
Range_Collect_split ~> Range_Collect_case_prod 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1133 
Eps_split ~> Eps_case_prod 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1134 
Eps_split_eq ~> Eps_case_prod_eq 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1135 
split_rsp ~> case_prod_rsp 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1136 
curry_split ~> curry_case_prod 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1137 
split_curry ~> case_prod_curry 
62017  1138 

61424
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1139 
Changes in structure HOLogic: 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1140 
split_const ~> case_prod_const 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1141 
mk_split ~> mk_case_prod 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1142 
mk_psplits ~> mk_ptupleabs 
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61405
diff
changeset

1143 
strip_psplits ~> strip_ptupleabs 
62017  1144 

1145 
INCOMPATIBILITY. 

1146 

1147 
* The coercions to type 'real' have been reorganised. The function 

1148 
'real' is no longer overloaded, but has type 'nat => real' and 

1149 
abbreviates of_nat for that type. Also 'real_of_int :: int => real' 

1150 
abbreviates of_int for that type. Other overloaded instances of 'real' 

1151 
have been replaced by 'real_of_ereal' and 'real_of_float'. 

1152 

61694
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1153 
Consolidated facts (among others): 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1154 
real_of_nat_le_iff > of_nat_le_iff 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1155 
real_of_nat_numeral of_nat_numeral 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1156 
real_of_int_zero of_int_0 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1157 
real_of_nat_zero of_nat_0 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1158 
real_of_one of_int_1 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1159 
real_of_int_add of_int_add 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1160 
real_of_nat_add of_nat_add 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1161 
real_of_int_diff of_int_diff 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1162 
real_of_nat_diff of_nat_diff 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1163 
floor_subtract floor_diff_of_int 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1164 
real_of_int_inject of_int_eq_iff 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1165 
real_of_int_gt_zero_cancel_iff of_int_0_less_iff 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1166 
real_of_int_ge_zero_cancel_iff of_int_0_le_iff 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1167 
real_of_nat_ge_zero of_nat_0_le_iff 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1168 
real_of_int_ceiling_ge le_of_int_ceiling 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1169 
ceiling_less_eq ceiling_less_iff 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1170 
ceiling_le_eq ceiling_le_iff 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1171 
less_floor_eq less_floor_iff 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1172 
floor_less_eq floor_less_iff 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1173 
floor_divide_eq_div floor_divide_of_int_eq 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1174 
real_of_int_zero_cancel of_nat_eq_0_iff 
6571c78c9667
Removed some legacy theorems; minor adjustments to simplification rules; new material on homotopic paths
paulson <lp15@cam.ac.uk>
parents:
61685
diff
changeset

1175 
ceiling_real_of_int ceiling_of_int 
62017  1176 

1177 
INCOMPATIBILITY. 

61143  1178 

60841  1179 
* Theory Map: lemma map_of_is_SomeD was a clone of map_of_SomeD and has 
1180 
been removed. INCOMPATIBILITY. 

1181 

60712
3ba16d28449d
Quickcheck setup for finite sets
Lars Hupel <lars.hupel@mytum.de>
parents:
60707
diff
changeset

1182 
* Quickcheck setup for finite sets. 
3ba16d28449d
Quickcheck setup for finite sets
Lars Hupel <lars.hupel@mytum.de>
parents:
60707
diff
changeset

1183 

60171  1184 
* Discontinued simp_legacy_precond. Potential INCOMPATIBILITY. 
60138  1185 

60306
6b7c64ab8bd2
made Auto Sledgehammer behave more like the real thing
blanchet
parents:
60301
diff
changeset

1186 
* Sledgehammer: 
61318  1187 
 The MaSh relevance filter has been sped up. 
60306
6b7c64ab8bd2
made Auto Sledgehammer behave more like the real thing
blanchet
parents:
60301
diff
changeset

1188 
 Proof reconstruction has been improved, to minimize the incidence of 
6b7c64ab8bd2
made Auto Sledgehammer behave more like the real thing
blanchet
parents:
60301
diff
changeset

1189 
cases where Sledgehammer gives a proof that does not work. 
6b7c64ab8bd2
made Auto Sledgehammer behave more like the real thing
blanchet
parents:
60301
diff
changeset

1190 
 Auto Sledgehammer now minimizes and preplays the results. 
61030  1191 
 Handle Vampire 4.0 proof output without raising exception. 
61043  1192 
 Eliminated "MASH" environment variable. Use the "MaSh" option in 
1193 
Isabelle/jEdit instead. INCOMPATIBILITY. 

61317  1194 
 Eliminated obsolete "blocking" option and related subcommands. 
60306
6b7c64ab8bd2
made Auto Sledgehammer behave more like the real thing
blanchet
parents:
60301
diff
changeset

1195 

60310  1196 
* Nitpick: 
61325
1cfc476198c9
avoid too aggressive optimization of 'finite' predicate
blanchet
parents:
61324
diff
changeset

1197 
 Fixed soundness bug in translation of "finite" predicate. 
61324
d4ec7594f558
avoid unsound simplification of (C (s x)) when s is a selector but not C's
blanchet
parents:
61318
diff
changeset

1198 
 Fixed soundness bug in "destroy_constrs" optimization. 
62080  1199 
 Fixed soundness bug in translation of "rat" type. 
60310  1200 
 Removed "check_potential" and "check_genuine" options. 
61317  1201 
 Eliminated obsolete "blocking" option. 
60310  1202 

62027  1203 
* (Co)datatype package: 
61345  1204 
 New commands "lift_bnf" and "copy_bnf" for lifting (copying) a BNF 
1205 
structure on the raw type to an abstract type defined using typedef. 

1206 
 Always generate "case_transfer" theorem. 

62235  1207 
 For mutual types, generate slightly stronger "rel_induct", 
1208 
"rel_coinduct", and "coinduct" theorems. INCOMPATIBLITY. 

61551  1209 
 Allow discriminators and selectors with the same name as the type 
1210 
being defined. 

1211 
 Avoid various internal name clashes (e.g., 'datatype f = f'). 

60920  1212 

62098  1213 
* Transfer: new methods for interactive debugging of 'transfer' and 
1214 
'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end', 

1215 
'transfer_prover_start' and 'transfer_prover_end'. 

61370  1216 

62118  1217 
* New diagnostic command print_record for displaying record definitions. 
1218 

60868
dd18c33c001e
direct bootstrap of integer division from natural division
haftmann
parents:
60841
diff
changeset

1219 
* Division on integers is bootstrapped directly from division on 
62017  1220 
naturals and uses generic numeral algorithm for computations. Slight 
1221 
INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former 

1222 
simprocs binary_int_div and binary_int_mod 

1223 

1224 
* Tightened specification of class semiring_no_zero_divisors. Minor 

60516
0826b7025d07
generalized some theorems about integral domains and moved to HOL theories
haftmann
parents:
60515
diff
changeset

1225 
INCOMPATIBILITY. 
0826b7025d07
generalized some theorems about integral domains and moved to HOL theories
haftmann
parents:
60515
diff
changeset

1226 

60688
01488b559910
avoid explicit definition of the relation of associated elements in a ring  prefer explicit normalization instead
haftmann
parents:
60642
diff
changeset

1227 
* Class algebraic_semidom introduces common algebraic notions of 
62017  1228 
integral (semi)domains, particularly units. Although logically subsumed 
1229 
by fields, is is not a super class of these in order not to burden 

1230 
fields with notions that are trivial there. 

1231 

1232 
* Class normalization_semidom specifies canonical representants for 

1233 
equivalence classes of associated elements in an integral (semi)domain. 

1234 
This formalizes associated elements as well. 

60688
01488b559910
avoid explicit definition of the relation of associated elements in a ring  prefer explicit normalization instead
haftmann
parents:
60642
diff
changeset

1235 

01488b559910
avoid explicit definition of the relation of associated elements in a ring  prefer explicit normalization instead
haftmann
parents:
60642
diff
changeset

1236 
* Abstract specification of gcd/lcm operations in classes semiring_gcd, 
62017  1237 
semiring_Gcd, semiring_Lcd. Minor INCOMPATIBILITY: facts gcd_nat.commute 
1238 
and gcd_int.commute are subsumed by gcd.commute, as well as 

1239 
gcd_nat.assoc and gcd_int.assoc by gcd.assoc. 

1240 

1241 
* Former constants Fields.divide (_ / _) and Divides.div (_ div _) are 

1242 
logically unified to Rings.divide in syntactic type class Rings.divide, 

1243 
with infix syntax (_ div _). Infix syntax (_ / _) for field division is 

1244 
added later as abbreviation in class Fields.inverse. INCOMPATIBILITY, 

1245 
instantiations must refer to Rings.divide rather than the former 

1246 
separate constants, hence infix syntax (_ / _) is usually not available 

1247 
during instantiation. 

1248 

1249 
* New cancellation simprocs for boolean algebras to cancel complementary 

1250 
terms for sup and inf. For example, "sup x (sup y ( x))" simplifies to 

1251 
"top". INCOMPATIBILITY. 

61629
90f54d9e63f2
cancel complementary terms as arguments to sup/inf in boolean algebras
Andreas Lochbihler
parents:
61623
diff
changeset

1252 

62101  1253 
* Class uniform_space introduces uniform spaces btw topological spaces 
1254 
and metric spaces. Minor INCOMPATIBILITY: open_<type>_def needs to be 

62205  1255 
introduced in the form of an uniformity. Some constants are more general 
1256 
now, it may be necessary to add type class constraints. 

62101  1257 

1258 
open_real_def \<leadsto> open_dist 

1259 
open_complex_def \<leadsto> open_dist 

1260 

62026  1261 
* Library/Monad_Syntax: notation uses symbols \<bind> and \<then>. INCOMPATIBILITY. 
1262 

60397
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
60390
diff
changeset

1263 
* Library/Multiset: 
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
60390
diff
changeset

1264 
 Renamed multiset inclusion operators: 
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
60390
diff
changeset

1265 
< ~> <# 
62208
ad43b3ab06e4
added 'supset' variants for new '<#' etc. symbols on multisets
blanchet
parents:
62205
diff
changeset

1266 
> ~> ># 
60397
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
60390
diff
changeset

1267 
<= ~> <=# 
62208
ad43b3ab06e4
added 'supset' variants for new '<#' etc. symbols on multisets
blanchet
parents:
62205
diff
changeset

1268 
>= ~> >=# 
60397
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
60390
diff
changeset

1269 
\<le> ~> \<le># 
62208
ad43b3ab06e4
added 'supset' variants for new '<#' etc. symbols on multisets
blanchet
parents:
62205
diff
changeset

1270 
\<ge> ~> \<ge># 
60397
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
60390
diff
changeset

1271 
INCOMPATIBILITY. 
62209  1272 
 Added multiset inclusion operator syntax: 
1273 
\<subset># 

1274 
\<subseteq># 

1275 
\<supset># 

1276 
\<supseteq># 

60397
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
60390
diff
changeset

1277 
 "'a multiset" is no longer an instance of the "order", 
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
60390
diff
changeset

1278 
"ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff", 
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
60390
diff
changeset

1279 
"semilattice_inf", and "semilattice_sup" type classes. The theorems 
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
60390
diff
changeset

1280 
previously provided by these type classes (directly or indirectly) 
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
60390
diff
changeset

1281 
are now available through the "subset_mset" interpretation 
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
60390
diff
changeset

1282 
(e.g. add_mono ~> subset_mset.add_mono). 
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
60390
diff
changeset

1283 
INCOMPATIBILITY. 
60497  1284 
 Renamed conversions: 
60515  1285 
multiset_of ~> mset 
1286 
multiset_of_set ~> mset_set 

60497  1287 
set_of ~> set_mset 
1288 
INCOMPATIBILITY 

60398  1289 
 Renamed lemmas: 
1290 
mset_le_def ~> subseteq_mset_def 

1291 
mset_less_def ~> subset_mset_def 

60400  1292 
less_eq_multiset.rep_eq ~> subseteq_mset_def 
1293 
INCOMPATIBILITY 

1294 
 Removed lemmas generated by lift_definition: 

62235  1295 
less_eq_multiset.abs_eq, less_eq_multiset.rsp, 
1296 
less_eq_multiset.transfer, less_eq_multiset_def 

60400  1297 
INCOMPATIBILITY 
60006  1298 

62017  1299 
* Library/Omega_Words_Fun: Infinite words modeled as functions nat \<Rightarrow> 'a. 
1300 

1301 
* Library/Bourbaki_Witt_Fixpoint: Added formalisation of the 

1302 
BourbakiWitt fixpoint theorem for increasing functions in 

1303 
chaincomplete partial orders. 

1304 

1305 
* Library/Old_Recdef: discontinued obsolete 'defer_recdef' command. 

1306 
Minor INCOMPATIBILITY, use 'function' instead. 

1307 

62064  1308 
* Library/Periodic_Fun: a locale that provides convenient lemmas for 
1309 
periodic functions. 

62060
b75764fc4c35
Added summability/Gamma/etc. to NEWS and CONTRIBUTORS
eberlm
parents:
62034
diff
changeset

1310 

62098  1311 
* Library/Formal_Power_Series: proper definition of division (with 
1312 
remainder) for formal power series; instances for Euclidean Ring and 

1313 
GCD. 

62086
1c0246456ab9
Added formal power series updates to NEWS/CONTRIBUTORS
Manuel Eberl <eberlm@in.tum.de>
parents:
62084
diff
changeset

1314 

62084  1315 
* HOLImperative_HOL: obsolete theory Legacy_Mrec has been removed. 
1316 

1317 
* HOLStatespace: command 'statespace' uses mandatory qualifier for 

1318 
import of parent, as for general 'locale' expressions. INCOMPATIBILITY, 

1319 
remove '!' and add '?' as required. 

1320 

62237  1321 
* HOLDecision_Procs: The "approximation" method works with "powr" 
1322 
(exponentiation on real numbers) again. 

1323 

62084  1324 
* HOLMultivariate_Analysis: theory Cauchy_Integral_Thm with Contour 
1325 
integrals (= complex path integrals), Cauchy's integral theorem, winding 

1326 
numbers and Cauchy's integral formula, Liouville theorem, Fundamental 

1327 
Theorem of Algebra. Ported from HOL Light. 

1328 

1329 
* HOLMultivariate_Analysis: topological concepts such as connected 

62017  1330 
components, homotopic paths and the inside or outside of a set. 
61121
efe8b18306b7
do not expose lowlevel "_def" facts of 'function' definitions, to avoid potential confusion with the situation of plain 'definition';
wenzelm
parents:
61119
diff
changeset

1331 

62084  1332 
* HOLMultivariate_Analysis: radius of convergence of power series and 
62064  1333 
various summability tests; Harmonic numbers and the Eulerâ€“Mascheroni 
1334 
constant; the Generalised Binomial Theorem; the complex and real 

1335 
Gamma/logGamma/Digamma/ Polygamma functions and their most important 

1336 
properties. 

62060
b75764fc4c35
Added summability/Gamma/etc. to NEWS and CONTRIBUTORS
eberlm
parents:
62034
diff
changeset

1337 

62084  1338 
* HOLProbability: The central limit theorem based on Levy's uniqueness 
1339 
and continuity theorems, weak convergence, and characterisitc functions. 

1340 

1341 
* HOLData_Structures: new and growing session of standard data 

1342 
structures. 

61178
0b071f72f330
Omega_Words_Fun: Infinite words as functions from nat.
lammich <lammich@in.tum.de>
parents:
61174
diff
changeset

1343 

60479  1344 

60793  1345 
*** ML *** 
1346 

62017  1347 
* The following combinators for lowlevel profiling of the ML runtime 
1348 
system are available: 

1349 

1350 
profile_time (*CPU time*) 

1351 
profile_time_thread (*CPU time on this thread*) 

1352 
profile_allocations (*overall heap allocations*) 

1353 

1354 
* Antiquotation @{undefined} or \<^undefined> inlines (raise Match). 

1355 

62075  1356 
* Antiquotation @{method NAME} inlines the (checked) name of the given 
1357 
Isar proof method. 

1358 

61922  1359 
* Pretty printing of Poly/ML compiler output in Isabelle has been 
1360 
improved: proper treatment of break offsets and blocks with consistent 

1361 
breaks. 

1362 

61268  1363 
* The auxiliary module Pure/display.ML has been eliminated. Its 
1364 
elementary thm print operations are now in Pure/more_thm.ML and thus 

1365 
called Thm.pretty_thm, Thm.string_of_thm etc. INCOMPATIBILITY. 

1366 

61144  1367 
* Simproc programming interfaces have been simplified: 
1368 
Simplifier.make_simproc and Simplifier.define_simproc supersede various 

1369 
forms of Simplifier.mk_simproc, Simplifier.simproc_global etc. Note that 

1370 
term patterns for the lefthand sides are specified with implicitly 

1371 
fixed variables, like toplevel theorem statements. INCOMPATIBILITY. 

1372 

60802  1373 
* Instantiation rules have been reorganized as follows: 
1374 

1375 
Thm.instantiate (*lowlevel instantiation with named arguments*) 

1376 
Thm.instantiate' (*version with positional arguments*) 

1377 

1378 
Drule.infer_instantiate (*instantiation with type inference*) 

1379 
Drule.infer_instantiate' (*version with positional arguments*) 

1380 

1381 
The LHS only requires variable specifications, instead of full terms. 
