author  haftmann 
Thu, 25 Oct 2007 10:24:32 +0200  
changeset 25184  712ab7bd9512 
parent 25177  f9ced25685e0 
child 25198  1e904070e9cb 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

24801  4 
New in Isabelle2007 
5 
 

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

6 

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

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

8 

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

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

22826  13 

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

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

15 
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

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

17 

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

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

19 
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

20 
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

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

22 

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

25 
quotes. 

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

26 

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

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

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

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

30 
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

31 
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

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

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

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

35 
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

36 

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

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

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

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

41 
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

42 
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

43 

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

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

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

48 

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

50 
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

51 
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

52 
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

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

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

55 

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

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

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

60 
ambiguities introduced later on. INCOMPATIBILITY: constants in parse 

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

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

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

64 

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

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

66 
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

67 
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

68 
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

69 
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

70 
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

71 
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

72 

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

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

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

75 
support a specific search form (see ProofGeneral/CHANGES). 
22965  76 

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

79 
suppressed from proof state output. Note that the ProofGeneral 

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

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

82 
limit is imposed. 

83 

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

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

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

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

87 
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

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

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

90 

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

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

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

93 

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

94 

17865  95 
*** Document preparation *** 
96 

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

99 
current context. 

21339  100 

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

17865  103 

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

21735  106 
arguments may be given on the LHS.) 
21717  107 

108 

17865  109 

17779  110 
*** Pure *** 
111 

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

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

116 
constants with qualified polymorphism (according to the class 

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

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

119 
between global polymorphic consts and internal locale representation. 

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

123 
* Yet another code generator framework allows to generate executable 

24800  124 
code for ML and Haskell (including Isabelle classes). A short usage 
125 
sketch: 

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

126 

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

127 
internal compilation: 
23850  128 
code_gen <list of constants (term syntax)> in SML 
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

129 
writing SML code to a file: 
23850  130 
code_gen <list of constants (term syntax)> in SML <filename> 
22735  131 
writing OCaml code to a file: 
23850  132 
code_gen <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

133 
writing Haskell code to a bunch of files: 
23850  134 
code_gen <list of constants (term syntax)> in Haskell <filename> 
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

135 

25184  136 
evaluating propositions to True/False using code generation: 
137 
method ``eval'' 

138 

139 
Reasonable default setup of framework in HOL. 

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

140 

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

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

142 

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

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

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

147 

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

149 

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

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

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

152 

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

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

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

155 

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

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

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

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

159 

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

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

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

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

163 

22735  164 
code_instance and code_class only apply to target Haskell. 
165 

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

24800  168 
generation from Isabelle/HOL theories is available via "isatool doc 
169 
codegen". 

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

170 

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

173 
annotations). 

174 

19254  175 
* Command 'no_translations' removes translation rules from theory 
176 
syntax. 

177 

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

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

181 
correspondence to type class and instance declarations. 

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

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

19711  184 

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

186 
instantiation that matches an instance against the most general 

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

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

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

190 
recursion over such type arguments. Incomplete specification patterns 

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

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

195 

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

198 
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

199 
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

200 
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

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

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

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

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

205 
toplevel undo/redo and fail to work with multithreading. 
24086  206 

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

207 
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

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

209 

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

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

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

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

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

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

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

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

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

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

219 

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

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

224 
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

225 
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

226 
order. 
24086  227 

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

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

231 
difference of the original declaration context wrt. the application 

232 
context encountered later on. 

233 

234 
* Isar: proper interfaces for simplification procedures. Command 

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

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

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

238 

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

240 
abbreviates a theorem reference involving an internal dummy fact, 

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

242 
the background context will persist. This form of inplace 

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

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

245 

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

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

247 
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

248 
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

249 
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

250 
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

251 
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

252 
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

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

254 

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

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

256 
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

257 
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

258 
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

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

260 

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

263 

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

265 
then guess x and y by clarify 

266 

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

268 
proof tools being involved here. 

269 

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

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

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

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

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

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

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

278 

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

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

