author  wenzelm 
Tue, 08 Apr 2008 15:47:05 +0200  
changeset 26575  042617a1c86c 
parent 26562  9d25ef112cf6 
child 26650  f131f0fbf9cd 
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 

25522  29 

25502  30 
*** Pure *** 
31 

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

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

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

34 
update of theories within ML code. 
26479  35 

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

39 
INCOMPATIBILITY. 

40 

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

41 
* Eliminated theory ProtoPure. Potential INCOMPATIBILITY. 
d5883907c514
HOL (and FOL): renamed variables in rules imp_elim and swap;
wenzelm
parents:
26401
diff
changeset

42 

26434  43 
* Command 'setup': discontinued implicit version. 
44 

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

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

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

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

48 
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

49 
HOL/Library/Eval.thy for an ML example. 
25502  50 

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

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

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

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

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

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

56 

25502  57 

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

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

59 

26513  60 
* Explicit class "eq" for executable equality. INCOMPATIBILITY. 
61 

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

64 

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

66 
INCOMPATIBILITY. 

67 

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

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

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

70 

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

73 
to apsnd. INCOMPATIBILITY. 

74 

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

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

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

77 

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

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

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

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

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

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

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

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

85 

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

86 
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

87 
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

88 
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

89 

26231  90 
* Library/Option_ord.thy: Canonical order on option type. 
91 

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

94 

26231  95 
* Library/Countable.thy: Type class for countable types. 
96 

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

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

98 
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

99 
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

100 
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

101 
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

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

103 

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

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

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

106 
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

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

108 

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

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

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

111 
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

112 
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

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

115 

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

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

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

118 

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

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

120 
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

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

122 

25961  123 
* Theorems "power.simps" renamed to "power_int.simps". 
124 

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

125 
* Class semiring_div provides basic abstract properties of semirings 
25942  126 
with division and modulo operations. Subsumes former class dvd_mod. 
127 

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

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

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

130 

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

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

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

133 

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

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

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

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

137 

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

139 
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

140 
"primrec" command distinguishes oldstyle and newstyle specifications 
25599  141 
by syntax. The former primrec package is now named OldPrimrecPackage. 
26355  142 
When adjusting theories, beware: constants stemming from newstyle 
25609  143 
primrec specifications have authentic syntax. 
25557  144 

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

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

147 
* Library/ListVector: new theory of arithmetic vector operations. 
25900  148 

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

151 
on sets and on types. 

152 

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

154 
syntax. INCOMPATIBILITY. 
25522  155 

156 
* Definitions subset_def, psubset_def, set_diff_def, Compl_def, 

157 
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def, 

158 
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def, 

159 
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def, 

160 
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

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

162 

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

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

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

167 
for examples, 

168 

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

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

172 

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

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

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

175 

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

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

177 

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

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

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

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

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

182 

26197  183 
*** ZF *** 
184 

185 
* Renamed theories: 

186 

187 
Datatype.thy > Datatype_ZF.thy 

188 
Inductive.thy > Inductive_ZF.thy 

189 
Int.thy > Int_ZF.thy 

190 
IntDiv.thy > IntDiv_ZF.thy 

191 
Nat.thy > Nat_ZF.thy 

192 
List.thy > List_ZF.thy 

193 
Main.thy > Main_ZF.thy 

194 

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

196 

197 
INCOMPATIBILITY: ZF theories that import individual theories below 

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

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

200 
imported "Main", no changes are needed. 

201 

202 

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

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

204 

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

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

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

207 

26387  208 
* Removed obsolete "use_legacy_bindings" function. INCOMPATIBILITY. 
209 

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

212 

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

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

214 
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

215 
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

216 
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

217 
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

218 

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

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

220 
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

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

222 

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

223 

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

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

225 

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

228 
isatool yxml as described in the Isabelle system manual. 

229 

230 
* Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented 

231 
way of changing the user's settings is via 

26218  232 
ISABELLE_HOME_USER/etc/settings, which is a fully featured bash 
233 
script. 

234 

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

237 

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

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

239 
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

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

243 

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

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

245 
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

246 
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

247 

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

250 

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

252 
Isabelle from flooding interactive frontends (notably ProofGeneral / 

253 
XEmacs). 

254 

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

258 

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

261 

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

262 

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

263 

25429  264 
New in Isabelle2007 (November 2007) 
265 
 

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

266 

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

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

268 

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

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

22826  273 

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

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

275 
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

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

277 

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

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

279 
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

280 
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

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

282 

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

