author  wenzelm 
Thu, 20 Dec 2007 21:14:28 +0100  
changeset 25737  84c92fc48e36 
parent 25726  9728f319ffc6 
child 25772  940429bb0743 
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 

16 

25502  17 
*** Pure *** 
18 

25712  19 
* Instantiation target allows for simultaneous specification of class instance 
20 
operations together with an instantiation proof. Type check phase allows to 

21 
refer to class operations uniformly. See HOL/Complex/Complex.thy for an Isar 

22 
example and HOL/Library/Eval.thy for an ML example. 

23 
Superseedes some immature attempts. 

25502  24 

25 

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

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

27 

25557  28 
* New primrec package. Specification syntax conforms in style to 
25599  29 
definition/function/.... No separate induction rule is provided. 
30 
The "primrec" command distinguishes oldstyle and newstyle specifications 

31 
by syntax. The former primrec package is now named OldPrimrecPackage. 

25609  32 
When adjusting theories, beware: constants stemming for newstyle 
33 
primrec specifications have authentic syntax. 

25557  34 

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

37 
* Constants "card", "internal_split", "option_map" now with authentic 

38 
syntax. 

39 

40 
* Definitions subset_def, psubset_def, set_diff_def, Compl_def, 

41 
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def, 

42 
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def, 

43 
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def, 

44 
Sup_set_def, le_def, less_def, option_map_def now with object 

45 
equality. 

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

46 

25664  47 
* New method "induction_scheme" derives userspecified induction rules 
48 
from wellfounded induction and completeness of patterns. This factors 

49 
out some operations that are done internally by the function package 

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

51 
for examples, 

52 

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

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

56 

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

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

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

59 

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

60 

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

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

62 

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

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

64 
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

65 
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

66 
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

67 
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

68 

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

69 

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

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

71 

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

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

73 
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

74 
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

75 

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

78 

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

80 
Isabelle from flooding interactive frontends (notably ProofGeneral / 

81 
XEmacs). 

82 

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

86 

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

87 

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

88 

25429  89 
New in Isabelle2007 (November 2007) 
90 
 

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

91 

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

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

93 

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

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

22826  98 

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

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

100 
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

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

102 

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

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

104 
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

105 
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

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

107 

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

110 
quotes. 

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

111 

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

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

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

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

115 
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

116 
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

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

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

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

120 
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

121 

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

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

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

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

126 
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

127 
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

128 

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

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

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

133 

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

135 
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

136 
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

137 
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

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

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

140 

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

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

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

145 
ambiguities introduced later on. INCOMPATIBILITY: constants in parse 

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

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

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

149 

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

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

151 
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

152 
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

153 
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

154 
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

155 
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

156 
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

157 

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

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

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

160 
support a specific search form (see ProofGeneral/CHANGES). 
22965  161 

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

164 
suppressed from proof state output. Note that the ProofGeneral 

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

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

167 
limit is imposed. 

168 

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

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

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

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

172 
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

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

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

175 

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

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

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

178 

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

179 

17865  180 
*** Document preparation *** 
181 

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

184 
current context. 

21339  185 

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

17865  188 

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

21735  191 
arguments may be given on the LHS.) 
21717  192 

193 

17779  194 
*** Pure *** 
195 

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

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

200 
constants with qualified polymorphism (according to the class 

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

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

203 
between global polymorphic consts and internal locale representation. 

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

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

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

210 

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

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

213 
writing SML code to a file: 
25199  214 
export_code <list of constants (term syntax)> in SML <filename> 
22735  215 
writing OCaml code to a file: 
25199  216 
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

217 
writing Haskell code to a bunch of files: 
25199  218 
export_code <list of constants (term syntax)> in Haskell <filename> 
219 

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

25184  221 
method ``eval'' 
222 

223 
Reasonable default setup of framework in HOL. 

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

224 

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

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

226 

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

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

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

231 

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

233 

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

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

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

236 

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

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

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

239 

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

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

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

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

243 

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

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

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

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

247 

25199  248 
code_instance and code_class only are effective to target Haskell. 
22735  249 

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

24800  252 
generation from Isabelle/HOL theories is available via "isatool doc 
253 
codegen". 

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

254 

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

257 
annotations). 

