author  wenzelm 
Tue, 02 Aug 2016 11:49:30 +0200  
changeset 63578  e8990d0e3965 
parent 63560  3e3097ac37d1 
child 63579  73939a9b70a3 
permissions  rwrr 
57491  1 
Isabelle NEWS  history of userrelevant changes 
2 
================================================= 

2553  3 

62114
a7cf464933f7
generate HTML version of NEWS, with proper symbol rendering;
wenzelm
parents:
62111
diff
changeset

4 
(Note: Isabelle/jEdit shows a treeview of the NEWS file in Sidekick.) 
60006  5 

60331  6 

62216  7 
New in this Isabelle version 
8 
 

9 

62440  10 
*** General *** 
11 

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

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

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

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

15 

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

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

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

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

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

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

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

22 

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

25 
discontinued. 

26 

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

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

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

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

62789  32 

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

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

37 

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

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

41 

42 
bundle foo 

43 
begin 

44 
declare a [simp] 

45 
declare b [intro] 

46 
end 

63272  47 

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

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

51 

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

54 

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

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

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

57 
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

58 
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

59 

62440  60 

62904  61 
*** Prover IDE  Isabelle/Scala/jEdit *** 
62 

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

65 

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

68 

69 
src/Pure/ROOT0.ML 

70 
src/Pure/ROOT.ML 

71 
src/Pure/Pure.thy 

72 
src/Pure/ML_Bootstrap.thy 

73 

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

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

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

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

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

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

63307  80 
dependencies of the above files are only observed for batch build. 
62904  81 

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

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

83 

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

86 

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

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

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

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

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

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

92 
"jedit_indent_newline". 
63452  93 

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

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

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

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

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

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

99 

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

102 
systematic renaming. 

103 

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

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

105 
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

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

107 

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

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

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

110 

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

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

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

113 

62904  114 

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

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

116 

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

119 

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

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

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

123 

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

126 
INCOMPATIBILITY. 

127 

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

130 
'definition', 'inductive', 'function'. 

131 

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

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

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

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

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

137 

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

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

63039  142 

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

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

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

145 

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

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

147 
typesetting. E.g. to produce proof holes in examples and documentation. 
62216  148 

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

151 

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

154 
definitions. 

155 

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

63259  158 

159 
(use facts in simp) 

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

161 

62216  162 

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

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

164 

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

167 
examples. 

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

168 

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

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

170 
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

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

172 

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

173 

62327  174 
*** HOL *** 
175 

63552  176 
* Number_Theory: algebraic foundation for primes: Introduction of 
177 
predicates "is_prime", "irreducible", a "prime_factorization" 

178 
function, the "factorial_ring" typeclass with instance proofs for 

179 
nat, int, poly. 

180 

181 
* Probability: Code generation and QuickCheck for Probability Mass 

182 
Functions. 

183 

63438  184 
* Theory Set_Interval.thy: substantial new theorems on indexed sums 
185 
and products. 

186 

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

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

190 

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

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

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

193 

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

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

196 

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

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

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

199 

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

202 

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

205 
lifting_syntax begin ... end". Minor INCOMPATIBILITY. 

206 

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

209 

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

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

211 
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

212 
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

213 
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

214 
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

215 
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

216 
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

217 

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

220 

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

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

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

223 

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

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

225 
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

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

227 

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

230 
list in random order. 

231 

63246  232 
* Probability/SPMF formalises discrete subprobability distributions. 
233 

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

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

235 
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

236 
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

237 
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

238 

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

241 
element of the carrier set exactly once. 

242 

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

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

244 
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

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

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

247 

62522  248 
* New abbreviations for negated existence (but not bounded existence): 
249 

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

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

252 

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

255 
eliminated altogether. 

256 

63116  257 
* Sledgehammer: 
258 
 Produce syntactically correct Vampire 4.0 problem files. 

259 

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

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

