author  paulson 
Fri, 05 Oct 2007 09:59:03 +0200  
changeset 24854  0ebcd575d3c6 
parent 24804  513bb015b469 
child 24859  9b9b1599fb89 
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 

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

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

57 
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

58 
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

59 
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

60 
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

61 
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

62 
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

63 

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

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

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

66 
support a specific search form (see ProofGeneral/CHANGES). 
22965  67 

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

70 
suppressed from proof state output. Note that the ProofGeneral 

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

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

73 
limit is imposed. 

74 

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

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

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

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

78 
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

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

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

81 

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

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

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

84 

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

85 

17865  86 
*** Document preparation *** 
87 

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

90 
current context. 

21339  91 

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

17865  94 

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

21735  97 
arguments may be given on the LHS.) 
21717  98 

99 

17865  100 

17779  101 
*** Pure *** 
102 

24800  103 
* Code generator: consts in 'consts_code' Isar commands are now 
104 
referred to by usual term syntax (including optional type 

105 
annotations). 

106 

107 
* Code generator: basic definitions (from 'definition', 'constdefs', 

108 
or primitive 'instance' definitions) are added automatically to the 

109 
table of defining equations. Primitive defs are not used as defining 

110 
equations by default any longer. defining equations are now definitly 

111 
restricted to meta "==" and object equality "=". 

112 

113 
* The 'class' package offers a combination of axclass and locale to 

22921
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22871
diff
changeset

114 
achieve Haskelllike type classes in Isabelle. See 
20807  115 
HOL/ex/Classpackage.thy for examples. 
116 

117 
* Yet another code generator framework allows to generate executable 

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

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

120 

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

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

123 
writing SML code to a file: 
23850  124 
code_gen <list of constants (term syntax)> in SML <filename> 
22735  125 
writing OCaml code to a file: 
23850  126 
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

127 
writing Haskell code to a bunch of files: 
23850  128 
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

129 

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

130 
Reasonable default setup of framework in HOL/Main. 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

131 

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

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

133 

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

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

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

138 

22735  139 
Userdefined serializations (target in {SML, OCaml, Haskell}): 
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 
code_const <andlist of constants (term syntax)> 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

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

143 

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

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

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

146 

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

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

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

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

150 

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

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

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

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

154 

22735  155 
code_instance and code_class only apply to target Haskell. 
156 

24800  157 
For example usage see HOL/ex/Codegenerator.thy and 
158 
HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code 

159 
generation from Isabelle/HOL theories is available via "isatool doc 

160 
codegen". 

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

161 

19254  162 
* Command 'no_translations' removes translation rules from theory 
163 
syntax. 

164 

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

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

168 
correspondence to type class and instance declarations. 

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

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

19711  171 

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

173 
instantiation that matches an instance against the most general 

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

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

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

177 
recursion over such type arguments. Incomplete specification patterns 

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

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

182 

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

185 
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

186 
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

187 
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

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

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

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

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

192 
toplevel undo/redo and fail to work with multithreading. 
24086  193 

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

194 
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

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

196 

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

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

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

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

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

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

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

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

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

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

206 

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

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

211 
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

212 
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

213 
order. 
24086  214 

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

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

218 
difference of the original declaration context wrt. the application 

219 
context encountered later on. 

220 

221 
* Isar: proper interfaces for simplification procedures. Command 

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

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

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

225 

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

227 
abbreviates a theorem reference involving an internal dummy fact, 

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

229 
the background context will persist. This form of inplace 

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

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

232 

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

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

234 
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

235 
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

236 
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

237 
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

238 
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

239 
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

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

241 

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

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

243 
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

244 
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

245 
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

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

247 

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

250 

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

252 
then guess x and y by clarify 

253 

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

255 
proof tools being involved here. 

256 

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

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

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

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

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

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

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

265 

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

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

18020  269 

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

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

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

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

274 

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

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

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

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

278 

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

281 

18308  282 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
283 

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

285 

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

288 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  289 
'unfolded' attribute may be replaced by firstclass proof text. 
290 

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

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

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

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

294 
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

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

296 

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

299 

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

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

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

305 
originally first one. 

19220  306 

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

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

308 
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

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

310 

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

