author  wenzelm 
Tue, 19 Jul 2016 09:55:03 +0200  
changeset 63520  2803d2b8f85d 
parent 63513  9f8d06f23c09 
child 63524  4ec755485732 
child 63527  59eff6e56d81 
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 

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

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

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

105 

62904  106 

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

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

108 

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

111 

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

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

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

115 

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

118 
INCOMPATIBILITY. 

119 

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

122 
'definition', 'inductive', 'function'. 

123 

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

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

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

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

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

129 

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

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

63039  134 

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

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

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

137 

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

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

139 
typesetting. E.g. to produce proof holes in examples and documentation. 
62216  140 

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

143 

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

146 
definitions. 

147 

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

149 
method expression, e.g. 

150 

151 
(use facts in simp) 

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

153 

62216  154 

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

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

156 

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

159 
examples. 

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

160 

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

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

162 
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

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

164 

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

165 

62327  166 
*** HOL *** 
167 

63438  168 
* Theory Set_Interval.thy: substantial new theorems on indexed sums 
169 
and products. 

170 

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

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

174 

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

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

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

177 

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

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

180 

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

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

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

183 

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

186 

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

189 
lifting_syntax begin ... end". Minor INCOMPATIBILITY. 

190 

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

193 

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

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

195 
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

196 
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

197 
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

198 
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

199 
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

200 
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

201 

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

204 

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

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

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

207 

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

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

209 
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

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

211 

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

214 
list in random order. 

215 

63246  216 
* Probability/SPMF formalises discrete subprobability distributions. 
217 

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

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

219 
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

220 
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

221 
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

222 

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

225 
element of the carrier set exactly once. 

226 

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

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

228 
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

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

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

231 

62522  232 
* New abbreviations for negated existence (but not bounded existence): 
233 

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

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

236 

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

239 
eliminated altogether. 

240 

63116  241 
* Sledgehammer: 
242 
 Produce syntactically correct Vampire 4.0 problem files. 

243 

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

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

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

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

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

262 
pred_prod_apply ~> pred_prod_inject 

263 
INCOMPATIBILITY. 

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

264 
 The "size" plugin has been made compatible again with locales. 
62327  265 

63113  266 
* Removed obsolete theorem nat_less_cases. INCOMPATIBILITY, use 
267 
linorder_cases instead. 

268 

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

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

270 
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

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

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

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

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

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

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

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

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

279 

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

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

281 
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

282 
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

283 
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

284 
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

285 
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

286 
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

287 
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

288 
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

289 
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

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

291 

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

62396  294 

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

297 

298 
 Logical representation: 

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

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

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

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

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

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

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

314 
provided as char_of_nat, nat_of_char (as before). 

315 
 The auxiliary nibble type has been discontinued. 

316 

317 
INCOMPATIBILITY. 

318 

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

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

320 

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

321 
 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

322 
by default. 
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 
 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

325 
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

326 

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

327 
 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

328 
"count M a = n" from membership. 
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 
 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

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

332 

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

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

334 

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

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

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

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

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

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

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

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

342 
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

343 
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

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

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

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

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

348 
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

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

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

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

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

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

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

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

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

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

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

359 
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

360 
mset_remdups_le ~> mset_remdups_subset_eq 
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 

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

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

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

365 

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

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

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

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

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

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

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

372 

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

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

374 
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

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

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

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

378 

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

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

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

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

382 
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

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

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

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

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

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

388 
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

389 

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

390 
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

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

392 
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

393 
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

394 
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

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

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

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

398 
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

399 
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

400 
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

401 
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

402 
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

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

404 

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

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

406 
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

407 
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

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

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

410 

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

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

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

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

414 

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

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

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

417 

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

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

419 
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

420 

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

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

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

423 

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

426 

62345  427 
* Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY. 
428 

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

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

430 
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

431 
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

432 
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

433 

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

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

435 

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

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

437 
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

438 
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

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

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

441 

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

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

443 

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

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

445 
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

446 
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

447 

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

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

449 
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

450 
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

451 
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

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

453 

63155  454 
* Library/Sublist.thy: added function "prefixes" and renamed 
63173  455 
prefixeq > prefix 
456 
prefix > strict_prefix 

457 
suffixeq > suffix 

458 
suffix > strict_suffix 

459 
Added theory of longest common prefixes. 

