author  wenzelm 
Wed, 18 Jun 2008 23:15:41 +0200  
changeset 27269  1e9c05cddc64 
parent 27246  df85326af57c 
child 27287  3b0d7a417a8b 
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 

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

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

57 

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

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

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

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

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

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

63 

27269  64 
* Disposed old term read functions (Sign.read_def_terms, 
65 
Sign.read_term, Thm.read_def_cterms, Thm.read_cterm etc.). 

66 
INCOMPATIBILITY, should use regular Syntax.read_term, 

67 
Syntax.read_term_global etc.; see also OldGoals.read_term as last 

68 
resort for legacy applications. 

69 

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

70 

27143  71 

27008  72 
New in Isabelle2008 (June 2008) 
73 
 

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

74 

25522  75 
*** General *** 
76 

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

79 

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

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

83 
provides a proper context already. 

84 

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

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

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

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

88 

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

26659  91 
space take precedence. INCOMPATIBILITY in rare situations, may try to 
26650  92 
swap theory imports. 
93 

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

96 

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

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

99 
white space without escapes. 

100 

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

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

103 
"foo_bar". 

104 

25522  105 

25502  106 
*** Pure *** 
107 

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

110 

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

113 

114 
(1) unused_thms 

115 
Only finds unused theorems in the current theory. 

116 

117 
(2) unused_thms thy_1 ... thy_n  

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

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

120 

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

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

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

124 
their ancestors. 

125 

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

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

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

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

133 

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

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

26874  136 
usually the case when using Proof General with the default settings). 
26681  137 

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

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

141 
that tools may maintain dynamically scoped facts systematically, using 

142 
PureThy.add_thms_dynamic. 

143 

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

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

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

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

148 
update of theories within ML code. 
26479  149 

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

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

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

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

153 
depending on former CPure need to refer to Pure. 
26650  154 

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

158 
INCOMPATIBILITY. 

159 

26874  160 
* Command 'setup': discontinued implicit version with ML reference. 
26434  161 

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

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

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

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

25502  167 

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

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

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

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

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

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

173 

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

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

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

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

177 

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

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

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

180 

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

183 
predicates. 

26765  184 

185 

26762  186 
*** Document preparation *** 
187 

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

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

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

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

26914  194 

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

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

26762  198 

199 

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

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

201 

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

204 
"primrec" command distinguishes oldstyle and newstyle specifications 

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

206 
When adjusting theories, beware: constants stemming from newstyle 

207 
primrec specifications have authentic syntax. 

208 

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

210 
with multithreading. 

211 

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

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

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

215 

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

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

218 
reconstruction_modulus, reconstruction_sorts renamed 

219 
sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY. 

220 

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

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

224 
and makes them available separately. See 

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

226 

227 
* More flexible generation of measure functions for termination 

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

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

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

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

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

233 
type and generates all solutions by prologstyle backwards proof using 

234 
the declared rules. 

235 

236 
This setup also deals with rules like 

237 

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

239 

240 
which accommodates nested datatypes that recurse through lists. 

241 
Similar rules are predeclared for products and option types. 

242 

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

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

244 

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

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

246 

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

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

249 

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

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

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

253 

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

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

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

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

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

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

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

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

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

262 

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

263 
 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

264 
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

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

266 

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

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

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

269 

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

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

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

272 

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

275 

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

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

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

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

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

280 

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

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

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

283 

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

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

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

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

287 

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

26964
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 
have "P (S::'a set)" <...> 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

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

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

294 

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

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

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

297 

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

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

299 

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

302 
type of the form 

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

303 

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

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

305 

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

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

307 

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

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

309 

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

312 

26513  313 
* Explicit class "eq" for executable equality. INCOMPATIBILITY. 
314 

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

26445  317 
INCOMPATIBILITY. 
318 

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

321 

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

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

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

324 

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

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

26355  328 

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

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

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

331 

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

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

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

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

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

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

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

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

339 

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

340 
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

341 
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

342 
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

343 

26231  344 
* Library/Option_ord.thy: Canonical order on option type. 
345 

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

26197  348 

26231  349 
* Library/Countable.thy: Type class for countable types. 
350 

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

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

352 
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