258 

19254  259 
* Command 'no_translations' removes translation rules from theory 
260 
syntax. 

261 

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

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

265 
correspondence to type class and instance declarations. 

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

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

19711  268 

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

270 
instantiation that matches an instance against the most general 

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

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

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

274 
recursion over such type arguments. Incomplete specification patterns 

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

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

279 

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

282 
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

283 
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

284 
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

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

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

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

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

289 
toplevel undo/redo and fail to work with multithreading. 
24086  290 

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

291 
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

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

293 

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

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

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

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

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

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

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

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

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

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

303 

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

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

308 
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

309 
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

310 
order. 
24086  311 

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

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

315 
difference of the original declaration context wrt. the application 

316 
context encountered later on. 

317 

318 
* Isar: proper interfaces for simplification procedures. Command 

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

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

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

322 

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

324 
abbreviates a theorem reference involving an internal dummy fact, 

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

326 
the background context will persist. This form of inplace 

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

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

329 

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

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

331 
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

332 
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

333 
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

334 
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

335 
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

336 
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

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

338 

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

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

340 
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

341 
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

342 
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

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

344 

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

347 

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

349 
then guess x and y by clarify 

350 

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

352 
proof tools being involved here. 

353 

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

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

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

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

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

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

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

362 

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

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

18020  366 

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

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

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

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

371 

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

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

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

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

375 

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

378 

18308  379 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
380 

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

382 

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

385 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  386 
'unfolded' attribute may be replaced by firstclass proof text. 
387 

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

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

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

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

391 
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

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

393 

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

396 

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

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

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

402 
originally first one. 

19220  403 

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

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

405 
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

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

407 

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

410 
(essentially a disjunction of cases with local parameters and 

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

18910  412 
adequately; in this notation common elimination rules look like this: 
18901  413 

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

415 
assumes "EX x. P x" 

416 
obtains x where "P x" 

417 

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

419 
assumes "A & B" 

420 
obtains A and B 

421 

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

423 
assumes "A  B" 

424 
obtains 

425 
A 

426 
 B 

427 

18910  428 
The subsequent classical rules even refer to the formal "thesis" 
18901  429 
explicitly: 
430 

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

432 
obtains "~ thesis" 

433 

18910  434 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
435 
obtains "thesis ==> something" 

18901  436 

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

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

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

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

442 
case_names). 

18901  443 

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

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

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

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

447 
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

448 

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

451 
toplevel lemma. 

452 

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

455 

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

458 
to occur. 

459 

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

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

461 
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

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

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

464 

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

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

466 
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

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

468 

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

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

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

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

474 
current context. 

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

475 

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

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

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

480 

19665  481 
axiomatization 
21595  482 
eq (infix "===" 50) where 
483 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

484 

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

486 
definition g where "g x = f x x" 

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

487 

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

491 

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

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

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

19088  496 
parameters implicit and using the original short name. See also 
25177  497 
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic 
19083  498 
entities from a monomorphic theory. 
499 

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

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

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

504 
prevents folding of abbreviations in term output. 
19084  505 

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

506 
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

507 
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

508 
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

509 
'translations' with explicit "CONST" markup to accommodate this. 
19665  510 

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

513 
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

514 

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

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

516 

24738  517 
inductive conj for A B 
518 
where "A ==> B ==> conj A B" 

519 

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

522 
abbreviations on output. 

523 

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

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

527 
endomorphisms as locale endom = homom mult mult h. 

19783  528 

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

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

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

533 
predicates, goals repesenting already interpreted fragments are not 

534 
removed automatically. Use methods `intro_locales' and 

535 
`unfold_locales'; see below. 

536 

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

538 
provide backward reasoning on locales predicates. The methods are 

539 
aware of interpretations and discharge corresponding goals. 

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

