author  wenzelm 
Sat, 15 Dec 2007 21:24:14 +0100  
changeset 25651  6b2eb4e70ae3 
parent 25626  3000965b1fdf 
child 25652  390d3bd0435d 
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 

25522  19 
* Command "instance" now takes list of definitions in the same manner 
20 
as the "definition" command. Most notably, object equality is now 

25502  21 
possible. Type inference is more canonical than it used to be. 
22 
INCOMPATIBILITY: in some cases explicit type annotations are required. 

23 

24 

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

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

26 

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

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

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

25557  33 

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

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

37 
syntax. 

38 

39 
* Definitions subset_def, psubset_def, set_diff_def, Compl_def, 

40 
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def, 

41 
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def, 

42 
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def, 

43 
Sup_set_def, le_def, less_def, option_map_def now with object 

44 
equality. 

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

45 

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

46 

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

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

48 

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

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

50 
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

51 
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

52 

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

55 

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

57 
Isabelle from flooding interactive frontends (notably ProofGeneral / 

58 
XEmacs). 

59 

60 
* JVM class isabelle.IsabelleProcess (in Isabelle/lib/classes) 

61 
provides general wrapper for managing an Isabelle process in a robust 

62 
fashion, with ``cooked'' output from stdin/stderr. 

63 

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

64 

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

65 

25429  66 
New in Isabelle2007 (November 2007) 
67 
 

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

68 

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

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

70 

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

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

22826  75 

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

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

77 
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

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

79 

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

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

81 
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

82 
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

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

84 

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

87 
quotes. 

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

88 

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

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

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

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

92 
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

93 
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

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

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

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

97 
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

98 

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

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

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

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

103 
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

104 
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

105 

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

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

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

110 

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

112 
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

113 
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

114 
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

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

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

117 

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

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

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

122 
ambiguities introduced later on. INCOMPATIBILITY: constants in parse 

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

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

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

126 

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

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

128 
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

129 
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

130 
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

131 
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

132 
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

133 
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

134 

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

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

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

137 
support a specific search form (see ProofGeneral/CHANGES). 
22965  138 

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

141 
suppressed from proof state output. Note that the ProofGeneral 

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

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

144 
limit is imposed. 

145 

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

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

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

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

149 
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

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

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

152 

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

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

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

155 

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

156 

17865  157 
*** Document preparation *** 
158 

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

161 
current context. 

21339  162 

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

17865  165 

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

21735  168 
arguments may be given on the LHS.) 
21717  169 

170 

17779  171 
*** Pure *** 
172 

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

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

177 
constants with qualified polymorphism (according to the class 

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

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

180 
between global polymorphic consts and internal locale representation. 

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

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

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

187 

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

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

190 
writing SML code to a file: 
25199  191 
export_code <list of constants (term syntax)> in SML <filename> 
22735  192 
writing OCaml code to a file: 
25199  193 
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

194 
writing Haskell code to a bunch of files: 
25199  195 
export_code <list of constants (term syntax)> in Haskell <filename> 
196 

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

25184  198 
method ``eval'' 
199 

200 
Reasonable default setup of framework in HOL. 

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

201 

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

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

203 

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

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

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

208 

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

210 

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

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

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

213 

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

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

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

216 

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

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

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

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

220 

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

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

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

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

224 

25199  225 
code_instance and code_class only are effective to target Haskell. 
22735  226 

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

24800  229 
generation from Isabelle/HOL theories is available via "isatool doc 
230 
codegen". 

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

231 

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

234 
annotations). 

235 

19254  236 
* Command 'no_translations' removes translation rules from theory 
237 
syntax. 

238 

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

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

242 
correspondence to type class and instance declarations. 

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

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

19711  245 

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

247 
instantiation that matches an instance against the most general 

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

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

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

251 
recursion over such type arguments. Incomplete specification patterns 

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

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

256 

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

259 
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

260 
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

261 
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

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

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

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

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

266 
toplevel undo/redo and fail to work with multithreading. 
24086  267 

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

268 
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

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

