author  wenzelm 
Wed, 13 Apr 2005 18:34:22 +0200  
changeset 15703  727ef1b8b3ee 
parent 15696  1da4ce092c0b 
child 15724  1b89c781a7ec 
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 

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

166 

167 

168 
*** Document preparation *** 

169 

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

171 
definitions, equations, inequations etc. 

172 

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

174 
alternative context used for evaluating and printing the subsequent 

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

176 

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

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

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

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

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

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

183 

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

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

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

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

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

189 
declared using IsarOutput.add_hidden_commands. 

190 

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

191 

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

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

193 

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

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

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

198 

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

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

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

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

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

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

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

207 
called <record_name>_ext_type. 

208 

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

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

212 
records can take quite long. 

213 

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

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

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

217 
occasionally, since simplification is more powerful by default. 

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

218 

14878  219 
* HOL: symbolic syntax of Hilbert Choice Operator is now as follows: 
220 

221 
syntax (epsilon) 

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

223 

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

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

226 
Moreover, the mathematically important symbolic identifier 

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

228 

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

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

15356  232 

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

235 

15046  236 
* HOL/SetInterval: The syntax for open intervals has changed: 
237 

238 
Old New 

239 
{..n(} > {..<n} 

240 
{)n..} > {n<..} 

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

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

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

244 

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

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

247 

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

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

250 

251 
They are not perfect but work quite well. 

252 

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

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

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

257 

258 
There is new syntax for summation over finite sets: 

15046  259 

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

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

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

15046  264 

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

266 
now translates into 'setsum' as above. 

267 

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

270 

15200  271 
* HOL/Simplifier: 
272 

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

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

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

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

277 

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

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

280 
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

281 

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

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

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

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

287 
enabled/disabled by the reference use_let_simproc. Potential 

288 
INCOMPATIBILITY since simplification is more powerful by default. 

289 

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

290 

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

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

292 

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

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

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

296 

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

297 

14885  298 
*** ZF *** 
299 

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

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

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

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

303 

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

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

305 
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

306 
the old version is still required for ML proof scripts. 
14885  307 

308 

15703  309 
*** System *** 
310 

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

312 
(containing Boolean satisfiability problems) into Isabelle/HOL 

313 
theories. 

314 

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

316 
used by Isabelle; default is ROOT.ML. 

317 

318 
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for 

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

320 

321 

322 
*** ML *** 

323 

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

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

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

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

328 
Already formatted output may be embedded into further text via 

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

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

331 
accommodate easy composition of diagnostic messages etc. 

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

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

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

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

336 
required when capturing already output material that will eventually 

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

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

339 

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

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

342 
components are stored in the theory and patched into the 

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

344 
dependent components are maintained by the following theory 

345 
operations: 

346 

347 
Simplifier.add_context_simprocs 

348 
Simplifier.del_context_simprocs 

349 
Simplifier.set_context_subgoaler 

350 
Simplifier.reset_context_subgoaler 

351 
Simplifier.add_context_looper 

352 
Simplifier.del_context_looper 

353 
Simplifier.add_context_unsafe_solver 

354 
Simplifier.add_context_safe_solver 

355 

356 
Classical.add_context_safe_wrapper 

357 
Classical.del_context_safe_wrapper 

358 
Classical.add_context_unsafe_wrapper 

359 
Classical.del_context_unsafe_wrapper 

360 

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

362 
local_simpset_of and local_claset_of to instead of the primitive 

363 
Simplifier.get_local_simpset and Classical.get_local_claset, 

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

365 

366 

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

367 

14606  368 
New in Isabelle2004 (April 2004) 
369 
 

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

370 

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

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

372 

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

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

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

375 

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

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

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

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

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

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

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

385 
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

386 

14237  387 
* Pure: Macintosh and Windows linebreaks are now allowed in theory files. 
388 

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

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

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

14233  393 

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

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

14333  398 

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

399 
* Pure: Controlsymbols of the form \<^raw:...> will literally print the 
14606  400 
content of "..." to the latex file instead of \isacntrl... . The "..." 
401 
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

402 

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

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

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