541 
unfold predicates to assumptions. 

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

542 

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

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

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

546 

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

549 
unfolded in interpreted theorems. This is useful for replacing 

550 
defined concepts (constants depending on locale parameters) by 

551 
concepts already existing in the target context. Example: 

552 

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

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

555 

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

558 
partial_order. 

559 

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

563 
(using objectlogic connectives for this purpose has been long 

564 
obsolete anyway). Common proof patterns are explained in 

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

567 
examples. 

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

568 

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

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

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

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

574 

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

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

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

580 

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

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

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

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

585 

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

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

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

588 

24859  589 
* Method "coinduct": dual of induction, see 
18399  590 
src/HOL/Library/Coinductive_List.thy for various examples. 
591 

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

594 

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

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

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

597 

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

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

601 
trace indicates where parts have been suppressed. 

18674  602 

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

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

604 
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

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

606 

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

609 
least one premise. 

610 

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

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

615 

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

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

617 
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

618 
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

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

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

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

622 

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

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

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

625 
for example "A > B" => "Pi A (%_. B)". 
17779  626 

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

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

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

629 

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

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

632 

17865  633 

17806  634 
*** HOL *** 
635 

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

638 
Examples are in the directory MetisExamples. WARNING: the 

639 
Isabelle/HOLMetis integration does not yet work properly with 

640 
multithreading. 

641 

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

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

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

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

646 
work with multithreading. 

647 

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

650 
auto_quickcheck (default true) and auto_quickcheck_time_limit (default 

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

24804  653 

25184  654 
* New constant "undefined" with axiom "undefined x = undefined". 
655 

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

657 
equality. 

658 

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

660 
the new 'class' package: 

661 

662 
HOL.abs ~> HOL.abs_class.abs 

663 
HOL.divide ~> HOL.divide_class.divide 

664 
0 ~> HOL.zero_class.zero 

665 
1 ~> HOL.one_class.one 

666 
op + ~> HOL.plus_class.plus 

667 
op  ~> HOL.minus_class.minus 

668 
uminus ~> HOL.minus_class.uminus 

669 
op * ~> HOL.times_class.times 

670 
op < ~> HOL.ord_class.less 

671 
op <= > HOL.ord_class.less_eq 

672 
Nat.power ~> Power.power_class.power 

673 
Nat.size ~> Nat.size_class.size 

674 
Numeral.number_of ~> Numeral.number_class.number_of 

675 
FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf 

676 
FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup 

677 
Orderings.min ~> Orderings.ord_class.min 

678 
Orderings.max ~> Orderings.ord_class.max 

679 
Divides.op div ~> Divides.div_class.div 

680 
Divides.op mod ~> Divides.div_class.mod 

681 
Divides.op dvd ~> Divides.div_class.dvd 

682 

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

684 

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

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

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

688 
names. 

689 

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

691 
INCOMPATIBILITY: use more specific names. 

692 

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

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

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

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

697 
distribution). INCOMPATIBILITY: rewrite proofs 

698 

699 
d) ML code directly refering to constant names 

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

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

702 
Consider using @{const_name} antiquotation. 

703 

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

705 

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

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

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

709 
sgn_div_norm; ordered_idom now also inherits from sgn_if. 

710 
INCOMPATIBILITY. 

711 

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

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

714 

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

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

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

718 

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

720 
changed order of proof goals in instance proofs. 

721 

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

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

724 
in all contexts importing or interpreting the corresponding locales. 

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

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

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

728 
in the current context. 

729 

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

731 
lemmas max_of_mono and min_of_mono with this predicate. 

732 
INCOMPATIBILITY. 

733 

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

735 
with new class dense_linear_order. 

736 

737 
* Uniform lattice theory development in HOL. 

738 

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

740 
constant "Meet" now named "Inf" 

741 

742 
classes "meet_semilorder" and "join_semilorder" now named 

743 
"lower_semilattice" and "upper_semilattice" 

744 
class "lorder" now named "lattice" 