62842  264 
method. See 'isabelle doc corec'. 
62693  265 
 The predicator :: ('a => bool) => 'a F => bool is now a firstclass 
62332  266 
citizen in bounded natural functors 
62693  267 
 'primrec' now allows nested calls through the predicator in addition 
62327  268 
to the map function. 
62693  269 
 'bnf' automatically discharges reflexive proof obligations 
270 
 'bnf' outputs a slightly modified proof obligation expressing rel in 

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

62693  273 
 'bnf' outputs a new proof obligation expressing pred in terms of set 
62332  274 
(not giving a specification for pred makes this one reflexive) 
62693  275 
INCOMPATIBILITY: manual 'bnf' declarations may need adjustment 
62335  276 
 Renamed lemmas: 
277 
rel_prod_apply ~> rel_prod_inject 

278 
pred_prod_apply ~> pred_prod_inject 

279 
INCOMPATIBILITY. 

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

280 
 The "size" plugin has been made compatible again with locales. 
62327  281 

63113  282 
* Removed obsolete theorem nat_less_cases. INCOMPATIBILITY, use 
283 
linorder_cases instead. 

284 

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

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

286 
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

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

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

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

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

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

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

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

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

295 

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

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

297 
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

298 
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

299 
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

300 
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

301 
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

302 
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

303 
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

304 
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

305 
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

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

307 

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

62396  310 

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

313 

314 
 Logical representation: 

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

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

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

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

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

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

62597  326 
is parsable for every numeral expression n. 
62598  327 
* Noncanonical characters have no special syntax and are 
62597  328 
printed as their logical representation. 
329 
 Explicit conversions from and to the natural numbers are 

330 
provided as char_of_nat, nat_of_char (as before). 

331 
 The auxiliary nibble type has been discontinued. 

332 

333 
INCOMPATIBILITY. 

334 

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

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

336 

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

337 
 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

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

339 

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

340 
 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

341 
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

342 

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

343 
 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

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

345 

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

346 
 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

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

348 

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

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

350 

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

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

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

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

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

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

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

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

358 
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

359 
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

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

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

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

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

364 
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

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

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

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

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

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

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

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

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

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

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

375 
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

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

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

378 

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

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

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

381 

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

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

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

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

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

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

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

388 

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

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

390 
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

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

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

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

394 

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

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

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

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

398 
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

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

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

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

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

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

404 
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

405 

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

406 
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

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

408 
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

409 
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

410 
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

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

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

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

414 
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

415 
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

416 
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

417 
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

418 
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

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

420 

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

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

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

423 

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

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

425 
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

426 
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

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

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

429 

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

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

431 
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

432 
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

433 
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

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

435 

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

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

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

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

439 

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

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

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

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

443 

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

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

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

446 

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

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

448 
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

449 

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

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

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

452 

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

455 

62345  456 
* Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY. 
457 

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

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

459 
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

460 
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

461 
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

462 

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

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

464 

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

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

466 
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

467 
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

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

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

470 

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

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

472 

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

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

474 
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

475 
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

476 

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

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

478 
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

479 
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

480 
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

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

482 

63155  483 
* Library/Sublist.thy: added function "prefixes" and renamed 
63173  484 
prefixeq > prefix 
485 
prefix > strict_prefix 

486 
suffixeq > suffix 

487 
suffix > strict_suffix 

488 
Added theory of longest common prefixes. 

63117  489 

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

492 
lcm_left_commute_nat ~> lcm.left_commute 

493 
lcm_left_commute_int ~> lcm.left_commute 

494 
gcd_left_commute_nat ~> gcd.left_commute 

495 
gcd_left_commute_int ~> gcd.left_commute 

496 
gcd_greatest_iff_nat ~> gcd_greatest_iff 

497 
gcd_greatest_iff_int ~> gcd_greatest_iff 

498 
coprime_dvd_mult_nat ~> coprime_dvd_mult 

499 
coprime_dvd_mult_int ~> coprime_dvd_mult 

500 
zpower_numeral_even ~> power_numeral_even 

501 
gcd_mult_cancel_nat ~> gcd_mult_cancel 

502 
gcd_mult_cancel_int ~> gcd_mult_cancel 

503 
div_gcd_coprime_nat ~> div_gcd_coprime 

504 
div_gcd_coprime_int ~> div_gcd_coprime 

505 
zpower_numeral_odd ~> power_numeral_odd 

506 
zero_less_int_conv ~> of_nat_0_less_iff 

507 
gcd_greatest_nat ~> gcd_greatest 

508 
gcd_greatest_int ~> gcd_greatest 

509 
coprime_mult_nat ~> coprime_mult 

510 
coprime_mult_int ~> coprime_mult 

511 
lcm_commute_nat ~> lcm.commute 

512 
lcm_commute_int ~> lcm.commute 

513 
int_less_0_conv ~> of_nat_less_0_iff 

514 
gcd_commute_nat ~> gcd.commute 

515 
gcd_commute_int ~> gcd.commute 

516 
Gcd_insert_nat ~> Gcd_insert 

517 
Gcd_insert_int ~> Gcd_insert 

518 
of_int_int_eq ~> of_int_of_nat_eq 

519 
lcm_least_nat ~> lcm_least 

520 
lcm_least_int ~> lcm_least 

521 
lcm_assoc_nat ~> lcm.assoc 

522 
lcm_assoc_int ~> lcm.assoc 

523 
int_le_0_conv ~> of_nat_le_0_iff 

524 
int_eq_0_conv ~> of_nat_eq_0_iff 

525 
Gcd_empty_nat ~> Gcd_empty 

526 
Gcd_empty_int ~> Gcd_empty 

527 
gcd_assoc_nat ~> gcd.assoc 

528 
gcd_assoc_int ~> gcd.assoc 

529 
zero_zle_int ~> of_nat_0_le_iff 

530 
lcm_dvd2_nat ~> dvd_lcm2 

531 
lcm_dvd2_int ~> dvd_lcm2 

532 
lcm_dvd1_nat ~> dvd_lcm1 

533 
lcm_dvd1_int ~> dvd_lcm1 

534 
gcd_zero_nat ~> gcd_eq_0_iff 

535 
gcd_zero_int ~> gcd_eq_0_iff 

536 
gcd_dvd2_nat ~> gcd_dvd2 

537 
gcd_dvd2_int ~> gcd_dvd2 

538 
gcd_dvd1_nat ~> gcd_dvd1 

539 
gcd_dvd1_int ~> gcd_dvd1 

540 
int_numeral ~> of_nat_numeral 

541 
lcm_ac_nat ~> ac_simps 

542 
lcm_ac_int ~> ac_simps 

543 
gcd_ac_nat ~> ac_simps 

544 
gcd_ac_int ~> ac_simps 

545 
abs_int_eq ~> abs_of_nat 

546 
zless_int ~> of_nat_less_iff 

547 
zdiff_int ~> of_nat_diff 

548 
zadd_int ~> of_nat_add 

549 
int_mult ~> of_nat_mult 

550 
int_Suc ~> of_nat_Suc 

551 
inj_int ~> inj_of_nat 

552 
int_1 ~> of_nat_1 

553 
int_0 ~> of_nat_0 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

576 
coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff 
62348  577 
realpow_minus_mult ~> power_minus_mult 
578 
realpow_Suc_le_self ~> power_Suc_le_self 

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

579 
dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest 
62347  580 
INCOMPATIBILITY. 
581 

62479  582 
* Session HOLNSA has been renamed to HOLNonstandard_Analysis. 
583 

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

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

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

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

587 
nn_integral :: 'a measure => ('a => ennreal) => ennreal 
62976  588 
INCOMPATIBILITY. 
62327  589 

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

