author  wenzelm 
Tue, 15 Apr 2008 16:25:14 +0200  
changeset 26659  aae01f2139af 
parent 26650  f131f0fbf9cd 
child 26660  f978a6f48949 
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 

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

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

40 
that tools may maintain dynamically scoped facts systematically, using 

41 
PureThy.add_thms_dynamic. 

42 

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

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

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

45 
update of theories within ML code. 
26479  46 

26650  47 
* Eliminated theory ProtoPure. Potential INCOMPATIBILITY. 
48 

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

52 
INCOMPATIBILITY. 

53 

26434  54 
* Command 'setup': discontinued implicit version. 
55 

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

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

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

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

59 
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

60 
HOL/Library/Eval.thy for an ML example. 
25502  61 

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

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

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

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

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

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

67 

25502  68 

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

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

70 

26513  71 
* Explicit class "eq" for executable equality. INCOMPATIBILITY. 
72 

26445  73 
* Class finite no longer treats UNIV as class parameter. Use class enum from 
74 
theory Library/Enum instead to achieve a similar effect. INCOMPATIBILITY. 

75 

76 
* Theory List: rule list_induct2 now has explicitly named cases "Nil" and "Cons". 

77 
INCOMPATIBILITY. 

78 

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

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

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

81 

26355  82 
* Theory Product_Type: duplicated lemmas split_Pair_apply and injective_fst_snd 
83 
removed, use split_eta and prod_eqI instead. Renamed upd_fst to apfst and upd_snd 

84 
to apsnd. INCOMPATIBILITY. 

85 

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

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

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

88 

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

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

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

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

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

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

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

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

96 

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

97 
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

98 
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

99 
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

100 

26231  101 
* Library/Option_ord.thy: Canonical order on option type. 
102 

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

105 

26231  106 
* Library/Countable.thy: Type class for countable types. 
107 

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

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

109 
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

110 
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

111 
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

112 
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

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

114 

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

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

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

117 
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

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

119 

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

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

121 
(whose purpose mainly is for various fold_set functionals) have been 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

122 
abandoned in favour of the existing algebraic classes 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

123 
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

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

126 

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

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

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

129 

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

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

131 
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

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

133 

25961  134 
* Theorems "power.simps" renamed to "power_int.simps". 
135 

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

136 
* Class semiring_div provides basic abstract properties of semirings 
25942  137 
with division and modulo operations. Subsumes former class dvd_mod. 
138 

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

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

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

141 

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

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

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

144 

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

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

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

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

148 

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

150 
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

151 
"primrec" command distinguishes oldstyle and newstyle specifications 
25599  152 
by syntax. The former primrec package is now named OldPrimrecPackage. 
26355  153 
When adjusting theories, beware: constants stemming from newstyle 
25609  154 
primrec specifications have authentic syntax. 
25557  155 

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

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

158 
* Library/ListVector: new theory of arithmetic vector operations. 
25900  159 

26500  160 
* Library/Order_Relation: new theory of various orderings as sets of pairs. 
161 
Defines preorders, partial orders, linear orders and wellorders 

162 
on sets and on types. 

163 

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

165 
syntax. INCOMPATIBILITY. 
25522  166 

167 
* Definitions subset_def, psubset_def, set_diff_def, Compl_def, 

168 
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def, 

169 
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def, 

170 
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def, 

171 
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

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

173 

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

174 
* Method "induction_scheme" derives userspecified induction rules 
25664  175 
from wellfounded induction and completeness of patterns. This factors 
176 
out some operations that are done internally by the function package 

177 
and makes them available separately. See "HOL/ex/Induction_Scheme.thy" 

178 
for examples, 

179 

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

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

183 

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

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

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

186 

26562
9d25ef112cf6
* Metis: the maximum number of clauses that can be produced from a theorem is now given by the attribute max_clauses. Theorems that exceed this number are ignored, with a warning printed.
paulson
parents:
26513
diff
changeset

