author  haftmann 
Tue, 10 Jun 2008 15:30:33 +0200  
changeset 27104  791607529f6d 
parent 27067  f8a7aff41acb 
child 27122  63d92a5e3784 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

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

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

5 
 
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 

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

9 
* 'instance': attached definitions now longer accepted. INCOMPATIBILITY. 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

10 

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

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

12 

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

13 

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

14 
*** HOL *** 
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 
* 'rep_datatype': instead of theorem names the command now takes a list of terms 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

17 
denoting the constructors of the type to be represented as datatype. The 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

18 
characteristic theorems have to be proven. INCOMPATIBILITY. Also observe that 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

19 
the following theorems have disappeared in favour of existing ones: 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

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

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

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

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

24 
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

25 

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

26 
* Tactics induct_tac and thm_induct_tac now take explicit context as arguments; 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

27 
typespecific induction rules are identified by the 'induct' attribute rather 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

28 
than querying the datatype package directly. INCOMPATIBILITY. 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

29 

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

30 
* '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

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

32 

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

33 
* Library/Nat_Infinity: added addition, numeral syntax and more instantiations 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

34 
for algebraic structures. Removed some duplicate theorems. Changes in simp 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

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

36 

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

37 

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

38 

27008  39 
New in Isabelle2008 (June 2008) 
40 
 

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

41 

25522  42 
*** General *** 
43 

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

46 

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

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

50 
provides a proper context already. 

51 

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

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

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

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

55 

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

26659  58 
space take precedence. INCOMPATIBILITY in rare situations, may try to 
26650  59 
swap theory imports. 
60 

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

63 

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

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

66 
white space without escapes. 

67 

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

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

70 
"foo_bar". 

71 

25522  72 

25502  73 
*** Pure *** 
74 

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

77 

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

80 

81 
(1) unused_thms 

82 
Only finds unused theorems in the current theory. 

83 

84 
(2) unused_thms thy_1 ... thy_n  

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

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

87 

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

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

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

91 
their ancestors. 

92 

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

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

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

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

100 

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

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

26874  103 
usually the case when using Proof General with the default settings). 
26681  104 

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

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

108 
that tools may maintain dynamically scoped facts systematically, using 

109 
PureThy.add_thms_dynamic. 

110 

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

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

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

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

115 
update of theories within ML code. 
26479  116 

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

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

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

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

120 
depending on former CPure need to refer to Pure. 
26650  121 

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

125 
INCOMPATIBILITY. 

126 

26874  127 
* Command 'setup': discontinued implicit version with ML reference. 
26434  128 

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

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

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

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

25502  134 

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

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

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

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

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

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

140 

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

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

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

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

144 

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

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

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

147 

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

150 
predicates. 

26765  151 

152 

26762  153 
*** Document preparation *** 
154 

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

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

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

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

26914  161 

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

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

26762  165 

166 

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

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

168 

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

171 
"primrec" command distinguishes oldstyle and newstyle specifications 

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

173 
When adjusting theories, beware: constants stemming from newstyle 

174 
primrec specifications have authentic syntax. 

175 

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

177 
with multithreading. 

178 

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

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

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

182 

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

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

185 
reconstruction_modulus, reconstruction_sorts renamed 

186 
sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY. 

187 

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

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

191 
and makes them available separately. See 

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

193 

194 
* More flexible generation of measure functions for termination 

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

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

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

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

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

200 
type and generates all solutions by prologstyle backwards proof using 

201 
the declared rules. 

202 

203 
This setup also deals with rules like 

204 

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

206 

207 
which accommodates nested datatypes that recurse through lists. 

208 
Similar rules are predeclared for products and option types. 

209 

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

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

211 

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

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

213 

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

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

216 

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

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

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

220 

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

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

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

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

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

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

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

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

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

229 

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

230 
 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

231 
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

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

233 

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

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

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

236 

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

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

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

239 

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

242 

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

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

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

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

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

247 

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

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

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

250 

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

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

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

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

254 

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

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

257 

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

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

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

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

261 

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

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

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

264 

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

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

266 

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

269 
type of the form 

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

270 

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

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

272 

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

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

274 

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

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

276 

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

279 

26513  280 
* Explicit class "eq" for executable equality. INCOMPATIBILITY. 
281 

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

26445  284 
INCOMPATIBILITY. 
285 

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

288 

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

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

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

