author  wenzelm 
Fri, 16 May 2008 21:56:13 +0200  
changeset 26925  ce964f0df281 
parent 26920  7f5b390a4448 
child 26955  ebbaa935eae0 
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 

26650  79 
* Eliminated theory ProtoPure. Potential INCOMPATIBILITY. 
80 

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

84 
INCOMPATIBILITY. 

85 

26874  86 
* Command 'setup': discontinued implicit version with ML reference. 
26434  87 

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

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

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

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

91 
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

92 
HOL/Library/Eval.thy for an ML example. 
25502  93 

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

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

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

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

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

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

99 

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

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

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

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

103 

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

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

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

106 

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

109 
predicates. 

26765  110 

111 

26762  112 
*** Document preparation *** 
113 

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

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

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

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

26914  120 

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

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

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

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

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

127 
illustration of presented theorems by particular examples. 

26762  128 

129 

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

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

131 

26874  132 
* Merged theories Wellfounded_Recursion, Accessible_Part and 
133 
Wellfounded_Relations to "Wellfounded.thy". 

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

134 

26513  135 
* Explicit class "eq" for executable equality. INCOMPATIBILITY. 
136 

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

26445  139 
INCOMPATIBILITY. 
140 

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

143 

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

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

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

146 

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

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

26355  150 

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

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

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

153 

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

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

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

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

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

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

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

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

161 

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

162 
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

163 
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

164 
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

165 

26231  166 
* Library/Option_ord.thy: Canonical order on option type. 
167 

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

170 

26231  171 
* Library/Countable.thy: Type class for countable types. 
172 

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

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

174 
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

175 
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

176 
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

177 
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

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

179 

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

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

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

182 
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

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

184 

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

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

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

188 
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

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

191 

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

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

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

194 

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

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

196 
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

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

198 

26874  199 
* Renamed theorems "power.simps" to "power_int.simps". 
25961  200 

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

201 
* Class semiring_div provides basic abstract properties of semirings 
25942  202 
with division and modulo operations. Subsumes former class dvd_mod. 
203 

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

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

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

206 

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

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

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

209 

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

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

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

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

213 

25557  214 
* 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

215 
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

216 
"primrec" command distinguishes oldstyle and newstyle specifications 
25599  217 
by syntax. The former primrec package is now named OldPrimrecPackage. 
26355  218 
When adjusting theories, beware: constants stemming from newstyle 
25609  219 
primrec specifications have authentic syntax. 
25557  220 

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

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

223 
* Library/ListVector: new theory of arithmetic vector operations. 
25900  224 

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

227 
wellorders on sets and on types. 

26500  228 

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

230 
syntax. INCOMPATIBILITY. 
25522  231 

232 
* Definitions subset_def, psubset_def, set_diff_def, Compl_def, 

233 
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def, 

234 
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def, 

235 
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def, 

236 
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

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

238 

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

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

243 
for examples, 

244 

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

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

248 

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

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

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

251 

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

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

255 

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

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

258 
reconstruction_modulus, reconstruction_sorts renamed 

259 
sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY. 

260 

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

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

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

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

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

267 
type and generates all solutions by prologstyle backwards proof using 

268 
the declared rules. 

269 

270 
This setup also deals with rules like 

271 

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

273 

274 
which accomodates nested datatypes that recurse through lists. Similar 

275 
rules are predeclared for products and option types. 

276 

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

277 

26197  278 
*** ZF *** 
279 

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

282 

283 
Datatype > Datatype_ZF 

284 
Inductive > Inductive_ZF 

285 
Int > Int_ZF 

286 
IntDiv > IntDiv_ZF 

287 
Nat > Nat_ZF 

288 
List > List_ZF 

289 
Main > Main_ZF 

290 

291 
INCOMPATIBILITY: ZF theories that import individual theories below 

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

293 
available, as trivial extension of Main_ZF. 

26197  294 

295 

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

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

297 

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

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

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

300 

26387  301 
* Removed obsolete "use_legacy_bindings" function. INCOMPATIBILITY. 
302 

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

305 

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

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

307 
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

308 
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

309 
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

310 
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

311 

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

314 
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

315 

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

316 

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

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

