author  berghofe 
Wed, 21 May 2008 14:04:41 +0200  
changeset 26964  df1f238a05f7 
parent 26955  ebbaa935eae0 
child 27008  9e39f5403db7 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

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

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

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

6 

25522  7 
*** General *** 
8 

25579
22869d9d545b
(alt)string: allow explicit character codes (as in ML);
wenzelm
parents:
25557
diff
changeset

9 
* Syntax: symbol \<chi> is now considered a letter. Potential 
22869d9d545b
(alt)string: allow explicit character codes (as in ML);
wenzelm
parents:
25557
diff
changeset

10 
INCOMPATIBILITY in identifier syntax etc. 
22869d9d545b
(alt)string: allow explicit character codes (as in ML);
wenzelm
parents:
25557
diff
changeset

11 

22869d9d545b
(alt)string: allow explicit character codes (as in ML);
wenzelm
parents:
25557
diff
changeset

12 
* Outer syntax: string tokens may contain arbitrary character codes 
22869d9d545b
(alt)string: allow explicit character codes (as in ML);
wenzelm
parents:
25557
diff
changeset

13 
specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for 
22869d9d545b
(alt)string: allow explicit character codes (as in ML);
wenzelm
parents:
25557
diff
changeset

14 
"foo_bar". 
25522  15 

26006
c973b4981276
* Outer syntax: string tokens no longer admit escaped white space;
wenzelm
parents:
25994
diff
changeset

16 
* Outer syntax: string tokens no longer admit escaped white space, 
c973b4981276
* Outer syntax: string tokens no longer admit escaped white space;
wenzelm
parents:
25994
diff
changeset

17 
which was an accidental (undocumented) feature. INCOMPATIBILITY, use 
c973b4981276
* Outer syntax: string tokens no longer admit escaped white space;
wenzelm
parents:
25994
diff
changeset

18 
white space directly. 
c973b4981276
* Outer syntax: string tokens no longer admit escaped white space;
wenzelm
parents:
25994
diff
changeset

19 

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

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

23 
provides a proper context already. 

24 

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

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

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

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

28 

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

26659  31 
space take precedence. INCOMPATIBILITY in rare situations, may try to 
26650  32 
swap theory imports. 
33 

25522  34 

25502  35 
*** Pure *** 
36 

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

39 

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

42 

43 
(1) unused_thms 

44 
Only finds unused theorems in the current theory. 

45 

46 
(2) unused_thms thy_1 ... thy_n  

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

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

49 

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

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

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

53 
their ancestors. 

54 

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

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

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

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

62 

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

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

26874  65 
usually the case when using Proof General with the default settings). 
26681  66 

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

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

70 
that tools may maintain dynamically scoped facts systematically, using 

71 
PureThy.add_thms_dynamic. 

72 

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

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

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

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

77 
update of theories within ML code. 
26479  78 

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

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

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

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

82 
depending on former CPure need to refer to Pure. 
26650  83 

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

87 
INCOMPATIBILITY. 

88 

26874  89 
* Command 'setup': discontinued implicit version with ML reference. 
26434  90 

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

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

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

93 
Typechecking phase allows to refer to class operations uniformly. 
9053fd546501
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs here;
wenzelm
parents:
25961
diff
changeset

94 
See HOL/Complex/Complex.thy for an Isar example and 
26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

95 
HOL/Library/Eval.thy for an ML example. 
25502  96 

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

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

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

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

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

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

102 

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

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

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

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

106 

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

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

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

109 

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

112 
predicates. 

26765  113 

114 

26762  115 
*** Document preparation *** 
116 

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

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

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

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

26914  123 

26874  124 
* Antiquotation "lemma" takes a proposition and a simple method text 
125 
as argument and asserts that the proposition is provable by the 

126 
corresponding method invocation. Prints text of proposition, as does 

127 
antiquotation "prop". A simple method text is either a method name or 

128 
a method name plus (optional) method arguments in parentheses, 

129 
mimicking the conventions known from Isar proof text. Useful for 

130 
illustration of presented theorems by particular examples. 

26762  131 

