author  wenzelm 
Wed, 13 Apr 2005 20:20:14 +0200  
changeset 15727  b43d82139a6c 
parent 15724  1b89c781a7ec 
child 15744  daa84ebbdf94 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

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

4 
New in this Isabelle release 
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset

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

6 

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

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

8 

15703  9 
* ML: The type Library.option is no more, along with the exception 
15531  10 
Library.OPTION: Isabelle now uses the standard option type. The 
11 
functions the, is_some, is_none, etc. are still in Library, but 

12 
the constructors are now SOME and NONE instead of Some and None. 

15703  13 
They raise the exception Option. 
14 

15 
* ML: The exception LIST is no more, the standard exceptions Empty and 

15570  16 
Subscript, as well as Library.UnequalLengths are used instead. This 
17 
means that function like Library.hd and Library.tl are gone, as the 

18 
standard hd and tl functions suffice. 

19 

20 
A number of functions, specifically those in the LIBRARY_CLOSED 

21 
signature, are now no longer exported to the top ML level, as they 

22 
are variants of standard functions. The following suggests how 

23 
one can translate existing code: 

24 

25 
the x = valOf x 

26 
if_none x y = getOpt(x,y) 

27 
is_some x = isSome x 

28 
apsome f x = Option.map f x 

29 
rev_append xs ys = List.revAppend(xs,ys) 

30 
nth_elem(i,xs) = List.nth(xs,i) 

31 
last_elem xs = List.last xs 

32 
flat xss = List.concat xss 

33 
seq fs = app fs 

34 
partition P xs = List.partition P xs 

35 
filter P xs = List.filter P xs 

36 
mapfilter f xs = List.mapPartial f xs 

37 

38 
The final four functions, take, drop, foldl, and foldr, are somewhat 

39 
more complicated (especially the semantics of take and drop differ 

40 
from the standard). 

41 

42 
A simple solution to broken code is to include "open Library" at the 

43 
beginning of a structure. Everything after that will be as before. 

15531  44 

15130  45 
* Theory headers: the new header syntax for Isar theories is 
46 

47 
theory <name> 

15148  48 
imports <theory1> ... <theoryn> 
15130  49 
begin 
50 

15148  51 
optionally also with a "files" section. The syntax 
15130  52 

53 
theory <name> = <theory1> + ... + <theoryn>: 

54 

55 
will still be supported for some time but will eventually disappear. 

56 
The syntax of oldstyle theories has not changed. 

57 

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

58 
* Theory loader: parent theories can now also be referred to via 
fdf9434b04ea
 Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset

59 
relative and absolute paths. 
fdf9434b04ea
 Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset

60 

15103
79846e8792eb
New transitivity reasoners for transitivity only and quasi orders.
ballarin
parents:
15089
diff
changeset

61 
* Provers/quasi.ML: new transitivity reasoners for transitivity only 
79846e8792eb
New transitivity reasoners for transitivity only and quasi orders.
ballarin
parents:
15089
diff
changeset

62 
and quasi orders. 
79846e8792eb
New transitivity reasoners for transitivity only and quasi orders.
ballarin
parents:
15089
diff
changeset

63 

15076
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
15073
diff
changeset

64 
* Provers/trancl.ML: new transitivity reasoner for transitive and 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
15073
diff
changeset

65 
reflexivetransitive closure of relations. 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
15073
diff
changeset

66 

15163  67 
* Provers/blast.ML: new reference depth_limit to make blast's depth 
68 
limit (previously hardcoded with a value of 20) userdefinable. 

69 

15481  70 
* Provers: new version of the subst method, for singlestep rewriting: it now 
71 
works in bound variable contexts. New is subst (asm), for rewriting an 

72 
assumption. Thanks to Lucas Dixon! INCOMPATIBILITY: may rewrite a different 

73 
subterm than the original subst method, which is still available under the 

74 
name simplesubst. 

75 

15454  76 
* Pure: thin_tac now works even if the assumption being deleted contains !! or ==>. 
77 
More generally, erule now works even if the major premise of the elimination rule 

78 
contains !! or ==>. 

79 

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

80 
* Pure: considerably improved version of 'constdefs' command. Now 
14731  81 
performs automatic typeinference of declared constants; additional 
82 
support for local structure declarations (cf. locales and HOL 

83 
records), see also isarref manual. Potential INCOMPATIBILITY: need 

84 
to observe strictly sequential dependencies of definitions within a 

85 
single 'constdefs' section; moreover, the declared name needs to be 

86 
an identifier. If all fails, consider to fall back on 'consts' and 

87 
'defs' separately. 

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

88 

14698
7e4dec3fd515
improvd indexed syntax and implicit structures; tuned renaming of symbolic identifiers
wenzelm
parents:
14682
diff
changeset

89 
* Pure: improved indexed syntax and implicit structures. First of 
14731  90 
all, indexed syntax provides a notational device for subscripted 
91 
application, using the new syntax \<^bsub>term\<^esub> for arbitrary 

92 
expressions. Secondly, in a local context with structure 

93 
declarations, number indexes \<^sub>n or the empty index (default 

94 
number 1) refer to a certain fixed variable implicitly; option 

95 
show_structs controls printing of implicit structures. Typical 

96 
applications of these concepts involve record types and locales. 

97 

14795
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset

98 
* Pure: clear separation of logical types and nonterminals, where the 
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset

99 
latter may only occur in 'syntax' specifications or type 
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset

100 
abbreviations. Before that distinction was only partially 
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset

101 
implemented via type class "logic" vs. "{}". Potential 
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset

102 
INCOMPATIBILITY in rare cases of improper use of 'types'/'consts' 
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset

103 
instead of 'nonterminals'/'syntax'. Some very exotic syntax 
14816
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

104 
specifications may require further adaption (e.g. Cube/Base.thy). 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

105 

14854  106 
* Pure: removed obsolete type class "logic", use the top sort {} 
107 
instead. Note that nonlogical types should be declared as 

108 
'nonterminals' rather than 'types'. INCOMPATIBILITY for new 

109 
objectlogic specifications. 

110 

15022  111 
* Pure: print_tac now outputs the goal through the trace channel. 
112 

113 
* Pure: reference Namespace.unique_names included. If true the 

114 
(shortest) namespaceprefix is printed to disambiguate conflicts (as 

115 
yet). If false the first entry wins (as during parsing). Default 

116 
value is true. 

15018  117 

15033
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

118 
* Pure: tuned internal renaming of symbolic identifiers  attach 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

119 
primes instead of base 26 numbers. 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

120 

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

121 
* Pure: new flag show_var_qmarks to control printing of leading 
fdf9434b04ea
 Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset

122 
question marks of variable names. 
fdf9434b04ea
 Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset

123 

14816
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

124 
* Pure/Syntax: inner syntax includes (*(*nested*) comments*). 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

125 

b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

126 
* Pure/Syntax: pretty pinter now supports unbreakable blocks, 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

127 
specified in mixfix annotations as "(00...)". 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

128 

b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

129 
* Pure/Syntax: 'advanced' translation functions (parse_translation 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

130 
etc.) may depend on the signature of the theory context being 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

131 
presently used for parsing/printing, see also isarref manual. 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

132 

15033
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

133 
* Pure/Simplifier: simplification procedures may now take the current 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

134 
simpset into account (cf. Simplifier.simproc(_i) / mk_simproc 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

135 
interface), which is very useful for calling the Simplifier 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

136 
recursively. Minor INCOMPATIBILITY: the 'prems' argument of 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

137 
simprocs is gone  use prems_of_ss on the simpset instead. 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

138 
Moreover, the lowlevel mk_simproc no longer applies Logic.varify 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

139 
internally, to allow for use in a context of fixed variables. 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

140 

15406  141 
* Pure/Simplifier: Command "find_rewrites" takes a string and lists all 
15703  142 
equality theorems (not just those declared as simp!) whose lefthand 
15406  143 
side matches the term given via the string. In PG the command can be 
144 
activated via Isabelle > Show me > matching rewrites. 

145 

15703  146 
* Isar debugging: new reference Toplevel.debug; default false. 
15528
1b12557f720d
New reference Toplevel.debug for verbose printing of exns.
ballarin
parents:
15481
diff
changeset

147 
Set to make printing of exceptions THM, TERM, TYPE and THEORY more verbose. 
1b12557f720d
New reference Toplevel.debug for verbose printing of exns.
ballarin
parents:
15481
diff
changeset

148 

15127  149 
* Locales: 
150 
 "includes" disallowed in declaration of named locales (command "locale"). 

15206
09d78ec709c7
Modified locales: improved implementation of "includes".
ballarin
parents:
15200
diff
changeset

151 
 Fixed parameter management in theorem generation for goals with "includes". 
09d78ec709c7
Modified locales: improved implementation of "includes".
ballarin
parents:
15200
diff
changeset

152 
INCOMPATIBILITY: rarely, the generated theorem statement is different. 
15475
fdf9434b04ea
 Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset

153 

15696  154 
* Locales: new commands for the interpretation of locale expressions 
155 
in theories (interpretation) and proof contexts (interpret). These take an 

156 
instantiation of the locale parameters and compute proof obligations from 

157 
the instantiated specification. After the obligations have been discharged, 

158 
the instantiated theorems of the locale are added to the theory or proof 