318 

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

321 
isatool yxml as described in the Isabelle system manual. 

322 

323 
* Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented 

324 
way of changing the user's settings is via 

26218  325 
ISABELLE_HOME_USER/etc/settings, which is a fully featured bash 
326 
script. 

327 

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

330 

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

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

332 
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

333 
optimal performance tuning. The corresponding usedir option M allows 
25778  334 
"max" as an alias for "0". WARNING: does not work on certain versions 
335 
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

336 

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

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

338 
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

339 
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

340 

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

343 

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

345 
Isabelle from flooding interactive frontends (notably ProofGeneral / 

346 
XEmacs). 

347 

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

351 

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

354 

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

355 

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

356 

25429  357 
New in Isabelle2007 (November 2007) 
358 
 

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

359 

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

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

361 

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

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

22826  366 

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

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

368 
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

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

370 

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

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

372 
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

373 
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

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

375 

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

378 
quotes. 

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

379 

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

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

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

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

383 
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

384 
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

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

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

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

388 
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

389 

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

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

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

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

394 
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

395 
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

396 

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

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

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

401 

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

403 
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

404 
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

405 
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

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

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

408 

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

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

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

413 
ambiguities introduced later on. INCOMPATIBILITY: constants in parse 

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

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

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

417 

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

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

419 
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

420 
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

421 
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

422 
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

423 
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

424 
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

425 

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

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

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

428 
support a specific search form (see ProofGeneral/CHANGES). 
22965  429 

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

432 
suppressed from proof state output. Note that the ProofGeneral 

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

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

435 
limit is imposed. 

436 

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

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

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

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

440 
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

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

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

443 

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

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

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

446 

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

447 

17865  448 
*** Document preparation *** 
449 

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

452 
current context. 

21339  453 

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

17865  456 

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

21735  459 
arguments may be given on the LHS.) 
21717  460 

461 

17779  462 
*** Pure *** 
463 

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

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

468 
constants with qualified polymorphism (according to the class 

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

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

471 
between global polymorphic consts and internal locale representation. 

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

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

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

478 

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

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

481 
writing SML code to a file: 
25199  482 
export_code <list of constants (term syntax)> in SML <filename> 
22735  483 
writing OCaml code to a file: 
25199  484 
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

485 
writing Haskell code to a bunch of files: 
25199  486 
export_code <list of constants (term syntax)> in Haskell <filename> 
487 

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

25184  489 
method ``eval'' 
490 

491 
Reasonable default setup of framework in HOL. 

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

492 

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

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

494 

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

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

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

499 

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

501 

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

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

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

504 

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

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

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

507 

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

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

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

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

511 

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

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

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

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

515 

25199  516 
code_instance and code_class only are effective to target Haskell. 
22735  517 

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

24800  520 
generation from Isabelle/HOL theories is available via "isatool doc 
521 
codegen". 

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

522 

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

525 
annotations). 

526 

19254  527 
* Command 'no_translations' removes translation rules from theory 
528 
syntax. 

529 

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

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

533 
correspondence to type class and instance declarations. 

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

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

19711  536 

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

538 
instantiation that matches an instance against the most general 

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

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

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

542 
recursion over such type arguments. Incomplete specification patterns 

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

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

547 

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

550 
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

551 
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

552 
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

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

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

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

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

557 
toplevel undo/redo and fail to work with multithreading. 
24086  558 

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

559 
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

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

561 

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

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

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

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

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

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

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

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

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

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

571 

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

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

576 
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

577 
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

578 
order. 
24086  579 

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

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

583 
difference of the original declaration context wrt. the application 

584 
context encountered later on. 

585 

586 
* Isar: proper interfaces for simplification procedures. Command 

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

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

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

590 

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

592 
abbreviates a theorem reference involving an internal dummy fact, 

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

594 
the background context will persist. This form of inplace 

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

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

597 

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

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

599 
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

600 
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

601 
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

602 
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

603 
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

604 
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

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

606 

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

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

608 
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

609 
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

610 
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

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

612 

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

615 

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

617 
then guess x and y by clarify 

618 

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

620 
proof tools being involved here. 

621 

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

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

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

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

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

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

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

