author  wenzelm 
Wed, 13 Jul 2016 15:19:16 +0200  
changeset 63474  f66e3c3b0fb1 
parent 63463  b6a1047bc164 
child 63513  9f8d06f23c09 
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 

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

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

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

84 
command keywords and some command substructure. Action 
63455
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 

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

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

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

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

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

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

94 

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

97 
systematic renaming. 

98 

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

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

100 
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

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

102 

62904  103 

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

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

105 

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

108 

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

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

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

112 

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

115 
INCOMPATIBILITY. 

116 

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

119 
'definition', 'inductive', 'function'. 

120 

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

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

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

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

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

126 

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

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

63039  131 

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

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

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

134 

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

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

136 
typesetting. E.g. to produce proof holes in examples and documentation. 
62216  137 

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

140 

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

143 
definitions. 

144 

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

146 
method expression, e.g. 

147 

148 
(use facts in simp) 

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

150 

62216  151 

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

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

153 

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

156 
examples. 

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

157 

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

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

159 
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

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

161 

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

162 

62327  163 
*** HOL *** 
164 

63438  165 
* Theory Set_Interval.thy: substantial new theorems on indexed sums 
166 
and products. 

167 

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

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

171 

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

172 
* "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

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

174 

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

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

177 

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

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

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

180 

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

183 

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

186 
lifting_syntax begin ... end". Minor INCOMPATIBILITY. 

187 

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

190 

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

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

192 
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

193 
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

194 
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

195 
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

196 
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

197 
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

198 

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

201 

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

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

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

204 

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

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

206 
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

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

208 

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

211 
list in random order. 

212 

63246  213 
* Probability/SPMF formalises discrete subprobability distributions. 
214 

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

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

216 
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

217 
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

218 
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

219 

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

222 
element of the carrier set exactly once. 

223 

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

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

225 
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

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

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

228 

62522  229 
* New abbreviations for negated existence (but not bounded existence): 
230 

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

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

233 

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

236 
eliminated altogether. 

237 

63116  238 
* Sledgehammer: 
239 
 Produce syntactically correct Vampire 4.0 problem files. 

240 

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

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

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

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

62693  254 
 'bnf' outputs a new proof obligation expressing pred in terms of set 
62332  255 
(not giving a specification for pred makes this one reflexive) 
62693  256 
INCOMPATIBILITY: manual 'bnf' declarations may need adjustment 
62335  257 
 Renamed lemmas: 
258 
rel_prod_apply ~> rel_prod_inject 

259 
pred_prod_apply ~> pred_prod_inject 

260 
INCOMPATIBILITY. 

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

261 
 The "size" plugin has been made compatible again with locales. 
62327  262 

63113  263 
* Removed obsolete theorem nat_less_cases. INCOMPATIBILITY, use 
264 
linorder_cases instead. 

265 

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

266 
* Some theorems about groups and orders have been generalised from 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

267 
groups to semigroups that are also monoids: 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

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

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

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

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

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

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

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

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

276 

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

277 
* Some simplifications theorems about rings have been removed, since 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

278 
superseeded by a more general version: 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

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

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

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

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

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

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

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

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

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

288 

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

62396  291 

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

294 

295 
 Logical representation: 

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

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

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

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

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

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

62597  307 
is parsable for every numeral expression n. 
62598  308 
* Noncanonical characters have no special syntax and are 
62597  309 
printed as their logical representation. 
310 
 Explicit conversions from and to the natural numbers are 

311 
provided as char_of_nat, nat_of_char (as before). 

312 
 The auxiliary nibble type has been discontinued. 

313 

314 
INCOMPATIBILITY. 

315 

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

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

317 

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

318 
 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

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

320 

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

321 
 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

322 
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

323 

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

324 
 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

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

326 

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

327 
 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

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

329 

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

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

331 

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

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

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

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

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

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

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

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

339 
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

340 
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

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

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

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

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

345 
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

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

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

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

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

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

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

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

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

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

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

356 
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

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

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

359 

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

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

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

362 

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

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

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

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

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

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

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

369 

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

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

371 
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

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

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

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

375 

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

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

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

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

379 
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

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

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

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

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

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

385 
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

386 

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

387 
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

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

389 
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

390 
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

391 
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

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

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

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

395 
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

396 
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

397 
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

398 
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

399 
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

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

401 

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

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

403 
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

404 
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

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

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

407 

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

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

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

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

411 

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

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

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

414 

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

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

416 
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

417 

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

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

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

420 

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

423 

62345  424 
* Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY. 
425 

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

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