159 
context. Interpretation is smart in that already active interpretations 

160 
do not occur in proof obligations, neither are instantiated theorems stored 

161 
in duplicate. 

162 
Use print_interps to inspect active interpretations of a particular locale. 

163 

15727
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

164 
* Locales: proper static binding of attribute syntax  i.e. types / 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

165 
terms / facts mentioned as arguments are always those of the locale 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

166 
definition context, independently of the context of later 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

167 
invocations. Moreover, locale operations (renaming and type / term 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

168 
instantiation) are applied to attribute arguments as expected. 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

169 

b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

170 
INCOMPATIBILITY of the ML interface: always pass Attrib.src instead 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

171 
of actual attributes; rare situations may require Attrib.attribute 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

172 
to embed those attributes into Attrib.src that lack concrete syntax. 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

173 

b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

174 
Attribute implementations need to cooperate properly with the static 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

175 
binding mechanism. Basic parsers Args.XXX_typ/term/prop and 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

176 
Attrib.XXX_thm etc. already do the right thing without further 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

177 
intervention. Only unusual applications  such as "where" or "of" 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

178 
(cf. src/Pure/Isar/attrib.ML), which process arguments depending 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

179 
both on the context and the facts involved  may have to assign 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

180 
parsed values to argument tokens explicitly. 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

181 

b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

182 
* Attributes 'induct' and 'cases': type or set names may now be 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

183 
locally fixed variables as well. 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

184 

15703  185 
* Isar: new syntax 'name(ij, i, i, ...)' for referring to specific 
186 
selections of theorems in named facts via indices. 

187 

188 

189 
*** Document preparation *** 

190 

191 
* New antiquotations @{lhs thm} and @{rhs thm} printing the lhs/rhs of 

192 
definitions, equations, inequations etc. 

193 

194 
* Antiquotations now provide the option 'locale=NAME' to specify an 

195 
alternative context used for evaluating and printing the subsequent 

196 
argument, as in @{thm [locale=LC] fold_commute}, for example. 

197 

198 
* Commands 'display_drafts' and 'print_drafts' perform simple output 

199 
of raw sources. Only those symbols that do not require additional 

200 
LaTeX packages (depending on comments in isabellesym.sty) are 

201 
displayed properly, everything else is left verbatim. We use 

202 
isatool display and isatool print as front ends; these are subject 

203 
to the DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively. 

204 

205 
* Proof scripts as well as some other commands such as ML or 

206 
parse/print_translation can now be hidden in the document. Hiding 

207 
is enabled by default, and can be disabled either via the option 'H 

208 
false' of isatool usedir or by resetting the reference variable 

209 
IsarOutput.hide_commands. Additional commands to be hidden may be 

210 
declared using IsarOutput.add_hidden_commands. 

211 

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

212 

14700
2f885b7e5ba7
reimplementation of HOL records; only one type is created for
schirmer
parents:
14699
diff
changeset

213 
*** HOL *** 
2f885b7e5ba7
reimplementation of HOL records; only one type is created for
schirmer
parents:
14699
diff
changeset

214 

15242  215 
* Datatype induction via method `induct' now preserves the name of the 
216 
induction variable. For example, when proving P(xs::'a list) by induction 

217 
on xs, the induction step is now P(xs) ==> P(a#xs) rather than 

218 
P(list) ==> P(a#list) as previously. 

219 

14731  220 
* HOL/record: reimplementation of records. Improved scalability for 
221 
records with many fields, avoiding performance problems for type 

222 
inference. Records are no longer composed of nested field types, but 

223 
of nested extension types. Therefore the record type only grows 

224 
linear in the number of extensions and not in the number of fields. 

225 
The toplevel (users) view on records is preserved. Potential 

226 
INCOMPATIBILITY only in strange cases, where the theory depends on 

227 
the old record representation. The type generated for a record is 

228 
called <record_name>_ext_type. 

229 

15022  230 
* HOL/record: Reference record_quick_and_dirty_sensitive can be 
231 
enabled to skip the proofs triggered by a record definition or a 

232 
simproc (if quick_and_dirty is enabled). Definitions of large 

233 
records can take quite long. 

234 

235 
* HOL/record: "record_upd_simproc" for simplification of multiple 

236 
record updates enabled by default. Moreover, trivial updates are 

237 
also removed: r(x := x r) = r. INCOMPATIBILITY: old proofs break 

238 
occasionally, since simplification is more powerful by default. 

15012
28fa57b57209
Added reference record_definition_quick_and_dirty_sensitive, to
schirmer
parents:
15011
diff
changeset

239 

14878  240 
* HOL: symbolic syntax of Hilbert Choice Operator is now as follows: 
241 

242 
syntax (epsilon) 

243 
"_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10) 

244 

245 
The symbol \<some> is displayed as the alternative epsilon of LaTeX 

246 
and xsymbol; use option 'm epsilon' to get it actually printed. 

247 
Moreover, the mathematically important symbolic identifier 

248 
\<epsilon> becomes available as variable, constant etc. 

249 

15361  250 
* HOL: "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x". 
251 
Similarly for all quantifiers: "ALL x > y" etc. 

252 
The xsymbol for >= is \<ge>. 

15356  253 

15534  254 
* HOL/Set: "{x:A. P}" abbreviates "{x. x:A & P}" 
255 
(and similarly for "\<in>" instead of ":") 

256 

15046  257 
* HOL/SetInterval: The syntax for open intervals has changed: 
258 

259 
Old New 

260 
{..n(} > {..<n} 

261 
{)n..} > {n<..} 

262 
{m..n(} > {m..<n} 

263 
{)m..n} > {m<..n} 

264 
{)m..n(} > {m<..<n} 

265 

266 
The old syntax is still supported but will disappear in the future. 

267 
For conversion use the following emacs search and replace patterns: 

268 

269 
{)\([^\.]*\)\.\. > {\1<\.\.} 

270 
\.\.\([^(}]*\)(} > \.\.<\1} 

271 

272 
They are not perfect but work quite well. 

273 

15073  274 
* HOL: The syntax for 'setsum', summation over finite sets, has changed: 
275 

276 
The syntax for 'setsum (%x. e) A' used to be '\<Sum>x:A. e' 

277 
and is now either 'SUM x:A. e' or '\<Sum>x\<in>A. e'. 

278 

279 
There is new syntax for summation over finite sets: 

15046  280 

15050  281 
'\<Sum>x  P. e' is the same as 'setsum (%x. e) {x. P}' 
282 
'\<Sum>x=a..b. e' is the same as 'setsum (%x. e) {a..b}' 

283 
'\<Sum>x=a..<b. e' is the same as 'setsum (%x. e) {a..<b}' 

284 
'\<Sum>x<k. e' is the same as 'setsum (%x. e) {..<k}' 

15046  285 

286 
Function 'Summation' over nat is gone, its syntax '\<Sum>i<k. e' 

287 
now translates into 'setsum' as above. 

288 

15319  289 
* HOL: Finite set induction: In Isar proofs, the insert case is now 
290 
"case (insert x F)" instead of the old counterintuitive "case (insert F x)". 

291 

15200  292 
* HOL/Simplifier: 
293 

294 
 Is now set up to reason about transitivity chains involving "trancl" 

295 
(r^+) and "rtrancl" (r^*) by setting up tactics provided by 

296 
Provers/trancl.ML as additional solvers. INCOMPATIBILITY: old proofs break 

297 
occasionally as simplification may now solve more goals than previously. 

298 

299 
 Converts x <= y into x = y if assumption y <= x is present. Works for 

300 
all partial orders (class "order"), in particular numbers and sets. For 

301 
linear orders (e.g. numbers) it treats ~ x < y just like y <= x. 

15089
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset

302 

15423  303 
 Simproc for "let x = a in f x" 
304 
If a is a free or bound variable or a constant then the let is unfolded. 

305 
Otherwise first a is simplified to a', and then f a' is simplified to 

306 
g. If possible we abstract a' from g arriving at "let x = a' in g' x", 

307 
otherwise we unfold the let and arrive at g. The simproc can be 

308 
enabled/disabled by the reference use_let_simproc. Potential 

309 
INCOMPATIBILITY since simplification is more powerful by default. 

310 

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

311 

14682
a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset

312 
*** HOLCF *** 
a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset

313 

a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset

314 
* HOLCF: discontinued special version of 'constdefs' (which used to 
14731  315 
support continuous functions) in favor of the general Pure one with 
316 
full typeinference. 

14682
a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset

317 

a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset

318 

14885  319 
*** ZF *** 
320 

15089
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset

321 
* ZF/ex/{Group,Ring}: examples in abstract algebra, including the 
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset

322 
First Isomorphism Theorem (on quotienting by the kernel of a 
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset

323 
homomorphism). 
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset

324 

430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset

325 
* ZF/Simplifier: install second copy of type solver that actually 
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset

326 
makes use of TC rules declared to Isar proof contexts (or locales); 
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset

327 
the old version is still required for ML proof scripts. 
14885  328 

329 

15703  330 
*** System *** 
331 

332 
* HOL: isatool dimacs2hol converts files in DIMACS CNF format 

333 
(containing Boolean satisfiability problems) into Isabelle/HOL 

334 
theories. 

335 

336 
* isatool usedir: option f allows specification of the ML file to be 

337 
used by Isabelle; default is ROOT.ML. 

338 

339 
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for 

340 
isatool doc, isatool mkdir, display_drafts etc.). 

341 

342 

343 
*** ML *** 

344 

345 
* Pure: output via the Isabelle channels of writeln/warning/error 

346 
etc. is now passed through Output.output, with a hook for arbitrary 

347 
transformations depending on the print_mode (cf. Output.add_mode  

348 
the first active mode that provides a output function wins). 

349 
Already formatted output may be embedded into further text via 

350 
Output.raw; the result of Pretty.string_of/str_of and derived 

351 
functions (string_of_term/cterm/thm etc.) is already marked raw to 

352 
accommodate easy composition of diagnostic messages etc. 

353 
Programmers rarely need to care about Output.output or Output.raw at 

354 
all, with some notable exceptions: Output.output is required when 

355 
bypassing the standard channels (writeln etc.), or in token 

356 
translations to produce properly formatted results; Output.raw is 

357 
required when capturing already output material that will eventually 

358 
be presented to the user a second time. For the default print mode, 

359 
both Output.output and Output.raw have no effect. 

360 

361 
* Provers: Simplifier and Classical Reasoner now support proof context 

362 
dependent plugins (simprocs, solvers, wrappers etc.). These extra 

363 
components are stored in the theory and patched into the 

364 
simpset/claset when used in an Isar proof context. Context 

365 
dependent components are maintained by the following theory 

366 
operations: 

367 

368 
Simplifier.add_context_simprocs 

369 
Simplifier.del_context_simprocs 

370 
Simplifier.set_context_subgoaler 

371 
Simplifier.reset_context_subgoaler 

372 
Simplifier.add_context_looper 

373 
Simplifier.del_context_looper 

374 
Simplifier.add_context_unsafe_solver 

375 
Simplifier.add_context_safe_solver 

376 

377 
Classical.add_context_safe_wrapper 

378 
Classical.del_context_safe_wrapper 

379 
Classical.add_context_unsafe_wrapper 

380 
Classical.del_context_unsafe_wrapper 

381 

382 
IMPORTANT NOTE: proof tools (methods etc.) need to use 

383 
local_simpset_of and local_claset_of to instead of the primitive 

384 
Simplifier.get_local_simpset and Classical.get_local_claset, 

385 
respectively, in order to see the context dependent fields! 

386 

387 

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

388 

14606  389 
New in Isabelle2004 (April 2004) 
390 
 

13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

391 

14171
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset

392 
*** General *** 
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset

393 

14398
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

394 
* Provers/order.ML: new efficient reasoner for partial and linear orders. 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

395 
Replaces linorder.ML. 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

396 

14606  397 
* Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic 
398 
(\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler 

14173  399 
(\<a>...\<z>), are now considered normal letters, and can therefore 
400 
be used anywhere where an ASCII letter (a...zA...Z) has until 

401 
now. COMPATIBILITY: This obviously changes the parsing of some 

402 
terms, especially where a symbol has been used as a binder, say 

403 
'\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed 

404 
as an identifier. Fix it by inserting a space around former 

405 
symbols. Call 'isatool fixgreek' to try to fix parsing errors in 

406 
existing theory and ML files. 

14171
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset

407 

14237  408 
* Pure: Macintosh and Windows linebreaks are now allowed in theory files. 
409 

14731  410 
* Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now 
411 
allowed in identifiers. Similar to Greek letters \<^isub> is now considered 

412 
a normal (but invisible) letter. For multiple letter subscripts repeat 

413 
\<^isub> like this: x\<^isub>1\<^isub>2. 

14233  414 

14333  415 
* Pure: There are now sub/superscripts that can span more than one 
416 
character. Text between \<^bsub> and \<^esub> is set in subscript in 

14606  417 
ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in 
418 
superscript. The new control characters are not identifier parts. 

14333  419 

14561
c53396af770e
* raw control symbols are of the form \<^raw:...> now.
schirmer
parents:
14556
diff
changeset

420 
* Pure: Controlsymbols of the form \<^raw:...> will literally print the 
14606  421 
content of "..." to the latex file instead of \isacntrl... . The "..." 
422 
may consist of any printable characters excluding the end bracket >. 

14361
ad2f5da643b4
* Support for raw latex output in control symbols: \<^raw...>
schirmer
parents:
14333
diff
changeset

423 

14237  424 
* Pure: Using new Isar command "finalconsts" (or the ML functions 
425 
Theory.add_finals or Theory.add_finals_i) it is now possible to 

426 
declare constants "final", which prevents their being given a definition 

427 
later. It is useful for constants whose behaviour is fixed axiomatically 

14224  428 
rather than definitionally, such as the metalogic connectives. 
429 

14606  430 
* Pure: 'instance' now handles general arities with general sorts 
431 
(i.e. intersections of classes), 

14503
255ad604e08e
Added check that Theory.ML does not occur in the files section of the theory
skalberg
parents:
14480
diff
changeset

432 

14547  433 
* Presentation: generated HTML now uses a CSS style sheet to make layout 
14731  434 
(somewhat) independent of content. It is copied from lib/html/isabelle.css. 
14547  435 
It can be changed to alter the colors/layout of generated pages. 
436 

14556
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset

437 

14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

438 
*** Isar *** 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

439 

14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset

440 
* Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac, 
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset

441 
cut_tac, subgoal_tac and thin_tac: 
14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

442 
 Now understand static (Isar) contexts. As a consequence, users of Isar 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

443 
locales are no longer forced to write Isar proof scripts. 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

444 
For details see Isar Reference Manual, paragraph 4.3.2: Further tactic 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

445 
emulations. 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

446 
 INCOMPATIBILITY: names of variables to be instantiated may no 
14211
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

447 
longer be enclosed in quotes. Instead, precede variable name with `?'. 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