291 

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

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

26355  295 

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

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

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

298 

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

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

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

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

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

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

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

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

306 

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

307 
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

308 
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

309 
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

310 

26231  311 
* Library/Option_ord.thy: Canonical order on option type. 
312 

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

26197  315 

26231  316 
* Library/Countable.thy: Type class for countable types. 
317 

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

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

319 
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

320 
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

321 
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

322 
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

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

324 

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

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

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

327 
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

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

329 

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

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

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

333 
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

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

336 

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

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

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

339 

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

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

341 
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

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

343 

26874  344 
* Renamed theorems "power.simps" to "power_int.simps". 
27067  345 
INCOMPATIBILITY. 
25961  346 

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

347 
* Class semiring_div provides basic abstract properties of semirings 
25942  348 
with division and modulo operations. Subsumes former class dvd_mod. 
349 

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

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

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

352 

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

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

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

355 

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

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

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

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

359 

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

361 
syntax. INCOMPATIBILITY. 
25522  362 

363 
* Definitions subset_def, psubset_def, set_diff_def, Compl_def, 

364 
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def, 

365 
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def, 

366 
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def, 

367 
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

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

369 

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

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

373 

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

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

377 

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

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

380 
wellorders on sets and on types. 

26877  381 

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

382 

26197  383 
*** ZF *** 
384 

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

387 

388 
Datatype > Datatype_ZF 

389 
Inductive > Inductive_ZF 

390 
Int > Int_ZF 

391 
IntDiv > IntDiv_ZF 

392 
Nat > Nat_ZF 

393 
List > List_ZF 

394 
Main > Main_ZF 

395 

396 
INCOMPATIBILITY: ZF theories that import individual theories below 

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

398 
available, as trivial extension of Main_ZF. 

26197  399 

400 

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

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

402 

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

405 

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

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

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

408 

27067  409 
* Removed obsolete "use_legacy_bindings" function. 
26188  410 

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

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

412 
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

413 
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

414 
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

415 
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

416 

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

420 

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

421 

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

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

423 

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

426 

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

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

428 
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

429 
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

430 

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

433 

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

436 
isatool yxml as described in the Isabelle system manual. 

25651  437 

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

441 

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

444 

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

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

448 
script. 

449 

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

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

452 
optimal performance tuning. The corresponding usedir option M allows 

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

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

455 

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

457 
adverse effect of Isabelle flooding interactive frontends (notably 

458 
ProofGeneral / XEmacs). 

459 

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

460 

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

461 

25429  462 
New in Isabelle2007 (November 2007) 
463 
 

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

464 

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

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

466 

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

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

22826  471 

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

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

473 
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

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

475 

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

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

477 
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

478 
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

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

480 

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

483 
quotes. 

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

484 

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

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

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

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

488 
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

489 
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

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

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

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

493 
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

494 

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

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

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

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

499 
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

500 
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

501 

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

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

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

506 

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

508 
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

509 
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

510 
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

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

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

513 

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

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

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

518 
ambiguities introduced later on. INCOMPATIBILITY: constants in parse 

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

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

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

522 

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

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

524 
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

525 
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

526 
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

527 
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

528 
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

529 
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

530 

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

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

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

533 
support a specific search form (see ProofGeneral/CHANGES). 
22965  534 

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

537 
suppressed from proof state output. Note that the ProofGeneral 

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

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

540 
limit is imposed. 

541 

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

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

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

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

545 
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

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

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

548 

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

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

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

551 

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

552 

17865  553 
*** Document preparation *** 
554 

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

557 
current context. 

21339  558 

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

17865  561 

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

21735  564 
arguments may be given on the LHS.) 
21717  565 

566 

17779  567 
*** Pure *** 
568 

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

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

573 
constants with qualified polymorphism (according to the class 

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

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

576 
between global polymorphic consts and internal locale representation. 

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

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

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

583 

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

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

586 
writing SML code to a file: 
25199  587 
export_code <list of constants (term syntax)> in SML <filename> 
22735  588 
writing OCaml code to a file: 
25199  589 
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

590 
writing Haskell code to a bunch of files: 
25199  591 
export_code <list of constants (term syntax)> in Haskell <filename> 
592 

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

25184  594 
method ``eval'' 
595 

596 
Reasonable default setup of framework in HOL. 

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

597 

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

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

599 

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

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

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

604 

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

606 

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

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

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

609 

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

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

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

612 

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

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

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

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

616 

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

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

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

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

620 

25199  621 
code_instance and code_class only are effective to target Haskell. 
22735  622 

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

24800  625 
generation from Isabelle/HOL theories is available via "isatool doc 
626 
codegen". 

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

627 

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

630 
annotations). 