353 
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

354 
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

355 
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

356 
accordingly. 
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 
* 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

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

360 
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

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

362 

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

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

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

366 
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

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

369 

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

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

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

372 

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

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

374 
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

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

376 

26874  377 
* Renamed theorems "power.simps" to "power_int.simps". 
27067  378 
INCOMPATIBILITY. 
25961  379 

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

380 
* Class semiring_div provides basic abstract properties of semirings 
25942  381 
with division and modulo operations. Subsumes former class dvd_mod. 
382 

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

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

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

385 

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

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

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

388 

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

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

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

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

392 

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

394 
syntax. INCOMPATIBILITY. 
25522  395 

396 
* Definitions subset_def, psubset_def, set_diff_def, Compl_def, 

397 
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def, 

398 
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def, 

399 
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def, 

400 
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

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

402 

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

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

406 

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

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

410 

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

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

413 
wellorders on sets and on types. 

26877  414 

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

415 

26197  416 
*** ZF *** 
417 

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

420 

421 
Datatype > Datatype_ZF 

422 
Inductive > Inductive_ZF 

423 
Int > Int_ZF 

424 
IntDiv > IntDiv_ZF 

425 
Nat > Nat_ZF 

426 
List > List_ZF 

427 
Main > Main_ZF 

428 

429 
INCOMPATIBILITY: ZF theories that import individual theories below 

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

431 
available, as trivial extension of Main_ZF. 

26197  432 

433 

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

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

435 

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

438 

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

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

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

441 

27067  442 
* Removed obsolete "use_legacy_bindings" function. 
26188  443 

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

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

445 
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

446 
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

447 
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

448 
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

449 

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

453 

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

454 

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

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

456 

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

459 

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

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

461 
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

462 
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

463 

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

466 

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

469 
isatool yxml as described in the Isabelle system manual. 

25651  470 

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

474 

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

477 

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

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

481 
script. 

482 

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

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

485 
optimal performance tuning. The corresponding usedir option M allows 

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

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

488 

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

490 
adverse effect of Isabelle flooding interactive frontends (notably 

491 
ProofGeneral / XEmacs). 

492 

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

493 

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

494 

25429  495 
New in Isabelle2007 (November 2007) 
496 
 

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

497 

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

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

499 

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

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

22826  504 

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

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

506 
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

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

508 

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

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

510 
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

511 
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

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

513 

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

516 
quotes. 

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

517 

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

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

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

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

521 
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

522 
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

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

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

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

526 
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

527 

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

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

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

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

532 
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

533 
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

534 

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

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

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

539 

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

541 
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

542 
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

543 
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

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

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

546 

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

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

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

551 
ambiguities introduced later on. INCOMPATIBILITY: constants in parse 

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

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

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

555 

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

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

557 
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

558 
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

559 
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

560 
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

561 
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

562 
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

563 

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

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

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

566 
support a specific search form (see ProofGeneral/CHANGES). 
22965  567 

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

570 
suppressed from proof state output. Note that the ProofGeneral 

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

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

573 
limit is imposed. 

574 

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

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

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

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

578 
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

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

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

581 

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

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

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

584 

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

585 

17865  586 
*** Document preparation *** 
587 

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

590 
current context. 

21339  591 

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

17865  594 

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

21735  597 
arguments may be given on the LHS.) 
21717  598 

599 

17779  600 
*** Pure *** 
601 

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

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

606 
constants with qualified polymorphism (according to the class 

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

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

609 
between global polymorphic consts and internal locale representation. 

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

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

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

616 

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

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

619 
writing SML code to a file: 
25199  620 
export_code <list of constants (term syntax)> in SML <filename> 
22735  621 
writing OCaml code to a file: 
25199  622 
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

623 
writing Haskell code to a bunch of files: 
25199  624 
export_code <list of constants (term syntax)> in Haskell <filename> 
625 

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

25184  627 
method ``eval'' 
628 

629 
Reasonable default setup of framework in HOL. 

20453
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 
Theorem attributs for selecting and transforming function equations theorems: 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

632 

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

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

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

637 

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

639 

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

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

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

642 

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

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

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

645 

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

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

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

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

649 

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

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

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

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

653 

25199  654 
code_instance and code_class only are effective to target Haskell. 
22735  655 

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

24800  658 
generation from Isabelle/HOL theories is available via "isatool doc 
659 
codegen". 

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

660 

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

663 
annotations). 