14224  407 
rather than definitionally, such as the metalogic connectives. 
408 

14606  409 
* Pure: 'instance' now handles general arities with general sorts 
410 
(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

411 

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

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

416 

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

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

418 

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

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

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

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

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

423 
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

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

425 
 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

426 
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

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

428 

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

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

430 
 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

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

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

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

434 

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

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

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

437 
and derived forms. 
14283  438 

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

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

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

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

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

443 
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

444 
 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

445 
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

446 
 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

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

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

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

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

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

455 
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

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

459 
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

460 

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

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

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

463 

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

464 

14136  465 
*** HOL *** 
466 

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

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

470 
can be used like any other Isabelle image. See 

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

472 

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

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

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

475 
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

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

477 
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

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

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

480 
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

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

482 

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

486 
* Numerics: 

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

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

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

14389  494 

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

14255  497 
* Records: 
498 
 Record types are now by default printed with their type abbreviation 

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

500 
the reference "print_record_type_abbr". 

14731  501 
 Simproc "record_upd_simproc" for simplification of multiple updates added 
14255  502 
(not enabled by default). 
14427  503 
 Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp. 
504 
EX x. x = sel r to True (not enabled by default). 

14255  505 
 Tactic "record_split_simp_tac" to split and simplify records added. 
14731  506 

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

14136  510 

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

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

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

514 

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

14731  518 
* HOLMatrix: a first theory for matrices in HOL with an application of 
14610  519 
matrix theory to linear programming. 
14136  520 

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

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

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

14380  526 

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

14418  530 
like in normal math, and corresponding versions for < and for intersection. 
531 

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

534 

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

14380  537 

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

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

541 

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

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

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

546 
for examples. 

14464  547 

14606  548 

14536  549 
*** HOLCF *** 
550 

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

552 

14572  553 

554 

14136  555 
New in Isabelle2003 (May 2003) 
14606  556 
 
14136  557 

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

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

559 

13618  560 
* Provers/simplifier: 
561 

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

565 
the order of assumptions. 

566 

567 
Potential INCOMPATIBILITY: 

568 

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

13618  571 

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

573 

13781  574 
now gives rise to the infinite reduction sequence 
575 

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

577 

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

579 
kind of problem. 

580 

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

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

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

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

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

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

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

13618  588 

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

590 

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

593 
conditions before applying the rewrite rule): 

594 
ML "simp_depth_limit := n" 

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

596 
the simplifier would diverge. 

597 

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

598 
 Accepts free variables as head terms in congruence rules. Useful in Isar. 
13829  599 

13938  600 
 No longer aborts on failed congruence proof. Instead, the 
601 
congruence is ignored. 

602 

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

605 
as HOL/Extraction for some case studies. 

606 

13868  607 
* Pure: The main goal of the proof state is no longer shown by default, only 
608 
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

609 
PG menu: Isabelle/Isar > Settings > Show Main Goal 
13815  610 
(ML: Proof.show_main_goal). 
611 

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

613 
rules whose conclusion matches subgoal 1: 

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

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

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

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

618 
(ML: ProofGeneral.print_intros()) 

619 

620 
* Pure: New flag trace_unify_fail causes unification to print 

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

623 
assumption failed. 

624 

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

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

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

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

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

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

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

632 

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

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

634 
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

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

636 

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

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

638 
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

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

642 
be given (the default is 40); 

643 

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

645 
(batchmode only); 

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

646 

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

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

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

649 
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

650 

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

653 
for slight decrease in efficiency; 

654 

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

657 

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

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

659 
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

660 

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

661 

13158  662 
*** HOL *** 
663 

13899  664 
* arith(_tac) 
665 

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

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

668 
of quantifierfree linear arithmetic. 

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

670 

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

672 

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

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

14731  675 
Presburger arithmetic can also be called explicitly via presburger(_tac). 
13899  676 

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

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

679 

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

681 
are distributed over a sum of terms; 

682 

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

14731  685 
"<=", "<" and "="). 
686 

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

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

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

692 

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

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

694 
Finite_Set); 
13492  695 

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

698 

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

701 

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