631 

19254  632 
* Command 'no_translations' removes translation rules from theory 
633 
syntax. 

634 

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

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

638 
correspondence to type class and instance declarations. 

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

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

19711  641 

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

643 
instantiation that matches an instance against the most general 

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

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

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

647 
recursion over such type arguments. Incomplete specification patterns 

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

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

652 

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

655 
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

656 
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

657 
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

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

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

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

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

662 
toplevel undo/redo and fail to work with multithreading. 
24086  663 

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

664 
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

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

666 

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

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

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

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

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

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

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

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

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

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

676 

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

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

681 
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

682 
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

683 
order. 
24086  684 

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

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

688 
difference of the original declaration context wrt. the application 

689 
context encountered later on. 

690 

691 
* Isar: proper interfaces for simplification procedures. Command 

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

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

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

695 

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

697 
abbreviates a theorem reference involving an internal dummy fact, 

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

699 
the background context will persist. This form of inplace 

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

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

702 

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

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

704 
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

705 
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

706 
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

707 
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

708 
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

709 
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

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

711 

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

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

713 
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

714 
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

715 
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

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

717 

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

720 

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

722 
then guess x and y by clarify 

723 

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

725 
proof tools being involved here. 

726 

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

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

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

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

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

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

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

735 

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

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

18020  739 

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

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

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

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

744 

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

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

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

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

748 

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

751 

18308  752 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
753 

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

755 

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

758 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  759 
'unfolded' attribute may be replaced by firstclass proof text. 
760 

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

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

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

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

764 
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

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

766 

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

769 

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

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

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

775 
originally first one. 

19220  776 

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

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

778 
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

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

780 

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

783 
(essentially a disjunction of cases with local parameters and 

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

18910  785 
adequately; in this notation common elimination rules look like this: 
18901  786 

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

788 
assumes "EX x. P x" 

789 
obtains x where "P x" 

790 

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

792 
assumes "A & B" 

793 
obtains A and B 

794 

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

796 
assumes "A  B" 

797 
obtains 

798 
A 

799 
 B 

800 

18910  801 
The subsequent classical rules even refer to the formal "thesis" 
18901  802 
explicitly: 
803 

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

805 
obtains "~ thesis" 

806 

18910  807 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
808 
obtains "thesis ==> something" 

18901  809 

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

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

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

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

815 
case_names). 

18901  816 

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

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

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

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

820 
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

821 

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

824 
toplevel lemma. 

825 

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

828 

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

831 
to occur. 

832 

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

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

834 
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

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

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

837 

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

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

839 
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

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

841 

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

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

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

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

847 
current context. 

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

848 

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

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

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

853 

19665  854 
axiomatization 
21595  855 
eq (infix "===" 50) where 
856 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

857 

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

859 
definition g where "g x = f x x" 

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

860 

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

864 

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

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

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

19088  869 
parameters implicit and using the original short name. See also 
25177  870 
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic 
19083  871 
entities from a monomorphic theory. 
872 

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

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

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

877 
prevents folding of abbreviations in term output. 
19084  878 

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

879 
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

880 
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

881 
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

882 
'translations' with explicit "CONST" markup to accommodate this. 
19665  883 

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

886 
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

887 

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

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

889 

24738  890 
inductive conj for A B 
891 
where "A ==> B ==> conj A B" 

892 

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

895 
abbreviations on output. 

896 

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

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

900 
endomorphisms as locale endom = homom mult mult h. 

19783  901 

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

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

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

906 
predicates, goals repesenting already interpreted fragments are not 

907 
removed automatically. Use methods `intro_locales' and 

908 
`unfold_locales'; see below. 

909 

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

911 
provide backward reasoning on locales predicates. The methods are 

912 
aware of interpretations and discharge corresponding goals. 

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

914 
unfold predicates to assumptions. 

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

915 

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

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

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

919 

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

922 
unfolded in interpreted theorems. This is useful for replacing 

923 
defined concepts (constants depending on locale parameters) by 

