author  wenzelm 
Tue, 12 Jul 2016 14:53:47 +0200  
changeset 63461  f10feaa9b14a 
parent 63455  019856db2bb6 
child 63463  b6a1047bc164 
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 

63461  79 
* Refined folding mode "isabelle" based on Isar syntax: 'next' and 'qed' 
80 
are treated as delimiters for fold structure. 

81 

63455
019856db2bb6
added action "isabelle.newline" (shortcut ENTER);
wenzelm
parents:
63453
diff
changeset

82 
* Improved support for indentation according to Isabelle outer syntax. 
019856db2bb6
added action "isabelle.newline" (shortcut ENTER);
wenzelm
parents:
63453
diff
changeset

83 
Action "indentlines" (shortcut C+i) indents the current line according 
019856db2bb6
added action "isabelle.newline" (shortcut ENTER);
wenzelm
parents:
63453
diff
changeset

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

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

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

87 
"jedit_indent_newline". 
63452  88 

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

91 
systematic renaming. 

92 

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

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

94 
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

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

96 

62904  97 

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

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

99 

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

102 

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

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

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

106 

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

109 
INCOMPATIBILITY. 

110 

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

113 
'definition', 'inductive', 'function'. 

114 

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

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

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

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

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

120 

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

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

63039  125 

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

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

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

128 

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

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

130 
typesetting. E.g. to produce proof holes in examples and documentation. 
62216  131 

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

134 

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

137 
definitions. 

138 

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

140 
method expression, e.g. 

141 

142 
(use facts in simp) 

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

144 

62216  145 

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

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

147 

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

150 
examples. 

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

151 

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

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

153 
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

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

155 

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

156 

62327  157 
*** HOL *** 
158 

63438  159 
* Theory Set_Interval.thy: substantial new theorems on indexed sums 
160 
and products. 

161 

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

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

165 

63416
6af79184bef3
avoid to hide equality behind (output) abbreviation
haftmann
parents:
63414
diff
changeset

166 
* "surj" is a mere input abbreviation, to avoid hiding an equation in 
6af79184bef3
avoid to hide equality behind (output) abbreviation
haftmann
parents:
63414
diff
changeset

167 
term output. Minor INCOMPATIBILITY. 
6af79184bef3
avoid to hide equality behind (output) abbreviation
haftmann
parents:
63414
diff
changeset

168 

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

169 
* Theory Library/Combinator_PER.thy: combinator to build partial 
63378  170 
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

171 

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

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

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

174 

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

177 

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

180 
lifting_syntax begin ... end". Minor INCOMPATIBILITY. 

181 

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

184 

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

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

186 
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

187 
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

188 
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

189 
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

190 
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

191 
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

192 

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

195 

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

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

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

198 

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

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

200 
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

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

202 

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

205 
list in random order. 

206 

63246  207 
* Probability/SPMF formalises discrete subprobability distributions. 
208 

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

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

210 
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

211 
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

212 
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

213 

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

216 
element of the carrier set exactly once. 

217 

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

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

219 
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

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

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

222 

62522  223 
* New abbreviations for negated existence (but not bounded existence): 
224 

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

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

227 

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

230 
eliminated altogether. 

231 

63116  232 
* Sledgehammer: 
233 
 Produce syntactically correct Vampire 4.0 problem files. 

234 

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

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