270 

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

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

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

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

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

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

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

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

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

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

280 

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

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

285 
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

286 
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

287 
order. 
24086  288 

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

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

292 
difference of the original declaration context wrt. the application 

293 
context encountered later on. 

294 

295 
* Isar: proper interfaces for simplification procedures. Command 

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

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

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

299 

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

301 
abbreviates a theorem reference involving an internal dummy fact, 

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

303 
the background context will persist. This form of inplace 

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

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

306 

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

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

308 
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

309 
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

310 
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

311 
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

312 
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

313 
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

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

315 

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

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

317 
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

318 
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

319 
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

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

321 

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

324 

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

326 
then guess x and y by clarify 

327 

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

329 
proof tools being involved here. 

330 

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

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

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

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

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

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

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

339 

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

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

18020  343 

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

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

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

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

348 

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

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

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

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

352 

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

355 

18308  356 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
357 

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

359 

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

362 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  363 
'unfolded' attribute may be replaced by firstclass proof text. 
364 

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

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

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

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

368 
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

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

370 

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

373 

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

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

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

379 
originally first one. 

19220  380 

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

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

382 
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

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

384 

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

387 
(essentially a disjunction of cases with local parameters and 

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

18910  389 
adequately; in this notation common elimination rules look like this: 
18901  390 

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

392 
assumes "EX x. P x" 

393 
obtains x where "P x" 

394 

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

396 
assumes "A & B" 

397 
obtains A and B 

398 

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

400 
assumes "A  B" 

401 
obtains 

402 
A 

403 
 B 

404 

18910  405 
The subsequent classical rules even refer to the formal "thesis" 
18901  406 
explicitly: 
407 

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

409 
obtains "~ thesis" 

410 

18910  411 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
412 
obtains "thesis ==> something" 

18901  413 

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

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

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

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

419 
case_names). 

18901  420 

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

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

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

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

424 
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

425 

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

428 
toplevel lemma. 

429 

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

432 

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

435 
to occur. 

436 

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

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

438 
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

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

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

441 

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

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

443 
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

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

445 

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

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

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

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

451 
current context. 

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

452 

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

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

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

457 

19665  458 
axiomatization 
21595  459 
eq (infix "===" 50) where 
460 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

461 

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

463 
definition g where "g x = f x x" 

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

464 

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

468 

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

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

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

19088  473 
parameters implicit and using the original short name. See also 
25177  474 
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic 
19083  475 
entities from a monomorphic theory. 
476 

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

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

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

481 
prevents folding of abbreviations in term output. 
19084  482 

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

483 
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

484 
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

485 
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

486 
'translations' with explicit "CONST" markup to accommodate this. 
19665  487 

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

490 
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

491 

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

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

493 

24738  494 
inductive conj for A B 
495 
where "A ==> B ==> conj A B" 

496 

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

499 
abbreviations on output. 

500 

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

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

504 
endomorphisms as locale endom = homom mult mult h. 

19783  505 

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

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

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

510 
predicates, goals repesenting already interpreted fragments are not 

511 
removed automatically. Use methods `intro_locales' and 

512 
`unfold_locales'; see below. 

513 

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

515 
provide backward reasoning on locales predicates. The methods are 

516 
aware of interpretations and discharge corresponding goals. 

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

518 
unfold predicates to assumptions. 

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

519 

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

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

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

523 

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

526 
unfolded in interpreted theorems. This is useful for replacing 

527 
defined concepts (constants depending on locale parameters) by 

528 
concepts already existing in the target context. Example: 

529 

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

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

532 

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

535 
partial_order. 

536 

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

540 
(using objectlogic connectives for this purpose has been long 

541 
obsolete anyway). Common proof patterns are explained in 

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

544 
examples. 

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

545 

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

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

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

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

551 

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

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

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

557 

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

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

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

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

562 

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

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

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

565 

24859  566 
* Method "coinduct": dual of induction, see 
18399  567 
src/HOL/Library/Coinductive_List.thy for various examples. 
568 

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

571 

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

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

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

574 

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

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