630 

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

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

18020  634 

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

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

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

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

639 

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

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

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

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

643 

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

646 

18308  647 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
648 

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

650 

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

653 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  654 
'unfolded' attribute may be replaced by firstclass proof text. 
655 

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

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

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

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

659 
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

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

661 

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

664 

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

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

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

670 
originally first one. 

19220  671 

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

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

673 
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

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

675 

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

678 
(essentially a disjunction of cases with local parameters and 

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

18910  680 
adequately; in this notation common elimination rules look like this: 
18901  681 

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

683 
assumes "EX x. P x" 

684 
obtains x where "P x" 

685 

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

687 
assumes "A & B" 

688 
obtains A and B 

689 

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

691 
assumes "A  B" 

692 
obtains 

693 
A 

694 
 B 

695 

18910  696 
The subsequent classical rules even refer to the formal "thesis" 
18901  697 
explicitly: 
698 

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

700 
obtains "~ thesis" 

701 

18910  702 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
703 
obtains "thesis ==> something" 

18901  704 

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

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

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

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

710 
case_names). 

18901  711 

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

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

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

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

715 
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

716 

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

719 
toplevel lemma. 

720 

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

723 

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

726 
to occur. 

727 

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

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

729 
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

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

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

732 

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

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

734 
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

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

736 

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

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

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

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

742 
current context. 

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

743 

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

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

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

748 

19665  749 
axiomatization 
21595  750 
eq (infix "===" 50) where 
751 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

752 

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

754 
definition g where "g x = f x x" 

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

755 

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

759 

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

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

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

19088  764 
parameters implicit and using the original short name. See also 
25177  765 
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic 
19083  766 
entities from a monomorphic theory. 
767 

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

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

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

772 
prevents folding of abbreviations in term output. 
19084  773 

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

774 
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

775 
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

776 
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

777 
'translations' with explicit "CONST" markup to accommodate this. 
19665  778 

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

781 
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

782 

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

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

784 

24738  785 
inductive conj for A B 
786 
where "A ==> B ==> conj A B" 

787 

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

790 
abbreviations on output. 

791 

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

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

795 
endomorphisms as locale endom = homom mult mult h. 

19783  796 

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

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

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

801 
predicates, goals repesenting already interpreted fragments are not 

802 
removed automatically. Use methods `intro_locales' and 

803 
`unfold_locales'; see below. 

804 

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

806 
provide backward reasoning on locales predicates. The methods are 

807 
aware of interpretations and discharge corresponding goals. 

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

809 
unfold predicates to assumptions. 

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

810 

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

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

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

814 

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

817 
unfolded in interpreted theorems. This is useful for replacing 

818 
defined concepts (constants depending on locale parameters) by 

819 
concepts already existing in the target context. Example: 

820 

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

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

823 

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

826 
partial_order. 

827 

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

831 
(using objectlogic connectives for this purpose has been long 

832 
obsolete anyway). Common proof patterns are explained in 

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

835 
examples. 

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

836 

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

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

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

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

842 

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

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

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

848 

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

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

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

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

853 

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

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

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

856 

24859  857 
* Method "coinduct": dual of induction, see 
18399  858 
src/HOL/Library/Coinductive_List.thy for various examples. 
859 

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

862 

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

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

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

865 

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

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

869 
trace indicates where parts have been suppressed. 

18674  870 

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

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

872 
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

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

874 

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

877 
least one premise. 

878 

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

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

883 

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

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

885 
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

886 
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

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

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

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

890 

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

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

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

893 
for example "A > B" => "Pi A (%_. B)". 
17779  894 

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

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

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

897 

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

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

900 

17865  901 

17806  902 
*** HOL *** 
903 

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

906 
Examples are in the directory MetisExamples. WARNING: the 

907 
Isabelle/HOLMetis integration does not yet work properly with 

908 
multithreading. 

909 

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

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

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

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

914 
work with multithreading. 

915 

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