285 
quotes. 

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

286 

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

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

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

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

290 
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

291 
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

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

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

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

295 
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

296 

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

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

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

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

301 
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

302 
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

303 

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

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

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

308 

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

310 
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

311 
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

312 
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

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

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

315 

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

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

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

320 
ambiguities introduced later on. INCOMPATIBILITY: constants in parse 

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

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

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

324 

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

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

326 
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

327 
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

328 
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

329 
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

330 
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

331 
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

332 

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

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

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

335 
support a specific search form (see ProofGeneral/CHANGES). 
22965  336 

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

339 
suppressed from proof state output. Note that the ProofGeneral 

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

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

342 
limit is imposed. 

343 

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

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

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

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

347 
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

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

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

350 

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

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

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

353 

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

354 

17865  355 
*** Document preparation *** 
356 

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

359 
current context. 

21339  360 

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

17865  363 

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

21735  366 
arguments may be given on the LHS.) 
21717  367 

368 

17779  369 
*** Pure *** 
370 

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

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

375 
constants with qualified polymorphism (according to the class 

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

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

378 
between global polymorphic consts and internal locale representation. 

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

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

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

385 

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

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

388 
writing SML code to a file: 
25199  389 
export_code <list of constants (term syntax)> in SML <filename> 
22735  390 
writing OCaml code to a file: 
25199  391 
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

392 
writing Haskell code to a bunch of files: 
25199  393 
export_code <list of constants (term syntax)> in Haskell <filename> 
394 

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

25184  396 
method ``eval'' 
397 

398 
Reasonable default setup of framework in HOL. 

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

399 

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

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

401 

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

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

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

406 

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

408 

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

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

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

411 

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

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

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

414 

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

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

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

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

418 

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

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

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

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

422 

25199  423 
code_instance and code_class only are effective to target Haskell. 
22735  424 

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

24800  427 
generation from Isabelle/HOL theories is available via "isatool doc 
428 
codegen". 

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

429 

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

432 
annotations). 

433 

19254  434 
* Command 'no_translations' removes translation rules from theory 
435 
syntax. 

436 

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

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

440 
correspondence to type class and instance declarations. 

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

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

19711  443 

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

445 
instantiation that matches an instance against the most general 

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

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

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

449 
recursion over such type arguments. Incomplete specification patterns 

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

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

454 

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

457 
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

458 
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

459 
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

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

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

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

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

464 
toplevel undo/redo and fail to work with multithreading. 
24086  465 

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

466 
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

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

468 

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

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

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

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

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

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

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

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

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

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

478 

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

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

483 
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

484 
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

485 
order. 
24086  486 

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

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

490 
difference of the original declaration context wrt. the application 

491 
context encountered later on. 

492 

493 
* Isar: proper interfaces for simplification procedures. Command 

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

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

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

497 

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

499 
abbreviates a theorem reference involving an internal dummy fact, 

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

501 
the background context will persist. This form of inplace 

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

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

504 

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

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

506 
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

507 
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

508 
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

509 
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

510 
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

511 
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

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

513 

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

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

515 
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

516 
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

517 
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

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

519 

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

522 

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

524 
then guess x and y by clarify 

525 

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

527 
proof tools being involved here. 

528 

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

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

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

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

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

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

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

537 

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

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

18020  541 

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

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

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

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

546 

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

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

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

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

550 

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

553 

18308  554 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
555 

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

557 

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

560 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  561 
'unfolded' attribute may be replaced by firstclass proof text. 
562 

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

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

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

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

566 
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

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

568 

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

571 

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

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

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

577 
originally first one. 

19220  578 

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

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

580 
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

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

582 

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

585 
(essentially a disjunction of cases with local parameters and 

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

18910  587 
adequately; in this notation common elimination rules look like this: 
18901  588 

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

590 
assumes "EX x. P x" 

591 
obtains x where "P x" 

592 

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

594 
assumes "A & B" 

595 
obtains A and B 

596 

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

598 
assumes "A  B" 

599 
obtains 

600 
A 

601 
 B 

602 

18910  603 
The subsequent classical rules even refer to the formal "thesis" 
18901  604 
explicitly: 
605 

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

607 
obtains "~ thesis" 

608 

18910  609 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
610 
obtains "thesis ==> something" 

18901  611 

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

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

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

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

617 
case_names). 

18901  618 

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

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

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

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

622 
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

623 

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

626 
toplevel lemma. 

627 

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

630 

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

633 
to occur. 

634 

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

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

