author  wenzelm 
Thu, 27 Mar 2008 15:32:15 +0100  
changeset 26435  bdce320cd426 
parent 26434  d004b791218e 
child 26445  17223cf843d8 
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 

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

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

33 

26434  34 
* Command 'setup': discontinued implicit version. 
35 

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

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

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

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

39 
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

40 
HOL/Library/Eval.thy for an ML example. 
25502  41 

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

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

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

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

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

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

47 

25502  48 

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

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

50 

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

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

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

53 

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

56 
to apsnd. INCOMPATIBILITY. 

57 

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

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

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

60 

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

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

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

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

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

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

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

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

68 

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

69 
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

70 
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

71 
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

72 

26231  73 
* Library/Option_ord.thy: Canonical order on option type. 
74 

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

77 

26231  78 
* Library/Countable.thy: Type class for countable types. 
79 

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

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

81 
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

82 
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

83 
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

84 
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

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

86 

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

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

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

89 
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

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

91 

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

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

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

94 
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

95 
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

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

98 

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

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

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

101 

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

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

103 
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

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

105 

25961  106 
* Theorems "power.simps" renamed to "power_int.simps". 
107 

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

108 
* Class semiring_div provides basic abstract properties of semirings 
25942  109 
with division and modulo operations. Subsumes former class dvd_mod. 
110 

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

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

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

113 

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

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

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

116 

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

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

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

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

120 

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

122 
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

123 
"primrec" command distinguishes oldstyle and newstyle specifications 
25599  124 
by syntax. The former primrec package is now named OldPrimrecPackage. 
26355  125 
When adjusting theories, beware: constants stemming from newstyle 
25609  126 
primrec specifications have authentic syntax. 
25557  127 

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

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

130 
* Library/ListVector: new theory of arithmetic vector operations. 
25900  131 

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

133 
syntax. INCOMPATIBILITY. 
25522  134 

135 
* Definitions subset_def, psubset_def, set_diff_def, Compl_def, 

136 
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def, 

137 
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def, 

138 
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def, 

139 
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

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

141 

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

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

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

146 
for examples, 

147 

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

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

151 

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

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

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

154 

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

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

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

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

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

159 

26197  160 
*** ZF *** 
161 

162 
* Renamed theories: 

163 

164 
Datatype.thy > Datatype_ZF.thy 

165 
Inductive.thy > Inductive_ZF.thy 

166 
Int.thy > Int_ZF.thy 

167 
IntDiv.thy > IntDiv_ZF.thy 

168 
Nat.thy > Nat_ZF.thy 

169 
List.thy > List_ZF.thy 

170 
Main.thy > Main_ZF.thy 

171 

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

173 

174 
INCOMPATIBILITY: ZF theories that import individual theories below 

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

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

177 
imported "Main", no changes are needed. 

178 

179 

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

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

181 

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

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

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

184 

26387  185 
* Removed obsolete "use_legacy_bindings" function. INCOMPATIBILITY. 
186 

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

189 

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

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

191 
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

192 
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

193 
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

194 
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

195 

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

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

197 
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

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

199 

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

200 

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

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

202 

26218  203 
* System: removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the 
204 
documented way of changing the user's settings is via 

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

206 
script. 

207 

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

210 

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

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

212 
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

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

216 

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

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

218 
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

219 
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

220 

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

223 

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

225 
Isabelle from flooding interactive frontends (notably ProofGeneral / 

226 
XEmacs). 

227 

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

231 

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

234 

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

235 

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

236 

25429  237 
New in Isabelle2007 (November 2007) 
238 
 

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

239 

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

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

241 

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

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

22826  246 

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

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

248 
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

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

250 

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

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

252 
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

253 
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

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

255 

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

258 
quotes. 

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

259 

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

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

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

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

263 
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

264 
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

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

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

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

268 
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

269 

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

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

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

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

274 
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

275 
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