590 

62498  591 
*** ML *** 
592 

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

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

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

597 
INCOMPATIBILITY. 

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

598 

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

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

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

606 

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

609 
requiring separate files. 

610 

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

612 
exposed to Isabelle/ML userspace. Potential INCOMPATIBILITY. 
62851  613 

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

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

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

616 

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

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

620 
debugger information requires consirable time and space: main 

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

622 

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

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

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

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

628 
balanced blocks of Local_Theory.open_target versus 

629 
Local_Theory.close_target instead. Rare INCOMPATIBILITY. 

630 

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

633 
INCOMPATIBILITY. 

634 

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

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

638 
File.full_path). Potential INCOMPATIBILITY. 

639 

63352  640 
* Binding.empty_atts supersedes Thm.empty_binding and 
641 
Attrib.empty_binding. Minor INCOMPATIBILITY. 

642 

62498  643 

62354  644 
*** System *** 
645 

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

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

647 
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

648 
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

649 
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

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

651 

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

654 
"isabelle_scala_script". 

655 

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

658 
Isabelle_Tool.Body. 

659 

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

662 
particular: 

663 

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

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

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

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

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

668 

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

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

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

672 

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

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

674 
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

675 
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

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

677 

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

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

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

680 

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

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

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

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

684 

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

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