636 
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

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

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

639 

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

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

641 
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

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

643 

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

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

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

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

649 
current context. 

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

650 

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

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

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

655 

19665  656 
axiomatization 
21595  657 
eq (infix "===" 50) where 
658 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

659 

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

661 
definition g where "g x = f x x" 

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

662 

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

666 

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

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

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

19088  671 
parameters implicit and using the original short name. See also 
25177  672 
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic 
19083  673 
entities from a monomorphic theory. 
674 

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

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

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

679 
prevents folding of abbreviations in term output. 
19084  680 

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

681 
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

682 
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

683 
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

684 
'translations' with explicit "CONST" markup to accommodate this. 
19665  685 

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

688 
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

689 

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

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

691 

24738  692 
inductive conj for A B 
693 
where "A ==> B ==> conj A B" 

694 

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

697 
abbreviations on output. 

698 

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

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

702 
endomorphisms as locale endom = homom mult mult h. 

19783  703 

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

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

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

708 
predicates, goals repesenting already interpreted fragments are not 

709 
removed automatically. Use methods `intro_locales' and 

710 
`unfold_locales'; see below. 

711 

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

713 
provide backward reasoning on locales predicates. The methods are 

714 
aware of interpretations and discharge corresponding goals. 

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

716 
unfold predicates to assumptions. 

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

717 

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

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

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

721 

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

724 
unfolded in interpreted theorems. This is useful for replacing 

725 
defined concepts (constants depending on locale parameters) by 

726 
concepts already existing in the target context. Example: 

727 

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

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

730 

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

733 
partial_order. 

734 

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

738 
(using objectlogic connectives for this purpose has been long 

739 
obsolete anyway). Common proof patterns are explained in 

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

742 
examples. 

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

743 

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

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

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

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

749 

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

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

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

755 

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

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

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

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

760 

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

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

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

763 

24859  764 
* Method "coinduct": dual of induction, see 
18399  765 
src/HOL/Library/Coinductive_List.thy for various examples. 
766 

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

769 

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

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

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

772 

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

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

776 
trace indicates where parts have been suppressed. 

18674  777 

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

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

779 
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

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

781 

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

784 
least one premise. 

785 

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

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

790 

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

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

792 
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

793 
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

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

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

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

797 

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

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

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

800 
for example "A > B" => "Pi A (%_. B)". 
17779  801 

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

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

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

804 

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

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

807 

17865  808 

17806  809 
*** HOL *** 
810 

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

813 
Examples are in the directory MetisExamples. WARNING: the 

814 
Isabelle/HOLMetis integration does not yet work properly with 

815 
multithreading. 

816 

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

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

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

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

821 
work with multithreading. 

822 

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

825 
auto_quickcheck (default true) and auto_quickcheck_time_limit (default 

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

24804  828 

25184  829 
* New constant "undefined" with axiom "undefined x = undefined". 
830 

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

832 
equality. 

833 

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

835 
the new 'class' package: 

836 

837 
HOL.abs ~> HOL.abs_class.abs 

838 
HOL.divide ~> HOL.divide_class.divide 

839 
0 ~> HOL.zero_class.zero 

840 
1 ~> HOL.one_class.one 

841 
op + ~> HOL.plus_class.plus 

842 
op  ~> HOL.minus_class.minus 

843 
uminus ~> HOL.minus_class.uminus 

844 
op * ~> HOL.times_class.times 

845 
op < ~> HOL.ord_class.less 

846 
op <= > HOL.ord_class.less_eq 

847 
Nat.power ~> Power.power_class.power 

848 
Nat.size ~> Nat.size_class.size 

849 
Numeral.number_of ~> Numeral.number_class.number_of 

850 
FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf 

851 
FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup 

852 
Orderings.min ~> Orderings.ord_class.min 

853 
Orderings.max ~> Orderings.ord_class.max 

854 
Divides.op div ~> Divides.div_class.div 

855 
Divides.op mod ~> Divides.div_class.mod 

856 
Divides.op dvd ~> Divides.div_class.dvd 

857 

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

859 

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

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

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

863 
names. 

864 

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

866 
INCOMPATIBILITY: use more specific names. 

867 

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

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

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

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

872 
distribution). INCOMPATIBILITY: rewrite proofs 

873 

874 
d) ML code directly refering to constant names 

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

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

877 
Consider using @{const_name} antiquotation. 

878 

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

880 

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

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

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

884 
sgn_div_norm; ordered_idom now also inherits from sgn_if. 

