author  wenzelm 
Sat, 14 Jun 2008 23:52:51 +0200  
changeset 27221  31328dc30196 
parent 27200  00b7b55b61bd 
child 27246  df85326af57c 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

27122  4 
New in this Isabelle version 
5 
 

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

6 

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

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

8 

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

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

12 

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

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

15 

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

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

17 

27200  18 
* Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML 
19 
interface instead. 

20 

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

21 

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

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

23 

27122  24 
* Methods "case_tac" and "induct_tac" now refer to the very same rule 
25 
declarations as the structured Isar versions "cases" and "induct", cf. 

26 
the corresponding "cases" and "induct" attributes. INCOMPATIBILITY, 

27 
in rare situations a different rule is selected  notably nested 

28 
tuple elimination instead of former prod.exhaust: use explicit 

27145  29 
(case_tac t rule: prod.exhaust) here. Oldstyle rules for mutual and 
30 
nested datatypes also need to be given explicitly. 

27122  31 

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

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

33 

27122  34 
* Removed fact "case_split_thm", which duplicates "case_split". 
35 

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

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

38 
represented as datatype. The characteristic theorems have to be 

39 
proven. INCOMPATIBILITY. Also observe that the following theorems 

40 
have disappeared in favour of existing ones: 

41 

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

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

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

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

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

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

47 

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

48 
* 'Least' operator now restricted to class 'order' (and subclasses). 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

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

50 

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

53 
theorems. Changes in simp rules. INCOMPATIBILITY. 

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

54 

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

55 

27143  56 

27008  57 
New in Isabelle2008 (June 2008) 
58 
 

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

59 

25522  60 
*** General *** 
61 

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

64 

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

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

68 
provides a proper context already. 

69 

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

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

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

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

73 

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

26659  76 
space take precedence. INCOMPATIBILITY in rare situations, may try to 
26650  77 
swap theory imports. 
78 

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

81 

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

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

84 
white space without escapes. 

85 

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

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

88 
"foo_bar". 

89 

25522  90 

25502  91 
*** Pure *** 
92 

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

95 

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

98 

99 
(1) unused_thms 

100 
Only finds unused theorems in the current theory. 

101 

102 
(2) unused_thms thy_1 ... thy_n  

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

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

105 

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

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

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

109 
their ancestors. 

110 

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

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

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

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

118 

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

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

26874  121 
usually the case when using Proof General with the default settings). 
26681  122 

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

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

126 
that tools may maintain dynamically scoped facts systematically, using 

127 
PureThy.add_thms_dynamic. 

128 

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

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

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

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

133 
update of theories within ML code. 
26479  134 

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

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

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

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

138 
depending on former CPure need to refer to Pure. 
26650  139 

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

143 
INCOMPATIBILITY. 

144 

26874  145 
* Command 'setup': discontinued implicit version with ML reference. 
26434  146 

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

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

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

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

25502  152 

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

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

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

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

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

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

158 

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

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

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

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

162 

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

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

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

165 

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

168 
predicates. 

26765  169 

170 

26762  171 
*** Document preparation *** 
172 

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

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

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

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

26914  179 

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

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

26762  183 

184 

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

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

186 

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

189 
"primrec" command distinguishes oldstyle and newstyle specifications 

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

191 
When adjusting theories, beware: constants stemming from newstyle 

192 
primrec specifications have authentic syntax. 

193 

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

195 
with multithreading. 

196 

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

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

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

200 

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

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

203 
reconstruction_modulus, reconstruction_sorts renamed 

204 
sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY. 

205 

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

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

209 
and makes them available separately. See 

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

211 

212 
* More flexible generation of measure functions for termination 

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

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

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

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

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

218 
type and generates all solutions by prologstyle backwards proof using 

219 
the declared rules. 

220 

221 
This setup also deals with rules like 

222 

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

224 

225 
which accommodates nested datatypes that recurse through lists. 

226 
Similar rules are predeclared for products and option types. 

227 

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

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

229 

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

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

231 

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

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

234 

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

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

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

238 

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

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

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

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

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

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

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

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

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

247 

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

248 
 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

249 
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

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

251 

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

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

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

254 

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

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

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

257 

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

260 

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

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

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

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

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

265 

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

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

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

268 

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

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

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

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

272 

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

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

275 

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

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

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

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

279 

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

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

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