448 
This is consistent with the instantiation attribute "where". 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

449 

14257
a7ef3f7588c5
Type inference bug in Isar attributes "where" and "of" fixed.
ballarin
parents:
14255
diff
changeset

450 
* Attributes "where" and "of": 
14285
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset

451 
 Now take type variables of instantiated theorem into account when reading 
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset

452 
the instantiation string. This fixes a bug that caused instantiated 
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset

453 
theorems to have too special types in some circumstances. 
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset

454 
 "where" permits explicit instantiations of type variables. 
14257
a7ef3f7588c5
Type inference bug in Isar attributes "where" and "of" fixed.
ballarin
parents:
14255
diff
changeset

455 

14556
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset

456 
* Calculation commands "moreover" and "also" no longer interfere with 
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset

457 
current facts ("this"), admitting arbitrary combinations with "then" 
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset

458 
and derived forms. 
14283  459 

14211
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

460 
* Locales: 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

461 
 Goal statements involving the context element "includes" no longer 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

462 
generate theorems with internal delta predicates (those ending on 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

463 
"_axioms") in the premise. 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

464 
Resolve particular premise with <locale>.intro to obtain old form. 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

465 
 Fixed bug in type inference ("unify_frozen") that prevented mix of target 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

466 
specification and "includes" elements in goal statement. 
14254
342634f38451
Isar/Locales: <loc>.intro and <loc>.axioms no longer intro? and elim? by
ballarin
parents:
14243
diff
changeset

467 
 Rule sets <locale>.intro and <locale>.axioms no longer declared as 
342634f38451
Isar/Locales: <loc>.intro and <loc>.axioms no longer intro? and elim? by
ballarin
parents:
14243
diff
changeset

468 
[intro?] and [elim?] (respectively) by default. 
14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset

469 
 Experimental command for instantiation of locales in proof contexts: 
14551  470 
instantiate <label>[<attrs>]: <loc> 
14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset

471 
Instantiates locale <loc> and adds all its theorems to the current context 
14551  472 
taking into account their attributes. Label and attrs are optional 
473 
modifiers, like in theorem declarations. If present, names of 

474 
instantiated theorems are qualified with <label>, and the attributes 

475 
<attrs> are applied after any attributes these theorems might have already. 

476 
If the locale has assumptions, a chained fact of the form 

14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset

477 
"<loc> t1 ... tn" is expected from which instantiations of the parameters 
14551  478 
are derived. The command does not support oldstyle locales declared 
479 
with "locale (open)". 

480 
A few (very simple) examples can be found in FOL/ex/LocaleInst.thy. 

14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

481 

dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

482 
* HOL: Tactic emulation methods induct_tac and case_tac understand static 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

483 
(Isar) contexts. 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

484 

14556
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset

485 

14136  486 
*** HOL *** 
487 

14624  488 
* Proof import: new image HOL4 contains the imported library from 
489 
the HOL4 system with about 2500 theorems. It is imported by 

490 
replaying proof terms produced by HOL4 in Isabelle. The HOL4 image 

491 
can be used like any other Isabelle image. See 

492 
HOL/Import/HOL/README for more information. 

493 

14398
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

494 
* Simplifier: 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

495 
 Much improved handling of linear and partial orders. 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

496 
Reasoners for linear and partial orders are set up for type classes 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

497 
"linorder" and "order" respectively, and are added to the default simpset 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

498 
as solvers. This means that the simplifier can build transitivity chains 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

499 
to solve goals from the assumptions. 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