63117  460 

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

463 
lcm_left_commute_nat ~> lcm.left_commute 

464 
lcm_left_commute_int ~> lcm.left_commute 

465 
gcd_left_commute_nat ~> gcd.left_commute 

466 
gcd_left_commute_int ~> gcd.left_commute 

467 
gcd_greatest_iff_nat ~> gcd_greatest_iff 

468 
gcd_greatest_iff_int ~> gcd_greatest_iff 

469 
coprime_dvd_mult_nat ~> coprime_dvd_mult 

470 
coprime_dvd_mult_int ~> coprime_dvd_mult 

471 
zpower_numeral_even ~> power_numeral_even 

472 
gcd_mult_cancel_nat ~> gcd_mult_cancel 

473 
gcd_mult_cancel_int ~> gcd_mult_cancel 

474 
div_gcd_coprime_nat ~> div_gcd_coprime 

475 
div_gcd_coprime_int ~> div_gcd_coprime 

476 
zpower_numeral_odd ~> power_numeral_odd 

477 
zero_less_int_conv ~> of_nat_0_less_iff 

478 
gcd_greatest_nat ~> gcd_greatest 

479 
gcd_greatest_int ~> gcd_greatest 

480 
coprime_mult_nat ~> coprime_mult 

481 
coprime_mult_int ~> coprime_mult 

482 
lcm_commute_nat ~> lcm.commute 

483 
lcm_commute_int ~> lcm.commute 

484 
int_less_0_conv ~> of_nat_less_0_iff 

485 
gcd_commute_nat ~> gcd.commute 

486 
gcd_commute_int ~> gcd.commute 

487 
Gcd_insert_nat ~> Gcd_insert 

488 
Gcd_insert_int ~> Gcd_insert 

489 
of_int_int_eq ~> of_int_of_nat_eq 

490 
lcm_least_nat ~> lcm_least 

491 
lcm_least_int ~> lcm_least 

492 
lcm_assoc_nat ~> lcm.assoc 

493 
lcm_assoc_int ~> lcm.assoc 

494 
int_le_0_conv ~> of_nat_le_0_iff 

495 
int_eq_0_conv ~> of_nat_eq_0_iff 

496 
Gcd_empty_nat ~> Gcd_empty 

497 
Gcd_empty_int ~> Gcd_empty 

498 
gcd_assoc_nat ~> gcd.assoc 

499 
gcd_assoc_int ~> gcd.assoc 

500 
zero_zle_int ~> of_nat_0_le_iff 

501 
lcm_dvd2_nat ~> dvd_lcm2 

502 
lcm_dvd2_int ~> dvd_lcm2 

503 
lcm_dvd1_nat ~> dvd_lcm1 

504 
lcm_dvd1_int ~> dvd_lcm1 

505 
gcd_zero_nat ~> gcd_eq_0_iff 

506 
gcd_zero_int ~> gcd_eq_0_iff 

507 
gcd_dvd2_nat ~> gcd_dvd2 

508 
gcd_dvd2_int ~> gcd_dvd2 

509 
gcd_dvd1_nat ~> gcd_dvd1 

510 
gcd_dvd1_int ~> gcd_dvd1 

511 
int_numeral ~> of_nat_numeral 

512 
lcm_ac_nat ~> ac_simps 

513 
lcm_ac_int ~> ac_simps 

514 
gcd_ac_nat ~> ac_simps 

515 
gcd_ac_int ~> ac_simps 

516 
abs_int_eq ~> abs_of_nat 

517 
zless_int ~> of_nat_less_iff 

518 
zdiff_int ~> of_nat_diff 

519 
zadd_int ~> of_nat_add 

520 
int_mult ~> of_nat_mult 

521 
int_Suc ~> of_nat_Suc 

522 
inj_int ~> inj_of_nat 

523 
int_1 ~> of_nat_1 

524 
int_0 ~> of_nat_0 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

547 
coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff 
62348  548 
realpow_minus_mult ~> power_minus_mult 
549 
realpow_Suc_le_self ~> power_Suc_le_self 

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

550 
dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest 
62347  551 
INCOMPATIBILITY. 
552 

62479  553 
* Session HOLNSA has been renamed to HOLNonstandard_Analysis. 
554 

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

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

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

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