62842  239 
method. See 'isabelle doc corec'. 
62693  240 
 The predicator :: ('a => bool) => 'a F => bool is now a firstclass 
62332  241 
citizen in bounded natural functors 
62693  242 
 'primrec' now allows nested calls through the predicator in addition 
62327  243 
to the map function. 
62693  244 
 'bnf' automatically discharges reflexive proof obligations 
245 
 'bnf' outputs a slightly modified proof obligation expressing rel in 

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

62693  248 
 'bnf' outputs a new proof obligation expressing pred in terms of set 
62332  249 
(not giving a specification for pred makes this one reflexive) 
62693  250 
INCOMPATIBILITY: manual 'bnf' declarations may need adjustment 
62335  251 
 Renamed lemmas: 
252 
rel_prod_apply ~> rel_prod_inject 

253 
pred_prod_apply ~> pred_prod_inject 

254 
INCOMPATIBILITY. 

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

255 
 The "size" plugin has been made compatible again with locales. 
62327  256 

63113  257 
* Removed obsolete theorem nat_less_cases. INCOMPATIBILITY, use 
258 
linorder_cases instead. 

259 

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

62396  262 

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

265 

266 
 Logical representation: 

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

268 
* All other characters are represented as "Char n" 
62597  269 
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

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

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

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

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

62597  278 
is parsable for every numeral expression n. 
62598  279 
* Noncanonical characters have no special syntax and are 
62597  280 
printed as their logical representation. 
281 
 Explicit conversions from and to the natural numbers are 

282 
provided as char_of_nat, nat_of_char (as before). 

283 
 The auxiliary nibble type has been discontinued. 

284 

285 
INCOMPATIBILITY. 

286 

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

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

288 

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

289 
 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

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

291 

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

292 
 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

293 
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

294 

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

295 
 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

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

297 

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

298 
 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

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

300 

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

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

302 

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

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

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

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

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

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

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

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

310 
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

311 
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

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

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

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

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

316 
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

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

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

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

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

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

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

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

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

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

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

327 
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

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

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

330 

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

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

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

333 

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

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

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

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

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

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

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

340 

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

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

342 
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

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

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

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

346 

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

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

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

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

350 
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

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

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

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

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

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

356 
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

357 

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

358 
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

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

360 
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

361 
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

362 
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

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

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

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

366 
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

367 
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

368 
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

369 
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

370 
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

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

372 

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

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

374 
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

375 
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

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

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

378 

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

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

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

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

382 

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

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

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

385 

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

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

387 
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

388 

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

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

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

391 

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

394 

62345  395 
* Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY. 
396 

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

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

398 
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

399 
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

400 
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

401 

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

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

403 

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

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

405 

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

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

407 
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

408 
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

409 

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

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

411 
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

412 
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

413 
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

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

415 

63155  416 
* Library/Sublist.thy: added function "prefixes" and renamed 
63173  417 
prefixeq > prefix 
418 
prefix > strict_prefix 

419 
suffixeq > suffix 

420 
suffix > strict_suffix 

421 
Added theory of longest common prefixes. 

63117  422 

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

425 
lcm_left_commute_nat ~> lcm.left_commute 

426 
lcm_left_commute_int ~> lcm.left_commute 

427 
gcd_left_commute_nat ~> gcd.left_commute 

428 
gcd_left_commute_int ~> gcd.left_commute 

429 
gcd_greatest_iff_nat ~> gcd_greatest_iff 

430 
gcd_greatest_iff_int ~> gcd_greatest_iff 

431 
coprime_dvd_mult_nat ~> coprime_dvd_mult 

432 
coprime_dvd_mult_int ~> coprime_dvd_mult 

433 
zpower_numeral_even ~> power_numeral_even 

434 
gcd_mult_cancel_nat ~> gcd_mult_cancel 

435 
gcd_mult_cancel_int ~> gcd_mult_cancel 

436 
div_gcd_coprime_nat ~> div_gcd_coprime 

437 
div_gcd_coprime_int ~> div_gcd_coprime 

438 
zpower_numeral_odd ~> power_numeral_odd 

439 
zero_less_int_conv ~> of_nat_0_less_iff 

440 
gcd_greatest_nat ~> gcd_greatest 

441 
gcd_greatest_int ~> gcd_greatest 

442 
coprime_mult_nat ~> coprime_mult 

443 
coprime_mult_int ~> coprime_mult 

444 
lcm_commute_nat ~> lcm.commute 

445 
lcm_commute_int ~> lcm.commute 

446 
int_less_0_conv ~> of_nat_less_0_iff 

447 
gcd_commute_nat ~> gcd.commute 

448 
gcd_commute_int ~> gcd.commute 

449 
Gcd_insert_nat ~> Gcd_insert 

450 
Gcd_insert_int ~> Gcd_insert 

451 
of_int_int_eq ~> of_int_of_nat_eq 

452 
lcm_least_nat ~> lcm_least 

453 
lcm_least_int ~> lcm_least 

454 
lcm_assoc_nat ~> lcm.assoc 

455 
lcm_assoc_int ~> lcm.assoc 

456 
int_le_0_conv ~> of_nat_le_0_iff 

457 
int_eq_0_conv ~> of_nat_eq_0_iff 

458 
Gcd_empty_nat ~> Gcd_empty 

459 
Gcd_empty_int ~> Gcd_empty 

460 
gcd_assoc_nat ~> gcd.assoc 

461 
gcd_assoc_int ~> gcd.assoc 

462 
zero_zle_int ~> of_nat_0_le_iff 

463 
lcm_dvd2_nat ~> dvd_lcm2 

464 
lcm_dvd2_int ~> dvd_lcm2 

465 
lcm_dvd1_nat ~> dvd_lcm1 

466 
lcm_dvd1_int ~> dvd_lcm1 

467 
gcd_zero_nat ~> gcd_eq_0_iff 

468 
gcd_zero_int ~> gcd_eq_0_iff 

469 
gcd_dvd2_nat ~> gcd_dvd2 

470 
gcd_dvd2_int ~> gcd_dvd2 

471 
gcd_dvd1_nat ~> gcd_dvd1 

472 
gcd_dvd1_int ~> gcd_dvd1 

473 
int_numeral ~> of_nat_numeral 

474 
lcm_ac_nat ~> ac_simps 

475 
lcm_ac_int ~> ac_simps 

476 
gcd_ac_nat ~> ac_simps 

477 
gcd_ac_int ~> ac_simps 

478 
abs_int_eq ~> abs_of_nat 

479 
zless_int ~> of_nat_less_iff 

480 
zdiff_int ~> of_nat_diff 

481 
zadd_int ~> of_nat_add 

482 
int_mult ~> of_nat_mult 

483 
int_Suc ~> of_nat_Suc 

484 
inj_int ~> inj_of_nat 

485 
int_1 ~> of_nat_1 

486 
int_0 ~> of_nat_0 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

509 
coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff 
62348  510 
realpow_minus_mult ~> power_minus_mult 
511 
realpow_Suc_le_self ~> power_Suc_le_self 

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

512 
dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest 
62347  513 
INCOMPATIBILITY. 
514 

62479  515 
* Session HOLNSA has been renamed to HOLNonstandard_Analysis. 
516 

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

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

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

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

520 
nn_integral :: 'a measure => ('a => ennreal) => ennreal 
62976  521 
INCOMPATIBILITY. 
62327  522 

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