918 
auto_quickcheck (default true) and auto_quickcheck_time_limit (default 

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

24804  921 

25184  922 
* New constant "undefined" with axiom "undefined x = undefined". 
923 

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

925 
equality. 

926 

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

928 
the new 'class' package: 

929 

930 
HOL.abs ~> HOL.abs_class.abs 

931 
HOL.divide ~> HOL.divide_class.divide 

932 
0 ~> HOL.zero_class.zero 

933 
1 ~> HOL.one_class.one 

934 
op + ~> HOL.plus_class.plus 

935 
op  ~> HOL.minus_class.minus 

936 
uminus ~> HOL.minus_class.uminus 

937 
op * ~> HOL.times_class.times 

938 
op < ~> HOL.ord_class.less 

939 
op <= > HOL.ord_class.less_eq 

940 
Nat.power ~> Power.power_class.power 

941 
Nat.size ~> Nat.size_class.size 

942 
Numeral.number_of ~> Numeral.number_class.number_of 

943 
FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf 

944 
FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup 

945 
Orderings.min ~> Orderings.ord_class.min 

946 
Orderings.max ~> Orderings.ord_class.max 

947 
Divides.op div ~> Divides.div_class.div 

948 
Divides.op mod ~> Divides.div_class.mod 

949 
Divides.op dvd ~> Divides.div_class.dvd 

950 

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

952 

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

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

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

956 
names. 

957 

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

959 
INCOMPATIBILITY: use more specific names. 

960 

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

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

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

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

965 
distribution). INCOMPATIBILITY: rewrite proofs 

966 

967 
d) ML code directly refering to constant names 

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

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

970 
Consider using @{const_name} antiquotation. 

971 

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

973 

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

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

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

977 
sgn_div_norm; ordered_idom now also inherits from sgn_if. 

978 
INCOMPATIBILITY. 

979 

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

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

982 

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

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

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

986 

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

988 
changed order of proof goals in instance proofs. 

989 

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

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

992 
in all contexts importing or interpreting the corresponding locales. 

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

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

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

996 
in the current context. 

997 

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

999 
lemmas max_of_mono and min_of_mono with this predicate. 

1000 
INCOMPATIBILITY. 

1001 

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

1003 
with new class dense_linear_order. 

1004 

1005 
* Uniform lattice theory development in HOL. 

1006 

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

1008 
constant "Meet" now named "Inf" 

1009 

1010 
classes "meet_semilorder" and "join_semilorder" now named 

1011 
"lower_semilattice" and "upper_semilattice" 

1012 
class "lorder" now named "lattice" 

1013 
class "comp_lat" now named "complete_lattice" 

1014 

1015 
Instantiation of lattice classes allows explicit definitions 

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

1017 

1018 
INCOMPATIBILITY. Theorem renames: 

1019 

1020 
meet_left_le ~> inf_le1 

1021 
meet_right_le ~> inf_le2 

1022 
join_left_le ~> sup_ge1 

1023 
join_right_le ~> sup_ge2 

1024 
meet_join_le ~> inf_sup_ord 

1025 
le_meetI ~> le_infI 

1026 
join_leI ~> le_supI 

1027 
le_meet ~> le_inf_iff 

1028 
le_join ~> ge_sup_conv 

1029 
meet_idempotent ~> inf_idem 

1030 
join_idempotent ~> sup_idem 

1031 
meet_comm ~> inf_commute 

1032 
join_comm ~> sup_commute 

1033 
meet_leI1 ~> le_infI1 

1034 
meet_leI2 ~> le_infI2 

1035 
le_joinI1 ~> le_supI1 

1036 
le_joinI2 ~> le_supI2 

1037 
meet_assoc ~> inf_assoc 

1038 
join_assoc ~> sup_assoc 

1039 
meet_left_comm ~> inf_left_commute 

1040 
meet_left_idempotent ~> inf_left_idem 

1041 
join_left_comm ~> sup_left_commute 

1042 
join_left_idempotent ~> sup_left_idem 

1043 
meet_aci ~> inf_aci 

1044 
join_aci ~> sup_aci 

1045 
le_def_meet ~> le_iff_inf 

1046 
le_def_join ~> le_iff_sup 

1047 
join_absorp2 ~> sup_absorb2 

1048 
join_absorp1 ~> sup_absorb1 

1049 
meet_absorp1 ~> inf_absorb1 