18020  282 

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

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

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

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

287 

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

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

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

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

291 

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

294 

18308  295 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
296 

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

298 

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

301 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  302 
'unfolded' attribute may be replaced by firstclass proof text. 
303 

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

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

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

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

307 
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

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

309 

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

312 

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

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

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

318 
originally first one. 

19220  319 

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

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

321 
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

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

323 

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

326 
(essentially a disjunction of cases with local parameters and 

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

18910  328 
adequately; in this notation common elimination rules look like this: 
18901  329 

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

331 
assumes "EX x. P x" 

332 
obtains x where "P x" 

333 

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

335 
assumes "A & B" 

336 
obtains A and B 

337 

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

339 
assumes "A  B" 

340 
obtains 

341 
A 

342 
 B 

343 

18910  344 
The subsequent classical rules even refer to the formal "thesis" 
18901  345 
explicitly: 
346 

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

348 
obtains "~ thesis" 

349 

18910  350 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
351 
obtains "thesis ==> something" 

18901  352 

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

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

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

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

358 
case_names). 

18901  359 

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

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

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

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

363 
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

364 

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

367 
toplevel lemma. 

368 

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

371 

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

374 
to occur. 

375 

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

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

377 
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

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

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

380 

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

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

382 
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

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

384 

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

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

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

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

390 
current context. 

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

391 

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

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

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

396 

19665  397 
axiomatization 
21595  398 
eq (infix "===" 50) where 
399 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

400 

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

402 
definition g where "g x = f x x" 

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

403 

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

407 

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

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

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

19088  412 
parameters implicit and using the original short name. See also 
25177  413 
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic 
19083  414 
entities from a monomorphic theory. 
415 

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

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

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

420 
prevents folding of abbreviations in term output. 
19084  421 

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

422 
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

423 
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

424 
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

425 
'translations' with explicit "CONST" markup to accommodate this. 
19665  426 

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

429 
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

430 

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

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

432 

24738  433 
inductive conj for A B 
434 
where "A ==> B ==> conj A B" 

435 

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

438 
abbreviations on output. 

439 

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

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

443 
endomorphisms as locale endom = homom mult mult h. 

19783  444 

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

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

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

449 
predicates, goals repesenting already interpreted fragments are not 

450 
removed automatically. Use methods `intro_locales' and 

451 
`unfold_locales'; see below. 

452 

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

454 
provide backward reasoning on locales predicates. The methods are 

455 
aware of interpretations and discharge corresponding goals. 

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

457 
unfold predicates to assumptions. 

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

458 

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

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

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

462 

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

465 
unfolded in interpreted theorems. This is useful for replacing 

466 
defined concepts (constants depending on locale parameters) by 

467 
concepts already existing in the target context. Example: 

468 

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

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

471 

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

474 
partial_order. 

475 

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

479 
(using objectlogic connectives for this purpose has been long 

480 
obsolete anyway). Common proof patterns are explained in 

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

483 
examples. 

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

484 

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

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

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

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

490 

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

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

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

496 

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

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

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

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

501 

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

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

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

504 

24859  505 
* Method "coinduct": dual of induction, see 
18399  506 
src/HOL/Library/Coinductive_List.thy for various examples. 
507 

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

510 

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

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

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

513 

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

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

517 
trace indicates where parts have been suppressed. 

18674  518 

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

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

520 
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

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

522 

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

525 
least one premise. 

526 

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

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

531 

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

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

533 
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

534 
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

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

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

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

538 

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

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

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

541 
for example "A > B" => "Pi A (%_. B)". 
17779  542 

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

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

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

545 

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

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

548 

17865  549 

17806  550 
*** HOL *** 
551 

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

554 
Examples are in the directory MetisExamples. WARNING: the 

555 
Isabelle/HOLMetis integration does not yet work properly with 

556 
multithreading. 

557 

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

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

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

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

562 
work with multithreading. 

563 

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