745 
class "comp_lat" now named "complete_lattice" 

746 

747 
Instantiation of lattice classes allows explicit definitions 

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

749 

750 
INCOMPATIBILITY. Theorem renames: 

751 

752 
meet_left_le ~> inf_le1 

753 
meet_right_le ~> inf_le2 

754 
join_left_le ~> sup_ge1 

755 
join_right_le ~> sup_ge2 

756 
meet_join_le ~> inf_sup_ord 

757 
le_meetI ~> le_infI 

758 
join_leI ~> le_supI 

759 
le_meet ~> le_inf_iff 

760 
le_join ~> ge_sup_conv 

761 
meet_idempotent ~> inf_idem 

762 
join_idempotent ~> sup_idem 

763 
meet_comm ~> inf_commute 

764 
join_comm ~> sup_commute 

765 
meet_leI1 ~> le_infI1 

766 
meet_leI2 ~> le_infI2 

767 
le_joinI1 ~> le_supI1 

768 
le_joinI2 ~> le_supI2 

769 
meet_assoc ~> inf_assoc 

770 
join_assoc ~> sup_assoc 

771 
meet_left_comm ~> inf_left_commute 

772 
meet_left_idempotent ~> inf_left_idem 

773 
join_left_comm ~> sup_left_commute 

774 
join_left_idempotent ~> sup_left_idem 

775 
meet_aci ~> inf_aci 

776 
join_aci ~> sup_aci 

777 
le_def_meet ~> le_iff_inf 

778 
le_def_join ~> le_iff_sup 

779 
join_absorp2 ~> sup_absorb2 

780 
join_absorp1 ~> sup_absorb1 

781 
meet_absorp1 ~> inf_absorb1 

782 
meet_absorp2 ~> inf_absorb2 

783 
meet_join_absorp ~> inf_sup_absorb 

784 
join_meet_absorp ~> sup_inf_absorb 

785 
distrib_join_le ~> distrib_sup_le 

786 
distrib_meet_le ~> distrib_inf_le 

787 

788 
add_meet_distrib_left ~> add_inf_distrib_left 

789 
add_join_distrib_left ~> add_sup_distrib_left 

790 
is_join_neg_meet ~> is_join_neg_inf 

791 
is_meet_neg_join ~> is_meet_neg_sup 

792 
add_meet_distrib_right ~> add_inf_distrib_right 

793 
add_join_distrib_right ~> add_sup_distrib_right 

794 
add_meet_join_distribs ~> add_sup_inf_distribs 

795 
join_eq_neg_meet ~> sup_eq_neg_inf 

796 
meet_eq_neg_join ~> inf_eq_neg_sup 

797 
add_eq_meet_join ~> add_eq_inf_sup 

798 
meet_0_imp_0 ~> inf_0_imp_0 

799 
join_0_imp_0 ~> sup_0_imp_0 

800 
meet_0_eq_0 ~> inf_0_eq_0 

801 
join_0_eq_0 ~> sup_0_eq_0 

802 
neg_meet_eq_join ~> neg_inf_eq_sup 

803 
neg_join_eq_meet ~> neg_sup_eq_inf 

804 
join_eq_if ~> sup_eq_if 

805 

806 
mono_meet ~> mono_inf 

807 
mono_join ~> mono_sup 

808 
meet_bool_eq ~> inf_bool_eq 

809 
join_bool_eq ~> sup_bool_eq 

810 
meet_fun_eq ~> inf_fun_eq 

811 
join_fun_eq ~> sup_fun_eq 

812 
meet_set_eq ~> inf_set_eq 

813 
join_set_eq ~> sup_set_eq 

814 
meet1_iff ~> inf1_iff 

815 
meet2_iff ~> inf2_iff 

816 
meet1I ~> inf1I 

817 
meet2I ~> inf2I 

818 
meet1D1 ~> inf1D1 

819 
meet2D1 ~> inf2D1 

820 
meet1D2 ~> inf1D2 

821 
meet2D2 ~> inf2D2 