132 

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

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

134 

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

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

136 

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

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

138 

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

139 
 Definitions of overloaded constants on sets have to be 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

140 
replaced by definitions on => and bool. 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

141 

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

142 
 Some definitions of overloaded operators on sets can now be proved 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

143 
using the definitions of the operators on => and bool. 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

144 
Therefore, the following theorems have been renamed: 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

145 

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

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

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

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

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

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

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

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

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

154 

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

155 
 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

156 
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

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

158 

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

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

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

161 

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

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

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

164 

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

165 
no longer works (due to the incompleteness of the HO unification algorithm) 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

166 
and must be replaced by the pattern 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

167 

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

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

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

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

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

172 

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

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

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

175 

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

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

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

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

179 

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

180 
no longer works (for similar reasons as the previous example) and must be 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

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

182 

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

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

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

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

186 

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

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

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

189 

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

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

191 

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

192 
must be rewritten. Moreover, functions like strip_type or binder_types no 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

193 
longer return the right value when applied to a type of the form 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

194 

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

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

196 

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

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

198 

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

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

200 

26874  201 
* Merged theories Wellfounded_Recursion, Accessible_Part and 
202 
Wellfounded_Relations to "Wellfounded.thy". 

26748
4d51ddd6aa5c
Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
26724
diff
changeset

203 

26513  204 
* Explicit class "eq" for executable equality. INCOMPATIBILITY. 
205 

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

26445  208 
INCOMPATIBILITY. 
209 

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

212 

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

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

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

215 

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

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

26355  219 

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

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

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

222 

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

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

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

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

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

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

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

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

230 

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

231 
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

232 
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

233 
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

234 

26231  235 
* Library/Option_ord.thy: Canonical order on option type. 
236 

26197  237 
* Library/RBT.thy: New theory of redblack trees, an efficient 
238 
implementation of finite maps. 

239 

26231  240 
* Library/Countable.thy: Type class for countable types. 
241 

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

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

243 
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

244 
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

245 
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

246 
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

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

248 

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

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

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

251 
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

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

253 

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

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

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

257 
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

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

260 

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

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

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

263 

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

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

265 
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

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

267 

26874  268 
* Renamed theorems "power.simps" to "power_int.simps". 
25961  269 

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

270 
* Class semiring_div provides basic abstract properties of semirings 
25942  271 
with division and modulo operations. Subsumes former class dvd_mod. 
272 

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

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

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

275 

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

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

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

278 

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

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

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

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

282 

25557  283 
* New primrec package. Specification syntax conforms in style to 
26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

284 
definition/function/.... No separate induction rule is provided. The 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

285 
"primrec" command distinguishes oldstyle and newstyle specifications 
25599  286 
by syntax. The former primrec package is now named OldPrimrecPackage. 
26355  287 
When adjusting theories, beware: constants stemming from newstyle 
25609  288 
primrec specifications have authentic syntax. 
25557  289 

25522  290 
* Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}. 
291 

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

292 
* Library/ListVector: new theory of arithmetic vector operations. 
25900  293 

26874  294 
* Library/Order_Relation: new theory of various orderings as sets of 
295 
pairs. Defines preorders, partial orders, linear orders and 

296 
wellorders on sets and on types. 

26500  297 

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

299 
syntax. INCOMPATIBILITY. 
25522  300 

301 
* Definitions subset_def, psubset_def, set_diff_def, Compl_def, 

302 
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def, 

303 
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def, 

304 
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def, 

305 
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

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

307 

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

308 
* Method "induction_scheme" derives userspecified induction rules 
26874  309 
from wellfounded induction and completeness of patterns. This factors 
25664  310 
out some operations that are done internally by the function package 
311 
and makes them available separately. See "HOL/ex/Induction_Scheme.thy" 

312 
for examples, 

313 

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

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

317 

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

318 
* Metis prover is now an order of magnitude faster, and also works 
9728f319ffc6
* Metis prover an order of magnitude faster, works with multithreading.
wenzelm
parents:
25712
diff
changeset

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

320 