704 
of the empty set. 

705 

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

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

709 
Univariate Polynomials). Contributions welcome; 

13960  710 

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

712 

14731  713 
* Complex: new directory of the complex numbers with numeric constants, 
714 
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

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

716 

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

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

718 

14731  719 
* 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

720 
Fleuriot); 
13960  721 

13549  722 
* Real/HahnBanach: updated and adapted to locales; 
723 

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

13872  726 

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

728 

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

731 

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

734 
classes, interfaces, objects,virtual methods, static methods, 

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

736 
assignment, exceptions. 

13549  737 

14011  738 

13549  739 
*** ZF *** 
740 

15154  741 
* ZF/Constructible: consistency proof for AC (Gdel's constructible 
13549  742 
universe, etc.); 
743 

13872  744 
* Main ZF: virtually all theories converted to newstyle format; 
13518  745 

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

746 

13478  747 
*** ML *** 
748 

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

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

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

752 

753 
* Pure: improved error reporting of simprocs; 

754 

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

756 
up simprocs; 

757 

758 

13953  759 
*** Document preparation *** 
760 

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

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

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

764 

14731  765 
* minimized dependencies of isabelle.sty and isabellesym.sty on 
13953  766 
other packages 
767 

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

769 
broke \Rightarrow) 

770 

14731  771 
* normal size for \<zero>...\<nine> (uses \mathbf instead of 
13954  772 
textcomp package) 
13953  773 

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

774 

14572  775 

12984  776 
New in Isabelle2002 (March 2002) 
777 
 

11474  778 

11572  779 
*** Document preparation *** 
780 

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

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

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

783 
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

784 
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

785 
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

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

787 

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

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

789 
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

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

791 

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

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

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

794 

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

797 

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

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

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

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

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

806 
isatool document copies the Isabelle style files to the target 

807 
location; 

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

808 

11572  809 

11633  810 
*** Isar *** 
811 

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

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

815 
 'induct' method divinates rule instantiation from the inductive 

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

817 
instantiation of cases; 

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

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

820 
rules without further ado; 

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

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

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

824 
statement becomes is included in the hypothesis, avoiding the 

825 
slightly cumbersome show "PROP ?case" form; 

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

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

828 
rules stemming from inductive sets to be applied in unstructured 

829 
scripts, while still benefitting from proper handling of nonatomic 

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

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

832 
 'induct' proper support for mutual induction involving nonatomic 

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

834 
below); 

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

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

837 
 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

838 
 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

839 
 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

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

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

842 
 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

843 

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

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

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

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

847 
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

848 
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

849 
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

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

851 

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

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

853 

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

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

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

856 

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

857 
* Pure: proper integration with ``locales''; unlike the original 
15154  858 
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

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

863 
some examples; 

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

864 

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

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

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

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

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

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

870 

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

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

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

875 
the context elements being discharged in the obvious way; 

876 

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

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

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

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

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

882 

11722  883 
* Pure: renamed "antecedent" case to "rule_context"; 
884 

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

887 
use hardwired "Trueprop"; 

888 

11738  889 
* Pure: added 'corollary' command; 
890 

11722  891 
* Pure: fixed 'token_translation' command; 
892 

11899  893 
* Pure: removed obsolete 'exported' attribute; 
894 

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

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

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

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

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

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

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

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

904 

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

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

906 
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

907 
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

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

909 

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

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

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

912 

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

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

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

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

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

917 

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

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

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

920 

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

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

922 
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

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

924 

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

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

926 
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

927 
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

928 

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

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

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

931 
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

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

933 
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

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

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

936 

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

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

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

939 

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

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

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

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

943 

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

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

945 

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

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

951 

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

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

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

954 

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

955 

11474  956 
*** HOL *** 
957 

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

960 

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

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

963 

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

965 
binary representation internally; 

966 

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

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

969 

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

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

971 
are some hints on converting existing sources: 
11702  972 

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

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

975 
to be spaced properly; 

976 

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

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

979 

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

981 

982 
 remove all special provisions on numerals in proofs; 

983 

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

12736  987 
* HOL: symbolic syntax for x^2 (numeral 2); 
988 

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

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

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