1050 
meet_absorp2 ~> inf_absorb2 

1051 
meet_join_absorp ~> inf_sup_absorb 

1052 
join_meet_absorp ~> sup_inf_absorb 

1053 
distrib_join_le ~> distrib_sup_le 

1054 
distrib_meet_le ~> distrib_inf_le 

1055 

1056 
add_meet_distrib_left ~> add_inf_distrib_left 

1057 
add_join_distrib_left ~> add_sup_distrib_left 

1058 
is_join_neg_meet ~> is_join_neg_inf 

1059 
is_meet_neg_join ~> is_meet_neg_sup 

1060 
add_meet_distrib_right ~> add_inf_distrib_right 

1061 
add_join_distrib_right ~> add_sup_distrib_right 

1062 
add_meet_join_distribs ~> add_sup_inf_distribs 

1063 
join_eq_neg_meet ~> sup_eq_neg_inf 

1064 
meet_eq_neg_join ~> inf_eq_neg_sup 

1065 
add_eq_meet_join ~> add_eq_inf_sup 

1066 
meet_0_imp_0 ~> inf_0_imp_0 

1067 
join_0_imp_0 ~> sup_0_imp_0 

1068 
meet_0_eq_0 ~> inf_0_eq_0 

1069 
join_0_eq_0 ~> sup_0_eq_0 

1070 
neg_meet_eq_join ~> neg_inf_eq_sup 

1071 
neg_join_eq_meet ~> neg_sup_eq_inf 

1072 
join_eq_if ~> sup_eq_if 

1073 

1074 
mono_meet ~> mono_inf 

1075 
mono_join ~> mono_sup 

1076 
meet_bool_eq ~> inf_bool_eq 

1077 
join_bool_eq ~> sup_bool_eq 

1078 
meet_fun_eq ~> inf_fun_eq 

1079 
join_fun_eq ~> sup_fun_eq 

1080 
meet_set_eq ~> inf_set_eq 

1081 
join_set_eq ~> sup_set_eq 

1082 
meet1_iff ~> inf1_iff 

1083 
meet2_iff ~> inf2_iff 

1084 
meet1I ~> inf1I 

1085 
meet2I ~> inf2I 

1086 
meet1D1 ~> inf1D1 

1087 
meet2D1 ~> inf2D1 

1088 
meet1D2 ~> inf1D2 

1089 
meet2D2 ~> inf2D2 

1090 
meet1E ~> inf1E 

1091 
meet2E ~> inf2E 

1092 
join1_iff ~> sup1_iff 

1093 
join2_iff ~> sup2_iff 

1094 
join1I1 ~> sup1I1 

1095 
join2I1 ~> sup2I1 

1096 
join1I1 ~> sup1I1 

1097 
join2I2 ~> sup1I2 

1098 
join1CI ~> sup1CI 

1099 
join2CI ~> sup2CI 

1100 
join1E ~> sup1E 

1101 
join2E ~> sup2E 

1102 

1103 
is_meet_Meet ~> is_meet_Inf 

1104 
Meet_bool_def ~> Inf_bool_def 

1105 
Meet_fun_def ~> Inf_fun_def 

1106 
Meet_greatest ~> Inf_greatest 

1107 
Meet_lower ~> Inf_lower 

1108 
Meet_set_def ~> Inf_set_def 

1109 

1110 
Sup_def ~> Sup_Inf 

1111 
Sup_bool_eq ~> Sup_bool_def 

1112 
Sup_fun_eq ~> Sup_fun_def 

1113 
Sup_set_eq ~> Sup_set_def 

1114 

1115 
listsp_meetI ~> listsp_infI 

1116 
listsp_meet_eq ~> listsp_inf_eq 

1117 

1118 
meet_min ~> inf_min 

1119 
join_max ~> sup_max 

1120 

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

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

1123 

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

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

25184  1127 
"*.size". 
1128 

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

1130 
INCOMPATIBILITY. 

24800  1131 

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

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

1134 
fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY. 

1135 

25129  1136 
* HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY. 
1137 

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

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

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

1142 
lemmas on overflow and monotonicity. Instantiated to all appropriate 

1143 
arithmetic type classes, supporting automatic simplification of 