26874  321 
* Metis: the maximum number of clauses that can be produced from a 
322 
theorem is now given by the attribute max_clauses. Theorems that 

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

324 

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

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

327 
reconstruction_modulus, reconstruction_sorts renamed 

328 
sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY. 

329 

26877  330 
* More flexible generation of measure functions for termination proofs: 
331 
Measure functions can be declared by proving a rule of the form 

332 
"is_measure f" and giving it the [measure_function] attribute. The 

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

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

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

336 
type and generates all solutions by prologstyle backwards proof using 

337 
the declared rules. 

338 

339 
This setup also deals with rules like 

340 

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

342 

343 
which accomodates nested datatypes that recurse through lists. Similar 

344 
rules are predeclared for products and option types. 

345 

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

346 

26197  347 
*** ZF *** 
348 

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

351 

352 
Datatype > Datatype_ZF 

353 
Inductive > Inductive_ZF 

354 
Int > Int_ZF 

355 
IntDiv > IntDiv_ZF 

356 
Nat > Nat_ZF 

357 
List > List_ZF 

358 
Main > Main_ZF 

359 

360 
INCOMPATIBILITY: ZF theories that import individual theories below 

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

362 
available, as trivial extension of Main_ZF. 

26197  363 

364 

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

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

366 

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

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

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

369 

26387  370 
* Removed obsolete "use_legacy_bindings" function. INCOMPATIBILITY. 
371 

26188  372 
* ML within Isar: antiquotation @{const name} or @{const 
373 
name(typargs)} produces staticallychecked Const term. 

374 

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

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

376 
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

377 
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

378 
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

379 
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

380 

26874  381 
* Functions system/system_out provide a robust way to invoke external 
382 
shell commands, with propagation of interrupts (after Poly/ML 5.2). 

383 
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

384 

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

385 

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

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

387 

26575  388 
* YXML notation provides a simple and efficient alternative to 
389 
standard XML transfer syntax. See src/Pure/General/yxml.ML and 

390 
isatool yxml as described in the Isabelle system manual. 

391 

392 
* Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented 

393 
way of changing the user's settings is via 

26218  394 
ISABELLE_HOME_USER/etc/settings, which is a fully featured bash 
395 
script. 

396 

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

399 

25776
4e4eb0f87850
Multithreading.max_threads := 0 refers to number of cores of underlying machine;
wenzelm
parents:
25772
diff
changeset

400 
* Multithreading.max_threads := 0 refers to the number of actual CPU 
4e4eb0f87850
Multithreading.max_threads := 0 refers to number of cores of underlying machine;
wenzelm
parents:
25772
diff
changeset

401 
cores of the underlying machine, which is a good starting point for 
4e4eb0f87850
Multithreading.max_threads := 0 refers to number of cores of underlying machine;
wenzelm
parents:
25772
diff
changeset

402 
optimal performance tuning. The corresponding usedir option M allows 
25778  403 
"max" as an alias for "0". WARNING: does not work on certain versions 
404 
of Mac OS (with Poly/ML 5.1). 

25776
4e4eb0f87850
Multithreading.max_threads := 0 refers to number of cores of underlying machine;
wenzelm
parents:
25772
diff
changeset

405 

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

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

407 
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

408 
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

409 

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

412 

413 
* isabelleprocess: nonML sessions are run with "nice", to prevent 

414 
Isabelle from flooding interactive frontends (notably ProofGeneral / 

415 
XEmacs). 

416 

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

420 

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

423 

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

424 

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

425 

25429  426 
New in Isabelle2007 (November 2007) 
427 
 

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

428 

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

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

430 

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

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

22826  435 

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

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

437 
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

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

439 

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

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

441 
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

442 
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

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

444 

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

447 
quotes. 

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

448 

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

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

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

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

452 
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

453 
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

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

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

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

457 
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

458 

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

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

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

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

463 
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

464 
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

465 

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

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

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

470 

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

472 
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

473 
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

474 
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

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

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

477 

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

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

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

482 
ambiguities introduced later on. INCOMPATIBILITY: constants in parse 

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

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

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

486 

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

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

488 
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