276 

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

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

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

281 

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

283 
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

284 
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

285 
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

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

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

288 

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

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

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

293 
ambiguities introduced later on. INCOMPATIBILITY: constants in parse 

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

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

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

297 

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

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

299 
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

300 
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

301 
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

302 
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

303 
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

304 
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

305 

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

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

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

308 
support a specific search form (see ProofGeneral/CHANGES). 
22965  309 

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

312 
suppressed from proof state output. Note that the ProofGeneral 

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

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

315 
limit is imposed. 

316 

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

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

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

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

320 
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

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

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

323 

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

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

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

326 

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

327 

17865  328 
*** Document preparation *** 
329 

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

332 
current context. 

21339  333 

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

17865  336 

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

21735  339 
arguments may be given on the LHS.) 
21717  340 

341 

17779  342 
*** Pure *** 
343 

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

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

348 
constants with qualified polymorphism (according to the class 

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

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

351 
between global polymorphic consts and internal locale representation. 

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

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

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

358 

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

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

361 
writing SML code to a file: 
25199  362 
export_code <list of constants (term syntax)> in SML <filename> 
22735  363 
writing OCaml code to a file: 
25199  364 
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

365 
writing Haskell code to a bunch of files: 
25199  366 
export_code <list of constants (term syntax)> in Haskell <filename> 
367 

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

25184  369 
method ``eval'' 
370 

371 
Reasonable default setup of framework in HOL. 

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

372 

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

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

374 

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

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

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

379 

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

381 

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

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

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

384 

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

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

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

387 

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

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

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

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

391 

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

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

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

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

395 

25199  396 
code_instance and code_class only are effective to target Haskell. 
22735  397 

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

24800  400 
generation from Isabelle/HOL theories is available via "isatool doc 
401 
codegen". 

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

402 

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

405 
annotations). 

406 

19254  407 
* Command 'no_translations' removes translation rules from theory 
408 
syntax. 

409 

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

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

413 
correspondence to type class and instance declarations. 

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

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

19711  416 

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

418 
instantiation that matches an instance against the most general 

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

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

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

422 
recursion over such type arguments. Incomplete specification patterns 

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

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

427 

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

430 
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

431 
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

432 
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

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

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

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

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

437 
toplevel undo/redo and fail to work with multithreading. 
24086  438 

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

439 
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

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

441 

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

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

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

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

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

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

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

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

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

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

451 

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

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

456 
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

457 
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

458 
order. 
24086  459 

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

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

463 
difference of the original declaration context wrt. the application 

464 
context encountered later on. 

465 

466 
* Isar: proper interfaces for simplification procedures. Command 

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

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

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

470 

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

472 
abbreviates a theorem reference involving an internal dummy fact, 

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

474 
the background context will persist. This form of inplace 

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

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

477 

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

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

479 
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

480 
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

481 
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

482 
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

483 
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

484 
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

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

486 

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

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

488 
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

489 
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

490 
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

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

492 

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

495 

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

497 
then guess x and y by clarify 

498 

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

500 
proof tools being involved here. 

501 

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

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

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

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

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

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

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

510 

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

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

18020  514 

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

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

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

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

519 

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

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

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

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

523 

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

526 

18308  527 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
528 

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

530 

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

533 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  534 
'unfolded' attribute may be replaced by firstclass proof text. 
535 

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

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

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

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

539 
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

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

541 

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

544 

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

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

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

550 
originally first one. 

19220  551 

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

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

553 
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

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

555 

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

558 
(essentially a disjunction of cases with local parameters and 

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

18910  560 
adequately; in this notation common elimination rules look like this: 
18901  561 

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

563 
assumes "EX x. P x" 

564 
obtains x where "P x" 

565 

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

567 
assumes "A & B" 

568 
obtains A and B 

569 

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

571 
assumes "A  B" 

572 
obtains 

573 
A 

574 
 B 

575 

18910  576 
The subsequent classical rules even refer to the formal "thesis" 
18901  577 
explicitly: 
578 

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

580 
obtains "~ thesis" 

581 

18910  582 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
583 
obtains "thesis ==> something" 

18901  584 

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

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

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

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

590 
case_names). 