427 
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

428 
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

429 
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

430 

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

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

432 

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

433 
* Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

434 
instantiating linordered_semiring_strict and ordered_ab_group_add, an explicit 
3365c8ec67bd
sharing simp rules between ordered monoids and rings
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63455
diff
changeset

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

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

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

438 

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

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

440 

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

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

442 
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

443 
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

444 

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

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

446 
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

447 
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

448 
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

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

450 

63155  451 
* Library/Sublist.thy: added function "prefixes" and renamed 
63173  452 
prefixeq > prefix 
453 
prefix > strict_prefix 

454 
suffixeq > suffix 

455 
suffix > strict_suffix 

456 
Added theory of longest common prefixes. 

63117  457 

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

460 
lcm_left_commute_nat ~> lcm.left_commute 

461 
lcm_left_commute_int ~> lcm.left_commute 

462 
gcd_left_commute_nat ~> gcd.left_commute 

463 
gcd_left_commute_int ~> gcd.left_commute 

464 
gcd_greatest_iff_nat ~> gcd_greatest_iff 

465 
gcd_greatest_iff_int ~> gcd_greatest_iff 

466 
coprime_dvd_mult_nat ~> coprime_dvd_mult 

467 
coprime_dvd_mult_int ~> coprime_dvd_mult 

468 
zpower_numeral_even ~> power_numeral_even 

469 
gcd_mult_cancel_nat ~> gcd_mult_cancel 

470 
gcd_mult_cancel_int ~> gcd_mult_cancel 

471 
div_gcd_coprime_nat ~> div_gcd_coprime 

472 
div_gcd_coprime_int ~> div_gcd_coprime 

473 
zpower_numeral_odd ~> power_numeral_odd 

474 
zero_less_int_conv ~> of_nat_0_less_iff 

475 
gcd_greatest_nat ~> gcd_greatest 

476 
gcd_greatest_int ~> gcd_greatest 

477 
coprime_mult_nat ~> coprime_mult 

478 
coprime_mult_int ~> coprime_mult 

479 
lcm_commute_nat ~> lcm.commute 

480 
lcm_commute_int ~> lcm.commute 

481 
int_less_0_conv ~> of_nat_less_0_iff 

482 
gcd_commute_nat ~> gcd.commute 

483 
gcd_commute_int ~> gcd.commute 

484 
Gcd_insert_nat ~> Gcd_insert 

485 
Gcd_insert_int ~> Gcd_insert 

486 
of_int_int_eq ~> of_int_of_nat_eq 

487 
lcm_least_nat ~> lcm_least 

488 
lcm_least_int ~> lcm_least 

489 
lcm_assoc_nat ~> lcm.assoc 

490 
lcm_assoc_int ~> lcm.assoc 

491 
int_le_0_conv ~> of_nat_le_0_iff 

492 
int_eq_0_conv ~> of_nat_eq_0_iff 

493 
Gcd_empty_nat ~> Gcd_empty 

494 
Gcd_empty_int ~> Gcd_empty 

495 
gcd_assoc_nat ~> gcd.assoc 

496 
gcd_assoc_int ~> gcd.assoc 

497 
zero_zle_int ~> of_nat_0_le_iff 

498 
lcm_dvd2_nat ~> dvd_lcm2 

499 
lcm_dvd2_int ~> dvd_lcm2 

500 
lcm_dvd1_nat ~> dvd_lcm1 

501 
lcm_dvd1_int ~> dvd_lcm1 

502 
gcd_zero_nat ~> gcd_eq_0_iff 

503 
gcd_zero_int ~> gcd_eq_0_iff 

504 
gcd_dvd2_nat ~> gcd_dvd2 

505 
gcd_dvd2_int ~> gcd_dvd2 

506 
gcd_dvd1_nat ~> gcd_dvd1 

507 
gcd_dvd1_int ~> gcd_dvd1 

508 
int_numeral ~> of_nat_numeral 

509 
lcm_ac_nat ~> ac_simps 

510 
lcm_ac_int ~> ac_simps 

511 
gcd_ac_nat ~> ac_simps 

512 
gcd_ac_int ~> ac_simps 

513 
abs_int_eq ~> abs_of_nat 

514 
zless_int ~> of_nat_less_iff 

515 
zdiff_int ~> of_nat_diff 

516 
zadd_int ~> of_nat_add 

517 
int_mult ~> of_nat_mult 

518 
int_Suc ~> of_nat_Suc 

519 
inj_int ~> inj_of_nat 