991 
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

992 
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

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

994 

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

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

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

999 
declared as simp by default; 

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

1000 
 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

1001 
qualified)  potential INCOMPATIBILITY; 
12280  1002 
 removed "make_scheme" operations (use "make" with "extend")  
1003 
INCOMPATIBILITY; 

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

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

1010 

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

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

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

1013 
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

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

1015 

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

13824  1018 
* HOL: consolidated and renamed several theories. In particular: 
14731  1019 
Ord.thy has been absorbed into HOL.thy 
1020 
String.thy has been absorbed into List.thy 

1021 

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

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

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

1024 

11657  1025 
* HOL: linorder_less_split superseded by linorder_cases; 
1026 

12917  1027 
* HOL/List: "nodups" renamed to "distinct"; 
12889  1028 

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

11437  1032 

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

1035 

1036 
delSWrapper "split_all_tac" 

1037 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

1038 

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

11474  1040 
MAY FAIL; 
11361  1041 

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

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

1045 
necessary to attach explicit type constraints; 

11307  1046 

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

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

12489  1050 

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

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

1052 
expressions; 
11474  1053 

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

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

1055 
of "lam"  INCOMPATIBILITY; 
11474  1056 

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

1059 
renamed "Product_Type.unit"; 

11611  1060 

12564  1061 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
1062 

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

1065 

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

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

1068 

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

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

1070 
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

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

1072 

12734  1073 
* HOLReal: added Complex_Numbers (by Gertrud Bauer); 
1074 

12690  1075 
* HOLHyperreal is now a logic image; 
1076 

11611  1077 

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

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

1079 

12622  1080 
* Isar: consts/constdefs supports mixfix syntax for continuous 
1081 
operations; 

1082 

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

1084 
HOLCF/ex/Dnat.thy; 

1085 

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

12280  1087 
potential INCOMPATIBILITY; now use plain induct_tac instead of former 
1088 
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

1089 

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

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

1091 

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

1092 

11474  1093 
*** ZF *** 
1094 

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

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

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

1099 

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

1101 
your theory on Main_ZFC; 

1102 

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

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

12563  1105 

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

1108 

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

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

1111 

12280  1112 
* 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

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

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

1115 

13025  1116 
* ZF: many new theorems about lists, ordinals, etc.; 
12850  1117 

11474  1118 

1119 
*** General *** 

1120 

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

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

1124 
also ref manual for further ML interfaces; 

1125 

1126 
* Pure/axclass: removed obsolete ML interface 

1127 
goal_subclass/goal_arity; 

1128 

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

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

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

1132 
properly; 

1133 

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

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

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

1136 

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

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

1138 
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

1139 
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

1140 
type variable); 
12280  1141 

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

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

1144 
"type_brackets"; 

1145 

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

11817  1147 
tokens into AST constants; 
11474  1148 

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

1151 
multiple declarations for same syntax element constant; 

1152 

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

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

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

1155 

12280  1156 
* Provers/classical: renamed addaltern to addafter, addSaltern to 
1157 
addSafter; 

1158 

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

1160 
as well; 

12253  1161 

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

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

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

1166 
support requires further installations, e.g. from 

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

1168 

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

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

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

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

1173 

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

1176 

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

1179 
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

1180 

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

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

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

11551  1186 

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

1189 
isolatin characters may now be used; the related isatools 

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

1191 

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

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

1194 
terminal); 

1195 

11314  1196 

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

1197 

11062  1198 
New in Isabelle992 (February 2001) 
1199 
 

1200 

10224  1201 
*** Overview of INCOMPATIBILITIES *** 
1202 

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

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

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

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

1208 
but only as far as specified by the introductions given; the old 
11130  1209 
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

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

1211 

10998  1212 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
1213 
gfp_Tarski to gfp_unfold; 

10224  1214 

10288  1215 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
1216 

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

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

10793  1220 

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

1223 

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

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

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

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

1229 
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

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

1231 

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

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

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

1234 

10224  1235 

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

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

1237 

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

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

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

1242 
typewriter); 

1243 

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

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