523 

62498  524 
*** ML *** 
525 

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

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

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

530 
INCOMPATIBILITY. 

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

531 

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

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

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

539 

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

542 
requiring separate files. 

543 

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

545 
exposed to Isabelle/ML userspace. Potential INCOMPATIBILITY. 
62851  546 

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

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

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

549 

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

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

553 
debugger information requires consirable time and space: main 

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

555 

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

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

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

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

561 
balanced blocks of Local_Theory.open_target versus 

562 
Local_Theory.close_target instead. Rare INCOMPATIBILITY. 

563 

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

566 
INCOMPATIBILITY. 

567 

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

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

571 
File.full_path). Potential INCOMPATIBILITY. 

572 

63352  573 
* Binding.empty_atts supersedes Thm.empty_binding and 
574 
Attrib.empty_binding. Minor INCOMPATIBILITY. 

575 

62498  576 

62354  577 
*** System *** 
578 

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

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

580 
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

581 
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

582 
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

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

584 

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

587 
"isabelle_scala_script". 

588 

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

591 
Isabelle_Tool.Body. 

592 

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

595 
particular: 

596 

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

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

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

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

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

601 

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

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

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

605 

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

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

607 
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

608 
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

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

610 

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

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

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

613 

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

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

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

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

617 

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

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

619 
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

620 
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

621 
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

622 
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

623 
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

624 
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

625 

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

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

630 

62354  631 

632 

62031  633 
New in Isabelle2016 (February 2016) 
62016  634 
 
