author  haftmann 
Mon, 11 Aug 2008 14:50:04 +0200  
changeset 27826  4e50590ea9bc 
parent 27823  52971512d1a2 
child 27979  58415a0de327 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

27122  4 
New in this Isabelle version 
5 
 

27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

6 

27599  7 
*** General *** 
8 

9 
* Generalized Isar history, with support for linear undo, direct state 

10 
addressing etc. 

27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

11 

27191  12 
* Recovered hiding of consts, which was accidentally broken in 
13 
Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really 

14 
makes c inaccessible; consider using ``hide (open) const c'' instead. 

15 

27599  16 
* Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML 
17 
interface instead. 

18 

19 

20 
*** Pure *** 

21 

27761
b95e9ba0ca1d
Interpretation command (theory/proof context) no longer simplifies goal.
ballarin
parents:
27717
diff
changeset

22 
* Dropped "locale (open)". INCOMPATBILITY. 
b95e9ba0ca1d
Interpretation command (theory/proof context) no longer simplifies goal.
ballarin
parents:
27717
diff
changeset

23 

b95e9ba0ca1d
Interpretation command (theory/proof context) no longer simplifies goal.
ballarin
parents:
27717
diff
changeset

24 
* Command 'interpretation' no longer attempts to simplify goal. 
b95e9ba0ca1d
Interpretation command (theory/proof context) no longer simplifies goal.
ballarin
parents:
27717
diff
changeset

25 
INCOMPATIBILITY: in rare situations the generated goal differs. Use 
b95e9ba0ca1d
Interpretation command (theory/proof context) no longer simplifies goal.
ballarin
parents:
27717
diff
changeset

26 
methods intro_locales and unfold_locales to clarify. 
27681  27 

27651
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

28 
* Command 'instance': attached definitions no longer accepted. 
27141
9bfcdb1905e1
* Attributes cases, induct, coinduct support del option.
wenzelm
parents:
27122
diff
changeset

29 
INCOMPATIBILITY, use proper 'instantiation' target. 
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

30 

791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

31 
* Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY. 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

32 

791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

33 

27381  34 
*** Document preparation *** 
35 

36 
* Antiquotation @{lemma} now imitates a regular terminal proof, 

27392  37 
demanding keyword 'by' and supporting the full method expression 
27519
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

38 
syntax just like the Isar command 'by'. 
27381  39 

40 

27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

41 
*** HOL *** 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

42 

27823  43 
* HOL/Orderings: class "wellorder" moved here, with explicit induction rule 
44 
"less_induct" as assumption. For instantiation of "wellorder" by means 

45 
of predicate "wf", use rule wf_wellorderI. INCOMPATIBILITY. 

46 

27793  47 
* HOL/Orderings: added class "preorder" as superclass of "order". 
48 
INCOMPATIBILITY: Instantiation proofs for order, linorder 

49 
etc. slightly changed. Some theorems named order_class.* now named 

50 
preorder_class.*. 

51 

52 
* HOL/Ring_and_Field and HOL/Divides: Definition of "op dvd" has been 

53 
moved to separate class dvd in Ring_and_Field; a couple of lemmas on 

54 
dvd has been generalized to class comm_semiring_1. Likewise a bunch 

55 
of lemmas from Divides has been generalized from nat to class 

56 
semiring_div. INCOMPATIBILITY. This involves the following theorem 

57 
renames resulting from duplicate elimination: 

27651
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

58 

16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

59 
dvd_def_mod ~> dvd_eq_mod_eq_0 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

60 
zero_dvd_iff ~> dvd_0_left_iff 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

61 
DIVISION_BY_ZERO_DIV ~> div_by_0 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

62 
DIVISION_BY_ZERO_MOD ~> mod_by_0 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

63 
mult_div ~> div_mult_self2_is_id 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

64 
mult_mod ~> mod_mult_self2_is_0 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

65 

27599  66 
* HOL/Library/GCD: Curried operations gcd, lcm (for nat) and zgcd, 
67 
zlcm (for int); carried together from various gcd/lcm developements in 

68 
the HOL Distribution. zgcd and zlcm replace former igcd and ilcm; 

69 
corresponding theorems renamed accordingly. INCOMPATIBILY. To 

70 
recover tupled syntax, use syntax declarations like: 

27556  71 

72 
hide (open) const gcd 

73 
abbreviation gcd where 

74 
"gcd == (%(a, b). GCD.gcd a b)" 

75 
notation (output) 

76 
GCD.gcd ("gcd '(_, _')") 

77 

78 
(analogously for lcm, zgcd, zlcm). 

79 

80 
* HOL/Real/Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY. 

27551  81 

27651
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

82 
* New ML antiquotation @{code}: takes constant as argument, generates 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

83 
corresponding code in background and inserts name of the corresponding 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

84 
resulting ML value/function/datatype constructor binding in place. 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

85 
All occurrences of @{code} with a single ML block are generated 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

86 
simultaneously. Provides a generic and safe interface for 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

87 
instrumentalizing code generation. See HOL/ex/Code_Antiq for a toy 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

88 
example, or HOL/Complex/ex/ReflectedFerrack for a more ambitious 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

89 
application. In future you ought refrain from adhoc compiling 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

90 
generated SML code on the ML toplevel. Note that (for technical 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

91 
reasons) @{code} cannot refer to constants for which userdefined 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

92 
serializations are set. Refer to the corresponding ML counterpart 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

93 
directly in that cases. 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

94 

27424  95 
* Integrated image HOLComplex with HOL. Entry points Main.thy and 
96 
Complex_Main.thy remain as they are. 

97 

27599  98 
* New image HOLPlain provides a minimal HOL with the most important 
99 
tools available (inductive, datatype, primrec, ...). By convention 

100 
the corresponding theory Plain should be ancestor of every further 

101 
(library) theory. Some library theories now have ancestor Plain 

102 
(instead of Main), thus theory Main occasionally has to be imported 

103 
explicitly. 

27421  104 

27324
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset

105 
* Methods "case_tac" and "induct_tac" now refer to the very same rules 
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset

106 
as the structured Isar versions "cases" and "induct", cf. the 
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset

107 
corresponding "cases" and "induct" attributes. Mutual induction rules 
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset

108 
are now presented as a list of individual projections 
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset

109 
(e.g. foo_bar.inducts for types foo and bar); the old format with 
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset

110 
explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in 
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset

111 
rare situations a different rule is selected  notably nested tuple 
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset

112 
elimination instead of former prod.exhaust: use explicit (case_tac t 
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset

113 
rule: prod.exhaust) here. 
27122  114 

27141
9bfcdb1905e1
* Attributes cases, induct, coinduct support del option.
wenzelm
parents:
27122
diff
changeset

115 
* Attributes "cases", "induct", "coinduct" support "del" option. 
9bfcdb1905e1
* Attributes cases, induct, coinduct support del option.
wenzelm
parents:
27122
diff
changeset

116 

27122  117 
* Removed fact "case_split_thm", which duplicates "case_split". 
118 

119 
* Command 'rep_datatype': instead of theorem names the command now 

120 
takes a list of terms denoting the constructors of the type to be 

121 
represented as datatype. The characteristic theorems have to be 

122 
proven. INCOMPATIBILITY. Also observe that the following theorems 

123 
have disappeared in favour of existing ones: 

124 

27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

125 
unit_induct ~> unit.induct 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

126 
prod_induct ~> prod.induct 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

127 
sum_induct ~> sum.induct 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

128 
Suc_Suc_eq ~> nat.inject 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

129 
Suc_not_Zero Zero_not_Suc ~> nat.distinct 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

130 

27122  131 
* Library/Nat_Infinity: added addition, numeral syntax and more 
132 
instantiations for algebraic structures. Removed some duplicate 

133 
theorems. Changes in simp rules. INCOMPATIBILITY. 

27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

134 

791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

135 

27696  136 
*** HOLAlgebra *** 
137 

27713
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset

138 
* New locales for orders and lattices where the equivalence relation 
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset

139 
is not restricted to equality. INCOMPATIBILITY: all order and 
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset

140 
lattice locales use a record structure with field eq for the 
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset

141 
equivalence. 
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset

142 

95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset

143 
* New theory of factorial domains. 
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset

144 

27696  145 
* Units_l_inv and Units_r_inv are now simprules by default. 
146 
INCOMPATIBILITY. Simplifier proof that require deletion of l_inv 

147 
and/or r_inv will now also require deletion of these lemmas. 

148 

149 
* Renamed the following theorems. INCOMPATIBILITY. 

150 
UpperD ~> Upper_memD 

151 
LowerD ~> Lower_memD 

152 
least_carrier ~> least_closed 

153 
greatest_carrier ~> greatest_closed 

154 
greatest_Lower_above ~> greatest_Lower_below 

27717
21bbd410ba04
Generalised polynomial lemmas from cring to ring.
ballarin
parents:
27713
diff
changeset

155 
one_zero ~> carrier_one_zero 
21bbd410ba04
Generalised polynomial lemmas from cring to ring.
ballarin
parents:
27713
diff
changeset

156 
one_not_zero ~> carrier_one_not_zero (collision with assumption) 
27696  157 

27793  158 

27485  159 
*** HOLNSA *** 
160 

161 
* Created new image HOLNSA, containing theories of nonstandard 

162 
analysis which were previously part of HOLComplex. Entry point 

163 
Hyperreal.thy remains valid, but theories formerly using 

164 
Complex_Main.thy should now use new entry point Hypercomplex.thy. 

165 

166 

27704  167 
*** ZF *** 
168 

169 
* Proof of Zorn's Lemma for partial orders. 

170 

171 

27246
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset

172 
*** ML *** 
27436  173 

27246
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset

174 
* Rules and tactics that read instantiations (read_instantiate, 
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset

175 
res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof 
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset

176 
context, which is required for parsing and typechecking. Moreover, 
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset

177 
the variables are specified as plain indexnames, not string encodings 
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset

178 
thereof. INCOMPATIBILITY. 
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset

179 

27287  180 
* Disposed old type and term read functions (Sign.read_def_typ, 
181 
Sign.read_typ, Sign.read_def_terms, Sign.read_term, 

182 
Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should 

183 
use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global, 

27269  184 
Syntax.read_term_global etc.; see also OldGoals.read_term as last 
185 
resort for legacy applications. 

186 

27380  187 
* Antiquotations: blockstructured compilation context indicated by 
27391  188 
\<lbrace> ... \<rbrace>; additional antiquotation forms: 
189 

27519
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

190 
@{let ?pat = term}  term abbreviation (HO matching) 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

191 
@{note name = fact}  fact abbreviation 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

192 
@{thm fact}  singleton fact (with attributes) 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

193 
@{thms fact}  general fact (with attributes) 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

194 
@{lemma prop by method}  singleton goal 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

195 
@{lemma prop by meth1 meth2}  singleton goal 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

196 
@{lemma prop1 ... propN by method}  general goal 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

197 
@{lemma prop1 ... propN by meth1 meth2}  general goal 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

198 
@{lemma (open) ...}  open derivation 
27380  199 

27246
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset

200 

27143  201 

27008  202 
New in Isabelle2008 (June 2008) 
203 
 

25464
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset

204 

25522  205 
*** General *** 
206 

27061  207 
* The Isabelle/Isar Reference Manual (isarref) has been reorganized 
208 
and updated, with formally checked references as hyperlinks. 

209 

25994  210 
* Theory loader: use_thy (and similar operations) no longer set the 
211 
implicit ML context, which was occasionally hard to predict and in 

212 
conflict with concurrency. INCOMPATIBILITY, use ML within Isar which 

213 
provides a proper context already. 

214 

26323
73efc70edeef
theory loader: discontinued *attached* ML scripts;
wenzelm
parents:
26315
diff
changeset

215 
* Theory loader: oldstyle ML proof scripts being *attached* to a thy 
73efc70edeef
theory loader: discontinued *attached* ML scripts;
wenzelm
parents:
26315
diff
changeset

216 
file are no longer supported. INCOMPATIBILITY, regular 'uses' and 
73efc70edeef
theory loader: discontinued *attached* ML scripts;
wenzelm
parents:
26315
diff
changeset

217 
'use' within a theory file will do the job. 
73efc70edeef
theory loader: discontinued *attached* ML scripts;
wenzelm
parents:
26315
diff
changeset

218 

26650  219 
* Name space merge now observes canonical order, i.e. the second space 
220 
is inserted into the first one, while existing entries in the first 

26659  221 
space take precedence. INCOMPATIBILITY in rare situations, may try to 
26650  222 
swap theory imports. 
223 

27067  224 
* Syntax: symbol \<chi> is now considered a letter. Potential 
225 
INCOMPATIBILITY in identifier syntax etc. 

226 

227 
* Outer syntax: string tokens no longer admit escaped white space, 

228 
which was an accidental (undocumented) feature. INCOMPATIBILITY, use 

229 
white space without escapes. 

230 

231 
* Outer syntax: string tokens may contain arbitrary character codes 

232 
specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for 

233 
"foo_bar". 

234 

25522  235 

25502  236 
*** Pure *** 
237 

26718  238 
* Contextdependent token translations. Default setup reverts locally 
239 
fixed variables, and adds hilite markup for undeclared frees. 

240 

26681  241 
* Unused theorems can be found using the new command 'unused_thms'. 
242 
There are three ways of invoking it: 

243 

244 
(1) unused_thms 

245 
Only finds unused theorems in the current theory. 

246 

247 
(2) unused_thms thy_1 ... thy_n  

248 
Finds unused theorems in the current theory and all of its ancestors, 

249 
excluding the theories thy_1 ... thy_n and all of their ancestors. 

250 

251 
(3) unused_thms thy_1 ... thy_n  thy'_1 ... thy'_m 

252 
Finds unused theorems in the theories thy'_1 ... thy'_m and all of 

253 
their ancestors, excluding the theories thy_1 ... thy_n and all of 

254 
their ancestors. 

255 

26718  256 
In order to increase the readability of the list produced by 
257 
unused_thms, theorems that have been created by a particular instance 

26874  258 
of a theory command such as 'inductive' or 'function' are considered 
259 
to belong to the same "group", meaning that if at least one theorem in 

26718  260 
this group is used, the other theorems in the same group are no longer 
261 
reported as unused. Moreover, if all theorems in the group are 

262 
unused, only one theorem in the group is displayed. 

263 

264 
Note that proof objects have to be switched on in order for 

265 
unused_thms to work properly (i.e. !proofs must be >= 1, which is 

26874  266 
usually the case when using Proof General with the default settings). 
26681  267 

26650  268 
* Authentic naming of facts disallows adhoc overwriting of previous 
269 
theorems within the same name space. INCOMPATIBILITY, need to remove 

270 
duplicate fact bindings, or even accidental fact duplications. Note 

271 
that tools may maintain dynamically scoped facts systematically, using 

272 
PureThy.add_thms_dynamic. 

273 

26660  274 
* Command 'hide' now allows to hide from "fact" name space as well. 
275 

26496
49ae9456eba9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26495
diff
changeset

276 
* Eliminated destructive theorem database, simpset, claset, and 
49ae9456eba9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26495
diff
changeset

277 
clasimpset. Potential INCOMPATIBILITY, really need to observe linear 
49ae9456eba9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26495
diff
changeset

278 
update of theories within ML code. 
26479  279 

26955
ebbaa935eae0
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm
parents:
26925
diff
changeset

280 
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory. 
ebbaa935eae0
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm
parents:
26925
diff
changeset

281 
INCOMPATIBILITY, objectlogics depending on former Pure require 
ebbaa935eae0
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm
parents:
26925
diff
changeset

282 
additional setup PureThy.old_appl_syntax_setup; objectlogics 
ebbaa935eae0
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm
parents:
26925
diff
changeset

283 
depending on former CPure need to refer to Pure. 
26650  284 

26495  285 
* Commands 'use' and 'ML' are now purely functional, operating on 
26479  286 
theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML' 
287 
instead. Added 'ML_val' as mere diagnostic replacement for 'ML'. 

288 
INCOMPATIBILITY. 

289 

26874  290 
* Command 'setup': discontinued implicit version with ML reference. 
26434  291 

25970
9053fd546501
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs here;
wenzelm
parents:
25961
diff
changeset

292 
* Instantiation target allows for simultaneous specification of class 
9053fd546501
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs here;
wenzelm
parents:
25961
diff
changeset

293 
instance operations together with an instantiation proof. 
9053fd546501
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs here;
wenzelm
parents:
25961
diff
changeset

294 
Typechecking phase allows to refer to class operations uniformly. 
27067  295 
See src/HOL/Complex/Complex.thy for an Isar example and 
296 
src/HOL/Library/Eval.thy for an ML example. 

25502  297 

26201
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset

298 
* Indexing of literal facts: be more serious about including only 
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset

299 
facts from the visible specification/proof context, but not the 
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset

300 
background context (locale etc.). Affects `prop` notation and method 
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset

301 
"fact". INCOMPATIBILITY: need to name facts explicitly in rare 
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset

302 
situations. 
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset

303 

26925
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset

304 
* Method "cases", "induct", "coinduct": removed obsolete/undocumented 
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset

305 
"(open)" option, which used to expose internal bound variables to the 
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset

306 
proof text. 
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset

307 

ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset

308 
* Isar statements: removed obsolete case "rule_context". 
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset

309 
INCOMPATIBILITY, better use explicit fixes/assumes. 
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset

310 

26874  311 
* Locale proofs: default proof step now includes 'unfold_locales'; 
312 
hence 'proof' without argument may be used to unfold locale 

313 
predicates. 

26765  314 

315 

26762  316 
*** Document preparation *** 
317 

26914  318 
* Simplified pdfsetup.sty: color/hyperref is used unconditionally for 
319 
both pdf and dvi (hyperlinks usually work in xdvi as well); removed 

320 
obsolete thumbpdf setup (contemporary PDF viewers do this on the 

321 
spot); renamed link color from "darkblue" to "linkcolor" (default 

26920  322 
value unchanged, can be redefined via \definecolor); no longer sets 
323 
"a4paper" option (unnecessary or even intrusive). 

26914  324 

27008  325 
* Antiquotation @{lemma A method} proves proposition A by the given 
326 
method (either a method name or a method name plus (optional) method 

327 
arguments in parentheses) and prints A just like @{prop A}. 

26762  328 

329 

25464
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset

330 
*** HOL *** 
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset

331 

27067  332 
* New primrec package. Specification syntax conforms in style to 
333 
definition/function/.... No separate induction rule is provided. The 

334 
"primrec" command distinguishes oldstyle and newstyle specifications 

335 
by syntax. The former primrec package is now named OldPrimrecPackage. 

336 
When adjusting theories, beware: constants stemming from newstyle 

337 
primrec specifications have authentic syntax. 

338 

339 
* Metis prover is now an order of magnitude faster, and also works 

340 
with multithreading. 

341 

342 
* Metis: the maximum number of clauses that can be produced from a 

343 
theorem is now given by the attribute max_clauses. Theorems that 

344 
exceed this number are ignored, with a warning printed. 

345 

346 
* Sledgehammer no longer produces structured proofs by default. To 

347 
enable, declare [[sledgehammer_full = true]]. Attributes 

348 
reconstruction_modulus, reconstruction_sorts renamed 

349 
sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY. 

350 

27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

351 
* Method "induct_scheme" derives userspecified induction rules 
27067  352 
from wellfounded induction and completeness of patterns. This factors 
353 
out some operations that are done internally by the function package 

354 
and makes them available separately. See 

355 
src/HOL/ex/Induction_Scheme.thy for examples. 

356 

357 
* More flexible generation of measure functions for termination 

358 
proofs: Measure functions can be declared by proving a rule of the 

359 
form "is_measure f" and giving it the [measure_function] attribute. 

360 
The "is_measure" predicate is logically meaningless (always true), and 

361 
just guides the heuristic. To find suitable measure functions, the 

362 
termination prover sets up the goal "is_measure ?f" of the appropriate 

363 
type and generates all solutions by prologstyle backwards proof using 

364 
the declared rules. 

365 

366 
This setup also deals with rules like 

367 

368 
"is_measure f ==> is_measure (list_size f)" 

369 

370 
which accommodates nested datatypes that recurse through lists. 

371 
Similar rules are predeclared for products and option types. 

372 

26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

373 
* Turned the type of sets "'a set" into an abbreviation for "'a => bool" 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

374 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

375 
INCOMPATIBILITIES: 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

376 

27008  377 
 Definitions of overloaded constants on sets have to be replaced by 
378 
definitions on => and bool. 

26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

379 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

380 
 Some definitions of overloaded operators on sets can now be proved 
27008  381 
using the definitions of the operators on => and bool. Therefore, 
382 
the following theorems have been renamed: 

26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

383 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

384 
subset_def > subset_eq 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

385 
psubset_def > psubset_eq 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

386 
set_diff_def > set_diff_eq 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

387 
Compl_def > Compl_eq 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

388 
Sup_set_def > Sup_set_eq 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

389 
Inf_set_def > Inf_set_eq 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

390 
sup_set_def > sup_set_eq 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

391 
inf_set_def > inf_set_eq 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

392 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

393 
 Due to the incompleteness of the HO unification algorithm, some 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

394 
rules such as subst may require manual instantiation, if some of 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

395 
the unknowns in the rule is a set. 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

396 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

397 
 Higher order unification and forward proofs: 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

398 
The proof pattern 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

399 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

400 
have "P (S::'a set)" <...> 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

401 
then have "EX S. P S" .. 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

402 

27008  403 
no longer works (due to the incompleteness of the HO unification 
404 
algorithm) and must be replaced by the pattern 

26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

405 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

406 
have "EX S. P S" 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

407 
proof 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

408 
show "P S" <...> 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

409 
qed 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

410 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

411 
 Calculational reasoning with subst (or similar rules): 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

412 
The proof pattern 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

413 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

414 
have "P (S::'a set)" <...> 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

415 
also have "S = T" <...> 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

416 
finally have "P T" . 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

417 

27008  418 
no longer works (for similar reasons as the previous example) and 
419 
must be replaced by something like 

26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

420 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

421 
have "P (S::'a set)" <...> 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

422 
moreover have "S = T" <...> 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

423 
ultimately have "P T" by simp 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

424 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

425 
 Tactics or packages written in ML code: 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

426 
Code performing pattern matching on types via 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

427 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

428 
Type ("set", [T]) => ... 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

429 

27008  430 
must be rewritten. Moreover, functions like strip_type or 
431 
binder_types no longer return the right value when applied to a 

432 
type of the form 

26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

433 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

434 
T1 => ... => Tn => U => bool 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

435 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

436 
rather than 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

437 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

438 
T1 => ... => Tn => U set 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

439 

26874  440 
* Merged theories Wellfounded_Recursion, Accessible_Part and 
27067  441 
Wellfounded_Relations to theory Wellfounded. 
26748
4d51ddd6aa5c
Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
26724
diff
changeset

442 

26513  443 
* Explicit class "eq" for executable equality. INCOMPATIBILITY. 
444 

26874  445 
* Class finite no longer treats UNIV as class parameter. Use class 
446 
enum from theory Library/Enum instead to achieve a similar effect. 

26445  447 
INCOMPATIBILITY. 
448 

26874  449 
* Theory List: rule list_induct2 now has explicitly named cases "Nil" 
450 
and "Cons". INCOMPATIBILITY. 

451 

26422
d5883907c514
HOL (and FOL): renamed variables in rules imp_elim and swap;
wenzelm
parents:
26401
diff
changeset

452 
* HOL (and FOL): renamed variables in rules imp_elim and swap. 
d5883907c514
HOL (and FOL): renamed variables in rules imp_elim and swap;
wenzelm
parents:
26401
diff
changeset

453 
Potential INCOMPATIBILITY. 
d5883907c514
HOL (and FOL): renamed variables in rules imp_elim and swap;
wenzelm
parents:
26401
diff
changeset

454 

26874  455 
* Theory Product_Type: duplicated lemmas split_Pair_apply and 
456 
injective_fst_snd removed, use split_eta and prod_eqI instead. 

457 
Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY. 

26355  458 

26335
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

459 
* Theory Nat: removed redundant lemmas that merely duplicate lemmas of 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

460 
the same name in theory Orderings: 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

461 

961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

462 
less_trans 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

463 
less_linear 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

464 
le_imp_less_or_eq 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

465 
le_less_trans 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

466 
less_le_trans 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

467 
less_not_sym 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

468 
less_asym 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

469 

961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

470 
Renamed less_imp_le to less_imp_le_nat, and less_irrefl to 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

471 
less_irrefl_nat. Potential INCOMPATIBILITY due to more general types 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

472 
and different variable names. 
26315
cb3badaa192e
removed redundant less_trans, less_linear, le_imp_less_or_eq, le_less_trans, less_le_trans (cf. Orderings.thy);
wenzelm
parents:
26231
diff
changeset

473 

26231  474 
* Library/Option_ord.thy: Canonical order on option type. 
475 

27008  476 
* Library/RBT.thy: Redblack trees, an efficient implementation of 
477 
finite maps. 

26197  478 

26231  479 
* Library/Countable.thy: Type class for countable types. 
480 

26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

481 
* Theory Int: The representation of numerals has changed. The infix 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

482 
operator BIT and the bit datatype with constructors B0 and B1 have 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

483 
disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

484 
place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

485 
involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1" 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

486 
accordingly. 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

487 

cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

488 
* Theory Nat: definition of <= and < on natural numbers no longer 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

489 
depend on wellfounded relations. INCOMPATIBILITY. Definitions 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

490 
le_def and less_def have disappeared. Consider lemmas not_less 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

491 
[symmetric, where ?'a = nat] and less_eq [symmetric] instead. 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

492 

cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

493 
* Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

494 
(whose purpose mainly is for various fold_set functionals) have been 
26874  495 
abandoned in favor of the existing algebraic classes 
26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

496 
ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult, 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

497 
lower_semilattice (resp. upper_semilattice) and linorder. 
26139  498 
INCOMPATIBILITY. 
26041
c2e15e65165f
locales ACf, ACIf, ACIfSL and ACIfSLlin have been abandoned in favour of the existing algebraic classes ab_semigroup_mult, ab_semigroup_idem_mult, lower_semilattice (resp. uper_semilattice) and linorder
haftmann
parents:
26013
diff
changeset

499 

26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

500 
* Theory Transitive_Closure: induct and cases rules now declare proper 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

501 
case_names ("base" and "step"). INCOMPATIBILITY. 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

502 

cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

503 
* Theorem Inductive.lfp_ordinal_induct generalized to complete 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

504 
lattices. The form setspecific version is available as 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

505 
Inductive.lfp_ordinal_induct_set. 
26013
8764a1f1253b
Theorem Inductive.lfp_ordinal_induct generalized to complete lattices
haftmann
parents:
26006
diff
changeset

506 

26874  507 
* Renamed theorems "power.simps" to "power_int.simps". 
27067  508 
INCOMPATIBILITY. 
25961  509 

26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

510 
* Class semiring_div provides basic abstract properties of semirings 
25942  511 
with division and modulo operations. Subsumes former class dvd_mod. 
512 

26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

513 
* Merged theories IntDef, Numeral and IntArith into unified theory 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

514 
Int. INCOMPATIBILITY. 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

515 

cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

516 
* Theory Library/Code_Index: type "index" now represents natural 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

517 
numbers rather than integers. INCOMPATIBILITY. 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

518 

cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

519 
* New class "uminus" with operation "uminus" (split of from class 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

520 
"minus" which now only has operation "minus", binary). 
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25900
diff
changeset

521 
INCOMPATIBILITY. 
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25900
diff
changeset

522 

25522  523 
* Constants "card", "internal_split", "option_map" now with authentic 
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25900
diff
changeset

524 
syntax. INCOMPATIBILITY. 
25522  525 

526 
* Definitions subset_def, psubset_def, set_diff_def, Compl_def, 

527 
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def, 

528 
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def, 

529 
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def, 

530 
Sup_set_def, le_def, less_def, option_map_def now with object 

25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25900
diff
changeset

531 
equality. INCOMPATIBILITY. 
25464
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset

532 

25705  533 
* Records. Removed K_record, and replaced it by pure lambda term 
25726
9728f319ffc6
* Metis prover an order of magnitude faster, works with multithreading.
wenzelm
parents:
25712
diff
changeset

534 
%x. c. The simplifier setup is now more robust against eta expansion. 
25705  535 
INCOMPATIBILITY: in cases explicitly referring to K_record. 
25464
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset

536 

27067  537 
* Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}. 
538 

539 
* Library/ListVector: new theory of arithmetic vector operations. 

540 

541 
* Library/Order_Relation: new theory of various orderings as sets of 

542 
pairs. Defines preorders, partial orders, linear orders and 

543 
wellorders on sets and on types. 

26877  544 

25726
9728f319ffc6
* Metis prover an order of magnitude faster, works with multithreading.
wenzelm
parents:
25712
diff
changeset

545 

26197  546 
*** ZF *** 
547 

26874  548 
* Renamed some theories to allow to loading both ZF and HOL in the 
549 
same session: 

550 

551 
Datatype > Datatype_ZF 

552 
Inductive > Inductive_ZF 

553 
Int > Int_ZF 

554 
IntDiv > IntDiv_ZF 

555 
Nat > Nat_ZF 

556 
List > List_ZF 

557 
Main > Main_ZF 

558 

559 
INCOMPATIBILITY: ZF theories that import individual theories below 

560 
Main might need to be adapted. Regular theory Main is still 

561 
available, as trivial extension of Main_ZF. 

26197  562 

563 

25737
84c92fc48e36
``print mode'' is now a threadlocal value derived from a global template;
wenzelm
parents:
25726
diff
changeset

564 
*** ML *** 
84c92fc48e36
``print mode'' is now a threadlocal value derived from a global template;
wenzelm
parents:
25726
diff
changeset

565 

27067  566 
* ML within Isar: antiquotation @{const name} or @{const 
567 
name(typargs)} produces staticallychecked Const term. 

568 

26401
e7a94081dce7
Functor NamedThmsFun: data is available to the user as dynamic fact;
wenzelm
parents:
26387
diff
changeset

569 
* Functor NamedThmsFun: data is available to the user as dynamic fact 
26724
ff6ff3a9010e
NamedThmsFun: removed obsolete print command  facts are accesible via dynamic name;
wenzelm
parents:
26718
diff
changeset

570 
(of the same name). Removed obsolete print command. 
26401
e7a94081dce7
Functor NamedThmsFun: data is available to the user as dynamic fact;
wenzelm
parents:
26387
diff
changeset

571 

27067  572 
* Removed obsolete "use_legacy_bindings" function. 
26188  573 

25737
84c92fc48e36
``print mode'' is now a threadlocal value derived from a global template;
wenzelm
parents:
25726
diff
changeset

574 
* The ``print mode'' is now a threadlocal value derived from a global 
84c92fc48e36
``print mode'' is now a threadlocal value derived from a global template;
wenzelm
parents:
25726
diff
changeset

575 
template (the former print_mode reference), thus access becomes 
84c92fc48e36
``print mode'' is now a threadlocal value derived from a global template;
wenzelm
parents:
25726
diff
changeset

576 
noncritical. The global print_mode reference is for session 
84c92fc48e36
``print mode'' is now a threadlocal value derived from a global template;
wenzelm
parents:
25726
diff
changeset

577 
management only; usercode should use print_mode_value, 
84c92fc48e36
``print mode'' is now a threadlocal value derived from a global template;
wenzelm
parents:
25726
diff
changeset

578 
print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY. 
84c92fc48e36
``print mode'' is now a threadlocal value derived from a global template;
wenzelm
parents:
25726
diff
changeset

579 

26874  580 
* Functions system/system_out provide a robust way to invoke external 
27008  581 
shell commands, with propagation of interrupts (requires Poly/ML 5.2). 
26874  582 
Do not use OS.Process.system etc. from the basis library! 
26222
edf6473ac9e9
* system/system_out provides a robust way to invoke external shell
wenzelm
parents:
26218
diff
changeset

583 

25737
84c92fc48e36
``print mode'' is now a threadlocal value derived from a global template;
wenzelm
parents:
25726
diff
changeset

584 

25626
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset

585 
*** System *** 
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset

586 

25971  587 
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs  
588 
in accordance with Proof General 3.7, which prefers GNU emacs. 

25970
9053fd546501
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs here;
wenzelm
parents:
25961
diff
changeset

589 

25626
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset

590 
* isatool tty runs Isabelle process with plain tty interaction; 
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset

591 
optional line editor may be specified via ISABELLE_LINE_EDITOR 
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset

592 
setting, the default settings attempt to locate "ledit" and "rlwrap". 
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset

593 

25651  594 
* isatool browser now works with Cygwin as well, using general 
595 
"javapath" function defined in Isabelle process environment. 

596 

27067  597 
* YXML notation provides a simple and efficient alternative to 
598 
standard XML transfer syntax. See src/Pure/General/yxml.ML and 

599 
isatool yxml as described in the Isabelle system manual. 

25651  600 

25652  601 
* JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes) 
25651  602 
provides general wrapper for managing an Isabelle process in a robust 
603 
fashion, with ``cooked'' output from stdin/stderr. 

604 

25855  605 
* Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit), 
606 
based on Isabelle/JVM process wrapper (see Isabelle/lib/classes). 