18901  591 

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

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

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

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

595 
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

596 

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

599 
toplevel lemma. 

600 

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

603 

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

606 
to occur. 

607 

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

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

609 
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

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

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

612 

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

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

614 
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

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

616 

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

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

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

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

622 
current context. 

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

623 

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

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

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

628 

19665  629 
axiomatization 
21595  630 
eq (infix "===" 50) where 
631 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

632 

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

634 
definition g where "g x = f x x" 

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

635 

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

639 

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

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

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

19088  644 
parameters implicit and using the original short name. See also 
25177  645 
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic 
19083  646 
entities from a monomorphic theory. 
647 

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

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

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

652 
prevents folding of abbreviations in term output. 
19084  653 

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

654 
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

655 
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

656 
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

657 
'translations' with explicit "CONST" markup to accommodate this. 
19665  658 

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

661 
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

662 

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

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

664 

24738  665 
inductive conj for A B 
666 
where "A ==> B ==> conj A B" 

667 

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

670 
abbreviations on output. 

671 

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

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

675 
endomorphisms as locale endom = homom mult mult h. 

19783  676 

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

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

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

681 
predicates, goals repesenting already interpreted fragments are not 

682 
removed automatically. Use methods `intro_locales' and 

683 
`unfold_locales'; see below. 

684 

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

686 
provide backward reasoning on locales predicates. The methods are 

687 
aware of interpretations and discharge corresponding goals. 

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

689 
unfold predicates to assumptions. 

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

690 

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

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

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

694 

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

697 
unfolded in interpreted theorems. This is useful for replacing 

698 
defined concepts (constants depending on locale parameters) by 

699 
concepts already existing in the target context. Example: 

700 

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

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

703 

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

706 
partial_order. 

707 

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

711 
(using objectlogic connectives for this purpose has been long 

712 
obsolete anyway). Common proof patterns are explained in 

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

715 
examples. 

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

716 

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

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

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

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

722 

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

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

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

728 

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

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

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

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

733 

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

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

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

736 

24859  737 
* Method "coinduct": dual of induction, see 
18399  738 
src/HOL/Library/Coinductive_List.thy for various examples. 
739 

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

742 

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

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

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

745 

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

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

749 
trace indicates where parts have been suppressed. 

18674  750 

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

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

752 
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

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

754 

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

757 
least one premise. 

758 

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

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

763 

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

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

765 
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

766 
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

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

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

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

770 

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

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

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

773 
for example "A > B" => "Pi A (%_. B)". 
17779  774 

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

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

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

777 

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

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

780 

17865  781 

17806  782 
*** HOL *** 
783 

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

786 
Examples are in the directory MetisExamples. WARNING: the 

787 
Isabelle/HOLMetis integration does not yet work properly with 

788 
multithreading. 

789 

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

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

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

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

794 
work with multithreading. 

795 

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