686 
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

687 
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

688 
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

689 
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

690 
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

691 
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

692 

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

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

697 

62354  698 

699 

62031  700 
New in Isabelle2016 (February 2016) 
62016  701 
 
60138  702 

61337  703 
*** General *** 
704 

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

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

706 
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

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

708 
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

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

710 

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

713 

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

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

717 
has been removed (see below). 

718 

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

62017  721 

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

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

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

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

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

726 

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

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

728 
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

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

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

731 

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

734 
to update old sources. 

735 

61337  736 
* Toplevel theorem statements have been simplified as follows: 
737 

738 
theorems ~> lemmas 

739 
schematic_lemma ~> schematic_goal 

740 
schematic_theorem ~> schematic_goal 

741 
schematic_corollary ~> schematic_goal 

742 

743 
Commandline tool "isabelle update_theorems" updates theory sources 

744 
accordingly. 

745 

61338  746 
* Toplevel theorem statement 'proposition' is another alias for 
747 
'theorem'. 

748 

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

751 
deferred definitions require a surrounding 'overloading' block. 

752 

61337  753 

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

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

755 

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

759 
'SML_file_no_debug' control compilation of sources with or without 

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

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

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

763 
any effect on the running ML program. 

60984  764 

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

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

768 
update. 

61729  769 

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

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

772 
enable option "editor_output_state". 

61215  773 

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

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

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

778 
visibility. 

779 

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

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

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

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

784 
panel. 

785 

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

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

787 
state output, interactive queries) wrt. longrunning background tasks. 
62017  788 

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

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

791 
implicit: a popup will show up unconditionally. 

792 

793 
* Additional abbreviations for syntactic completion may be specified in 

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

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

796 

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

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

798 
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

799 
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

800 
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

801 

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

804 
the editor. 

805 

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

807 
instead of former C+e LEFT. 

808 

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

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

811 
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

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

813 

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

816 
singleinstance applications seen on common GUI desktops. 

817 

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

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

819 
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

820 
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

821 

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

824 

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

827 

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

828 

61405  829 
*** Document preparation *** 
830 

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

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

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

833 

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

836 

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

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

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

840 

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

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

843 
follows: 

844 

845 
\<^item> itemize 

846 
\<^enum> enumerate 

847 
\<^descr> description 

848 

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

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

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

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

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

855 

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

858 
standard LaTeX macros of the same names. 

859 

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

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

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

864 
cartouche tokens seen in theory sources. 

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

865 

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

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

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

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

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

871 

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

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

875 

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

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

878 

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

880 

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

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

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

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

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

886 
documentation, with a hyperlink in the Prover IDE. 