187 
* Metis: the maximum number of clauses that can be produced from a theorem is now given by the attribute max_clauses. Theorems that exceed this number are ignored, with a warning printed. 
9d25ef112cf6
* Metis: the maximum number of clauses that can be produced from a theorem is now given by the attribute max_clauses. Theorems that exceed this number are ignored, with a warning printed.
paulson
parents:
26513
diff
changeset

188 

26333
68e5eee47a45
Attributes sledgehammer_full, sledgehammer_modulus, sledgehammer_sorts
paulson
parents:
26323
diff
changeset

189 
* Sledgehammer no longer produces structured proofs by default. To enable, 
68e5eee47a45
Attributes sledgehammer_full, sledgehammer_modulus, sledgehammer_sorts
paulson
parents:
26323
diff
changeset

190 
declare [[sledgehammer_full = true]]. Attributes reconstruction_modulus, 
68e5eee47a45
Attributes sledgehammer_full, sledgehammer_modulus, sledgehammer_sorts
paulson
parents:
26323
diff
changeset

191 
reconstruction_sorts renamed sledgehammer_modulus, sledgehammer_sorts. 
68e5eee47a45
Attributes sledgehammer_full, sledgehammer_modulus, sledgehammer_sorts
paulson
parents:
26323
diff
changeset

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

193 

26197  194 
*** ZF *** 
195 

196 
* Renamed theories: 

197 

198 
Datatype.thy > Datatype_ZF.thy 

199 
Inductive.thy > Inductive_ZF.thy 

200 
Int.thy > Int_ZF.thy 

201 
IntDiv.thy > IntDiv_ZF.thy 

202 
Nat.thy > Nat_ZF.thy 

203 
List.thy > List_ZF.thy 

204 
Main.thy > Main_ZF.thy 

205 

206 
This is to allow to load both ZF and HOL in the same session. 

207 

208 
INCOMPATIBILITY: ZF theories that import individual theories below 

209 
Main might need to be adapted. For compatibility, a new 

210 
"theory Main imports Main_ZF begin end" is provided, so if you just 

211 
imported "Main", no changes are needed. 

212 

213 

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

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

215 

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

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

217 
(of the same name). 
e7a94081dce7
Functor NamedThmsFun: data is available to the user as dynamic fact;
wenzelm
parents:
26387
diff
changeset

218 

26387  219 
* Removed obsolete "use_legacy_bindings" function. INCOMPATIBILITY. 
220 

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

223 

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

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

225 
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

226 
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

227 
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

228 
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

229 

26222
edf6473ac9e9
* system/system_out provides a robust way to invoke external shell
wenzelm
parents:
26218
diff
changeset

230 
* system/system_out provides a robust way to invoke external shell 
edf6473ac9e9
* system/system_out provides a robust way to invoke external shell
wenzelm
parents:
26218
diff
changeset

231 
commands, with propagation of interrupts (after Poly/ML 5.2). Do not 
edf6473ac9e9
* system/system_out provides a robust way to invoke external shell
wenzelm
parents:
26218
diff
changeset

232 
use OS.Process.system etc. directly. 
edf6473ac9e9
* system/system_out provides a robust way to invoke external shell
wenzelm
parents:
26218
diff
changeset

233 

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

234 

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

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

236 

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

239 
isatool yxml as described in the Isabelle system manual. 

240 

241 
* Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented 

242 
way of changing the user's settings is via 

26218  243 
ISABELLE_HOME_USER/etc/settings, which is a fully featured bash 
244 
script. 

245 

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

248 

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

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

250 
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

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

254 

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

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

256 
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

257 
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

258 

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

261 

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

263 
Isabelle from flooding interactive frontends (notably ProofGeneral / 

264 
XEmacs). 

265 

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

269 

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

272 

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

273 

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

274 

25429  275 
New in Isabelle2007 (November 2007) 
276 
 

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

277 

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

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

279 

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

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

22826  284 

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

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

286 
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

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

288 

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

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

290 
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

291 
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

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

293 

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

296 
quotes. 

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

297 

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

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

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

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

301 
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

302 
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

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

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

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

306 
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

307 

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

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

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

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