60138  635 

61337  636 
*** General *** 
637 

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

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

639 
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

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

641 
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

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

643 

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

646 

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

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

650 
has been removed (see below). 

651 

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

62017  654 

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

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

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

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

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

659 

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

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

661 
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

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

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

664 

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

667 
to update old sources. 

668 

61337  669 
* Toplevel theorem statements have been simplified as follows: 
670 

671 
theorems ~> lemmas 

672 
schematic_lemma ~> schematic_goal 

673 
schematic_theorem ~> schematic_goal 

674 
schematic_corollary ~> schematic_goal 

675 

676 
Commandline tool "isabelle update_theorems" updates theory sources 

677 
accordingly. 

678 

61338  679 
* Toplevel theorem statement 'proposition' is another alias for 
680 
'theorem'. 

681 

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

684 
deferred definitions require a surrounding 'overloading' block. 

685 

61337  686 

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

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

688 

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

692 
'SML_file_no_debug' control compilation of sources with or without 

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

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

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

696 
any effect on the running ML program. 

60984  697 

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

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

701 
update. 

61729  702 

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

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

705 
enable option "editor_output_state". 

61215  706 

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

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

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

711 
visibility. 

712 

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

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

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

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

717 
panel. 

718 

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

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

720 
state output, interactive queries) wrt. longrunning background tasks. 
62017  721 

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

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

724 
implicit: a popup will show up unconditionally. 

725 

726 
* Additional abbreviations for syntactic completion may be specified in 

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

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

729 

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

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

731 
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

732 
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

733 
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

734 

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

737 
the editor. 

738 

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

740 
instead of former C+e LEFT. 

741 

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

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

744 
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

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

746 

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

749 
singleinstance applications seen on common GUI desktops. 

750 

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

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

752 
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

753 
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

754 

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

757 

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

760 

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

761 

61405  762 
*** Document preparation *** 
763 

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

766 

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

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

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

770 

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

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

773 
follows: 

774 

775 
\<^item> itemize 

776 
\<^enum> enumerate 

777 
\<^descr> description 

778 

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

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

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

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

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

785 

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

788 
standard LaTeX macros of the same names. 

789 

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

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

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

794 
cartouche tokens seen in theory sources. 

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

795 

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

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

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

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

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

801 

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

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

805 

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

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

808 

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

810 

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

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

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

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

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

816 
documentation, with a hyperlink in the Prover IDE. 

817 

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

819 
entities of the Isar language. 

820 

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

61488  823 
print mode "HTML" loses its special meaning. 
61471  824 

61405  825 

60406  826 
*** Isar *** 
827 

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

830 
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

831 
example: 
60414  832 

833 
have result: "C x y" 

834 
if "A x" and "B y" 

835 
for x :: 'a and y :: 'a 

836 
<proof> 

837 

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

60414  840 
corresponds to a raw proof block like this: 
841 

842 
{ 

843 
fix x :: 'a and y :: 'a 

60449  844 
assume that: "A x" "B y" 
60414  845 
have "C x y" <proof> 
846 
} 

847 
note result = this 

60406  848 

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

849 
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

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

851 

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

61658  854 

855 
assume result: "C x y" 

856 
if "A x" and "B y" 

857 
for x :: 'a and y :: 'a 

858 

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

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

861 

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

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

864 
example: 

865 

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

867 

868 
is equivalent to: 

869 

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

871 

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

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

60595  876 

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

878 

879 
or: 

880 

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

882 

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

884 

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

886 

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

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

890 
of the local context elements yet. 

891 

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

894 

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

896 
then have something 

897 
proof cases 

898 
case a 

899 
then show ?thesis <proof> 

900 
next 

901 
case b 

902 
then show ?thesis <proof> 

903 
next 

904 
case c 

905 
then show ?thesis <proof> 

906 
qed 

907 

60565  908 
* Command 'case' allows fact name and attribute specification like this: 
909 

910 
case a: (c xs) 

911 
case a [attributes]: (c xs) 

912 

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

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

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

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

917 
and always put attributes in front. 