313 
(essentially a disjunction of cases with local parameters and 

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

18910  315 
adequately; in this notation common elimination rules look like this: 
18901  316 

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

318 
assumes "EX x. P x" 

319 
obtains x where "P x" 

320 

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

322 
assumes "A & B" 

323 
obtains A and B 

324 

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

326 
assumes "A  B" 

327 
obtains 

328 
A 

329 
 B 

330 

18910  331 
The subsequent classical rules even refer to the formal "thesis" 
18901  332 
explicitly: 
333 

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

335 
obtains "~ thesis" 

336 

18910  337 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
338 
obtains "thesis ==> something" 

18901  339 

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

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

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

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

345 
case_names). 

18901  346 

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

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

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

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

350 
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

351 

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

354 
toplevel lemma. 

355 

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

358 

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

361 
to occur. 

362 

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

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

364 
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

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

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

367 

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

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

369 
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

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

371 

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

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

373 
primitive that also works in a locale context (both for constants and 
dbb8decc36bc
'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents:
21200
diff
changeset

374 
fixed variables). Type declaration and internal syntactic 
dbb8decc36bc
'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents:
21200
diff
changeset

375 
representation of given constants retrieved from the context. 
19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

376 

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

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

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

381 

19665  382 
axiomatization 
21595  383 
eq (infix "===" 50) where 
384 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

385 

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

387 
definition g where "g x = f x x" 

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

388 

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

392 

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

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

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

19088  397 
parameters implicit and using the original short name. See also 
19083  398 
HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic 
399 
entities from a monomorphic theory. 

400 

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

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

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

405 
prevents folding of abbreviations in term output. 
19084  406 

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

407 
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

408 
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

409 
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

410 
'translations' with explicit "CONST" markup to accommodate this. 
19665  411 

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

414 
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

415 

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

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

417 

24738  418 
inductive conj for A B 
419 
where "A ==> B ==> conj A B" 

420 

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

423 
abbreviations on output. 

424 

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

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

428 
endomorphisms as locale endom = homom mult mult h. 

19783  429 

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

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

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

434 
predicates, goals repesenting already interpreted fragments are not 

435 
removed automatically. Use methods `intro_locales' and 

436 
`unfold_locales'; see below. 

437 

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

439 
provide backward reasoning on locales predicates. The methods are 

440 
aware of interpretations and discharge corresponding goals. 

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

442 
unfold predicates to assumptions. 

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

443 

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

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

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

447 

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

450 
unfolded in interpreted theorems. This is useful for replacing 

451 
defined concepts (constants depending on locale parameters) by 

452 
concepts already existing in the target context. Example: 

453 

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

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

456 

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

459 
partial_order. 

460 

461 
* Provers/induct: improved internal context management to support 

462 
local fixes and defines onthefly. Thus explicit metalevel 

463 
connectives !! and ==> are rarely required anymore in inductive goals 

464 
(using objectlogic connectives for this purpose has been long 

465 
obsolete anyway). Common proof patterns are explained in 

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

466 
HOL/Induct/Common_Patterns.thy, see also HOL/Isar_examples/Puzzle.thy 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

467 
and src/HOL/Lambda for realistic examples. 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

468 

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

469 
* Provers/induct: improved handling of simultaneous goals. Instead of 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

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

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

472 
accordingly. INCOMPATIBILITY, proofs need to be structured explicitly, 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

473 
see HOL/Induct/Common_Patterns.thy, for example. 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

474 

24800  475 
* Provers/induct: mutual induction rules are now specified as a list 
476 
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

477 
foo_bar.inducts for mutually defined items foo and bar (e.g. inductive 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

478 
sets or datatypes). INCOMPATIBILITY, users need to specify mutual 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

479 
induction rules differently, i.e. like this: 
18506
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

480 

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

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

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

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

484 

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

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

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

487 

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

488 
* Provers/induct: support coinduction as well. See 
18399  489 
src/HOL/Library/Coinductive_List.thy for various examples. 
490 

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

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

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

493 

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

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

497 
trace indicates where parts have been suppressed. 

18674  498 

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

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

500 
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

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

502 

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

505 
least one premise. 

506 

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

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

511 

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

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

513 
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

514 
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

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

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

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

518 

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

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

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

521 
for example "A > B" => "Pi A (%_. B)". 
17779  522 

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

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

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

