author  nipkow 
Thu, 11 Aug 2016 07:36:58 +0200  
changeset 63656  fac9097dc772 
parent 63650  50cadecbe5bc 
child 63669  256fc20716f2 
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 

63650  52 
* Splitter in simp, auto and friends: 
53 
 The syntax "split add" has been discontinued, use plain "split". 

63656  54 
 For situations with many conditional or case expressions, 
63650  55 
there is an alternative splitting strategy that can be much faster. 
56 
It is selected by writing "split!" instead of "split". It applies 

57 
safe introduction and elimination rules after each split rule. 

58 
As a result the subgoal may be split into several subgoals. 

59 

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

62 

63532
b01154b74314
provide Pure.simp/simp_all, which only know about metaequality;
wenzelm
parents:
63528
diff
changeset

63 
* Pure provides basic versions of proof methods "simp" and "simp_all" 
b01154b74314
provide Pure.simp/simp_all, which only know about metaequality;
wenzelm
parents:
63528
diff
changeset

64 
that only know about metaequality (==). Potential INCOMPATIBILITY in 
b01154b74314
provide Pure.simp/simp_all, which only know about metaequality;
wenzelm
parents:
63528
diff
changeset

65 
theory imports that merge Pure with e.g. Main of Isabelle/HOL: the order 
b01154b74314
provide Pure.simp/simp_all, which only know about metaequality;
wenzelm
parents:
63528
diff
changeset

66 
is relevant to avoid confusion of Pure.simp vs. HOL.simp. 
b01154b74314
provide Pure.simp/simp_all, which only know about metaequality;
wenzelm
parents:
63528
diff
changeset

67 

63624
994d1a1105ef
more informative 'prf' and 'full_prf', based on HOL/Proofs/ex/XML_Data.thy;
wenzelm
parents:
63610
diff
changeset

68 
* Commands 'prf' and 'full_prf' are somewhat more informative (again): 
994d1a1105ef
more informative 'prf' and 'full_prf', based on HOL/Proofs/ex/XML_Data.thy;
wenzelm
parents:
63610
diff
changeset

69 
proof terms are reconstructed and cleaned from administrative thm nodes. 
994d1a1105ef
more informative 'prf' and 'full_prf', based on HOL/Proofs/ex/XML_Data.thy;
wenzelm
parents:
63610
diff
changeset

70 

62440  71 

62904  72 
*** Prover IDE  Isabelle/Scala/jEdit *** 
73 

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

76 

63610  77 
* Isabelle/ML and Standard ML files are presented in Sidekick with the 
78 
tree structure of section headings: this special comment format is 

79 
described in "implementation" chapter 0, e.g. (*** section ***). 

80 

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

83 

84 
src/Pure/ROOT0.ML 

85 
src/Pure/ROOT.ML 

86 
src/Pure/Pure.thy 

87 
src/Pure/ML_Bootstrap.thy 

88 

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

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

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

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

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

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

63307  95 
dependencies of the above files are only observed for batch build. 
62904  96 

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

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

98 

63461  99 
* Refined folding mode "isabelle" based on Isar syntax: 'next' and 'qed' 
63592
64db21931bcb
include 'begin' and 'end' structure in text folds;
wenzelm
parents:
63581
diff
changeset

100 
are treated as delimiters for fold structure; 'begin' and 'end' 
64db21931bcb
include 'begin' and 'end' structure in text folds;
wenzelm
parents:
63581
diff
changeset

101 
structure of theory specifications is treated as well. 
63461  102 

63608  103 
* Sidekick parser "isabellecontext" shows nesting of context blocks 
104 
according to 'begin' and 'end' structure. 

105 

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

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

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

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

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

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

111 
"jedit_indent_newline". 
63452  112 

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

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

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

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

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

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

118 

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

121 
systematic renaming. 

122 

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

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

124 
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

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

126 

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

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

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

129 

63528
0f39f59317c1
completion templates for commands involving "begin ... end" blocks;
wenzelm
parents:
63527
diff
changeset