566 
auto_quickcheck (default true) and auto_quickcheck_time_limit (default 

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

24804  569 

25184  570 
* New constant "undefined" with axiom "undefined x = undefined". 
571 

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

573 
equality. 

574 

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

576 
the new 'class' package: 

577 

578 
HOL.abs ~> HOL.abs_class.abs 

579 
HOL.divide ~> HOL.divide_class.divide 

580 
0 ~> HOL.zero_class.zero 

581 
1 ~> HOL.one_class.one 

582 
op + ~> HOL.plus_class.plus 

583 
op  ~> HOL.minus_class.minus 

584 
uminus ~> HOL.minus_class.uminus 

585 
op * ~> HOL.times_class.times 

586 
op < ~> HOL.ord_class.less 

587 
op <= > HOL.ord_class.less_eq 

588 
Nat.power ~> Power.power_class.power 

589 
Nat.size ~> Nat.size_class.size 

590 
Numeral.number_of ~> Numeral.number_class.number_of 

591 
FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf 

592 
FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup 

593 
Orderings.min ~> Orderings.ord_class.min 

594 
Orderings.max ~> Orderings.ord_class.max 

595 
Divides.op div ~> Divides.div_class.div 

596 
Divides.op mod ~> Divides.div_class.mod 

597 
Divides.op dvd ~> Divides.div_class.dvd 

598 

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

600 

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

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

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

604 
names. 

605 

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

607 
INCOMPATIBILITY: use more specific names. 

608 

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

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

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

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

613 
distribution). INCOMPATIBILITY: rewrite proofs 

614 

615 
d) ML code directly refering to constant names 

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

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

618 
Consider using @{const_name} antiquotation. 

619 

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

621 

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

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

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

625 
sgn_div_norm; ordered_idom now also inherits from sgn_if. 

626 
INCOMPATIBILITY. 

627 

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

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

630 

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

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

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

634 

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

636 
changed order of proof goals in instance proofs. 

637 

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

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

640 
in all contexts importing or interpreting the corresponding locales. 

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

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

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

644 
in the current context. 

645 

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

647 
lemmas max_of_mono and min_of_mono with this predicate. 

648 
INCOMPATIBILITY. 

649 

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

651 
with new class dense_linear_order. 

652 

653 
* Uniform lattice theory development in HOL. 

654 

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

656 
constant "Meet" now named "Inf" 

657 

658 
classes "meet_semilorder" and "join_semilorder" now named 

659 
"lower_semilattice" and "upper_semilattice" 

660 
class "lorder" now named "lattice" 

661 
class "comp_lat" now named "complete_lattice" 

662 

663 
Instantiation of lattice classes allows explicit definitions 

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

665 

666 
INCOMPATIBILITY. Theorem renames: 

667 

668 
meet_left_le ~> inf_le1 

669 
meet_right_le ~> inf_le2 

670 
join_left_le ~> sup_ge1 

671 
join_right_le ~> sup_ge2 

672 
meet_join_le ~> inf_sup_ord 

673 
le_meetI ~> le_infI 

674 
join_leI ~> le_supI 

675 
le_meet ~> le_inf_iff 

676 
le_join ~> ge_sup_conv 

677 
meet_idempotent ~> inf_idem 

678 
join_idempotent ~> sup_idem 

679 
meet_comm ~> inf_commute 

680 
join_comm ~> sup_commute 

681 
meet_leI1 ~> le_infI1 

682 
meet_leI2 ~> le_infI2 

683 
le_joinI1 ~> le_supI1 

684 
le_joinI2 ~> le_supI2 

685 
meet_assoc ~> inf_assoc 

686 
join_assoc ~> sup_assoc 

687 
meet_left_comm ~> inf_left_commute 

688 
meet_left_idempotent ~> inf_left_idem 

689 
join_left_comm ~> sup_left_commute 

690 
join_left_idempotent ~> sup_left_idem 

691 
meet_aci ~> inf_aci 

692 
join_aci ~> sup_aci 

693 
le_def_meet ~> le_iff_inf 

694 
le_def_join ~> le_iff_sup 