312 
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

313 
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

314 

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

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

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

319 

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

321 
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

322 
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

323 
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

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

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

326 

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

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

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

331 
ambiguities introduced later on. INCOMPATIBILITY: constants in parse 

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

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

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

335 

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

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

337 
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

338 
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

339 
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

340 
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

341 
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

342 
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

343 

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

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

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

346 
support a specific search form (see ProofGeneral/CHANGES). 
22965  347 

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

350 
suppressed from proof state output. Note that the ProofGeneral 

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

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

353 
limit is imposed. 

354 

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

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

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

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

358 
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

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

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

361 

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

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

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

364 

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

365 

17865  366 
*** Document preparation *** 
367 

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

370 
current context. 

21339  371 

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

17865  374 

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

21735  377 
arguments may be given on the LHS.) 
21717  378 

379 

17779  380 
*** Pure *** 
381 

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

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

386 
constants with qualified polymorphism (according to the class 

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

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

389 
between global polymorphic consts and internal locale representation. 

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

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

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

396 

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

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

399 
writing SML code to a file: 
25199  400 
export_code <list of constants (term syntax)> in SML <filename> 
22735  401 
writing OCaml code to a file: 
25199  402 
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

403 
writing Haskell code to a bunch of files: 
25199  404 
export_code <list of constants (term syntax)> in Haskell <filename> 
405 

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

25184  407 
method ``eval'' 
408 

409 
Reasonable default setup of framework in HOL. 

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

410 

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

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

412 

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

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

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

417 

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

419 

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

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

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

422 

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

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

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

425 

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

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

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

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

429 

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

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

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

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

433 

25199  434 
code_instance and code_class only are effective to target Haskell. 
22735  435 

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

24800  438 
generation from Isabelle/HOL theories is available via "isatool doc 
439 
codegen". 

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

440 

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

443 
annotations). 

444 

19254  445 
* Command 'no_translations' removes translation rules from theory 
446 
syntax. 

447 

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

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

451 
correspondence to type class and instance declarations. 

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

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

19711  454 

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

456 
instantiation that matches an instance against the most general 

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

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

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

460 
recursion over such type arguments. Incomplete specification patterns 

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

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

465 

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

468 
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

469 
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

470 
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

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

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

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

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

475 
toplevel undo/redo and fail to work with multithreading. 
24086  476 

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

477 
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

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

479 

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

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

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

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

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

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

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

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

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

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

489 

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

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

494 
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

495 
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

496 
order. 
24086  497 

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

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

501 
difference of the original declaration context wrt. the application 

502 
context encountered later on. 

503 

504 
* Isar: proper interfaces for simplification procedures. Command 

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

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

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

508 

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

510 
abbreviates a theorem reference involving an internal dummy fact, 

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

512 
the background context will persist. This form of inplace 

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

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

515 

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

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

517 
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

518 
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

519 
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

520 
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

521 
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

522 
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

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

524 

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

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

526 
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

527 
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

528 
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

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

530 

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

533 

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

535 
then guess x and y by clarify 

536 

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

538 
proof tools being involved here. 

539 

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

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

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

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

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

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

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

548 

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

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

18020  552 

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

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

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

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

557 

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

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

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

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

561 

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

564 

18308  565 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
566 

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

568 

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

571 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  572 
'unfolded' attribute may be replaced by firstclass proof text. 
573 

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

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

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

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

577 
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

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

579 

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

582 

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

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

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

588 
originally first one. 

19220  589 

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

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

591 
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

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

593 

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

596 
(essentially a disjunction of cases with local parameters and 

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

18910  598 
adequately; in this notation common elimination rules look like this: 
18901  599 

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

601 
assumes "EX x. P x" 

602 
obtains x where "P x" 

603 

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

605 
assumes "A & B" 

606 
obtains A and B 

607 

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

609 
assumes "A  B" 

610 
obtains 

611 
A 

612 
 B 

613 

18910  614 
The subsequent classical rules even refer to the formal "thesis" 
18901  615 
explicitly: 
616 

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

618 
obtains "~ thesis" 

619 

18910  620 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
621 
obtains "thesis ==> something" 

18901  622 

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

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

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

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

628 
case_names). 