885 
INCOMPATIBILITY. 

886 

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

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

889 

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

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

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

893 

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

895 
changed order of proof goals in instance proofs. 

896 

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

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

899 
in all contexts importing or interpreting the corresponding locales. 

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

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

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

903 
in the current context. 

904 

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

906 
lemmas max_of_mono and min_of_mono with this predicate. 

907 
INCOMPATIBILITY. 

908 

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

910 
with new class dense_linear_order. 

911 

912 
* Uniform lattice theory development in HOL. 

913 

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

915 
constant "Meet" now named "Inf" 

916 

917 
classes "meet_semilorder" and "join_semilorder" now named 

918 
"lower_semilattice" and "upper_semilattice" 

919 
class "lorder" now named "lattice" 

920 
class "comp_lat" now named "complete_lattice" 

921 

922 
Instantiation of lattice classes allows explicit definitions 

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

924 

925 
INCOMPATIBILITY. Theorem renames: 

926 

927 
meet_left_le ~> inf_le1 

928 
meet_right_le ~> inf_le2 

929 
join_left_le ~> sup_ge1 

930 
join_right_le ~> sup_ge2 

931 
meet_join_le ~> inf_sup_ord 

932 
le_meetI ~> le_infI 

933 
join_leI ~> le_supI 

934 
le_meet ~> le_inf_iff 

935 
le_join ~> ge_sup_conv 

936 
meet_idempotent ~> inf_idem 

937 
join_idempotent ~> sup_idem 

938 
meet_comm ~> inf_commute 

939 
join_comm ~> sup_commute 

940 
meet_leI1 ~> le_infI1 

941 
meet_leI2 ~> le_infI2 

942 
le_joinI1 ~> le_supI1 

943 
le_joinI2 ~> le_supI2 

944 
meet_assoc ~> inf_assoc 

945 
join_assoc ~> sup_assoc 

946 
meet_left_comm ~> inf_left_commute 

947 
meet_left_idempotent ~> inf_left_idem 

948 
join_left_comm ~> sup_left_commute 

949 
join_left_idempotent ~> sup_left_idem 

950 
meet_aci ~> inf_aci 

951 
join_aci ~> sup_aci 

952 
le_def_meet ~> le_iff_inf 

953 
le_def_join ~> le_iff_sup 

954 
join_absorp2 ~> sup_absorb2 

955 
join_absorp1 ~> sup_absorb1 

956 
meet_absorp1 ~> inf_absorb1 

957 
meet_absorp2 ~> inf_absorb2 

958 
meet_join_absorp ~> inf_sup_absorb 

959 
join_meet_absorp ~> sup_inf_absorb 

960 
distrib_join_le ~> distrib_sup_le 

961 
distrib_meet_le ~> distrib_inf_le 

962 

963 
add_meet_distrib_left ~> add_inf_distrib_left 

964 
add_join_distrib_left ~> add_sup_distrib_left 

965 
is_join_neg_meet ~> is_join_neg_inf 

966 
is_meet_neg_join ~> is_meet_neg_sup 

967 
add_meet_distrib_right ~> add_inf_distrib_right 

968 
add_join_distrib_right ~> add_sup_distrib_right 

969 
add_meet_join_distribs ~> add_sup_inf_distribs 

970 
join_eq_neg_meet ~> sup_eq_neg_inf 

971 
meet_eq_neg_join ~> inf_eq_neg_sup 

972 
add_eq_meet_join ~> add_eq_inf_sup 

973 
meet_0_imp_0 ~> inf_0_imp_0 

974 
join_0_imp_0 ~> sup_0_imp_0 

975 
meet_0_eq_0 ~> inf_0_eq_0 

976 
join_0_eq_0 ~> sup_0_eq_0 

977 
neg_meet_eq_join ~> neg_inf_eq_sup 

978 
neg_join_eq_meet ~> neg_sup_eq_inf 

979 
join_eq_if ~> sup_eq_if 

980 

981 
mono_meet ~> mono_inf 

982 
mono_join ~> mono_sup 

983 
meet_bool_eq ~> inf_bool_eq 

984 
join_bool_eq ~> sup_bool_eq 

985 
meet_fun_eq ~> inf_fun_eq 

986 
join_fun_eq ~> sup_fun_eq 

987 
meet_set_eq ~> inf_set_eq 

988 
join_set_eq ~> sup_set_eq 

989 
meet1_iff ~> inf1_iff 

990 
meet2_iff ~> inf2_iff 

991 
meet1I ~> inf1I 