695 
join_absorp2 ~> sup_absorb2 

696 
join_absorp1 ~> sup_absorb1 

697 
meet_absorp1 ~> inf_absorb1 

698 
meet_absorp2 ~> inf_absorb2 

699 
meet_join_absorp ~> inf_sup_absorb 

700 
join_meet_absorp ~> sup_inf_absorb 

701 
distrib_join_le ~> distrib_sup_le 

702 
distrib_meet_le ~> distrib_inf_le 

703 

704 
add_meet_distrib_left ~> add_inf_distrib_left 

705 
add_join_distrib_left ~> add_sup_distrib_left 

706 
is_join_neg_meet ~> is_join_neg_inf 

707 
is_meet_neg_join ~> is_meet_neg_sup 

708 
add_meet_distrib_right ~> add_inf_distrib_right 

709 
add_join_distrib_right ~> add_sup_distrib_right 

710 
add_meet_join_distribs ~> add_sup_inf_distribs 

711 
join_eq_neg_meet ~> sup_eq_neg_inf 

712 
meet_eq_neg_join ~> inf_eq_neg_sup 

713 
add_eq_meet_join ~> add_eq_inf_sup 

714 
meet_0_imp_0 ~> inf_0_imp_0 

715 
join_0_imp_0 ~> sup_0_imp_0 

716 
meet_0_eq_0 ~> inf_0_eq_0 

717 
join_0_eq_0 ~> sup_0_eq_0 

718 
neg_meet_eq_join ~> neg_inf_eq_sup 

719 
neg_join_eq_meet ~> neg_sup_eq_inf 

720 
join_eq_if ~> sup_eq_if 

721 

722 
mono_meet ~> mono_inf 

723 
mono_join ~> mono_sup 

724 
meet_bool_eq ~> inf_bool_eq 

725 
join_bool_eq ~> sup_bool_eq 

726 
meet_fun_eq ~> inf_fun_eq 

727 
join_fun_eq ~> sup_fun_eq 

728 
meet_set_eq ~> inf_set_eq 

729 
join_set_eq ~> sup_set_eq 

730 
meet1_iff ~> inf1_iff 

731 
meet2_iff ~> inf2_iff 

732 
meet1I ~> inf1I 

733 
meet2I ~> inf2I 

734 
meet1D1 ~> inf1D1 

735 
meet2D1 ~> inf2D1 

736 
meet1D2 ~> inf1D2 

737 
meet2D2 ~> inf2D2 

738 
meet1E ~> inf1E 

739 
meet2E ~> inf2E 

740 
join1_iff ~> sup1_iff 

741 
join2_iff ~> sup2_iff 

742 
join1I1 ~> sup1I1 

743 
join2I1 ~> sup2I1 

744 
join1I1 ~> sup1I1 

745 
join2I2 ~> sup1I2 

746 
join1CI ~> sup1CI 

747 
join2CI ~> sup2CI 

748 
join1E ~> sup1E 

749 
join2E ~> sup2E 

750 

751 
is_meet_Meet ~> is_meet_Inf 

752 
Meet_bool_def ~> Inf_bool_def 

753 
Meet_fun_def ~> Inf_fun_def 

754 
Meet_greatest ~> Inf_greatest 

755 
Meet_lower ~> Inf_lower 

756 
Meet_set_def ~> Inf_set_def 

757 

758 
Sup_def ~> Sup_Inf 

759 
Sup_bool_eq ~> Sup_bool_def 

760 
Sup_fun_eq ~> Sup_fun_def 

761 
Sup_set_eq ~> Sup_set_def 

762 

763 
listsp_meetI ~> listsp_infI 

764 
listsp_meet_eq ~> listsp_inf_eq 

765 

766 
meet_min ~> inf_min 

767 
join_max ~> sup_max 

768 

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

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

771 

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

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

25184  775 
"*.size". 
776 

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

778 
INCOMPATIBILITY. 

24800  779 

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

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

782 
fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY. 

783 

25129  784 
* HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY. 
785 

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

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

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

