author  wenzelm 
Fri, 27 Apr 2012 21:13:55 +0200  
changeset 47807  befe55c8bbdc 
parent 47806  7e009f4e9f47 
child 47809  4d8cbea248b0 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

47462  4 
New in Isabelle2012 (May 2012) 
5 
 

45109  6 

45593  7 
*** General *** 
8 

45614  9 
* Prover IDE (PIDE) improvements: 
10 

47585  11 
 more robust Sledgehammer integration (as before the sledgehammer 
47806  12 
commandline needs to be typed into the source buffer) 
45614  13 
 markup for bound variables 
47806  14 
 markup for types of term variables (displayed as tooltips) 
46956
9ff441f295c2
Isabelle/jEdit supports userdefined Isar commands within the running session;
wenzelm
parents:
46948
diff
changeset

15 
 support for userdefined Isar commands within the running session 
47158  16 
 improved support for Unicode outside original 16bit range 
17 
e.g. glyph for \<A> (thanks to jEdit 4.5.1) 

45614  18 

47806  19 
* Forward declaration of outer syntax keywords within the theory 
20 
header  minor INCOMPATIBILITY for userdefined commands. Allow new 

21 
commands to be used in the same theory where defined. 

46485  22 

45593  23 
* Rule attributes in local theory declarations (e.g. locale or class) 
24 
are now statically evaluated: the resulting theorem is stored instead 

25 
of the original expression. INCOMPATIBILITY in rare situations, where 

26 
the historic accident of dynamic reevaluation in interpretations 

27 
etc. was exploited. 

28 

45600
1bbbac9a0cb0
'lemmas' / 'theorems' commands allow 'for' fixes and standardize the result before storing;
wenzelm
parents:
45593
diff
changeset

29 
* Commands 'lemmas' and 'theorems' allow local variables using 'for' 
1bbbac9a0cb0
'lemmas' / 'theorems' commands allow 'for' fixes and standardize the result before storing;
wenzelm
parents:
45593
diff
changeset

30 
declaration, and results are standardized before being stored. Thus 
1bbbac9a0cb0
'lemmas' / 'theorems' commands allow 'for' fixes and standardize the result before storing;
wenzelm
parents:
45593
diff
changeset

31 
oldstyle "standard" after instantiation or composition of facts 
1bbbac9a0cb0
'lemmas' / 'theorems' commands allow 'for' fixes and standardize the result before storing;
wenzelm
parents:
45593
diff
changeset

32 
becomes obsolete. Minor INCOMPATIBILITY, due to potential change of 
1bbbac9a0cb0
'lemmas' / 'theorems' commands allow 'for' fixes and standardize the result before storing;
wenzelm
parents:
45593
diff
changeset

33 
indices of schematic variables. 
1bbbac9a0cb0
'lemmas' / 'theorems' commands allow 'for' fixes and standardize the result before storing;
wenzelm
parents:
45593
diff
changeset

34 

46506
c7faa011bfa7
simplified configuration options for syntax ambiguity;
wenzelm
parents:
46497
diff
changeset

35 
* Simplified configuration options for syntax ambiguity: see 
46512
4f9f61f9b535
simplified configuration options for syntax ambiguity;
wenzelm
parents:
46506
diff
changeset

36 
"syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isarref 
4f9f61f9b535
simplified configuration options for syntax ambiguity;
wenzelm
parents:
46506
diff
changeset

37 
manual. Minor INCOMPATIBILITY. 
46506
c7faa011bfa7
simplified configuration options for syntax ambiguity;
wenzelm
parents:
46497
diff
changeset

38 

47806  39 
* Updated and extended reference manuals: "isarref" and 
40 
"implementation"; reduced remaining material in old "ref" manual. 

46959
cdc791910460
defer actual parsing of command spans and thus allow new commands to be used in the same theory where defined;
wenzelm
parents:
46956
diff
changeset

41 

45593  42 

45134  43 
*** Pure *** 
44 

47482
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

45 
* Auxiliary contexts indicate block structure for specifications with 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

46 
additional parameters and assumptions. Such unnamed contexts may be 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

47 
nested within other targets, like 'theory', 'locale', 'class', 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

48 
'instantiation' etc. Results from the local context are generalized 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

49 
accordingly and applied to the enclosing target context. Example: 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

50 

a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

51 
context 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

52 
fixes x y z :: 'a 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

53 
assumes xy: "x = y" and yz: "y = z" 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

54 
begin 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

55 

a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

56 
lemma my_trans: "x = z" using xy yz by simp 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

57 

a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

58 
end 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

59 

a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

60 
thm my_trans 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

61 

a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

62 
The most basic application is to factorout context elements of 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

63 
several fixes/assumes/shows theorem statements, e.g. see 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

64 
~~/src/HOL/Isar_Examples/Group_Context.thy 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

65 

a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

66 
Any other local theory specification element works within the "context 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

67 
... begin ... end" block as well. 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

68 

47484  69 
* Bundled declarations associate attributed fact expressions with a 
70 
given name in the context. These may be later included in other 

71 
contexts. This allows to manage context extensions casually, without 

72 
the logical dependencies of locales and locale interpretation. 

73 

74 
See commands 'bundle', 'include', 'including' etc. in the isarref 

75 
manual. 

76 

47427
0daa97ed1585
rule composition via attribute "OF" (or ML functions OF/MRS) is more tolerant against multiple unifiers;
wenzelm
parents:
47413
diff
changeset

77 
* Rule composition via attribute "OF" (or ML functions OF/MRS) is more 
0daa97ed1585
rule composition via attribute "OF" (or ML functions OF/MRS) is more tolerant against multiple unifiers;
wenzelm
parents:
47413
diff
changeset

78 
tolerant against multiple unifiers, as long as the final result is 
0daa97ed1585
rule composition via attribute "OF" (or ML functions OF/MRS) is more tolerant against multiple unifiers;
wenzelm
parents:
47413
diff
changeset

79 
unique. (As before, rules are composed in canonical righttoleft 
0daa97ed1585
rule composition via attribute "OF" (or ML functions OF/MRS) is more tolerant against multiple unifiers;
wenzelm
parents:
47413
diff
changeset

80 
order to accommodate newly introduced premises.) 
0daa97ed1585
rule composition via attribute "OF" (or ML functions OF/MRS) is more tolerant against multiple unifiers;
wenzelm
parents:
47413
diff
changeset

81 

46976
80123a220219
'definition' no longer exports the foundational "raw_def";
wenzelm
parents:
46966
diff
changeset

82 
* Command 'definition' no longer exports the foundational "raw_def" 
80123a220219
'definition' no longer exports the foundational "raw_def";
wenzelm
parents:
46966
diff
changeset

83 
into the user context. Minor INCOMPATIBILITY, may use the regular 
80123a220219
'definition' no longer exports the foundational "raw_def";
wenzelm
parents:
46966
diff
changeset

84 
"def" result with attribute "abs_def" to imitate the old version. 
80123a220219
'definition' no longer exports the foundational "raw_def";
wenzelm
parents:
46966
diff
changeset

85 

47806  86 
* Renamed some inner syntax categories: 
87 

88 
num ~> num_token 

89 
xnum ~> xnum_token 

90 
xstr ~> str_token 

91 

92 
Minor INCOMPATIBILITY. Note that in practice "num_const" or 

93 
"num_position" etc. are mainly used instead (which also include 

94 
position information via constraints). 

95 

46903
3d44892ac0d6
improved attribute "abs_def" to handle objectequality as well;
wenzelm
parents:
46888
diff
changeset

96 
* Attribute "abs_def" turns an equation of the form "f x y == t" into 
3d44892ac0d6
improved attribute "abs_def" to handle objectequality as well;
wenzelm
parents:
46888
diff
changeset

97 
"f == %x y. t", which ensures that "simp" or "unfold" steps always 
3d44892ac0d6
improved attribute "abs_def" to handle objectequality as well;
wenzelm
parents:
46888
diff
changeset

98 
expand it. This also works for objectlogic equality. (Formerly 
3d44892ac0d6
improved attribute "abs_def" to handle objectequality as well;
wenzelm
parents:
46888
diff
changeset

99 
undocumented feature.) 
3d44892ac0d6
improved attribute "abs_def" to handle objectequality as well;
wenzelm
parents:
46888
diff
changeset

100 

46493  101 
* Discontinued old "prems" fact, which used to refer to the accidental 
47464  102 
collection of foundational premises in the context (already marked as 
103 
legacy since Isabelle2011). 

46493  104 

45134  105 
* Obsolete command 'types' has been discontinued. Use 'type_synonym' 
106 
instead. INCOMPATIBILITY. 

107 

47464  108 
* Old code generator for SML and its commands 'code_module', 
45383  109 
'code_library', 'consts_code', 'types_code' have been discontinued. 
46028
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset

110 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  111 

47464  112 
* Redundant attribute "code_inline" has been discontinued. Use 
113 
"code_unfold" instead. INCOMPATIBILITY. 

114 

115 
* Dropped attribute "code_unfold_post" in favor of the its dual 

116 
"code_abbrev", which yields a common pattern in definitions like 

46028
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset

117 

9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset

118 
definition [code_abbrev]: "f = t" 
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset

119 

9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset

120 
INCOMPATIBILITY. 
45383  121 

45427
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset

122 
* Sort constraints are now propagated in simultaneous statements, just 
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset

123 
like type constraints. INCOMPATIBILITY in rare situations, where 
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset

124 
distinct sorts used to be assigned accidentally. For example: 
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset

125 

fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset

126 
lemma "P (x::'a::foo)" and "Q (y::'a::bar)"  "now illegal" 
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset

127 

fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset

128 
lemma "P (x::'a)" and "Q (y::'a::bar)" 
47462  129 
 "now uniform 'a::bar instead of default sort for first occurrence (!)" 
45427
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset

130 

fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset

131 

45122  132 
*** HOL *** 
133 

47806  134 
* New tutorial "Programming and Proving in Isabelle/HOL" 
135 
("progprove"). It completely supersedes "A Tutorial Introduction to 

136 
Structured Isar Proofs" ("isaroverview"), which has been removed. It 

137 
also supersedes "Isabelle/HOL, A Proof Assistant for HigherOrder 