525 

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

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

528 

17865  529 

17806  530 
*** HOL *** 
531 

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

534 
auto_quickcheck (default true) and auto_quickcheck_time_limit (default 

535 
5000 milliseconds). 

536 

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

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

540 
"*.size" 

541 

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

543 
for locales "order" and "linorder" generated by the new class package 

544 
(instead of axiomatic type classes used before). Instances of the 

545 
reasoner are available in all contexts importing or interpreting these 

546 
locales. Method "order" invokes the reasoner separately; the reasoner 

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

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

549 
in the current context. 

550 

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

552 
with new class dense_linear_order. 

553 

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

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

556 
fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY. 

557 

558 
* HOLWord: New extensive library and type for generic, fixed size 

559 
machine words, with arithemtic, bitwise, shifting and rotating 

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

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

562 
lemmas on overflow and monotonicity. Instantiated to all appropriate 

563 
arithmetic type classes, supporting automatic simplification of 

564 
numerals on all operations. 

24333  565 

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

567 

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

569 

23850  570 
* Code generator library theories: 
24800  571 
 Pretty_Int represents HOL integers by big integer literals in target 
23850  572 
languages. 
24800  573 
 Pretty_Char represents HOL characters by character literals in target 
23850  574 
languages. 
24800  575 
 Pretty_Char_chr like Pretty_Char, but also offers treatment of character 
23850  576 
codes; includes Pretty_Int. 
24800  577 
 Executable_Set allows to generate code for finite sets using lists. 
578 
 Executable_Rat implements rational numbers as triples (sign, enumerator, 

23850  579 
denominator). 
24800  580 
 Executable_Real implements a subset of real numbers, namly those 
23850  581 
representable by rational numbers. 
24800  582 
 Efficient_Nat implements natural numbers by integers, which in general will 
23850  583 
result in higher efficency; pattern matching with 0/Suc is eliminated; 
584 
includes Pretty_Int. 

24800  585 
 ML_String provides an additional datatype ml_string; in the HOL default 
23850  586 
setup, strings in HOL are mapped to lists of HOL characters in SML; values 
587 
of type ml_string are mapped to strings in SML. 

24800  588 
 ML_Int provides an additional datatype ml_int which is mapped to to SML 
23850  589 
builtin integers. 
590 

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

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

592 

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

593 
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

594 

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

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

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

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

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

599 
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

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

601 

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

603 

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

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

605 

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

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

607 
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

608 

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

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

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

611 
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

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

613 

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

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

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

616 

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

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

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

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

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

621 
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

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

623 

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

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

625 

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

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

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

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

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

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

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

632 
 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

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

634 

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

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

636 

24800  637 
Numerous examples can be found in the subdirectories HOL/Auth, HOL/Bali, 
638 
HOL/Induct, and HOL/MicroJava. 

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

639 

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

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

641 

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

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

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

646 
than before the actual inductive definition. 

647 

648 
 The variables in induction and elimination rules are now 

649 
quantified in the order of their occurrence in the introduction 

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

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

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

653 
statements of the form 

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

654 

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

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

656 

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

657 
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

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

659 

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

660 
 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

661 

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

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

663 

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

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

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

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

667 

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

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

669 

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

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

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

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

673 

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

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

675 

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

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

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

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

679 

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

682 
rule) before the above elimination rule is applicable. 

683 

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

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

686 
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

687 

23562  688 
* Method "metis" proves goals by applying the Metis generalpurpose 
689 
resolution prover. Examples are in the directory MetisExamples. See 

690 
also http://gilith.com/software/metis/ 

24800  691 

692 
WARNING: the Isabelle/HOLMetis integration does not yet work properly 

693 
with multithreading. 

23449  694 

23562  695 
* Command 'sledgehammer' invokes external automatic theorem provers as 
696 
background processes. It generates calls to the "metis" method if 

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

698 
wait for the automatic provers to return. 

23449  699 

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

702 
programming. Internally, this is translated into nested 

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

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

705 
the original input but the internal form. Lambdaabstractions allow 

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

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

708 
variable. 

23564  709 

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

713 
previously. Potential INCOMPATIBILITY: 

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

23377  716 

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

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

720 
a specific type involves instantiating the locale and possibly adding 