500 
 INCOMPATIBILITY: old proofs break occasionally. Typically, applications 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

501 
of blast or auto after simplification become unnecessary because the goal 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

502 
is solved by simplification already. 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

503 

14731  504 
* Numerics: new theory Ring_and_Field contains over 250 basic numerical laws, 
14389  505 
all proved in axiomatic type classes for semirings, rings and fields. 
506 

507 
* Numerics: 

508 
 Numeric types (nat, int, and in HOLComplex rat, real, complex, etc.) are 

14731  509 
now formalized using the Ring_and_Field theory mentioned above. 
14389  510 
 INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently 
511 
than before, because now they are set up once in a generic manner. 

14731  512 
 INCOMPATIBILITY: many typespecific arithmetic laws have gone. 
14480  513 
Look for the general versions in Ring_and_Field (and Power if they concern 
514 
exponentiation). 

14389  515 

14401  516 
* Type "rat" of the rational numbers is now available in HOLComplex. 
14389  517 

14255  518 
* Records: 
519 
 Record types are now by default printed with their type abbreviation 

520 
instead of the list of all field types. This can be configured via 

521 
the reference "print_record_type_abbr". 

14731  522 
 Simproc "record_upd_simproc" for simplification of multiple updates added 
14255  523 
(not enabled by default). 
14427  524 
 Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp. 
525 
EX x. x = sel r to True (not enabled by default). 

14255  526 
 Tactic "record_split_simp_tac" to split and simplify records added. 
14731  527 

14136  528 
* 'specification' command added, allowing for definition by 
14224  529 
specification. There is also an 'ax_specification' command that 
530 
introduces the new constants axiomatically. 

14136  531 

14375  532 
* arith(_tac) is now able to generate counterexamples for reals as well. 
533 

14399
dc677b35e54f
New lemmas about inversion of restricted functions.
ballarin
parents:
14398
diff
changeset

534 
* HOLAlgebra: new locale "ring" for noncommutative rings. 
dc677b35e54f
New lemmas about inversion of restricted functions.
ballarin
parents:
14398
diff
changeset

535 

14243  536 
* HOLex: InductiveInvariant_examples illustrates advanced recursive function 
14610  537 
definitions, thanks to Sava Krsti\'{c} and John Matthews. 
538 

14731  539 
* HOLMatrix: a first theory for matrices in HOL with an application of 
14610  540 
matrix theory to linear programming. 
14136  541 

14380  542 
* Unions and Intersections: 
15119  543 
The latex output syntax of UN and INT has been changed 
544 
from "\Union x \in A. B" to "\Union_{x \in A} B" 

545 
i.e. the index formulae has become a subscript. 

546 
Similarly for "\Union x. B", and for \Inter instead of \Union. 

14380  547 

14418  548 
* Unions and Intersections over Intervals: 
14731  549 
There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is 
550 
also an xsymbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A" 

14418  551 
like in normal math, and corresponding versions for < and for intersection. 
552 

15677  553 
* HOL/List: Ordering "lexico" is renamed "lenlex" and the standard 
554 
lexicographic dictonary ordering has been added as "lexord". 

555 

14401  556 
* ML: the legacy theory structures Int and List have been removed. They had 
557 
conflicted with ML Basis Library structures having the same names. 

14380  558 

14464  559 
* 'refute' command added to search for (finite) countermodels. Only works 
560 
for a fragment of HOL. The installation of an external SAT solver is 

561 
highly recommended. See "HOL/Refute.thy" for details. 

562 

14602  563 
* 'quickcheck' command: Allows to find counterexamples by evaluating 
564 
formulae under an assignment of free variables to random values. 

565 
In contrast to 'refute', it can deal with inductive datatypes, 

566 
but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy" 

567 
for examples. 

14464  568 

14606  569 

14536  570 
*** HOLCF *** 
571 

572 
* Streams now come with concatenation and are part of the HOLCF image 

573 

14572  574 

575 

14136  576 
New in Isabelle2003 (May 2003) 
14606  577 
 
14136  578 

13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

579 
*** General *** 
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

580 

13618  581 
* Provers/simplifier: 
582 

13781  583 
 Completely reimplemented method simp (ML: Asm_full_simp_tac): 
13618  584 
Assumptions are now subject to complete mutual simplification, 
585 
not just from left to right. The simplifier now preserves 

586 
the order of assumptions. 

587 

588 
Potential INCOMPATIBILITY: 

589 

13781  590 
 simp sometimes diverges where the old version did 
591 
not, e.g. invoking simp on the goal 

13618  592 

593 
[ P (f x); y = x; f x = f y ] ==> Q 

594 

13781  595 
now gives rise to the infinite reduction sequence 
596 

597 
P(f x) (f x = f y)> P(f y) (y = x)> P(f x) (f x = f y)> ... 

598 

599 
Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this 

600 
kind of problem. 

601 

602 
 Tactics combining classical reasoner and simplification (such as auto) 

603 
are also affected by this change, because many of them rely on 

604 
simp. They may sometimes diverge as well or yield a different numbers 

605 
of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto 

606 
in case of problems. Sometimes subsequent calls to the classical 

607 
reasoner will fail because a preceeding call to the simplifier too 

608 
eagerly simplified the goal, e.g. deleted redundant premises. 

13618  609 

610 
 The simplifier trace now shows the names of the applied rewrite rules 

611 

13829  612 
 You can limit the number of recursive invocations of the simplifier 
613 
during conditional rewriting (where the simplifie tries to solve the 

614 
conditions before applying the rewrite rule): 

615 
ML "simp_depth_limit := n" 

616 
where n is an integer. Thus you can force termination where previously 

617 
the simplifier would diverge. 

618 

13835
12b2ffbe543a
Change to meta simplifier: congruence rules may now have frees as head of term.
ballarin
parents:
13829
diff
changeset

619 
 Accepts free variables as head terms in congruence rules. Useful in Isar. 
13829  620 

13938  621 
 No longer aborts on failed congruence proof. Instead, the 
622 
congruence is ignored. 

623 

14008  624 
* Pure: New generic framework for extracting programs from constructive 
625 
proofs. See HOL/Extraction.thy for an example instantiation, as well 

626 
as HOL/Extraction for some case studies. 

627 

13868  628 
* Pure: The main goal of the proof state is no longer shown by default, only 
629 
the subgoals. This behaviour is controlled by a new flag. 

13835
12b2ffbe543a
Change to meta simplifier: congruence rules may now have frees as head of term.
ballarin
parents:
13829
diff
changeset

630 
PG menu: Isabelle/Isar > Settings > Show Main Goal 
13815  631 
(ML: Proof.show_main_goal). 
632 

633 
* Pure: You can find all matching introduction rules for subgoal 1, i.e. all 

634 
rules whose conclusion matches subgoal 1: 

635 
PG menu: Isabelle/Isar > Show me > matching rules 

636 
The rules are ordered by how closely they match the subgoal. 

637 
In particular, rules that solve a subgoal outright are displayed first 

638 
(or rather last, the way they are printed). 

639 
(ML: ProofGeneral.print_intros()) 

640 

641 
* Pure: New flag trace_unify_fail causes unification to print 

13781  642 
diagnostic information (PG: in trace buffer) when it fails. This is 
643 
useful for figuring out why single step proofs like rule, erule or 

644 
assumption failed. 

645 

13815  646 
* Pure: Locale specifications now produce predicate definitions 
13410
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

647 
according to the body of text (covering assumptions modulo local 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

648 
definitions); predicate "loc_axioms" covers newly introduced text, 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

649 
while "loc" is cumulative wrt. all included locale expressions; the 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

650 
latter view is presented only on export into the global theory 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

651 
context; potential INCOMPATIBILITY, use "(open)" option to fall back 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

652 
on the old view without predicates; 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

653 

13459
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset

654 
* Pure: predefined locales "var" and "struct" are useful for sharing 
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset

655 
parameters (as in CASL, for example); just specify something like 
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset

656 
``var x + var y + struct M'' as import; 
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset

657 

13463
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

658 
* Pure: improved thms_containing: proper indexing of facts instead of 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

659 
raw theorems; check validity of results wrt. current name space; 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

660 
include local facts of proof configuration (also covers active 
13541  661 
locales), cover fixed variables in index; may use "_" in term 
662 
specification; an optional limit for the number of printed facts may 

663 
be given (the default is 40); 

664 

665 
* Pure: disallow duplicate fact bindings within newstyle theory files 

666 
(batchmode only); 

13540
aede0306e214
* Pure: disallow duplicate fact bindings within newstyle theory files;
wenzelm
parents:
13522
diff
changeset

667 

13463
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

668 
* Provers: improved induct method: assumptions introduced by case 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

669 
"foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

670 
the goal statement); "foo" still refers to all facts collectively; 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

671 

13550  672 
* Provers: the function blast.overloaded has been removed: all constants 
673 
are regarded as potentially overloaded, which improves robustness in exchange 

674 
for slight decrease in efficiency; 

675 

13781  676 
* Provers/linorder: New generic prover for transitivity reasoning over 
677 
linear orders. Note: this prover is not efficient! 

678 

13522
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset

679 
* Isar: preview of problems to finish 'show' now produce an error 
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset

680 
rather than just a warning (in interactive mode); 
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset

681 

13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

682 