607 

27067  608 
* Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented 
609 
way of changing the user's settings is via 

610 
ISABELLE_HOME_USER/etc/settings, which is a fully featured bash 

611 
script. 

612 

613 
* Multithreading.max_threads := 0 refers to the number of actual CPU 

614 
cores of the underlying machine, which is a good starting point for 

615 
optimal performance tuning. The corresponding usedir option M allows 

616 
"max" as an alias for "0". WARNING: does not work on certain versions 

617 
of Mac OS (with Poly/ML 5.1). 

618 

619 
* isabelleprocess: nonML sessions are run with "nice", to reduce the 

620 
adverse effect of Isabelle flooding interactive frontends (notably 

621 
ProofGeneral / XEmacs). 

622 

25626
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset

623 

25464
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset

624 

25429  625 
New in Isabelle2007 (November 2007) 
626 
 

17754
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

627 

58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

628 
*** General *** 
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

629 

22826  630 
* More uniform information about legacy features, notably a 
631 
warning/error of "Legacy feature: ...", depending on the state of the 

23367  632 
tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY: 
633 
legacy features will disappear eventually. 

22826  634 

17918
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

635 
* Theory syntax: the header format ``theory A = B + C:'' has been 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

636 
discontinued in favour of ``theory A imports B C begin''. Use isatool 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