924 
concepts already existing in the target context. Example: 

925 

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

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

928 

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

931 
partial_order. 

932 

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

936 
(using objectlogic connectives for this purpose has been long 

937 
obsolete anyway). Common proof patterns are explained in 

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

940 
examples. 

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

941 

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

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

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

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

947 

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

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

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

953 

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

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

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

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

958 

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

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

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

961 

24859  962 
* Method "coinduct": dual of induction, see 
18399  963 
src/HOL/Library/Coinductive_List.thy for various examples. 
964 

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

967 

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

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

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

970 

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

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

974 
trace indicates where parts have been suppressed. 

18674  975 

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

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

977 
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

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

979 

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

982 
least one premise. 

983 

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

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

988 

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

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

990 
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

991 
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

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

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

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

995 

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

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

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

998 
for example "A > B" => "Pi A (%_. B)". 
17779  999 

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

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

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

1002 

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

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

1005 

17865  1006 

17806  1007 
*** HOL *** 
1008 

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

1011 
Examples are in the directory MetisExamples. WARNING: the 

1012 
Isabelle/HOLMetis integration does not yet work properly with 

1013 
multithreading. 

1014 

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

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

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

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

1019 
work with multithreading. 

1020 

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

1023 
auto_quickcheck (default true) and auto_quickcheck_time_limit (default 

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

24804  1026 

25184  1027 
* New constant "undefined" with axiom "undefined x = undefined". 
1028 

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

1030 
equality. 

1031 

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

1033 
the new 'class' package: 

1034 

1035 
HOL.abs ~> HOL.abs_class.abs 

1036 
HOL.divide ~> HOL.divide_class.divide 

1037 
0 ~> HOL.zero_class.zero 

1038 
1 ~> HOL.one_class.one 

1039 
op + ~> HOL.plus_class.plus 

1040 
op  ~> HOL.minus_class.minus 

1041 
uminus ~> HOL.minus_class.uminus 

1042 
op * ~> HOL.times_class.times 

1043 
op < ~> HOL.ord_class.less 

1044 
op <= > HOL.ord_class.less_eq 

1045 
Nat.power ~> Power.power_class.power 

1046 
Nat.size ~> Nat.size_class.size 

1047 
Numeral.number_of ~> Numeral.number_class.number_of 

1048 
FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf 

1049 
FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup 

1050 
Orderings.min ~> Orderings.ord_class.min 

1051 
Orderings.max ~> Orderings.ord_class.max 

1052 
Divides.op div ~> Divides.div_class.div 

1053 
Divides.op mod ~> Divides.div_class.mod 

1054 
Divides.op dvd ~> Divides.div_class.dvd 

1055 

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

1057 

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

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

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

1061 
names. 

1062 

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

1064 
INCOMPATIBILITY: use more specific names. 

1065 

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

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

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

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

1070 
distribution). INCOMPATIBILITY: rewrite proofs 

1071 

1072 
d) ML code directly refering to constant names 

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

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

1075 
Consider using @{const_name} antiquotation. 

1076 

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

1078 

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

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

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

1082 
sgn_div_norm; ordered_idom now also inherits from sgn_if. 

1083 
INCOMPATIBILITY. 

1084 

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

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

1087 

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

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

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

1091 

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

1093 
changed order of proof goals in instance proofs. 

1094 

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

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

1097 
in all contexts importing or interpreting the corresponding locales. 

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

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

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

1101 
in the current context. 

1102 

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

1104 
lemmas max_of_mono and min_of_mono with this predicate. 

1105 
INCOMPATIBILITY. 

1106 

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

1108 
with new class dense_linear_order. 

1109 

1110 
* Uniform lattice theory development in HOL. 

1111 

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

1113 
constant "Meet" now named "Inf" 

1114 

1115 
classes "meet_semilorder" and "join_semilorder" now named 

1116 
"lower_semilattice" and "upper_semilattice" 

1117 
class "lorder" now named "lattice" 

1118 
class "comp_lat" now named "complete_lattice" 

1119 

1120 
Instantiation of lattice classes allows explicit definitions 

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

1122 

1123 
INCOMPATIBILITY. Theorem renames: 

1124 

1125 
meet_left_le ~> inf_le1 

1126 
meet_right_le ~> inf_le2 

1127 
join_left_le ~> sup_ge1 

1128 
join_right_le ~> sup_ge2 