798 
auto_quickcheck (default true) and auto_quickcheck_time_limit (default 

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

24804  801 

25184  802 
* New constant "undefined" with axiom "undefined x = undefined". 
803 

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

805 
equality. 

806 

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

808 
the new 'class' package: 

809 

810 
HOL.abs ~> HOL.abs_class.abs 

811 
HOL.divide ~> HOL.divide_class.divide 

812 
0 ~> HOL.zero_class.zero 

813 
1 ~> HOL.one_class.one 

814 
op + ~> HOL.plus_class.plus 

815 
op  ~> HOL.minus_class.minus 

816 
uminus ~> HOL.minus_class.uminus 

817 
op * ~> HOL.times_class.times 

818 
op < ~> HOL.ord_class.less 

819 
op <= > HOL.ord_class.less_eq 

820 
Nat.power ~> Power.power_class.power 

821 
Nat.size ~> Nat.size_class.size 

822 
Numeral.number_of ~> Numeral.number_class.number_of 

823 
FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf 

824 
FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup 

825 
Orderings.min ~> Orderings.ord_class.min 

826 
Orderings.max ~> Orderings.ord_class.max 

827 
Divides.op div ~> Divides.div_class.div 

828 
Divides.op mod ~> Divides.div_class.mod 

829 
Divides.op dvd ~> Divides.div_class.dvd 

830 

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

832 

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

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

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

836 
names. 

837 

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

839 
INCOMPATIBILITY: use more specific names. 

840 

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

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

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

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

845 
distribution). INCOMPATIBILITY: rewrite proofs 

846 

847 
d) ML code directly refering to constant names 

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

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

850 
Consider using @{const_name} antiquotation. 

851 

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

853 

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

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

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

857 
sgn_div_norm; ordered_idom now also inherits from sgn_if. 

858 
INCOMPATIBILITY. 

859 

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

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

862 

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

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

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

866 

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

868 
changed order of proof goals in instance proofs. 

869 

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

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

872 
in all contexts importing or interpreting the corresponding locales. 

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

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

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

876 
in the current context. 

877 

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

879 
lemmas max_of_mono and min_of_mono with this predicate. 

880 
INCOMPATIBILITY. 

881 

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

883 
with new class dense_linear_order. 

884 

885 
* Uniform lattice theory development in HOL. 

886 

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

888 
constant "Meet" now named "Inf" 

889 

890 
classes "meet_semilorder" and "join_semilorder" now named 

891 
"lower_semilattice" and "upper_semilattice" 

892 
class "lorder" now named "lattice" 

893 
class "comp_lat" now named "complete_lattice" 

894 

895 
Instantiation of lattice classes allows explicit definitions 

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

897 

898 
INCOMPATIBILITY. Theorem renames: 

899 

900 
meet_left_le ~> inf_le1 

901 
meet_right_le ~> inf_le2 

902 
join_left_le ~> sup_ge1 

903 
join_right_le ~> sup_ge2 

904 
meet_join_le ~> inf_sup_ord 

905 
le_meetI ~> le_infI 

906 
join_leI ~> le_supI 

907 
le_meet ~> le_inf_iff 

908 
le_join ~> ge_sup_conv 

909 
meet_idempotent ~> inf_idem 

910 
join_idempotent ~> sup_idem 

911 
meet_comm ~> inf_commute 

912 
join_comm ~> sup_commute 

913 
meet_leI1 ~> le_infI1 

914 
meet_leI2 ~> le_infI2 

915 
le_joinI1 ~> le_supI1 

916 
le_joinI2 ~> le_supI2 

917 
meet_assoc ~> inf_assoc 

918 
join_assoc ~> sup_assoc 

919 
meet_left_comm ~> inf_left_commute 

920 
meet_left_idempotent ~> inf_left_idem 

921 
join_left_comm ~> sup_left_commute 

922 
join_left_idempotent ~> sup_left_idem 

923 
meet_aci ~> inf_aci 

924 
join_aci ~> sup_aci 

925 
le_def_meet ~> le_iff_inf 

926 
le_def_join ~> le_iff_sup 

927 
join_absorp2 ~> sup_absorb2 

928 
join_absorp1 ~> sup_absorb1 

929 
meet_absorp1 ~> inf_absorb1 

930 
meet_absorp2 ~> inf_absorb2 

931 
meet_join_absorp ~> inf_sup_absorb 

932 
join_meet_absorp ~> sup_inf_absorb 

933 
distrib_join_le ~> distrib_sup_le 

934 
distrib_meet_le ~> distrib_inf_le 

935 

936 
add_meet_distrib_left ~> add_inf_distrib_left 