637 
fixheaders to convert existing theory files. INCOMPATIBILITY. 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

638 

93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

639 
* Theory syntax: the old nonIsar theory file format has been 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

640 
discontinued altogether. Note that ML proof scripts may still be used 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

641 
with Isar theories; migration is usually quite simple with the ML 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

642 
function use_legacy_bindings. INCOMPATIBILITY. 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

643 

22871  644 
* Theory syntax: some popular names (e.g. 'class', 'declaration', 
645 
'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double 

646 
quotes. 

19814
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

647 

23888
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

648 
* Theory loader: be more serious about observing the static theory 
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

649 
header specifications (including optional directories), but not the 
24172
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

650 
accidental file locations of previously successful loads. The strict 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

651 
update policy of former update_thy is now already performed by 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

652 
use_thy, so the former has been removed; use_thys updates several 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

653 
theories simultaneously, just as 'imports' within a theory header 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

654 
specification, but without merging the results. Potential 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

655 
INCOMPATIBILITY: may need to refine theory headers and commands 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

656 
ROOT.ML which depend on load order. 
23888
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

657 

babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

658 
* Theory loader: optional support for contentbased file 
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

659 
identification, instead of the traditional scheme of full physical 
23889  660 
path plus date stamp; configured by the ISABELLE_FILE_IDENT setting 
23888
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

661 
(cf. the system manual). The new scheme allows to work with 
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

662 
nonfinished theories in persistent session images, such that source 
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

663 
files may be moved later on without requiring reloads. 
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

664 

24187
8bdf5ca5871f
* Theory loader: oldstyle ML proof scripts are considered a legacy feature;
wenzelm
parents:
24172
diff
changeset

665 
* Theory loader: oldstyle ML proof scripts being *attached* to a thy 
8bdf5ca5871f
* Theory loader: oldstyle ML proof scripts are considered a legacy feature;
wenzelm
parents:
24172
diff
changeset

666 
file (with the same base name as the theory) are considered a legacy 
24800  667 
feature, which will disappear eventually. Even now, the theory loader 
668 
no longer maintains dependencies on such files. 

669 

670 
* Syntax: the scope for resolving ambiguities via typeinference is 

671 
now limited to individual terms, instead of whole simultaneous 

24234
4714e04fb8e9
* Syntax: scope for resolving ambiguities via typeinference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset

672 
specifications as before. This greatly reduces the complexity of the 
4714e04fb8e9
* Syntax: scope for resolving ambiguities via typeinference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset

673 
syntax module and improves flexibility by separating parsing and 
4714e04fb8e9
* Syntax: scope for resolving ambiguities via typeinference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset

674 
typechecking. INCOMPATIBILITY: additional typeconstraints (explicit 
4714e04fb8e9
* Syntax: scope for resolving ambiguities via typeinference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset

675 
'fixes' etc.) are required in rare situations. 
4714e04fb8e9
* Syntax: scope for resolving ambiguities via typeinference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset

676 

25034  677 
* Syntax: constants introduced by newstyle packages ('definition', 
678 
'abbreviation' etc.) are passed through the syntax module in 

679 
``authentic mode''. This means that associated mixfix annotations 

680 
really stick to such constants, independently of potential name space 

681 
ambiguities introduced later on. INCOMPATIBILITY: constants in parse 

682 
trees are represented slightly differently, may need to adapt syntax 

683 
translations accordingly. Use CONST marker in 'translations' and 

684 
@{const_syntax} antiquotation in 'parse_translation' etc. 

685 

17981
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

686 
* Legacy goal package: reduced interface to the bare minimum required 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

687 
to keep existing proof scripts running. Most other userlevel 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

688 
functions are now part of the OldGoals structure, which is *not* open 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

689 
by default (consider isatool expandshort before open OldGoals). 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

690 
Removed top_sg, prin, printyp, pprint_term/typ altogether, because 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

691 
these tend to cause confusion about the actual goal (!) context being 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

692 
used here, which is not necessarily the same as the_context(). 
17918
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

693 

23379
d0e3f790bd73
updated 'find_theorems'  moved ProofGeneral specifics to ProofGeneral/CHANGES;
wenzelm
parents:
23377
diff
changeset

694 
* Command 'find_theorems': supports "*" wildcard in "name:" 
d0e3f790bd73
updated 'find_theorems'  moved ProofGeneral specifics to ProofGeneral/CHANGES;
wenzelm
parents:
23377
diff
changeset

695 
criterion; "with_dups" option. Certain ProofGeneral versions might 
d0e3f790bd73
updated 'find_theorems'  moved ProofGeneral specifics to ProofGeneral/CHANGES;
wenzelm
parents:
23377
diff
changeset

696 
support a specific search form (see ProofGeneral/CHANGES). 
22965  697 

20370  698 
* The ``prems limit'' option (cf. ProofContext.prems_limit) is now 1 
699 
by default, which means that "prems" (and also "fixed variables") are 

700 
suppressed from proof state output. Note that the ProofGeneral 

701 
settings mechanism allows to change and save options persistently, but 

702 
older versions of Isabelle will fail to start up if a negative prems 

703 
limit is imposed. 

704 

21308
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset

705 
* Local theory targets may be specified by nonnested blocks of 
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset

706 
``context/locale/class ... begin'' followed by ``end''. The body may 
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset

707 
contain definitions, theorems etc., including any derived mechanism 
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset

708 
that has been implemented on top of these primitives. This concept 
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset

709 
generalizes the existing ``theorem (in ...)'' towards more versatility 
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset

710 
and scalability. 
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset

711 

21960
0574f192b78a
* Proof General: proper undo of final 'end'; discontinued Isabelle/classic;
wenzelm
parents:
21896
diff
changeset

712 
* Proof General interface: proper undo of final 'end' command; 
0574f192b78a
* Proof General: proper undo of final 'end'; discontinued Isabelle/classic;
wenzelm
parents:
21896
diff
changeset

713 
discontinued Isabelle/classic mode (ML proof scripts). 
0574f192b78a
* Proof General: proper undo of final 'end'; discontinued Isabelle/classic;
wenzelm
parents:
21896
diff
changeset

714 

17754
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

715 

17865  716 
*** Document preparation *** 
717 

21717  718 
* Added antiquotation @{theory name} which prints the given name, 
719 
after checking that it refers to a valid ancestor theory in the 

720 
current context. 

21339  721 

17869  722 
* Added antiquotations @{ML_type text} and @{ML_struct text} which 
723 
check the given source text as ML type/structure, printing verbatim. 

17865  724 

21717  725 
* Added antiquotation @{abbrev "c args"} which prints the abbreviation 
726 
"c args == rhs" given in the current context. (Any number of 

21735  727 
arguments may be given on the LHS.) 
21717  728 

729 

17779  730 
*** Pure *** 
731 

24800  732 
* The 'class' package offers a combination of axclass and locale to 
25129  733 
achieve Haskelllike type classes in Isabelle. Definitions and 
734 
theorems within a class context produce both relative results (with 

735 
implicit parameters according to the locale context), and polymorphic 

736 
constants with qualified polymorphism (according to the class 

737 
context). Within the body context of a 'class' target, a separate 

738 
syntax layer ("user space type system") takes care of converting 

739 
between global polymorphic consts and internal locale representation. 

25177  740 
See src/HOL/ex/Classpackage.thy for examples (as well as main HOL). 
25184  741 
"isatool doc classes" provides a tutorial. 
20807  742 

25199  743 
* Generic code generator framework allows to generate executable 
24800  744 
code for ML and Haskell (including Isabelle classes). A short usage 
745 
sketch: 

20188
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset

746 

8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset

747 
internal compilation: 
25199  748 
export_code <list of constants (term syntax)> in SML 
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

749 
writing SML code to a file: 
25199  750 
export_code <list of constants (term syntax)> in SML <filename> 
22735  751 
writing OCaml code to a file: 
25199  752 
export_code <list of constants (term syntax)> in OCaml <filename> 
20188
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset

753 
writing Haskell code to a bunch of files: 
25199  754 
export_code <list of constants (term syntax)> in Haskell <filename> 
755 

756 
evaluating closed propositions to True/False using code generation: 

25184  757 
method ``eval'' 
758 

759 
Reasonable default setup of framework in HOL. 

20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

760 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

761 
Theorem attributs for selecting and transforming function equations theorems: 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

762 

22845  763 
[code fun]: select a theorem as function equation for a specific constant 
764 
[code fun del]: deselect a theorem as function equation for a specific constant 

765 
[code inline]: select an equation theorem for unfolding (inlining) in place 

766 
[code inline del]: deselect an equation theorem for unfolding (inlining) in place 

20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

767 

22735  768 
Userdefined serializations (target in {SML, OCaml, Haskell}): 
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

769 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

770 
code_const <andlist of constants (term syntax)> 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

771 
{(target) <andlist of const target syntax>}+ 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

772 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

773 
code_type <andlist of type constructors> 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

774 
{(target) <andlist of type target syntax>}+ 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

775 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

776 
code_instance <andlist of instances> 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

777 
{(target)}+ 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

778 
where instance ::= <type constructor> :: <class> 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

779 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

780 
code_class <and_list of classes> 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

781 
{(target) <andlist of class target syntax>}+ 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

782 
where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}? 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