664 

19254  665 
* Command 'no_translations' removes translation rules from theory 
666 
syntax. 

667 

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

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

671 
correspondence to type class and instance declarations. 

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

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

19711  674 

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

676 
instantiation that matches an instance against the most general 

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

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

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

680 
recursion over such type arguments. Incomplete specification patterns 

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

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

685 

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

688 
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

689 
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

690 
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

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

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

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

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

695 
toplevel undo/redo and fail to work with multithreading. 
24086  696 

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

697 
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

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

699 

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

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

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

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

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

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

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

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

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

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

709 

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

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

714 
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

715 
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

716 
order. 
24086  717 

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

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

721 
difference of the original declaration context wrt. the application 

722 
context encountered later on. 

723 

724 
* Isar: proper interfaces for simplification procedures. Command 

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

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

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

728 

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

730 
abbreviates a theorem reference involving an internal dummy fact, 

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

732 
the background context will persist. This form of inplace 

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

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

735 

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

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

737 
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

738 
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

739 
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

740 
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

741 
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

742 
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

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

744 

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

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

746 
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

747 
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

748 
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

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

750 

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

753 

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

755 
then guess x and y by clarify 

756 

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

758 
proof tools being involved here. 

759 

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

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

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

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

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

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

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

768 

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

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

18020  772 

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

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

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

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

777 

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

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

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

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

781 

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

784 

18308  785 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
786 

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

788 

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

791 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  792 
'unfolded' attribute may be replaced by firstclass proof text. 
793 

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

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

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

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

797 
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

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

799 

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

802 

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

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

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

808 
originally first one. 

19220  809 

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

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

811 
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

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

813 

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

816 
(essentially a disjunction of cases with local parameters and 

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

18910  818 
adequately; in this notation common elimination rules look like this: 
18901  819 

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

821 
assumes "EX x. P x" 

822 
obtains x where "P x" 

823 

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

825 
assumes "A & B" 

826 
obtains A and B 

827 

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

829 
assumes "A  B" 

830 
obtains 

831 
A 

832 
 B 

833 

18910  834 
The subsequent classical rules even refer to the formal "thesis" 
18901  835 
explicitly: 
836 

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

838 
obtains "~ thesis" 

839 

18910  840 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
841 
obtains "thesis ==> something" 

18901  842 

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

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

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

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

848 
case_names). 

18901  849 

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

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

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

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

853 
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

854 

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

857 
toplevel lemma. 

858 

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

861 

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

864 
to occur. 

865 

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

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

867 
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

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

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

870 

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

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

872 
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

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

874 

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

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

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

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

880 
current context. 

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

881 

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

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

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

886 

19665  887 
axiomatization 
21595  888 
eq (infix "===" 50) where 
889 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

890 

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

892 
definition g where "g x = f x x" 

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

893 

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

897 

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

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

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

19088  902 
parameters implicit and using the original short name. See also 
25177  903 
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic 
19083  904 
entities from a monomorphic theory. 
905 

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

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

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

910 
prevents folding of abbreviations in term output. 
19084  911 

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

912 
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

913 
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

914 
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

915 
'translations' with explicit "CONST" markup to accommodate this. 
19665  916 

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

919 
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

920 

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

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

922 

24738  923 
inductive conj for A B 
924 
where "A ==> B ==> conj A B" 

925 

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

928 
abbreviations on output. 

929 

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

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

933 
endomorphisms as locale endom = homom mult mult h. 

19783  934 

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

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

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

939 
predicates, goals repesenting already interpreted fragments are not 

940 
removed automatically. Use methods `intro_locales' and 

941 
`unfold_locales'; see below. 

942 

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

944 
provide backward reasoning on locales predicates. The methods are 

945 
aware of interpretations and discharge corresponding goals. 

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

947 
unfold predicates to assumptions. 

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

948 

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

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

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

952 

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

955 
unfolded in interpreted theorems. This is useful for replacing 

956 
defined concepts (constants depending on locale parameters) by 