282 

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

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

284 

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

287 
type of the form 

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

288 

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

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

290 

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

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

292 

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

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

294 

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

297 

26513  298 
* Explicit class "eq" for executable equality. INCOMPATIBILITY. 
299 

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

26445  302 
INCOMPATIBILITY. 
303 

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

306 

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

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

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

309 

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

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

26355  313 

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

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

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

316 

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

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

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

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

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

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

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

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

324 

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

325 
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

326 
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

327 
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

328 

26231  329 
* Library/Option_ord.thy: Canonical order on option type. 
330 

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

26197  333 

26231  334 
* Library/Countable.thy: Type class for countable types. 
335 

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

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

337 
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

338 
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

339 
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

340 
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

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

342 

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

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

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

345 
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

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

347 

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

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

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

351 
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

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

354 

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

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

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

357 

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

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

359 
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

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

361 

26874  362 
* Renamed theorems "power.simps" to "power_int.simps". 
27067  363 
INCOMPATIBILITY. 
25961  364 

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

365 
* Class semiring_div provides basic abstract properties of semirings 
25942  366 
with division and modulo operations. Subsumes former class dvd_mod. 
367 

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

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

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

370 

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

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

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

373 

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

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

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

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

377 

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

379 
syntax. INCOMPATIBILITY. 
25522  380 

381 
* Definitions subset_def, psubset_def, set_diff_def, Compl_def, 

382 
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def, 

383 
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def, 

384 
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def, 

385 
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

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

387 

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

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

391 

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

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

395 

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

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

398 
wellorders on sets and on types. 

26877  399 

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

400 

26197  401 
*** ZF *** 
402 

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

405 

406 
Datatype > Datatype_ZF 

407 
Inductive > Inductive_ZF 

408 
Int > Int_ZF 

409 
IntDiv > IntDiv_ZF 

410 
Nat > Nat_ZF 

411 
List > List_ZF 

412 
Main > Main_ZF 

413 

414 
INCOMPATIBILITY: ZF theories that import individual theories below 

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

416 
available, as trivial extension of Main_ZF. 

26197  417 

418 

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

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

420 

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

423 

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

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

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

426 

27067  427 
* Removed obsolete "use_legacy_bindings" function. 
26188  428 

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

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

430 
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

431 
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

432 
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

433 
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

434 

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

438 

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

439 

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

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

441 

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

444 

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

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

446 
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

447 
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

448 

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

451 

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

454 
isatool yxml as described in the Isabelle system manual. 

25651  455 

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

459 

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

462 

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

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

466 
script. 

467 

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

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

470 
optimal performance tuning. The corresponding usedir option M allows 

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

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

473 

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

475 
adverse effect of Isabelle flooding interactive frontends (notably 

476 
ProofGeneral / XEmacs). 

477 

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

478 

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

479 

25429  480 
New in Isabelle2007 (November 2007) 
481 
 

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

482 

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

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

484 

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

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

22826  489 

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

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

491 
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

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

493 

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

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

495 
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

496 
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

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

498 

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

501 
quotes. 

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

502 

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

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

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

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

506 
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

507 
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

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

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

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

511 
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

512 

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

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

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

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

517 
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

518 
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

519 

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

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

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

524 

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

526 
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

527 
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

528 
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

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

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

531 

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

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

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

536 
ambiguities introduced later on. INCOMPATIBILITY: constants in parse 

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

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

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

540 

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

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

542 
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

543 
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

544 
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

545 
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

546 
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

547 
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

548 

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

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

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

551 
support a specific search form (see ProofGeneral/CHANGES). 
22965  552 

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

555 
suppressed from proof state output. Note that the ProofGeneral 

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

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

558 
limit is imposed. 

559 

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

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

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

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

563 
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

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

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

566 

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

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

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

569 

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

570 

17865  571 
*** Document preparation *** 
572 

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

575 
current context. 

21339  576 

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

17865  579 

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

21735  582 
arguments may be given on the LHS.) 
21717  583 

584 

17779  585 
*** Pure *** 
586 

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

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