822 
meet1E ~> inf1E 

823 
meet2E ~> inf2E 

824 
join1_iff ~> sup1_iff 

825 
join2_iff ~> sup2_iff 

826 
join1I1 ~> sup1I1 

827 
join2I1 ~> sup2I1 

828 
join1I1 ~> sup1I1 

829 
join2I2 ~> sup1I2 

830 
join1CI ~> sup1CI 

831 
join2CI ~> sup2CI 

832 
join1E ~> sup1E 

833 
join2E ~> sup2E 

834 

835 
is_meet_Meet ~> is_meet_Inf 

836 
Meet_bool_def ~> Inf_bool_def 

837 
Meet_fun_def ~> Inf_fun_def 

838 
Meet_greatest ~> Inf_greatest 

839 
Meet_lower ~> Inf_lower 

840 
Meet_set_def ~> Inf_set_def 

841 

842 
Sup_def ~> Sup_Inf 

843 
Sup_bool_eq ~> Sup_bool_def 

844 
Sup_fun_eq ~> Sup_fun_def 

845 
Sup_set_eq ~> Sup_set_def 

846 

847 
listsp_meetI ~> listsp_infI 

848 
listsp_meet_eq ~> listsp_inf_eq 

849 

850 
meet_min ~> inf_min 

851 
join_max ~> sup_max 

852 

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

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

855 

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

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

25184  859 
"*.size". 
860 

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

862 
INCOMPATIBILITY. 

24800  863 

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

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

866 
fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY. 

867 

25129  868 
* HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY. 
869 

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

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

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

874 
lemmas on overflow and monotonicity. Instantiated to all appropriate 

875 
arithmetic type classes, supporting automatic simplification of 

876 
numerals on all operations. 

24333  877 

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

879 

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

881 

23850  882 
* Code generator library theories: 
24993  883 
 Code_Integer represents HOL integers by big integer literals in target 
23850  884 
languages. 
24993  885 
 Code_Char represents HOL characters by character literals in target 
23850  886 
languages. 
24993  887 
 Code_Char_chr like Code_Char, but also offers treatment of character 
888 
codes; includes Code_Integer. 

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

23850  891 
denominator). 
24800  892 
 Executable_Real implements a subset of real numbers, namly those 
23850  893 
representable by rational numbers. 
24800  894 
 Efficient_Nat implements natural numbers by integers, which in general will 
23850  895 
result in higher efficency; pattern matching with 0/Suc is eliminated; 
24993  896 
includes Code_Integer. 
897 
 Code_Index provides an additional datatype index which is mapped to 

898 
targetlanguage builtin integers. 

899 
 Code_Message provides an additional datatype message_string} which is isomorphic to 

900 
strings; messages are mapped to targetlanguage strings. 

23850  901 

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

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

903 

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

904 
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

905 

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

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

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

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

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

910 
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

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

912 

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

914 

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

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

916 

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

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

918 
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

919 

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

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

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

922 
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

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

924 

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

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

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

927 

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

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

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

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

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

932 
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

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

934 

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

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

936 

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

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

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

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

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

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

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

943 
 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

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

945 

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

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

947 

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

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

950 

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

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

952 

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

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

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

957 
than before the actual inductive definition. 

958 

959 
 The variables in induction and elimination rules are now 

960 
quantified in the order of their occurrence in the introduction 

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

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

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

964 
statements of the form 

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

965 

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

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

967 

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

968 
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

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

970 

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

971 
 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

972 

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

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

974 

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

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

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

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

978 

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

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

980 

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

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

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

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

984 

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

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

986 

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

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

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

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

990 

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

993 
rule) before the above elimination rule is applicable. 

994 

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

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

997 
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

998 

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

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

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

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

1004 
users are encouraged to use the new package. 

1005 

1006 
* Method "lexicographic_order" automatically synthesizes termination 

1007 
relations as lexicographic combinations of size measures. 

1008 

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

1011 
programming. Internally, this is translated into nested 

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

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