721 
declarations for computation on the coefficients. The method is 

722 
already instantiated for natural numbers and for the axiomatic class 

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

724 
CALCULEMUS 2007 for the general principles underlying this 

725 
architecture of contextaware prooftools. 

726 

727 
* Former constant "List.op @" now named "List.append". Use ML 

728 
antiquotations @{const_name List.append} or @{term " ... @ ... "} to 

729 
circumvent possible incompatibilities when working on ML level. 

730 

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

732 
the new 'class' package: 

22997  733 

734 
HOL.abs ~> HOL.minus_class.abs 

735 
HOL.divide ~> HOL.divide_class.divide 

736 
Nat.power ~> Nat.power_class.power 

737 
Nat.size ~> Nat.size_class.size 

738 
Numeral.number_of ~> Numeral.number_class.number_of 

23129  739 
FixedPoint.Inf ~> FixedPoint.complete_lattice_class.Inf 
24342  740 
FixedPoint.Sup ~> FixedPoint.complete_lattice_class.Sup 
23129  741 
Orderings.min ~> Orderings.ord_class.min 
742 
Orderings.max ~> Orderings.ord_class.max 

22997  743 

24800  744 
* New class "default" with associated constant "default". 
745 

746 
* New constant "undefined" with axiom "undefined x = undefined". 

747 

23564  748 
* primrec: missing cases mapped to "undefined" instead of "arbitrary" 
22845  749 

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

752 

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

754 
[(x,y). x < xs, y < ys, x ~= y], see also HOL/List.thy. 

755 

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

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

758 
comprehension syntax, and for uniformity. INCOMPATIBILITY. 

759 

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

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

762 
INCOMPATIBILITY. 

763 

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

765 

766 
* New functions "sorted" and "sort" in HOL/List.thy. 

767 

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

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

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

771 
sgn_div_norm; ordered_idom now also inherits from sgn_if. 

772 
INCOMPATIBILITY. 

773 

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

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

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

777 
positive/negative (in inequations). 

23480  778 

779 
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib 

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

782 
because they were subsumed by lemmas xyz. INCOMPATIBILITY. 

783 

784 
* Library/Pretty_Int.thy: maps HOL numerals on target language integer 

785 
literals when generating code. 

786 

787 
* Library/Pretty_Char.thy: maps HOL characters on target language 

788 
character literals when generating code. 

789 

790 
* Library/Commutative_Ring.thy: switched from recdef to function 

791 
package; constants add, mul, pow now curried. Infix syntax for 

792 
algebraic operations. 

22735  793 

22450  794 
* Some steps towards more uniform lattice theory development in HOL. 
22422
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

795 

ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

796 
constants "meet" and "join" now named "inf" and "sup" 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

797 
constant "Meet" now named "Inf" 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

798 

22450  799 
classes "meet_semilorder" and "join_semilorder" now named 
800 
"lower_semilattice" and "upper_semilattice" 

801 
class "lorder" now named "lattice" 

802 
class "comp_lat" now named "complete_lattice" 

803 

804 
Instantiation of lattice classes allows explicit definitions 

24342  805 
for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices). 
22450  806 

23129  807 
INCOMPATIBILITY. Theorem renames: 
22450  808 

22422
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

809 
meet_left_le ~> inf_le1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

810 
meet_right_le ~> inf_le2 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

811 
join_left_le ~> sup_ge1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

812 
join_right_le ~> sup_ge2 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

813 
meet_join_le ~> inf_sup_ord 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

814 
le_meetI ~> le_infI 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

815 
join_leI ~> le_supI 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

816 
le_meet ~> le_inf_iff 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

817 
le_join ~> ge_sup_conv 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

818 
meet_idempotent ~> inf_idem 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

819 
join_idempotent ~> sup_idem 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

820 
meet_comm ~> inf_commute 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

821 
join_comm ~> sup_commute 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

822 
meet_leI1 ~> le_infI1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

823 
meet_leI2 ~> le_infI2 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

824 
le_joinI1 ~> le_supI1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

825 
le_joinI2 ~> le_supI2 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

826 
meet_assoc ~> inf_assoc 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

827 
join_assoc ~> sup_assoc 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

828 
meet_left_comm ~> inf_left_commute 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

829 
meet_left_idempotent ~> inf_left_idem 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