790 
lemmas on overflow and monotonicity. Instantiated to all appropriate 

791 
arithmetic type classes, supporting automatic simplification of 

792 
numerals on all operations. 

24333  793 

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

795 

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

797 

23850  798 
* Code generator library theories: 
24993  799 
 Code_Integer represents HOL integers by big integer literals in target 
23850  800 
languages. 
24993  801 
 Code_Char represents HOL characters by character literals in target 
23850  802 
languages. 
24993  803 
 Code_Char_chr like Code_Char, but also offers treatment of character 
804 
codes; includes Code_Integer. 

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

23850  807 
denominator). 
24800  808 
 Executable_Real implements a subset of real numbers, namly those 
23850  809 
representable by rational numbers. 
24800  810 
 Efficient_Nat implements natural numbers by integers, which in general will 
23850  811 
result in higher efficency; pattern matching with 0/Suc is eliminated; 
24993  812 
includes Code_Integer. 
813 
 Code_Index provides an additional datatype index which is mapped to 

814 
targetlanguage builtin integers. 

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

816 
strings; messages are mapped to targetlanguage strings. 

23850  817 

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

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

819 

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

820 
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

821 

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

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

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

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

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

826 
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

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

828 

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

830 

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

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

832 

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

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

834 
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

835 

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

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

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

838 
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

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

840 

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

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

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

843 

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

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

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

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

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

848 
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

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

850 

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

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

852 

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

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

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

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

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

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

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

859 
 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

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

861 

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

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

863 

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

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

866 

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

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

868 

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

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

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

873 
than before the actual inductive definition. 

874 

875 
 The variables in induction and elimination rules are now 

876 
quantified in the order of their occurrence in the introduction 

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

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

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

880 
statements of the form 

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

881 

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

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

883 

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

884 
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

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

886 

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

887 
 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

888 

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

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

890 

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

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

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

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

894 

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

895 
for predicates and 
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 
(x_1, ..., x_n) : s z_1 ... z_m ==> 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

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

899 
==> ... ==> P 
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 
for sets rather than 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

902 

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

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

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

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

906 

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

909 
rule) before the above elimination rule is applicable. 

910 

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

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

913 
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

914 

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

917 
programming. Internally, this is translated into nested 

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

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

920 
the original input but the internal form. Lambdaabstractions allow 

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

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

923 
variable. 

23564  924 

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

928 
previously. Potential INCOMPATIBILITY: 

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

23377  931 

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

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

935 
a specific type involves instantiating the locale and possibly adding 

936 
declarations for computation on the coefficients. The method is 

937 
already instantiated for natural numbers and for the axiomatic class 

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

939 
CALCULEMUS 2007 for the general principles underlying this 

940 
architecture of contextaware prooftools. 

941 

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

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

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

946 
rat, etc. 

947 

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

950 
circumvent possible incompatibilities when working on ML level. 

951 

24996  952 
* primrec: missing cases mapped to "undefined" instead of "arbitrary". 
22845  953 

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

956 

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

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

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

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

962 
comprehension syntax, and for uniformity. INCOMPATIBILITY. 

963 

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

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

966 
INCOMPATIBILITY. 

967 

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

969 

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

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

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

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

975 
positive/negative (in inequations). 

23480  976 

977 
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib 

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

980 
because they were subsumed by lemmas xyz. INCOMPATIBILITY. 

981 

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

22735  985 

24800  986 
* Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq. 
22218  987 
INCOMPATIBILITY. 
988 

24800  989 
* Dropped redundant lemma if_def2 in favor of if_bool_eq_conj. 
22218  990 
INCOMPATIBILITY. 
991 

24800  992 
* Method "lexicographic_order" automatically synthesizes termination 
993 
relations as lexicographic combinations of size measures  'function' 

994 
package. 

22126  995 

996 
* HOL/records: generalised fieldupdate to take a function on the 

997 
field rather than the new value: r(A := x) is translated to A_update 

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

999 
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

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

1001 

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

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

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

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