957 
concepts already existing in the target context. Example: 

958 

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

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

961 

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

964 
partial_order. 

965 

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

969 
(using objectlogic connectives for this purpose has been long 

970 
obsolete anyway). Common proof patterns are explained in 

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

973 
examples. 

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

974 

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

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

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

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

980 

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

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

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

986 

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

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

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

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

991 

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

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

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

994 

24859  995 
* Method "coinduct": dual of induction, see 
18399  996 
src/HOL/Library/Coinductive_List.thy for various examples. 
997 

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

1000 

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

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

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

1003 

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

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

1007 
trace indicates where parts have been suppressed. 

18674  1008 

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

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

1010 
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

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

1012 

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

1015 
least one premise. 

1016 

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

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

1021 

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

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

1023 
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

1024 
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

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

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

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

1028 

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

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

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

1031 
for example "A > B" => "Pi A (%_. B)". 
17779  1032 

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

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

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

1035 

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

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

1038 

17865  1039 

17806  1040 
*** HOL *** 
1041 

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

1044 
Examples are in the directory MetisExamples. WARNING: the 

1045 
Isabelle/HOLMetis integration does not yet work properly with 

1046 
multithreading. 

1047 

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

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

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

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

1052 
work with multithreading. 

1053 

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

1056 
auto_quickcheck (default true) and auto_quickcheck_time_limit (default 

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

24804  1059 

25184  1060 
* New constant "undefined" with axiom "undefined x = undefined". 
1061 

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

1063 
equality. 

1064 

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

1066 
the new 'class' package: 

1067 

1068 
HOL.abs ~> HOL.abs_class.abs 

1069 
HOL.divide ~> HOL.divide_class.divide 

1070 
0 ~> HOL.zero_class.zero 

1071 
1 ~> HOL.one_class.one 

1072 
op + ~> HOL.plus_class.plus 

1073 
op  ~> HOL.minus_class.minus 

1074 
uminus ~> HOL.minus_class.uminus 

1075 
op * ~> HOL.times_class.times 

1076 
op < ~> HOL.ord_class.less 

1077 
op <= > HOL.ord_class.less_eq 

1078 
Nat.power ~> Power.power_class.power 

1079 
Nat.size ~> Nat.size_class.size 

1080 
Numeral.number_of ~> Numeral.number_class.number_of 

1081 
FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf 

1082 
FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup 

1083 
Orderings.min ~> Orderings.ord_class.min 

1084 
Orderings.max ~> Orderings.ord_class.max 

1085 
Divides.op div ~> Divides.div_class.div 

1086 
Divides.op mod ~> Divides.div_class.mod 

1087 
Divides.op dvd ~> Divides.div_class.dvd 

1088 

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

1090 

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

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

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

1094 
names. 

1095 

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

1097 
INCOMPATIBILITY: use more specific names. 

1098 

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

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

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

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

1103 
distribution). INCOMPATIBILITY: rewrite proofs 

1104 

1105 
d) ML code directly refering to constant names 

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

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

1108 
Consider using @{const_name} antiquotation. 

1109 

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

1111 

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

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

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

1115 
sgn_div_norm; ordered_idom now also inherits from sgn_if. 

1116 
INCOMPATIBILITY. 

1117 

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

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

1120 

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

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

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

1124 

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

1126 
changed order of proof goals in instance proofs. 

1127 

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

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

1130 
in all contexts importing or interpreting the corresponding locales. 

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

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

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

1134 
in the current context. 

1135 

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

1137 
lemmas max_of_mono and min_of_mono with this predicate. 

1138 
INCOMPATIBILITY. 

1139 

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

1141 
with new class dense_linear_order. 

1142 

1143 
* Uniform lattice theory development in HOL. 

1144 

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

1146 
constant "Meet" now named "Inf" 

1147 

1148 
classes "meet_semilorder" and "join_semilorder" now named 

1149 
"lower_semilattice" and "upper_semilattice" 

1150 
class "lorder" now named "lattice" 

1151 
class "comp_lat" now named "complete_lattice" 

1152 

1153 
Instantiation of lattice classes allows explicit definitions 

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

1155 

1156 
INCOMPATIBILITY. Theorem renames: 

