author  wenzelm 
Tue, 03 Jun 2008 14:04:51 +0200  
changeset 27067  f8a7aff41acb 
parent 27061  a057cb0d7d55 
child 27104  791607529f6d 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

27008  4 
New in Isabelle2008 (June 2008) 
5 
 

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

6 

25522  7 
*** General *** 
8 

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

11 

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

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

15 
provides a proper context already. 

16 

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

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

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

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

20 

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

26659  23 
space take precedence. INCOMPATIBILITY in rare situations, may try to 
26650  24 
swap theory imports. 
25 

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

28 

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

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

31 
white space without escapes. 

32 

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

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

35 
"foo_bar". 

36 

25522  37 

25502  38 
*** Pure *** 
39 

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

42 

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

45 

46 
(1) unused_thms 

47 
Only finds unused theorems in the current theory. 

48 

49 
(2) unused_thms thy_1 ... thy_n  

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

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

52 

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

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

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

56 
their ancestors. 

57 

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

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

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

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

65 

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

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

26874  68 
usually the case when using Proof General with the default settings). 
26681  69 

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

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

73 
that tools may maintain dynamically scoped facts systematically, using 

74 
PureThy.add_thms_dynamic. 

75 

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

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

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

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

80 
update of theories within ML code. 
26479  81 

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

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

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

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

85 
depending on former CPure need to refer to Pure. 
26650  86 

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

90 
INCOMPATIBILITY. 

91 

26874  92 
* Command 'setup': discontinued implicit version with ML reference. 
26434  93 

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

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

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

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

25502  99 

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

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

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

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

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

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

105 

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

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

107 
"(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

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

109 

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

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

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

112 

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

115 
predicates. 

26765  116 

117 

26762  118 
*** Document preparation *** 
119 

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

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

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

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

26914  126 

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

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

26762  130 

131 

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

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

133 

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

136 
"primrec" command distinguishes oldstyle and newstyle specifications 

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

138 
When adjusting theories, beware: constants stemming from newstyle 

139 
primrec specifications have authentic syntax. 

140 

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

142 
with multithreading. 

143 

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

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

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

147 

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

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

150 
reconstruction_modulus, reconstruction_sorts renamed 

151 
sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY. 

152 

153 
* Method "induction_scheme" derives userspecified induction rules 

154 
from wellfounded induction and completeness of patterns. This factors 

155 
out some operations that are done internally by the function package 

156 
and makes them available separately. See 

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

158 

159 
* More flexible generation of measure functions for termination 

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

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

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

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

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

165 
type and generates all solutions by prologstyle backwards proof using 

166 
the declared rules. 

167 

168 
This setup also deals with rules like 

169 

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

171 

172 
which accommodates nested datatypes that recurse through lists. 

173 
Similar rules are predeclared for products and option types. 

174 

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

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

176 

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

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

178 

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

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

181 

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

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

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

185 

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

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

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

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

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

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

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

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

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

194 

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

195 
 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

196 
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

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

198 

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

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

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

201 

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

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

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

204 