783 

25199  784 
code_instance and code_class only are effective to target Haskell. 
22735  785 

25177  786 
For example usage see src/HOL/ex/Codegenerator.thy and 
787 
src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code 

24800  788 
generation from Isabelle/HOL theories is available via "isatool doc 
789 
codegen". 

20188
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset

790 

25129  791 
* Code generator: consts in 'consts_code' Isar commands are now 
792 
referred to by usual term syntax (including optional type 

793 
annotations). 

794 

19254  795 
* Command 'no_translations' removes translation rules from theory 
796 
syntax. 

797 

19625
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

798 
* Overloaded definitions are now actually checked for acyclic 
19714  799 
dependencies. The overloading scheme is slightly more general than 
800 
that of Haskell98, although Isabelle does not demand an exact 

801 
correspondence to type class and instance declarations. 

802 
INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more 

803 
exotic versions of overloading  at the discretion of the user! 

19711  804 

805 
Polymorphic constants are represented via type arguments, i.e. the 

806 
instantiation that matches an instance against the most general 

807 
declaration given in the signature. For example, with the declaration 

808 
c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented 

809 
as c(nat). Overloading is essentially simultaneous structural 

810 
recursion over such type arguments. Incomplete specification patterns 

19714  811 
impose global constraints on all occurrences, e.g. c('a * 'a) on the 
19715  812 
LHS means that more general c('a * 'b) will be disallowed on any RHS. 
19714  813 
Command 'print_theory' outputs the normalized system of recursive 
814 
equations, see section "definitions". 

19625
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

815 

24086  816 
* Configuration options are maintained within the theory or proof 
817 
context (with name and type bool/int/string), providing a very simple 

818 
interface to a poorman's version of general context data. Tools may 

24110
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

819 
declare options in ML (e.g. using Attrib.config_int) and then refer to 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

820 
these values using Config.get etc. Users may change options via an 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

821 
associated attribute of the same name. This form of context 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

822 
declaration works particularly well with commands 'declare' or 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

823 
'using', for example ``declare [[foo = 42]]''. Thus it has become 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

824 
very easy to avoid global references, which would not observe Isar 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

825 
toplevel undo/redo and fail to work with multithreading. 
24086  826 

24172
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

827 
Various global ML references of Pure and HOL have been turned into 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

828 
configuration options: 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

829 

06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

830 
Unify.search_bound unify_search_bound 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

831 
Unify.trace_bound unify_trace_bound 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

832 
Unify.trace_simp unify_trace_simp 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

833 
Unify.trace_types unify_trace_types 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

834 
Simplifier.simp_depth_limit simp_depth_limit 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

835 
Blast.depth_limit blast_depth_limit 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

836 
DatatypeProp.dtK datatype_distinctness_limit 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

837 
fast_arith_neq_limit fast_arith_neq_limit 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

838 
fast_arith_split_limit fast_arith_split_limit 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

839 

24086  840 
* Named collections of theorems may be easily installed as context 
24800  841 
data using the functor NamedThmsFun (see also 
24086  842 
src/Pure/Tools/named_thms.ML). The user may add or delete facts via 
24110
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

843 
attributes; there is also a toplevel print command. This facility is 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

844 
just a common case of general context data, which is the preferred way 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

845 
for anything more complex than just a list of facts in canonical 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

846 
order. 
24086  847 

24032  848 
* Isar: command 'declaration' augments a local theory by generic 
849 
declaration functions written in ML. This enables arbitrary content 

850 
being added to the context, depending on a morphism that tells the 

851 
difference of the original declaration context wrt. the application 

852 
context encountered later on. 

853 

854 
* Isar: proper interfaces for simplification procedures. Command 

855 
'simproc_setup' declares named simprocs (with match patterns, and body 

856 
text in ML). Attribute "simproc" adds/deletes simprocs in the current 

857 
context. ML antiquotation @{simproc name} retrieves named simprocs. 

858 

859 
* Isar: an extra pair of brackets around attribute declarations 

860 
abbreviates a theorem reference involving an internal dummy fact, 

861 
which will be ignored later  only the effect of the attribute on 

862 
the background context will persist. This form of inplace 

863 
declarations is particularly useful with commands like 'declare' and 