578 
trace indicates where parts have been suppressed. 

18674  579 

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

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

581 
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

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

583 

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

586 
least one premise. 

587 

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

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

592 

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

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

594 
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

595 
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

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

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

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

599 

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

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

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

602 
for example "A > B" => "Pi A (%_. B)". 
17779  603 

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

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

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

606 

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

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

609 

17865  610 

17806  611 
*** HOL *** 
612 

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

615 
Examples are in the directory MetisExamples. WARNING: the 

616 
Isabelle/HOLMetis integration does not yet work properly with 

617 
multithreading. 

618 

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

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

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

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

623 
work with multithreading. 

624 

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

627 
auto_quickcheck (default true) and auto_quickcheck_time_limit (default 

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

24804  630 

25184  631 
* New constant "undefined" with axiom "undefined x = undefined". 
632 

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

634 
equality. 

635 

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

637 
the new 'class' package: 

638 

639 
HOL.abs ~> HOL.abs_class.abs 

640 
HOL.divide ~> HOL.divide_class.divide 

641 
0 ~> HOL.zero_class.zero 

642 
1 ~> HOL.one_class.one 

643 
op + ~> HOL.plus_class.plus 

644 
op  ~> HOL.minus_class.minus 

645 
uminus ~> HOL.minus_class.uminus 

646 
op * ~> HOL.times_class.times 

647 
op < ~> HOL.ord_class.less 

648 
op <= > HOL.ord_class.less_eq 

649 
Nat.power ~> Power.power_class.power 

650 
Nat.size ~> Nat.size_class.size 

651 
Numeral.number_of ~> Numeral.number_class.number_of 

652 
FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf 

653 
FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup 

654 
Orderings.min ~> Orderings.ord_class.min 

655 
Orderings.max ~> Orderings.ord_class.max 

656 
Divides.op div ~> Divides.div_class.div 

657 
Divides.op mod ~> Divides.div_class.mod 

658 
Divides.op dvd ~> Divides.div_class.dvd 

659 

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

661 

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

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

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

665 
names. 

666 

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

668 
INCOMPATIBILITY: use more specific names. 

669 

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

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

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

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

674 
distribution). INCOMPATIBILITY: rewrite proofs 

675 

676 
d) ML code directly refering to constant names 

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

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

679 
Consider using @{const_name} antiquotation. 

680 

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

682 

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

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

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

686 
sgn_div_norm; ordered_idom now also inherits from sgn_if. 

687 
INCOMPATIBILITY. 

688 

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

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

691 

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

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

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

695 

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

697 
changed order of proof goals in instance proofs. 

698 

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

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

701 
in all contexts importing or interpreting the corresponding locales. 

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

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

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

705 
in the current context. 

706 

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

708 
lemmas max_of_mono and min_of_mono with this predicate. 

709 
INCOMPATIBILITY. 

710 

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

712 
with new class dense_linear_order. 

713 

714 
* Uniform lattice theory development in HOL. 

715 

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

717 
constant "Meet" now named "Inf" 

718 

719 
classes "meet_semilorder" and "join_semilorder" now named 

720 
"lower_semilattice" and "upper_semilattice" 

721 
class "lorder" now named "lattice" 

722 
class "comp_lat" now named "complete_lattice" 

723 

724 
Instantiation of lattice classes allows explicit definitions 

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

726 

727 
INCOMPATIBILITY. Theorem renames: 

728 

729 
meet_left_le ~> inf_le1 

730 
meet_right_le ~> inf_le2 

731 
join_left_le ~> sup_ge1 

732 
join_right_le ~> sup_ge2 

733 
meet_join_le ~> inf_sup_ord 

734 
le_meetI ~> le_infI 

735 
join_leI ~> le_supI 

736 
le_meet ~> le_inf_iff 

737 
le_join ~> ge_sup_conv 

738 
meet_idempotent ~> inf_idem 

739 
join_idempotent ~> sup_idem 

740 
meet_comm ~> inf_commute 

741 
join_comm ~> sup_commute 

742 
meet_leI1 ~> le_infI1 