918 

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

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

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

921 
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

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

923 

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

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

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

928 

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

930 
supply [simp] = a 

931 
proof 

932 
show A by simp 

933 
next 

934 
show A by simp 

935 
qed 

936 

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

938 
proof body as well, abstracted over relevant parameters. 

939 

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

941 
parameter scope for of each clause. 

942 

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

944 
statements: result is abstracted over unknowns. 

945 

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

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

949 
manual. 

950 

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

953 

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

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

955 
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

956 
example: 
60617  957 

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

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

960 
proof goal_cases 
60622  961 
case (1 x) 
962 
then show ?case using \<open>A x\<close> \<open>B x\<close> sorry 

963 
next 

964 
case (2 y z) 

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

966 
qed 

967 

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

969 
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

970 
proof goal_cases 
60617  971 
case prems: 1 
972 
then show ?case using prems sorry 

973 
next 

974 
case prems: 2 

975 
then show ?case using prems sorry 

976 
qed 

60578  977 

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

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

60581  982 

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

60551  985 

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

988 

60406  989 

60331  990 
*** Pure *** 
991 

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

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

993 
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

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

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

996 

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

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

999 

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

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

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

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

1007 
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

1008 

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

1009 
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

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

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

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

1013 

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

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

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

1016 
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

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

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

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

1020 

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

1023 

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

61675  1025 
'defines'. 
1026 

61895  1027 
* Command 'permanent_interpretation' has been discontinued. Use 
1028 
'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY. 

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

1029 

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

1032 

60331  1033 
* Configuration option rule_insts_schematic has been discontinued 
62017  1034 
(intermediate legacy feature in Isabelle2015). INCOMPATIBILITY. 
60331  1035 

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

1038 
exploited. 

60347  1039 

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

62205  1041 
operations behave more similar to abbreviations. Potential 
60347  1042 
INCOMPATIBILITY in exotic situations. 
1043 

1044 

60171  1045 
*** HOL *** 
1046 

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

1049 
global collection of overloaded constant / type definitions into 

1050 
account. Type definitions with open dependencies on overloaded 

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

1052 
provides extra robustness in theory construction. Rare INCOMPATIBILITY. 

1053 

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

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

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

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

1058 
Option.is_none_def. Occasional INCOMPATIBILITY in applications. 

1059 

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

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

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

1063 
simplify porting old theories: 

1064 

1065 
notation iff (infixr "<>" 25) 

1066 

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

1068 

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

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

1071 

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

1073 

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

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

1076 

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

1078 

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

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

1081 

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

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

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

1085 

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

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

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

1089 

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

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

1092 
INCOMPATIBILITY, use plain "::" instead. 

1093 

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

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

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

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

1098 

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

1100 
lowlevel facts of the internal construction only if the option 

62093  1101 
"inductive_internals" is enabled. This refers to the internal predicate 
62017  1102 
definition and its monotonicity result. Rare INCOMPATIBILITY. 
1103 

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

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

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

62093  1108 

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

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

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

1112 
INCOMPATIBILITY. 

62017  1113 

1114 
* Combinator to represent case distinction on products is named 

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

1116 
theorem aliasses have been retained. 

1117 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1141 
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

1142 
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

1143 
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

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

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

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

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

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

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

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

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

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

1153 
split_curry ~> case_prod_curry 
62017  1154 

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

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

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

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

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

1159 
strip_psplits ~> strip_ptupleabs 
62017  1160 

1161 
INCOMPATIBILITY. 

1162 

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

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

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

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

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

1168 

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

1169 
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

1170 
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

1171 
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

1172 
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

1173 
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

1174 
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

1175 
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

1176 
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

1177 
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

1178 
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

1179 
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

1180 
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

1181 
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

1182 
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

1183 
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

1184 
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

1185 
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

1186 
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

1187 
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

1188 
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

1189 
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

1190 
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

1191 
ceiling_real_of_int ceiling_of_int 
62017  1192 

1193 
INCOMPATIBILITY. 

61143  1194 

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

1197 

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

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

1199 