992 
meet2I ~> inf2I 

993 
meet1D1 ~> inf1D1 

994 
meet2D1 ~> inf2D1 

995 
meet1D2 ~> inf1D2 

996 
meet2D2 ~> inf2D2 

997 
meet1E ~> inf1E 

998 
meet2E ~> inf2E 

999 
join1_iff ~> sup1_iff 

1000 
join2_iff ~> sup2_iff 

1001 
join1I1 ~> sup1I1 

1002 
join2I1 ~> sup2I1 

1003 
join1I1 ~> sup1I1 

1004 
join2I2 ~> sup1I2 

1005 
join1CI ~> sup1CI 

1006 
join2CI ~> sup2CI 

1007 
join1E ~> sup1E 

1008 
join2E ~> sup2E 

1009 

1010 
is_meet_Meet ~> is_meet_Inf 

1011 
Meet_bool_def ~> Inf_bool_def 

1012 
Meet_fun_def ~> Inf_fun_def 

1013 
Meet_greatest ~> Inf_greatest 

1014 
Meet_lower ~> Inf_lower 

1015 
Meet_set_def ~> Inf_set_def 

1016 

1017 
Sup_def ~> Sup_Inf 

1018 
Sup_bool_eq ~> Sup_bool_def 

1019 
Sup_fun_eq ~> Sup_fun_def 

1020 
Sup_set_eq ~> Sup_set_def 

1021 

1022 
listsp_meetI ~> listsp_infI 

1023 
listsp_meet_eq ~> listsp_inf_eq 

1024 

1025 
meet_min ~> inf_min 

1026 
join_max ~> sup_max 

1027 

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

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

1030 

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

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

25184  1034 
"*.size". 
1035 

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

1037 
INCOMPATIBILITY. 

24800  1038 

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

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

1041 
fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY. 

1042 

25129  1043 
* HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY. 
1044 

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

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

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

1049 
lemmas on overflow and monotonicity. Instantiated to all appropriate 

1050 
arithmetic type classes, supporting automatic simplification of 

1051 
numerals on all operations. 

24333  1052 

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

1054 

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

1056 

23850  1057 
* Code generator library theories: 
24993  1058 
 Code_Integer represents HOL integers by big integer literals in target 
23850  1059 
languages. 
24993  1060 
 Code_Char represents HOL characters by character literals in target 
23850  1061 
languages. 
24993  1062 
 Code_Char_chr like Code_Char, but also offers treatment of character 
1063 
codes; includes Code_Integer. 

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

23850  1066 
denominator). 
24800  1067 
 Executable_Real implements a subset of real numbers, namly those 
23850  1068 
representable by rational numbers. 
24800  1069 
 Efficient_Nat implements natural numbers by integers, which in general will 
23850  1070 
result in higher efficency; pattern matching with 0/Suc is eliminated; 
24993  1071 
includes Code_Integer. 
1072 
 Code_Index provides an additional datatype index which is mapped to 

1073 
targetlanguage builtin integers. 

26355  1074 
 Code_Message provides an additional datatype message_string which is isomorphic to 
24993  1075 
strings; messages are mapped to targetlanguage strings. 
23850  1076 

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

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

1078 

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

1079 
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

1080 

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

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

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

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

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

1085 
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

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

1087 

24800  1088 
with full support for typeinference, rather than 
23783
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 
consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set" 
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 
abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1093 
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

1094 

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

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

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

1097 
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

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

1099 

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

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

1101 
sets to be defined with the new package via 
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 
inductive_set 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

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

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

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

1107 
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

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

1111 

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

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

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

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

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

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

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

1118 
 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

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 
if the additional syntax "p ..." is required. 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1122 

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

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

1125 

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

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

1127 

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

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

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

1132 
than before the actual inductive definition. 

1133 

1134 
 The variables in induction and elimination rules are now 

1135 
quantified in the order of their occurrence in the introduction 

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

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

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

1139 
statements of the form 

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

1140 

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

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

1142 

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

1143 
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

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

1145 

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

1146 
 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

1147 

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

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

1149 

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

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

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

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

1155 

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

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

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

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

1159 

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

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

1161 

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

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

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

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

1165 

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

1168 
rule) before the above elimination rule is applicable. 

1169 

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

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

1172 
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

1173 

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

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

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

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

1179 
users are encouraged to use the new package. 

1180 

1181 
* Method "lexicographic_order" automatically synthesizes termination 

1182 
relations as lexicographic combinations of size measures. 