591 
constants with qualified polymorphism (according to the class 

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

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

594 
between global polymorphic consts and internal locale representation. 

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

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

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

601 

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

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

604 
writing SML code to a file: 
25199  605 
export_code <list of constants (term syntax)> in SML <filename> 
22735  606 
writing OCaml code to a file: 
25199  607 
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

608 
writing Haskell code to a bunch of files: 
25199  609 
export_code <list of constants (term syntax)> in Haskell <filename> 
610 

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

25184  612 
method ``eval'' 
613 

614 
Reasonable default setup of framework in HOL. 

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

615 

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

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

617 

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

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

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

622 

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

624 

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

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

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

627 

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

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

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

630 

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

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

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

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

634 

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

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

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

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

638 

25199  639 
code_instance and code_class only are effective to target Haskell. 
22735  640 

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

24800  643 
generation from Isabelle/HOL theories is available via "isatool doc 
644 
codegen". 

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

645 

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

648 
annotations). 

649 

19254  650 
* Command 'no_translations' removes translation rules from theory 
651 
syntax. 

652 

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

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

656 
correspondence to type class and instance declarations. 

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

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

19711  659 

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

661 
instantiation that matches an instance against the most general 

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

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

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

665 
recursion over such type arguments. Incomplete specification patterns 

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

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

670 

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

673 
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

674 
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

675 
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

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

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

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

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

680 
toplevel undo/redo and fail to work with multithreading. 
24086  681 

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

682 
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

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

684 

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

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

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

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

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

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

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

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

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

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

694 

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

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

699 
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

700 
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

701 
order. 
24086  702 

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

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

706 
difference of the original declaration context wrt. the application 

707 
context encountered later on. 

708 

709 
* Isar: proper interfaces for simplification procedures. Command 

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

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

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

713 

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

715 
abbreviates a theorem reference involving an internal dummy fact, 

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

717 
the background context will persist. This form of inplace 

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

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

720 

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

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

722 
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

723 
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

724 
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

725 
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

726 
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

727 
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

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

729 

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

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

731 
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

732 
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

733 
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

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

735 

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

738 

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

740 
then guess x and y by clarify 

741 

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

743 
proof tools being involved here. 

744 

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

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

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

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

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

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

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

753 

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

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

18020  757 

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

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

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

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

762 

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

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

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

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

766 

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

769 

18308  770 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
771 

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

773 

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

776 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  777 
'unfolded' attribute may be replaced by firstclass proof text. 
778 

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

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

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

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

782 
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

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

784 

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

787 

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

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

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

793 
originally first one. 

19220  794 

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

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

796 
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

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

798 

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

801 
(essentially a disjunction of cases with local parameters and 

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

18910  803 
adequately; in this notation common elimination rules look like this: 
18901  804 

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

806 
assumes "EX x. P x" 

807 
obtains x where "P x" 

808 

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

810 
assumes "A & B" 

811 
obtains A and B 

812 

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

814 
assumes "A  B" 

815 
obtains 

816 
A 

817 
 B 

818 

18910  819 
The subsequent classical rules even refer to the formal "thesis" 
18901  820 
explicitly: 
821 

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

823 
obtains "~ thesis" 

824 

18910  825 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
826 
obtains "thesis ==> something" 

18901  827 

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

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

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

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

833 
case_names). 

18901  834 

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

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

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

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

838 
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

839 

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

842 
toplevel lemma. 

843 

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

846 

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

849 
to occur. 

850 

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

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

852 
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

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

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

855 

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

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

857 
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

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

859 

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

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

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

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

865 
current context. 

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

866 

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

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

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

871 

19665  872 
axiomatization 
21595  873 
eq (infix "===" 50) where 
874 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

875 

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

877 
definition g where "g x = f x x" 

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

878 

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

882 

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

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

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

19088  887 
parameters implicit and using the original short name. See also 
25177  888 
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic 
19083  889 
entities from a monomorphic theory. 
890 

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

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

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

895 
prevents folding of abbreviations in term output. 
19084  896 

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

897 
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

898 
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

899 
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

900 
'translations' with explicit "CONST" markup to accommodate this. 
19665  901 

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

904 
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

905 

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

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

907 

24738  908 
inductive conj for A B 
909 
where "A ==> B ==> conj A B" 

910 

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

913 
abbreviations on output. 

914 

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

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

918 
endomorphisms as locale endom = homom mult mult h. 

19783  919 

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

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

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

924 
predicates, goals repesenting already interpreted fragments are not 

925 
removed automatically. Use methods `intro_locales' and 

926 
`unfold_locales'; see below. 

927 

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