13158  683 
*** HOL *** 
684 

13899  685 
* arith(_tac) 
686 

687 
 Produces a counter example if it cannot prove a goal. 

688 
Note that the counter example may be spurious if the goal is not a formula 

689 
of quantifierfree linear arithmetic. 

690 
In ProofGeneral the counter example appears in the trace buffer. 

691 

692 
 Knows about div k and mod k where k is a numeral of type nat or int. 

693 

694 
 Calls full Presburger arithmetic (by Amine Chaieb) if quantifierfree 

695 
linear arithmetic fails. This takes account of quantifiers and divisibility. 

14731  696 
Presburger arithmetic can also be called explicitly via presburger(_tac). 
13899  697 

698 
* simp's arithmetic capabilities have been enhanced a bit: it now 

699 
takes ~= in premises into account (by performing a case split); 

700 

701 
* simp reduces "m*(n div m) + n mod m" to n, even if the two summands 

702 
are distributed over a sum of terms; 

703 

13735  704 
* New tactic "trans_tac" and method "trans" instantiate 
705 
Provers/linorder.ML for axclasses "order" and "linorder" (predicates 

14731  706 
"<=", "<" and "="). 
707 

708 
* function INCOMPATIBILITIES: Pisets have been redefined and moved from main 

13587  709 
HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp"; 
710 

13443  711 
* 'typedef' command has new option "open" to suppress the set 
712 
definition; 

713 

13522
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset

714 
* functions Min and Max on finite sets have been introduced (theory 
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset

715 
Finite_Set); 
13492  716 

13443  717 
* attribute [symmetric] now works for relations as well; it turns 
718 
(x,y) : R^1 into (y,x) : R, and vice versa; 

719 

13613  720 
* induct over a !!quantified statement (say !!x1..xn): 
721 
each "case" automatically performs "fix x1 .. xn" with exactly those names. 

722 