489 
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

490 
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

491 
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

492 
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

493 
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

494 

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

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

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

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

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

501 
suppressed from proof state output. Note that the ProofGeneral 

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

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

504 
limit is imposed. 

505 

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

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

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

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

509 
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

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

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

512 

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

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

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

515 

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

516 

17865  517 
*** Document preparation *** 
518 

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

521 
current context. 

21339  522 

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

17865  525 

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

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

530 

17779  531 
*** Pure *** 
532 

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

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

537 
constants with qualified polymorphism (according to the class 

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

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

540 
between global polymorphic consts and internal locale representation. 

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

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

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

547 

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

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

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

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

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

25184  558 
method ``eval'' 
559 

560 
Reasonable default setup of framework in HOL. 

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

561 

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

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

563 

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

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

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

568 

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

570 

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

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

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

573 

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

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

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

576 

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

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

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

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

580 

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

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

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

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

584 

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

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

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

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

591 

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

594 
annotations). 

595 

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

598 

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

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

602 
correspondence to type class and instance declarations. 

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

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

19711  605 

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

607 
instantiation that matches an instance against the most general 

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

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

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

611 
recursion over such type arguments. Incomplete specification patterns 

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

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

616 

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

619 
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

620 
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

621 
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

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

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

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

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

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

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

628 
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

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

630 

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

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

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

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

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

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

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

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

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

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

640 

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

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

645 
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

646 
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

647 
order. 
24086  648 

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

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

652 
difference of the original declaration context wrt. the application 

653 
context encountered later on. 

654 

655 
* Isar: proper interfaces for simplification procedures. Command 

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

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

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

659 

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

661 
abbreviates a theorem reference involving an internal dummy fact, 

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

663 
the background context will persist. This form of inplace 

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

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

666 

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

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

668 
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

669 
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

670 
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

671 
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

672 
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

673 
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

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

675 

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

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

677 
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

678 
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

679 
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

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

681 

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

684 

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

686 
then guess x and y by clarify 

687 

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

689 
proof tools being involved here. 

690 

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

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

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

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

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

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

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

699 

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

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

18020  703 

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

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

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

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

708 

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

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

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

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

712 

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

715 

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

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

719 

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

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

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

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

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

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

728 
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

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

730 

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

733 

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

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

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

739 
originally first one. 

19220  740 

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

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

742 
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

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

744 

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

747 
(essentially a disjunction of cases with local parameters and 

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

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

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

752 
assumes "EX x. P x" 

753 
obtains x where "P x" 

754 

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

756 
assumes "A & B" 

757 
obtains A and B 

758 

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

760 
assumes "A  B" 

761 
obtains 

762 
A 

763 
 B 

764 

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

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

769 
obtains "~ thesis" 

770 

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

18901  773 

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

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

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

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

779 
case_names). 

18901  780 

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

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

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

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

784 
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

785 

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

788 
toplevel lemma. 

789 

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

792 

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

795 
to occur. 

796 

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

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

798 
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

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

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

801 

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

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

803 
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

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

805 

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

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

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

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

811 
current context. 

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

812 

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

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

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

817 

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

821 

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

823 
definition g where "g x = f x x" 

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

824 

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

828 

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

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

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

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

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

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

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

841 
prevents folding of abbreviations in term output. 
19084  842 

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

843 
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

844 
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

845 
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

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

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

850 
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

851 

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

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

853 

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

856 

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

859 
abbreviations on output. 

860 

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

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

864 
endomorphisms as locale endom = homom mult mult h. 

19783  865 

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

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

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

870 
predicates, goals repesenting already interpreted fragments are not 

871 
removed automatically. Use methods `intro_locales' and 

872 
`unfold_locales'; see below. 

873 

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

875 
provide backward reasoning on locales predicates. The methods are 

876 
aware of interpretations and discharge corresponding goals. 

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

878 
unfold predicates to assumptions. 

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

879 

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

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

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

883 

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

886 
unfolded in interpreted theorems. This is useful for replacing 

887 
defined concepts (constants depending on locale parameters) by 