138 
Logic" as the recommended beginners tutorial, but does not cover all 

139 
of the material of that old tutorial. 

47464  140 

141 
* Type 'a set is now a proper type constructor (just as before 

142 
Isabelle2008). Definitions mem_def and Collect_def have disappeared. 

143 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

144 
sets separate, it is often sufficient to rephrase sets S accidentally 

145 
used as predicates by "%x. x : S" and predicates P accidentally used 

146 
as sets by "{x. P x}". Corresponding proofs in a first step should be 

147 
pruned from any tinkering with former theorems mem_def and Collect_def 

148 
as far as possible. 

149 

150 
For developments which deliberately mixed predicates and sets, a 

151 
planning step is necessary to determine what should become a predicate 

152 
and what a set. It can be helpful to carry out that step in 

153 
Isabelle20111 before jumping right into the current release. 

154 

155 
* The representation of numerals has changed. Datatype "num" 

156 
represents strictly positive binary numerals, along with functions 

157 
"numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent 

158 
positive and negated numeric literals, respectively. (See definitions 

159 
in ~~/src/HOL/Num.thy.) Potential INCOMPATIBILITY, some user theories 

160 
may require adaptations as follows: 

47108
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

161 

2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

162 
 Theorems with number_ring or number_semiring constraints: These 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

163 
classes are gone; use comm_ring_1 or comm_semiring_1 instead. 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

164 

2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

165 
 Theories defining numeric types: Remove number, number_semiring, 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

166 
and number_ring instances. Defer all theorems about numerals until 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

167 
after classes one and semigroup_add have been instantiated. 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

168 

2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

169 
 Numeralonly simp rules: Replace each rule having a "number_of v" 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

170 
pattern with two copies, one for numeral and one for neg_numeral. 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

171 

2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

172 
 Theorems about subclasses of semiring_1 or ring_1: These classes 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

173 
automatically support numerals now, so more simp rules and 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

174 
simprocs may now apply within the proof. 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

175 

2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

176 
 Definitions and theorems using old constructors Pls/Min/Bit0/Bit1: 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

177 
Redefine using other integer operations. 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

178 

46834
a5fa1dc55945
less rigorous but more realistic migration recommendation; note on code generation of sets
haftmann
parents:
46752
diff
changeset

179 
* Code generation by default implements sets as container type rather 
a5fa1dc55945
less rigorous but more realistic migration recommendation; note on code generation of sets
haftmann
parents:
46752
diff
changeset

180 
than predicates. INCOMPATIBILITY. 
a5fa1dc55945
less rigorous but more realistic migration recommendation; note on code generation of sets
haftmann
parents:
46752
diff
changeset

181 

47265  182 
* New proof import from HOL Light: Faster, simpler, and more scalable. 
183 
Requires a proof bundle, which is available as an external component. 

47464  184 
Discontinued old (and mostly dead) Importer for HOL4 and HOL Light. 
47265  185 
INCOMPATIBILITY. 
47264
6488c5efec49
renamed import session back to Import, conforming to directory name; NEWS
krauss
parents:
47217
diff
changeset

186 

46373  187 
* New type synonym 'a rel = ('a * 'a) set 
188 

47702
5f9ce06f281e
typedef with implicit set definition is considered legacy;
wenzelm
parents:
47694
diff
changeset

189 
* Typedef with implicit set definition is considered legacy. Use 
5f9ce06f281e
typedef with implicit set definition is considered legacy;
wenzelm
parents:
47694
diff
changeset

190 
"typedef (open)" form instead, which will eventually become the 
5f9ce06f281e
typedef with implicit set definition is considered legacy;
wenzelm
parents:
47694
diff
changeset

191 
default. 
5f9ce06f281e
typedef with implicit set definition is considered legacy;
wenzelm
parents:
47694
diff
changeset

192 

46752
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

193 
* More default pred/set conversions on a couple of relation operations 
47464  194 
and predicates. Added powers of predicate relations. Consolidation 
195 
of some relation theorems: 

46752
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

196 

e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

197 
converse_def ~> converse_unfold 
47549  198 
rel_comp_def ~> relcomp_unfold 
46752
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

199 
symp_def ~> (dropped, use symp_def and sym_def instead) 
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

200 
transp_def ~> transp_trans 
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

201 
Domain_def ~> Domain_unfold 
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

202 
Range_def ~> Domain_converse [symmetric] 
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

203 

46981  204 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
205 

47464  206 
See theory "Relation" for examples for making use of pred/set 
207 
conversions by means of attributes "to_set" and "to_pred". 

47086  208 

46752
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

209 
INCOMPATIBILITY. 
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

210 

46363  211 
* Renamed facts about the power operation on relations, i.e., relpow 
47464  212 
to match the constant's name: 
47463  213 

46458  214 
rel_pow_1 ~> relpow_1 
46363  215 
rel_pow_0_I ~> relpow_0_I 
216 
rel_pow_Suc_I ~> relpow_Suc_I 

217 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

218 
rel_pow_0_E ~> relpow_0_E 

219 
rel_pow_Suc_E ~> relpow_Suc_E 

220 
rel_pow_E ~> relpow_E 

46458  221 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  222 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  223 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
224 
rel_pow_E2 ~> relpow_E2 

225 
rel_pow_add ~> relpow_add 

226 
rel_pow_commute ~> relpow 

227 
rel_pow_empty ~> relpow_empty: 

228 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

229 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

230 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

231 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

232 
rel_pow_fun_conv ~> relpow_fun_conv 

233 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

234 
rel_pow_finite_bounded ~> relpow_finite_bounded 

235 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

236 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

237 
single_valued_rel_pow ~> single_valued_relpow 

47463  238 

46363  239 
INCOMPATIBILITY. 
240 

47448  241 
* Theory Relation: Consolidated constant name for relation composition 
47464  242 
and corresponding theorem names: 
243 

47549  244 
 Renamed constant rel_comp to relcomp. 
47464  245 

47448  246 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  247 

47448  248 
 Renamed theorems: 
47464  249 

47448  250 
rel_compI ~> relcompI 
251 
rel_compEpair ~> relcompEpair 

252 
rel_compE ~> relcompE 

253 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

254 
rel_comp_empty1 ~> relcomp_empty1 

255 
rel_comp_mono ~> relcomp_mono 

256 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

257 
rel_comp_distrib ~> relcomp_distrib 

258 
rel_comp_distrib2 ~> relcomp_distrib2 

259 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

260 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

261 
single_valued_rel_comp ~> single_valued_relcomp 

47549  262 
rel_comp_def ~> relcomp_unfold 
47448  263 
converse_rel_comp ~> converse_relcomp 
264 
pred_compI ~> relcomppI 

265 
pred_compE ~> relcomppE 

266 
pred_comp_bot1 ~> relcompp_bot1 

267 
pred_comp_bot2 ~> relcompp_bot2 

268 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

269 
pred_comp_mono ~> relcompp_mono 

270 
pred_comp_distrib ~> relcompp_distrib 

271 
pred_comp_distrib2 ~> relcompp_distrib2 

272 
converse_pred_comp ~> converse_relcompp 

47464  273 

47448  274 
finite_rel_comp ~> finite_relcomp 
47464  275 

47448  276 
set_rel_comp ~> set_relcomp 
277 

278 
INCOMPATIBILITY. 

279 

47550  280 
* Theory Divides: Discontinued redundant theorems about div and mod. 
281 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

282 

283 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

284 
zdiv_self ~> div_self 

285 
zmod_self ~> mod_self 

286 
zdiv_zero ~> div_0 

287 
zmod_zero ~> mod_0 

288 
zdiv_zmod_equality ~> div_mod_equality2 

289 
zdiv_zmod_equality2 ~> div_mod_equality 

290 
zmod_zdiv_trivial ~> mod_div_trivial 

291 
zdiv_zminus_zminus ~> div_minus_minus 

292 
zmod_zminus_zminus ~> mod_minus_minus 

293 
zdiv_zminus2 ~> div_minus_right 

294 
zmod_zminus2 ~> mod_minus_right 

295 
zdiv_minus1_right ~> div_minus1_right 

296 
zmod_minus1_right ~> mod_minus1_right 

297 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

298 
zmod_zmult1_eq ~> mod_mult_right_eq 

299 
zpower_zmod ~> power_mod 

300 
zdvd_zmod ~> dvd_mod 

301 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

302 
mod_mult_distrib ~> mult_mod_left 

303 
mod_mult_distrib2 ~> mult_mod_right 

304 

305 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

306 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

307 

47551  308 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
309 

47552  310 
* Consolidated theorem names concerning fold combinators: 
47550  311 

312 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

313 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

314 
INFI_fold_inf ~> INF_fold_inf 

315 
SUPR_fold_sup ~> SUP_fold_sup 

316 
union_set ~> union_set_fold 

317 
minus_set ~> minus_set_fold 

318 
INFI_set_fold ~> INF_set_fold 

319 
SUPR_set_fold ~> SUP_set_fold 

320 
INF_code ~> INF_set_foldr 

321 
SUP_code ~> SUP_set_foldr 

322 
foldr.simps ~> foldr.simps (in pointfree formulation) 

323 
foldr_fold_rev ~> foldr_conv_fold 

324 
foldl_fold ~> foldl_conv_fold 

325 
foldr_foldr ~> foldr_conv_foldl 

326 
foldl_foldr ~> foldl_conv_foldr 

47552  327 
fold_set_remdups ~> fold_set_fold_remdups 
328 
fold_set ~> fold_set_fold 

329 
fold1_set ~> fold1_set_fold 

47550  330 

331 
INCOMPATIBILITY. 

332 

333 
* Dropped rarely useful theorems concerning fold combinators: 

334 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

335 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

336 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

337 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

338 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

339 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

340 
INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0" 

341 
and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be 

342 
useful to boil down "List.foldr" and "List.foldl" to "List.fold" by 

343 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

344 

345 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

346 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

347 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

348 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

349 
lemmas over fold rather than foldr, or make use of lemmas 

350 
fold_conv_foldr and fold_rev. 

351 

352 
* Congruence rules Option.map_cong and Option.bind_cong for recursion 

353 
through option types. 

354 

355 
* Concrete syntax for case expressions includes constraints for source 

356 
positions, and thus produces Prover IDE markup for its bindings. 