18901  629 

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

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

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

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

633 
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

634 

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

637 
toplevel lemma. 

638 

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

641 

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

644 
to occur. 

645 

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

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

647 
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

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

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

650 

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

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

652 
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

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

654 

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

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

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

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

660 
current context. 

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

661 

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

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

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

666 

19665  667 
axiomatization 
21595  668 
eq (infix "===" 50) where 
669 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

670 

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

672 
definition g where "g x = f x x" 

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

673 

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

677 

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

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

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

19088  682 
parameters implicit and using the original short name. See also 
25177  683 
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic 
19083  684 
entities from a monomorphic theory. 
685 

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

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

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

690 
prevents folding of abbreviations in term output. 
19084  691 

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

692 
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

693 
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

694 
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

695 
'translations' with explicit "CONST" markup to accommodate this. 
19665  696 

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

699 
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

700 

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

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

702 

24738  703 
inductive conj for A B 
704 
where "A ==> B ==> conj A B" 

705 

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

708 
abbreviations on output. 

709 

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

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

713 
endomorphisms as locale endom = homom mult mult h. 

19783  714 

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

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

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

719 
predicates, goals repesenting already interpreted fragments are not 

720 
removed automatically. Use methods `intro_locales' and 

721 
`unfold_locales'; see below. 

722 

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

724 
provide backward reasoning on locales predicates. The methods are 

725 
aware of interpretations and discharge corresponding goals. 

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

727 
unfold predicates to assumptions. 

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

728 

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

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

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

732 

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

735 
unfolded in interpreted theorems. This is useful for replacing 

736 
defined concepts (constants depending on locale parameters) by 

737 
concepts already existing in the target context. Example: 

738 

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

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

741 

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

744 
partial_order. 

745 

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

749 
(using objectlogic connectives for this purpose has been long 

750 
obsolete anyway). Common proof patterns are explained in 

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

753 
examples. 

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

754 

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

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

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

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

760 

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

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

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

766 

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

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

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

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

771 

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

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

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

774 

24859  775 
* Method "coinduct": dual of induction, see 
18399  776 
src/HOL/Library/Coinductive_List.thy for various examples. 
777 

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

780 

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

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

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

783 

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

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

787 
trace indicates where parts have been suppressed. 

18674  788 

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

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

790 
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

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

792 

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

795 
least one premise. 

796 

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

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

801 

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

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

803 
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

804 
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

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

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

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

808 

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

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

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

811 
for example "A > B" => "Pi A (%_. B)". 
17779  812 

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

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

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

815 

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

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

818 

17865  819 

17806  820 
*** HOL *** 
821 

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

824 
Examples are in the directory MetisExamples. WARNING: the 

825 
Isabelle/HOLMetis integration does not yet work properly with 

826 
multithreading. 

827 

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

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

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

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

832 
work with multithreading. 

833 

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

836 
auto_quickcheck (default true) and auto_quickcheck_time_limit (default 

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

24804  839 

25184  840 
* New constant "undefined" with axiom "undefined x = undefined". 
841 

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

843 
equality. 

844 

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

846 
the new 'class' package: 

847 

848 
HOL.abs ~> HOL.abs_class.abs 

849 
HOL.divide ~> HOL.divide_class.divide 

850 
0 ~> HOL.zero_class.zero 

851 
1 ~> HOL.one_class.one 

852 
op + ~> HOL.plus_class.plus 

853 
op  ~> HOL.minus_class.minus 

854 
uminus ~> HOL.minus_class.uminus 

855 
op * ~> HOL.times_class.times 

856 
op < ~> HOL.ord_class.less 

857 
op <= > HOL.ord_class.less_eq 

858 
Nat.power ~> Power.power_class.power 

859 
Nat.size ~> Nat.size_class.size 

860 
Numeral.number_of ~> Numeral.number_class.number_of 

861 
FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf 

862 
FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup 

863 
Orderings.min ~> Orderings.ord_class.min 

864 
Orderings.max ~> Orderings.ord_class.max 

865 
Divides.op div ~> Divides.div_class.div 

866 
Divides.op mod ~> Divides.div_class.mod 

867 
Divides.op dvd ~> Divides.div_class.dvd 

868 

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

870 

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

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

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

874 
names. 

875 

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

877 
INCOMPATIBILITY: use more specific names. 

878 

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

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

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

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

883 
distribution). INCOMPATIBILITY: rewrite proofs 