888 
concepts already existing in the target context. Example: 

889 

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

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

892 

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

895 
partial_order. 

896 

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

900 
(using objectlogic connectives for this purpose has been long 

901 
obsolete anyway). Common proof patterns are explained in 

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

904 
examples. 

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

905 

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

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

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

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

911 

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

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

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

917 

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

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

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

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

922 

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

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

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

925 

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

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

931 

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

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

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

934 

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

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

938 
trace indicates where parts have been suppressed. 

18674  939 

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

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

941 
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

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

943 

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

946 
least one premise. 

947 

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

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

952 

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

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

954 
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

955 
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

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

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

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

959 

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

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

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

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

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

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

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

966 

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

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

969 

17865  970 

17806  971 
*** HOL *** 
972 

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

975 
Examples are in the directory MetisExamples. WARNING: the 

976 
Isabelle/HOLMetis integration does not yet work properly with 

977 
multithreading. 

978 

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

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

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

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

983 
work with multithreading. 

984 

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

987 
auto_quickcheck (default true) and auto_quickcheck_time_limit (default 

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

24804  990 

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

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

994 
equality. 

995 

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

997 
the new 'class' package: 

998 

999 
HOL.abs ~> HOL.abs_class.abs 

1000 
HOL.divide ~> HOL.divide_class.divide 

1001 
0 ~> HOL.zero_class.zero 

1002 
1 ~> HOL.one_class.one 

1003 
op + ~> HOL.plus_class.plus 

1004 
op  ~> HOL.minus_class.minus 

1005 
uminus ~> HOL.minus_class.uminus 

1006 
op * ~> HOL.times_class.times 

1007 
op < ~> HOL.ord_class.less 

1008 
op <= > HOL.ord_class.less_eq 

1009 
Nat.power ~> Power.power_class.power 

1010 
Nat.size ~> Nat.size_class.size 

1011 
Numeral.number_of ~> Numeral.number_class.number_of 

1012 
FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf 

1013 
FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup 

1014 
Orderings.min ~> Orderings.ord_class.min 

1015 
Orderings.max ~> Orderings.ord_class.max 

1016 
Divides.op div ~> Divides.div_class.div 

1017 
Divides.op mod ~> Divides.div_class.mod 

1018 
Divides.op dvd ~> Divides.div_class.dvd 

1019 

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

1021 

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

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

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

1025 
names. 

1026 

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

1028 
INCOMPATIBILITY: use more specific names. 

1029 

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

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

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

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

1034 
distribution). INCOMPATIBILITY: rewrite proofs 

1035 

1036 
d) ML code directly refering to constant names 

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

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

1039 
Consider using @{const_name} antiquotation. 

1040 

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

1042 

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

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

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

1046 
sgn_div_norm; ordered_idom now also inherits from sgn_if. 

1047 
INCOMPATIBILITY. 

1048 

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

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

1051 

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

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

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

1055 

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

1057 
changed order of proof goals in instance proofs. 

1058 

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

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

1061 
in all contexts importing or interpreting the corresponding locales. 

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

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

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

1065 
in the current context. 

1066 

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

1068 
lemmas max_of_mono and min_of_mono with this predicate. 

1069 
INCOMPATIBILITY. 

1070 

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

1072 
with new class dense_linear_order. 

1073 

1074 
* Uniform lattice theory development in HOL. 

1075 

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

1077 
constant "Meet" now named "Inf" 

1078 

1079 
classes "meet_semilorder" and "join_semilorder" now named 

1080 
"lower_semilattice" and "upper_semilattice" 

1081 
class "lorder" now named "lattice" 

1082 
class "comp_lat" now named "complete_lattice" 

1083 

1084 
Instantiation of lattice classes allows explicit definitions 

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

1086 

1087 
INCOMPATIBILITY. Theorem renames: 

1088 

1089 
meet_left_le ~> inf_le1 

1090 
meet_right_le ~> inf_le2 

1091 
join_left_le ~> sup_ge1 

1092 
join_right_le ~> sup_ge2 

1093 
meet_join_le ~> inf_sup_ord 