520 
int_1 ~> of_nat_1 

521 
int_0 ~> of_nat_0 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

544 
coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff 
62348  545 
realpow_minus_mult ~> power_minus_mult 
546 
realpow_Suc_le_self ~> power_Suc_le_self 

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

547 
dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest 
62347  548 
INCOMPATIBILITY. 
549 

62479  550 
* Session HOLNSA has been renamed to HOLNonstandard_Analysis. 
551 

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

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

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

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

555 
nn_integral :: 'a measure => ('a => ennreal) => ennreal 
62976  556 
INCOMPATIBILITY. 
62327  557 

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

558 

62498  559 
*** ML *** 
560 

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

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

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

565 
INCOMPATIBILITY. 

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

566 

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

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

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

574 

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

577 
requiring separate files. 

578 

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

580 
exposed to Isabelle/ML userspace. Potential INCOMPATIBILITY. 
62851  581 

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

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

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

584 

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

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

588 
debugger information requires consirable time and space: main 

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

590 

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

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

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

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

596 
balanced blocks of Local_Theory.open_target versus 

597 
Local_Theory.close_target instead. Rare INCOMPATIBILITY. 

598 

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

601 
INCOMPATIBILITY. 

602 

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

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

606 
File.full_path). Potential INCOMPATIBILITY. 

607 

63352  608 
* Binding.empty_atts supersedes Thm.empty_binding and 
609 
Attrib.empty_binding. Minor INCOMPATIBILITY. 

610 

62498  611 

62354  612 
*** System *** 
613 

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

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

615 
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

616 
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

617 
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

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

619 

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

622 
"isabelle_scala_script". 

623 

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

626 
Isabelle_Tool.Body. 

627 

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

630 
particular: 

631 

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

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

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

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

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

636 

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

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

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

640 

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

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

642 
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

643 
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

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

645 

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

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

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

648 

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

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

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

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

652 

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

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

654 
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

655 
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

656 
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

657 
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

658 
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

659 
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

660 

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

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

665 

62354  666 

667 

62031  668 
New in Isabelle2016 (February 2016) 
62016  669 
 
60138  670 

61337  671 
*** General *** 
672 

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

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

674 
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

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

676 
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

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

678 

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

681 

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

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

685 
has been removed (see below). 

686 

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

62017  689 

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

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

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

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

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

694 

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

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

696 
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

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

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

699 

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

702 
to update old sources. 

703 

61337  704 
* Toplevel theorem statements have been simplified as follows: 
705 

706 
theorems ~> lemmas 

707 
schematic_lemma ~> schematic_goal 

708 
schematic_theorem ~> schematic_goal 

709 
schematic_corollary ~> schematic_goal 

710 

711 
Commandline tool "isabelle update_theorems" updates theory sources 

712 
accordingly. 

713 

61338  714 
* Toplevel theorem statement 'proposition' is another alias for 
715 
'theorem'. 

716 

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

719 
deferred definitions require a surrounding 'overloading' block. 

720 

61337  721 

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

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

723 

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

727 
'SML_file_no_debug' control compilation of sources with or without 

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

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

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

731 
any effect on the running ML program. 

60984  732 

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

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

736 
update. 

61729  737 

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

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

740 
enable option "editor_output_state". 

61215  741 

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

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

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

746 
visibility. 

747 

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

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

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

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

752 
panel. 

753 

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

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

755 
state output, interactive queries) wrt. longrunning background tasks. 
62017  756 

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

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

759 
implicit: a popup will show up unconditionally. 

760 

761 
* Additional abbreviations for syntactic completion may be specified in 

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

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

764 

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

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

766 
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

767 
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

768 
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

769 

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

772 
the editor. 

773 

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

775 
instead of former C+e LEFT. 

776 

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

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

779 
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

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

781 

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

784 
singleinstance applications seen on common GUI desktops. 

785 

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

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

787 
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

788 
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

789 

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

792 

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

795 

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

796 

61405  797 
*** Document preparation *** 
798 

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

801 

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

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

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

805 

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

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

808 
follows: 

809 

810 
\<^item> itemize 

811 
\<^enum> enumerate 

812 
\<^descr> description 

813 

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

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

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

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

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

820 

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

823 
standard LaTeX macros of the same names. 

824 

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

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

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

829 
cartouche tokens seen in theory sources. 

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

830 

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

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

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

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

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

836 

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

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

840 

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

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

843 

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

845 

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

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

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

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

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

851 
documentation, with a hyperlink in the Prover IDE. 

852 

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

854 
entities of the Isar language. 