13899  723 
* Map: `empty' is no longer a constant but a syntactic abbreviation for 
724 
%x. None. Warning: empty_def now refers to the previously hidden definition 

725 
of the empty set. 

726 

14018  727 
* Algebra: formalization of classical algebra. Intended as base for 
728 
any algebraic development in Isabelle. Currently covers group theory 

729 
(up to Sylow's theorem) and ring theory (Universal Property of 

730 
Univariate Polynomials). Contributions welcome; 

13960  731 

732 
* GroupTheory: deleted, since its material has been moved to Algebra; 

733 

14731  734 
* Complex: new directory of the complex numbers with numeric constants, 
735 
nonstandard complex numbers, and some complex analysis, standard and 

13966
2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

736 
nonstandard (Jacques Fleuriot); 
2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

737 

2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

738 
* HOLComplex: new image for analysis, replacing HOLReal and HOLHyperreal; 
2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

739 

14731  740 
* Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques 
13966
2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

741 
Fleuriot); 
13960  742 

13549  743 
* Real/HahnBanach: updated and adapted to locales; 
744 

13995  745 
* NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad, 
746 
Gray and Kramer); 

13872  747 

748 
* UNITY: added the MeierSanders theory of progress sets; 

749 

14011  750 
* MicroJava: bytecode verifier and lightweight bytecode verifier 
751 
as abstract algorithms, instantiated to the JVM; 

752 

14010  753 
* Bali: Java source language formalization. Type system, operational 
754 
semantics, axiomatic semantics. Supported language features: 

755 
classes, interfaces, objects,virtual methods, static methods, 

756 
static/instance fields, arrays, access modifiers, definite 

757 
assignment, exceptions. 

13549  758 

14011  759 

13549  760 
*** ZF *** 
761 

15154  762 
* ZF/Constructible: consistency proof for AC (Gdel's constructible 
13549  763 
universe, etc.); 
764 

13872  765 
* Main ZF: virtually all theories converted to newstyle format; 
13518  766 

13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

767 

13478  768 
*** ML *** 
769 

770 
* Pure: Tactic.prove provides sane interface for internal proofs; 

771 
omits the infamous "standard" operation, so this is more appropriate 

772 
than prove_goalw_cterm in many situations (e.g. in simprocs); 

773 

774 
* Pure: improved error reporting of simprocs; 

775 

776 
* Provers: Simplifier.simproc(_i) provides sane interface for setting 

777 
up simprocs; 

778 

779 

13953  780 
*** Document preparation *** 
781 

782 
* uses \par instead of \\ for line breaks in theory text. This may 

783 
shift some page breaks in large documents. To get the old behaviour 

784 
use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex. 

785 

14731  786 
* minimized dependencies of isabelle.sty and isabellesym.sty on 
13953  787 
other packages 
788 

789 
* \<euro> now needs package babel/greek instead of marvosym (which 

790 
broke \Rightarrow) 

791 

14731  792 
* normal size for \<zero>...\<nine> (uses \mathbf instead of 
13954  793 
textcomp package) 
13953  794 

13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

795 

14572  796 

12984  797 
New in Isabelle2002 (March 2002) 
798 
 

11474  799 

11572  800 
*** Document preparation *** 
801 

11842
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

802 
* greatly simplified document preparation setup, including more 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

803 
graceful interpretation of isatool usedir i/d/D options, and more 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

804 
instructive isatool mkdir; users should basically be able to get 
12899
7d5b690253ee
"isatool usedir D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset

805 
started with "isatool mkdir HOL Test && isatool make"; alternatively, 
7d5b690253ee
"isatool usedir D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset

806 
users may run a separate document processing stage manually like this: 
7d5b690253ee
"isatool usedir D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset

807 
"isatool usedir D output HOL Test && isatool document Test/output"; 
11842
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

808 

b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

809 
* theory dependency graph may now be incorporated into documents; 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

810 
isatool usedir g true will produce session_graph.eps/.pdf for use 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

811 
with \includegraphics of LaTeX; 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

812 

11864
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset

813 
* proper spacing of consecutive markup elements, especially text 
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset

814 
blocks after section headings; 
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset

815 

11572  816 
* support bold style (for single symbols only), input syntax is like 
817 
this: "\<^bold>\<alpha>" or "\<^bold>A"; 

818 

11814  819 
* \<bullet> is now output as bold \cdot by default, which looks much 
11572  820 
better in printed text; 
821 

11712
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset

822 
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>; 
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset

823 
note that these symbols are currently unavailable in Proof General / 
12769  824 
XSymbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>; 
12690  825 

826 
* isatool latex no longer depends on changed TEXINPUTS, instead 

827 
isatool document copies the Isabelle style files to the target 

828 
location; 

11712
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset

829 

11572  830 

11633  831 
*** Isar *** 
832 

12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

833 
* Pure/Provers: improved proof by cases and induction; 
12280  834 
 'case' command admits impromptu naming of parameters (such as 
835 
"case (Suc n)"); 

836 
 'induct' method divinates rule instantiation from the inductive 

837 
claim; no longer requires excessive ?P bindings for proper 

838 
instantiation of cases; 

839 
 'induct' method properly enumerates all possibilities of set/type 

840 
rules; as a consequence facts may be also passed through *type* 

841 
rules without further ado; 

842 
 'induct' method now derives symbolic cases from the *rulified* 

843 
rule (before it used to rulify cases stemming from the internal 

844 
atomized version); this means that the context of a nonatomic 

845 
statement becomes is included in the hypothesis, avoiding the 

846 
slightly cumbersome show "PROP ?case" form; 

847 
 'induct' may now use elimstyle induction rules without chaining 

848 
facts, using ``missing'' premises from the goal state; this allows 

849 
rules stemming from inductive sets to be applied in unstructured 

850 
scripts, while still benefitting from proper handling of nonatomic 

851 
statements; NB: major inductive premises need to be put first, all 

852 
the rest of the goal is passed through the induction; 

853 
 'induct' proper support for mutual induction involving nonatomic 

854 
rule statements (uses the new concept of simultaneous goals, see 

855 
below); 

12853  856 
 append all possible rule selections, but only use the first 
857 
success (no backtracking); 

11995
4a622f5fb164
 'induct' may now use elimstyle induction rules without chaining
wenzelm
parents:
11986
diff
changeset

858 
 removed obsolete "(simplified)" and "(stripped)" options of methods; 
12754
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset

859 
 undeclared rule case names default to numbers 1, 2, 3, ...; 
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset

860 
 added 'print_induct_rules' (covered by help item in recent Proof 
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset

861 
General versions); 
11995
4a622f5fb164
 'induct' may now use elimstyle induction rules without chaining
wenzelm
parents:
11986
diff
changeset

862 
 moved induct/cases attributes to Pure, methods to Provers; 
4a622f5fb164
 'induct' may now use elimstyle induction rules without chaining
wenzelm
parents:
11986
diff
changeset

863 
 generic method setup instantiated for FOL and HOL; 
11986
26b95a6f3f79
 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset

864 

12163
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

865 
* Pure: support multiple simultaneous goal statements, for example 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

866 
"have a: A and b: B" (same for 'theorem' etc.); being a pure 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

867 
metalevel mechanism, this acts as if several individual goals had 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

868 
been stated separately; in particular common proof methods need to be 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

869 
repeated in order to cover all claims; note that a single elimination 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

870 
step is *not* sufficient to establish the two conjunctions, so this 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

871 
fails: 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

872 

04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

873 
assume "A & B" then have A and B .. (*".." fails*) 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

874 

04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

875 
better use "obtain" in situations as above; alternative refer to 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

876 
multistep methods like 'auto', 'simp_all', 'blast+' etc.; 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

877 

12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset

878 
* Pure: proper integration with ``locales''; unlike the original 
15154  879 
version by Florian Kammller, Isar locales package highlevel proof 
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset

880 
contexts rather than raw logical ones (e.g. we admit to include 
12280  881 
attributes everywhere); operations on locales include merge and 
12964  882 
rename; support for implicit arguments (``structures''); simultaneous 
883 
typeinference over imports and text; see also HOL/ex/Locales.thy for 

884 
some examples; 

12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset

885 

12707
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

886 
* Pure: the following commands have been ``localized'', supporting a 
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

887 
target locale specification "(in name)": 'lemma', 'theorem', 
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

888 
'corollary', 'lemmas', 'theorems', 'declare'; the results will be 
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

889 
stored both within the locale and at the theory level (exported and 
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

890 
qualified by the locale name); 
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

891 

12964  892 
* Pure: theory goals may now be specified in ``long'' form, with 
893 
adhoc contexts consisting of arbitrary locale elements. for example 

894 
``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and 

895 
definitions may be given, too); the result is a metalevel rule with 

896 
the context elements being discharged in the obvious way; 

897 

898 
* Pure: new proof command 'using' allows to augment currently used 

899 
facts after a goal statement ('using' is syntactically analogous to 

900 
'apply', but acts on the goal's facts only); this allows chained facts 

901 
to be separated into parts given before and after a claim, as in 

902 
``from a and b have C using d and e <proof>''; 

12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset

903 

11722  904 
* Pure: renamed "antecedent" case to "rule_context"; 
905 

12964  906 
* Pure: new 'judgment' command records explicit information about the 
907 
objectlogic embedding (used by several tools internally); no longer 

908 
use hardwired "Trueprop"; 

909 

11738  910 
* Pure: added 'corollary' command; 
911 

11722  912 
* Pure: fixed 'token_translation' command; 
913 

11899  914 
* Pure: removed obsolete 'exported' attribute; 
915 

11933  916 
* Pure: dummy pattern "_" in is/let is now automatically lifted over 
917 
bound variables: "ALL x. P x > Q x" (is "ALL x. _ > ?C x") 

11899  918 
supersedes more cumbersome ... (is "ALL x. _ x > ?C x"); 
919 

11952
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

920 
* Pure: method 'atomize' presents local goal premises as objectlevel 
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

921 
statements (atomic metalevel propositions); setup controlled via 
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

922 
rewrite rules declarations of 'atomize' attribute; example 
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

923 
application: 'induct' method with proper rule statements in improper 
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

924 
proof *scripts*; 
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

925 

12106
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

926 
* Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.) 
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

927 
now consider the syntactic context of assumptions, giving a better 
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

928 
chance to get typeinference of the arguments right (this is 
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

929 
especially important for locales); 
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

930 

12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

931 
* Pure: "sorry" no longer requires quick_and_dirty in interactive 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

932 
mode; 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

933 

12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

934 
* Pure/obtain: the formal conclusion "thesis", being marked as 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

935 
``internal'', may no longer be reference directly in the text; 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

936 
potential INCOMPATIBILITY, may need to use "?thesis" in rare 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

937 
situations; 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

938 

9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

939 
* Pure: generic 'sym' attribute which declares a rule both as pure 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

940 
'elim?' and for the 'symmetric' operation; 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

941 

12877
b9635eb8a448
* Isar/Pure: marginal comments ``'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset

942 
* Pure: marginal comments ``'' may now occur just anywhere in the 
b9635eb8a448
* Isar/Pure: marginal comments ``'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset

943 
text; the fixed correlation with particular command syntax has been 
b9635eb8a448
* Isar/Pure: marginal comments ``'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset

944 
discontinued; 
b9635eb8a448
* Isar/Pure: marginal comments ``'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset

945 

13023
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

946 
* Pure: new method 'rules' is particularly wellsuited for proof 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

947 
search in intuitionistic logic; a bit slower than 'blast' or 'fast', 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

948 
but often produces more compact proof terms with less detours; 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

949 

12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

950 
* Pure/Provers/classical: simplified integration with pure rule 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

951 
attributes and methods; the classical "intro?/elim?/dest?" 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

952 
declarations coincide with the pure ones; the "rule" method no longer 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

953 
includes classically swapped intros; "intro" and "elim" methods no 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

954 
longer pick rules from the context; also got rid of ML declarations 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

955 
AddXIs/AddXEs/AddXDs; all of this has some potential for 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

956 
INCOMPATIBILITY; 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

957 

12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

958 
* Provers/classical: attribute 'swapped' produces classical inversions 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

959 
of introduction rules; 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

960 

12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

961 
* Provers/simplifier: 'simplified' attribute may refer to explicit 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

962 
rules instead of full simplifier context; 'iff' attribute handles 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

963 
conditional rules; 
11936
fef099613354
* Provers: 'simplified' attribute may refer to explicit rules instead
wenzelm
parents:
11933
diff
changeset

964 

11745
06cd8c3b5487
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm
parents:
11738
diff
changeset

965 
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms; 
06cd8c3b5487
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm
parents:
11738
diff
changeset

966 

11690  967 
* HOL: 'recdef' now fails on unfinished automated proofs, use 
11633  968 
"(permissive)" option to recover old behavior; 
969 

11933  970 
* HOL: 'inductive' no longer features separate (collective) attributes 
971 
for 'intros' (was found too confusing); 

972 

12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

973 
* HOL: properly declared induction rules less_induct and 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

974 
wf_induct_rule; 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

975 

11788
60054fee3c16
canonical 'cases'/'induct' rules for ntuples (n=3..7)
kleing
parents:
11745
diff
changeset

976 

11474  977 
*** HOL *** 
978 

11702  979 
* HOL: moved over to sane numeral syntax; the new policy is as 
980 
follows: 

981 

982 
 0 and 1 are polymorphic constants, which are defined on any 

983 
numeric type (nat, int, real etc.); 

984 

985 
 2, 3, 4, ... and 1, 2, 3, ... are polymorphic numerals, based 

986 
binary representation internally; 

987 

988 
 type nat has special constructor Suc, and generally prefers Suc 0 

989 
over 1::nat and Suc (Suc 0) over 2::nat; 

990 

12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

991 
This change may cause significant problems of INCOMPATIBILITY; here 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

992 
are some hints on converting existing sources: 
11702  993 

994 
 due to the new "num" token, "0" and "1" etc. are now atomic 

995 
entities, so expressions involving "" (unary or binary minus) need 

996 
to be spaced properly; 

997 

998 
 existing occurrences of "1" may need to be constraint "1::nat" or 

999 
even replaced by Suc 0; similar for old "2"; 

1000 

1001 
 replace "#nnn" by "nnn", and "#nnn" by "nnn"; 

1002 

1003 
 remove all special provisions on numerals in proofs; 

1004 

13042  1005 
* HOL: simp rules nat_number expand numerals on nat to Suc/0 
12837  1006 
representation (depends on bin_arith_simps in the default context); 
1007 

12736  1008 
* HOL: symbolic syntax for x^2 (numeral 2); 
1009 

12335
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

1010 
* HOL: the class of all HOL types is now called "type" rather than 
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

1011 
"term"; INCOMPATIBILITY, need to adapt references to this type class 
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

1012 
in axclass/classes, instance/arities, and (usually rare) occurrences 
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

1013 
in typings (of consts etc.); internally the class is called 
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

1014 
"HOL.type", ML programs should refer to HOLogic.typeS; 
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

1015 

12280  1016 
* HOL/record package improvements: 
1017 
 new derived operations "fields" to build a partial record section, 

1018 
"extend" to promote a fixed record to a record scheme, and 

1019 
"truncate" for the reverse; cf. theorems "xxx.defs", which are *not* 

1020 
declared as simp by default; 

12587
3f3d2ffb5df5
HOL/record: shared operations ("more", "fields", etc.) now need to be
wenzelm
parents:
12564
diff
changeset

1021 
 shared operations ("more", "fields", etc.) now need to be always 
3f3d2ffb5df5
HOL/record: shared operations ("more", "fields", etc.) now need to be
wenzelm
parents:
12564
diff
changeset

1022 
qualified)  potential INCOMPATIBILITY; 
12280  1023 
 removed "make_scheme" operations (use "make" with "extend")  
1024 
INCOMPATIBILITY; 

11937  1025 
 removed "more" class (simply use "term")  INCOMPATIBILITY; 
12253  1026 
 provides cases/induct rules for use with corresponding Isar 
1027 
methods (for concrete records, record schemes, concrete more 

12280  1028 
parts, and schematic more parts  in that order); 
11930  1029 
 internal definitions directly based on a lightweight abstract 
1030 
theory of product types over typedef rather than datatype; 

1031 

13023
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

1032 
* HOL: generic code generator for generating executable ML code from 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

1033 
specifications; specific support for HOL constructs such as inductive 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

1034 
datatypes and sets, as well as recursive functions; can be invoked 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

1035 
via 'generate_code' theory section; 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

1036 

11933  1037 
* HOL: canonical cases/induct rules for ntuples (n = 3..7); 
1038 

13824  1039 
* HOL: consolidated and renamed several theories. In particular: 
14731  1040 
Ord.thy has been absorbed into HOL.thy 
1041 
String.thy has been absorbed into List.thy 

1042 

11802
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset

1043 
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A" 
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset

1044 
(beware of argument permutation!); 
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset

1045 

11657  1046 
* HOL: linorder_less_split superseded by linorder_cases; 
1047 

12917  1048 
* HOL/List: "nodups" renamed to "distinct"; 
12889  1049 

11633  1050 
* HOL: added "The" definite description operator; move Hilbert's "Eps" 
13824  1051 
to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES: 
1052 
 Ex_def has changed, now need to use some_eq_ex 

11437  1053 

11572  1054 
* HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so 
1055 
in this (rare) case use: 

1056 

1057 
delSWrapper "split_all_tac" 

1058 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

1059 

1060 
* HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS 

11474  1061 
MAY FAIL; 
11361  1062 

11572  1063 
* HOL: introduced f^n = f o ... o f; warning: due to the limits of 
1064 
Isabelle's type classes, ^ on functions and relations has too general 

1065 
a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be 

1066 
necessary to attach explicit type constraints; 

11307  1067 

12917  1068 
* HOL/Relation: the prefix name of the infix "O" has been changed from 
1069 
"comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been 

1070 
renamed accordingly (eg "compI" > "rel_compI"). 

12489  1071 

11487
95071c9e85a3
* HOL: syntax translations now work properly with numerals and records
wenzelm
parents:
11475
diff
changeset

1072 
* HOL: syntax translations now work properly with numerals and records 
95071c9e85a3
* HOL: syntax translations now work properly with numerals and records
wenzelm
parents:
11475
diff
changeset

1073 
expressions; 
11474  1074 

12457
cbfc53e45476
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm
parents:
12405
diff
changeset

1075 
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead 
cbfc53e45476
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm
parents:
12405
diff
changeset

1076 
of "lam"  INCOMPATIBILITY; 
11474  1077 

11933  1078 
* HOL: got rid of some global declarations (potential INCOMPATIBILITY 
1079 
for ML tools): const "()" renamed "Product_Type.Unity", type "unit" 

1080 
renamed "Product_Type.unit"; 

11611  1081 

12564  1082 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
1083 

12924  1084 
* HOL: removed obsolete theorem "optionE" (use "option.exhaust", or 
1085 
the "cases" method); 

1086 

12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

1087 
* HOL/GroupTheory: group theory examples including Sylow's theorem (by 
15154  1088 
Florian Kammller); 
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

1089 

12608
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

1090 
* HOL/IMP: updated and converted to newstyle theory format; several 
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

1091 
parts turned into readable document, with proper Isar proof texts and 
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

1092 
some explanations (by Gerwin Klein); 
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

1093 

12734  1094 
* HOLReal: added Complex_Numbers (by Gertrud Bauer); 
1095 

12690  1096 
* HOLHyperreal is now a logic image; 
1097 

11611  1098 

12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset

1099 
*** HOLCF *** 
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset

1100 

12622  1101 
* Isar: consts/constdefs supports mixfix syntax for continuous 
1102 
operations; 

1103 

1104 
* Isar: domain package adapted to newstyle theory format, e.g. see 

1105 
HOLCF/ex/Dnat.thy; 

1106 

1107 
* theory Lift: proper use of rep_datatype lift instead of ML hacks  

12280  1108 
potential INCOMPATIBILITY; now use plain induct_tac instead of former 
1109 
lift.induct_tac, always use UU instead of Undef; 

12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset

1110 

12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

1111 
* HOLCF/IMP: updated and converted to newstyle theory; 
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

1112 

12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset

1113 

11474  1114 
*** ZF *** 
1115 

12622  1116 
* Isar: proper integration of logicspecific tools and packages, 
1117 
including theory commands '(co)inductive', '(co)datatype', 

1118 
'rep_datatype', 'inductive_cases', as well as methods 'ind_cases', 

1119 
'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC'); 

1120 

1121 
* theory Main no longer includes AC; for the Axiom of Choice, base 

1122 
your theory on Main_ZFC; 

1123 

1124 
* the integer library now covers quotients and remainders, with many 

1125 
laws relating division to addition, multiplication, etc.; 

12563  1126 

12280  1127 
* ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a 
1128 
typeless version of the formalism; 

1129 

13025  1130 
* ZF/AC, Coind, IMP, Resid: updated and converted to newstyle theory 
1131 
format; 

12608
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

1132 

12280  1133 
* ZF/Induct: new directory for examples of inductive definitions, 
12608
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

1134 
including theory Multiset for multiset orderings; converted to 
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

1135 
newstyle theory format; 
12177
b1c16d685a99
* ZF: newstyle theory commands 'inductive', 'inductive_cases', and
wenzelm
parents:
12163
diff
changeset

1136 

13025  1137 
* ZF: many new theorems about lists, ordinals, etc.; 
12850  1138 

11474  1139 

1140 
*** General *** 

1141 

12280  1142 
* Pure/kernel: metalevel proof terms (by Stefan Berghofer); reference 
1143 
variable proof controls level of detail: 0 = no proofs (only oracle 

1144 
dependencies), 1 = lemma dependencies, 2 = compact proof terms; see 

1145 
also ref manual for further ML interfaces; 

1146 

1147 
* Pure/axclass: removed obsolete ML interface 

1148 
goal_subclass/goal_arity; 

1149 

1150 
* Pure/syntax: new token syntax "num" for plain numerals (without "#" 

1151 
of "xnum"); potential INCOMPATIBILITY, since 0, 1 etc. are now 

1152 
separate tokens, so expressions involving minus need to be spaced 

1153 
properly; 

1154 

12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

1155 
* Pure/syntax: support nonoriented infixes, using keyword "infix" 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

1156 
rather than "infixl" or "infixr"; 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

1157 

f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

1158 
* Pure/syntax: concrete syntax for dummy type variables admits genuine 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

1159 
sort constraint specifications in type inference; e.g. "x::_::foo" 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

1160 
ensures that the type of "x" is of sort "foo" (but not necessarily a 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

1161 
type variable); 
12280  1162 

1163 
* Pure/syntax: print modes "type_brackets" and "no_type_brackets" 

1164 
control output of nested => (types); the default behavior is 

1165 
"type_brackets"; 

1166 

1167 
* Pure/syntax: builtin parse translation for "_constify" turns valued 

11817  1168 
tokens into AST constants; 
11474  1169 

12280  1170 
* Pure/syntax: prefer later declarations of translations and print 
1171 
translation functions; potential INCOMPATIBILITY: need to reverse 

1172 
multiple declarations for same syntax element constant; 

1173 

12832
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset

1174 
* Pure/show_hyps reset by default (in accordance to existing Isar 
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset

1175 
practice); 
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset

1176 

12280  1177 
* Provers/classical: renamed addaltern to addafter, addSaltern to 
1178 
addSafter; 

1179 

1180 
* Provers/clasimp: ``iff'' declarations now handle conditional rules 

1181 
as well; 

12253  1182 

12538  1183 
* system: tested support for MacOS X; should be able to get Isabelle + 
1184 
Proof General to work in a plain Terminal after installing Poly/ML 

1185 
(e.g. from the Isabelle distribution area) and GNU bash alone 

1186 
(e.g. from http://www.apple.com); full X11, XEmacs and XSymbol 

1187 
support requires further installations, e.g. from 

1188 
http://fink.sourceforge.net/); 

1189 

12280  1190 
* system: support Poly/ML 4.1.1 (able to manage larger heaps); 
11551  1191 

12753
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset

1192 
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead 
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset

1193 
of 40 MB), cf. ML_OPTIONS; 
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset

1194 

11633  1195 
* system: Proof General keywords specification is now part of the 
1196 
Isabelle distribution (see etc/isarkeywords.el); 

1197 

12728  1198 
* system: support for persistent Proof General sessions (refrain from 
1199 
outdating all loaded theories on startup); user may create writable 

1200 
logic images like this: ``isabelle q HOL Test''; 

12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

1201 

11551  1202 
* system: smart selection of Isabelle process versus Isabelle 
11572  1203 
interface, accommodates caseinsensitive file systems (e.g. HFS+); may 
1204 
run both "isabelle" and "Isabelle" even if file names are badly 

1205 
damaged (executable inspects the case of the first letter of its own 

1206 
name); added separate "isabelleprocess" and "isabelleinterface"; 

11551  1207 

12472  1208 
* system: refrain from any attempt at filtering input streams; no 
1209 
longer support ``8bit'' encoding of old isabelle font, instead proper 

1210 
isolatin characters may now be used; the related isatools 

1211 
"symbolinput" and "nonascii" have disappeared as well; 

1212 

1213 
* system: removed old "xterm" interface (the print modes "xterm" and 

1214 
"xterm_color" are still available for direct use in a suitable 

1215 
terminal); 

1216 

11314  1217 

11169
98c2f741e32b
made split_all_tac safe introducing safe_full_simp_tac, EXISTING PROOFS MAY FAIL
oheimb
parents:
11130
diff
changeset

1218 

11062  1219 
New in Isabelle992 (February 2001) 
1220 
 

1221 

10224  1222 
*** Overview of INCOMPATIBILITIES *** 
1223 

11241  1224 
* HOL: please note that theories in the Library and elsewhere often use the 
1225 
newstyle (Isar) format; to refer to their theorems in an ML script you must 

12622  1226 
bind them to ML identifers by e.g. val thm_name = thm "thm_name"; 
11241  1227 

11043
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset

1228 
* HOL: inductive package no longer splits induction rule aggressively, 
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset

1229 
but only as far as specified by the introductions given; the old 
11130  1230 
format may be recovered via ML function complete_split_rule or attribute 
11043
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset

1231 
'split_rule (complete)'; 
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset

1232 

10998  1233 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
1234 
gfp_Tarski to gfp_unfold; 

10224  1235 

10288  1236 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
1237 

10858  1238 
* HOL: infix "dvd" now has priority 50 rather than 70 (because it is a 
1239 
relation); infix "^^" has been renamed "``"; infix "``" has been 

1240 
renamed "`"; "univalent" has been renamed "single_valued"; 