1144 
numerals on all operations. 

24333  1145 

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

1147 

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

1149 

23850  1150 
* Code generator library theories: 
24993  1151 
 Code_Integer represents HOL integers by big integer literals in target 
23850  1152 
languages. 
24993  1153 
 Code_Char represents HOL characters by character literals in target 
23850  1154 
languages. 
24993  1155 
 Code_Char_chr like Code_Char, but also offers treatment of character 
1156 
codes; includes Code_Integer. 

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

23850  1159 
denominator). 
24800  1160 
 Executable_Real implements a subset of real numbers, namly those 
23850  1161 
representable by rational numbers. 
24800  1162 
 Efficient_Nat implements natural numbers by integers, which in general will 
23850  1163 
result in higher efficency; pattern matching with 0/Suc is eliminated; 
24993  1164 
includes Code_Integer. 
1165 
 Code_Index provides an additional datatype index which is mapped to 

1166 
targetlanguage builtin integers. 

26355  1167 
 Code_Message provides an additional datatype message_string which is isomorphic to 
24993  1168 
strings; messages are mapped to targetlanguage strings. 
23850  1169 

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

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

1171 

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

1172 
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

1173 

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

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

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

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

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

1178 
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

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

1180 

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

1182 

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

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

1184 

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

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

1186 
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

1187 

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

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

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

1190 
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

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

1192 

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

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

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

1195 

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

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

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

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

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

1200 
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

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

1202 

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

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

1204 

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

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

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

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

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

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

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

1211 
 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

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

1213 

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

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

1215 

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

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

1218 

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

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

1220 

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

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

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

1225 
than before the actual inductive definition. 

1226 

1227 
 The variables in induction and elimination rules are now 

1228 
quantified in the order of their occurrence in the introduction 

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

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

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

1232 
statements of the form 

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

1233 

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

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

1235 

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

1236 
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

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

1238 

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

1239 
 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

1240 

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

1241 
 The format of the elimination rules is now 
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 
p z_1 ... z_m x_1 ... x_n ==> 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

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

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

1246 

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

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

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

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

1252 

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

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

1254 

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

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

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

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

1258 

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

1261 
rule) before the above elimination rule is applicable. 

1262 

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

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

1265 
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

1266 

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

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

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

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

1272 
users are encouraged to use the new package. 

1273 

1274 
* Method "lexicographic_order" automatically synthesizes termination 

1275 
relations as lexicographic combinations of size measures. 

1276 

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

1279 
programming. Internally, this is translated into nested 

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

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

1282 
the original input but the internal form. Lambdaabstractions allow 

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

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

1285 
variable. 

23564  1286 

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

1290 
previously. Potential INCOMPATIBILITY: 

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

23377  1293 

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

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

1297 
a specific type involves instantiating the locale and possibly adding 

1298 
declarations for computation on the coefficients. The method is 

1299 
already instantiated for natural numbers and for the axiomatic class 

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

1301 
CALCULEMUS 2007 for the general principles underlying this 

1302 
architecture of contextaware prooftools. 

1303 

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

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

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

1308 
rat, etc. 

1309 

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

1312 
circumvent possible incompatibilities when working on ML level. 

1313 

24996  1314 
* primrec: missing cases mapped to "undefined" instead of "arbitrary". 
22845  1315 

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

1318 

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

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

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

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

1324 
comprehension syntax, and for uniformity. INCOMPATIBILITY. 

1325 

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

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

1328 
INCOMPATIBILITY. 

1329 

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

1331 

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

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

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

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

1337 
positive/negative (in inequations). 

23480  1338 

1339 
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib 

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

1342 
because they were subsumed by lemmas xyz. INCOMPATIBILITY. 

1343 

25177  1344 
* Theory Library/Commutative_Ring: switched from recdef to function 
24800  1345 
package; constants add, mul, pow now curried. Infix syntax for 
1346 
algebraic operations. 

22735  1347 

24800  1348 
* Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq. 
22218  1349 
INCOMPATIBILITY. 
1350 

24800  1351 
* Dropped redundant lemma if_def2 in favor of if_bool_eq_conj. 
22218  1352 
INCOMPATIBILITY. 
1353 