1245 
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

1246 

10858  1247 
* some more standard symbols; see Appendix A of the system manual for 
11062  1248 
the complete list of symbols defined in isabellesym.sty; 
10858  1249 

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

1252 
definitions); 

1253 

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

1256 
actual humanreadable proof documents. Please do not include goal 

1257 
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

1258 

11062  1259 
* proper indentation of antiquoted output with proportional LaTeX 
1260 
fonts; 

10862  1261 

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

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

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

1264 

11062  1265 
* isatool unsymbolize tunes sources for plain ASCII communication; 
1266 

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

1267 

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

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

1269 

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

1272 
documents, due to unpredictable outcome and noncompositional proof 

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

1274 
for Prologstyle synthesis of proven results; 

1275 

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

1278 

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

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

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

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

1283 

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

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

1286 

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

1288 
statements as well; 

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

1289 

11097  1290 
* Pure: more robust selection of calculational rules; 
1291 

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

1294 

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

1296 
lemmas, using the graph browser tool; 

1297 

10944  1298 
* Pure: predict failure of "show" in interactive mode; 
1299 

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

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

1301 

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

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

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

1304 

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

1308 

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

1311 
the result to be shown in each case; 

1312 

10770  1313 
* HOL: added 'recdef_tc' command; 
1314 

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

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

1316 

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

1317 

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

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

1319 

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

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

1321 
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

1322 
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

1323 
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While 
10337  1324 
(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

1325 

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

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

1329 

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

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

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

1334 
literature; 

1335 

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

1339 

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

1342 

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

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

1344 
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

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

1346 

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

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

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

1349 

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

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

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

1352 

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

1355 
functions for the reals; 

10756  1356 

11094  1357 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  1358 

10858  1359 

10474  1360 
*** CTT *** 
1361 

10547  1362 
* CTT: xsymbol support for Pi, Sigma, >, : (membership); note that 
1363 
"lam" is displayed as TWO lambdasymbols 

10474  1364 

10547  1365 
* CTT: theory Main now available, containing everything (that is, Bool 
1366 
and Arith); 

1367 

10474  1368 

10391  1369 
*** General *** 
1370 

10547  1371 
* Pure: the Simplifier has been implemented properly as a derived rule 
1372 
outside of the actual kernel (at last!); the overall performance 

1373 
penalty in practical applications is about 50%, while reliability of 

1374 
the Isabelle inference kernel has been greatly improved; 

1375 

11112  1376 
* print modes "brackets" and "no_brackets" control output of nested => 
1377 
(types) and ==> (props); the default behaviour is "brackets"; 

1378 

10391  1379 
* Provers: fast_tac (and friends) now handle actual objectlogic rules 
1380 
as assumptions as well; 

1381 

11124  1382 
* system: support Poly/ML 4.0; 
1383 

1384 
* system: isatool install handles KDE version 1 or 2; 

1385 

10391  1386 

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

1387 

10103  1388 
New in Isabelle991 (October 2000) 
1389 
 

8015  1390 

10003  1391 
*** Overview of INCOMPATIBILITIES *** 
8014  1392 

8848  1393 
* HOL: simplification of natural numbers is much changed; to partly 
1394 
recover the old behaviour (e.g. to prevent n+n rewriting to #2*n) 

1395 
issue the following ML commands: 

1396 

1397 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

1398 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  1399 

10129  1400 
* HOL: simplification no longer dives into caseexpressions; this is 
1401 
controlled by "t.weak_case_cong" for each datatype t; 

10003  1402 

1403 
* HOL: nat_less_induct renamed to less_induct; 

1404 

1405 
* HOL: systematic renaming of the SOME (Eps) rules, may use isatool 

1406 
fixsome to patch .thy and .ML sources automatically; 

8967  1407 

10003  1408 
select_equality > some_equality 
1409 
select_eq_Ex > some_eq_ex 

1410 
selectI2EX > someI2_ex 

1411 
selectI2 > someI2 

1412 
selectI > someI 

1413 
select1_equality > some1_equality 

1414 
Eps_sym_eq > some_sym_eq_trivial 