830 
join_left_comm ~> sup_left_commute 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

831 
join_left_idempotent ~> sup_left_idem 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

832 
meet_aci ~> inf_aci 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

833 
join_aci ~> sup_aci 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

834 
le_def_meet ~> le_iff_inf 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

835 
le_def_join ~> le_iff_sup 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

836 
join_absorp2 ~> sup_absorb2 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

837 
join_absorp1 ~> sup_absorb1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

838 
meet_absorp1 ~> inf_absorb1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

839 
meet_absorp2 ~> inf_absorb2 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

840 
meet_join_absorp ~> inf_sup_absorb 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

841 
join_meet_absorp ~> sup_inf_absorb 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

842 
distrib_join_le ~> distrib_sup_le 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

843 
distrib_meet_le ~> distrib_inf_le 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

844 

ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

845 
add_meet_distrib_left ~> add_inf_distrib_left 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

846 
add_join_distrib_left ~> add_sup_distrib_left 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

847 
is_join_neg_meet ~> is_join_neg_inf 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

848 
is_meet_neg_join ~> is_meet_neg_sup 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

849 
add_meet_distrib_right ~> add_inf_distrib_right 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

850 
add_join_distrib_right ~> add_sup_distrib_right 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

851 
add_meet_join_distribs ~> add_sup_inf_distribs 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

852 
join_eq_neg_meet ~> sup_eq_neg_inf 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

853 
meet_eq_neg_join ~> inf_eq_neg_sup 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

854 
add_eq_meet_join ~> add_eq_inf_sup 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

855 
meet_0_imp_0 ~> inf_0_imp_0 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

856 
join_0_imp_0 ~> sup_0_imp_0 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

857 
meet_0_eq_0 ~> inf_0_eq_0 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

858 
join_0_eq_0 ~> sup_0_eq_0 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

859 
neg_meet_eq_join ~> neg_inf_eq_sup 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

860 
neg_join_eq_meet ~> neg_sup_eq_inf 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

861 
join_eq_if ~> sup_eq_if 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

862 

ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

863 
mono_meet ~> mono_inf 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

864 
mono_join ~> mono_sup 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

865 
meet_bool_eq ~> inf_bool_eq 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

866 
join_bool_eq ~> sup_bool_eq 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

867 
meet_fun_eq ~> inf_fun_eq 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

868 
join_fun_eq ~> sup_fun_eq 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

869 
meet_set_eq ~> inf_set_eq 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

870 
join_set_eq ~> sup_set_eq 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

871 
meet1_iff ~> inf1_iff 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

872 
meet2_iff ~> inf2_iff 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

873 
meet1I ~> inf1I 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

874 
meet2I ~> inf2I 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

875 
meet1D1 ~> inf1D1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

876 
meet2D1 ~> inf2D1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

877 
meet1D2 ~> inf1D2 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

878 
meet2D2 ~> inf2D2 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

879 
meet1E ~> inf1E 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

880 
meet2E ~> inf2E 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

881 
join1_iff ~> sup1_iff 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

882 
join2_iff ~> sup2_iff 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

883 
join1I1 ~> sup1I1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

884 
join2I1 ~> sup2I1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

885 
join1I1 ~> sup1I1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

886 
join2I2 ~> sup1I2 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

887 
join1CI ~> sup1CI 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

888 
join2CI ~> sup2CI 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

889 
join1E ~> sup1E 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

890 
join2E ~> sup2E 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

891 

ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

892 
is_meet_Meet ~> is_meet_Inf 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

893 
Meet_bool_def ~> Inf_bool_def 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

894 
Meet_fun_def ~> Inf_fun_def 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

895 
Meet_greatest ~> Inf_greatest 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

896 
Meet_lower ~> Inf_lower 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

897 
Meet_set_def ~> Inf_set_def 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

898 

24342  899 
Sup_def ~> Sup_Inf 
900 
Sup_bool_eq ~> Sup_bool_def 

901 
Sup_fun_eq ~> Sup_fun_def 

902 
Sup_set_eq ~> Sup_set_def 

903 

22422
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

904 
listsp_meetI ~> listsp_infI 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

905 
listsp_meet_eq ~> listsp_inf_eq 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

906 

22450  907 
meet_min ~> inf_min 
908 
join_max ~> sup_max 