1094 
le_meetI ~> le_infI 

1095 
join_leI ~> le_supI 

1096 
le_meet ~> le_inf_iff 

1097 
le_join ~> ge_sup_conv 

1098 
meet_idempotent ~> inf_idem 

1099 
join_idempotent ~> sup_idem 

1100 
meet_comm ~> inf_commute 

1101 
join_comm ~> sup_commute 

1102 
meet_leI1 ~> le_infI1 

1103 
meet_leI2 ~> le_infI2 

1104 
le_joinI1 ~> le_supI1 

1105 
le_joinI2 ~> le_supI2 

1106 
meet_assoc ~> inf_assoc 

1107 
join_assoc ~> sup_assoc 

1108 
meet_left_comm ~> inf_left_commute 

1109 
meet_left_idempotent ~> inf_left_idem 

1110 
join_left_comm ~> sup_left_commute 

1111 
join_left_idempotent ~> sup_left_idem 

1112 
meet_aci ~> inf_aci 

1113 
join_aci ~> sup_aci 

1114 
le_def_meet ~> le_iff_inf 

1115 
le_def_join ~> le_iff_sup 

1116 
join_absorp2 ~> sup_absorb2 

1117 
join_absorp1 ~> sup_absorb1 

1118 
meet_absorp1 ~> inf_absorb1 

1119 
meet_absorp2 ~> inf_absorb2 

1120 
meet_join_absorp ~> inf_sup_absorb 

1121 
join_meet_absorp ~> sup_inf_absorb 

1122 
distrib_join_le ~> distrib_sup_le 

1123 
distrib_meet_le ~> distrib_inf_le 

1124 

1125 
add_meet_distrib_left ~> add_inf_distrib_left 

1126 
add_join_distrib_left ~> add_sup_distrib_left 

1127 
is_join_neg_meet ~> is_join_neg_inf 

1128 
is_meet_neg_join ~> is_meet_neg_sup 

1129 
add_meet_distrib_right ~> add_inf_distrib_right 

1130 
add_join_distrib_right ~> add_sup_distrib_right 

1131 
add_meet_join_distribs ~> add_sup_inf_distribs 

1132 
join_eq_neg_meet ~> sup_eq_neg_inf 

1133 
meet_eq_neg_join ~> inf_eq_neg_sup 

1134 
add_eq_meet_join ~> add_eq_inf_sup 

1135 
meet_0_imp_0 ~> inf_0_imp_0 

1136 
join_0_imp_0 ~> sup_0_imp_0 

1137 
meet_0_eq_0 ~> inf_0_eq_0 

1138 
join_0_eq_0 ~> sup_0_eq_0 

1139 
neg_meet_eq_join ~> neg_inf_eq_sup 

1140 
neg_join_eq_meet ~> neg_sup_eq_inf 

1141 
join_eq_if ~> sup_eq_if 

1142 

1143 
mono_meet ~> mono_inf 

1144 
mono_join ~> mono_sup 

1145 
meet_bool_eq ~> inf_bool_eq 

1146 
join_bool_eq ~> sup_bool_eq 

1147 
meet_fun_eq ~> inf_fun_eq 

1148 
join_fun_eq ~> sup_fun_eq 

1149 
meet_set_eq ~> inf_set_eq 

1150 
join_set_eq ~> sup_set_eq 

1151 
meet1_iff ~> inf1_iff 

1152 
meet2_iff ~> inf2_iff 

1153 
meet1I ~> inf1I 

1154 
meet2I ~> inf2I 

1155 
meet1D1 ~> inf1D1 

1156 
meet2D1 ~> inf2D1 

1157 
meet1D2 ~> inf1D2 

1158 
meet2D2 ~> inf2D2 

1159 
meet1E ~> inf1E 

1160 
meet2E ~> inf2E 

1161 
join1_iff ~> sup1_iff 

1162 
join2_iff ~> sup2_iff 

1163 
join1I1 ~> sup1I1 

1164 
join2I1 ~> sup2I1 

1165 
join1I1 ~> sup1I1 

1166 
join2I2 ~> sup1I2 