1157 

1158 
meet_left_le ~> inf_le1 

1159 
meet_right_le ~> inf_le2 

1160 
join_left_le ~> sup_ge1 

1161 
join_right_le ~> sup_ge2 

1162 
meet_join_le ~> inf_sup_ord 

1163 
le_meetI ~> le_infI 

1164 
join_leI ~> le_supI 

1165 
le_meet ~> le_inf_iff 

1166 
le_join ~> ge_sup_conv 

1167 
meet_idempotent ~> inf_idem 

1168 
join_idempotent ~> sup_idem 

1169 
meet_comm ~> inf_commute 

1170 
join_comm ~> sup_commute 

1171 
meet_leI1 ~> le_infI1 

1172 
meet_leI2 ~> le_infI2 

1173 
le_joinI1 ~> le_supI1 

1174 
le_joinI2 ~> le_supI2 

1175 
meet_assoc ~> inf_assoc 

1176 
join_assoc ~> sup_assoc 

1177 
meet_left_comm ~> inf_left_commute 

1178 
meet_left_idempotent ~> inf_left_idem 

1179 
join_left_comm ~> sup_left_commute 

1180 
join_left_idempotent ~> sup_left_idem 

1181 
meet_aci ~> inf_aci 

1182 
join_aci ~> sup_aci 

1183 
le_def_meet ~> le_iff_inf 

1184 
le_def_join ~> le_iff_sup 

1185 
join_absorp2 ~> sup_absorb2 

1186 
join_absorp1 ~> sup_absorb1 

1187 
meet_absorp1 ~> inf_absorb1 

1188 
meet_absorp2 ~> inf_absorb2 

1189 
meet_join_absorp ~> inf_sup_absorb 

1190 
join_meet_absorp ~> sup_inf_absorb 

1191 
distrib_join_le ~> distrib_sup_le 

1192 
distrib_meet_le ~> distrib_inf_le 

1193 

1194 
add_meet_distrib_left ~> add_inf_distrib_left 

1195 
add_join_distrib_left ~> add_sup_distrib_left 

1196 
is_join_neg_meet ~> is_join_neg_inf 

1197 
is_meet_neg_join ~> is_meet_neg_sup 

1198 
add_meet_distrib_right ~> add_inf_distrib_right 

1199 
add_join_distrib_right ~> add_sup_distrib_right 

1200 
add_meet_join_distribs ~> add_sup_inf_distribs 

1201 
join_eq_neg_meet ~> sup_eq_neg_inf 

1202 
meet_eq_neg_join ~> inf_eq_neg_sup 

1203 
add_eq_meet_join ~> add_eq_inf_sup 

1204 
meet_0_imp_0 ~> inf_0_imp_0 

1205 
join_0_imp_0 ~> sup_0_imp_0 

1206 
meet_0_eq_0 ~> inf_0_eq_0 

1207 
join_0_eq_0 ~> sup_0_eq_0 

1208 
neg_meet_eq_join ~> neg_inf_eq_sup 

1209 
neg_join_eq_meet ~> neg_sup_eq_inf 

1210 
join_eq_if ~> sup_eq_if 

1211 

1212 
mono_meet ~> mono_inf 

1213 
mono_join ~> mono_sup 

1214 
meet_bool_eq ~> inf_bool_eq 

1215 
join_bool_eq ~> sup_bool_eq 

1216 
meet_fun_eq ~> inf_fun_eq 

1217 
join_fun_eq ~> sup_fun_eq 

1218 
meet_set_eq ~> inf_set_eq 

1219 
join_set_eq ~> sup_set_eq 

1220 
meet1_iff ~> inf1_iff 

1221 
meet2_iff ~> inf2_iff 

1222 
meet1I ~> inf1I 

1223 
meet2I ~> inf2I 

1224 
meet1D1 ~> inf1D1 

1225 
meet2D1 ~> inf2D1 

1226 
meet1D2 ~> inf1D2 

1227 
meet2D2 ~> inf2D2 

1228 
meet1E ~> inf1E 

1229 
meet2E ~> inf2E 

1230 
join1_iff ~> sup1_iff 

1231 
join2_iff ~> sup2_iff 