60171  1200 
* Discontinued simp_legacy_precond. Potential INCOMPATIBILITY. 
60138  1201 

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

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

1204 
 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

1205 
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

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

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

1211 

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

1213 
 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

1214 
 Fixed soundness bug in "destroy_constrs" optimization. 
62080  1215 
 Fixed soundness bug in translation of "rat" type. 
60310  1216 
 Removed "check_potential" and "check_genuine" options. 
61317  1217 
 Eliminated obsolete "blocking" option. 
60310  1218 

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

1222 
 Always generate "case_transfer" theorem. 

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

61551  1225 
 Allow discriminators and selectors with the same name as the type 
1226 
being defined. 

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

60920  1228 

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

1231 
'transfer_prover_start' and 'transfer_prover_end'. 

61370  1232 

62118  1233 
* New diagnostic command print_record for displaying record definitions. 
1234 

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

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

1238 
simprocs binary_int_div and binary_int_mod 

1239 

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

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

1242 

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

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

1246 
fields with notions that are trivial there. 

1247 

1248 
* Class normalization_semidom specifies canonical representants for 

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

1250 
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

1251 

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

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

1255 
gcd_nat.assoc and gcd_int.assoc by gcd.assoc. 

1256 

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

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

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

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

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

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

1263 
during instantiation. 

1264 

1265 
* New cancellation simprocs for boolean algebras to cancel complementary 

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

1267 
"top". INCOMPATIBILITY. 

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

1268 

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

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

62101  1273 

1274 
open_real_def \<leadsto> open_dist 

1275 
open_complex_def \<leadsto> open_dist 

1276 

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

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

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

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

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

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

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

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

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

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

1287 
INCOMPATIBILITY. 
62209  1288 
 Added multiset inclusion operator syntax: 
1289 
\<subset># 

1290 
\<subseteq># 

1291 
\<supset># 

1292 
\<supseteq># 

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

1293 
 "'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

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

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

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

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

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

1299 
INCOMPATIBILITY. 
60497  1300 
 Renamed conversions: 
60515  1301 
multiset_of ~> mset 
1302 
multiset_of_set ~> mset_set 

60497  1303 
set_of ~> set_mset 
1304 
INCOMPATIBILITY 

60398  1305 
 Renamed lemmas: 
1306 
mset_le_def ~> subseteq_mset_def 

1307 
mset_less_def ~> subset_mset_def 

60400  1308 
less_eq_multiset.rep_eq ~> subseteq_mset_def 
1309 
INCOMPATIBILITY 

1310 
 Removed lemmas generated by lift_definition: 

62235  1311 
less_eq_multiset.abs_eq, less_eq_multiset.rsp, 
1312 
less_eq_multiset.transfer, less_eq_multiset_def 

60400  1313 
INCOMPATIBILITY 
60006  1314 

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

1317 
* Library/Bourbaki_Witt_Fixpoint: Added formalisation of the 

1318 
BourbakiWitt fixpoint theorem for increasing functions in 

1319 
chaincomplete partial orders. 

1320 

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

1322 
Minor INCOMPATIBILITY, use 'function' instead. 

1323 

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

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

1326 

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

1329 
GCD. 

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

1330 

62084  1331 
* HOLImperative_HOL: obsolete theory Legacy_Mrec has been removed. 
1332 

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

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

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

1336 

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

1339 

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

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

1343 
Theorem of Algebra. Ported from HOL Light. 

1344 

1345 
* HOLMultivariate_Analysis: topological concepts such as connected 

62017  1346 
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

1347 

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

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

1352 
properties. 

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

1353 

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

1356 

1357 
* HOLData_Structures: new and growing session of standard data 

1358 
structures. 

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

1359 

60479  1360 

60793  1361 
*** ML *** 
1362 

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

1365 

1366 
profile_time (*CPU time*) 

1367 
profile_time_thread (*CPU time on this thread*) 

1368 
profile_allocations (*overall heap allocations*) 

1369 

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

1371 

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

1374 

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

1377 
breaks. 

1378 

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

1381 
called Thm.pretty_thm, Thm.string_of_thm etc. INCOMPATIBI 