909 

24800  910 
* Renamed classes "order" and "linorder": facts "refl", "trans" and 
911 
"cases" to "order_refl", "order_trans" and "linorder_cases", to avoid 

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

913 

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

915 
changed order of proof goals instance proofs. 

916 

917 
* Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq. 

22218  918 
INCOMPATIBILITY. 
919 

24800  920 
* Dropped redundant lemma if_def2 in favor of if_bool_eq_conj. 
22218  921 
INCOMPATIBILITY. 
922 

22126  923 
* Added syntactic class "size"; overloaded constant "size" now has 
924 
type "'a::size ==> bool" 

925 

926 
* Renamed constants "Divides.op div", "Divides.op mod" and "Divides.op 

24800  927 
dvd" to "Divides.div_class.div", "Divides.div_class.mod" and 
928 
"Divides.dvd". INCOMPATIBILITY. 

929 

930 
* Method "lexicographic_order" automatically synthesizes termination 

931 
relations as lexicographic combinations of size measures  'function' 

932 
package. 

22126  933 

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

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

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

937 
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

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

939 

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

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

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

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

945 

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

947 
commutative semirings. INCOMPATIBILITY: may need to incorporate 

948 
commutativity or a semiring properties additionally. 

949 

950 
* Unified locale "partial_order" with class definition (cf. theory 

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

21215
7c9337a0e30a
made locale partial_order compatible with axclass order
haftmann
parents:
21209
diff
changeset

952 

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

956 

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

958 

959 
* Renamed constants "0" to "HOL.zero_class.zero" and "1" to 

960 
"HOL.one_class.one". INCOMPATIBILITY. 

961 

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

963 
equality. 

22126  964 

965 
* Numeral syntax: type 'bin' which was a mere type copy of 'int' has 

24800  966 
been abandoned in favour of plain 'int'. INCOMPATIBILITY  
22126  967 
significant changes for setting up numeral syntax for types: 
24800  968 
 New constants Numeral.pred and Numeral.succ instead 
20485  969 
of former Numeral.bin_pred and Numeral.bin_succ. 
970 
 Use integer operations instead of bin_add, bin_mult and so on. 

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

972 
 ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. 

973 

974 
See HOL/Integ/IntArith.thy for an example setup. 

975 

22126  976 
* New top level command 'normal_form' computes the normal form of a 
24800  977 
term that may contain free variables. For example ``normal_form 
22126  978 
"rev[a,b,c]"'' produces ``[b,c,a]'' (without proof). This command is 
979 
suitable for heavyduty computations because the functions are 

980 
compiled to ML first. 

19895  981 

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

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

985 

19279  986 
* Renamed constants in HOL.thy and Orderings.thy: 
22997  987 
op + ~> HOL.plus_class.plus 
988 
op  ~> HOL.minus_class.minus 

989 
uminus ~> HOL.minus_class.uminus 

23881  990 
abs ~> HOL.abs_class.abs 
22997  991 
op * ~> HOL.times_class.times 
23881  992 
op < ~> HOL.ord_class.less 
993 
op <= ~> HOL.ord_class.less_eq 

19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

994 

77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

995 
Adaptions may be required in the following cases: 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

996 

24800  997 
a) Userdefined constants using any of the names "plus", "minus", 
998 
"times", "less" or "less_eq". The standard syntax translations for 

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

1000 
names. 

19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

1001 

19277  1002 
b) Variables named "plus", "minus", "times", "less", "less_eq" 
19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

1003 
INCOMPATIBILITY: use more specific names. 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

1004 

19377  1005 
c) Permutative equations (e.g. "a + b = b + a") 
1006 
Since the change of names also changes the order of terms, permutative 

24800  1007 
rewrite rules may get applied in a different order. Experience shows 
1008 
that this is rarely the case (only two adaptions in the whole Isabelle 

1009 
distribution). INCOMPATIBILITY: rewrite proofs 

19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

1010 

77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

1011 
d) ML code directly refering to constant names 
24800  1012 
This in general only affects handwritten proof tactics, simprocs and 
1013 
so on. INCOMPATIBILITY: grep your sourcecode and replace names. 

1014 
Consider using @{const_name} antiquotation. 

19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

1015 

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

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