864 
'using', for example ``have A using [[simproc a]] by simp''. 

865 

23369
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

866 
* Isar: method "assumption" (and implicit closing of subproofs) now 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

867 
takes simple nonatomic goal assumptions into account: after applying 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

868 
an assumption as a rule the resulting subgoals are solved by atomic 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

869 
assumption steps. This is particularly useful to finish 'obtain' 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

870 
goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis", 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

871 
without referring to the original premise "!!x. P x ==> thesis" in the 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

872 
Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

873 
more permissive. 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

874 

227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

875 
* Isar: implicit use of prems from the Isar proof context is 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

876 
considered a legacy feature. Common applications like ``have A .'' 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

877 
may be replaced by ``have A by fact'' or ``note `A`''. In general, 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

878 
referencing facts explicitly here improves readability and 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

879 
maintainability of proof texts. 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

880 

17865  881 
* Isar: improper proof element 'guess' is like 'obtain', but derives 
882 
the obtained context from the course of reasoning! For example: 

883 

884 
assume "EX x y. A x & B y"  "any previous fact" 

885 
then guess x and y by clarify 

886 

887 
This technique is potentially adventurous, depending on the facts and 

888 
proof tools being involved here. 

889 

18020  890 
* Isar: known facts from the proof context may be specified as literal 
891 
propositions, using ASCII backquote syntax. This works wherever 

892 
named facts used to be allowed so far, in proof commands, proof 

893 
methods, attributes etc. Literal facts are retrieved from the context 

894 
according to unification of type and term parameters. For example, 

895 
provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known 

896 
theorems in the current context, then these are valid literal facts: 

897 
`A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc. 

898 

899 
There is also a proof method "fact" which does the same composition 

18044  900 
for explicit goal states, e.g. the following proof texts coincide with 
901 
certain special cases of literal facts: 

18020  902 

903 
have "A" by fact == note `A` 

904 
have "A ==> B" by fact == note `A ==> B` 

905 
have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x` 

906 
have "P a ==> Q a" by fact == note `P a ==> Q a` 

907 

20118
0c1ec587a5a8
* Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents:
20090
diff
changeset

908 
* Isar: ":" (colon) is no longer a symbolic identifier character in 
0c1ec587a5a8
* Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents:
20090
diff
changeset

909 
outer syntax. Thus symbolic identifiers may be used without 
0c1ec587a5a8
* Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents:
20090
diff
changeset

910 
additional white space in declarations like this: ``assume *: A''. 
0c1ec587a5a8
* Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents:
20090
diff
changeset

911 

20013  912 
* Isar: 'print_facts' prints all local facts of the current context, 
913 
both named and unnamed ones. 

914 

18308  915 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
916 

917 
def x == "t" and y == "u" 

918 

18540  919 
* Isar: added command 'unfolding', which is structurally similar to 
920 
'using', but affects both the goal state and facts by unfolding given 

18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

921 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  922 
'unfolded' attribute may be replaced by firstclass proof text. 
923 

18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

924 
* Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded', 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

925 
and command 'unfolding' now all support objectlevel equalities 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

926 
(potentially conditional). The underlying notion of rewrite rule is 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

927 
analogous to the 'rule_format' attribute, but *not* that of the 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

928 
Simplifier (which is usually more generous). 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

929 

24238  930 
* Isar: the new attribute [rotated n] (default n = 1) rotates the 
931 
premises of a theorem by n. Useful in conjunction with drule. 

932 

19220  933 
* Isar: the goal restriction operator [N] (default N = 1) evaluates a 
934 
method expression within a sandbox consisting of the first N 

19240  935 
subgoals, which need to exist. For example, ``simp_all [3]'' 
936 
simplifies the first three subgoals, while (rule foo, simp_all)[] 

937 
simplifies all new goals that emerge from applying rule foo to the 

938 
originally first one. 

19220  939 

19814
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

940 
* Isar: schematic goals are no longer restricted to higherorder 
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

941 
patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as 
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

942 
expected. 
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

943 

18901  944 
* Isar: the conclusion of a long theorem statement is now either 
945 
'shows' (a simultaneous conjunction, as before), or 'obtains' 

946 
(essentially a disjunction of cases with local parameters and 

947 
assumptions). The latter allows to express general elimination rules 

18910  948 
adequately; in this notation common elimination rules look like this: 
18901  949 

950 
lemma exE:  "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis" 

951 
assumes "EX x. P x" 

952 
obtains x where "P x" 

953 

954 
lemma conjE:  "A & B ==> (A ==> B ==> thesis) ==> thesis" 

955 
assumes "A & B" 

956 
obtains A and B 

957 

958 
lemma disjE:  "A  B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis" 

959 
assumes "A  B" 

960 
obtains 

961 
A 

962 
 B 

963 

18910  964 
The subsequent classical rules even refer to the formal "thesis" 
18901  965 
explicitly: 
966 

967 
lemma classical:  "(~ thesis ==> thesis) ==> thesis" 

968 
obtains "~ thesis" 

969 

18910  970 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
971 
obtains "thesis ==> something" 

18901  972 

973 
The actual proof of an 'obtains' statement is analogous to that of the 

18910  974 
Isar proof element 'obtain', only that there may be several cases. 
975 
Optional case names may be specified in parentheses; these will be 

976 
available both in the present proof and as annotations in the 

977 
resulting rule, for later use with the 'cases' method (cf. attribute 

978 
case_names). 

18901  979 

21447
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset

980 
* Isar: the assumptions of a long theorem statement are available as 
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset

981 
"assms" fact in the proof context. This is more appropriate than the 
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset

982 
(historical) "prems", which refers to all assumptions of the current 
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset

983 
context, including those from the target locale, proof body etc. 
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset

984 

19263  985 
* Isar: 'print_statement' prints theorems from the current theory or 
986 
proof context in long statement form, according to the syntax of a 

987 
toplevel lemma. 

988 

18901  989 
* Isar: 'obtain' takes an optional case name for the local context 
990 
introduction rule (default "that"). 

991 

19587  992 
* Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use 
993 
explicit (is "_ ==> ?foo") in the rare cases where this still happens 

994 
to occur. 

995 

19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

996 
* Pure: syntax "CONST name" produces a fully internalized constant 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

997 
according to the current context. This is particularly useful for 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

998 
syntax translations that should refer to internal constant 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

999 
representations independently of name spaces. 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

1000 

21537
45b3a85ee548
* Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents:
21471
diff
changeset

1001 
* Pure: syntax constant for foo (binder "FOO ") is called "foo_binder" 
45b3a85ee548
* Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents:
21471
diff
changeset

1002 
instead of "FOO ". This allows multiple binder declarations to coexist 
45b3a85ee548
* Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents:
21471
diff
changeset

1003 
in the same context. INCOMPATIBILITY. 
45b3a85ee548
* Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents:
21471
diff
changeset

1004 

21209
dbb8decc36bc
'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents:
21200
diff
changeset

1005 
* Isar/locales: 'notation' provides a robust interface to the 'syntax' 
dbb8decc36bc
'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents:
21200
diff
changeset

1006 
primitive that also works in a locale context (both for constants and 
24950  1007 
fixed variables). Type declaration and internal syntactic representation 
1008 
of given constants retrieved from the context. Likewise, the 

1009 
'no_notation' command allows to remove given syntax annotations from the 

1010 
current context. 

19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

1011 

19665  1012 
* Isar/locales: new derived specification elements 'axiomatization', 
1013 
'definition', 'abbreviation', which support typeinference, admit 

19083  1014 
objectlevel specifications (equality, equivalence). See also the 
1015 
isarref manual. Examples: 

19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

1016 

19665  1017 
axiomatization 
21595  1018 
eq (infix "===" 50) where 
1019 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

1020 

1021 
definition "f x y = x + y + 1" 

1022 
definition g where "g x = f x x" 

19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

1023 

19363  1024 
abbreviation 
21595  1025 
neq (infix "=!=" 50) where 
19363  1026 
"x =!= y == ~ (x === y)" 
19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

1027 

19083  1028 
These specifications may be also used in a locale context. Then the 
1029 
constants being introduced depend on certain fixed parameters, and the 

1030 
constant name is qualified by the locale base name. An internal 

1031 
abbreviation takes care for convenient input and output, making the 

19088  1032 
parameters implicit and using the original short name. See also 
25177  1033 
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic 
19083  1034 
entities from a monomorphic theory. 
1035 

1036 
Presently, abbreviations are only available 'in' a target locale, but 

19363  1037 
not inherited by general import expressions. Also note that 
1038 
'abbreviation' may be used as a typesafe replacement for 'syntax' + 

24735
3a55ee2cae70
* Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm
parents:
24706
diff
changeset

1039 
'translations' in common applications. The "no_abbrevs" print mode 
3a55ee2cae70
* Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm
parents:
24706
diff
changeset

1040 
prevents folding of abbreviations in term output. 
19084  1041 

19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

1042 
Concrete syntax is attached to specified constants in internal form, 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

1043 
independently of name spaces. The parse tree representation is 
21209
dbb8decc36bc
'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents:
21200
diff
changeset

1044 
slightly different  use 'notation' instead of raw 'syntax', and 
19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

1045 
'translations' with explicit "CONST" markup to accommodate this. 
19665  1046 