1232 
join1I1 ~> sup1I1 

1233 
join2I1 ~> sup2I1 

1234 
join1I1 ~> sup1I1 

1235 
join2I2 ~> sup1I2 

1236 
join1CI ~> sup1CI 

1237 
join2CI ~> sup2CI 

1238 
join1E ~> sup1E 

1239 
join2E ~> sup2E 

1240 

1241 
is_meet_Meet ~> is_meet_Inf 

1242 
Meet_bool_def ~> Inf_bool_def 

1243 
Meet_fun_def ~> Inf_fun_def 

1244 
Meet_greatest ~> Inf_greatest 

1245 
Meet_lower ~> Inf_lower 

1246 
Meet_set_def ~> Inf_set_def 

1247 

1248 
Sup_def ~> Sup_Inf 

1249 
Sup_bool_eq ~> Sup_bool_def 

1250 
Sup_fun_eq ~> Sup_fun_def 

1251 
Sup_set_eq ~> Sup_set_def 

1252 

1253 
listsp_meetI ~> listsp_infI 

1254 
listsp_meet_eq ~> listsp_inf_eq 

1255 

1256 
meet_min ~> inf_min 

1257 
join_max ~> sup_max 

1258 

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

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

1261 

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

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

25184  1265 
"*.size". 
1266 

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

1268 
INCOMPATIBILITY. 

24800  1269 

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

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

1272 
fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY. 

1273 

25129  1274 
* HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY. 
1275 

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

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

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

1280 
lemmas on overflow and monotonicity. Instantiated to all appropriate 

1281 
arithmetic type classes, supporting automatic simplification of 

1282 
numerals on all operations. 

24333  1283 

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

1285 

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

1287 

23850  1288 
* Code generator library theories: 
24993  1289 
 Code_Integer represents HOL integers by big integer literals in target 
23850  1290 
languages. 
24993  1291 
 Code_Char represents HOL characters by character literals in target 
23850  1292 
languages. 
24993  1293 
 Code_Char_chr like Code_Char, but also offers treatment of character 
1294 
codes; includes Code_Integer. 

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

23850  1297 
denominator). 
24800  1298 
 Executable_Real implements a subset of real numbers, namly those 
23850  1299 
representable by rational numbers. 
24800  1300 
 Efficient_Nat implements natural numbers by integers, which in general will 
23850  1301 
result in higher efficency; pattern matching with 0/Suc is eliminated; 
24993  1302 
includes Code_Integer. 
1303 
 Code_Index provides an additional datatype index which is mapped to 

1304 
targetlanguage builtin integers. 

26355  1305 
 Code_Message provides an additional datatype message_string which is isomorphic to 
24993  1306 
strings; messages are mapped to targetlanguage strings. 
23850  1307 

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

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

1309 

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

1310 
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

1311 

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

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

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

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

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

1316 
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

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

1318 

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

1320 

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

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

1322 

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

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

1324 
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

1325 

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

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

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

1328 
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

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

1330 

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

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

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

1333 

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

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

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

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

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

1338 
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

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

1340 

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

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

1342 

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

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

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

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

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

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

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

1349 
 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

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

1351 

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

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

1353 

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

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 
INCOMPATIBILITIES: 
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 
 Since declaration and definition of inductive sets or predicates 
24800  1360 
is no longer separated, abbreviations involving the newly 
1361 
introduced sets or predicates must be specified together with the 

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

1363 
than before the actual inductive definition. 

1364 

1365 
 The variables in induction and elimination rules are now 

1366 
quantified in the order of their occurrence in the introduction 

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

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

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

1370 
statements of the form 

23783
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 
case (rule_i a_i_1 ... a_i_{k_i}) 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1373 

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

1374 
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

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

1376 

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

1377 
 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

1378 

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

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

1380 

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

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

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

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

1384 

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

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

1386 

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

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

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

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

1390 

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

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

1392 

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

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

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

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

1396 

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

1399 
rule) before the above elimination rule is applicable. 

1400 

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

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

1403 
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

1404 

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

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

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

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

1410 
users are encouraged to use the new package. 

1411 

1412 
* Method "lexicographic_order" automatically synthesizes termination 