1014 
the original input but the internal form. Lambdaabstractions allow 

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

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

1017 
variable. 

23564  1018 

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

1022 
previously. Potential INCOMPATIBILITY: 

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

23377  1025 

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

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

1029 
a specific type involves instantiating the locale and possibly adding 

1030 
declarations for computation on the coefficients. The method is 

1031 
already instantiated for natural numbers and for the axiomatic class 

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

1033 
CALCULEMUS 2007 for the general principles underlying this 

1034 
architecture of contextaware prooftools. 

1035 

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

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

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

1040 
rat, etc. 

1041 

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

1044 
circumvent possible incompatibilities when working on ML level. 

1045 

24996  1046 
* primrec: missing cases mapped to "undefined" instead of "arbitrary". 
22845  1047 

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

1050 

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

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

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

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

1056 
comprehension syntax, and for uniformity. INCOMPATIBILITY. 

1057 

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

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

1060 
INCOMPATIBILITY. 

1061 

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

1063 

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

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

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

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

1069 
positive/negative (in inequations). 

23480  1070 

1071 
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib 

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

1074 
because they were subsumed by lemmas xyz. INCOMPATIBILITY. 

1075 

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

22735  1079 

24800  1080 
* Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq. 
22218  1081 
INCOMPATIBILITY. 
1082 

24800  1083 
* Dropped redundant lemma if_def2 in favor of if_bool_eq_conj. 
22218  1084 
INCOMPATIBILITY. 
1085 

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

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

1089 
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

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

1091 

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

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

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

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

1097 

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

1099 
commutative semirings. INCOMPATIBILITY: may need to incorporate 

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

1101 

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

1105 

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

1107 

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

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

1115 
 ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. 

1116 

25177  1117 
See src/HOL/Integ/IntArith.thy for an example setup. 
1118 

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

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

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

1122 
heavyduty computations because the functions are compiled to ML 

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

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

19895  1125 

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

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

1129 

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

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

21265  1134 

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

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

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

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

1139 

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

19377  1142 

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

1146 

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

1148 
True/False. 

1149 

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

19211  1151 

19279  1152 
* Theorem setsum_mult renamed to setsum_right_distrib. 
1153 

19211  1154 
* Prefer ex1I over ex_ex1I in singlestep reasoning, e.g. by the 
22126  1155 
``rule'' method. 
1156 

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

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

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

1161 

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

22126  1163 
zChaff is still supported as well. 
1164 

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

1166 
bundled as foo_bar.inducts; 

1167 

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

1169 
Library. 

21256  1170 

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

1172 

18446  1173 
* Library: added theory Coinductive_List of potentially infinite lists 
1174 
as greatest fixedpoint. 

18399  1175 

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

1178 

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

1181 
oracle) if it evaluates to True. 

20807  1182 

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

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

1186 
Configuration option fast_arith_split_limit=0 recovers the old 

1187 
behavior. 

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

1188 

22126  1189 
* Support for hex (0x20) and binary (0b1001) numerals. 
19254  1190 

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

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

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

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

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

1197 

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

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

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

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

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

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

25177  1204 
subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy. 
1205 

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

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

20807  1208 

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

1213 
in particular multiple inheritance and renaming of components. 

1214 

1215 

19653  1216 
*** HOLComplex *** 
1217 

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

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

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

1222 
INCOMPATIBILITY. 

1223 

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

1227 

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

1230 
defined as range of_real; potential INCOMPATIBILITY. 

1231 

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

23013  1233 
Reals are implemented as arbitrary precision rationals. 
1234 

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

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

1238 
INCOMPATIBILITY. 

21791  1239 

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

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

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