929 
provide backward reasoning on locales predicates. The methods are 

930 
aware of interpretations and discharge corresponding goals. 

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

932 
unfold predicates to assumptions. 

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

933 

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

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

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

937 

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

940 
unfolded in interpreted theorems. This is useful for replacing 

941 
defined concepts (constants depending on locale parameters) by 

942 
concepts already existing in the target context. Example: 

943 

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

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

946 

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

949 
partial_order. 

950 

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

954 
(using objectlogic connectives for this purpose has been long 

955 
obsolete anyway). Common proof patterns are explained in 

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

958 
examples. 

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

959 

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

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

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

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

965 

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

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

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

971 

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

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

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

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

976 

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

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

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

979 

24859  980 
* Method "coinduct": dual of induction, see 
18399  981 
src/HOL/Library/Coinductive_List.thy for various examples. 
982 

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

985 

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

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

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

988 

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

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

992 
trace indicates where parts have been suppressed. 

18674  993 

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

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

995 
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

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

997 

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

1000 
least one premise. 

1001 

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

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

1006 

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

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

1008 
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

1009 
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

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

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

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

1013 

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

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

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

1016 
for example "A > B" => "Pi A (%_. B)". 
17779  1017 

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

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

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

1020 

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

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

1023 

17865  1024 

17806  1025 
*** HOL *** 
1026 

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

1029 
Examples are in the directory MetisExamples. WARNING: the 

1030 
Isabelle/HOLMetis integration does not yet work properly with 

1031 
multithreading. 

1032 

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

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

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

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

1037 
work with multithreading. 

1038 

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

1041 
auto_quickcheck (default true) and auto_quickcheck_time_limit (default 

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

24804  1044 

25184  1045 
* New constant "undefined" with axiom "undefined x = undefined". 
1046 

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

1048 
equality. 

1049 

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

1051 
the new 'class' package: 

1052 

1053 
HOL.abs ~> HOL.abs_class.abs 

1054 
HOL.divide ~> HOL.divide_class.divide 

1055 
0 ~> HOL.zero_class.zero 

1056 
1 ~> HOL.one_class.one 

1057 
op + ~> HOL.plus_class.plus 

1058 
op  ~> HOL.minus_class.minus 

1059 
uminus ~> HOL.minus_class.uminus 

1060 
op * ~> HOL.times_class.times 

1061 
op < ~> HOL.ord_class.less 

1062 
op <= > HOL.ord_class.less_eq 

1063 
Nat.power ~> Power.power_class.power 

1064 
Nat.size ~> Nat.size_class.size 

1065 
Numeral.number_of ~> Numeral.number_class.number_of 

1066 
FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf 

1067 
FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup 

1068 
Orderings.min ~> Orderings.ord_class.min 

1069 
Orderings.max ~> Orderings.ord_class.max 

1070 
Divides.op div ~> Divides.div_class.div 

1071 
Divides.op mod ~> Divides.div_class.mod 

1072 
Divides.op dvd ~> Divides.div_class.dvd 

1073 

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

1075 

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

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

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

1079 
names. 

1080 

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

1082 
INCOMPATIBILITY: use more specific names. 

1083 

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

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

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

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

1088 
distribution). INCOMPATIBILITY: rewrite proofs 

1089 

1090 
d) ML code directly refering to constant names 

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

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

1093 
Consider using @{const_name} antiquotation. 

1094 

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

1096 

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

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

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

1100 
sgn_div_norm; ordered_idom now also inherits from sgn_if. 

1101 
INCOMPATIBILITY. 

1102 

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

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

1105 

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

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

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

1109 

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

1111 
changed order of proof goals in instance proofs. 

1112 

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

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

1115 
in all contexts importing or interpreting the corresponding locales. 

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

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

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

1119 
in the current context. 

1120 

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

1122 
lemmas max_of_mono and min_of_mono with this predicate. 

1123 
INCOMPATIBILITY. 

1124 

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

1126 
with new class dense_linear_order. 

1127 

1128 
* Uniform lattice theory development in HOL. 

1129 

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

1131 
constant "Meet" now named "Inf" 

1132 

1133 
classes "meet_semilorder" and "join_semilorder" now named 

1134 
"lower_semilattice" and "upper_semilattice" 

1135 
class "lorder" now named "lattice" 

1136 
class "comp_lat" now named "complete_lattice" 