855 

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

61488  858 
print mode "HTML" loses its special meaning. 
61471  859 

61405  860 

60406  861 
*** Isar *** 
862 

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

865 
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

866 
example: 
60414  867 

868 
have result: "C x y" 

869 
if "A x" and "B y" 

870 
for x :: 'a and y :: 'a 

871 
<proof> 

872 

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

60414  875 
corresponds to a raw proof block like this: 
876 

877 
{ 

878 
fix x :: 'a and y :: 'a 

60449  879 
assume that: "A x" "B y" 
60414  880 
have "C x y" <proof> 
881 
} 

882 
note result = this 

60406  883 

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

884 
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

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

886 

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

61658  889 

890 
assume result: "C x y" 

891 
if "A x" and "B y" 

892 
for x :: 'a and y :: 'a 

893 

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

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

896 

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

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

899 
example: 

900 

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

902 

903 
is equivalent to: 

904 

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

906 

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

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

60595  911 

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

913 

914 
or: 

915 

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

917 

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

919 

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

921 

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

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

925 
of the local context elements yet. 

926 

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

929 

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

931 
then have something 

932 
proof cases 

933 
case a 

934 
then show ?thesis <proof> 

935 
next 

936 
case b 

937 
then show ?thesis <proof> 

938 
next 

939 
case c 

940 
then show ?thesis <proof> 

941 
qed 

942 

60565  943 
* Command 'case' allows fact name and attribute specification like this: 
944 

945 
case a: (c xs) 

946 
case a [attributes]: (c xs) 

947 

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

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

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

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

952 
and always put attributes in front. 

953 

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

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

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

956 
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

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

958 

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

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

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

963 

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

965 
supply [simp] = a 

966 
proof 

967 
show A by simp 

968 
next 

969 
show A by simp 

970 
qed 

971 

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

973 
proof body as well, abstracted over relevant parameters. 

974 

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

976 
parameter scope for of each clause. 

977 

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

979 
statements: result is abstracted over unknowns. 

980 

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

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

984 
manual. 

985 

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

988 

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

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

990 
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

991 
example: 
60617  992 

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

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

995 
proof goal_cases 
60622  996 
case (1 x) 
997 
then show ?case using \<open>A x\<close> \<open>B x\<close> sorry 

998 
next 

999 
case (2 y z) 

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

1001 
qed 

1002 

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

1004 
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

1005 
proof goal_cases 
60617  1006 
case prems: 1 
1007 
then show ?case using prems sorry 

1008 
next 

1009 
case prems: 2 

1010 
then show ?case using prems sorry 

1011 
qed 

60578  1012 

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

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

60581  1017 

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

60551  1020 

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

1023 

60406  1024 

60331  1025 
*** Pure *** 
1026 

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

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

1028 
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

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

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

1031 

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

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

1034 

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

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

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

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

1042 
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

1043 

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

1044 
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

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

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

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

1048 

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

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

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

1051 
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

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

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

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

1055 

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

1058 

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

61675  1060 
'defines'. 
1061 

61895  1062 
* Command 'permanent_interpretation' has been discontinued. Use 
1063 
'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY. 

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

1064 

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

1067 

60331  1068 
* Configuration option rule_insts_schematic has been discontinued 
62017  1069 
(intermediate legacy feature in Isabelle2015). INCOMPATIBILITY. 
60331  1070 

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

1073 
exploited. 

60347  1074 

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

62205  1076 
operations behave more similar to abbreviations. Potential 
60347  1077 
INCOMPATIBILITY in exotic situations. 
1078 

1079 

60171  1080 
*** HOL *** 
1081 

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

1084 
global collection of overloaded constant / type definitions into 

1085 
account. Type definitions with open dependencies on overloaded 

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

1087 
provides extra robustness in theory construction. Rare INCOMPATIBILITY. 

1088 

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

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

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

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

1093 
Option.is_none_def. Occasional INCOMPATIBILITY in applications. 

1094 

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

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

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

1098 
simplify porting old theories: 

1099 

1100 
notation iff (infixr "<>" 25) 

1101 

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

1103 

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

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

1106 

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

1108 

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

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

1111 

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

1113 

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

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

1116 

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

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

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

1120 

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

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

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

1124 

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

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

1127 
INCOMPATIBILITY, use plain "::" instead. 

1128 

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

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

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

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

1133 

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

1135 
lowlevel facts of the internal construction only if the option 

62093  1136 
"inductive_internals" is enabled. This refers to the internal predicate 
62017  1137 
definition and its monotonicity result. Rare INCOMPATIBILITY. 
1138 

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

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

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