743 
meet_leI2 ~> le_infI2 

744 
le_joinI1 ~> le_supI1 

745 
le_joinI2 ~> le_supI2 

746 
meet_assoc ~> inf_assoc 

747 
join_assoc ~> sup_assoc 

748 
meet_left_comm ~> inf_left_commute 

749 
meet_left_idempotent ~> inf_left_idem 

750 
join_left_comm ~> sup_left_commute 

751 
join_left_idempotent ~> sup_left_idem 

752 
meet_aci ~> inf_aci 

753 
join_aci ~> sup_aci 

754 
le_def_meet ~> le_iff_inf 

755 
le_def_join ~> le_iff_sup 

756 
join_absorp2 ~> sup_absorb2 

757 
join_absorp1 ~> sup_absorb1 

758 
meet_absorp1 ~> inf_absorb1 

759 
meet_absorp2 ~> inf_absorb2 

760 
meet_join_absorp ~> inf_sup_absorb 

761 
join_meet_absorp ~> sup_inf_absorb 

762 
distrib_join_le ~> distrib_sup_le 

763 
distrib_meet_le ~> distrib_inf_le 

764 

765 
add_meet_distrib_left ~> add_inf_distrib_left 

766 
add_join_distrib_left ~> add_sup_distrib_left 

767 
is_join_neg_meet ~> is_join_neg_inf 

768 
is_meet_neg_join ~> is_meet_neg_sup 

769 
add_meet_distrib_right ~> add_inf_distrib_right 

770 
add_join_distrib_right ~> add_sup_distrib_right 

771 
add_meet_join_distribs ~> add_sup_inf_distribs 

772 
join_eq_neg_meet ~> sup_eq_neg_inf 

773 
meet_eq_neg_join ~> inf_eq_neg_sup 

774 
add_eq_meet_join ~> add_eq_inf_sup 

775 
meet_0_imp_0 ~> inf_0_imp_0 

776 
join_0_imp_0 ~> sup_0_imp_0 

777 
meet_0_eq_0 ~> inf_0_eq_0 

778 
join_0_eq_0 ~> sup_0_eq_0 

779 
neg_meet_eq_join ~> neg_inf_eq_sup 

780 
neg_join_eq_meet ~> neg_sup_eq_inf 

781 
join_eq_if ~> sup_eq_if 

782 

783 
mono_meet ~> mono_inf 

784 
mono_join ~> mono_sup 

785 
meet_bool_eq ~> inf_bool_eq 

786 
join_bool_eq ~> sup_bool_eq 

787 
meet_fun_eq ~> inf_fun_eq 

788 
join_fun_eq ~> sup_fun_eq 

789 
meet_set_eq ~> inf_set_eq 

790 
join_set_eq ~> sup_set_eq 

791 
meet1_iff ~> inf1_iff 

792 
meet2_iff ~> inf2_iff 

793 
meet1I ~> inf1I 

794 
meet2I ~> inf2I 

795 
meet1D1 ~> inf1D1 

796 
meet2D1 ~> inf2D1 

797 
meet1D2 ~> inf1D2 

798 
meet2D2 ~> inf2D2 

799 
meet1E ~> inf1E 

800 
meet2E ~> inf2E 

801 
join1_iff ~> sup1_iff 

802 
join2_iff ~> sup2_iff 

803 
join1I1 ~> sup1I1 

804 
join2I1 ~> sup2I1 

805 
join1I1 ~> sup1I1 

806 
join2I2 ~> sup1I2 

807 
join1CI ~> sup1CI 

808 
join2CI ~> sup2CI 

809 
join1E ~> sup1E 

810 
join2E ~> sup2E 

811 

812 
is_meet_Meet ~> is_meet_Inf 

813 
Meet_bool_def ~> Inf_bool_def 

814 
Meet_fun_def ~> Inf_fun_def 

815 
Meet_greatest ~> Inf_greatest 

816 
Meet_lower ~> Inf_lower 

817 
Meet_set_def ~> Inf_set_def 

818 