1007 

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

1009 
commutative semirings. INCOMPATIBILITY: may need to incorporate 

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

1011 

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

1015 

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

1017 

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

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

1025 
 ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. 

1026 

25177  1027 
See src/HOL/Integ/IntArith.thy for an example setup. 
1028 

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

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

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

1032 
heavyduty computations because the functions are compiled to ML 

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

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

19895  1035 

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

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

1039 

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

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

21265  1044 

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

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

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

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

1049 

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

19377  1052 

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

1056 

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

1058 
True/False. 

1059 

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

19211  1061 

19279  1062 
* Theorem setsum_mult renamed to setsum_right_distrib. 
1063 

19211  1064 
* Prefer ex1I over ex_ex1I in singlestep reasoning, e.g. by the 
22126  1065 
``rule'' method. 
1066 

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

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

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

1071 

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

22126  1073 
zChaff is still supported as well. 
1074 

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

1076 
bundled as foo_bar.inducts; 

1077 

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

1079 
Library. 

21256  1080 

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

1082 

18446  1083 
* Library: added theory Coinductive_List of potentially infinite lists 
1084 
as greatest fixedpoint. 

18399  1085 

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

1088 

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

1091 
oracle) if it evaluates to True. 

20807  1092 

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

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

1096 
Configuration option fast_arith_split_limit=0 recovers the old 

1097 
behavior. 

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

1098 

22126  1099 
* Support for hex (0x20) and binary (0b1001) numerals. 
19254  1100 

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

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

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

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

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

1107 

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

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

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

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

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

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

25177  1114 
subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy. 
1115 

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

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

20807  1118 

1119 

19653  1120 
*** HOLComplex *** 
1121 

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

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

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

1126 
INCOMPATIBILITY. 

1127 

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

1131 

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

1134 
defined as range of_real; potential INCOMPATIBILITY. 

1135 

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

23013  1137 
Reals are implemented as arbitrary precision rationals. 
1138 

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

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

1142 
INCOMPATIBILITY. 

21791  1143 

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

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

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