558 
nn_integral :: 'a measure => ('a => ennreal) => ennreal 
62976  559 
INCOMPATIBILITY. 
62327  560 

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

561 

62498  562 
*** ML *** 
563 

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

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

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

568 
INCOMPATIBILITY. 

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

569 

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

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

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

577 

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

580 
requiring separate files. 

581 

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

583 
exposed to Isabelle/ML userspace. Potential INCOMPATIBILITY. 
62851  584 

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

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

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

587 

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

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

591 
debugger information requires consirable time and space: main 

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

593 

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

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

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

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

599 
balanced blocks of Local_Theory.open_target versus 

600 
Local_Theory.close_target instead. Rare INCOMPATIBILITY. 

601 

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

604 
INCOMPATIBILITY. 

605 

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

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

609 
File.full_path). Potential INCOMPATIBILITY. 

610 

63352  611 
* Binding.empty_atts supersedes Thm.empty_binding and 
612 
Attrib.empty_binding. Minor INCOMPATIBILITY. 

613 

62498  614 

62354  615 
*** System *** 
616 

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

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

618 
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

619 
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

620 
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

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

622 

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

625 
"isabelle_scala_script". 

626 

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

629 
Isabelle_Tool.Body. 

630 

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

633 
particular: 

634 

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

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

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

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

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

639 

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

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

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

643 

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

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

645 
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

646 
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

647 
return code 1. 
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 console" provides option r to help to 
cd266473b81b
isabelle_process is superseded by "isabelle process" tool;
wenzelm
parents:
62579
diff
changeset

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

651 

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

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

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

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

655 

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

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

657 
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

658 
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

659 
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

660 
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

661 
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

662 
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

663 

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

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

668 

62354  669 

670 

62031  671 
New in Isabelle2016 (February 2016) 
62016  672 
 
60138  673 

61337  674 
*** General *** 
675 

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

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

677 
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

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

679 
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

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

681 

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

684 

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

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

688 
has been removed (see below). 

689 

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

62017  692 

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

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

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

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

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

697 

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

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

699 
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

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

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

702 

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

705 
to update old sources. 

706 

61337  707 
* Toplevel theorem statements have been simplified as follows: 
708 

709 
theorems ~> lemmas 

710 
schematic_lemma ~> schematic_goal 

711 
schematic_theorem ~> schematic_goal 

712 
schematic_corollary ~> schematic_goal 

713 

714 
Commandline tool "isabelle update_theorems" updates theory sources 

715 
accordingly. 

716 

61338  717 
* Toplevel theorem statement 'proposition' is another alias for 
718 
'theorem'. 

719 

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

722 
deferred definitions require a surrounding 'overloading' block. 

723 

61337  724 

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

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

726 

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

730 
'SML_file_no_debug' control compilation of sources with or without 

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

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

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

734 
any effect on the running ML program. 

60984  735 

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

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

739 
update. 

61729  740 

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

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

743 
enable option "editor_output_state". 

61215  744 

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

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

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

749 
visibility. 

750 

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

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

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

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

755 
panel. 

756 

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

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

758 
state output, interactive queries) wrt. longrunning background tasks. 
62017  759 

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

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

762 
implicit: a popup will show up unconditionally. 

763 

764 
* Additional abbreviations for syntactic completion may be specified in 

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

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

767 

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

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

769 
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

770 
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

771 
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

772 

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

775 
the editor. 

776 

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

778 
instead of former C+e LEFT. 

779 

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

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

782 
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

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

784 

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

787 
singleinstance applications seen on common GUI desktops. 

788 

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

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

790 
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

791 
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

792 

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

795 

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

798 

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

799 

61405  800 
*** Document preparation *** 
801 

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

804 

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

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

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

808 

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

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

811 
follows: 

812 

813 
\<^item> itemize 

814 
\<^enum> enumerate 

815 
\<^descr> description 

816 

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

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

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

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

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

823 

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

826 
standard LaTeX macros of the same names. 

827 

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

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

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

832 
cartouche tokens seen in theory sources. 

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

833 

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

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

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

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

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

839 

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

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

843 

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

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

846 

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

848 

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

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

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

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

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

854 
documentation, with a hyperlink in the Prover IDE. 

855 

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

857 
entities of the Isar language. 

858 

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

61488  861 
print mode "HTML" loses its special meaning. 
61471  862 