1183 

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

1186 
programming. Internally, this is translated into nested 

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

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

1189 
the original input but the internal form. Lambdaabstractions allow 

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

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

1192 
variable. 

23564  1193 

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

1197 
previously. Potential INCOMPATIBILITY: 

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

23377  1200 

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

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

1204 
a specific type involves instantiating the locale and possibly adding 

1205 
declarations for computation on the coefficients. The method is 

1206 
already instantiated for natural numbers and for the axiomatic class 

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

1208 
CALCULEMUS 2007 for the general principles underlying this 

1209 
architecture of contextaware prooftools. 

1210 

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

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

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

1215 
rat, etc. 

1216 

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

1219 
circumvent possible incompatibilities when working on ML level. 

1220 

24996  1221 
* primrec: missing cases mapped to "undefined" instead of "arbitrary". 
22845  1222 

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

1225 

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

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

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

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

1231 
comprehension syntax, and for uniformity. INCOMPATIBILITY. 

1232 

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

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

1235 
INCOMPATIBILITY. 

1236 

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

1238 

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

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

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

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

1244 
positive/negative (in inequations). 

23480  1245 

1246 
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib 

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

1249 
because they were subsumed by lemmas xyz. INCOMPATIBILITY. 

1250 

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

22735  1254 

24800  1255 
* Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq. 
22218  1256 
INCOMPATIBILITY. 
1257 

24800  1258 
* Dropped redundant lemma if_def2 in favor of if_bool_eq_conj. 
22218  1259 
INCOMPATIBILITY. 
1260 

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

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

1264 
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

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

1266 

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

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

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

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

1272 

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

1274 
commutative semirings. INCOMPATIBILITY: may need to incorporate 

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

1276 

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

1280 

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

1282 

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

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

1290 
 ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. 

1291 

25177  1292 
See src/HOL/Integ/IntArith.thy for an example setup. 
1293 

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

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

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

1297 
heavyduty computations because the functions are compiled to ML 

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

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

19895  1300 

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

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

1304 

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

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

21265  1309 

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

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

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

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

1314 

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

19377  1317 

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

1321 

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

1323 
True/False. 

1324 

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

19211  1326 

19279  1327 
* Theorem setsum_mult renamed to setsum_right_distrib. 
1328 

19211  1329 
* Prefer ex1I over ex_ex1I in singlestep reasoning, e.g. by the 
22126  1330 
``rule'' method. 
1331 

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

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

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

1336 

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

22126  1338 
zChaff is still supported as well. 
1339 

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

1341 
bundled as foo_bar.inducts; 

1342 

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

1344 
Library. 

21256  1345 

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

1347 

18446  1348 
* Library: added theory Coinductive_List of potentially infinite lists 
1349 
as greatest fixedpoint. 

18399  1350 

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

1353 

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

1356 
oracle) if it evaluates to True. 

20807  1357 

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

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

1361 
Configuration option fast_arith_split_limit=0 recovers the old 

1362 
behavior. 

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

1363 

22126  1364 
* Support for hex (0x20) and binary (0b1001) numerals. 
19254  1365 

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

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

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

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

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

1372 

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

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

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

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

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

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

25177  1379 
subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy. 
1380 

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

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

20807  1383 

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

1388 
in particular multiple inheritance and renaming of components. 

1389 

1390 

19653  1391 
*** HOLComplex *** 
1392 

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

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

1396 
that more subgoals may now be solved by simplification; potential 

1397 
INCOMPATIBILITY. 

1398 

24800  1399 
* Real: new type classes formalize real normed vector spaces and 
21791  1400 
algebras, using new overloaded constants scaleR :: real => 'a => 'a 
1401 
and norm :: 'a => real. 

1402 

24800  1403 
* Real: constant of_real :: real => 'a::real_algebra_1 injects from 
1404 
reals into other types. The overloaded constant Reals :: 'a set is now 

1405 
defined as range of_real; potential INCOMPATIBILITY. 

1406 

1407 
* Real: proper support for ML code generation, including 'quickcheck'. 

23013  1408 
Reals are implemented as arbitrary precision rationals. 
1409 

22126  1410 
* Hyperreal: Several constants that previously worked only for the 
1411 
reals have been generalized, so they now work over arbitrary vector 

1412 
spaces. Type annotations may need to be added in some cases; potential 

1413 
INCOMPATIBILITY. 

21791  1414 

22972
3e96b98d37c6
generalized sgn function to work on any real normed vector space
huffman
parents:
22971