1137 

1138 
Instantiation of lattice classes allows explicit definitions 

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

1140 

1141 
INCOMPATIBILITY. Theorem renames: 

1142 

1143 
meet_left_le ~> inf_le1 

1144 
meet_right_le ~> inf_le2 

1145 
join_left_le ~> sup_ge1 

1146 
join_right_le ~> sup_ge2 

1147 
meet_join_le ~> inf_sup_ord 

1148 
le_meetI ~> le_infI 

1149 
join_leI ~> le_supI 

1150 
le_meet ~> le_inf_iff 

1151 
le_join ~> ge_sup_conv 

1152 
meet_idempotent ~> inf_idem 

1153 
join_idempotent ~> sup_idem 

1154 
meet_comm ~> inf_commute 

1155 
join_comm ~> sup_commute 

1156 
meet_leI1 ~> le_infI1 

1157 
meet_leI2 ~> le_infI2 

1158 
le_joinI1 ~> le_supI1 

1159 
le_joinI2 ~> le_supI2 

1160 
meet_assoc ~> inf_assoc 

1161 
join_assoc ~> sup_assoc 

1162 
meet_left_comm ~> inf_left_commute 

1163 
meet_left_idempotent ~> inf_left_idem 

1164 
join_left_comm ~> sup_left_commute 

1165 
join_left_idempotent ~> sup_left_idem 

1166 
meet_aci ~> inf_aci 

1167 
join_aci ~> sup_aci 

1168 
le_def_meet ~> le_iff_inf 

1169 
le_def_join ~> le_iff_sup 

1170 
join_absorp2 ~> sup_absorb2 

1171 
join_absorp1 ~> sup_absorb1 

1172 
meet_absorp1 ~> inf_absorb1 

1173 
meet_absorp2 ~> inf_absorb2 

1174 
meet_join_absorp ~> inf_sup_absorb 

1175 
join_meet_absorp ~> sup_inf_absorb 

1176 
distrib_join_le ~> distrib_sup_le 

1177 
distrib_meet_le ~> distrib_inf_le 

1178 

1179 
add_meet_distrib_left ~> add_inf_distrib_left 

1180 
add_join_distrib_left ~> add_sup_distrib_left 

1181 
is_join_neg_meet ~> is_join_neg_inf 

1182 
is_meet_neg_join ~> is_meet_neg_sup 

1183 
add_meet_distrib_right ~> add_inf_distrib_right 

1184 
add_join_distrib_right ~> add_sup_distrib_right 

1185 
add_meet_join_distribs ~> add_sup_inf_distribs 

1186 
join_eq_neg_meet ~> sup_eq_neg_inf 

1187 
meet_eq_neg_join ~> inf_eq_neg_sup 

1188 
add_eq_meet_join ~> add_eq_inf_sup 

1189 
meet_0_imp_0 ~> inf_0_imp_0 

1190 
join_0_imp_0 ~> sup_0_imp_0 

1191 
meet_0_eq_0 ~> inf_0_eq_0 

1192 
join_0_eq_0 ~> sup_0_eq_0 

1193 
neg_meet_eq_join ~> neg_inf_eq_sup 

1194 
neg_join_eq_meet ~> neg_sup_eq_inf 

1195 
join_eq_if ~> sup_eq_if 

1196 

1197 
mono_meet ~> mono_inf 

1198 
mono_join ~> mono_sup 

1199 
meet_bool_eq ~> inf_bool_eq 

1200 
join_bool_eq ~> sup_bool_eq 

1201 
meet_fun_eq ~> inf_fun_eq 

1202 
join_fun_eq ~> sup_fun_eq 

1203 
meet_set_eq ~> inf_set_eq 

1204 
join_set_eq ~> sup_set_eq 

1205 
meet1_iff ~> inf1_iff 

1206 
meet2_iff ~> inf2_iff 

1207 
meet1I ~> inf1I 

1208 
meet2I ~> inf2I 

1209 
meet1D1 ~> inf1D1 

1210 
meet2D1 ~> inf2D1 

1211 
meet1D2 ~> inf1D2 

1212 
meet2D2 ~> inf2D2 

1213 
meet1E ~> inf1E 

1214 
meet2E ~> inf2E 

1215 
join1_iff ~> sup1_iff 

1216 
join2_iff ~> sup2_iff 