1146 
HInfinite :: ('a::real_normed_vector) star set 
21791  1147 
approx :: ('a::real_normed_vector) star => 'a star => bool 
1148 
monad :: ('a::real_normed_vector) star => 'a star set 

1149 
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

1150 
(NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool 
21791  1151 
(NS)convergent :: (nat => 'a::real_normed_vector) => bool 
1152 
(NS)Bseq :: (nat => 'a::real_normed_vector) => bool 

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

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

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

1156 
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

1157 
sgn :: 'a::real_normed_vector => 'a 
23116  1158 
exp :: 'a::{recpower,real_normed_field,banach} => 'a 
21791  1159 

1160 
* Complex: Some complexspecific constants are now abbreviations for 

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

1163 
polymorphic versions (INCOMPATIBILITY): 

21791  1164 

1165 
approx < capprox 

1166 
HFinite < CFinite 

1167 
HInfinite < CInfinite 

1168 
Infinitesimal < CInfinitesimal 

1169 
monad < cmonad 

1170 
galaxy < cgalaxy 

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

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

1173 
(ns)deriv < (ns)cderiv 

1174 

19653  1175 

24801  1176 
*** HOLAlgebra *** 
1177 

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

1179 

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

1181 
INCOMPATIBILITY. 

1182 

1183 
* Renamed lemmas least_carrier > least_closed and greatest_carrier > 

1184 
greatest_closed. INCOMPATIBILITY. 

1185 

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

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

1188 
of algebraic structures. 

1189 

1190 
* Renamed theory CRing to Ring. 

1191 

1192 

1193 
*** HOLNominal *** 

1194 

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

25148  1198 
http://isabelle.in.tum.de/nominal/ 
1199 

24801  1200 

17878  1201 
*** ML *** 
1202 

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

1205 

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

1208 
compiletime. For example: 

1209 

25142  1210 
ML {* @{sort "{zero,one}"} *} 
22138  1211 
ML {* @{typ "'a => 'b"} *} 
1212 
ML {* @{term "%x. x"} *} 

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

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

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

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

1217 
ML {* @{thm asm_rl} *} 

1218 
ML {* @{thms asm_rl} *} 

24692  1219 
ML {* @{type_name c} *} 
25142  1220 
ML {* @{type_syntax c} *} 
22376  1221 
ML {* @{const_name c} *} 
1222 
ML {* @{const_syntax c} *} 

22138  1223 
ML {* @{context} *} 
1224 
ML {* @{theory} *} 

1225 
ML {* @{theory Pure} *} 

24692  1226 
ML {* @{theory_ref} *} 
1227 
ML {* @{theory_ref Pure} *} 

22138  1228 
ML {* @{simpset} *} 
1229 
ML {* @{claset} *} 

1230 
ML {* @{clasimpset} *} 

1231 

22151  1232 
The same works for sources being ``used'' within an Isar context. 
1233 

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

1235 
ML_Context.trace enabled. 
22152  1236 

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

1238 
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

1239 
admits slightly more efficient complex applications. 
18446  1240 

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

1243 

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

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

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

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

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

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

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

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

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

1256 

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

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

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

1261 

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

1265 
potential INCOMPATIBILITY. 

19508  1266 

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

1268 
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

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

1271 
AxClass.axiomatize_class/classrel/arity supersede 
19508  1272 
Sign.add_classes/classrel/arities. 
1273 

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

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

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

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

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

1278 
attributes, methods, etc. 
18642  1279 

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

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

1283 
fold_map combinators. 

18051  1284 

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

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

1286 
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

1287 
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

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

1289 

18020  1290 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  1291 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  1292 
achieve the old behaviour. 
1293 

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

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

1296 
statements. 

1297 

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

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

1299 
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

1300 
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

1301 

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

1304 
some popular functions from term.ML: 

1305 

1306 
Term.variant > Name.variant 

24800  1307 
Term.variantlist > Name.variant_list 
20090  1308 
Term.invent_names > Name.invent_list 
1309 

1310 
Note that lowlevel renaming rarely occurs in new code  operations 

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

1312 

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

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

1314 
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

1315 
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

1316 
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

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

1318 

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

1320 
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

1321 
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

1322 
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

1323 
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

1324 
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

1325 
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

1326 
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

1327 

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

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

1329 
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

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

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

1332 

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

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

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

24924  1337 
available for convenience, but refer to the very same operations using 
1338 
a mere theory instead of a full context. 

24920  1339 

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

1340 
* Isar: simplified treatment of userlevel errors, using exception 
18687  1341 
ERROR of string uniformly. Function error now merely raises ERROR, 
18686
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

1342 
without any side effect on output channels. The Isar toplevel takes 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

1343 
care of proper display of ERROR exceptions. ML code may use plain 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

1344 
handle/can/try; cat_error may be used to concatenate errors like this: 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

1345 

cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

1346 
... handle ERROR msg => cat_error msg "..." 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

1347 

cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

1348 
Toplevel ML code (run directly or through the Isar toplevel) may be 
18687  1349 
embedded into the Isar toplevel with exception display/debug like 
1350 
this: 

18686
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

1351 

cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

1352 
Isar.toplevel (fn () => ...) 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

1353 

cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

1354 
INCOMPATIBILITY, removed special transform_error facilities, removed 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

1355 
obsolete variants of userlevel exceptions (ERROR_MESSAGE, 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

1356 
Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL) 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

1357 
 use plain ERROR instead. 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

1358 

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

1359 
* Isar: theory setup now has type (theory > theory), instead of a 
18722
0888eca0f1be
* ML/Isar: theory setup has type (theory > theory);
wenzelm
parents:
18696
diff
changeset

1360 
list. INCOMPATIBILITY, may use #> to compose setup functions. 
0888eca0f1be
* ML/Isar: theory setup has type (theory > theory);
wenzelm
parents:
18696
diff
changeset

1361 

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

1362 
* Isar: ML toplevel pretty printer for type Proof.context, subject to 
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset

1363 
ProofContext.debug/verbose flags. 
18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

1364 

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

1365 
* Isar: Toplevel.theory_to_proof admits transactions that modify the 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

1366 
theory before entering a proof state. Transactions now always see a 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

1367 
quasifunctional intermediate checkpoint, both in interactive and 
18590
f6a553aa3d81
Pure/Isar: Toplevel.theory_to_proof admits transactions that modify the theory;
wenzelm
parents:
18568
diff
changeset

1368 
batch mode. 
18567  1369 

24867  1370 
* Isar: simplified interfaces for outer syntax. Renamed 
1371 
OuterSyntax.add_keywords to OuterSyntax.keywords. Removed 

1372 
OuterSyntax.add_parsers  this functionality is now included in 

1373 
OuterSyntax.command etc. INCOMPATIBILITY. 

1374 

17878  1375 
* Simplifier: the simpset of a running simplification process now 
1376 
contains a proof context (cf. Simplifier.the_context), which is the 

1377 
very context that the initial simpset has been retrieved from (by 

17890  1378 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  1379 
(solver, looper etc.) may depend on arbitrary proof data. 
1380 

1381 
* Simplifier.inherit_context inherits the proof context (plus the 

1382 
local bounds) of the current simplification process; any simproc 

1383 
etc. that calls the Simplifier recursively should do this! Removed 

1384 
former Simplifier.inherit_bounds, which is already included here  

17890  1385 
INCOMPATIBILITY. Tools based on lowlevel rewriting may even have to 
1386 
specify an explicit context using Simplifier.context/theory_context. 

17878  1387 

1388 
* Simplifier/Classical Reasoner: more abstract interfaces 

1389 
change_simpset/claset for modifying the simpset/claset reference of a 

1390 
theory; raw versions simpset/claset_ref etc. have been discontinued  

1391 
INCOMPATIBILITY. 

1392 

18540  1393 
* Provers: more generic wrt. syntax of objectlogics, avoid hardwired 
1394 
"Trueprop" etc. 

1395 

17878  1396 

20988
0887d0dd3210
* isabelleprocess: option S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset

1397 
*** System *** 
0887d0dd3210
* isabelleprocess: option S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset

1398 

21471
03a5ef1936c5
* settings: ML_IDENTIFIER includes the Isabelle version identifier;
wenzelm
parents:
21462
diff
changeset

1399 
* settings: ML_IDENTIFIER  which is appended to user specific heap 
03a5ef1936c5
* settings: ML_IDENTIFIER includes the Isabelle version identifier;
wenzelm
parents:
21462
diff
changeset

1400 
locations  now includes the Isabelle version identifier as well. 
03a5ef1936c5
* settings: ML_IDENTIFIER includes the Isabelle version identifier;
wenzelm
parents:
21462
diff
changeset

1401 
This simplifies use of multiple Isabelle installations. 
03a5ef1936c5
* settings: ML_IDENTIFIER includes the Isabelle version identifier;
wenzelm
parents:
21462
diff
changeset

1402 

20988
0887d0dd3210
* isabelleprocess: option S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset

1403 
* isabelleprocess: option S (secure mode) disables some critical 
0887d0dd3210
* isabelleprocess: option S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset

1404 
operations, notably runtime compilation and evaluation of ML source 
0887d0dd3210
* isabelleprocess: option S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset

1405 
code. 
0887d0dd3210
* isabelleprocess: option S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset

1406 

24891  1407 
* Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/. 
1408 

24801  1409 
* Support for parallel execution, using native multicore support of 
24800  1410 
Poly/ML 5.1. The theory loader exploits parallelism when processing 
1411 
independent theories, according to the given theory header 

1412 
specifications. The maximum number of worker threads is specified via 

1413 
usedir option M or the "maxthreads" setting in Proof General. A 

1414 
speedup factor of 1.53.5 can be expected on a 4core machine, and up 

1415 
to 6 on a 8core machine. Usercode needs to observe certain 