130 
* Completion templates for commands involving "begin ... end" blocks, 
0f39f59317c1
completion templates for commands involving "begin ... end" blocks;
wenzelm
parents:
63527
diff
changeset

131 
e.g. 'context', 'notepad'. 
0f39f59317c1
completion templates for commands involving "begin ... end" blocks;
wenzelm
parents:
63527
diff
changeset

132 

63581  133 
* Additional abbreviations for syntactic completion may be specified 
63579  134 
within the theory header as 'abbrevs', in addition to global 
63581  135 
$ISABELLE_HOME/etc/abbrevs and $ISABELLE_HOME_USER/etc/abbrevs as 
136 
before. The theory syntax for 'keywords' has been simplified 

137 
accordingly: optional abbrevs need to go into the new 'abbrevs' section. 

63579  138 

62904  139 

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

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

141 

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

144 

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

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

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

148 

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

151 
INCOMPATIBILITY. 

152 

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

155 
'definition', 'inductive', 'function'. 

156 

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

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

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

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

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

162 

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

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

63039  167 

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

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

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

170 

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

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

172 
typesetting. E.g. to produce proof holes in examples and documentation. 
62216  173 

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

176 

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

179 
definitions. 

180 

63527  181 
* Proof method "use" allows to modify the main facts of a given method 
182 
expression, e.g. 

63259  183 

184 
(use facts in simp) 

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

186 

62216  187 

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

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

189 

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

192 
examples. 

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

193 

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

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

195 
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

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

197 

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

198 

62327  199 
*** HOL *** 
200 

63627  201 
* Renamed session HOLMultivariate_Analysis to HOLAnalysis. 
202 

203 
* Moved measure theory from HOLProbability to HOLAnalysis. When importing 

204 
HOLAnalysis some theorems need additional name spaces prefixes due to name 

205 
clashes. 

206 
INCOMPATIBILITY. 

207 

63635  208 
* Number_Theory: algebraic foundation for primes: Generalisation of 
209 
predicate "prime" and introduction of predicates "prime_elem", 

210 
"irreducible", a "prime_factorization" function, and the "factorial_ring" 

211 
typeclass with instance proofs for nat, int, poly. Some theorems now have 

212 
different names, most notably "prime_def" is now "prime_nat_iff". 

213 
INCOMPATIBILITY. 

63552  214 

215 
* Probability: Code generation and QuickCheck for Probability Mass 

216 
Functions. 

217 

63438  218 
* Theory Set_Interval.thy: substantial new theorems on indexed sums 
219 
and products. 

220 

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

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

224 

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

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

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

227 

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

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

230 

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

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

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

233 

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

236 

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

239 
lifting_syntax begin ... end". Minor INCOMPATIBILITY. 

240 

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

243 

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

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

245 
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

246 
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

247 
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

248 
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

249 
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

250 
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

251 

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

254 

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

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

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

257 

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

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

259 
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

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

261 

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

264 
list in random order. 

265 

63246  266 
* Probability/SPMF formalises discrete subprobability distributions. 
267 

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

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

269 
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

270 
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

271 
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

272 

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

275 
element of the carrier set exactly once. 

276 

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

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

278 
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

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

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

281 

62522  282 
* New abbreviations for negated existence (but not bounded existence): 
283 

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

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

286 

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

289 
eliminated altogether. 

290 

63116  291 
* Sledgehammer: 
292 
 Produce syntactically correct Vampire 4.0 problem files. 

293 

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

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