884 

885 
d) ML code directly refering to constant names 

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

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

888 
Consider using @{const_name} antiquotation. 

889 

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

891 

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

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

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

895 
sgn_div_norm; ordered_idom now also inherits from sgn_if. 

896 
INCOMPATIBILITY. 

897 

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

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

900 

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

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

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

904 

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

906 
changed order of proof goals in instance proofs. 

907 

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

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

910 
in all contexts importing or interpreting the corresponding locales. 

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

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

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

914 
in the current context. 

915 

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

917 
lemmas max_of_mono and min_of_mono with this predicate. 

918 
INCOMPATIBILITY. 

919 

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

921 
with new class dense_linear_order. 

922 

923 
* Uniform lattice theory development in HOL. 

924 

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

926 
constant "Meet" now named "Inf" 

927 

928 
classes "meet_semilorder" and "join_semilorder" now named 

929 
"lower_semilattice" and "upper_semilattice" 

930 
class "lorder" now named "lattice" 

931 
class "comp_lat" now named "complete_lattice" 

932 

933 
Instantiation of lattice classes allows explicit definitions 

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

935 

936 
INCOMPATIBILITY. Theorem renames: 

937 

938 
meet_left_le ~> inf_le1 

939 
meet_right_le ~> inf_le2 

940 
join_left_le ~> sup_ge1 

941 
join_right_le ~> sup_ge2 

942 
meet_join_le ~> inf_sup_ord 

943 
le_meetI ~> le_infI 

944 
join_leI ~> le_supI 

945 
le_meet ~> le_inf_iff 

946 
le_join ~> ge_sup_conv 

947 
meet_idempotent ~> inf_idem 

948 
join_idempotent ~> sup_idem 

949 
meet_comm ~> inf_commute 

950 
join_comm ~> sup_commute 

951 
meet_leI1 ~> le_infI1 

952 
meet_leI2 ~> le_infI2 

953 
le_joinI1 ~> le_supI1 

954 
le_joinI2 ~> le_supI2 

955 
meet_assoc ~> inf_assoc 

956 
join_assoc ~> sup_assoc 

957 
meet_left_comm ~> inf_left_commute 

958 
meet_left_idempotent ~> inf_left_idem 

959 
join_left_comm ~> sup_left_commute 

960 
join_left_idempotent ~> sup_left_idem 

961 
meet_aci ~> inf_aci 

962 
join_aci ~> sup_aci 

963 
le_def_meet ~> le_iff_inf 

964 
le_def_join ~> le_iff_sup 

965 
join_absorp2 ~> sup_absorb2 

966 
join_absorp1 ~> sup_absorb1 

967 
meet_absorp1 ~> inf_absorb1 

968 
meet_absorp2 ~> inf_absorb2 

969 
meet_join_absorp ~> inf_sup_absorb 

970 
join_meet_absorp ~> sup_inf_absorb 

971 
distrib_join_le ~> distrib_sup_le 

972 
distrib_meet_le ~> distrib_inf_le 

973 

974 
add_meet_distrib_left ~> add_inf_distrib_left 

975 
add_join_distrib_left ~> add_sup_distrib_left 

976 
is_join_neg_meet ~> is_join_neg_inf 

977 
is_meet_neg_join ~> is_meet_neg_sup 

978 
add_meet_distrib_right ~> add_inf_distrib_right 

979 
add_join_distrib_right ~> add_sup_distrib_right 

980 
add_meet_join_distribs ~> add_sup_inf_distribs 