937 
add_join_distrib_left ~> add_sup_distrib_left 

938 
is_join_neg_meet ~> is_join_neg_inf 

939 
is_meet_neg_join ~> is_meet_neg_sup 

940 
add_meet_distrib_right ~> add_inf_distrib_right 

941 
add_join_distrib_right ~> add_sup_distrib_right 

942 
add_meet_join_distribs ~> add_sup_inf_distribs 

943 
join_eq_neg_meet ~> sup_eq_neg_inf 

944 
meet_eq_neg_join ~> inf_eq_neg_sup 

945 
add_eq_meet_join ~> add_eq_inf_sup 

946 
meet_0_imp_0 ~> inf_0_imp_0 

947 
join_0_imp_0 ~> sup_0_imp_0 

948 
meet_0_eq_0 ~> inf_0_eq_0 

949 
join_0_eq_0 ~> sup_0_eq_0 

950 
neg_meet_eq_join ~> neg_inf_eq_sup 

951 
neg_join_eq_meet ~> neg_sup_eq_inf 

952 
join_eq_if ~> sup_eq_if 

953 

954 
mono_meet ~> mono_inf 

955 
mono_join ~> mono_sup 

956 
meet_bool_eq ~> inf_bool_eq 

957 
join_bool_eq ~> sup_bool_eq 

958 
meet_fun_eq ~> inf_fun_eq 

959 
join_fun_eq ~> sup_fun_eq 

960 
meet_set_eq ~> inf_set_eq 

961 
join_set_eq ~> sup_set_eq 

962 
meet1_iff ~> inf1_iff 

963 
meet2_iff ~> inf2_iff 

964 
meet1I ~> inf1I 

965 
meet2I ~> inf2I 

966 
meet1D1 ~> inf1D1 

967 
meet2D1 ~> inf2D1 

968 
meet1D2 ~> inf1D2 

969 
meet2D2 ~> inf2D2 

970 
meet1E ~> inf1E 

971 
meet2E ~> inf2E 

972 
join1_iff ~> sup1_iff 

973 
join2_iff ~> sup2_iff 

974 
join1I1 ~> sup1I1 

975 
join2I1 ~> sup2I1 

976 
join1I1 ~> sup1I1 

977 
join2I2 ~> sup1I2 

978 
join1CI ~> sup1CI 

979 
join2CI ~> sup2CI 

980 
join1E ~> sup1E 

981 
join2E ~> sup2E 

982 

983 
is_meet_Meet ~> is_meet_Inf 

984 
Meet_bool_def ~> Inf_bool_def 

985 
Meet_fun_def ~> Inf_fun_def 

986 
Meet_greatest ~> Inf_greatest 

987 
Meet_lower ~> Inf_lower 

988 
Meet_set_def ~> Inf_set_def 

989 

990 
Sup_def ~> Sup_Inf 

991 
Sup_bool_eq ~> Sup_bool_def 

992 
Sup_fun_eq ~> Sup_fun_def 

993 
Sup_set_eq ~> Sup_set_def 

994 

995 
listsp_meetI ~> listsp_infI 

996 
listsp_meet_eq ~> listsp_inf_eq 

997 

998 
meet_min ~> inf_min 

999 
join_max ~> sup_max 

1000 

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

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

1003 

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

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

25184  1007 
"*.size". 
1008 

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

1010 
INCOMPATIBILITY. 

24800  1011 

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

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

1014 
fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY. 

1015 

25129  1016 
* HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY. 
1017 

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

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

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

1022 
lemmas on overflow and monotonicity. Instantiated to all appropriate 

1023 
arithmetic type classes, supporting automatic simplification of 

1024 
numerals on all operations. 

24333  1025 

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

1027 

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

1029 

23850  1030 
* Code generator library theories: 
24993  1031 
 Code_Integer represents HOL integers by big integer literals in target 