62842  298 
method. See 'isabelle doc corec'. 
62693  299 
 The predicator :: ('a => bool) => 'a F => bool is now a firstclass 
62332  300 
citizen in bounded natural functors 
62693  301 
 'primrec' now allows nested calls through the predicator in addition 
62327  302 
to the map function. 
62693  303 
 'bnf' automatically discharges reflexive proof obligations 
304 
 'bnf' outputs a slightly modified proof obligation expressing rel in 

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

62693  307 
 'bnf' outputs a new proof obligation expressing pred in terms of set 
62332  308 
(not giving a specification for pred makes this one reflexive) 
62693  309 
INCOMPATIBILITY: manual 'bnf' declarations may need adjustment 
62335  310 
 Renamed lemmas: 
311 
rel_prod_apply ~> rel_prod_inject 

312 
pred_prod_apply ~> pred_prod_inject 

313 
INCOMPATIBILITY. 

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

314 
 The "size" plugin has been made compatible again with locales. 
62327  315 

63113  316 
* Removed obsolete theorem nat_less_cases. INCOMPATIBILITY, use 
317 
linorder_cases instead. 

318 

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

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

320 
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

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

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

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

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

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

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

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

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

329 

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

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

331 
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

332 
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

333 
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

334 
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

335 
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

336 
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

337 
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

338 
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

339 
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

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

341 

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

62396  344 

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

347 

348 
 Logical representation: 

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

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

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

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

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

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

62597  360 
is parsable for every numeral expression n. 
62598  361 
* Noncanonical characters have no special syntax and are 
62597  362 
printed as their logical representation. 
363 
 Explicit conversions from and to the natural numbers are 

364 
provided as char_of_nat, nat_of_char (as before). 

365 
 The auxiliary nibble type has been discontinued. 

366 

367 
INCOMPATIBILITY. 

368 

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

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

370 

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

371 
 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

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

373 

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

374 
 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

375 
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

376 

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

377 
 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

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

379 

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

380 
 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

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

382 

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

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

384 

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

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

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

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

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

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

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

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

392 
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

393 
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

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

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

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

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

398 
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

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

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

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

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

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

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

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

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

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

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

409 
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

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

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

412 

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

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

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

415 

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

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

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

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

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

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

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

422 

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

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

424 
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

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

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

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

428 

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

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

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

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

432 
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

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

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

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

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

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

438 
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

439 

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

440 
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

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

442 
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

443 
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

444 
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

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

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

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

448 
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

449 
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

450 
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

451 
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

452 
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

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

454 

63524
4ec755485732
adding mset_map to the simp rules
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63513
diff
changeset

455 
* The lemma mset_map has now the attribute [simp]. 
4ec755485732
adding mset_map to the simp rules
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63513
diff
changeset

456 
INCOMPATIBILITY. 
4ec755485732
adding mset_map to the simp rules
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63513
diff
changeset

457 

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

458 
* Some theorems about multisets have been removed: 
f01d1e393f3f
more instantiations for multiset
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63524
diff
changeset

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

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

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

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

463 

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

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

465 
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

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

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

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

469 

63560
3e3097ac37d1
more instantiations for multiset
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63553
diff
changeset

470 
* There are some new simplification rules about multisets, the multiset 
3e3097ac37d1
more instantiations for multiset
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63553
diff
changeset

471 
ordering, and the subset ordering on multisets. 
3e3097ac37d1
more instantiations for multiset
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63553
diff
changeset

472 
INCOMPATIBILITY. 
3e3097ac37d1
more instantiations for multiset
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63553
diff
changeset

473 

3e3097ac37d1
more instantiations for multiset
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63553
diff
changeset

474 
* The subset ordering on multisets has now the interpretation 
3e3097ac37d1
more instantiations for multiset
fleury <Mathias.Fleury@mpiinf.mpg.de>
parents:
63553
diff
changeset

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

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

477 

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

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

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

480 

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

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

482 
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

483 

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

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

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

486 

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

489 

62345  490 
* Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY. 
491 

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

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

493 
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

494 
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

495 
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

496 

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

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

498 

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

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

500 
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

501 
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

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

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

504 

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

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

506 

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

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

508 
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

509 
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

510 

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

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

512 
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

513 
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

514 
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

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

516 

63155  517 
* Library/Sublist.thy: added function "prefixes" and renamed 
63173  518 
prefixeq > prefix 
519 
prefix > strict_prefix 

520 
suffixeq > suffix 

521 
suffix > strict_suffix 

522 
Added theory of longest common prefixes. 

63117  523 

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

526 
lcm_left_commute_nat ~> lcm.left_commute 

527 
lcm_left_commute_int ~> lcm.left_commute 

528 
gcd_left_commute_nat ~> gcd.left_commute 

529 
gcd_left_commute_int ~> gcd.left_commute 

530 
gcd_greatest_iff_nat ~> gcd_greatest_iff 

531 
gcd_greatest_iff_int ~> gcd_greatest_iff 

532 
coprime_dvd_mult_nat ~> coprime_dvd_mult 

533 
coprime_dvd_mult_int ~> coprime_dvd_mult 

534 
zpower_numeral_even ~> power_numeral_even 

535 
gcd_mult_cancel_nat ~> gcd_mult_cancel 

536 
gcd_mult_cancel_int ~> gcd_mult_cancel 

537 
div_gcd_coprime_nat ~> div_gcd_coprime 

538 
div_gcd_coprime_int ~> div_gcd_coprime 

539 
zpower_numeral_odd ~> power_numeral_odd 

540 
zero_less_int_conv ~> of_nat_0_less_iff 

541 
gcd_greatest_nat ~> gcd_greatest 

542 
gcd_greatest_int ~> gcd_greatest 

543 
coprime_mult_nat ~> coprime_mult 

544 
coprime_mult_int ~> coprime_mult 

545 
lcm_commute_nat ~> lcm.commute 

546 
lcm_commute_int ~> lcm.commute 

547 
int_less_0_conv ~> of_nat_less_0_iff 

548 
gcd_commute_nat ~> gcd.commute 

549 
gcd_commute_int ~> gcd.commute 

550 
Gcd_insert_nat ~> Gcd_insert 

551 
Gcd_insert_int ~> Gcd_insert 

552 
of_int_int_eq ~> of_int_of_nat_eq 

553 
lcm_least_nat ~> lcm_least 

554 
lcm_least_int ~> lcm_least 

555 
lcm_assoc_nat ~> lcm.assoc 

556 
lcm_assoc_int ~> lcm.assoc 

557 
int_le_0_conv ~> of_nat_le_0_iff 

558 
int_eq_0_conv ~> of_nat_eq_0_iff 

559 
Gcd_empty_nat ~> Gcd_empty 

560 
Gcd_empty_int ~> Gcd_empty 

561 
gcd_assoc_nat ~> gcd.assoc 

562 
gcd_assoc_int ~> gcd.assoc 

563 
zero_zle_int ~> of_nat_0_le_iff 

564 
lcm_dvd2_nat ~> dvd_lcm2 

565 
lcm_dvd2_int ~> dvd_lcm2 

566 
lcm_dvd1_nat ~> dvd_lcm1 

567 
lcm_dvd1_int ~> dvd_lcm1 

568 
gcd_zero_nat ~> gcd_eq_0_iff 

569 
gcd_zero_int ~> gcd_eq_0_iff 

570 
gcd_dvd2_nat ~> gcd_dvd2 

571 
gcd_dvd2_int ~> gcd_dvd2 

572 
gcd_dvd1_nat ~> gcd_dvd1 

573 
gcd_dvd1_int ~> gcd_dvd1 

574 
int_numeral ~> of_nat_numeral 

575 
lcm_ac_nat ~> ac_simps 

576 
lcm_ac_int ~> ac_simps 

577 
gcd_ac_nat ~> ac_simps 

578 
gcd_ac_int ~> ac_simps 

579 
abs_int_eq ~> abs_of_nat 

580 
zless_int ~> of_nat_less_iff 

581 
zdiff_int ~> of_nat_diff 

582 
zadd_int ~> of_nat_add 

583 
int_mult ~> of_nat_mult 

584 
int_Suc ~> of_nat_Suc 

585 
inj_int ~> inj_of_nat 

586 
int_1 ~> of_nat_1 

587 
int_0 ~> of_nat_0 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

610 
coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff 
62348  611 
realpow_minus_mult ~> power_minus_mult 
612 
realpow_Suc_le_self ~> power_Suc_le_self 

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

613 
dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest 
62347  614 
INCOMPATIBILITY. 
615 

62479  616 
* Session HOLNSA has been renamed to HOLNonstandard_Analysis. 
617 

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

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

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

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

621 
nn_integral :: 'a measure => ('a => ennreal) => ennreal 
62976  622 
INCOMPATIBILITY. 
62327  623 

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