1242 
HInfinite :: ('a::real_normed_vector) star set 
21791  1243 
approx :: ('a::real_normed_vector) star => 'a star => bool 
1244 
monad :: ('a::real_normed_vector) star => 'a star set 

1245 
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

1246 
(NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool 
21791  1247 
(NS)convergent :: (nat => 'a::real_normed_vector) => bool 
1248 
(NS)Bseq :: (nat => 'a::real_normed_vector) => bool 

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

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

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

1252 
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

1253 
sgn :: 'a::real_normed_vector => 'a 
23116  1254 
exp :: 'a::{recpower,real_normed_field,banach} => 'a 
21791  1255 

1256 
* Complex: Some complexspecific constants are now abbreviations for 

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

1259 
polymorphic versions (INCOMPATIBILITY): 

21791  1260 

1261 
approx < capprox 

1262 
HFinite < CFinite 

1263 
HInfinite < CInfinite 

1264 
Infinitesimal < CInfinitesimal 

1265 
monad < cmonad 

1266 
galaxy < cgalaxy 

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

1268 
is(NS)Cont < is(NS)Contc, is(NS)contCR 

1269 
(ns)deriv < (ns)cderiv 

1270 

19653  1271 

24801  1272 
*** HOLAlgebra *** 
1273 

1274 
* Formalisation of ideals and the quotient construction over rings. 

1275 

1276 
* Order and lattice theory no longer based on records. 

1277 
INCOMPATIBILITY. 

1278 

1279 
* Renamed lemmas least_carrier > least_closed and greatest_carrier > 

1280 
greatest_closed. INCOMPATIBILITY. 

1281 

1282 
* Method algebra is now set up via an attribute. For examples see 

1283 
Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations 

1284 
of algebraic structures. 

1285 

1286 
* Renamed theory CRing to Ring. 

1287 

1288 

1289 
*** HOLNominal *** 

1290 

25148  1291 
* Substantial, yet incomplete support for nominal datatypes (binding 
25177  1292 
structures) based on HOLNominal logic. See src/HOL/Nominal and 
1293 
src/HOL/Nominal/Examples. Prospective users should consult 

25148  1294 
http://isabelle.in.tum.de/nominal/ 
1295 

24801  1296 

17878  1297 
*** ML *** 
1298 

24643  1299 
* ML basics: just one true type int, which coincides with IntInf.int 
1300 
(even on SML/NJ). 

1301 

22138  1302 
* ML within Isar: antiquotations allow to embed staticallychecked 
1303 
formal entities in the source, referring to the context available at 

1304 
compiletime. For example: 

1305 

25142  1306 
ML {* @{sort "{zero,one}"} *} 
22138  1307 
ML {* @{typ "'a => 'b"} *} 
1308 
ML {* @{term "%x. x"} *} 

1309 
ML {* @{prop "x == y"} *} 

1310 
ML {* @{ctyp "'a => 'b"} *} 

1311 
ML {* @{cterm "%x. x"} *} 

1312 
ML {* @{cprop "x == y"} *} 

1313 
ML {* @{thm asm_rl} *} 

1314 
ML {* @{thms asm_rl} *} 

24692  1315 
ML {* @{type_name c} *} 
25142  1316 
ML {* @{type_syntax c} *} 
22376  1317 
ML {* @{const_name c} *} 
1318 
ML {* @{const_syntax c} *} 

22138  1319 
ML {* @{context} *} 
1320 
ML {* @{theory} *} 

1321 
ML {* @{theory Pure} *} 

24692  1322 
ML {* @{theory_ref} *} 
1323 
ML {* @{theory_ref Pure} *} 

22138  1324 
ML {* @{simpset} *} 
1325 
ML {* @{claset} *} 

1326 
ML {* @{clasimpset} *} 

1327 

22151  1328 
The same works for sources being ``used'' within an Isar context. 
1329 

22152  1330 
* ML in Isar: improved error reporting; extra verbosity with 
24706
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset

1331 
ML_Context.trace enabled. 
22152  1332 

19032  1333 
* Pure/General/table.ML: the join operations now works via exceptions 
24706
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset

1334 
DUP/SAME instead of type option. This is simpler in simple cases, and 
19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

1335 
admits slightly more efficient complex applications. 
18446  1336 

24800  1337 
* Pure: 'advanced' translation functions (parse_translation etc.) now 
1338 
use Context.generic instead of just theory. 

1339 

18642  1340 
* Pure: datatype Context.generic joins theory/Proof.context and 
18644  1341 
provides some facilities for code that works in either kind of 
18642  1342 
context, notably GenericDataFun for uniform theory and proof data. 
1343 

18737  1344 
* Pure: simplified internal attribute type, which is now always 
24706
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset

1345 
Context.generic * thm > Context.generic * thm. Global (theory) vs. 
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset

1346 
local (Proof.context) attributes have been discontinued, while 
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset

1347 
minimizing code duplication. Thm.rule_attribute and 
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset

1348 
Thm.declaration_attribute build canonical attributes; see also structure 
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset

1349 
Context for further operations on Context.generic, notably 
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset

1350 
GenericDataFun. INCOMPATIBILITY, need to adapt attribute type 
19006
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

1351 
declarations and definitions. 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

1352 

24800  1353 
* Context data interfaces (Theory/Proof/GenericDataFun): removed 
1354 
name/print, uninitialized data defaults to adhoc copy of empty value, 

1355 
init only required for impure data. INCOMPATIBILITY: empty really need 

1356 
to be empty (no dependencies on theory content!) 

1357 

19508  1358 
* Pure/kernel: consts certification ignores sort constraints given in 
24800  1359 
signature declarations. (This information is not relevant to the 
1360 
logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE, 

1361 
potential INCOMPATIBILITY. 

19508  1362 

1363 
* Pure: axiomatic type classes are now purely definitional, with 

1364 
explicit proofs of class axioms and super class relations performed 

24706
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset

1365 
internally. See Pure/axclass.ML for the main internal interfaces  
19508  1366 
notably AxClass.define_class supercedes AxClass.add_axclass, and 
24706
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset

1367 
AxClass.axiomatize_class/classrel/arity supersede 
19508  1368 
Sign.add_classes/classrel/arities. 
1369 

19006
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

1370 
* Pure/Isar: Args/Attrib parsers operate on Context.generic  
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

1371 
global/local versions on theory vs. Proof.context have been 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

1372 
discontinued; Attrib.syntax and Method.syntax have been adapted 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

1373 
accordingly. INCOMPATIBILITY, need to adapt parser expressions for 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

1374 
attributes, methods, etc. 
18642  1375 

18446  1376 
* Pure: several functions of signature "... > theory > theory * ..." 
1377 
have been reoriented to "... > theory > ... * theory" in order to 

1378 
allow natural usage in combination with the >, >>, > and 

1379 
fold_map combinators. 

18051  1380 

21647
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset

1381 
* Pure: official theorem names (closed derivations) and additional 
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset

1382 
comments (tags) are now strictly separate. Name hints  which are 
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset

1383 
maintained as tags  may be attached any time without affecting the 
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset

1384 
derivation. 
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset

1385 

18020  1386 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  1387 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  1388 
achieve the old behaviour. 
1389 

1390 
* Pure: the "Goal" constant is now called "prop", supporting a 

1391 
slightly more general idea of ``protecting'' metalevel rule 

1392 
statements. 

1393 

20040
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1394 
* Pure: Logic.(un)varify only works in a global context, which is now 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1395 
enforced instead of silently assumed. INCOMPATIBILITY, may use 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1396 
Logic.legacy_(un)varify as temporary workaround. 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1397 

20090  1398 
* Pure: structure Name provides scalable operations for generating 
1399 
internal variable names, notably Name.variants etc. This replaces 

1400 
some popular functions from term.ML: 

1401 

1402 
Term.variant > Name.variant 

24800  1403 
Term.variantlist > Name.variant_list 
20090  1404 
Term.invent_names > Name.invent_list 
1405 

1406 
Note that lowlevel renaming rarely occurs in new code  operations 

1407 
from structure Variable are used instead (see below). 

1408 

20040
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1409 
* Pure: structure Variable provides fundamental operations for proper 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1410 
treatment of fixed/schematic variables in a context. For example, 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