10793  1241 

10998  1242 
* HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse" 
1243 
operation; 

1244 

10868  1245 
* HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>; 
10856  1246 

10391  1247 
* Isar: 'obtain' no longer declares "that" fact as simp/intro; 
1248 

10401
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

1249 
* Isar/HOL: method 'induct' now handles nonatomic goals; as a 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

1250 
consequence, it is no longer monotonic wrt. the local goal context 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

1251 
(which is now passed through the inductive cases); 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

1252 

10976
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset

1253 
* Document preparation: renamed standard symbols \<ll> to \<lless> and 
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset

1254 
\<gg> to \<ggreater>; 
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset

1255 

10224  1256 

10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1257 
*** Document preparation *** 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1258 

10858  1259 
* \isabellestyle{NAME} selects version of Isabelle output (currently 
1260 
available: are "it" for near mathmode beststyle output, "sl" for 

1261 
slanted text style, and "tt" for plain typewriter; if no 

1262 
\isabellestyle command is given, output is according to slanted 

1263 
typewriter); 

1264 

10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

1265 
* support sub/super scripts (for single symbols only), input syntax is 
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

1266 
like this: "A\<^sup>*" or "A\<^sup>\<star>"; 
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

1267 

10858  1268 
* some more standard symbols; see Appendix A of the system manual for 
11062  1269 
the complete list of symbols defined in isabellesym.sty; 
10858  1270 