624 

62498  625 
*** ML *** 
626 

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

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

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

631 
INCOMPATIBILITY. 

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

632 

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

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

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

640 

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

643 
requiring separate files. 

644 

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

646 
exposed to Isabelle/ML userspace. Potential INCOMPATIBILITY. 
62851  647 

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

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

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

650 

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

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

654 
debugger information requires consirable time and space: main 

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

656 

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

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

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

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

662 
balanced blocks of Local_Theory.open_target versus 

663 
Local_Theory.close_target instead. Rare INCOMPATIBILITY. 

664 

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

667 
INCOMPATIBILITY. 

668 

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

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

672 
File.full_path). Potential INCOMPATIBILITY. 

673 

63352  674 
* Binding.empty_atts supersedes Thm.empty_binding and 
675 
Attrib.empty_binding. Minor INCOMPATIBILITY. 

676 

62498  677 

62354  678 
*** System *** 
679 

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

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

681 
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

682 
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

683 
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

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

685 

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

688 
"isabelle_scala_script". 

689 

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

692 
Isabelle_Tool.Body. 

693 

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

696 
particular: 

697 

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

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

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

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

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

702 

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

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

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

706 

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

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

708 
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

709 
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

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

711 

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

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

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

714 

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

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

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

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

718 

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

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