21265  1020 

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

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

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

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

1025 

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

19377  1028 

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

1032 

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

1034 
True/False. 

1035 

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

19211  1037 

19279  1038 
* Theorem setsum_mult renamed to setsum_right_distrib. 
1039 

19211  1040 
* Prefer ex1I over ex_ex1I in singlestep reasoning, e.g. by the 
22126  1041 
``rule'' method. 
1042 

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

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

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

1047 

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

22126  1049 
zChaff is still supported as well. 
1050 

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

1052 
bundled as foo_bar.inducts; 

1053 

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

1055 
Library. 

21256  1056 

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

1058 

18446  1059 
* Library: added theory Coinductive_List of potentially infinite lists 
1060 
as greatest fixedpoint. 

18399  1061 

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

1064 

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

1067 
oracle) if it evaluates to True. 

20807  1068 

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

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

1072 
Configuration option fast_arith_split_limit=0 recovers the old 

1073 
behavior. 

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

1074 

22126  1075 
* Support for hex (0x20) and binary (0b1001) numerals. 
19254  1076 

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

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

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

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

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

1083 

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

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

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

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

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

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

1090 
subgoal. An Example is available in HOL/ex/ReflectionEx.thy. 

1091 

23881  1092 
* Reflection: Automatic reification now handels binding, an example 
20807  1093 
is available in HOL/ex/ReflectionEx.thy 
1094 

1095 

19653  1096 
*** HOLComplex *** 
1097 

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

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

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

1102 
INCOMPATIBILITY. 

1103 

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

1107 

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

1110 
defined as range of_real; potential INCOMPATIBILITY. 

1111 

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

23013  1113 
Reals are implemented as arbitrary precision rationals. 
1114 

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

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

1118 
INCOMPATIBILITY. 

21791  1119 

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

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

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