887 

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

889 
entities of the Isar language. 

890 

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

61488  893 
print mode "HTML" loses its special meaning. 
61471  894 

61405  895 

60406  896 
*** Isar *** 
897 

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

900 
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

901 
example: 
60414  902 

903 
have result: "C x y" 

904 
if "A x" and "B y" 

905 
for x :: 'a and y :: 'a 

906 
<proof> 

907 

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

60414  910 
corresponds to a raw proof block like this: 
911 

912 
{ 

913 
fix x :: 'a and y :: 'a 

60449  914 
assume that: "A x" "B y" 
60414  915 
have "C x y" <proof> 
916 
} 

917 
note result = this 

60406  918 

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

919 
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

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

921 

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

61658  924 

925 
assume result: "C x y" 

926 
if "A x" and "B y" 

927 
for x :: 'a and y :: 'a 

928 

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

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

931 

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

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

934 
example: 

935 

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

937 

938 
is equivalent to: 

939 

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

941 

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

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

60595  946 

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

948 

949 
or: 

950 

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

952 

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

954 

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

956 

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

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

960 
of the local context elements yet. 

961 

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

964 

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

966 
then have something 

967 
proof cases 

968 
case a 

969 
then show ?thesis <proof> 

970 
next 

971 
case b 

972 
then show ?thesis <proof> 

973 
next 

974 
case c 

975 
then show ?thesis <proof> 

976 
qed 

977 

60565  978 
* Command 'case' allows fact name and attribute specification like this: 
979 

980 
case a: (c xs) 

981 
case a [attributes]: (c xs) 

982 

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

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

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

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

987 
and always put attributes in front. 

988 

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

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

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

991 
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

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

993 

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

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

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

998 

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

1000 
supply [simp] = a 

1001 
proof 

1002 
show A by simp 

1003 
next 

1004 
show A by simp 

1005 
qed 

1006 

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

1008 
proof body as well, abstracted over relevant parameters. 

1009 

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

1011 
parameter scope for of each clause. 

1012 

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

1014 
statements: result is abstracted over unknowns. 

1015 

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

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

1019 
manual. 

1020 

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

1023 

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

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

1025 
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

1026 
example: 
60617  1027 

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

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

1030 
proof goal_cases 
60622  1031 
case (1 x) 
1032 
then show ?case using \<open>A x\<close> \<open>B x\<close> sorry 

1033 
next 

1034 
case (2 y z) 

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

1036 
qed 

1037 

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

1039 
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

1040 
proof goal_cases 
60617  1041 
case prems: 1 
1042 
then show ?case using prems sorry 

1043 
next 

1044 
case prems: 2 

1045 
then show ?case using prems sorry 

1046 
qed 

60578  1047 

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

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

60581  1052 

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

60551  1055 

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

1058 

60406  1059 

60331  1060 
*** Pure *** 
1061 

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

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

1063 
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

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

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

1066 

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

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

1069 

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

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

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

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

1077 
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

1078 

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

1079 
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

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

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

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

1083 

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

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

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

1086 
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

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

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

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

1090 

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

1093 

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

61675  1095 
'defines'. 
1096 

61895  1097 
* Command 'permanent_interpretation' has been discontinued. Use 
1098 
'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY. 

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

1099 

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

1102 

60331  1103 
* Configuration option rule_insts_schematic has been discontinued 
62017  1104 
(intermediate legacy feature in Isabelle2015). INCOMPATIBILITY. 
60331  1105 

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

1108 
exploited. 

60347  1109 

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

62205  1111 
operations behave more similar to abbreviations. Potential 
60347  1112 
INCOMPATIBILITY in exotic situations. 
1113 

1114 

60171  1115 
*** HOL *** 
1116 

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

1119 
global collection of overloaded constant / type definitions into 

1120 
account. Type definitions with open dependencies on overloaded 

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