819 
Sup_def ~> Sup_Inf 

820 
Sup_bool_eq ~> Sup_bool_def 

821 
Sup_fun_eq ~> Sup_fun_def 

822 
Sup_set_eq ~> Sup_set_def 

823 

824 
listsp_meetI ~> listsp_infI 

825 
listsp_meet_eq ~> listsp_inf_eq 

826 

827 
meet_min ~> inf_min 

828 
join_max ~> sup_max 

829 

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

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

832 

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

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

25184  836 
"*.size". 
837 

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

839 
INCOMPATIBILITY. 

24800  840 

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

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

843 
fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY. 

844 

25129  845 
* HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY. 
846 

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

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

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

851 
lemmas on overflow and monotonicity. Instantiated to all appropriate 

852 
arithmetic type classes, supporting automatic simplification of 

853 
numerals on all operations. 

24333  854 

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

856 

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

858 

23850  859 
* Code generator library theories: 
24993  860 
 Code_Integer represents HOL integers by big integer literals in target 
23850  861 
languages. 
24993  862 
 Code_Char represents HOL characters by character literals in target 
23850  863 
languages. 
24993  864 
 Code_Char_chr like Code_Char, but also offers treatment of character 
865 
codes; includes Code_Integer. 

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

23850  868 
denominator). 
24800  869 
 Executable_Real implements a subset of real numbers, namly those 
23850  870 
representable by rational numbers. 
24800  871 
 Efficient_Nat implements natural numbers by integers, which in general will 
23850  872 
result in higher efficency; pattern matching with 0/Suc is eliminated; 
24993  873 
includes Code_Integer. 
874 
 Code_Index provides an additional datatype index which is mapped to 

875 
targetlanguage builtin integers. 

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

877 
strings; messages are mapped to targetlanguage strings. 

23850  878 

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

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

880 

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

881 
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

882 

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

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

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

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

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

887 
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

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

889 

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

891 

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

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

893 

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

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

895 
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

896 

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

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

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

899 
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

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

901 

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

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

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

904 

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

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

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

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

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

909 
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

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

913 

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

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

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

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

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

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

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

920 
 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

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

922 

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

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

924 

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

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

929 

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

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

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

934 
than before the actual inductive definition. 

935 

936 
 The variables in induction and elimination rules are now 

937 
quantified in the order of their occurrence in the introduction 

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

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

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

941 
statements of the form 

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

942 

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

943 
case (rule_i a_i_1 ... a_i_{k_i}) 
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 
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

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

947 

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

948 
 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

949 

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

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

951 

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

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

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

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

955 

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

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

957 

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

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

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

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

961 

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

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

963 

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

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

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

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

967 

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

970 
rule) before the above elimination rule is applicable. 

971 

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

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

974 
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

975 

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

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

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

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

981 
users are encouraged to use the new package. 

982 

983 
* Method "lexicographic_order" automatically synthesizes termination 

984 
relations as lexicographic combinations of size measures. 

985 

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

988 
programming. Internally, this is translated into nested 

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

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

991 
the original input but the internal form. Lambdaabstractions allow 

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

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

994 
variable. 

23564  995 

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

999 
previously. Potential INCOMPATIBILITY: 

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

23377  1002 

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

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

1006 
a specific type involves instantiating the locale and possibly adding 

1007 
declarations for computation on the coefficients. The method is 

1008 
already instantiated for natural numbers and for the axiomatic class 

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

1010 
CALCULEMUS 2007 for the general principles underlying this 

1011 
architecture of contextaware prooftools. 

1012 

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

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

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

1017 
rat, etc. 

1018 

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

1021 
circumvent possible incompatibilities when working on ML level. 

1022 

24996  1023 
* primrec: missing cases mapped to "undefined" instead of "arbitrary". 
22845  1024 

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

1027 

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

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

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

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

1033 
comprehension syntax, and for uniformity. INCOMPATIBILITY. 

1034 

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

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

1037 
INCOMPATIBILITY. 

1038 

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

1040 

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

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

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

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

1046 
positive/negative (in inequations). 