61405  863 

60406  864 
*** Isar *** 
865 

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

868 
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

869 
example: 
60414  870 

871 
have result: "C x y" 

872 
if "A x" and "B y" 

873 
for x :: 'a and y :: 'a 

874 
<proof> 

875 

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

60414  878 
corresponds to a raw proof block like this: 
879 

880 
{ 

881 
fix x :: 'a and y :: 'a 

60449  882 
assume that: "A x" "B y" 
60414  883 
have "C x y" <proof> 
884 
} 

885 
note result = this 

60406  886 

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

887 
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

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

889 

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

61658  892 

893 
assume result: "C x y" 

894 
if "A x" and "B y" 

895 
for x :: 'a and y :: 'a 

896 

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

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

899 

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

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

902 
example: 

903 

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

905 

906 
is equivalent to: 

907 

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

909 

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

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

60595  914 

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

916 

917 
or: 

918 

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

920 

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

922 

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

924 

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

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

928 
of the local context elements yet. 

929 

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

932 

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

934 
then have something 

935 
proof cases 

936 
case a 

937 
then show ?thesis <proof> 

938 
next 

939 
case b 

940 
then show ?thesis <proof> 

941 
next 

942 
case c 

943 
then show ?thesis <proof> 

944 
qed 

945 

60565  946 
* Command 'case' allows fact name and attribute specification like this: 
947 

948 
case a: (c xs) 

949 
case a [attributes]: (c xs) 

950 

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

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

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

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

955 
and always put attributes in front. 

956 

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

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

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

959 
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

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

961 

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

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

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

966 

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

968 
supply [simp] = a 

969 
proof 

970 
show A by simp 

971 
next 

972 
show A by simp 

973 
qed 

974 

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

976 
proof body as well, abstracted over relevant parameters. 

977 

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

979 
parameter scope for of each clause. 

980 

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

982 
statements: result is abstracted over unknowns. 

983 

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

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

987 
manual. 

988 

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

991 

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

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

993 
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

994 
example: 
60617  995 

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

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

998 
proof goal_cases 
60622  999 
case (1 x) 
1000 
then show ?case using \<open>A x\<close> \<open>B x\<close> sorry 

1001 
next 

1002 
case (2 y z) 

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

1004 
qed 

1005 

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

1007 
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

1008 
proof goal_cases 
60617  1009 
case prems: 1 
1010 
then show ?case using prems sorry 

1011 
next 

1012 
case prems: 2 

1013 
then show ?case using prems sorry 

1014 
qed 

60578  1015 

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

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

60581  1020 

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

60551  1023 

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

1026 

60406  1027 

60331  1028 
*** Pure *** 
1029 

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

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

1031 
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

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

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

1034 

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

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

1037 

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

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

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

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

1045 
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

1046 

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

1047 
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

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

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

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

1051 

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

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

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

1054 
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

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

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

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

1058 

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

1061 

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

61675  1063 
'defines'. 
1064 

61895  1065 
* Command 'permanent_interpretation' has been discontinued. Use 
1066 
'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY. 

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

1067 

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

1070 

60331  1071 
* Configuration option rule_insts_schematic has been discontinued 
62017  1072 
(intermediate legacy feature in Isabelle2015). INCOMPATIBILITY. 
60331  1073 

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

1076 
exploited. 

60347  1077 

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

62205  1079 
operations behave more similar to abbreviations. Potential 
60347  1080 
INCOMPATIBILITY in exotic situations. 
1081 

1082 

60171  1083 
*** HOL *** 
1084 

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

1087 
global collection of overloaded constant / type definitions into 

1088 
account. Type definitions with open dependencies on overloaded 

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

1090 
provides extra robustness in theory construction. Rare INCOMPATIBILITY. 

1091 

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

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

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

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

1096 
Option.is_none_def. Occasional INCOMPATIBILITY in applications. 

1097 

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

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

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

1101 
simplify porting old theories: 

1102 

1103 
notation iff (infixr "<>" 25) 

1104 

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

1106 

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

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

1109 

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

1111 

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

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

1114 

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

1116 

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

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

1119 

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

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

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

1123 

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

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

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

1127 

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

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

1130 
INCOMPATIBILITY, use plain "::" instead. 

1131 

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

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

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

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

1136 

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