1167 
join1CI ~> sup1CI 

1168 
join2CI ~> sup2CI 

1169 
join1E ~> sup1E 

1170 
join2E ~> sup2E 

1171 

1172 
is_meet_Meet ~> is_meet_Inf 

1173 
Meet_bool_def ~> Inf_bool_def 

1174 
Meet_fun_def ~> Inf_fun_def 

1175 
Meet_greatest ~> Inf_greatest 

1176 
Meet_lower ~> Inf_lower 

1177 
Meet_set_def ~> Inf_set_def 

1178 

1179 
Sup_def ~> Sup_Inf 

1180 
Sup_bool_eq ~> Sup_bool_def 

1181 
Sup_fun_eq ~> Sup_fun_def 

1182 
Sup_set_eq ~> Sup_set_def 

1183 

1184 
listsp_meetI ~> listsp_infI 

1185 
listsp_meet_eq ~> listsp_inf_eq 

1186 

1187 
meet_min ~> inf_min 

1188 
join_max ~> sup_max 

1189 

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

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

1192 

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

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

25184  1196 
"*.size". 
1197 

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

1199 
INCOMPATIBILITY. 

24800  1200 

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

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

1203 
fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY. 

1204 

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

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

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

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

1211 
lemmas on overflow and monotonicity. Instantiated to all appropriate 

1212 
arithmetic type classes, supporting automatic simplification of 

1213 
numerals on all operations. 

24333  1214 

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

1216 

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

1218 

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

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

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

1235 
targetlanguage builtin integers. 

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

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

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

1240 

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

1241 
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

1242 

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

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

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

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

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

1247 
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

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

1249 

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

1251 

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

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

1253 

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

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

1255 
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

1256 

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

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

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

1259 
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

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

1261 

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

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

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

1264 

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

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

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

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

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

1269 
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

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

1271 

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

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

1273 

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

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

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

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

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

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

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

1280 
 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

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

1282 

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

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

1284 

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

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

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

1294 
than before the actual inductive definition. 

1295 

1296 
 The variables in induction and elimination rules are now 

1297 
quantified in the order of their occurrence in the introduction 

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

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

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

1301 
statements of the form 

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

1302 

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

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

1304 

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

1305 
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

1306 
metalevel quantifiers in the introduction rules, i.e. 
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 
 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

1309 

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

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

1311 

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

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

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

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

1315 

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

1316 
for predicates and 
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 
(x_1, ..., x_n) : s z_1 ... z_m ==> 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

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

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

1321 

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

1322 
for sets rather than 
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 
x : s z_1 ... z_m ==> 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

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

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

1327 

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

1330 
rule) before the above elimination rule is applicable. 

1331 

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

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

1334 
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

1335 

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

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

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

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

1341 
users are encouraged to use the new package. 

1342 

1343 
* Method "lexicographic_order" automatically synthesizes termination 

1344 
relations as lexicographic combinations of size measures. 

1345 

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

1348 
programming. Internally, this is translated into nested 

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

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

1351 
the original input but the internal form. Lambdaabstractions allow 

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

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

1354 
variable. 

23564  1355 

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

1359 
previously. Potential INCOMPATIBILITY: 

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

23377  1362 

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

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

1366 
a specific type involves instantiating the locale and possibly adding 

1367 
declarations for computation on the coefficients. The method is 

1368 
already instantiated for natural numbers and for the axiomatic class 

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

1370 
CALCULEMUS 2007 for the general principles underlying this 

1371 
architecture of contextaware prooftools. 

1372 

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

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

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

1377 
rat, etc. 

1378 

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

1381 
circumvent possible incompatibilities when working on ML level. 

1382 

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

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

1387 

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

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

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

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

1393 
comprehension syntax, and for uniformity. INCOMPATIBILITY. 

1394 

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

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

1397 
INCOMPATIBILITY. 

1398 

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

1400 

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

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

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

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

1406 
positive/negative (in inequations). 

23480  1407 

1408 
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib 

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

1411 
because they were subsumed by lemmas xyz. INCOMPATIBILITY. 