357 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

358 
pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of 

359 
one_case. 

360 

361 
* Discontinued configuration option "syntax_positions": atomic terms 

362 
in parse trees are always annotated by position constraints. 

363 

47703  364 
* HOL/Library/Set_Algebras.thy: Addition and multiplication on sets 
365 
are expressed via type classes again. The special syntax 

366 
\<oplus>/\<otimes> has been replaced by plain +/*. Removed constant 

367 
setsum_set, which is now subsumed by Big_Operators.setsum. 

368 
INCOMPATIBILITY. 

369 

47464  370 
* New theory HOL/Library/DAList provides an abstract type for 
371 
association lists with distinct keys. 

45874  372 

45839
43a5b86bc102
'datatype' specifications allow explicit sort constraints;
wenzelm
parents:
45810
diff
changeset

373 
* 'datatype' specifications allow explicit sort constraints. 
43a5b86bc102
'datatype' specifications allow explicit sort constraints;
wenzelm
parents:
45810
diff
changeset

374 

46160  375 
* Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY, 
376 
use theory HOL/Library/Nat_Bijection instead. 

377 

47464  378 
* Theory HOL/Library/RBT_Impl: Backing implementation of redblack 
379 
trees is now inside a type class context. Names of affected 

380 
operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for 

381 
theories working directly with raw redblack trees, adapt the names as 

382 
follows: 

47452  383 

384 
Operations: 

385 
bulkload > rbt_bulkload 

386 
del_from_left > rbt_del_from_left 

387 
del_from_right > rbt_del_from_right 

388 
del > rbt_del 

389 
delete > rbt_delete 

390 
ins > rbt_ins 

391 
insert > rbt_insert 

392 
insertw > rbt_insert_with 

393 
insert_with_key > rbt_insert_with_key 

394 
map_entry > rbt_map_entry 

395 
lookup > rbt_lookup 

396 
sorted > rbt_sorted 

397 
tree_greater > rbt_greater 

398 
tree_less > rbt_less 

399 
tree_less_symbol > rbt_less_symbol 

400 
union > rbt_union 

401 
union_with > rbt_union_with 

402 
union_with_key > rbt_union_with_key 

403 

404 
Lemmas: 

405 
balance_left_sorted > balance_left_rbt_sorted 

406 
balance_left_tree_greater > balance_left_rbt_greater 

407 
balance_left_tree_less > balance_left_rbt_less 

408 
balance_right_sorted > balance_right_rbt_sorted 

409 
balance_right_tree_greater > balance_right_rbt_greater 

410 
balance_right_tree_less > balance_right_rbt_less 

411 
balance_sorted > balance_rbt_sorted 

412 
balance_tree_greater > balance_rbt_greater 

413 
balance_tree_less > balance_rbt_less 

414 
bulkload_is_rbt > rbt_bulkload_is_rbt 

415 
combine_sorted > combine_rbt_sorted 

416 
combine_tree_greater > combine_rbt_greater 

417 
combine_tree_less > combine_rbt_less 

418 
delete_in_tree > rbt_delete_in_tree 

419 
delete_is_rbt > rbt_delete_is_rbt 

420 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

421 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

422 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

423 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

424 
del_in_tree > rbt_del_in_tree 

425 
del_inv1_inv2 > rbt_del_inv1_inv2 

426 
del_sorted > rbt_del_rbt_sorted 

427 
del_tree_greater > rbt_del_rbt_greater 

428 
del_tree_less > rbt_del_rbt_less 

429 
dom_lookup_Branch > dom_rbt_lookup_Branch 

430 
entries_lookup > entries_rbt_lookup 

431 
finite_dom_lookup > finite_dom_rbt_lookup 

432 
insert_sorted > rbt_insert_rbt_sorted 

433 
insertw_is_rbt > rbt_insertw_is_rbt 

434 
insertwk_is_rbt > rbt_insertwk_is_rbt 

435 
insertwk_sorted > rbt_insertwk_rbt_sorted 

436 
insertw_sorted > rbt_insertw_rbt_sorted 

437 
ins_sorted > ins_rbt_sorted 

438 
ins_tree_greater > ins_rbt_greater 

439 
ins_tree_less > ins_rbt_less 

440 
is_rbt_sorted > is_rbt_rbt_sorted 

441 
lookup_balance > rbt_lookup_balance 

442 
lookup_bulkload > rbt_lookup_rbt_bulkload 

443 
lookup_delete > rbt_lookup_rbt_delete 

444 
lookup_Empty > rbt_lookup_Empty 

445 
lookup_from_in_tree > rbt_lookup_from_in_tree 

446 
lookup_in_tree > rbt_lookup_in_tree 

447 
lookup_ins > rbt_lookup_ins 

448 
lookup_insert > rbt_lookup_rbt_insert 

449 
lookup_insertw > rbt_lookup_rbt_insertw 

450 
lookup_insertwk > rbt_lookup_rbt_insertwk 

451 
lookup_keys > rbt_lookup_keys 

452 
lookup_map > rbt_lookup_map 

453 
lookup_map_entry > rbt_lookup_rbt_map_entry 

454 
lookup_tree_greater > rbt_lookup_rbt_greater 

455 
lookup_tree_less > rbt_lookup_rbt_less 

456 
lookup_union > rbt_lookup_rbt_union 

457 
map_entry_color_of > rbt_map_entry_color_of 

458 
map_entry_inv1 > rbt_map_entry_inv1 

459 
map_entry_inv2 > rbt_map_entry_inv2 

460 
map_entry_is_rbt > rbt_map_entry_is_rbt 

461 
map_entry_sorted > rbt_map_entry_rbt_sorted 

462 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

463 
map_entry_tree_less > rbt_map_entry_rbt_less 

464 
map_tree_greater > map_rbt_greater 

465 
map_tree_less > map_rbt_less 

466 
map_sorted > map_rbt_sorted 

467 
paint_sorted > paint_rbt_sorted 

468 
paint_lookup > paint_rbt_lookup 

469 
paint_tree_greater > paint_rbt_greater 

470 
paint_tree_less > paint_rbt_less 

471 
sorted_entries > rbt_sorted_entries 

472 
tree_greater_eq_trans > rbt_greater_eq_trans 

473 
tree_greater_nit > rbt_greater_nit 

474 
tree_greater_prop > rbt_greater_prop 

475 
tree_greater_simps > rbt_greater_simps 

476 
tree_greater_trans > rbt_greater_trans 

477 
tree_less_eq_trans > rbt_less_eq_trans 

478 
tree_less_nit > rbt_less_nit 

479 
tree_less_prop > rbt_less_prop 

480 
tree_less_simps > rbt_less_simps 

481 
tree_less_trans > rbt_less_trans 

482 
tree_ord_props > rbt_ord_props 

483 
union_Branch > rbt_union_Branch 

484 
union_is_rbt > rbt_union_is_rbt 

485 
unionw_is_rbt > rbt_unionw_is_rbt 

486 
unionwk_is_rbt > rbt_unionwk_is_rbt 

487 
unionwk_sorted > rbt_unionwk_rbt_sorted 

488 

47807  489 
* Theory HOL/Library/Float: Floating point numbers are now defined as 
490 
a subset of the real numbers. All operations are defined using the 

491 
lifingframework and proofs use the transfer method. INCOMPATIBILITY. 

47616  492 

493 
Changed Operations: 

47622  494 
float_abs > abs 
495 
float_nprt > nprt 

496 
float_pprt > pprt 

497 
pow2 > use powr 

498 
round_down > float_round_down 

499 
round_up > float_round_up 

500 
scale > exponent 

501 

502 
Removed Operations: 

503 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

504 

505 
Renamed Lemmas: 

506 
abs_float_def > Float.compute_float_abs 

507 
bitlen_ge0 > bitlen_nonneg 

508 
bitlen.simps > Float.compute_bitlen 

509 
float_components > Float_mantissa_exponent 

510 
float_divl.simps > Float.compute_float_divl 

511 
float_divr.simps > Float.compute_float_divr 

512 
float_eq_odd > mult_powr_eq_mult_powr_iff 

513 
float_power > real_of_float_power 

514 
lapprox_posrat_def > Float.compute_lapprox_posrat 

515 
lapprox_rat.simps > Float.compute_lapprox_rat 

516 
le_float_def' > Float.compute_float_le 

517 
le_float_def > less_eq_float.rep_eq 

518 
less_float_def' > Float.compute_float_less 

519 
less_float_def > less_float.rep_eq 

520 
normfloat_def > Float.compute_normfloat 

521 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

522 
normfloat > normfloat_def 

523 
normfloat_unique > use normfloat_def 

524 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

525 
one_float_def > Float.compute_float_one 

526 
plus_float_def > Float.compute_float_plus 

527 
rapprox_posrat_def > Float.compute_rapprox_posrat 

528 
rapprox_rat.simps > Float.compute_rapprox_rat 

529 
real_of_float_0 > zero_float.rep_eq 

530 
real_of_float_1 > one_float.rep_eq 

531 
real_of_float_abs > abs_float.rep_eq 

532 
real_of_float_add > plus_float.rep_eq 

533 
real_of_float_minus > uminus_float.rep_eq 

534 
real_of_float_mult > times_float.rep_eq 

535 
real_of_float_simp > Float.rep_eq 

536 
real_of_float_sub > minus_float.rep_eq 

537 
round_down.simps > Float.compute_float_round_down 

538 
round_up.simps > Float.compute_float_round_up 

539 
times_float_def > Float.compute_float_times 

540 
uminus_float_def > Float.compute_float_uminus 

541 
zero_float_def > Float.compute_float_zero 

542 

543 
Lemmas not necessary anymore, use the transfer method: 

544 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

545 
float_divr, float_le_simp, float_less1_mantissa_bound, 

546 
float_less_simp, float_less_zero, float_le_zero, 

547 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

548 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

549 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

550 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

551 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

552 
round_up, zero_le_float, zero_less_float 

47616  553 

46160  554 
* Session HOLWord: Discontinued many redundant theorems specific to 
555 
type 'a word. INCOMPATIBILITY, use the corresponding generic theorems 

556 
instead. 

45546
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

557 

6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

558 
word_sub_alt ~> word_sub_wi 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

559 
word_add_alt ~> word_add_def 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

560 
word_mult_alt ~> word_mult_def 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

561 
word_minus_alt ~> word_minus_def 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

562 
word_0_alt ~> word_0_wi 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

563 
word_1_alt ~> word_1_wi 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

564 
word_add_0 ~> add_0_left 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

565 
word_add_0_right ~> add_0_right 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

566 
word_mult_1 ~> mult_1_left 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

567 
word_mult_1_right ~> mult_1_right 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

568 
word_add_commute ~> add_commute 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

569 
word_add_assoc ~> add_assoc 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

570 
word_add_left_commute ~> add_left_commute 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

571 
word_mult_commute ~> mult_commute 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

572 
word_mult_assoc ~> mult_assoc 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

573 
word_mult_left_commute ~> mult_left_commute 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

574 
word_left_distrib ~> left_distrib 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

575 
word_right_distrib ~> right_distrib 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

576 
word_left_minus ~> left_minus 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

577 
word_diff_0_right ~> diff_0_right 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

578 
word_diff_self ~> diff_self 
45957  579 
word_sub_def ~> diff_minus 
45804  580 
word_diff_minus ~> diff_minus 
45546
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

581 
word_add_ac ~> add_ac 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

582 
word_mult_ac ~> mult_ac 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

583 
word_plus_ac0 ~> add_0_left add_0_right add_ac 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

584 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 
45547  585 
word_order_trans ~> order_trans 
586 
word_order_refl ~> order_refl 

587 
word_order_antisym ~> order_antisym 

588 
word_order_linear ~> linorder_linear 

45810  589 
lenw1_zero_neq_one ~> zero_neq_one 
590 
word_number_of_eq ~> number_of_eq 

46013  591 
word_of_int_add_hom ~> wi_hom_add 
592 
word_of_int_sub_hom ~> wi_hom_sub 

593 
word_of_int_mult_hom ~> wi_hom_mult 

594 
word_of_int_minus_hom ~> wi_hom_neg 

595 
word_of_int_succ_hom ~> wi_hom_succ 

596 
word_of_int_pred_hom ~> wi_hom_pred 

597 
word_of_int_0_hom ~> word_0_wi 

598 
word_of_int_1_hom ~> word_1_wi 

45546
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

599 

47807  600 
* New proof method "word_bitwise" for splitting machine word 
601 
equalities and inequalities into logical circuits, defined in 

602 
HOL/Word/WordBitwise.thy. Supports addition, subtraction, 

603 
multiplication, shifting by constants, bitwise operators and numeric 

604 
constants. Requires fixedlength word types, not 'a word. Solves 

605 
many standard word identies outright and converts more into first 

606 
order problems amenable to blast or similar. See also examples in 

607 
HOL/Word/Examples/WordExamples.thy. 

47567
407cabf66f21
New tactic "word_bitwise" expands word equalities/inequalities into logic.
Thomas Sewell <thomas.sewell@nicta.com.au>
parents:
47563
diff
changeset

608 

46014  609 
* Clarified attribute "mono_set": pure declaration without modifying 
45384
dffa657f0aa2
clarified attribute "mono_set": pure declaration, proper export in ML;
wenzelm
parents:
45383
diff
changeset

610 
the result of the fact expression. 
dffa657f0aa2
clarified attribute "mono_set": pure declaration, proper export in ML;
wenzelm
parents:
45383
diff
changeset

611 

45383  612 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
613 
relations. 

614 

46014  615 
* Constant "Set.not_member" now qualified. INCOMPATIBILITY. 
45383  616 

45122  617 
* Theory Int: Discontinued many legacy theorems specific to type int. 
45383  618 
INCOMPATIBILITY, use the corresponding generic theorems instead. 
45122  619 

620 
zminus_zminus ~> minus_minus 

621 
zminus_0 ~> minus_zero 

622 
zminus_zadd_distrib ~> minus_add_distrib 

623 
zadd_commute ~> add_commute 

624 
zadd_assoc ~> add_assoc 

625 
zadd_left_commute ~> add_left_commute 

45196
78478d938cb8
inlined @{thms} (ML compiletime) allows to get rid of legacy zadd_ac as well (cf. 49e305100097);
wenzelm
parents:
45191
diff
changeset

626 
zadd_ac ~> add_ac 
45122  627 
zmult_ac ~> mult_ac 
628 
zadd_0 ~> add_0_left 

629 
zadd_0_right ~> add_0_right 

630 
zadd_zminus_inverse2 ~> left_minus 

631 
zmult_zminus ~> mult_minus_left 

632 
zmult_commute ~> mult_commute 

633 
zmult_assoc ~> mult_assoc 

634 
zadd_zmult_distrib ~> left_distrib 

635 
zadd_zmult_distrib2 ~> right_distrib 

636 
zdiff_zmult_distrib ~> left_diff_distrib 

637 
zdiff_zmult_distrib2 ~> right_diff_distrib 

638 
zmult_1 ~> mult_1_left 

639 
zmult_1_right ~> mult_1_right 

640 
zle_refl ~> order_refl 

641 
zle_trans ~> order_trans 

642 
zle_antisym ~> order_antisym 

643 
zle_linear ~> linorder_linear 

644 
zless_linear ~> linorder_less_linear 

645 
zadd_left_mono ~> add_left_mono 

646 
zadd_strict_right_mono ~> add_strict_right_mono 

647 
zadd_zless_mono ~> add_less_le_mono 

648 
int_0_less_1 ~> zero_less_one 

649 
int_0_neq_1 ~> zero_neq_one 

650 
zless_le ~> less_le 

651 
zpower_zadd_distrib ~> power_add 

652 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

653 
zero_le_zpower_abs ~> zero_le_power_abs 

654 

45791  655 
* Theory Deriv: Renamed 
656 

657 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

658 

47694  659 
* Theory Library/Multiset: Improved code generation of multisets. 
660 

47807  661 
* Session HOLProbability: Introduced the type "'a measure" to 
662 
represent measures, this replaces the records 'a algebra and 'a 

663 
measure_space. The locales based on subset_class now have two 

664 
localeparameters the space \<Omega> and the set of measurables sets 

665 
M. The product of probability spaces uses now the same constant as 

666 
the finite product of sigmafinite measure spaces "PiM :: ('i => 'a) 

667 
measure". Most constants are defined now outside of locales and gain 

668 
an additional parameter, like null_sets, almost_eventually or \<mu>'. 

669 
Measure space constructions for distributions and densities now got 

670 
their own constants distr and density. Instead of using locales to 

671 
describe measure spaces with a finite space, the measure count_space 

672 
and point_measure is introduced. INCOMPATIBILITY. 

47694  673 

674 
Renamed constants: 

675 
measure > emeasure 

676 
finite_measure.\<mu>' > measure 

677 
product_algebra_generator > prod_algebra 

678 
product_prob_space.emb > prod_emb 

679 
product_prob_space.infprod_algebra > PiM 

680 

681 
Removed locales: 

682 
completeable_measure_space 

683 
finite_measure_space 

684 
finite_prob_space 

685 
finite_product_finite_prob_space 

686 
finite_product_sigma_algebra 

687 
finite_sigma_algebra 

688 
measure_space 

689 
pair_finite_prob_space 

690 
pair_finite_sigma_algebra 

691 
pair_finite_space 

692 
pair_sigma_algebra 

693 
product_sigma_algebra 

694 

695 
Removed constants: 

47751  696 
conditional_space 
47694  697 
distribution > use distr measure, or distributed predicate 
47751  698 
image_space 
47694  699 
joint_distribution > use distr measure, or distributed predicate 
47751  700 
pair_measure_generator 
47694  701 
product_prob_space.infprod_algebra > use PiM 
702 
subvimage 

703 

704 
Replacement theorems: 

47751  705 
finite_additivity_sufficient > ring_of_sets.countably_additiveI_finite 
706 
finite_measure.empty_measure > measure_empty 

707 
finite_measure.finite_continuity_from_above > finite_measure.finite_Lim_measure_decseq 

708 
finite_measure.finite_continuity_from_below > finite_measure.finite_Lim_measure_incseq 

709 
finite_measure.finite_measure_countably_subadditive > finite_measure.finite_measure_subadditive_countably 

710 
finite_measure.finite_measure_eq > finite_measure.emeasure_eq_measure 

711 
finite_measure.finite_measure > finite_measure.emeasure_finite 

712 
finite_measure.finite_measure_finite_singleton > finite_measure.finite_measure_eq_setsum_singleton 

713 
finite_measure.positive_measure' > measure_nonneg 

714 
finite_measure.real_measure > finite_measure.emeasure_real 

715 
finite_product_prob_space.finite_measure_times > finite_product_prob_space.finite_measure_PiM_emb 

716 
finite_product_sigma_algebra.in_P > sets_PiM_I_finite 

717 
finite_product_sigma_algebra.P_empty > space_PiM_empty, sets_PiM_empty 

718 
information_space.conditional_entropy_eq > information_space.conditional_entropy_simple_distributed 

719 
information_space.conditional_entropy_positive > information_space.conditional_entropy_nonneg_simple 

720 
information_space.conditional_mutual_information_eq_mutual_information > information_space.conditional_mutual_information_eq_mutual_information_simple 

721 
information_space.conditional_mutual_information_generic_positive > information_space.conditional_mutual_information_nonneg_simple 

722 
information_space.conditional_mutual_information_positive > information_space.conditional_mutual_information_nonneg_simple 

723 
information_space.entropy_commute > information_space.entropy_commute_simple 

724 
information_space.entropy_eq > information_space.entropy_simple_distributed 

725 
information_space.entropy_generic_eq > information_space.entropy_simple_distributed 

726 
information_space.entropy_positive > information_space.entropy_nonneg_simple 

727 
information_space.entropy_uniform_max > information_space.entropy_uniform 

728 
information_space.KL_eq_0_imp > information_space.KL_eq_0_iff_eq 

729 
information_space.KL_eq_0 > information_space.KL_same_eq_0 

730 
information_space.KL_ge_0 > information_space.KL_nonneg 

731 
information_space.mutual_information_eq > information_space.mutual_information_simple_distributed 

732 
information_space.mutual_information_positive > information_space.mutual_information_nonneg_simple 

733 
Int_stable_cuboids > Int_stable_atLeastAtMost 

734 
Int_stable_product_algebra_generator > positive_integral 

735 
measure_preserving > equality "distr M N f = N" "f : measurable M N" 

47694  736 
measure_space.additive > emeasure_additive 
47751  737 
measure_space.AE_iff_null_set > AE_iff_null 
738 
measure_space.almost_everywhere_def > eventually_ae_filter 

739 
measure_space.almost_everywhere_vimage > AE_distrD 

740 
measure_space.continuity_from_above > INF_emeasure_decseq 

741 
measure_space.continuity_from_above_Lim > Lim_emeasure_decseq 

742 
measure_space.continuity_from_below_Lim > Lim_emeasure_incseq 

47694  743 
measure_space.continuity_from_below > SUP_emeasure_incseq 
47751  744 
measure_space_density > emeasure_density 
745 
measure_space.density_is_absolutely_continuous > absolutely_continuousI_density 

746 
measure_space.integrable_vimage > integrable_distr 

747 
measure_space.integral_translated_density > integral_density 

748 
measure_space.integral_vimage > integral_distr 

749 
measure_space.measure_additive > plus_emeasure 

750 
measure_space.measure_compl > emeasure_compl 

751 
measure_space.measure_countable_increasing > emeasure_countable_increasing 

752 
measure_space.measure_countably_subadditive > emeasure_subadditive_countably 

47694  753 
measure_space.measure_decseq > decseq_emeasure 
47751  754 
measure_space.measure_Diff > emeasure_Diff 
755 
measure_space.measure_Diff_null_set > emeasure_Diff_null_set 

47694  756 
measure_space.measure_eq_0 > emeasure_eq_0 
757 
measure_space.measure_finitely_subadditive > emeasure_subadditive_finite 

47751  758 
measure_space.measure_finite_singleton > emeasure_eq_setsum_singleton 
759 
measure_space.measure_incseq > incseq_emeasure 

760 
measure_space.measure_insert > emeasure_insert 

761 
measure_space.measure_mono > emeasure_mono 

762 
measure_space.measure_not_negative > emeasure_not_MInf 

763 
measure_space.measure_preserving_Int_stable > measure_eqI_generator_eq 

764 
measure_space.measure_setsum > setsum_emeasure 

765 
measure_space.measure_setsum_split > setsum_emeasure_cover 

47694  766 
measure_space.measure_space_vimage > emeasure_distr 
47751  767 
measure_space.measure_subadditive_finite > emeasure_subadditive_finite 
768 
measure_space.measure_subadditive > subadditive 

769 
measure_space.measure_top > emeasure_space 

770 
measure_space.measure_UN_eq_0 > emeasure_UN_eq_0 

771 
measure_space.measure_Un_null_set > emeasure_Un_null_set 

772 
measure_space.positive_integral_translated_density > positive_integral_density 

773 
measure_space.positive_integral_vimage > positive_integral_distr 

47694  774 
measure_space.real_continuity_from_above > Lim_measure_decseq 
47751  775 
measure_space.real_continuity_from_below > Lim_measure_incseq 
47694  776 
measure_space.real_measure_countably_subadditive > measure_subadditive_countably 
47751  777 
measure_space.real_measure_Diff > measure_Diff 
778 
measure_space.real_measure_finite_Union > measure_finite_Union 

779 
measure_space.real_measure_setsum_singleton > measure_eq_setsum_singleton 

780 
measure_space.real_measure_subadditive > measure_subadditive 

781 
measure_space.real_measure_Union > measure_Union 

782 
measure_space.real_measure_UNION > measure_UNION 

47694  783 
measure_space.simple_function_vimage > simple_function_comp 
784 
measure_space.simple_integral_vimage > simple_integral_distr 

47751  785 
measure_space.simple_integral_vimage > simple_integral_distr 
786 
measure_unique_Int_stable > measure_eqI_generator_eq 

787 
measure_unique_Int_stable_vimage > measure_eqI_generator_eq 

47694  788 
pair_sigma_algebra.measurable_cut_fst > sets_Pair1 
789 
pair_sigma_algebra.measurable_cut_snd > sets_Pair2 

790 
pair_sigma_algebra.measurable_pair_image_fst > measurable_Pair1 

791 
pair_sigma_algebra.measurable_pair_image_snd > measurable_Pair2 

792 
pair_sigma_algebra.measurable_product_swap > measurable_pair_swap_iff 

793 
pair_sigma_algebra.pair_sigma_algebra_measurable > measurable_pair_swap 

794 
pair_sigma_algebra.pair_sigma_algebra_swap_measurable > measurable_pair_swap' 

795 
pair_sigma_algebra.sets_swap > sets_pair_swap 

47751  796 
pair_sigma_finite.measure_cut_measurable_fst > pair_sigma_finite.measurable_emeasure_Pair1 
797 
pair_sigma_finite.measure_cut_measurable_snd > pair_sigma_finite.measurable_emeasure_Pair2 

798 
pair_sigma_finite.measure_preserving_swap > pair_sigma_finite.distr_pair_swap 

799 
pair_sigma_finite.pair_measure_alt2 > pair_sigma_finite.emeasure_pair_measure_alt2 

800 
pair_sigma_finite.pair_measure_alt > pair_sigma_finite.emeasure_pair_measure_alt 

801 
pair_sigma_finite.pair_measure_times > pair_sigma_finite.emeasure_pair_measure_Times 

802 
prob_space.indep_distribution_eq_measure > prob_space.indep_vars_iff_distr_eq_PiM 

803 
prob_space.indep_var_distributionD > prob_space.indep_var_distribution_eq 

47694  804 
prob_space.measure_space_1 > prob_space.emeasure_space_1 
805 
prob_space.prob_space_vimage > prob_space_distr 

806 
prob_space.random_variable_restrict > measurable_restrict 

47751  807 
prob_space_unique_Int_stable > measure_eqI_prob_space 
808 
product_algebraE > prod_algebraE_all 

809 
product_algebra_generator_der > prod_algebra_eq_finite 

810 
product_algebra_generator_into_space > prod_algebra_sets_into_space 

811 
product_algebraI > sets_PiM_I_finite 

812 
product_measure_exists > product_sigma_finite.sigma_finite 

47694  813 
product_prob_space.finite_index_eq_finite_product > product_prob_space.sets_PiM_generator 
814 
product_prob_space.finite_measure_infprod_emb_Pi > product_prob_space.measure_PiM_emb 

815 
product_prob_space.infprod_spec > product_prob_space.emeasure_PiM_emb_not_empty 

816 
product_prob_space.measurable_component > measurable_component_singleton 

817 
product_prob_space.measurable_emb > measurable_prod_emb 

818 
product_prob_space.measurable_into_infprod_algebra > measurable_PiM_single 

819 
product_prob_space.measurable_singleton_infprod > measurable_component_singleton 

820 
product_prob_space.measure_emb > emeasure_prod_emb 

47751  821 
product_prob_space.measure_preserving_restrict > product_prob_space.distr_restrict 
822 
product_sigma_algebra.product_algebra_into_space > space_closed 

823 
product_sigma_finite.measure_fold > product_sigma_finite.distr_merge 

824 
product_sigma_finite.measure_preserving_component_singelton > product_sigma_finite.distr_singleton 

825 
product_sigma_finite.measure_preserving_merge > product_sigma_finite.distr_merge 

47694  826 
sequence_space.measure_infprod > sequence_space.measure_PiM_countable 
47751  827 
sets_product_algebra > sets_PiM 
828 
sigma_algebra.measurable_sigma > measurable_measure_of 

829 
sigma_finite_measure.disjoint_sigma_finite > sigma_finite_disjoint 

830 
sigma_finite_measure.RN_deriv_vimage > sigma_finite_measure.RN_deriv_distr 

831 
sigma_product_algebra_sigma_eq > sigma_prod_algebra_sigma_eq 

832 
space_product_algebra > space_PiM 

47694  833 

45383  834 
* New "case_product" attribute to generate a case rule doing multiple 
835 
case distinctions at the same time. E.g. 

836 

837 
list.exhaust [case_product nat.exhaust] 

838 

839 
produces a rule which can be used to perform case distinction on both 

840 
a list and a nat. 

841 

47655  842 
* New Transfer package: 
843 

844 
 transfer_rule attribute: Maintains a collection of transfer rules, 

845 
which relate constants at two different types. Transfer rules may 

846 
relate different type instances of the same polymorphic constant, 

847 
or they may relate an operation on a raw type to a corresponding 

848 
operation on an abstract type (quotient or subtype). For example: 

849 

850 
((A ===> B) ===> list_all2 A ===> list_all2 B) map map 

851 
(cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int 

852 

853 
 transfer method: Replaces a subgoal on abstract types with an 

854 
equivalent subgoal on the corresponding raw types. Constants are 

855 
replaced with corresponding ones according to the transfer rules. 

856 
Goals are generalized over all free variables by default; this is 

857 
necessary for variables whose types changes, but can be overridden 

47807  858 
for specific variables with e.g. 'transfer fixing: x y z'. The 
859 
variant transfer' method allows replacing a subgoal with one that 

860 
is logically stronger (rather than equivalent). 

47655  861 

862 
 relator_eq attribute: Collects identity laws for relators of 

47807  863 
various type constructors, e.g. "list_all2 (op =) = (op =)". The 
47655  864 
transfer method uses these lemmas to infer transfer rules for 
865 
nonpolymorphic constants on the fly. 

866 

867 
 transfer_prover method: Assists with proving a transfer rule for a 

868 
new constant, provided the constant is defined in terms of other 

869 
constants that already have transfer rules. It should be applied 

870 
after unfolding the constant definitions. 

871 

872 
 HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer 

873 
from type nat to type int. 

874 

875 
* New Lifting package: 

876 

877 
 lift_definition command: Defines operations on an abstract type in 

47807  878 
terms of a corresponding operation on a representation 
879 
type. Example syntax: 

47655  880 

881 
lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist" 

882 
is List.insert 

883 

884 
Users must discharge a respectfulness proof obligation when each 

885 
constant is defined. (For a type copy, i.e. a typedef with UNIV, 

886 
the proof is discharged automatically.) The obligation is 

887 
presented in a userfriendly, readable form; a respectfulness 

888 
theorem in the standard format and a transfer rule are generated 

889 
by the package. 

890 

891 
 Integration with code_abstype: For typedefs (e.g. subtypes 

892 
corresponding to a datatype invariant, such as dlist), 

893 
lift_definition generates a code certificate theorem and sets up 

894 
code generation for each constant. 

895 

47807  896 
 setup_lifting command: Sets up the Lifting package to work with a 
897 
userdefined type. The user must provide either a quotient theorem 

898 
or a type_definition theorem. The package configures transfer 

899 
rules for equality and quantifiers on the type, and sets up the 

900 
lift_definition command to work with the type. 

47655  901 

902 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

903 
Quotient_Examples/Lift_RBT.thy, Word/Word.thy and 

904 
Library/Float.thy. 

905 

906 
* Quotient package: 

907 

908 
 The 'quotient_type' command now supports a 'morphisms' option with 

909 
rep and abs functions, similar to typedef. 

910 

911 
 'quotient_type' sets up new types to work with the Lifting and 

912 
Transfer packages, as with 'setup_lifting'. 

913 

914 
 The 'quotient_definition' command now requires the user to prove a 

915 
respectfulness property at the point where the constant is 

47659  916 
defined, similar to lift_definition; INCOMPATIBILITY. 
47655  917 

918 
 Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems 

919 
accordingly, INCOMPATIBILITY. 

920 

47464  921 
* New diagnostic command 'find_unused_assms' to find potentially 
922 
superfluous assumptions in theorems using Quickcheck. 

46591  923 

45759  924 
* Quickcheck: 
47464  925 

45759  926 
 Quickcheck returns variable assignments as counterexamples, which 
927 
allows to reveal the underspecification of functions under test. 

928 
For example, refuting "hd xs = x", it presents the variable 

929 
assignment xs = [] and x = a1 as a counterexample, assuming that 

930 
any property is false whenever "hd []" occurs in it. 

47464  931 

45759  932 
These counterexample are marked as potentially spurious, as 
933 
Quickcheck also returns "xs = []" as a counterexample to the 

934 
obvious theorem "hd xs = hd xs". 

47464  935 

45759  936 
After finding a potentially spurious counterexample, Quickcheck 
937 
continues searching for genuine ones. 

47464  938 

45759  939 
By default, Quickcheck shows potentially spurious and genuine 
47464  940 
counterexamples. The option "genuine_only" sets quickcheck to only 
941 
show genuine counterexamples. 

45941  942 

943 
 The command 'quickcheck_generator' creates random and exhaustive 

944 
value generators for a given type and operations. 

47464  945 

45941  946 
It generates values by using the operations as if they were 
47463  947 
constructors of that type. 
46170  948 

949 
 Support for multisets. 

950 

46591  951 
 Added "use_subtype" options. 
47464  952 

47349
803729c9fd4d
documenting options quickcheck_locale; adjusting IsarRef documentation of Quotient predicate; NEWS
bulwahn
parents:
47270
diff
changeset

953 
 Added "quickcheck_locale" configuration to specify how to process 
803729c9fd4d
documenting options quickcheck_locale; adjusting IsarRef documentation of Quotient predicate; NEWS
bulwahn
parents:
47270
diff
changeset

954 
conjectures in a locale context. 
803729c9fd4d
documenting options quickcheck_locale; adjusting IsarRef documentation of Quotient predicate; NEWS
bulwahn
parents:
47270
diff
changeset

955 

45398
7dbb7b044a11
avoid infinite recursion in peephole optimizer function  this had a debilitating effect on rationals and reals
blanchet
parents:
45384
diff
changeset

956 
* Nitpick: 
45516  957 
 Fixed infinite loop caused by the 'peephole_optim' option and 
958 
affecting 'rat' and 'real'. 

959 

960 
* Sledgehammer: 

47807  961 
 Integrated more tightly with SPASS, as described in the ITP 2012 
962 
paper "More SPASS with Isabelle". 

47563  963 
 Made it try "smt" as a fallback if "metis" fails or times out. 
47807  964 
 Added support for the following provers: AltErgo (via Why3 and 
965 
TFF1), iProver, iProverEq. 

47563  966 
 Replaced remote ESInE with remote Satallax in the default setup. 
967 
 Sped up the minimizer. 

46409
d4754183ccce
made option available to users (mostly for experiments)
blanchet
parents:
46373
diff
changeset

968 
 Added "lam_trans", "uncurry_aliases", and "minimize" options. 
45706  969 
 Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice"). 
46301  970 
 Renamed "sound" option to "strict". 
45516  971 

972 
* Metis: 

973 
 Added possibility to specify lambda translations scheme as a 

46366  974 
parenthesized argument (e.g., "by (metis (lifting) ...)"). 
45398
7dbb7b044a11
avoid infinite recursion in peephole optimizer function  this had a debilitating effect on rationals and reals
blanchet
parents:
45384
diff
changeset

975 

47197  976 
* SMT: 
47563  977 
 Renamed "smt_fixed" option to "smt_read_only_certificates". 
47463  978 

46641  979 
* Command 'try0': 
980 
 Renamed from 'try_methods'. INCOMPATIBILITY. 

981 

46888  982 
* New "eventually_elim" method as a generalized variant of the 
47464  983 
eventually_elim* rules. Supports structured proofs. 
46888  984 

47413  985 
* HOL/TPTP: support to parse and import TPTP problems (all languages) 
47464  986 
into Isabelle/HOL. 
47413  987 

45398
7dbb7b044a11
avoid infinite recursion in peephole optimizer function  this had a debilitating effect on rationals and reals
blanchet
parents:
45384
diff
changeset

988 

45160  989 
*** FOL *** 
990 

45383  991 
* New "case_product" attribute (see HOL). 
45160  992 

45109  993 

47463  994 
*** ZF *** 
995 

996 
* Greater support for structured proofs involving induction or case 

997 
analysis. 

998 

999 
* Much greater use of mathematical symbols. 

1000 

1001 
* Removal of many ML theorem bindings. INCOMPATIBILITY. 

1002 

1003 

45128
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset

1004 
*** ML *** 
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset

1005 

46948  1006 
* Antiquotation @{keyword "name"} produces a parser for outer syntax 
1007 
from a minor keyword introduced via theory header declaration. 

1008 

46961
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46959
diff
changeset

1009 
* Antiquotation @{command_spec "name"} produces the 
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46959
diff
changeset

1010 
Outer_Syntax.command_spec from a major keyword introduced via theory 
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46959
diff
changeset

1011 
header declaration; it can be passed to Outer_Syntax.command etc. 
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46959
diff
changeset

1012 

46916
e7ea35b41e2d
Local_Theory.define no longer hardwires default theorem name  targets/packages need to take care of it;
wenzelm
parents:
46903
diff
changeset

1013 
* Local_Theory.define no longer hardwires default theorem name 
46992
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

1014 
"foo_def", but retains the binding as given. If that is Binding.empty 
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

1015 
/ Attrib.empty_binding, the result is not registered as userlevel 
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

1016 
fact. The Local_Theory.define_internal variant allows to specify a 
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

1017 
nonempty name (used for the foundation in the background theory), 
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

1018 
while omitting the fact binding in the usercontext. Potential 
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

1019 
INCOMPATIBILITY for derived definitional packages: need to specify 
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

1020 
naming policy for primitive definitions more explicitly. 
46916
e7ea35b41e2d
Local_Theory.define no longer hardwires default theorem name  targets/packages need to take care of it;
wenzelm
parents:
46903
diff
changeset

1021 

46497
89ccf66aa73d
renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in conformance with similar operations in structure Term and Logic;
wenzelm
parents:
46493
diff
changeset

1022 
* Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in 
89ccf66aa73d
renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in conformance with similar operations in structure Term and Logic;
wenzelm
parents:
46493
diff
changeset

1023 
conformance with similar operations in structure Term and Logic. 
89ccf66aa73d
renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in conformance with similar operations in structure Term and Logic;
wenzelm
parents:
46493
diff
changeset

1024 

45592  1025 
* Antiquotation @{attributes [...]} embeds attribute source 
1026 
representation into the ML text, which is particularly useful with 

1027 
declarations like Local_Theory.note. 

1028 

45128
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset

1029 
* Structure Proof_Context follows standard naming scheme. Old 
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset

1030 
ProofContext has been discontinued. INCOMPATIBILITY. 
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset

1031 

45293
57def0b39696
refined Local_Theory.declaration {syntax = false, pervasive} semantics: update is applied to auxiliary context as well;
wenzelm
parents:
45233
diff
changeset

1032 
* Refined Local_Theory.declaration {syntax, pervasive}, with subtle 
45298
aa35859c8741
uniform treatment of syntax declaration wrt. aux. context (NB: notation avoids duplicate mixfix internally);
wenzelm
parents:
45293
diff
changeset

1033 
change of semantics: update is applied to auxiliary local theory 
45293
57def0b39696
refined Local_Theory.declaration {syntax = false, pervasive} semantics: update is applied to auxiliary context as well;
wenzelm
parents:
45233
diff
changeset

1034 
context as well. 
57def0b39696
refined Local_Theory.declaration {syntax = false, pervasive} semantics: update is applied to auxiliary context as well;
wenzelm
parents:
45233
diff
changeset

1035 

45620
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1036 
* Modernized some oldstyle infix operations: 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1037 

f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1038 
addeqcongs ~> Simplifier.add_eqcong 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1039 
deleqcongs ~> Simplifier.del_eqcong 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1040 
addcongs ~> Simplifier.add_cong 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1041 
delcongs ~> Simplifier.del_cong 
45625
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

1042 
setmksimps ~> Simplifier.set_mksimps 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

1043 
setmkcong ~> Simplifier.set_mkcong 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

1044 
setmksym ~> Simplifier.set_mksym 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

1045 
setmkeqTrue ~> Simplifier.set_mkeqTrue 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

1046 
settermless ~> Simplifier.set_termless 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

1047 
setsubgoaler ~> Simplifier.set_subgoaler 
45620
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1048 
addsplits ~> Splitter.add_split 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1049 
delsplits ~> Splitter.del_split 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

1050 

45128
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset

1051 

47461
5a7903ba2dac
more robust treatment of ISABELLE_HOME on windows: eliminate spaces and funny unicode characters in directory name via DOS~1 notation;
wenzelm
parents:
47453
diff
changeset

1052 
*** System *** 
5a7903ba2dac
more robust treatment of ISABELLE_HOME on windows: eliminate spaces and funny unicode characters in directory name via DOS~1 notation;
wenzelm
parents:
47453
diff
changeset

1053 

47661
012a887997f3
USER_HOME settings variable points to crossplatform user home directory;
wenzelm
parents:
47659
diff
changeset

1054 
* USER_HOME settings variable points to crossplatform user home 
012a887997f3
USER_HOME settings variable points to crossplatform user home directory;
wenzelm
parents:
47659
diff
changeset

1055 
directory, which coincides with HOME on POSIX systems only. Likewise, 
012a887997f3
USER_HOME settings variable points to crossplatform user home directory;
wenzelm
parents:
47659
diff
changeset

1056 
the Isabelle path specification "~" now expands to $USER_HOME, instead 
012a887997f3
USER_HOME settings variable points to crossplatform user home directory;
wenzelm
parents:
47659
diff
changeset

1057 
of former $HOME. A different default for USER_HOME may be set 
012a887997f3
USER_HOME settings variable points to crossplatform user home directory;
wenzelm
parents:
47659
diff
changeset

1058 
explicitly in shell environment, before Isabelle settings are 
012a887997f3
USER_HOME settings variable points to crossplatform user home directory;
wenzelm
parents:
47659
diff
changeset

1059 
evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where 
012a887997f3
USER_HOME settings variable points to crossplatform user home directory;
wenzelm
parents:
47659
diff
changeset

1060 
the generic user home was intended. 
012a887997f3
USER_HOME settings variable points to crossplatform user home directory;
wenzelm
parents:
47659
diff
changeset

1061 

47807  1062 
* ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name 
1063 
notation, which is useful for the jEdit file browser, for example. 

1064 

47464  1065 
* ISABELLE_JDK_HOME settings variable points to JDK with javac and jar 
1066 
(not just JRE). 

1067 

47461
5a7903ba2dac
more robust treatment of ISABELLE_HOME on windows: eliminate spaces and funny unicode characters in directory name via DOS~1 notation;
wenzelm
parents:
47453
diff
changeset

1068 

45109  1069 

44801  1070 
New in Isabelle20111 (October 2011) 
1071 
 

41651  1072 

41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

1073 
*** General *** 
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

1074 

44760  1075 
* Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as 
44968  1076 
"isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line. 
44760  1077 

44777  1078 
 Management of multiple theory files directly from the editor 
44760  1079 
buffer store  bypassing the filesystem (no requirement to save 
1080 
files for checking). 

1081 

44777  1082 
 Markup of formal entities within the text buffer, with semantic 
44760  1083 
highlighting, tooltips and hyperlinks to jump to defining source 
1084 
positions. 

1085 

44777  1086 
 Improved text rendering, with sub/superscripts in the source 
1087 
buffer (including support for copy/paste wrt. output panel, HTML 

1088 
theory output and other nonIsabelle text boxes). 

1089 

1090 
 Refined scheduling of proof checking and printing of results, 

44760  1091 
based on interactive editor view. (Note: jEdit folding and 
1092 
narrowing allows to restrict buffer perspectives explicitly.) 

1093 

44777  1094 
 Reduced CPU performance requirements, usable on machines with few 
44760  1095 
cores. 
1096 

44777  1097 
 Reduced memory requirements due to pruning of unused document 
44760  1098 
versions (garbage collection). 
1099 

1100 
See also ~~/src/Tools/jEdit/README.html for further information, 

1101 
including some remaining limitations. 

1102 

44800  1103 
* Theory loader: source files are exclusively located via the master 
1104 
directory of each theory node (where the .thy file itself resides). 

1105 
The global load path (such as src/HOL/Library) has been discontinued. 

1106 
Note that the path element ~~ may be used to reference theories in the 

1107 
Isabelle home folder  for instance, "~~/src/HOL/Library/FuncSet". 

1108 
INCOMPATIBILITY. 

1109 

41955
703ea96b13c6
files are identified via SHA1 digests  discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset

1110 
* Theory loader: source files are identified by content via SHA1 
703ea96b13c6
files are identified via SHA1 digests  discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset

1111 
digests. Discontinued former path/modtime identification and optional 
703ea96b13c6
files are identified via SHA1 digests  discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset

1112 
ISABELLE_FILE_IDENT plugin scripts. 
703ea96b13c6
files are identified via SHA1 digests  discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset

1113 

41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

1114 
* Parallelization of nested Isar proofs is subject to 
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

1115 
Goal.parallel_proofs_threshold (default 100). See also isabelle 
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

1116 
usedir option Q. 
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

1117 

42669
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1118 
* Name space: former unsynchronized references are now proper 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1119 
configuration options, with more conventional names: 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1120 

04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1121 
long_names ~> names_long 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1122 
short_names ~> names_short 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1123 
unique_names ~> names_unique 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1124 

04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1125 
Minor INCOMPATIBILITY, need to declare options in context like this: 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1126 

04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

1127 
declare [[names_unique = false]] 
42358
b47d41d9f4b5
Name_Space: proper configuration options long_names, short_names, unique_names instead of former unsynchronized references;
wenzelm
parents:
42290
diff
changeset

1128 

42502  1129 
* Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note 
1130 
that the result needs to be unique, which means fact specifications 

1131 
may have to be refined after enriching a proof context. 

1132 

44800  1133 
* Attribute "case_names" has been refined: the assumptions in each case 
1134 
can be named now by following the case name with [name1 name2 ...]. 

1135 

44968  1136 
* Isabelle/Isar reference manual has been updated and extended: 
1137 
 "Synopsis" provides a catalog of main Isar language concepts. 

1138 
 Formal references in syntax diagrams, via @{rail} antiquotation. 

1139 
 Updated material from classic "ref" manual, notably about 

1140 
"Classical Reasoner". 

42633  1141 

41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

1142 

41727
ab3f6d76fb23
available_provers ~> supported_provers (for clarity)
blanchet
parents:
41703
diff
changeset

1143 
*** HOL *** 
ab3f6d76fb23
available_provers ~> supported_provers (for clarity)
blanchet
parents:
41703
diff
changeset

1144 

44968  1145 
* Class bot and top require underlying partial order rather than 
44800  1146 
preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY. 
43815
4f6e2965d821
adjusted to tightened specification of classes bot and top
haftmann
parents:
43752
diff
changeset

1147 

43940  1148 
* Class complete_lattice: generalized a couple of lemmas from sets; 
44800  1149 
generalized theorems INF_cong and SUP_cong. New type classes for 
1150 
complete boolean algebras and complete linear orders. Lemmas 

1151 
Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in 

1152 
class complete_linorder. 

1153 

1154 
Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def, 

1155 
Sup_fun_def, Inf_apply, Sup_apply. 

1156 

45088  1157 
Removed redundant lemmas (the right hand side gives hints how to 
1158 
replace them for (metis ...), or (simp only: ...) proofs): 

45041
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1159 

0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1160 
Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right] 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1161 
Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right] 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1162 
Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1163 
Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1164 
Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1165 
Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1166 
Inter_def ~> INF_def, image_def 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1167 
Union_def ~> SUP_def, image_def 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1168 
INT_eq ~> INF_def, and image_def 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1169 
UN_eq ~> SUP_def, and image_def 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1170 
INF_subset ~> INF_superset_mono [OF _ order_refl] 
44800  1171 

1172 
More consistent and comprehensive names: 

1173 

45041
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1174 
INTER_eq_Inter_image ~> INF_def 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

1175 
UNION_eq_Union_image ~> SUP_def 
43872  1176 
INFI_def ~> INF_def 
1177 
SUPR_def ~> SUP_def 

44103
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

1178 
INF_leI ~> INF_lower 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

1179 
INF_leI2 ~> INF_lower2 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

1180 
le_INFI ~> INF_greatest 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

1181 
le_SUPI ~> SUP_upper 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

1182 
le_SUPI2 ~> SUP_upper2 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

1183 
SUP_leI ~> SUP_least 
43873  1184 
INFI_bool_eq ~> INF_bool_eq 
1185 
SUPR_bool_eq ~> SUP_bool_eq 

1186 
INFI_apply ~> INF_apply 

1187 
SUPR_apply ~> SUP_apply 

44103
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

1188 
INTER_def ~> INTER_eq 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

1189 
UNION_def ~> UNION_eq 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

1190 

43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43816
diff
changeset

1191 
INCOMPATIBILITY. 
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43816
diff
changeset

1192 

44973
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1193 
* Renamed theory Complete_Lattice to Complete_Lattices. 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1194 
INCOMPATIBILITY. 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1195 

dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1196 
* Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff, 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1197 
INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot, 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1198 
Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image, 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1199 
Sup_insert are now declared as [simp]. INCOMPATIBILITY. 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1200 

dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1201 
* Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff, 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1202 
compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem, 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1203 
sup_inf_absob, sup_left_idem are now declared as [simp]. Minor 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1204 
INCOMPATIBILITY. 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1205 

44845  1206 
* Added syntactic classes "inf" and "sup" for the respective 
1207 
constants. INCOMPATIBILITY: Changes in the argument order of the 

1208 
(mostly internal) locale predicates for some derived classes. 

1209 

44800  1210 
* Theorem collections ball_simps and bex_simps do not contain theorems 
1211 
referring to UNION any longer; these have been moved to collection 

1212 
UN_ball_bex_simps. INCOMPATIBILITY. 

1213 

1214 
* Theory Archimedean_Field: floor now is defined as parameter of a 

1215 
separate type class floor_ceiling. 

1216 

1217 
* Theory Finite_Set: more coherent development of fold_set locales: 

42874  1218 

1219 
locale fun_left_comm ~> locale comp_fun_commute 

1220 
locale fun_left_comm_idem ~> locale comp_fun_idem 

44800  1221 

1222 
Both use pointfree characterization; interpretation proofs may need 

1223 
adjustment. INCOMPATIBILITY. 

42874  1224 

44800  1225 
* Theory Limits: Type "'a net" has been renamed to "'a filter", in 
44081
730f7cced3a6
rename type 'a net to 'a filter, following standard mathematical terminology
huffman
parents:
44027
diff
changeset

1226 
accordance with standard mathematical terminology. INCOMPATIBILITY. 
730f7cced3a6
rename type 'a net to 'a filter, following standard mathematical terminology
huffman
parents:
44027
diff
changeset

1227 

44800  1228 
* Theory Complex_Main: The locale interpretations for the 
1229 
bounded_linear and bounded_bilinear locales have been removed, in 

1230 
order to reduce the number of duplicate lemmas. Users must use the 

1231 
original names for distributivity theorems, potential INCOMPATIBILITY. 

44282
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1232 

f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1233 
divide.add ~> add_divide_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1234 
divide.diff ~> diff_divide_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1235 
divide.setsum ~> setsum_divide_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1236 
mult.add_right ~> right_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1237 
mult.diff_right ~> right_diff_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1238 
mult_right.setsum ~> setsum_right_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1239 
mult_left.diff ~> left_diff_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1240 

44800  1241 
* Theory Complex_Main: Several redundant theorems have been removed or 
44568
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1242 
replaced by more general versions. INCOMPATIBILITY. 
44522
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1243 

45051
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1244 
real_diff_def ~> minus_real_def 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1245 
real_divide_def ~> divide_real_def 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1246 
real_less_def ~> less_le 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1247 
real_abs_def ~> abs_real_def 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1248 
real_sgn_def ~> sgn_real_def 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1249 
real_mult_commute ~> mult_commute 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1250 
real_mult_assoc ~> mult_assoc 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1251 
real_mult_1 ~> mult_1_left 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1252 
real_add_mult_distrib ~> left_distrib 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1253 
real_zero_not_eq_one ~> zero_neq_one 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1254 
real_mult_inverse_left ~> left_inverse 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1255 
INVERSE_ZERO ~> inverse_zero 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1256 
real_le_refl ~> order_refl 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1257 
real_le_antisym ~> order_antisym 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1258 
real_le_trans ~> order_trans 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1259 
real_le_linear ~> linear 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1260 
real_le_eq_diff ~> le_iff_diff_le_0 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1261 
real_add_left_mono ~> add_left_mono 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1262 
real_mult_order ~> mult_pos_pos 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1263 
real_mult_less_mono2 ~> mult_strict_left_mono 
44822
2690b6de5021
remove duplicate lemma real_of_int_real_of_nat in favor of real_of_int_of_nat_eq
huffman
parents:
44777
diff
changeset

1264 
real_of_int_real_of_nat ~> real_of_int_of_nat_eq 
44522
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1265 
real_0_le_divide_iff ~> zero_le_divide_iff 
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1266 
realpow_two_disj ~> power2_eq_iff 
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1267 
real_squared_diff_one_factored ~> square_diff_one_factored 
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1268 
realpow_two_diff ~> square_diff_square_factored 
44669
8e6cdb9c00a7
remove redundant lemma reals_complete2 in favor of complete_real
huffman
parents:
44666
diff
changeset

1269 
reals_complete2 ~> complete_real 
44749
5b1e1432c320
remove redundant lemma real_sum_squared_expand in favor of power2_sum
huffman
parents:
44748
diff
changeset

1270 
real_sum_squared_expand ~> power2_sum 
44522
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1271 
exp_ln_eq ~> ln_unique 
44711  1272 
expi_add ~> exp_add 
1273 
expi_zero ~> exp_zero 

44522
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1274 
lemma_DERIV_subst ~> DERIV_cong 
44568
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1275 
LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1276 
LIMSEQ_const ~> tendsto_const 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1277 
LIMSEQ_norm ~> tendsto_norm 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1278 
LIMSEQ_add ~> tendsto_add 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1279 
LIMSEQ_minus ~> tendsto_minus 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1280 
LIMSEQ_minus_cancel ~> tendsto_minus_cancel 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1281 
LIMSEQ_diff ~> tendsto_diff 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1282 
bounded_linear.LIMSEQ ~> bounded_linear.tendsto 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1283 
bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1284 
LIMSEQ_mult ~> tendsto_mult 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1285 
LIMSEQ_inverse ~> tendsto_inverse 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1286 
LIMSEQ_divide ~> tendsto_divide 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1287 
LIMSEQ_pow ~> tendsto_power 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1288 
LIMSEQ_setsum ~> tendsto_setsum 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1289 
LIMSEQ_setprod ~> tendsto_setprod 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1290 
LIMSEQ_norm_zero ~> tendsto_norm_zero_iff 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1291 
LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1292 
LIMSEQ_imp_rabs ~> tendsto_rabs 
44710  1293 
LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus] 
1294 
LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const] 

1295 
LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const] 

44748
7f6838b3474a
remove redundant lemma LIMSEQ_Complex in favor of tendsto_Complex
huffman
parents:
44711
diff
changeset

1296 
LIMSEQ_Complex ~> tendsto_Complex 
44568
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1297 
LIM_ident ~> tendsto_ident_at 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1298 
LIM_const ~> tendsto_const 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1299 
LIM_add ~> tendsto_add 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1300 
LIM_add_zero ~> tendsto_add_zero 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1301 
LIM_minus ~> tendsto_minus 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1302 
LIM_diff ~> tendsto_diff 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1303 
LIM_norm ~> tendsto_norm 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1304 
LIM_norm_zero ~> tendsto_norm_zero 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1305 
LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1306 
LIM_norm_zero_iff ~> tendsto_norm_zero_iff 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1307 
LIM_rabs ~> tendsto_rabs 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1308 
LIM_rabs_zero ~> tendsto_rabs_zero 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1309 
LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1310 
LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1311 
LIM_compose ~> tendsto_compose 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1312 
LIM_mult ~> tendsto_mult 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1313 
LIM_scaleR ~> tendsto_scaleR 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1314 
LIM_of_real ~> tendsto_of_real 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1315 
LIM_power ~> tendsto_power 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1316 
LIM_inverse ~> tendsto_inverse 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1317 
LIM_sgn ~> tendsto_sgn 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1318 
isCont_LIM_compose ~> isCont_tendsto_compose 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1319 
bounded_linear.LIM ~> bounded_linear.tendsto 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1320 
bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1321 
bounded_bilinear.LIM ~> bounded_bilinear.tendsto 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1322 
bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1323 
bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1324 
bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1325 
LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at] 
44522
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1326 

44967  1327 
* Theory Complex_Main: The definition of infinite series was 
1328 
generalized. Now it is defined on the type class {topological_space, 

1329 
comm_monoid_add}. Hence it is useable also for extended real numbers. 

42484  1330 

44908  1331 
* Theory Complex_Main: The complex exponential function "expi" is now 
1332 
a typeconstrained abbreviation for "exp :: complex => complex"; thus 

1333 
several polymorphic lemmas about "exp" are now applicable to "expi". 

1334 

44968  1335 
* Code generation: 
1336 

1337 
 Theory Library/Code_Char_ord provides native ordering of 

1338 
characters in the target language. 

1339 

1340 
 Commands code_module and code_library are legacy, use export_code 

1341 
instead. 

1342 

1343 
 Method "evaluation" is legacy, use method "eval" instead. 

1344 

1345 
 Legacy evaluator "SML" is deactivated by default. May be 

1346 
reactivated by the following theory command: 

1347 

1348 
setup {* Value.add_evaluator ("SML", Codegen.eval_term) *} 

1349 

1350 
* Declare ext [intro] by default. Rare INCOMPATIBILITY. 

1351 

45088  1352 
* New proof method "induction" that gives induction hypotheses the 
1353 
name "IH", thus distinguishing them from further hypotheses that come 

1354 
from rule induction. The latter are still called "hyps". Method 

1355 
"induction" is a thin wrapper around "induct" and follows the same 

1356 
syntax. 

1357 

44968  1358 
* Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is 
1359 
still available as a legacy feature for some time. 

1360 

1361 
* Nitpick: 

1362 
 Added "need" and "total_consts" options. 

1363 
 Reintroduced "show_skolems" option by popular demand. 

1364 
 Renamed attribute: nitpick_def ~> nitpick_unfold. 

1365 
INCOMPATIBILITY. 

1366 

1367 
* Sledgehammer: 

1368 
 Use quasisound (and efficient) translations by default. 

1369 
 Added support for the following provers: EToFoF, LEOII, 

1370 
Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax. 

1371 
 Automatically preplay and minimize proofs before showing them if 

1372 
this can be done within reasonable time. 

1373 
 sledgehammer available_provers ~> sledgehammer supported_provers. 

1374 
INCOMPATIBILITY. 

1375 
 Added "preplay_timeout", "slicing", "type_enc", "sound", 

1376 
"max_mono_iters", and "max_new_mono_instances" options. 

1377 
 Removed "explicit_apply" and "full_types" options as well as "Full 

1378 
Types" Proof General menu item. INCOMPATIBILITY. 

1379 

1380 
* Metis: 

1381 
 Removed "metisF"  use "metis" instead. INCOMPATIBILITY. 

1382 
 Obsoleted "metisFT"  use "metis (full_types)" instead. 

1383 
INCOMPATIBILITY. 

1384 

1385 
* Command 'try': 

1386 
 Renamed 'try_methods' and added "simp:", "intro:", "dest:", and 

1387 
"elim:" options. INCOMPATIBILITY. 

1388 
 Introduced 'try' that not only runs 'try_methods' but also 

1389 
'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'. 

1390 

1391 
* Quickcheck: 

1392 
 Added "eval" option to evaluate terms for the found counterexample 

1393 
(currently only supported by the default (exhaustive) tester). 

1394 
 Added postprocessing of terms to obtain readable counterexamples 

1395 
(currently only supported by the default (exhaustive) tester). 

1396 
 New counterexample generator quickcheck[narrowing] enables 

1397 
narrowingbased testing. Requires the Glasgow Haskell compiler 

1398 
with its installation location defined in the Isabelle settings 

1399 
environment as ISABELLE_GHC. 

1400 
 Removed quickcheck tester "SML" based on the SML code generator 

1401 
(formly in HOL/Library). 

1402 

1403 
* Function package: discontinued option "tailrec". INCOMPATIBILITY, 

1404 
use 'partial_function' instead. 

1405 