24800  1047 
* Pure/Isar: unified syntax for newstyle specification mechanisms 
1048 
(e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits 

1049 
full type inference and dummy patterns ("_"). For example: 

24735
3a55ee2cae70
* Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm
parents:
24706
diff
changeset

1050 

3a55ee2cae70
* Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm
parents:
24706
diff
changeset

1051 
definition "K x _ = x" 
3a55ee2cae70
* Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm
parents:
24706
diff
changeset

1052 

24738  1053 
inductive conj for A B 
1054 
where "A ==> B ==> conj A B" 

1055 

21735  1056 
* Pure: command 'print_abbrevs' prints all constant abbreviations of 
1057 
the current context. Print mode "no_abbrevs" prevents inversion of 

1058 
abbreviations on output. 

1059 

24800  1060 
* Isar/locales: improved parameter handling: use of locales "var" and 
1061 
"struct" no longer necessary;  parameter renamings are no longer 

1062 
required to be injective. For example, this allows to define 

1063 
endomorphisms as locale endom = homom mult mult h. 

19783  1064 

19931
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

1065 
* Isar/locales: changed the way locales with predicates are defined. 
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

1066 
Instead of accumulating the specification, the imported expression is 
22126  1067 
now an interpretation. INCOMPATIBILITY: different normal form of 
1068 
locale expressions. In particular, in interpretations of locales with 

1069 
predicates, goals repesenting already interpreted fragments are not 

1070 
removed automatically. Use methods `intro_locales' and 

1071 
`unfold_locales'; see below. 

1072 

1073 
* Isar/locales: new methods `intro_locales' and `unfold_locales' 

1074 
provide backward reasoning on locales predicates. The methods are 

1075 
aware of interpretations and discharge corresponding goals. 

1076 
`intro_locales' is less aggressive then `unfold_locales' and does not 

1077 
unfold predicates to assumptions. 

19931
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

1078 

fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

1079 
* Isar/locales: the order in which locale fragments are accumulated 
22126  1080 
has changed. This enables to override declarations from fragments due 
1081 
to interpretations  for example, unwanted simp rules. 

19931
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

1082 

23920  1083 
* Isar/locales: interpretation in theories and proof contexts has been 
1084 
extended. One may now specify (and prove) equations, which are 

1085 
unfolded in interpreted theorems. This is useful for replacing 

1086 
defined concepts (constants depending on locale parameters) by 

1087 
concepts already existing in the target context. Example: 

1088 

1089 
interpretation partial_order ["op <= :: [int, int] => bool"] 

1090 
where "partial_order.less (op <=) (x::int) y = (x < y)" 

1091 

24800  1092 
Typically, the constant `partial_order.less' is created by a 
1093 
definition specification element in the context of locale 

1094 
partial_order. 

1095 

24859  1096 
* Method "induct": improved internal context management to support 
24800  1097 
local fixes and defines onthefly. Thus explicit metalevel 
1098 
connectives !! and ==> are rarely required anymore in inductive goals 

1099 
(using objectlogic connectives for this purpose has been long 

1100 
obsolete anyway). Common proof patterns are explained in 

25177  1101 
src/HOL/Induct/Common_Patterns.thy, see also 
1102 
src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic 

1103 
examples. 

24606
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

1104 

24859  1105 
* Method "induct": improved handling of simultaneous goals. Instead of 
24606
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

1106 
introducing objectlevel conjunction, the statement is now split into 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

1107 
several conclusions, while the corresponding symbolic cases are nested 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

1108 
accordingly. INCOMPATIBILITY, proofs need to be structured explicitly, 
25177  1109 
see src/HOL/Induct/Common_Patterns.thy, for example. 
24606
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

1110 

24859  1111 
* Method "induct": mutual induction rules are now specified as a list 
24800  1112 
of rule sharing the same induction cases. HOL packages usually provide 
24606
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

1113 
foo_bar.inducts for mutually defined items foo and bar (e.g. inductive 
24859  1114 
predicates/sets or datatypes). INCOMPATIBILITY, users need to specify 
1115 
mutual induction rules differently, i.e. like this: 

18506
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

1116 

96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

1117 
(induct rule: foo_bar.inducts) 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

1118 
(induct set: foo bar) 
24859  1119 
(induct pred: foo bar) 
18506
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

1120 
(induct type: foo bar) 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

1121 

96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

1122 
The ML function ProjectRule.projections turns oldstyle rules into the 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

1123 
new format. 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

1124 

24859  1125 
* Method "coinduct": dual of induction, see 
18399  1126 
src/HOL/Library/Coinductive_List.thy for various examples. 
1127 

24859  1128 
* Method "cases", "induct", "coinduct": the ``(open)'' option is 
1129 
considered a legacy feature. 

1130 

20919
dab803075c62
attribute "symmetric": standardized schematic variables;
wenzelm
parents:
20857
diff
changeset

1131 
* Attribute "symmetric" produces result with standardized schematic 
dab803075c62
attribute "symmetric": standardized schematic variables;
wenzelm
parents:
20857
diff
changeset

1132 
variables (index 0). Potential INCOMPATIBILITY. 
dab803075c62
attribute "symmetric": standardized schematic variables;
wenzelm
parents:
20857
diff
changeset

1133 

22126  1134 
* Simplifier: by default the simplifier trace only shows top level 
1135 
rewrites now. That is, trace_simp_depth_limit is set to 1 by 

1136 
default. Thus there is less danger of being flooded by the trace. The 

1137 
trace indicates where parts have been suppressed. 

18674  1138 

18536
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1139 
* Provers/classical: removed obsolete classical version of elim_format 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1140 
attribute; classical elim/dest rules are now treated uniformly when 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1141 
manipulating the claset. 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1142 

18694  1143 
* Provers/classical: stricter checks to ensure that supplied intro, 
1144 
dest and elim rules are wellformed; dest and elim rules must have at 

1145 
least one premise. 

1146 

1147 
* Provers/classical: attributes dest/elim/intro take an optional 

18695  1148 
weight argument for the rule (just as the Pure versions). Weights are 
18696  1149 
ignored by automated tools, but determine the search order of single 
18694  1150 
rule steps. 
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18549
diff
changeset

1151 

18536
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1152 
* Syntax: input syntax now supports dummy variable binding "%_. b", 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1153 
where the body does not mention the bound variable. Note that dummy 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1154 
patterns implicitly depend on their context of bounds, which makes 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1155 
"{_. _}" match any set comprehension as expected. Potential 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1156 
INCOMPATIBILITY  parse translations need to cope with syntactic 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1157 
constant "_idtdummy" in the binding position. 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1158 

ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1159 
* Syntax: removed obsolete syntactic constant "_K" and its associated 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1160 
parse translation. INCOMPATIBILITY  use dummy abstraction instead, 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1161 
for example "A > B" => "Pi A (%_. B)". 
17779  1162 

20582
ebd0e03c6a9b
* Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents:
20503
diff
changeset

1163 
* Pure: 'class_deps' command visualizes the subclass relation, using 
ebd0e03c6a9b
* Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents:
20503
diff
changeset

1164 
the graph browser tool. 
ebd0e03c6a9b
* Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents:
20503
diff
changeset

1165 

24800  1166 
* Pure: 'print_theory' now suppresses certain internal declarations by 
1167 
default; use '!' option for full details. 

20620
8b26f58c5646
* Pure: 'print_theory' now suppresses entities with internal name;
wenzelm
parents:
20607
diff
changeset

1168 

17865  1169 

17806  1170 
*** HOL *** 
1171 

25129  1172 
* Method "metis" proves goals by applying the Metis generalpurpose 
1173 
resolution prover (see also http://gilith.com/software/metis/). 

1174 
Examples are in the directory MetisExamples. WARNING: the 

1175 
Isabelle/HOLMetis integration does not yet work properly with 

1176 
multithreading. 

1177 

1178 
* Command 'sledgehammer' invokes external automatic theorem provers as 

1179 
background processes. It generates calls to the "metis" method if 

1180 
successful. These can be pasted into the proof. Users do not have to 

1181 
wait for the automatic provers to return. WARNING: does not really 

1182 
work with multithreading. 

1183 

24804  1184 
* New "auto_quickcheck" feature tests outermost goal statements for 
1185 
potential counterexamples. Controlled by ML references 

1186 
auto_quickcheck (default true) and auto_quickcheck_time_limit (default 

25129  1187 
5000 milliseconds). Fails silently if statements is outside of 
1188 
executable fragment, or any other codgenerator problem occurs. 

24804  1189 

25184  1190 
* New constant "undefined" with axiom "undefined x = undefined". 
1191 

1192 
* Added class "HOL.eq", allowing for code generation with polymorphic 

1193 
equality. 

1194 

1195 
* Some renaming of class constants due to canonical name prefixing in 

1196 
the new 'class' package: 

1197 

1198 
HOL.abs ~> HOL.abs_class.abs 

1199 
HOL.divide ~> HOL.divide_class.divide 

1200 
0 ~> HOL.zero_class.zero 

1201 
1 ~> HOL.one_class.one 

1202 
op + ~> HOL.plus_class.plus 

1203 
op  ~> HOL.minus_class.minus 

1204 
uminus ~> HOL.minus_class.uminus 

1205 
op * ~> HOL.times_class.times 

1206 
op < ~> HOL.ord_class.less 

1207 
op <= > HOL.ord_class.less_eq 

1208 
Nat.power ~> Power.power_class.power 

1209 
Nat.size ~> Nat.size_class.size 

1210 
Numeral.number_of ~> Numeral.number_class.number_of 

1211 
FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf 

1212 
FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup 

1213 
Orderings.min ~> Orderings.ord_class.min 

1214 
Orderings.max ~> Orderings.ord_class.max 

1215 
Divides.op div ~> Divides.div_class.div 

1216 
Divides.op mod ~> Divides.div_class.mod 

1217 
Divides.op dvd ~> Divides.div_class.dvd 

1218 

1219 
INCOMPATIBILITY. Adaptions may be required in the following cases: 

1220 

1221 
a) Userdefined constants using any of the names "plus", "minus", 

1222 
"times", "less" or "less_eq". The standard syntax translations for 

1223 
"+", "" and "*" may go wrong. INCOMPATIBILITY: use more specific 

1224 
names. 

1225 

1226 
b) Variables named "plus", "minus", "times", "less", "less_eq" 

1227 
INCOMPATIBILITY: use more specific names. 

1228 

1229 
c) Permutative equations (e.g. "a + b = b + a") 

1230 
Since the change of names also changes the order of terms, permutative 

1231 
rewrite rules may get applied in a different order. Experience shows 

1232 
that this is rarely the case (only two adaptions in the whole Isabelle 

1233 
distribution). INCOMPATIBILITY: rewrite proofs 

1234 

1235 
d) ML code directly refering to constant names 

1236 
This in general only affects handwritten proof tactics, simprocs and 

1237 
so on. INCOMPATIBILITY: grep your sourcecode and replace names. 

1238 
Consider using @{const_name} antiquotation. 

1239 

1240 
* New class "default" with associated constant "default". 

1241 

1242 
* Function "sgn" is now overloaded and available on int, real, complex 

1243 
(and other numeric types), using class "sgn". Two possible defs of 

1244 
sgn are given as equational assumptions in the classes sgn_if and 

1245 
sgn_div_norm; ordered_idom now also inherits from sgn_if. 

1246 
INCOMPATIBILITY. 

1247 

1248 
* Locale "partial_order" now unified with class "order" (cf. theory 

1249 
Orderings), added parameter "less". INCOMPATIBILITY. 

1250 

1251 
* Renamings in classes "order" and "linorder": facts "refl", "trans" and 

1252 
"cases" to "order_refl", "order_trans" and "linorder_cases", to avoid 

1253 
clashes with HOL "refl" and "trans". INCOMPATIBILITY. 

1254 

1255 
* Classes "order" and "linorder": potential INCOMPATIBILITY due to 

1256 
changed order of proof goals in instance proofs. 

1257 

1258 
* The transitivity reasoner for partial and linear orders is set up 

1259 
for classes "order" and "linorder". Instances of the reasoner are available 

1260 
in all contexts importing or interpreting the corresponding locales. 

1261 
Method "order" invokes the reasoner separately; the reasoner 

1262 
is also integrated with the Simplifier as a solver. Diagnostic 

1263 
command 'print_orders' shows the available instances of the reasoner 

1264 
in the current context. 

1265 

1266 
* Localized monotonicity predicate in theory "Orderings"; integrated 

1267 
lemmas max_of_mono and min_of_mono with this predicate. 

1268 
INCOMPATIBILITY. 

1269 

1270 
* Formulation of theorem "dense" changed slightly due to integration 

1271 
with new class dense_linear_order. 

1272 

1273 
* Uniform lattice theory development in HOL. 

1274 

1275 
constants "meet" and "join" now named "inf" and "sup" 

1276 
constant "Meet" now named "Inf" 

1277 

1278 
classes "meet_semilorder" and "join_semilorder" now named 

1279 
"lower_semilattice" and "upper_semilattice" 

1280 
class "lorder" now named "lattice" 

1281 
class "comp_lat" now named "complete_lattice" 

1282 

1283 
Instantiation of lattice classes allows explicit definitions 

1284 
for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices). 

1285 

1286 
INCOMPATIBILITY. Theorem renames: 

1287 

1288 
meet_left_le ~> inf_le1 

1289 
meet_right_le ~> inf_le2 

1290 
join_left_le ~> sup_ge1 

1291 
join_right_le ~> sup_ge2 

1292 
meet_join_le ~> inf_sup_ord 

1293 
le_meetI ~> le_infI 

1294 
join_leI ~> le_supI 

1295 
le_meet ~> le_inf_iff 

1296 
le_join ~> ge_sup_conv 

1297 
meet_idempotent ~> inf_idem 

1298 
join_idempotent ~> sup_idem 

1299 
meet_comm ~> inf_commute 

1300 
join_comm ~> sup_commute 

1301 
meet_leI1 ~> le_infI1 

1302 
meet_leI2 ~> le_infI2 

1303 
le_joinI1 ~> le_supI1 

1304 
le_joinI2 ~> le_supI2 

1305 
meet_assoc ~> inf_assoc 

1306 
join_assoc ~> sup_assoc 

1307 
meet_left_comm ~> inf_left_commute 

1308 
meet_left_idempotent ~> inf_left_idem 

1309 
join_left_comm ~> sup_left_commute 

1310 
join_left_idempotent ~> sup_left_idem 

1311 
meet_aci ~> inf_aci 

1312 
join_aci ~> sup_aci 

1313 
le_def_meet ~> le_iff_inf 

1314 
le_def_join ~> le_iff_sup 

1315 
join_absorp2 ~> sup_absorb2 

1316 
join_absorp1 ~> sup_absorb1 

1317 
meet_absorp1 ~> inf_absorb1 

1318 
meet_absorp2 ~> inf_absorb2 

1319 
meet_join_absorp ~> inf_sup_absorb 

1320 
join_meet_absorp ~> sup_inf_absorb 

1321 
distrib_join_le ~> distrib_sup_le 

1322 
distrib_meet_le ~> distrib_inf_le 

1323 

1324 
add_meet_distrib_left ~> add_inf_distrib_left 

1325 
add_join_distrib_left ~> add_sup_distrib_left 

1326 
is_join_neg_meet ~> is_join_neg_inf 

1327 
is_meet_neg_join ~> is_meet_neg_sup 

1328 
add_meet_distrib_right ~> add_inf_distrib_right 

1329 
add_join_distrib_right ~> add_sup_distrib_right 

1330 
add_meet_join_distribs ~> add_sup_inf_distribs 

1331 
join_eq_neg_meet ~> sup_eq_neg_inf 

1332 
meet_eq_neg_join ~> inf_eq_neg_sup 

1333 
add_eq_meet_join ~> add_eq_inf_sup 

1334 
meet_0_imp_0 ~> inf_0_imp_0 

1335 
join_0_imp_0 ~> sup_0_imp_0 

1336 
meet_0_eq_0 ~> inf_0_eq_0 

1337 
join_0_eq_0 ~> sup_0_eq_0 

1338 
neg_meet_eq_join ~> neg_inf_eq_sup 

1339 
neg_join_eq_meet ~> neg_sup_eq_inf 

1340 
join_eq_if ~> sup_eq_if 

1341 

1342 
mono_meet ~> mono_inf 

1343 
mono_join ~> mono_sup 

1344 
meet_bool_eq ~> inf_bool_eq 

1345 
join_bool_eq ~> sup_bool_eq 

1346 
meet_fun_eq ~> inf_fun_eq 

1347 
join_fun_eq ~> sup_fun_eq 

1348 
meet_set_eq ~> inf_set_eq 

1349 
join_set_eq ~> sup_set_eq 

1350 
meet1_iff ~> inf1_iff 

1351 
meet2_iff ~> inf2_iff 

1352 
meet1I ~> inf1I 

1353 
meet2I ~> inf2I 

1354 
meet1D1 ~> inf1D1 

1355 
meet2D1 ~> inf2D1 

1356 
meet1D2 ~> inf1D2 

1357 
meet2D2 ~> inf2D2 

1358 
meet1E ~> inf1E 

1359 
meet2E ~> inf2E 

1360 
join1_iff ~> sup1_iff 

1361 
join2_iff ~> sup2_iff 

1362 
join1I1 ~> sup1I1 

1363 
join2I1 ~> sup2I1 

1364 
join1I1 ~> sup1I1 

1365 
join2I2 ~> sup1I2 

1366 
join1CI ~> sup1CI 

1367 
join2CI ~> sup2CI 

1368 
join1E ~> sup1E 

1369 
join2E ~> sup2E 

1370 

1371 
is_meet_Meet ~> is_meet_Inf 

1372 
Meet_bool_def ~> Inf_bool_def 

1373 
Meet_fun_def ~> Inf_fun_def 

1374 
Meet_greatest ~> Inf_greatest 

1375 
Meet_lower ~> Inf_lower 

1376 
Meet_set_def ~> Inf_set_def 

1377 

1378 
Sup_def ~> Sup_Inf 

1379 
Sup_bool_eq ~> Sup_bool_def 

1380 
Sup_fun_eq ~> Sup_fun_def 

1381 
Sup_set_eq ~> Sup_set_def 

1382 

1383 
listsp_meetI ~> listsp_infI 

1384 
listsp_meet_eq ~> listsp_inf_eq 

1385 

1386 
meet_min ~> inf_min 

1387 
join_max ~> sup_max 

1388 

1389 
* Added syntactic class "size"; overloaded constant "size" now has 

1390 
type "'a::size ==> bool" 

1391 

24800  1392 
* Internal reorganisation of `size' of datatypes: size theorems 
1393 
"foo.size" are no longer subsumed by "foo.simps" (but are still 

1394 
simplification rules by default!); theorems "prod.size" now named 

25184  1395 
"*.size". 
1396 

1397 
* Class "div" now inherits from class "times" rather than "type". 

1398 
INCOMPATIBILITY. 

24800  1399 

1400 
* HOL/Finite_Set: "namespace" locales Lattice, Distrib_lattice, 

1401 
Linorder etc. have disappeared; operations defined in terms of 

1402 
fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY. 

1403 

25129  1404 
* HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY. 
1405 

24800  1406 
* HOLWord: New extensive library and type for generic, fixed size 
1407 
machine words, with arithemtic, bitwise, shifting and rotating 

1408 
operations, reflection into int, nat, and bool lists, automation for 

1409 
linear arithmetic (by automatic reflection into nat or int), including 

1410 
lemmas on overflow and monotonicity. Instantiated to all appropriate 

1411 
arithmetic type classes, supporting automatic simplification of 