1122 
provides extra robustness in theory construction. Rare INCOMPATIBILITY. 

1123 

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

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

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

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

1128 
Option.is_none_def. Occasional INCOMPATIBILITY in applications. 

1129 

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

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

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

1133 
simplify porting old theories: 

1134 

1135 
notation iff (infixr "<>" 25) 

1136 

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

1138 

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

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

1141 

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

1143 

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

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

1146 

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

1148 

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

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

1151 

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

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

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

1155 

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

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

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

1159 

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

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

1162 
INCOMPATIBILITY, use plain "::" instead. 

1163 

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

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

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

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

1168 

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

1170 
lowlevel facts of the internal construction only if the option 

62093  1171 
"inductive_internals" is enabled. This refers to the internal predicate 
62017  1172 
definition and its monotonicity result. Rare INCOMPATIBILITY. 
1173 

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

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

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

62093  1178 

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

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

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

1182 
INCOMPATIBILITY. 

62017  1183 

1184 
* Combinator to represent case distinction on products is named 

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

1186 
theorem aliasses have been retained. 

1187 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1211 
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

1212 
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

1213 
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

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

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

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

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

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

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

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

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

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

1223 
split_curry ~> case_prod_curry 
62017  1224 

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

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

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

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

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

1229 
strip_psplits ~> strip_ptupleabs 
62017  1230 

1231 
INCOMPATIBILITY. 

1232 

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

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

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

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

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

1238 

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

1239 
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

1240 
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

1241 
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

1242 
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

1243 
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

1244 
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

1245 
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

1246 
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

1247 
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

1248 
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

1249 
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

1250 
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

1251 
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

1252 
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

1253 
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

1254 
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

1255 
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

1256 
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

1257 
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

1258 
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

1259 
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

1260 
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

1261 
ceiling_real_of_int ceiling_of_int 
62017  1262 

1263 
INCOMPATIBILITY. 

61143  1264 

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

1267 

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

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

1269 

60171  1270 
* Discontinued simp_legacy_precond. Potential INCOMPATIBILITY. 
60138  1271 

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

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

1274 
 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

1275 
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

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

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

1281 

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

1283 
 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

1284 
 Fixed soundness bug in "destroy_constrs" optimization. 
62080  1285 
 Fixed soundness bug in translation of "rat" type. 
60310  1286 
 Removed "check_potential" and "check_genuine" options. 
61317  1287 
 Eliminated obsolete "blocking" option. 
60310  1288 

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

1292 
 Always generate "case_transfer" theorem. 

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

61551  1295 
 Allow discriminators and selectors with the same name as the type 
1296 
being defined. 

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

60920  1298 

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

1301 
'transfer_prover_start' and 'transfer_prover_end'. 

61370  1302 

62118  1303 
* New diagnostic command print_record for displaying record definitions. 
1304 

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

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

1308 
simprocs binary_int_div and binary_int_mod 

1309 

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

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

1312 

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

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

1316 
fields with notions that are trivial there. 

1317 

1318 
* Class normalization_semidom specifies canonical representants for 

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

1320 
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

1321 

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

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

1325 
gcd_nat.assoc and gcd_int.assoc by gcd.assoc. 

1326 

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

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

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

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

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

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

1333 
during instantiation. 

1334 

1335 
* New cancellation simprocs for boolean algebras to cancel complementary 

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

1337 
"top". INCOMPATIBILITY. 

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

1338 

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

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

62101  1343 

1344 
open_real_def \<leadsto> open_dist 

1345 
open_complex_def \<leadsto> open_dist 

1346 

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

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

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

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

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

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

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

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

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

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

1357 
INCOMPATIBILITY. 
62209  1358 
 Added multiset inclusion operator syntax: 
1359 
\<subset># 

1360 
\<subseteq># 

1361 
\<supset># 

1362 
\<supseteq># 

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

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

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

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

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

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

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

1369 
INCOMPATIBILITY. 
60497 