23850  1032 
languages. 
24993  1033 
 Code_Char represents HOL characters by character literals in target 
23850  1034 
languages. 
24993  1035 
 Code_Char_chr like Code_Char, but also offers treatment of character 
1036 
codes; includes Code_Integer. 

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

23850  1039 
denominator). 
24800  1040 
 Executable_Real implements a subset of real numbers, namly those 
23850  1041 
representable by rational numbers. 
24800  1042 
 Efficient_Nat implements natural numbers by integers, which in general will 
23850  1043 
result in higher efficency; pattern matching with 0/Suc is eliminated; 
24993  1044 
includes Code_Integer. 
1045 
 Code_Index provides an additional datatype index which is mapped to 

1046 
targetlanguage builtin integers. 

26355  1047 
 Code_Message provides an additional datatype message_string which is isomorphic to 
24993  1048 
strings; messages are mapped to targetlanguage strings. 
23850  1049 

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

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

1051 

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

1052 
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

1053 

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

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

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

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

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

1058 
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

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

1060 

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

1062 

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

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

1064 

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

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

1066 
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

1067 

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

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

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

1070 
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

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

1072 

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

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

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

1075 

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

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

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

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

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

1080 
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

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

1082 

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

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

1084 

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

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

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

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

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

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

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

1091 
 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

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

1093 

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

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

1095 

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

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

1100 

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

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

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

1105 
than before the actual inductive definition. 

1106 

1107 
 The variables in induction and elimination rules are now 

1108 
quantified in the order of their occurrence in the introduction 

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

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

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

1112 
statements of the form 

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

1113 

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

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

1115 

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

1116 
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

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

1118 

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

1119 
 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

1120 

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

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

1122 

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

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

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

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

1126 

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

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

1128 

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

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

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

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

1132 

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

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

1134 

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

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

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

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

1138 

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

1141 
rule) before the above elimination rule is applicable. 

1142 

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

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

1145 
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

1146 

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

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

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

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

1152 
users are encouraged to use the new package. 

1153 

1154 
* Method "lexicographic_order" automatically synthesizes termination 

1155 
relations as lexicographic combinations of size measures. 

1156 

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

1159 
programming. Internally, this is translated into nested 

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

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

1162 
the original input but the internal form. Lambdaabstractions allow 

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

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

1165 
variable. 

23564  1166 

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

1170 
previously. Potential INCOMPATIBILITY: 

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

23377  1173 

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

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

1177 
a specific type involves instantiating the locale and possibly adding 

1178 
declarations for computation on the coefficients. The method is 

1179 
already instantiated for natural numbers and for the axiomatic class 

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

1181 
CALCULEMUS 2007 for the general principles underlying this 

1182 
architecture of contextaware prooftools. 

1183 

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

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

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

1188 
rat, etc. 

1189 

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

1192 
circumvent possible incompatibilities when working on ML level. 

1193 

24996  1194 
* primrec: missing cases mapped to "undefined" instead of "arbitrary". 
22845  1195 

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

1198 

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

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

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

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

1204 
comprehension syntax, and for uniformity. INCOMPATIBILITY. 

1205 

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

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

1208 
INCOMPATIBILITY. 

1209 

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

1211 

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

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

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

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

1217 
positive/negative (in inequations). 

23480  1218 

1219 
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib 

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

1222 
because they were subsumed by lemmas xyz. INCOMPATIBILITY. 

1223 

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

22735  1227 

24800  1228 
* Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq. 
22218  1229 
INCOMPATIBILITY. 
1230 

24800  1231 
* Dropped redundant lemma if_def2 in favor of if_bool_eq_conj. 
22218  1232 
INCOMPATIBILITY. 
1233 

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

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

1237 
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

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

1239 

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

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

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

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

1245 

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

1247 
commutative semirings. INCOMPATIBILITY: may need to incorporate 

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

1249 

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

1253 

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

1255 

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

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