10998  1271 
* improved isabelle style files; more abstract symbol implementation 
1272 
(should now use \isamath{...} and \isatext{...} in custom symbol 

1273 
definitions); 

1274 

10634  1275 
* antiquotation @{goals} and @{subgoals} for output of *dynamic* goals 
1276 
state; Note that presentation of goal states does not conform to 

1277 
actual humanreadable proof documents. Please do not include goal 

1278 
states into document output unless you really know what you are doing! 

10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

1279 

11062  1280 
* proper indentation of antiquoted output with proportional LaTeX 
1281 
fonts; 

10862  1282 

11050
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset

1283 
* no_document ML operator temporarily disables LaTeX document 
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset

1284 
generation; 
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset

1285 

11062  1286 
* isatool unsymbolize tunes sources for plain ASCII communication; 
1287 

10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

1288 

10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

1289 
*** Isar *** 
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

1290 

10547  1291 
* Pure: Isar now suffers initial goal statements to contain unbound 
1292 
schematic variables (this does not conform to actual readable proof 

1293 
documents, due to unpredictable outcome and noncompositional proof 

1294 
checking); users who know what they are doing may use schematic goals 

1295 
for Prologstyle synthesis of proven results; 

1296 

10391  1297 
* Pure: assumption method (an implicit finishing) now handles actual 
1298 
rules as well; 

1299 

1300 
* Pure: improved 'obtain'  moved to Pure, insert "that" into 

1301 
initial goal, declare "that" only as Pure intro (only for single 

1302 
steps); the "that" rule assumption may now be involved in implicit 

1303 
finishing, thus ".." becomes a feasible for trivial obtains; 

1304 

1305 
* Pure: default proof step now includes 'intro_classes'; thus trivial 

1306 
instance proofs may be performed by ".."; 

1307 

1308 
* Pure: ?thesis / ?this / "..." now work for pure metalevel 

1309 
statements as well; 

10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

1310 

11097  1311 
* Pure: more robust selection of calculational rules; 
1312 

10858  1313 
* Pure: the builtin notion of 'finished' goal now includes the ==refl 
1314 
rule (as well as the assumption rule); 

1315 

1316 
* Pure: 'thm_deps' command visualizes dependencies of theorems and 

1317 
lemmas, using the graph browser tool; 

1318 

10944  1319 
* Pure: predict failure of "show" in interactive mode; 
1320 

11016
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset

1321 
* Pure: 'thms_containing' now takes actual terms as arguments; 
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset

1322 

10401
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

1323 
* HOL: improved method 'induct'  now handles nonatomic goals 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

1324 
(potential INCOMPATIBILITY); tuned error handling; 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

1325 

10557  1326 
* HOL: cases and induct rules now provide explicit hints about the 
10547  1327 
number of facts to be consumed (0 for "type" and 1 for "set" rules); 
1328 
any remaining facts are inserted into the goal verbatim; 

1329 

10858  1330 
* HOL: local contexts (aka cases) may now contain term bindings as 
1331 
well; the 'cases' and 'induct' methods new provide a ?case binding for 

1332 
the result to be shown in each case; 

1333 

10770  1334 
* HOL: added 'recdef_tc' command; 
1335 

11016
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset

1336 
* isatool convert assists in eliminating legacy ML scripts; 
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset

1337 

10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

1338 

10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1339 
*** HOL *** 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1340 

87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1341 
* HOL/Library: a collection of generic theories to be used together 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1342 
with main HOL; the theory loader path already includes this directory 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1343 
by default; the following existing theories have been moved here: 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1344 
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While 
10337  1345 
(as While_Combinator), HOL/Lex/Prefix (as List_Prefix); 
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1346 

10966  1347 
* HOL/Unix: "Some aspects of Unix filesystem security", a typical 
1348 
modelling and verification task performed in Isabelle/HOL + 

1349 
Isabelle/Isar + Isabelle document preparation (by Markus Wenzel). 

1350 

11094  1351 
* HOL/Algebra: special summation operator SUM no longer exists, it has 
1352 
been replaced by setsum; infix 'assoc' now has priority 50 (like 

1353 
'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to 

1354 
'domain', this makes the theory consistent with mathematical 

1355 
literature; 

1356 

10514  1357 
* HOL basics: added overloaded operations "inverse" and "divide" 
10726  1358 
(infix "/"), syntax for generic "abs" operation, generic summation 
11094  1359 
operator \<Sum>; 
10452
abeefb0a79ae
* added overloaded operations "inverse" and "divide" (infix "/");
wenzelm
parents:
10428
diff
changeset

1360 

10391  1361 
* HOL/typedef: simplified package, provide more useful rules (see also 
1362 
HOL/subset.thy); 

1363 

10915
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1364 
* HOL/datatype: induction rule for arbitrarily branching datatypes is 
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1365 
now expressed as a proper nested rule (oldstyle tactic scripts may 
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1366 
require atomize_strip_tac to cope with nonatomic premises); 
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1367 

6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1368 
* HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule 
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1369 
to "split_conv" (old name still available for compatibility); 
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1370 

6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1371 
* HOL: improved concrete syntax for strings (e.g. allows translation 
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1372 
rules with string literals); 
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1373 

12245  1374 
* HOLRealHyperreal: this extends HOLReal with the hyperreals 
1375 
and Fleuriot's mechanization of analysis, including the transcendental 

1376 
functions for the reals; 

10756  1377 

11094  1378 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  1379 

10858  1380 

10474  1381 
*** CTT *** 
1382 

10547  1383 
* CTT: xsymbol support for Pi, Sigma, >, : (membership); note that 
1384 
"lam" is displayed as TWO lambdasymbols 

10474  1385 

10547  1386 
* CTT: theory Main now available, containing everything (that is, Bool 
1387 
and Arith); 

1388 

10474  1389 

10391  1390 
*** General *** 
1391 

10547  1392 
* Pure: the Simplifier has been implemented properly as a derived rule 
1393 
outside of the actual kernel (at last!); the overall performance 

1394 
penalty in practical applications is about 50%, while reliability of 

1395 
the Isabelle inference kernel has been greatly improved; 

1396 

11112  1397 
* print modes "brackets" and "no_brackets" control output of nested => 
1398 
(types) and ==> (props); the default behaviour is "brackets"; 

1399 

10391  1400 
* Provers: fast_tac (and friends) now handle actual objectlogic rules 
1401 
as assumptions as well; 

1402 

11124  1403 
* system: support Poly/ML 4.0; 
1404 

1405 
* system: isatool install handles KDE version 1 or 2; 

1406 

10391  1407 

10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1408 

10103  1409 
New in Isabelle991 (October 2000) 
1410 
 

8015  1411 

10003  1412 
*** Overview of INCOMPATIBILITIES *** 
8014  1413 

8848  1414 
* HOL: simplification of natural numbers is much changed; to partly 