22126  1354 
* HOL/records: generalised fieldupdate to take a function on the 
1355 
field rather than the new value: r(A := x) is translated to A_update 

1356 
(K x) r The Kcombinator that is internally used is called K_record. 

21226
a607ae87ee81
fieldupdate in records is generalised to take a function on the field
schirmer
parents:
21215
diff
changeset

1357 
INCOMPATIBILITY: Usage of the plain update functions has to be 
a607ae87ee81
fieldupdate in records is generalised to take a function on the field
schirmer
parents:
21215
diff
changeset

1358 
adapted. 
a607ae87ee81
fieldupdate in records is generalised to take a function on the field
schirmer
parents:
21215
diff
changeset

1359 

24800  1360 
* Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0 
1361 
* x = 0, which are required for a semiring. Richer structures do not 

1362 
inherit from semiring_0 anymore, because this property is a theorem 

1363 
there, not an axiom. INCOMPATIBILITY: In instances of semiring_0, 

1364 
there is more to prove, but this is mostly trivial. 

1365 

1366 
* Class "recpower" is generalized to arbitrary monoids, not just 

1367 
commutative semirings. INCOMPATIBILITY: may need to incorporate 

25163  1368 
commutativity or semiring properties additionally. 
21215
7c9337a0e30a
made locale partial_order compatible with axclass order
haftmann
parents:
21209
diff
changeset

1369 

21099  1370 
* Constant "List.list_all2" in List.thy now uses authentic syntax. 
24800  1371 
INCOMPATIBILITY: translations containing list_all2 may go wrong, 
1372 
better use 'abbreviation'. 

1373 

1374 
* Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY. 

1375 

22126  1376 
* Numeral syntax: type 'bin' which was a mere type copy of 'int' has 
24800  1377 
been abandoned in favour of plain 'int'. INCOMPATIBILITY  
22126  1378 
significant changes for setting up numeral syntax for types: 
24800  1379 
 New constants Numeral.pred and Numeral.succ instead 
20485  1380 
of former Numeral.bin_pred and Numeral.bin_succ. 
1381 
 Use integer operations instead of bin_add, bin_mult and so on. 

1382 
 Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps. 

1383 
 ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. 

1384 

25177  1385 
See src/HOL/Integ/IntArith.thy for an example setup. 
1386 

1387 
* Command 'normal_form' computes the normal form of a term that may 

1388 
contain free variables. For example ``normal_form "rev [a, b, c]"'' 

1389 
produces ``[b, c, a]'' (without proof). This command is suitable for 

1390 
heavyduty computations because the functions are compiled to ML 

1391 
first. Correspondingly, a method "normalization" is provided. See 

1392 
further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML. 

19895  1393 

17996  1394 
* Alternative iff syntax "A <> B" for equality on bool (with priority 
1395 
25 like >); output depends on the "iff" print_mode, the default is 

1396 
"A = B" (with priority 50). 

1397 

21265  1398 
* Relations less (<) and less_eq (<=) are also available on type bool. 
1399 
Modified syntax to disallow nesting without explicit parentheses, 

24800  1400 
e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential 
1401 
INCOMPATIBILITY. 

21265  1402 

18674  1403 
* "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only). 
1404 

20716
a6686a8e1b68
Changed precedence of "op O" (relation composition) from 60 to 75.
krauss
parents:
20712
diff
changeset

1405 
* Relation composition operator "op O" now has precedence 75 and binds 
a6686a8e1b68
Changed precedence of "op O" (relation composition) from 60 to 75.
krauss
parents:
20712
diff
changeset

1406 
stronger than union and intersection. INCOMPATIBILITY. 
a6686a8e1b68
Changed precedence of "op O" (relation composition) from 60 to 75.
krauss
parents:
20712
diff
changeset

1407 

22126  1408 
* The old set interval syntax "{m..n(}" (and relatives) has been 
1409 
removed. Use "{m..<n}" (and relatives) instead. 

19377  1410 

17865  1411 
* In the context of the assumption "~(s = t)" the Simplifier rewrites 
24800  1412 
"t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using 
1413 
``declare [[simproc del: neq]]''. 

< 