1129 
meet_join_le ~> inf_sup_ord 

1130 
le_meetI ~> le_infI 

1131 
join_leI ~> le_supI 

1132 
le_meet ~> le_inf_iff 

1133 
le_join ~> ge_sup_conv 

1134 
meet_idempotent ~> inf_idem 

1135 
join_idempotent ~> sup_idem 

1136 
meet_comm ~> inf_commute 

1137 
join_comm ~> sup_commute 

1138 
meet_leI1 ~> le_infI1 

1139 
meet_leI2 ~> le_infI2 

1140 
le_joinI1 ~> le_supI1 

1141 
le_joinI2 ~> le_supI2 

1142 
meet_assoc ~> inf_assoc 

1143 
join_assoc ~> sup_assoc 

1144 
meet_left_comm ~> inf_left_commute 

1145 
meet_left_idempotent ~> inf_left_idem 

1146 
join_left_comm ~> sup_left_commute 

1147 
join_left_idempotent ~> sup_left_idem 

1148 
meet_aci ~> inf_aci 

1149 
join_aci ~> sup_aci 

1150 
le_def_meet ~> le_iff_inf 

1151 
le_def_join ~> le_iff_sup 

1152 
join_absorp2 ~> sup_absorb2 

1153 
join_absorp1 ~> sup_absorb1 

1154 
meet_absorp1 ~> inf_absorb1 

1155 
meet_absorp2 ~> inf_absorb2 

1156 
meet_join_absorp ~> inf_sup_absorb 

1157 
join_meet_absorp ~> sup_inf_absorb 

1158 
distrib_join_le ~> distrib_sup_le 

1159 
distrib_meet_le ~> distrib_inf_le 

1160 

1161 
add_meet_distrib_left ~> add_inf_distrib_left 

1162 
add_join_distrib_left ~> add_sup_distrib_left 

1163 
is_join_neg_meet ~> is_join_neg_inf 

1164 
is_meet_neg_join ~> is_meet_neg_sup 

1165 
add_meet_distrib_right ~> add_inf_distrib_right 

1166 
add_join_distrib_right ~> add_sup_distrib_right 

1167 
add_meet_join_distribs ~> add_sup_inf_distribs 

1168 
join_eq_neg_meet ~> sup_eq_neg_inf 

1169 
meet_eq_neg_join ~> inf_eq_neg_sup 

1170 
add_eq_meet_join ~> add_eq_inf_sup 

1171 
meet_0_imp_0 ~> inf_0_imp_0 

1172 
join_0_imp_0 ~> sup_0_imp_0 

1173 
meet_0_eq_0 ~> inf_0_eq_0 

1174 
join_0_eq_0 ~> sup_0_eq_0 

1175 
neg_meet_eq_join ~> neg_inf_eq_sup 

1176 
neg_join_eq_meet ~> neg_sup_eq_inf 

1177 
join_eq_if ~> sup_eq_if 

1178 

1179 
mono_meet ~> mono_inf 

1180 
mono_join ~> mono_sup 

1181 
meet_bool_eq ~> inf_bool_eq 

1182 
join_bool_eq ~> sup_bool_eq 

1183 
meet_fun_eq ~> inf_fun_eq 

1184 
join_fun_eq ~> sup_fun_eq 

1185 
meet_set_eq ~> inf_set_eq 

1186 
join_set_eq ~> sup_set_eq 

1187 
meet1_iff ~> inf1_iff 

1188 
meet2_iff ~> inf2_iff 

1189 
meet1I ~> inf1I 

1190 
meet2I ~> inf2I 

1191 
meet1D1 ~> inf1D1 

1192 
meet2D1 ~> inf2D1 

1193 
meet1D2 ~> inf1D2 

1194 
meet2D2 ~> inf2D2 

1195 
meet1E ~> inf1E 

1196 
meet2E ~> inf2E 

1197 
join1_iff ~> sup1_iff 

1198 
join2_iff ~> sup2_iff 

1199 
join1I1 ~> sup1I1 

1200 
join2I1 ~> sup2I1 

1201 
join1I1 ~> sup1I1 

1202 
join2I2 ~> sup1I2 

1203 
join1CI ~> sup1CI 

1204 
join2CI ~> sup2CI 

1205 
join1E ~> sup1E 

1206 
join2E ~> sup2E 

1207 