23480  1047 

1048 
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib 

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

1051 
because they were subsumed by lemmas xyz. INCOMPATIBILITY. 

1052 

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

22735  1056 

24800  1057 
* Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq. 
22218  1058 
INCOMPATIBILITY. 
1059 

24800  1060 
* Dropped redundant lemma if_def2 in favor of if_bool_eq_conj. 
22218  1061 
INCOMPATIBILITY. 
1062 

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

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

1066 
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

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

1068 

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

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

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

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

1074 

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

1076 
commutative semirings. INCOMPATIBILITY: may need to incorporate 

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

1078 

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

1082 

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

1084 

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

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

1092 
 ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. 

1093 

25177  1094 
See src/HOL/Integ/IntArith.thy for an example setup. 
1095 

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

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

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

1099 
heavyduty computations because the functions are compiled to ML 

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

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

19895  1102 

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

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

1106 

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

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

21265  1111 

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

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

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

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

1116 

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

19377  1119 

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

1123 

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

1125 
True/False. 

1126 

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

19211  1128 

19279  1129 
* Theorem setsum_mult renamed to setsum_right_distrib. 
1130 

19211  1131 
* Prefer ex1I over ex_ex1I in singlestep reasoning, e.g. by the 
22126  1132 
``rule'' method. 
1133 

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

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

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

1138 

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

22126  1140 
zChaff is still supported as well. 
1141 

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

1143 
bundled as foo_bar.inducts; 

1144 

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

1146 
Library. 

21256  1147 

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

1149 

18446  1150 
* Library: added theory Coinductive_List of potentially infinite lists 
1151 
as greatest fixedpoint. 

18399  1152 

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

1155 

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

1158 
oracle) if it evaluates to True. 

20807  1159 

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

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

1163 
Configuration option fast_arith_split_limit=0 recovers the old 

1164 
behavior. 

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

1165 

22126  1166 
* Support for hex (0x20) and binary (0b1001) numerals. 
19254  1167 

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

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

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

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

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

1174 

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

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

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

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

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

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

25177  1181 
subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy. 
1182 

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

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

20807  1185 

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

1190 
in particular multiple inheritance and renaming of components. 

1191 

1192 

19653  1193 
*** HOLComplex *** 
1194 

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

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

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

1199 
INCOMPATIBILITY. 

1200 

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

1204 

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

1207 
defined as range of_real; potential INCOMPATIBILITY. 

1208 

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

23013  1210 
Reals are implemented as arbitrary precision rationals. 
1211 

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

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

1215 
INCOMPATIBILITY. 

21791  1216 

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

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

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