27008  205 
no longer works (due to the incompleteness of the HO unification 
206 
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

207 

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

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

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

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

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

212 

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

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

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

215 

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

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

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

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

219 

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

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

222 

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

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

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

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

226 

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

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

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

229 

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

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

231 

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

234 
type of the form 

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

235 

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

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

237 

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

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

239 

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

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

241 

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

244 

26513  245 
* Explicit class "eq" for executable equality. INCOMPATIBILITY. 
246 

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

26445  249 
INCOMPATIBILITY. 
250 

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

253 

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

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

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

256 

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

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

26355  260 

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

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

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

263 

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

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

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

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

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

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

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

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

271 

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

272 
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

273 
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

274 
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

275 

26231  276 
* Library/Option_ord.thy: Canonical order on option type. 
277 

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

26197  280 

26231  281 
* Library/Countable.thy: Type class for countable types. 
282 

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

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

284 
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

285 
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

286 
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

287 
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

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

289 

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

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

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

292 
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

293 
[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

294 

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

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

296 
(whose purpose mainly is for various fold_set functionals) have been 
26874  297 
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

298 
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

299 
lower_semilattice (resp. upper_semilattice) and linorder. 
26139  300 
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

301 

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

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

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

304 

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

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

306 
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

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

308 

26874  309 
* Renamed theorems "power.simps" to "power_int.simps". 
27067  310 
INCOMPATIBILITY. 
25961  311 

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

312 
* Class semiring_div provides basic abstract properties of semirings 
25942  313 
with division and modulo operations. Subsumes former class dvd_mod. 
314 

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

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

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

317 

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

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

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

320 

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

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

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

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

324 

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

326 
syntax. INCOMPATIBILITY. 
25522  327 

328 
* Definitions subset_def, psubset_def, set_diff_def, Compl_def, 

329 
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def, 

330 
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def, 

331 
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def, 

332 
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

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

334 

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

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

338 

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

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

342 

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

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

345 
wellorders on sets and on types. 

26877  346 

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

347 

26197  348 
*** ZF *** 
349 

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

352 

353 
Datatype > Datatype_ZF 

354 
Inductive > Inductive_ZF 

355 
Int > Int_ZF 

356 
IntDiv > IntDiv_ZF 

357 
Nat > Nat_ZF 

358 
List > List_ZF 

359 
Main > Main_ZF 

360 

361 
INCOMPATIBILITY: ZF theories that import individual theories below 

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

363 
available, as trivial extension of Main_ZF. 

26197  364 

365 

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

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

367 

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

370 

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

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

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

373 

27067  374 
* Removed obsolete "use_legacy_bindings" function. 
26188  375 

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

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

377 
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

378 
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

379 
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

380 
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

381 

26874  382 
* Functions system/system_out provide a robust way to invoke external 
27008  383 
shell commands, with propagation of interrupts (requires Poly/ML 5.2). 
26874  384 
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

385 

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

386 

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

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

388 

25971  389 
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs  
390 
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

391 

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

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

393 
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

394 
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

395 

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

398 

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

401 
isatool yxml as described in the Isabelle system manual. 

25651  402 

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

406 

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

409 

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

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

413 
script. 

414 

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

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

417 
optimal performance tuning. The corresponding usedir option M allows 

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

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

420 

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

422 
adverse effect of Isabelle flooding interactive frontends (notably 

423 
ProofGeneral / XEmacs). 

424 

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

425 

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

426 

25429  427 
New in Isabelle2007 (November 2007) 
428 
 

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

429 

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

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

431 

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

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

22826  436 

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

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

438 
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

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

440 

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

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

442 
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

443 
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

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

445 

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

448 
quotes. 

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

449 

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

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

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

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

453 
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

454 
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

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

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

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

458 
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

459 

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

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

461 
identification, instead of the traditional scheme of full physical 
23889  462 
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

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

464 
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

465 
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

466 

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

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

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

471 

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

473 
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

474 
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

475 
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

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

477 
'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

478 

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

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

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

483 
ambiguities introduced later on. INCOMPATIBILITY: constants in parse 

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

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

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

487 

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

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

489 
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

490 
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

491 
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

492 
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

493 
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

494 
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

495 

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

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

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

498 
support a specific search form (see ProofGeneral/CHANGES). 
22965  499 

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

502 
suppressed from proof state output. Note that the ProofGeneral 

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

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

505 
limit is imposed. 

506 

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

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

508 
``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

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

510 
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

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

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

513 

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

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

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

516 

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

517 

17865  518 
*** Document preparation *** 
519 

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

522 
current context. 

21339  523 

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

17865  526 

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

21735  529 
arguments may be given on the LHS.) 
21717  530 

531 

17779  532 
*** Pure *** 
533 

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

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

538 
constants with qualified polymorphism (according to the class 

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

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

541 
between global polymorphic consts and internal locale representation. 

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

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

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

548 

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

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

551 
writing SML code to a file: 
25199  552 
export_code <list of constants (term syntax)> in SML <filename> 
22735  553 
writing OCaml code to a file: 
25199  554 
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

555 
writing Haskell code to a bunch of files: 
25199  556 
export_code <list of constants (term syntax)> in Haskell <filename> 
557 

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

25184  559 
method ``eval'' 
560 

561 
Reasonable default setup of framework in HOL. 

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

562 

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

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

564 

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

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

568 
[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

569 

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

571 

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

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

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

574 

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

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

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

577 

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

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

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

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

581 

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

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

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

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

585 

25199  586 
code_instance and code_class only are effective to target Haskell. 
22735  587 

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

24800  590 
generation from Isabelle/HOL theories is available via "isatool doc 
591 
codegen". 

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

592 

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

595 
annotations). 

596 

19254  597 
* Command 'no_translations' removes translation rules from theory 
598 
syntax. 

599 

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

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

603 
correspondence to type class and instance declarations. 

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

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

19711  606 

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

608 
instantiation that matches an instance against the most general 

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

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

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

612 
recursion over such type arguments. Incomplete specification patterns 

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

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

617 

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

620 
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

621 
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

622 
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

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

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

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

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

627 
toplevel undo/redo and fail to work with multithreading. 
24086  628 

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

629 
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

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

631 

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

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

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

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

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

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

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

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

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

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

641 

24086  642 
* Named collections of theorems may be easily installed as context 
24800  643 
data using the functor NamedThmsFun (see also 
24086  644 
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

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

646 
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

647 
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

648 
order. 
24086  649 

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

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

653 
difference of the original declaration context wrt. the application 

654 
context encountered later on. 

655 

656 
* Isar: proper interfaces for simplification procedures. Command 

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

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

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

660 

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

662 
abbreviates a theorem reference involving an internal dummy fact, 

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

664 
the background context will persist. This form of inplace 

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

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

667 

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

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

669 
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

670 
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

671 
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

672 
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

673 
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

674 
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

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

676 

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

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

678 
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

679 
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

680 
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

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

682 

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

685 

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

687 
then guess x and y by clarify 

688 

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

690 
proof tools being involved here. 

691 

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

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

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

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

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

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

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

700 

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

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

18020  704 

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

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

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

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

709 

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

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

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

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

713 

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

716 

18308  717 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
718 

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

720 

18540  721 
* Isar: added command 'unfolding', which is structurally similar to 
722 
'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

723 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  724 
'unfolded' attribute may be replaced by firstclass proof text. 
725 

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

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

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

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

729 
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

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

731 

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

734 

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

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

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

740 
originally first one. 

19220  741 

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

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

743 
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

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

745 

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

748 
(essentially a disjunction of cases with local parameters and 

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

18910  750 
adequately; in this notation common elimination rules look like this: 
18901  751 

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

753 
assumes "EX x. P x" 

754 
obtains x where "P x" 

755 

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

757 
assumes "A & B" 

758 
obtains A and B 

759 

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

761 
assumes "A  B" 

762 
obtains 

763 
A 

764 
 B 

765 

18910  766 
The subsequent classical rules even refer to the formal "thesis" 
18901  767 
explicitly: 
768 

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

770 
obtains "~ thesis" 

771 

18910  772 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
773 
obtains "thesis ==> something" 

18901  774 

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

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

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

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

780 
case_names). 

18901  781 

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

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

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

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

785 
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

786 

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

789 
toplevel lemma. 

790 

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

793 

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

796 
to occur. 

797 

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

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

799 
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

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

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

802 

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

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

804 
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

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

806 

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

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

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

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

812 
current context. 

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

813 

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

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

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

818 

19665  819 
axiomatization 
21595  820 
eq (infix "===" 50) where 
821 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

822 

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

824 
definition g where "g x = f x x" 

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

825 

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

829 

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

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

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

19088  834 
parameters implicit and using the original short name. See also 
25177  835 
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic 
19083  836 
entities from a monomorphic theory. 
837 

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

19363  839 
not inherited by general import expressions. Also note that 
840 
'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

841 
'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

842 
prevents folding of abbreviations in term output. 
19084  843 

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

844 
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

845 
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

846 
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

847 
'translations' with explicit "CONST" markup to accommodate this. 
19665  848 

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

851 
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

852 

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

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

854 

24738  855 
inductive conj for A B 
856 
where "A ==> B ==> conj A B" 

857 

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

860 
abbreviations on output. 

861 

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

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

865 
endomorphisms as locale endom = homom mult mult h. 

19783  866 

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

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

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

871 
predicates, goals repesenting already interpreted fragments are not 

872 
removed automatically. Use methods `intro_locales' and 

873 
`unfold_locales'; see below. 

874 

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

876 
provide backward reasoning on locales predicates. The methods are 

877 
aware of interpretations and discharge corresponding goals. 

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

879 
unfold predicates to assumptions. 

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

880 

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

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

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

884 

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

887 
unfolded in interpreted theorems. This is useful for replacing 

888 
defined concepts (constants depending on locale parameters) by 

889 
concepts already existing in the target context. Example: 

890 

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

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

893 

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

896 
partial_order. 

897 

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

901 
(using objectlogic connectives for this purpose has been long 

902 
obsolete anyway). Common proof patterns are explained in 

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

905 
examples. 

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

906 

24859  907 
* 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

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

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

910 
accordingly. INCOMPATIBILITY, proofs need to be structured explicitly, 
25177  911 
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

912 

24859  913 
* Method "induct": mutual induction rules are now specified as a list 
24800  914 
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

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

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

918 

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

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

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

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

923 

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

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

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

926 

24859  927 
* Method "coinduct": dual of induction, see 
18399  928 
src/HOL/Library/Coinductive_List.thy for various examples. 
929 

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

932 

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

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

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

935 

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

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

939 
trace indicates where parts have been suppressed. 

18674  940 

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

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

942 
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

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

944 

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

947 
least one premise. 

948 

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

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

953 

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

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

955 
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

956 
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

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

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

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

960 

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

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

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

963 
for example "A > B" => "Pi A (%_. B)". 
17779  964 

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

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

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

967 

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

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

970 

17865  971 

17806  972 
*** HOL *** 
973 

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

976 
Examples are in the directory MetisExamples. WARNING: the 

977 
Isabelle/HOLMetis integration does not yet work properly with 

978 
multithreading. 

979 

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

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

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

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

984 
work with multithreading. 

985 

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

988 
auto_quickcheck (default true) and auto_quickcheck_time_limit (default 

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

24804  991 

25184  992 
* New constant "undefined" with axiom "undefined x = undefined". 
993 

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

995 
equality. 

996 

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

998 
the new 'class' package: 

999 

1000 
HOL.abs ~> HOL.abs_class.abs 

1001 
HOL.divide ~> HOL.divide_class.divide 

1002 
0 ~> HOL.zero_class.zero 

1003 
1 ~> HOL.one_class.one 

1004 
op + ~> HOL.plus_class.plus 

1005 
op  ~> HOL.minus_class.minus 

1006 
uminus ~> HOL.minus_class.uminus 

1007 
op * ~> HOL.times_class.times 

1008 
op < ~> HOL.ord_class.less 

1009 
op <= > HOL.ord_class.less_eq 

1010 
Nat.power ~> Power.power_class.power 

1011 
Nat.size ~> Nat.size_class.size 

1012 
Numeral.number_of ~> Numeral.number_class.number_of 

1013 
FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf 

1014 
FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup 

1015 
Orderings.min ~> Orderings.ord_class.min 

1016 
Orderings.max ~> Orderings.ord_class.max 

1017 
Divides.op div ~> Divides.div_class.div 

1018 
Divides.op mod ~> Divides.div_class.mod 

1019 
Divides.op dvd ~> Divides.div_class.dvd 

1020 

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

1022 

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

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

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

1026 
names. 

1027 

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

1029 
INCOMPATIBILITY: use more specific names. 

1030 

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

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

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

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

1035 
distribution). INCOMPATIBILITY: rewrite proofs 

1036 

1037 
d) ML code directly refering to constant names 

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

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

1040 
Consider using @{const_name} antiquotation. 

1041 

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

1043 

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

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

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

1047 
sgn_div_norm; ordered_idom now also inherits from sgn_if. 

1048 
INCOMPATIBILITY. 

1049 

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

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

1052 

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

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

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

1056 

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

1058 
changed order of proof goals in instance proofs. 

1059 

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

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

1062 
in all contexts importing or interpreting the corresponding locales. 

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

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

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

1066 
in the current context. 

1067 

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

1069 
lemmas max_of_mono and min_of_mono with this predicate. 

1070 
INCOMPATIBILITY. 

1071 

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

1073 
with new class dense_linear_order. 

1074 

1075 
* Uniform lattice theory development in HOL. 

1076 

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

1078 
constant "Meet" now named "Inf" 

1079 

1080 
classes "meet_semilorder" and "join_semilorder" now named 

1081 
"lower_semilattice" and "upper_semilattice" 

1082 
class "lorder" now named "lattice" 

1083 
class "comp_lat" now named "complete_lattice" 

1084 

1085 
Instantiation of lattice classes allows explicit definitions 

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

1087 

1088 
INCOMPATIBILITY. Theorem renames: 

1089 

1090 
meet_left_le ~> inf_le1 

1091 
meet_right_le ~> inf_le2 

1092 
join_left_le ~> sup_ge1 

1093 
join_right_le ~> sup_ge2 

1094 
meet_join_le ~> inf_sup_ord 

1095 
le_meetI ~> le_infI 

1096 
join_leI ~> le_supI 

1097 
le_meet ~> le_inf_iff 

1098 
le_join ~> ge_sup_conv 

1099 
meet_idempotent ~> inf_idem 

1100 
join_idempotent ~> sup_idem 

1101 
meet_comm ~> inf_commute 

1102 
join_comm ~> sup_commute 

1103 
meet_leI1 ~> le_infI1 

1104 
meet_leI2 ~> le_infI2 

1105 
le_joinI1 ~> le_supI1 

1106 
le_joinI2 ~> le_supI2 

1107 
meet_assoc ~> inf_assoc 

1108 
join_assoc ~> sup_assoc 

1109 
meet_left_comm ~> inf_left_commute 

1110 
meet_left_idempotent ~> inf_left_idem 

1111 
join_left_comm ~> sup_left_commute 

1112 
join_left_idempotent ~> sup_left_idem 

1113 
meet_aci ~> inf_aci 

1114 
join_aci ~> sup_aci 

1115 
le_def_meet ~> le_iff_inf 

1116 
le_def_join ~> le_iff_sup 

1117 
join_absorp2 ~> sup_absorb2 

1118 
join_absorp1 ~> sup_absorb1 

1119 
meet_absorp1 ~> inf_absorb1 

1120 
meet_absorp2 ~> inf_absorb2 

1121 
meet_join_absorp ~> inf_sup_absorb 

1122 
join_meet_absorp ~> sup_inf_absorb 

1123 
distrib_join_le ~> distrib_sup_le 

1124 
distrib_meet_le ~> distrib_inf_le 

1125 

1126 
add_meet_distrib_left ~> add_inf_distrib_left 

1127 
add_join_distrib_left ~> add_sup_distrib_left 

1128 
is_join_neg_meet ~> is_join_neg_inf 

1129 
is_meet_neg_join ~> is_meet_neg_sup 

1130 
add_meet_distrib_right ~> add_inf_distrib_right 

1131 
add_join_distrib_right ~> add_sup_distrib_right 

1132 
add_meet_join_distribs ~> add_sup_inf_distribs 

1133 
join_eq_neg_meet ~> sup_eq_neg_inf 

1134 
meet_eq_neg_join ~> inf_eq_neg_sup 

1135 
add_eq_meet_join ~> add_eq_inf_sup 

1136 
meet_0_imp_0 ~> inf_0_imp_0 

1137 
join_0_imp_0 ~> sup_0_imp_0 

1138 
meet_0_eq_0 ~> inf_0_eq_0 

1139 
join_0_eq_0 ~> sup_0_eq_0 

1140 
neg_meet_eq_join ~> neg_inf_eq_sup 

1141 
neg_join_eq_meet ~> neg_sup_eq_inf 

1142 
join_eq_if ~> sup_eq_if 

1143 

1144 
mono_meet ~> mono_inf 

1145 
mono_join ~> mono_sup 

1146 
meet_bool_eq ~> inf_bool_eq 

1147 
join_bool_eq ~> sup_bool_eq 

1148 
meet_fun_eq ~> inf_fun_eq 

1149 
join_fun_eq ~> sup_fun_eq 

1150 
meet_set_eq ~> inf_set_eq 

1151 
join_set_eq ~> sup_set_eq 

1152 
meet1_iff ~> inf1_iff 

1153 
meet2_iff ~> inf2_iff 

1154 
meet1I ~> inf1I 

1155 
meet2I ~> inf2I 

1156 
meet1D1 ~> inf1D1 

1157 
meet2D1 ~> inf2D1 

1158 
meet1D2 ~> inf1D2 

1159 
meet2D2 ~> inf2D2 

1160 
meet1E ~> inf1E 

1161 
meet2E ~> inf2E 

1162 
join1_iff ~> sup1_iff 

1163 
join2_iff ~> sup2_iff 

1164 
join1I1 ~> sup1I1 

1165 
join2I1 ~> sup2I1 

1166 
join1I1 ~> sup1I1 

1167 
join2I2 ~> sup1I2 

1168 
join1CI ~> sup1CI 

1169 
join2CI ~> sup2CI 

1170 
join1E ~> sup1E 

1171 
join2E ~> sup2E 

1172 

1173 
is_meet_Meet ~> is_meet_Inf 

1174 
Meet_bool_def ~> Inf_bool_def 

1175 
Meet_fun_def ~> Inf_fun_def 

1176 
Meet_greatest ~> Inf_greatest 

1177 
Meet_lower ~> Inf_lower 

1178 
Meet_set_def ~> Inf_set_def 

1179 

1180 
Sup_def ~> Sup_Inf 

1181 
Sup_bool_eq ~> Sup_bool_def 

1182 
Sup_fun_eq ~> Sup_fun_def 

1183 
Sup_set_eq ~> Sup_set_def 

1184 

1185 
listsp_meetI ~> listsp_infI 

1186 
listsp_meet_eq ~> listsp_inf_eq 

1187 

1188 
meet_min ~> inf_min 

1189 
join_max ~> sup_max 

1190 

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

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

1193 

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

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

25184  1197 
"*.size". 
1198 

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

1200 
INCOMPATIBILITY. 

24800  1201 

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

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

1204 
fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY. 

1205 

25129  1206 
* HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY. 
1207 

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

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

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

1212 
lemmas on overflow and monotonicity. Instantiated to all appropriate 

1213 
arithmetic type classes, supporting automatic simplification of 

1214 
numerals on all operations. 

24333  1215 

1216 
* Library/Boolean_Algebra: locales for abstract boolean algebras. 

1217 

1218 
* Library/Numeral_Type: numbers as types, e.g. TYPE(32). 

1219 

23850  1220 
* Code generator library theories: 
24993  1221 
 Code_Integer represents HOL integers by big integer literals in target 
23850  1222 
languages. 
24993  1223 
 Code_Char represents HOL characters by character literals in target 
23850  1224 
languages. 
24993  1225 
 Code_Char_chr like Code_Char, but also offers treatment of character 
1226 
codes; includes Code_Integer. 

24800  1227 
 Executable_Set allows to generate code for finite sets using lists. 
1228 
 Executable_Rat implements rational numbers as triples (sign, enumerator, 

23850  1229 
denominator). 
24800  1230 
 Executable_Real implements a subset of real numbers, namly those 
23850  1231 
representable by rational numbers. 
24800  1232 
 Efficient_Nat implements natural numbers by integers, which in general will 
23850  1233 
result in higher efficency; pattern matching with 0/Suc is eliminated; 
24993  1234 
includes Code_Integer. 
1235 
 Code_Index provides an additional datatype index which is mapped to 

1236 
targetlanguage builtin integers. 

26355  1237 
 Code_Message provides an additional datatype message_string which is isomorphic to 
24993  1238 
strings; messages are mapped to targetlanguage strings. 
23850  1239 

23783
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1240 
* New package for inductive predicates 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1241 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1242 
An nary predicate p with m parameters z_1, ..., z_m can now be defined via 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1243 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1244 
inductive 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1245 
p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1246 
for z_1 :: U_1 and ... and z_n :: U_m 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1247 
where 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1248 
rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1249 
 ... 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1250 

24800  1251 
with full support for typeinference, rather than 
23783
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1252 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1253 
consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1254 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1255 
abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1256 
where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1257 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1258 
inductive "s z_1 ... z_m" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1259 
intros 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1260 
rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1261 
... 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1262 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1263 
For backward compatibility, there is a wrapper allowing inductive 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1264 
sets to be defined with the new package via 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1265 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1266 
inductive_set 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1267 
s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1268 
for z_1 :: U_1 and ... and z_n :: U_m 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1269 
where 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1270 
rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1271 
 ... 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1272 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1273 
or 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1274 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1275 
inductive_set 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1276 
s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1277 
and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1278 
for z_1 :: U_1 and ... and z_n :: U_m 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1279 
where 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1280 
"p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1281 
 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1282 
 ... 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1283 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1284 
if the additional syntax "p ..." is required. 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1285 

25177  1286 
Numerous examples can be found in the subdirectories src/HOL/Auth, 
1287 
src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava. 

23783
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1288 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1289 
INCOMPATIBILITIES: 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1290 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1291 
 Since declaration and definition of inductive sets or predicates 
24800  1292 
is no longer separated, abbreviations involving the newly 
1293 
introduced sets or predicates must be specified together with the 

1294 
introduction rules after the 'where' keyword (see above), rather 

1295 
than before the actual inductive definition. 

1296 

1297 
 The variables in induction and elimination rules are now 

1298 
quantified in the order of their occurrence in the introduction 

1299 
rules, rather than in alphabetical order. Since this may break 

1300 
some proofs, these proofs either have to be repaired, e.g. by 

1301 
reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case' 

1302 
statements of the form 

23783
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1303 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1304 
case (rule_i a_i_1 ... a_i_{k_i}) 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1305 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1306 
or the old order of quantification has to be restored by explicitly adding 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1307 
metalevel quantifiers in the introduction rules, i.e. 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1308 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1309 
 rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1310 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1311 
 The format of the elimination rules is now 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1312 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1313 
p z_1 ... z_m x_1 ... x_n ==> 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1314 
(!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P) 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1315 
==> ... ==> P 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1316 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1317 
for predicates and 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1318 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1319 
(x_1, ..., x_n) : s z_1 ... z_m ==> 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1320 
(!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P) 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1321 
==> ... ==> P 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1322 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1323 
for sets rather than 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1324 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1325 
x : s z_1 ... z_m ==> 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1326 
(!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P) 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1327 
==> ... ==> P 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1328 

24800  1329 
This may require terms in goals to be expanded to ntuples 
1330 
(e.g. using case_tac or simplification with the split_paired_all 

1331 
rule) before the above elimination rule is applicable. 

1332 

1333 
 The elimination or case analysis rules for (mutually) inductive 

1334 
sets or predicates are now called "p_1.cases" ... "p_k.cases". The 

1335 
list of rules "p_1_..._p_k.elims" is no longer available. 

23783
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1336 

25198  1337 
* New package "function"/"fun" for general recursive functions, 
1338 
supporting mutual and nested recursion, definitions in local contexts, 

1339 
more general pattern matching and partiality. See HOL/ex/Fundefs.thy 

1340 
for small examples, and the separate tutorial on the function 

1341 
package. The old recdef "package" is still available as before, but 

1342 
users are encouraged to use the new package. 

1343 

1344 
* Method "lexicographic_order" automatically synthesizes termination 

1345 
relations as lexicographic combinations of size measures. 

1346 

24800  1347 
* Caseexpressions allow arbitrary constructorpatterns (including 
1348 
"_") and take their order into account, like in functional 

1349 
programming. Internally, this is translated into nested 

1350 
caseexpressions; missing cases are added and mapped to the predefined 

1351 
constant "undefined". In complicated cases printing may no longer show 

1352 
the original input but the internal form. Lambdaabstractions allow 

1353 
the same form of pattern matching: "% pat1 => e1  ..." is an 

1354 
abbreviation for "%x. case x of pat1 => e1  ..." where x is a new 

1355 
variable. 

23564  1356 

23468  1357 
* IntDef: The constant "int :: nat => int" has been removed; now "int" 
24800  1358 
is an abbreviation for "of_nat :: nat => int". The simplification 
1359 
rules for "of_nat" have been changed to work like "int" did 

1360 
previously. Potential INCOMPATIBILITY: 

23468  1361 
 "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1" 
1362 
 of_nat_diff and of_nat_mult are no longer default simp rules 

23377  1363 

23295
86e225406859
Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents:
23251
diff
changeset

1364 
* Method "algebra" solves polynomial equations over (semi)rings using 
24800  1365 
Groebner bases. The (semi)ring structure is defined by locales and the 
1366 
tool setup depends on that generic context. Installing the method for 

1367 
a specific type involves instantiating the locale and possibly adding 

1368 
declarations for computation on the coefficients. The method is 

1369 
already instantiated for natural numbers and for the axiomatic class 

1370 
of idoms with numerals. See also the paper by Chaieb and Wenzel at 

1371 
CALCULEMUS 2007 for the general principles underlying this 

1372 
architecture of contextaware prooftools. 

1373 

25033  1374 
* Method "ferrack" implements quantifier elimination over 
1375 
specialpurpose dense linear orders using locales (analogous to 

1376 
"algebra"). The method is already installed for class 

1377 
{ordered_field,recpower,number_ring} which subsumes real, hyperreal, 

1378 
rat, etc. 

1379 

24800  1380 
* Former constant "List.op @" now named "List.append". Use ML 
1381 
antiquotations @{const_name List.append} or @{term " ... @ ... "} to 

1382 
circumvent possible incompatibilities when working on ML level. 

1383 

24996  1384 
* primrec: missing cases mapped to "undefined" instead of "arbitrary". 
22845  1385 

24800  1386 
* New function listsum :: 'a list => 'a for arbitrary monoids. 
1387 
Special syntax: "SUM x < xs. f x" (and latex variants) 

1388 

1389 
* New syntax for Haskelllike list comprehension (input only), eg. 

25177  1390 
[(x,y). x < xs, y < ys, x ~= y], see also src/HOL/List.thy. 
24800  1391 

1392 
* The special syntax for function "filter" has changed from [x : 

1393 
xs. P] to [x < xs. P] to avoid an ambiguity caused by list 

1394 
comprehension syntax, and for uniformity. INCOMPATIBILITY. 

1395 

1396 
* [a..b] is now defined for arbitrary linear orders. It used to be 

1397 
defined on nat only, as an abbreviation for [a..<Suc b] 

1398 
INCOMPATIBILITY. 

1399 

1400 
* Renamed lemma "set_take_whileD" to "set_takeWhileD". 

1401 

25177  1402 
* New functions "sorted" and "sort" in src/HOL/List.thy. 
24800  1403 

1404 
* New lemma collection field_simps (an extension of ring_simps) for 

1405 
manipulating (in)equations involving division. Multiplies with all 

1406 
denominators that can be proved to be nonzero (in equations) or 

1407 
positive/negative (in inequations). 

23480  1408 

1409 
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib 

24800  1410 
have been improved and renamed to ring_simps, group_simps and 
1411 
ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field 

1412 
because they were subsumed by lemmas xyz. INCOMPATIBILITY. 