981 
join_eq_neg_meet ~> sup_eq_neg_inf 

982 
meet_eq_neg_join ~> inf_eq_neg_sup 

983 
add_eq_meet_join ~> add_eq_inf_sup 

984 
meet_0_imp_0 ~> inf_0_imp_0 

985 
join_0_imp_0 ~> sup_0_imp_0 

986 
meet_0_eq_0 ~> inf_0_eq_0 

987 
join_0_eq_0 ~> sup_0_eq_0 

988 
neg_meet_eq_join ~> neg_inf_eq_sup 

989 
neg_join_eq_meet ~> neg_sup_eq_inf 

990 
join_eq_if ~> sup_eq_if 

991 

992 
mono_meet ~> mono_inf 

993 
mono_join ~> mono_sup 

994 
meet_bool_eq ~> inf_bool_eq 

995 
join_bool_eq ~> sup_bool_eq 

996 
meet_fun_eq ~> inf_fun_eq 

997 
join_fun_eq ~> sup_fun_eq 

998 
meet_set_eq ~> inf_set_eq 

999 
join_set_eq ~> sup_set_eq 

1000 
meet1_iff ~> inf1_iff 

1001 
meet2_iff ~> inf2_iff 

1002 
meet1I ~> inf1I 

1003 
meet2I ~> inf2I 

1004 
meet1D1 ~> inf1D1 

1005 
meet2D1 ~> inf2D1 

1006 
meet1D2 ~> inf1D2 

1007 
meet2D2 ~> inf2D2 

1008 
meet1E ~> inf1E 

1009 
meet2E ~> inf2E 

1010 
join1_iff ~> sup1_iff 

1011 
join2_iff ~> sup2_iff 

1012 
join1I1 ~> sup1I1 

1013 
join2I1 ~> sup2I1 

1014 
join1I1 ~> sup1I1 

1015 
join2I2 ~> sup1I2 

1016 
join1CI ~> sup1CI 

1017 
join2CI ~> sup2CI 

1018 
join1E ~> sup1E 

1019 
join2E ~> sup2E 

1020 

1021 
is_meet_Meet ~> is_meet_Inf 

1022 
Meet_bool_def ~> Inf_bool_def 

1023 
Meet_fun_def ~> Inf_fun_def 

1024 
Meet_greatest ~> Inf_greatest 

1025 
Meet_lower ~> Inf_lower 

1026 
Meet_set_def ~> Inf_set_def 

1027 

1028 
Sup_def ~> Sup_Inf 

1029 
Sup_bool_eq ~> Sup_bool_def 

1030 
Sup_fun_eq ~> Sup_fun_def 

1031 
Sup_set_eq ~> Sup_set_def 

1032 

1033 
listsp_meetI ~> listsp_infI 

1034 
listsp_meet_eq ~> listsp_inf_eq 

1035 

1036 
meet_min ~> inf_min 

1037 
join_max ~> sup_max 

1038 

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

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

1041 

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

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

25184  1045 
"*.size". 
1046 

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

1048 
INCOMPATIBILITY. 

24800  1049 

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

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

1052 
fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY. 

1053 

25129  1054 
* HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY. 
1055 

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

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

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

1060 
lemmas on overflow and monotonicity. Instantiated to all appropriate 

1061 
arithmetic type classes, supporting automatic simplification of 

1062 
numerals on all operations. 

24333  1063 

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

1065 

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

1067 

23850  1068 
* Code generator library theories: 
24993  1069 
 Code_Integer represents HOL integers by big integer literals in target 
23850  1070 
languages. 
24993  1071 
 Code_Char represents HOL characters by character literals in target 
23850  1072 
languages. 
24993  1073 
 Code_Char_chr like Code_Char, but also offers treatment of character 
1074 
codes; includes Code_Integer. 

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

23850  1077 
denominator). 
24800  1078 
 Executable_Real implements a subset of real numbers, namly those 
23850  1079 
representable by rational numbers. 
24800  1080 
 Efficient_Nat implements natural numbers by integers, which in general will 