1219 
HInfinite :: ('a::real_normed_vector) star set 
21791  1220 
approx :: ('a::real_normed_vector) star => 'a star => bool 
1221 
monad :: ('a::real_normed_vector) star => 'a star set 

1222 
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

1223 
(NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool 
21791  1224 
(NS)convergent :: (nat => 'a::real_normed_vector) => bool 
1225 
(NS)Bseq :: (nat => 'a::real_normed_vector) => bool 

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

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

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

1229 
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

1230 
sgn :: 'a::real_normed_vector => 'a 
23116  1231 
exp :: 'a::{recpower,real_normed_field,banach} => 'a 
21791  1232 

1233 
* Complex: Some complexspecific constants are now abbreviations for 

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

1236 
polymorphic versions (INCOMPATIBILITY): 

21791  1237 

1238 
approx < capprox 

1239 
HFinite < CFinite 

1240 
HInfinite < CInfinite 

1241 
Infinitesimal < CInfinitesimal 

1242 
monad < cmonad 

1243 
galaxy < cgalaxy 

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

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

1246 
(ns)deriv < (ns)cderiv 

1247 

19653  1248 

24801  1249 
*** HOLAlgebra *** 
1250 

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

1252 

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

1254 
INCOMPATIBILITY. 

1255 

1256 
* Renamed lemmas least_carrier > least_closed and greatest_carrier > 

1257 
greatest_closed. INCOMPATIBILITY. 

1258 

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

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

1261 
of algebraic structures. 

1262 

1263 
* Renamed theory CRing to Ring. 

1264 

1265 

1266 
*** HOLNominal *** 

1267 

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

25148  1271 
http://isabelle.in.tum.de/nominal/ 
1272 

24801  1273 

17878  1274 
*** ML *** 
1275 

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

1278 

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

1281 
compiletime. For example: 

1282 

25142  1283 
ML {* @{sort "{zero,one}"} *} 
22138  1284 
ML {* @{typ "'a => 'b"} *} 
1285 
ML {* @{term "%x. x"} *} 

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

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

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

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

1290 
ML {* @{thm asm_rl} *} 

1291 
ML {* @{thms asm_rl} *} 

24692  1292 
ML {* @{type_name c} *} 
25142  1293 
ML {* @{type_syntax c} *} 
22376  1294 
ML {* @{const_name c} *} 
1295 
ML {* @{const_syntax c} *} 

22138  1296 
ML {* @{context} *} 
1297 
ML {* @{theory} *} 

1298 
ML {* @{theory Pure} *} 

24692  1299 
ML {* @{theory_ref} *} 
1300 
ML {* @{theory_ref Pure} *} 

22138  1301 
ML {* @{simpset} *} 
1302 
ML {* @{claset} *} 

1303 
ML {* @{clasimpset} *} 

1304 

22151  1305 
The same works for sources being ``used'' within an Isar context. 
1306 

22152  1307 
* 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

1308 
ML_Context.trace enabled. 
22152  1309 

19032  1310 
* 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

1311 
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

1312 
admits slightly more efficient complex applications. 
18446  1313 

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

1316 

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

18737  1321 
* 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

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

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

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

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

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

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

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

1329 

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

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

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

1334 

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

1338 
potential INCOMPATIBILITY. 

19508  1339 

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

1341 
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

1342 
internally. See Pure/axclass.ML for the main internal interfaces  
19508  1343 
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

1344 
AxClass.axiomatize_class/classrel/arity supersede 
19508  1345 
Sign.add_classes/classrel/arities. 
1346 

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

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

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

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

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

1351 
attributes, methods, etc. 
18642  1352 

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

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

1356 
fold_map combinators. 

18051  1357 

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

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

1359 
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

1360 
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

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

1362 

18020  1363 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  1364 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  1365 
achieve the old behaviour. 
1366 

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

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

1369 
statements. 

1370 

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

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

1372 
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

1373 
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

1374 

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

1377 
some popular functions from term.ML: 

1378 

1379 
Term.variant > Name.variant 

24800  1380 
Term.variantlist > Name.variant_list 
20090  1381 
Term.invent_names > Name.invent_list 
1382 

1383 
Note that lowlevel renaming rarely occurs in new code  operations 

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

1385 

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

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

1387 
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
changeset

1388 
Variable.import introduces fixes for schematics of given facts and 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1389 
Variable.export reverses the effect (up to renaming)  this replaces 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

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

1391 

18567  1392 
* Pure: structure Goal provides simple interfaces for 
17981
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

1393 
init/conclude/finish and tactical prove operations (replacing former 
20040
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1394 
Tactic.prove). Goal.prove is the canonical way to prove results 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1395 
within a given context; Goal.prove_global is a degraded version for 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1396 
theory level goals, including a global Drule.standard. Note that 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1397 
OldGoals.prove_goalw_cterm has long been obsolete, since it is 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1398 
illbehaved in a local proof context (e.g. with local fixes/assumes or 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

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

1400 

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

1401 
* Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.) 
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset

1402 
and type checking (Syntax.check_term etc.), with common combinations 
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset

1403 
(Syntax.read_term etc.). These supersede former Sign.read_term etc. 
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset

1404 
which are considered legacy and await removal. 
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset

1405 

24920  1406 
* Pure/Syntax: generic interfaces for type unchecking 
1407 
(Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.), 

1408 
with common combinations (Syntax.pretty_term, Syntax.string_of_term 

1409 
etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still 

24924 