720 
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

721 
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

722 
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

723 
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

724 
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

725 
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

726 

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

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

731 

62354  732 

733 

62031  734 
New in Isabelle2016 (February 2016) 
62016  735 
 
60138  736 

61337  737 
*** General *** 
738 

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

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

740 
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

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

742 
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

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

744 

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

747 

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

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

751 
has been removed (see below). 

752 

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

62017  755 

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

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

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

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

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

760 

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

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

762 
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

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

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

765 

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

768 
to update old sources. 

769 

61337  770 
* Toplevel theorem statements have been simplified as follows: 
771 

772 
theorems ~> lemmas 

773 
schematic_lemma ~> schematic_goal 

774 
schematic_theorem ~> schematic_goal 

775 
schematic_corollary ~> schematic_goal 

776 

777 
Commandline tool "isabelle update_theorems" updates theory sources 

778 
accordingly. 

779 

61338  780 
* Toplevel theorem statement 'proposition' is another alias for 
781 
'theorem'. 

782 

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

785 
deferred definitions require a surrounding 'overloading' block. 

786 

61337  787 

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

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

789 

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

793 
'SML_file_no_debug' control compilation of sources with or without 

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

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

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

797 
any effect on the running ML program. 

60984  798 

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

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

802 
update. 

61729  803 

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

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

806 
enable option "editor_output_state". 

61215  807 

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

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

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

812 
visibility. 

813 

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

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

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

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

818 
panel. 

819 

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

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

821 
state output, interactive queries) wrt. longrunning background tasks. 
62017  822 

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

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

825 
implicit: a popup will show up unconditionally. 

826 

827 
* Additional abbreviations for syntactic completion may be specified in 

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

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

830 

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

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

832 
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

833 
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

834 
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

835 

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

838 
the editor. 

839 

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

841 
instead of former C+e LEFT. 

842 

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

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

845 
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

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

847 

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

850 
singleinstance applications seen on common GUI desktops. 

851 

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

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

853 
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

854 
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

855 

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

858 

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

861 

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

862 

61405  863 
*** Document preparation *** 
864 

63553
4a72b37ac4b8
text antiquotation for locales (similar to classes)
haftmann
parents:
63552
diff
changeset

865 
* Text and ML antiquotation @{locale} for locales, similar to existing 
4a72b37ac4b8
text antiquotation for locales (similar to classes)
haftmann
parents:
63552
diff
changeset