23850  1081 
result in higher efficency; pattern matching with 0/Suc is eliminated; 
24993  1082 
includes Code_Integer. 
1083 
 Code_Index provides an additional datatype index which is mapped to 

1084 
targetlanguage builtin integers. 

26355  1085 
 Code_Message provides an additional datatype message_string which is isomorphic to 
24993  1086 
strings; messages are mapped to targetlanguage strings. 
23850  1087 

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

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

1089 

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

1090 
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

1091 

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

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

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

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

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

1096 
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

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

1098 

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

1100 

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

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

1102 

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

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

1104 
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

1105 

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

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

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

1108 
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

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

1110 

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

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

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

1113 

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

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

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

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

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

1118 
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

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

1120 

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

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

1122 

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

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

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

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

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

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

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

1129 
 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

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

1131 

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

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

1133 

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

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

1136 

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

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

1138 

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

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

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

1143 
than before the actual inductive definition. 

1144 

1145 
 The variables in induction and elimination rules are now 

1146 
quantified in the order of their occurrence in the introduction 

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

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

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

1150 
statements of the form 

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

1151 

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

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

1153 

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

1154 
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

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

1156 

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

1157 
 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

1158 

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

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

1160 

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

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

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

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

1164 

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

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

1166 

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

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

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

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

1170 

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

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

1172 

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

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

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

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

1176 

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

1179 
rule) before the above elimination rule is applicable. 

1180 

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

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

1183 
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

1184 

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

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

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

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

1190 
users are encouraged to use the new package. 

1191 

1192 
* Method "lexicographic_order" automatically synthesizes termination 

1193 
relations as lexicographic combinations of size measures. 

1194 

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

1197 
programming. Internally, this is translated into nested 

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

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

1200 
the original input but the internal form. Lambdaabstractions allow 

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

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

1203 
variable. 

23564  1204 

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

1208 
previously. Potential INCOMPATIBILITY: 

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

23377  1211 

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

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

1215 
a specific type involves instantiating the locale and possibly adding 

1216 
declarations for computation on the coefficients. The method is 

1217 
already instantiated for natural numbers and for the axiomatic class 

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

1219 
CALCULEMUS 2007 for the general principles underlying this 

1220 
architecture of contextaware prooftools. 

1221 

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

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

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

1226 
rat, etc. 

1227 

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

1230 
circumvent possible incompatibilities when working on ML level. 

1231 

24996  1232 
* primrec: missing cases mapped to "undefined" instead of "arbitrary". 
22845  1233 

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

1236 

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

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

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

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

1242 
comprehension syntax, and for uniformity. INCOMPATIBILITY. 

1243 

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

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

1246 
INCOMPATIBILITY. 

1247 

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

1249 

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

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

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

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

1255 
positive/negative (in inequations). 

23480  1256 

1257 
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib 

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

1260 
because they were subsumed by lemmas xyz. INCOMPATIBILITY. 

1261 

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

22735  1265 

24800  1266 
* Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq. 
22218  1267 
INCOMPATIBILITY. 
1268 

24800  1269 
* Dropped redundant lemma if_def2 in favor of if_bool_eq_conj. 
22218  1270 
INCOMPATIBILITY. 
1271 

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

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

1275 
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

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

1277 

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

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

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

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

1283 

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

1285 
commutative semirings. INCOMPATIBILITY: may need to incorporate 

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

1287 

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

1291 

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

1293 

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

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

1301 
 ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. 

1302 

25177  1303 
See src/HOL/Integ/IntArith.thy for an example setup. 
1304 

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

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

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

1308 
heavyduty computations because the functions are compiled to ML 

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

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

19895  1311 

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

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

1315 

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

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

21265  1320 

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

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

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

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

1325 

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

19377  1328 

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

1332 

1333 
* Simplifier: "m dvd n" where m and n are numbers is evaluated to 

1334 
True/False. 

1335 

1336 
* Theorem Cons_eq_map_conv no longer declared as "simp". 

19211  1337 

19279  1338 
* Theorem setsum_mult renamed to setsum_right_distrib. 
1339 