1208 
is_meet_Meet ~> is_meet_Inf 

1209 
Meet_bool_def ~> Inf_bool_def 

1210 
Meet_fun_def ~> Inf_fun_def 

1211 
Meet_greatest ~> Inf_greatest 

1212 
Meet_lower ~> Inf_lower 

1213 
Meet_set_def ~> Inf_set_def 

1214 

1215 
Sup_def ~> Sup_Inf 

1216 
Sup_bool_eq ~> Sup_bool_def 

1217 
Sup_fun_eq ~> Sup_fun_def 

1218 
Sup_set_eq ~> Sup_set_def 

1219 

1220 
listsp_meetI ~> listsp_infI 

1221 
listsp_meet_eq ~> listsp_inf_eq 

1222 

1223 
meet_min ~> inf_min 

1224 
join_max ~> sup_max 

1225 

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

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

1228 

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

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

25184  1232 
"*.size". 
1233 

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

1235 
INCOMPATIBILITY. 

24800  1236 

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

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

1239 
fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY. 

1240 

25129  1241 
* HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY. 
1242 

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

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

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

1247 
lemmas on overflow and monotonicity. Instantiated to all appropriate 

1248 
arithmetic type classes, supporting automatic simplification of 

1249 
numerals on all operations. 

24333  1250 

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

1252 

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

1254 

23850  1255 
* Code generator library theories: 
24993  1256 
 Code_Integer represents HOL integers by big integer literals in target 
23850  1257 
languages. 
24993  1258 
 Code_Char represents HOL characters by character literals in target 
23850  1259 
languages. 
24993  1260 
 Code_Char_chr like Code_Char, but also offers treatment of character 
1261 
codes; includes Code_Integer. 

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

23850  1264 
denominator). 
24800  1265 
 Executable_Real implements a subset of real numbers, namly those 
23850  1266 
representable by rational numbers. 
24800  1267 
 Efficient_Nat implements natural numbers by integers, which in general will 
23850  1268 
result in higher efficency; pattern matching with 0/Suc is eliminated; 
24993  1269 
includes Code_Integer. 
1270 
 Code_Index provides an additional datatype index which is mapped to 

1271 
targetlanguage builtin integers. 

26355  1272 
 Code_Message provides an additional datatype message_string which is isomorphic to 
24993  1273 
strings; messages are mapped to targetlanguage strings. 
23850  1274 

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

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

1276 

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

1277 
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

1278 

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

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

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

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

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

1283 
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

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

1285 

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

1287 

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

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

1289 

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

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

1291 
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

1292 

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

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

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

1295 
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

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

1297 

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

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

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

1300 

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

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

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

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

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

1305 
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

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

1307 

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

1308 
or 
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 
inductive_set 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

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

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

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

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

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

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 

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

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

1320 

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

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

1323 

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

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

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

1330 
than before the actual inductive definition. 

1331 

1332 
 The variables in induction and elimination rules are now 

1333 
quantified in the order of their occurrence in the introduction 

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

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

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

1337 
statements of the form 

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

1338 

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

1339 
case (rule_i a_i_1 ... a_i_{k_i}) 
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 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

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

1343 

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

1344 
 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

1345 

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

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

1347 

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

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

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

1350 
==> ... ==> P 
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 
for predicates and 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1353 

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

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

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

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

1357 

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

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

1359 

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

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

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

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

1363 

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

1366 
rule) before the above elimination rule is applicable. 

1367 

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

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

1370 
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

1371 

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

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

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

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

1377 
users are encouraged to use the new package. 

1378 

1379 
* Method "lexicographic_order" automatically synthesizes termination 

1380 
relations as lexicographic combinations of size measures. 

1381 

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

1384 
programming. Internally, this is translated into nested 

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

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

1387 
the original input but the internal form. Lambdaabstractions allow 

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

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

1390 
variable. 

23564  1391 

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

1395 
previously. Potential INCOMPATIBILITY: 

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

23377  1398 

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

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

1402 
a specific type involves instantiating the locale and possibly adding 

1403 
declarations for computation on the coefficients. The method is 

1404 
already instantiated for natural numbers and for the axiomatic class 

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

1406 
CALCULEMUS 2007 for the general principles underlying this 

1407 
architecture of contextaware prooftools. 

1408 

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

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

1412 
{ordered_field,recpower,number_ring} which subsumes real, hyper 