1263 
 ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. 

1264 

25177  1265 
See src/HOL/Integ/IntArith.thy for an example setup. 
1266 

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

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

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

1270 
heavyduty computations because the functions are compiled to ML 

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

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

19895  1273 

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

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

1277 

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

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

21265  1282 

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

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

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

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

1287 

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

19377  1290 

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

1294 

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

1296 
True/False. 

1297 

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

19211  1299 

19279  1300 
* Theorem setsum_mult renamed to setsum_right_distrib. 
1301 

19211  1302 
* Prefer ex1I over ex_ex1I in singlestep reasoning, e.g. by the 
22126  1303 
``rule'' method. 
1304 

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

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

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

1309 

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

22126  1311 
zChaff is still supported as well. 
1312 

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

1314 
bundled as foo_bar.inducts; 

1315 

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

1317 
Library. 

21256  1318 

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

1320 

18446  1321 
* Library: added theory Coinductive_List of potentially infinite lists 
1322 
as greatest fixedpoint. 

18399  1323 

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

1326 

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

1329 
oracle) if it evaluates to True. 

20807  1330 

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

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

1334 
Configuration option fast_arith_split_limit=0 recovers the old 

1335 
behavior. 

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

1336 

22126  1337 
* Support for hex (0x20) and binary (0b1001) numerals. 
19254  1338 

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

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

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

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

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

1345 

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

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

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

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

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

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

25177  1352 
subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy. 
1353 

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

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

20807  1356 

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

1361 
in particular multiple inheritance and renaming of components. 

1362 

1363 

19653  1364 
*** HOLComplex *** 
1365 

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

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

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

1370 
INCOMPATIBILITY. 

1371 

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

1375 

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

1378 
defined as range of_real; potential INCOMPATIBILITY. 

1379 

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

23013  1381 
Reals are implemented as arbitrary precision rationals. 
1382 

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

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

1386 
INCOMPATIBILITY. 

21791  1387 

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

1388 
Infinitesimal :: ('a::real_normed_vector) star set 
3e96b98d37c6
generalized sgn function to work on any real normed vector space
huffman
parents:
22971
diff
changeset

1389 
HFinite :: ('a::real_normed_vector) star set 
3e96b98d37c6
generalized sgn function to work on any real normed vector space
huffman
parents:
22971
diff
changeset

1390 
HInfinite :: ('a::real_normed_vector) star set 
21791  1391 
approx :: ('a::real_normed_vector) star => 'a star => bool 
1392 
monad :: ('a::real_normed_vector) star => 'a star set 

1393 
galaxy :: ('a::real_normed_vector) star => 'a star set 

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

1394 
(NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool 
21791  1395 
(NS)convergent :: (nat => 'a::real_normed_vector) => bool 
1396 
(NS)Bseq :: (nat => 'a::real_normed_vector) => bool 

1397 
(NS)Cauchy :: (nat => 'a::real_normed_vector) => bool 

1398 
(NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool 

1399 
is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool 

1400 
deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool 

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

1401 
sgn :: 'a::real_normed_vector => 'a 
23116  1402 
exp :: 'a::{recpower,real_normed_field,banach} => 'a 
21791  1403 

1404 
* Complex: Some complexspecific constants are now abbreviations for 

22126  1405 
overloaded ones: complex_of_real = of_real, cmod = norm, hcmod = 
1406 
hnorm. Other constants have been entirely removed in favor of the 

1407 
polymorphic versions (INCOMPATIBILITY): 

21791  1408 

1409 
approx < capprox 

1410 
HFinite < CFinite 

1411 
HInfinite < CInfinite 

1412 
Infinitesimal < CInfinitesimal 

1413 
monad < cmonad 

1414 
galaxy < cgalaxy 

1415 
(NS)LIM < (NS)CLIM, (NS)CRLIM 

367477e8458b
additions to HOLComplex
huffm 