19211  1340 
* Prefer ex1I over ex_ex1I in singlestep reasoning, e.g. by the 
22126  1341 
``rule'' method. 
1342 

24800  1343 
* Reimplemented methods "sat" and "satx", with several improvements: 
1344 
goals no longer need to be stated as "<prems> ==> False", equivalences 

1345 
(i.e. "=" on type bool) are handled, variable names of the form 

1346 
"lit_<n>" are no longer reserved, significant speedup. 

1347 

1348 
* Methods "sat" and "satx" can now replay MiniSat proof traces. 

22126  1349 
zChaff is still supported as well. 
1350 

1351 
* 'inductive' and 'datatype': provide projections of mutual rules, 

1352 
bundled as foo_bar.inducts; 

1353 

1354 
* Library: moved theories Parity, GCD, Binomial, Infinite_Set to 

1355 
Library. 

21256  1356 

1357 
* Library: moved theory Accessible_Part to main HOL. 

19572
a4b3176f19dd
* Library: theory Accessible_Part has been move to main HOL.
wenzelm
parents:
19508
diff
changeset

1358 

18446  1359 
* Library: added theory Coinductive_List of potentially infinite lists 
1360 
as greatest fixedpoint. 

18399  1361 

19254  1362 
* Library: added theory AssocList which implements (finite) maps as 
19252  1363 
association lists. 
17809
195045659c06
Tactics sat and satx reimplemented, several improvements
webertj
parents:
17806
diff
changeset

1364 

24800  1365 
* Method "evaluation" solves goals (i.e. a boolean expression) 
1366 
efficiently by compiling it to ML. The goal is "proved" (via an 

1367 
oracle) if it evaluates to True. 

20807  1368 

1369 
* Linear arithmetic now splits certain operators (e.g. min, max, abs) 

24800  1370 
also when invoked by the simplifier. This results in the Simplifier 
1371 
being more powerful on arithmetic goals. INCOMPATIBILITY. 

1372 
Configuration option fast_arith_split_limit=0 recovers the old 

1373 
behavior. 

20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
20188
diff
changeset

1374 

22126  1375 
* Support for hex (0x20) and binary (0b1001) numerals. 
19254  1376 

20807  1377 
* New method: reify eqs (t), where eqs are equations for an 
1378 
interpretation I :: 'a list => 'b => 'c and t::'c is an optional 

1379 
parameter, computes a term s::'b and a list xs::'a list and proves the 

1380 
theorem I xs s = t. This is also known as reification or quoting. The 

1381 
resulting theorem is applied to the subgoal to substitute t with I xs 

1382 
s. If t is omitted, the subgoal itself is reified. 

1383 

1384 
* New method: reflection corr_thm eqs (t). The parameters eqs and (t) 

1385 
are as explained above. corr_thm is a theorem for I vs (f t) = I vs t, 

1386 
where f is supposed to be a computable function (in the sense of code 

1387 
generattion). The method uses reify to compute s and xs as above then 

1388 
applies corr_thm and uses normalization by evaluation to "prove" f s = 

1389 
r and finally gets the theorem t = r, which is again applied to the 

25177  1390 
subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy. 
1391 

1392 
* Reflection: Automatic reification now handels binding, an example is 

1393 
available in src/HOL/ex/ReflectionEx.thy 

20807  1394 

25397  1395 
* HOLStatespace: ``State Spaces: The Locale Way'' introduces a 
25409  1396 
command 'statespace' that is similar to 'record', but introduces an 
25397  1397 
abstract specification based on the locale infrastructure instead of 
1398 
HOL types. This leads to extra flexibility in composing state spaces, 

1399 
in particular multiple inheritance and renaming of components. 

1400 

1401 

19653  1402 
*** HOLComplex *** 
1403 

22971  1404 
* Hyperreal: Functions root and sqrt are now defined on negative real 
1405 
inputs so that root n ( x) =  root n x and sqrt ( x) =  sqrt x. 

1406 
Nonnegativity side conditions have been removed from many lemmas, so 