866 
antiquotations for classes. 
4a72b37ac4b8
text antiquotation for locales (similar to classes)
haftmann
parents:
63552
diff
changeset

867 

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

870 

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

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

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

874 

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

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

877 
follows: 

878 

879 
\<^item> itemize 

880 
\<^enum> enumerate 

881 
\<^descr> description 

882 

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

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

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

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

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

889 

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

892 
standard LaTeX macros of the same names. 

893 

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

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

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

898 
cartouche tokens seen in theory sources. 

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

899 

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

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

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

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

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

905 

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

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

909 

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

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

912 

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

914 

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

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

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

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

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

920 
documentation, with a hyperlink in the Prover IDE. 

921 

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

923 
entities of the Isar language. 

924 

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

61488  927 
print mode "HTML" loses its special meaning. 
61471  928 

61405  929 

60406  930 
*** Isar *** 
931 

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

934 
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

935 
example: 
60414  936 

937 
have result: "C x y" 

938 
if "A x" and "B y" 

939 
for x :: 'a and y :: 'a 

940 
<proof> 

941 

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

60414  944 
corresponds to a raw proof block like this: 
945 

946 
{ 

947 
fix x :: 'a and y :: 'a 

60449  948 
assume that: "A x" "B y" 
60414  949 
have "C x y" <proof> 
950 
} 

951 
note result = this 

60406  952 

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

953 
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

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

955 

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

61658  958 

959 
assume result: "C x y" 

960 
if "A x" and "B y" 

961 
for x :: 'a and y :: 'a 

962 

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

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

965 

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

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

968 
example: 

969 

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

971 

972 
is equivalent to: 

973 

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

975 

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

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

60595  980 

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

982 

983 
or: 

984 

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

986 

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

988 

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

990 

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

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

994 
of the local context elements yet. 

995 

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

998 

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

1000 
then have something 

1001 
proof cases 

1002 
case a 

1003 
then show ?thesis <proof> 

1004 
next 

1005 
case b 

1006 
then show ?thesis <proof> 

1007 
next 

1008 
case c 

1009 
then show ?thesis <proof> 

1010 
qed 

1011 

60565  1012 
* Command 'case' allows fact name and attribute specification like this: 
1013 

1014 
case a: (c xs) 

1015 
case a [attributes]: (c xs) 

1016 

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

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

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

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

1021 
and always put attributes in front. 

1022 

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

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

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

1025 
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

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

1027 

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

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

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

1032 

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

1034 
supply [simp] = a 

1035 
proof 

1036 
show A by simp 

1037 
next 

1038 
show A by simp 

1039 
qed 

1040 

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

1042 
proof body as well, abstracted over relevant parameters. 

1043 

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

1045 
parameter scope for of each clause. 

1046 

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

1048 
statements: result is abstracted over unknowns. 

1049 

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

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

1053 
manual. 

1054 

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

1057 

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

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

1059 
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

1060 
example: 
60617  1061 

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

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

1064 
proof goal_cases 
60622  1065 
case (1 x) 
1066 
then show ?case using \<open>A x\<close> \<open>B x\<close> sorry 

1067 
next 

1068 
case (2 y z) 

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

1070 
qed 

1071 

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

1073 
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

1074 
proof goal_cases 
60617  1075 
case prems: 1 
1076 
then show ?case using prems sorry 

1077 
next 

1078 
case prems: 2 

1079 
then show ?case using prems sorry 

1080 
qed 

60578  1081 

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

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

60581  1086 

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

60551  1089 

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

1092 

60406  1093 

60331  1094 
*** Pure *** 
1095 

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

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

1097 
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

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

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

1100 

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

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

1103 

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

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

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

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

1111 
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

1112 

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

1113 
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

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

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

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

1117 

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

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

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

1120 
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

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

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

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

1124 

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

1127 

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

61675  1129 
'defines'. 
1130 

61895  1131 
* Command 'permanent_interpretation' has been discontinued. Use 
1132 
'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY. 

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