1217 
join1I1 ~> sup1I1 

1218 
join2I1 ~> sup2I1 

1219 
join1I1 ~> sup1I1 

1220 
join2I2 ~> sup1I2 

1221 
join1CI ~> sup1CI 

1222 
join2CI ~> sup2CI 

1223 
join1E ~> sup1E 

1224 
join2E ~> sup2E 

1225 

1226 
is_meet_Meet ~> is_meet_Inf 

1227 
Meet_bool_def ~> Inf_bool_def 

1228 
Meet_fun_def ~> Inf_fun_def 

1229 
Meet_greatest ~> Inf_greatest 

1230 
Meet_lower ~> Inf_lower 

1231 
Meet_set_def ~> Inf_set_def 

1232 

1233 
Sup_def ~> Sup_Inf 

1234 
Sup_bool_eq ~> Sup_bool_def 

1235 
Sup_fun_eq ~> Sup_fun_def 

1236 
Sup_set_eq ~> Sup_set_def 

1237 

1238 
listsp_meetI ~> listsp_infI 

1239 
listsp_meet_eq ~> listsp_inf_eq 

1240 

1241 
meet_min ~> inf_min 

1242 
join_max ~> sup_max 

1243 

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

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

1246 

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

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

25184  1250 
"*.size". 
1251 

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

1253 
INCOMPATIBILITY. 

24800  1254 

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

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

1257 
fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY. 

1258 

25129  1259 
* HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY. 
1260 

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

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

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

1265 
lemmas on overflow and monotonicity. Instantiated to all appropriate 

1266 
arithmetic type classes, supporting automatic simplification of 

1267 
numerals on all operations. 

24333  1268 

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

1270 

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

1272 

23850  1273 
* Code generator library theories: 
24993  1274 
 Code_Integer represents HOL integers by big integer literals in target 
23850  1275 
languages. 
24993  1276 
 Code_Char represents HOL characters by character literals in target 
23850  1277 
languages. 
24993  1278 
 Code_Char_chr like Code_Char, but also offers treatment of character 
1279 
codes; includes Code_Integer. 

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

23850  1282 
denominator). 
24800  1283 
 Executable_Real implements a subset of real numbers, namly those 
23850  1284 
representable by rational numbers. 
24800  1285 
 Efficient_Nat implements natural numbers by integers, which in general will 
23850  1286 
result in higher efficency; pattern matching with 0/Suc is eliminated; 
24993  1287 
includes Code_Integer. 
1288 
 Code_Index provides an additional datatype index which is mapped to 

1289 
targetlanguage builtin integers. 

26355  1290 
 Code_Message provides an additional datatype message_string which is isomorphic to 
24993  1291 
strings; messages are mapped to targetlanguage strings. 
23850  1292 

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

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

1294 

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

1295 
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

1296 

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

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

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

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

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

1301 
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

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

1303 

24800  1304 
with full support for typeinference, rather than 
23783
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 
consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1307 

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

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

1309 
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

1310 

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

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

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

1313 
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

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

1315 

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

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

1317 
sets to be defined with the new package via 
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 
inductive_set 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

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

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

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

1323 
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

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

1325 

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

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

1327 

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

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

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

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

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

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

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

1334 
 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

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

1336 

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

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

1338 

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

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

1341 

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

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

1343 

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

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

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

1348 
than before the actual inductive definition. 

1349 

1350 
 The variables in induction and elimination rules are now 

1351 
quantified in the order of their occurrence in the introduction 

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

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

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

1355 
statements of the form 

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

1356 

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

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

1358 

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

1359 
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

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

1361 

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

1362 
 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

1363 

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

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

1365 

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

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

1367 
(!!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

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

1369 

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

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

1371 

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

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

1373 
(!!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

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

1375 

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

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

1377 

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

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

1379 
(!!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

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

1381 

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

1384 
rule) before the above elimination rule is applicable. 

1385 

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

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

1388 
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

1389 

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

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

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

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

1395 
users are encouraged to use the new package. 

1396 

1397 
* Method "lexicographic_order" automatically synthesizes termination 

1398 
relations as lexicographic combinations of size measures. 

1399 

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

1402 
programming. Internally, this is translated into nested 

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

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

1405 
the original input but the internal form. Lambdaabstractions allow 

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

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

1408 
variable. 

23564  1409 

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