1122 
HInfinite :: ('a::real_normed_vector) star set 
21791  1123 
approx :: ('a::real_normed_vector) star => 'a star => bool 
1124 
monad :: ('a::real_normed_vector) star => 'a star set 

1125 
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

1126 
(NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool 
21791  1127 
(NS)convergent :: (nat => 'a::real_normed_vector) => bool 
1128 
(NS)Bseq :: (nat => 'a::real_normed_vector) => bool 

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

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

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

1132 
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

1133 
sgn :: 'a::real_normed_vector => 'a 
23116  1134 
exp :: 'a::{recpower,real_normed_field,banach} => 'a 
21791  1135 

1136 
* Complex: Some complexspecific constants are now abbreviations for 

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

1139 
polymorphic versions (INCOMPATIBILITY): 

21791  1140 

1141 
approx < capprox 

1142 
HFinite < CFinite 

1143 
HInfinite < CInfinite 

1144 
Infinitesimal < CInfinitesimal 

1145 
monad < cmonad 

1146 
galaxy < cgalaxy 

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

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

1149 
(ns)deriv < (ns)cderiv 

1150 

19653  1151 

24801  1152 
*** HOLAlgebra *** 
1153 

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

1155 

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

1157 
INCOMPATIBILITY. 

1158 

1159 
* Renamed lemmas least_carrier > least_closed and greatest_carrier > 

1160 
greatest_closed. INCOMPATIBILITY. 

1161 

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

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

1164 
of algebraic structures. 

1165 

1166 
* Renamed theory CRing to Ring. 

1167 

1168 

1169 
*** HOLNominal *** 

1170 

1171 
* Fully featured support for nominal datatypes (binding structures) 

1172 
due to the HOLNominal logic. See HOL/Nominal, HOL/Nominal/Examples, 

1173 
and http://isabelle.in.tum.de/nominal/download.html 

1174 

1175 

17878  1176 
*** ML *** 
1177 

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

1180 

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

1183 
compiletime. For example: 

1184 

1185 
ML {* @{typ "'a => 'b"} *} 

1186 
ML {* @{term "%x. x"} *} 

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

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

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

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

1191 
ML {* @{thm asm_rl} *} 

1192 
ML {* @{thms asm_rl} *} 

24692  1193 
ML {* @{type_name c} *} 
22376  1194 
ML {* @{const_name c} *} 
1195 
ML {* @{const_syntax c} *} 

22138  1196 
ML {* @{context} *} 
1197 
ML {* @{theory} *} 

1198 
ML {* @{theory Pure} *} 

24692  1199 
ML {* @{theory_ref} *} 
1200 
ML {* @{theory_ref Pure} *} 

22138  1201 
ML {* @{simpset} *} 
1202 
ML {* @{claset} *} 

1203 
ML {* @{clasimpset} *} 

1204 

22151  1205 
The same works for sources being ``used'' within an Isar context. 
1206 

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

1208 
ML_Context.trace enabled. 
22152  1209 

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

1211 
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

1212 
admits slightly more efficient complex applications. 
18446  1213 

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

1216 

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

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

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

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

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

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

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

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

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

1229 

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

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

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

1234 

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

1238 
potential INCOMPATIBILITY. 

19508  1239 

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

1241 
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

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

1244 
AxClass.axiomatize_class/classrel/arity supersede 
19508  1245 
Sign.add_classes/classrel/arities. 
1246 

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

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

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

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

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

1251 
attributes, methods, etc. 
18642  1252 

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

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

1256 
fold_map combinators. 

18051  1257 

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

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

1259 
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

1260 
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

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

1262 

18020  1263 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  1264 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  1265 
achieve the old behaviour. 
1266 

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

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

1269 
statements. 

1270 

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

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

1272 
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

1273 
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

1274 

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

1277 
some popular functions from term.ML: 

1278 

1279 
Term.variant > Name.variant 

24800  1280 
Term.variantlist > Name.variant_list 
20090  1281 
Term.invent_names > Name.invent_list 
1282 

1283 
Note that lowlevel renaming rarely occurs in new code  operations 

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

1285 

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

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

1287 
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

1288 
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

1289 
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

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

1291 

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

1293 
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

1294 
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

1295 
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

1296 
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

1297 
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

1298 
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

1299 
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

1300 

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

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

1302 
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

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

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

1305 

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

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

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

1309 
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

1310 
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

1311 

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

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

1313 

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

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

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

1317 

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

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

1319 

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

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

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

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

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

1324 

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

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

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

1327 

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

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

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

1330 

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

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

1332 
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

1333 
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

1334 
batch mode. 
18567  1335 

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

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

17890  1339 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  1340 
(solver, looper etc.) may depend on arbitrary proof data. 
1341 

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

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

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

1345 
former Simplifier.inherit_bounds, which is already included here  

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

17878  1348 

1349 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

1352 
INCOMPATIBILITY. 

1353 

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

1356 

17878  1357 

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

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

1359 

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

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

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

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

1363 

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

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

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

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

1367 

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

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

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

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

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

1375 
guidelines for threadsafe programming, see appendix A in the Isar 

1376 
Implementation manual. 

24210
a865059c4fcb
* Experimental support for multithreading, using Poly/ML 5.1;
wenzelm
parents:
24187
diff
changeset

1377 

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

1378 

17720  1379 
New in Isabelle2005 (October 2005) 
1380 
 

14655
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset

1381 

8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset

1382 
*** General *** 
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset

1383 

15130  1384 
* Theory headers: the new header syntax for Isar theories is 
1385 

1386 
theory <name> 

16234  1387 
imports <theory1> ... <theoryN> 
1388 
uses <file1> ... <fileM> 

15130  1389 
begin 
1390 

16234  1391 
where the 'uses' part is optional. The previous syntax 
1392 

1393 
theory <name> = <theory1> + ... + <theoryN>: 

1394 

16717  1395 
will disappear in the next release. Use isatool fixheaders to convert 
1396 
existing theory files. Note that there is no change in ancient 

17371  1397 
nonIsar theories now, but these will disappear soon. 
15130  1398 

15475
fdf9434b04ea
 Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset

1399 
* Theory loader: parent theories can now also be referred to via 
16234  1400 
relative and absolute paths. 
1401 

17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1402 
* Command 'find_theorems' searches for a list of criteria instead of a 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1403 
list of constants. Known criteria are: intro, elim, dest, name:string, 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1404 
simp:term, and any term. Criteria can be preceded by '' to select 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1405 
theorems that do not match. Intro, elim, dest select theorems that 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1406 
match the current goal, name:s selects theorems whose fully qualified 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1407 
name contain s, and simp:term selects all simplification rules whose 