1133 

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

1136 

60331  1137 
* Configuration option rule_insts_schematic has been discontinued 
62017  1138 
(intermediate legacy feature in Isabelle2015). INCOMPATIBILITY. 
60331  1139 

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

1142 
exploited. 

60347  1143 

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

62205  1145 
operations behave more similar to abbreviations. Potential 
60347  1146 
INCOMPATIBILITY in exotic situations. 
1147 

1148 

60171  1149 
*** HOL *** 
1150 

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

1153 
global collection of overloaded constant / type definitions into 

1154 
account. Type definitions with open dependencies on overloaded 

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

1156 
provides extra robustness in theory construction. Rare INCOMPATIBILITY. 

1157 

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

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

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

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

1162 
Option.is_none_def. Occasional INCOMPATIBILITY in applications. 

1163 

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

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

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

1167 
simplify porting old theories: 

1168 

1169 
notation iff (infixr "<>" 25) 

1170 

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

1172 

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

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

1175 

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

1177 

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

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

1180 

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

1182 

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

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

1185 

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

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

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

1189 

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

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

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

1193 

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

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

1196 
INCOMPATIBILITY, use plain "::" instead. 

1197 

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

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

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

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

1202 

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

1204 
lowlevel facts of the internal construction only if the option 

62093  1205 
"inductive_internals" is enabled. This refers to the internal predicate 
62017  1206 
definition and its monotonicity result. Rare INCOMPATIBILITY. 
1207 

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

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

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

62093  1212 

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

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

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

1216 
INCOMPATIBILITY. 

62017  1217 

1218 
* Combinator to represent case distinction on products is named 

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

1220 
theorem aliasses have been retained. 

1221 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1245 
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

1246 
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

1247 
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

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

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

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

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

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

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

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

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

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

1257 
split_curry ~> case_prod_curry 
62017  1258 

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

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

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

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

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

1263 
strip_psplits ~> strip_ptupleabs 
62017  1264 

1265 
INCOMPATIBILITY. 

1266 

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

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

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

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

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

1272 

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

1273 
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

1274 
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

1275 
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

1276 
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

1277 
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

1278 
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

1279 
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

1280 
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

1281 
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

1282 
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

1283 
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

1284 
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

1285 
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

1286 
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

1287 
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

1288 
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

1289 
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

1290 
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

1291 
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

1292 
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

1293 
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

1294 
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

1295 
ceiling_real_of_int ceiling_of_int 
62017  1296 

1297 
INCOMPATIBILITY. 

61143  1298 

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

1301 

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

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

1303 

60171  1304 
* Discontinued simp_legacy_precond. Potential INCOMPATIBILITY. 
60138  1305 

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

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

1308 
 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

1309 
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

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

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

1315 

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

1317 
 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

1318 
 Fixed soundness bug in "destroy_constrs" optimization. 
62080  1319 
 Fixed soundness bug in translation of "rat" type. 
60310  1320 
 Removed "check_potential" and "check_genuine" options. 
61317  1321 
 Eliminated obsolete "blocking" option. 
60310  1322 

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

1326 
 Always generate "case_transfer" theorem. 

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

61551  1329 
 Allow discriminators and selectors with the same name as the type 
1330 
being defined. 

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

60920  1332 

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

1335 
'transfer_prover_start' and 'transfer_prover_end'. 

61370  1336 

62118  1337 
* New diagnostic command print_record for displaying record definitions. 
1338 

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

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

1342 
simprocs binary_int_div and binary_int_mod 

1343 

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

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

1346 

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

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

1350 
fields with notions that are trivial there. 

1351 

1352 
* Class normalization_semidom specifies canonical representants for 

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

1354 
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

1355 

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

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

1359 
gcd_nat.assoc and gcd_int.assoc by gcd.assoc. 

1360 

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

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

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

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

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

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

1367 
during instantiation. 

1368 

1369 
* New cancellation simprocs for boolean algebras to cancel complementary 

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

1371 
"top". INCOMPATIBILITY. 

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

1372 

62101 