62093  1143 

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

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

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

1147 
INCOMPATIBILITY. 

62017  1148 

1149 
* Combinator to represent case distinction on products is named 

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

1151 
theorem aliasses have been retained. 

1152 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1176 
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

1177 
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

1178 
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

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

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

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

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

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

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

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

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

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

1188 
split_curry ~> case_prod_curry 
62017  1189 

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

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

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

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

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

1194 
strip_psplits ~> strip_ptupleabs 
62017  1195 

1196 
INCOMPATIBILITY. 

1197 

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

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

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

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

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

1203 

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

1204 
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

1205 
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

1206 
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

1207 
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

1208 
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

1209 
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

1210 
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

1211 
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

1212 
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

1213 
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

1214 
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

1215 
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

1216 
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

1217 
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

1218 
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

1219 
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

1220 
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

1221 
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

1222 
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

1223 
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

1224 
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

1225 
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

1226 
ceiling_real_of_int ceiling_of_int 
62017  1227 

1228 
INCOMPATIBILITY. 

61143  1229 

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

1232 

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

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

1234 

60171  1235 
* Discontinued simp_legacy_precond. Potential INCOMPATIBILITY. 
60138  1236 

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

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

1239 
 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

1240 
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

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

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

1246 

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

1248 
 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

1249 
 Fixed soundness bug in "destroy_constrs" optimization. 
62080  1250 
 Fixed soundness bug in translation of "rat" type. 
60310  1251 
 Removed "check_potential" and "check_genuine" options. 
61317  1252 
 Eliminated obsolete "blocking" option. 
60310  1253 

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

1257 
 Always generate "case_transfer" theorem. 

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

61551  1260 
 Allow discriminators and selectors with the same name as the type 
1261 
being defined. 

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

60920  1263 

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

1266 
'transfer_prover_start' and 'transfer_prover_end'. 

61370  1267 

62118  1268 
* New diagnostic command print_record for displaying record definitions. 
1269 

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

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

1273 
simprocs binary_int_div and binary_int_mod 

1274 

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

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

1277 

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

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

1281 
fields with notions that are trivial there. 

1282 

1283 
* Class normalization_semidom specifies canonical representants for 

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

1285 
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

1286 

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

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

1290 
gcd_nat.assoc and gcd_int.assoc by gcd.assoc. 

1291 

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

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

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

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

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

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

1298 
during instantiation. 

1299 

1300 
* New cancellation simprocs for boolean algebras to cancel complementary 

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

1302 
"top". INCOMPATIBILITY. 

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

1303 

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

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

62101  1308 

1309 
open_real_def \<leadsto> open_dist 

1310 
open_complex_def \<leadsto> open_dist 

1311 

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

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

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

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

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

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

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

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

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

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

1322 
INCOMPATIBILITY. 
62209  1323 
 Added multiset inclusion operator syntax: 
1324 
\<subset># 

1325 
\<subseteq># 

1326 
\<supset># 

1327 
\<supseteq># 

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

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

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

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

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

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

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

1334 
INCOMPATIBILITY. 
60497  1335 
 Renamed conversions: 
60515  1336 
multiset_of ~> mset 
1337 
multiset_of_set ~> mset_set 

60497  1338 
set_of ~> set_mset 
1339 
INCOMPATIBILITY 

60398  1340 
 Renamed lemmas: 
1341 
mset_le_def ~> subseteq_mset_def 

1342 
mset_less_def ~> subset_mset_def 

60400  1343 
less_eq_multiset.rep_eq ~> subseteq_mset_def 
1344 
INCOMPATIBILITY 

1345 
 Removed lemmas generated by lift_definition: 

62235  1346 
less_eq_multiset.abs_eq, less_eq_multiset.rsp, 
1347 
less_eq_multiset.transfer, less_eq_multiset_def 

60400  1348 
INCOMPATIBILITY 
60006  1349 

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

1352 
* Library/Bourbaki_Witt_Fixpoint: Added formalisation of the 

1353 
BourbakiWitt fixpoint theorem for increasing functions in 

1354 
chaincomplete partial orders. 

1355 

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

1357 
Minor INCOMPATIBILITY, use 'function' instead. 

1358 

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

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

1361 

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

1364 
GCD. 

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

1365 

62084  1366 
* HOLImperative_HOL: obsolete theory Legacy_Mrec has been removed. 
1367 

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

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

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

1371 

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

167641f8b83a
proper NEWS for this release;