1138 
lowlevel facts of the internal construction only if the option 

62093  1139 
"inductive_internals" is enabled. This refers to the internal predicate 
62017  1140 
definition and its monotonicity result. Rare INCOMPATIBILITY. 
1141 

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

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

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

62093  1146 

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

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

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

1150 
INCOMPATIBILITY. 

62017  1151 

1152 
* Combinator to represent case distinction on products is named 

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

1154 
theorem aliasses have been retained. 

1155 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1179 
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

1180 
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

1181 
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

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

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

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

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

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

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

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

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

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

1191 
split_curry ~> case_prod_curry 
62017  1192 

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

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

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

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

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

1197 
strip_psplits ~> strip_ptupleabs 
62017  1198 

1199 
INCOMPATIBILITY. 

1200 

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

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

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

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

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

1206 

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

1207 
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

1208 
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

1209 
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

1210 
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

1211 
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

1212 
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

1213 
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

1214 
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

1215 
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

1216 
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

1217 
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

1218 
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

1219 
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

1220 
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

1221 
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

1222 
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

1223 
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

1224 
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

1225 
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

1226 
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

1227 
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

1228 
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

1229 
ceiling_real_of_int ceiling_of_int 
62017  1230 

1231 
INCOMPATIBILITY. 

61143  1232 

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

1235 

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

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

1237 

60171  1238 
* Discontinued simp_legacy_precond. Potential INCOMPATIBILITY. 
60138  1239 

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

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

1242 
 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

1243 
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

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

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

1249 

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

1251 
 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

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

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

1260 
 Always generate "case_transfer" theorem. 

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

61551  1263 
 Allow discriminators and selectors with the same name as the type 
1264 
being defined. 

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

60920  1266 

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

1269 
'transfer_prover_start' and 'transfer_prover_end'. 

61370  1270 

62118  1271 
* New diagnostic command print_record for displaying record definitions. 
1272 

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

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

1276 
simprocs binary_int_div and binary_int_mod 

1277 

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

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

1280 

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

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

1284 
fields with notions that are trivial there. 

1285 

1286 
* Class normalization_semidom specifies canonical representants for 

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

1288 
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

1289 

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

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

1293 
gcd_nat.assoc and gcd_int.assoc by gcd.assoc. 

1294 

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

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

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

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

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

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

1301 
during instantiation. 

1302 

1303 
* New cancellation simprocs for boolean algebras to cancel complementary 

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

1305 
"top". INCOMPATIBILITY. 

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

1306 

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

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

62101  1311 

1312 
open_real_def \<leadsto> open_dist 

1313 
open_complex_def \<leadsto> open_dist 

1314 

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

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

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

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

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

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

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

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

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

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

1325 
INCOMPATIBILITY. 
62209  1326 
 Added multiset inclusion operator syntax: 
1327 
\<subset># 

1328 
\<subseteq># 

1329 
\<supset># 

1330 
\<supseteq># 

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

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

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

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

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

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

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

1337 
INCOMPATIBILITY. 
60497  1338 
 Renamed conversions: 
60515  1339 
multiset_of ~> mset 
1340 
multiset_of_set ~> mset_set 

60497  1341 
set_of ~> set_mset 
1342 
INCOMPATIBILITY 

60398  1343 
 Renamed lemmas: 
1344 
mset_le_def ~> subseteq_mset_def 

1345 
mset_less_def ~> subset_mset_def 

60400  1346 
less_eq_multiset.rep_eq ~> subseteq_mset_def 
1347 
INCOMPATIBILITY 

1348 
 Removed lemmas generated by lift_definition: 

62235  1349 
less_eq_multiset.abs_eq, less_eq_multiset.rsp, 
1350 
less_eq_multiset.transfer, less_eq_multiset_def 

60400  1351 
INCOMPATIBILITY 
60006  1352 

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

1355 
* Library/Bourbaki_Witt_Fixpoint: Added formalisation of the 

1356 
BourbakiWitt fixpoint theorem for increasing functions in 

1357 
chaincomplete partial orders. 

1358 

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

1360 
Minor INCOMPATIBILITY, use 'function' instead. 

1361 

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

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

1364 

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

1367 
GCD. 

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

1368 

62084  1369 
* HOLImperative_HOL: obsolete theory Legacy_Mrec has been removed. 
1370 

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

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

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