author  berghofe 
Tue, 11 Jan 2005 14:20:45 +0100  
changeset 15436  d059da8434a5 
parent 15423  761a4f8e6ad6 
child 15454  4b339d3907a0 
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 

15350  9 
* Document preparation: new antiquotations @{lhs thm} and @{rhs thm} 
10 
printing the lhs/rhs of definitions, equations, inequations etc. 

11 

15287  12 
* isatool usedir: new option f that allows specification of the ML 
13 
file to be used by Isabelle; default is ROOT.ML. 

15277  14 

15130  15 
* Theory headers: the new header syntax for Isar theories is 
16 

17 
theory <name> 

15148  18 
imports <theory1> ... <theoryn> 
15130  19 
begin 
20 

15148  21 
optionally also with a "files" section. The syntax 
15130  22 

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

24 

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

26 
The syntax of oldstyle theories has not changed. 

27 

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

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

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

30 

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

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

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

33 

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

36 

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

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

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

41 
to observe strictly sequential dependencies of definitions within a 

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

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

44 
'defs' separately. 

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

45 

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

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

49 
expressions. Secondly, in a local context with structure 

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

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

52 
show_structs controls printing of implicit structures. Typical 

53 
applications of these concepts involve record types and locales. 

54 

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

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

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

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

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

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

60 
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

61 
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

62 

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

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

66 
objectlogic specifications. 

67 

15022  68 
* Pure: print_tac now outputs the goal through the trace channel. 
69 

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

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

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

73 
value is true. 

15018  74 

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

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

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

77 

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

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

79 

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

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

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

82 

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

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

84 
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

85 
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

86 

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

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

88 
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

89 
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

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

91 
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

92 
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

93 
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

94 

15406  95 
* Pure/Simplifier: Command "find_rewrites" takes a string and lists all 
96 
equality theorems (not just those with attribute simp!) whose lefthand 

97 
side matches the term given via the string. In PG the command can be 

98 
activated via Isabelle > Show me > matching rewrites. 

99 

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

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

101 
dependent plugins (simprocs, solvers, wrappers etc.). These extra 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

102 
components are stored in the theory and patched into the 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

103 
simpset/claset when used in an Isar proof context. Context 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

104 
dependent components are maintained by the following theory 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

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

106 

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

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

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

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

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

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

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

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

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

115 

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

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

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

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

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

120 

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

121 
IMPORTANT NOTE: proof tools (methods etc.) need to use 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

122 
local_simpset_of and local_claset_of to instead of the primitive 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

123 
Simplifier.get_local_simpset and Classical.get_local_claset, 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

124 
respectively, in order to see the context dependent fields! 
14816
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

125 

14897
577f95db94e4
* Document preparation: antiquotations provide option 'locale=NAME';
wenzelm
parents:
14885
diff
changeset

126 
* Document preparation: antiquotations now provide the option 
577f95db94e4
* Document preparation: antiquotations provide option 'locale=NAME';
wenzelm
parents:
14885
diff
changeset

127 
'locale=NAME' to specify an alternative context used for evaluating 
577f95db94e4
* Document preparation: antiquotations provide option 'locale=NAME';
wenzelm
parents:
14885
diff
changeset

128 
and printing the subsequent argument, as in @{thm [locale=LC] 
14919  129 
fold_commute}, for example. 
14897
577f95db94e4
* Document preparation: antiquotations provide option 'locale=NAME';
wenzelm
parents:
14885
diff
changeset

130 

14934  131 
* Document preparation: commands 'display_drafts' and 'print_drafts' 
132 
perform simple output of raw sources. Only those symbols that do 

133 
not require additional LaTeX packages (depending on comments in 

134 
isabellesym.sty) are displayed properly, everything else is left 

135 
verbatim. We use isatool display and isatool print as front ends; 

136 
these are subject to the DVI_VIEWER and PRINT_COMMAND settings, 

137 
respectively. 

138 

15436  139 
* Document preparation: Proof scripts as well as some other commands 
140 
such as ML or parse/print_translation can now be hidden in the document. 

141 
Hiding can be enabled either via the option 'H true' of isatool usedir 

142 
or by setting the reference variable IsarOutput.hide_commands. Additional 

143 
commands to be hidden may be declared using IsarOutput.add_hidden_commands. 

144 

14917  145 
* ML: output via the Isabelle channels of writeln/warning/error 
146 
etc. is now passed through Output.output, with a hook for arbitrary 

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

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

149 
Already formatted output may be embedded into further text via 

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

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

152 
accommodate easy composition of diagnostic messages etc. 

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

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

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

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

157 
required when capturing already output material that will eventually 

14972  158 
be presented to the user a second time. For the default print mode, 
159 
both Output.output and Output.raw have no effect. 

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

160 

14707  161 

15127  162 
*** Isar *** 
163 

164 
* Locales: 

165 
 "includes" disallowed in declaration of named locales (command "locale"). 

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

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

167 
INCOMPATIBILITY: rarely, the generated theorem statement is different. 
15127  168 

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

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

170 

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

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

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

175 

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

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

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

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

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

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

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

184 
called <record_name>_ext_type. 

185 

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

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

189 
records can take quite long. 

190 

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

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

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

194 
occasionally, since simplification is more powerful by default. 

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

195 

14878  196 
* HOL: symbolic syntax of Hilbert Choice Operator is now as follows: 
197 

198 
syntax (epsilon) 

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

200 

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

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

203 
Moreover, the mathematically important symbolic identifier 

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

205 

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

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

15356  209 

15046  210 
* HOL/SetInterval: The syntax for open intervals has changed: 
211 

212 
Old New 

213 
{..n(} > {..<n} 

214 
{)n..} > {n<..} 

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

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

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

218 

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

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

221 

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

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

224 

225 
They are not perfect but work quite well. 

226 

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

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

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

231 

232 
There is new syntax for summation over finite sets: 

15046  233 

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

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

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

15046  238 

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

240 
now translates into 'setsum' as above. 

241 

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

244 

15200  245 
* HOL/Simplifier: 
246 

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

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

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

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

251 

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

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

254 
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

255 

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

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

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

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

261 
enabled/disabled by the reference use_let_simproc. Potential 

262 
INCOMPATIBILITY since simplification is more powerful by default. 

263 

15154  264 
* HOL: new 'isatool dimacs2hol' to convert files in DIMACS CNF format 
265 
(containing Boolean satisfiability problems) into Isabelle/HOL theories. 

266 

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

267 

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

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

269 

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

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

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

273 

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

274 

14885  275 
*** ZF *** 
276 

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

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

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

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

280 

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

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

282 
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

283 
the old version is still required for ML proof scripts. 
14885  284 

285 

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

286 

14606  287 
New in Isabelle2004 (April 2004) 
288 
 

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

289 

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

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

291 

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

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

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

294 

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

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

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

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

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

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

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

304 
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

305 

14237  306 
* Pure: Macintosh and Windows linebreaks are now allowed in theory files. 
307 

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

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

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

14233  312 

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

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

14333  317 

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

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

321 

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

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

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

14224  326 
rather than definitionally, such as the metalogic connectives. 
327 

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

330 

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

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

335 

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

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

337 

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

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

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

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

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

342 
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

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

344 
 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

345 
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

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

347 

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

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

349 
 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

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

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

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

353 

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

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

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

356 
and derived forms. 
14283  357 

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

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

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

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

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

362 
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

363 
 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

364 
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

365 
 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

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

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

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

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

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

374 
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

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

378 
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

379 

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

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

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

382 

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

383 

14136  384 
*** HOL *** 
385 

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

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

389 
can be used like any other Isabelle image. See 

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

391 

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

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

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

394 
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

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

396 
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

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

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

399 
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

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

401 

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

405 
* Numerics: 

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

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

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

14389  413 

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

14255  416 
* Records: 
417 
 Record types are now by default printed with their type abbreviation 

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

419 
the reference "print_record_type_abbr". 

14731  420 
 Simproc "record_upd_simproc" for simplification of multiple updates added 
14255  421 
(not enabled by default). 
14427  422 
 Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp. 
423 
EX x. x = sel r to True (not enabled by default). 

14255  424 
 Tactic "record_split_simp_tac" to split and simplify records added. 
14731  425 

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

14136  429 

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

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

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

433 

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

14731  437 
* HOLMatrix: a first theory for matrices in HOL with an application of 
14610  438 
matrix theory to linear programming. 
14136  439 

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

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

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

14380  445 

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

14418  449 
like in normal math, and corresponding versions for < and for intersection. 
450 

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

14380  453 

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

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

457 

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

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

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

462 
for examples. 

14464  463 

14606  464 

14536  465 
*** HOLCF *** 
466 

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

468 

14572  469 

470 

14136  471 
New in Isabelle2003 (May 2003) 
14606  472 
 
14136  473 

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

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

475 

13618  476 
* Provers/simplifier: 
477 

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

481 
the order of assumptions. 

482 

483 
Potential INCOMPATIBILITY: 

484 

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

13618  487 

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

489 

13781  490 
now gives rise to the infinite reduction sequence 
491 

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

493 

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

495 
kind of problem. 

496 

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

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

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

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

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

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

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

13618  504 

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

506 

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

509 
conditions before applying the rewrite rule): 

510 
ML "simp_depth_limit := n" 

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

512 
the simplifier would diverge. 

513 

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

514 
 Accepts free variables as head terms in congruence rules. Useful in Isar. 
13829  515 

13938  516 
 No longer aborts on failed congruence proof. Instead, the 
517 
congruence is ignored. 

518 

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

521 
as HOL/Extraction for some case studies. 

522 

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

525 
PG menu: Isabelle/Isar > Settings > Show Main Goal 
13815  526 
(ML: Proof.show_main_goal). 
527 

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

529 
rules whose conclusion matches subgoal 1: 

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

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

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

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

534 
(ML: ProofGeneral.print_intros()) 

535 

536 
* Pure: New flag trace_unify_fail causes unification to print 

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

539 
assumption failed. 

540 

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

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

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

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

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

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

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

548 

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

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

550 
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

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

552 

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

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

554 
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

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

558 
be given (the default is 40); 

559 

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

561 
(batchmode only); 

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

562 

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

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

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

565 
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

566 

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

569 
for slight decrease in efficiency; 

570 

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

573 

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

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

575 
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

576 

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

577 

13158  578 
*** HOL *** 
579 

13899  580 
* arith(_tac) 
581 

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

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

584 
of quantifierfree linear arithmetic. 

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

586 

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

588 

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

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

14731  591 
Presburger arithmetic can also be called explicitly via presburger(_tac). 
13899  592 

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

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

595 

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

597 
are distributed over a sum of terms; 

598 

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

14731  601 
"<=", "<" and "="). 
602 

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

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

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

608 

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

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

610 
Finite_Set); 
13492  611 

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

614 

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

617 

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

620 
of the empty set. 

621 

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

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

625 
Univariate Polynomials). Contributions welcome; 

13960  626 

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

628 

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

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

632 

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

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

634 

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

636 
Fleuriot); 
13960  637 

13549  638 
* Real/HahnBanach: updated and adapted to locales; 
639 

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

13872  642 

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

644 

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

647 

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

650 
classes, interfaces, objects,virtual methods, static methods, 

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

652 
assignment, exceptions. 

13549  653 

14011  654 

13549  655 
*** ZF *** 
656 

15154  657 
* ZF/Constructible: consistency proof for AC (Gdel's constructible 
13549  658 
universe, etc.); 
659 

13872  660 
* Main ZF: virtually all theories converted to newstyle format; 
13518  661 

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

662 

13478  663 
*** ML *** 
664 

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

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

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

668 

669 
* Pure: improved error reporting of simprocs; 

670 

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

672 
up simprocs; 

673 

674 

13953  675 
*** Document preparation *** 
676 

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

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

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

680 

14731  681 
* minimized dependencies of isabelle.sty and isabellesym.sty on 
13953  682 
other packages 
683 

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

685 
broke \Rightarrow) 

686 

14731  687 
* normal size for \<zero>...\<nine> (uses \mathbf instead of 
13954  688 
textcomp package) 
13953  689 

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

690 

14572  691 

12984  692 
New in Isabelle2002 (March 2002) 
693 
 

11474  694 

11572  695 
*** Document preparation *** 
696 

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

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

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

699 
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

700 
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

701 
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

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

703 

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

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

705 
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

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

707 

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

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

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

710 

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

713 

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

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

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

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

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

722 
isatool document copies the Isabelle style files to the target 

723 
location; 

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

724 

11572  725 

11633  726 
*** Isar *** 
727 

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

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

731 
 'induct' method divinates rule instantiation from the inductive 

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

733 
instantiation of cases; 

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

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

736 
rules without further ado; 

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

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

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

740 
statement becomes is included in the hypothesis, avoiding the 

741 
slightly cumbersome show "PROP ?case" form; 

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

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

744 
rules stemming from inductive sets to be applied in unstructured 

745 
scripts, while still benefitting from proper handling of nonatomic 

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

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

748 
 'induct' proper support for mutual induction involving nonatomic 

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

750 
below); 

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

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

753 
 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

754 
 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

755 
 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

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

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

758 
 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

759 

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

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

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

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

763 
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

764 
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

765 
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

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

767 

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

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

769 

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

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

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

772 

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

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

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

779 
some examples; 

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

780 

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

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

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

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

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

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

786 

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

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

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

791 
the context elements being discharged in the obvious way; 

792 

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

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

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

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

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

798 

11722  799 
* Pure: renamed "antecedent" case to "rule_context"; 
800 

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

803 
use hardwired "Trueprop"; 

804 

11738  805 
* Pure: added 'corollary' command; 
806 

11722  807 
* Pure: fixed 'token_translation' command; 
808 

11899  809 
* Pure: removed obsolete 'exported' attribute; 
810 

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

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

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

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

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

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

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

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

820 

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

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

822 
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

823 
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

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

825 

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

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

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

828 

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

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

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

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

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

833 

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

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

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

836 

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

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

838 
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

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

840 

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

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

842 
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

843 
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

844 

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

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

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

847 
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

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

849 
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

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

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

852 

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

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

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

855 

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

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

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

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

859 

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

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

861 

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

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

867 

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

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

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

870 

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

871 

11474  872 
*** HOL *** 
873 

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

876 

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

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

879 

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

881 
binary representation internally; 

882 

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

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

885 

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

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

887 
are some hints on converting existing sources: 
11702  888 

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

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

891 
to be spaced properly; 

892 

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

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

895 

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

897 

898 
 remove all special provisions on numerals in proofs; 

899 

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

12736  903 
* HOL: symbolic syntax for x^2 (numeral 2); 
904 

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

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

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

907 
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

908 
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

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

910 

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

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

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

915 
declared as simp by default; 

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

916 
 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

917 
qualified)  potential INCOMPATIBILITY; 
12280  918 
 removed "make_scheme" operations (use "make" with "extend")  
919 
INCOMPATIBILITY; 

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

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

926 

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

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

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

929 
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

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

931 

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

13824  934 
* HOL: consolidated and renamed several theories. In particular: 
14731  935 
Ord.thy has been absorbed into HOL.thy 
936 
String.thy has been absorbed into List.thy 

937 

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

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

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

940 

11657  941 
* HOL: linorder_less_split superseded by linorder_cases; 
942 

12917  943 
* HOL/List: "nodups" renamed to "distinct"; 
12889  944 

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

11437  948 

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

951 

952 
delSWrapper "split_all_tac" 

953 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

954 

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

11474  956 
MAY FAIL; 
11361  957 

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

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

961 
necessary to attach explicit type constraints; 

11307  962 

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

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

12489  966 

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

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

968 
expressions; 
11474  969 

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

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

971 
of "lam"  INCOMPATIBILITY; 
11474  972 

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

975 
renamed "Product_Type.unit"; 

11611  976 

12564  977 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
978 

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

981 

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

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

984 

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

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

986 
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

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

988 

12734  989 
* HOLReal: added Complex_Numbers (by Gertrud Bauer); 
990 

12690  991 
* HOLHyperreal is now a logic image; 
992 

11611  993 

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

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

995 

12622  996 
* Isar: consts/constdefs supports mixfix syntax for continuous 
997 
operations; 

998 

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

1000 
HOLCF/ex/Dnat.thy; 

1001 

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

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

1005 

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

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

1007 

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

1008 

11474  1009 
*** ZF *** 
1010 

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

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

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

1015 

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

1017 
your theory on Main_ZFC; 

1018 

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

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

12563  1021 

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

1024 

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

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

1027 

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

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

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

1031 

13025  1032 
* ZF: many new theorems about lists, ordinals, etc.; 
12850  1033 

11474  1034 

1035 
*** General *** 

1036 

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

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

1040 
also ref manual for further ML interfaces; 

1041 

1042 
* Pure/axclass: removed obsolete ML interface 

1043 
goal_subclass/goal_arity; 

1044 

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

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

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

1048 
properly; 

1049 

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

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

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

1052 

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

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

1054 
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

1055 
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

1056 
type variable); 
12280  1057 

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

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

1060 
"type_brackets"; 

1061 

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

11817  1063 
tokens into AST constants; 
11474  1064 

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

1067 
multiple declarations for same syntax element constant; 

1068 

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

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

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

1071 

12280  1072 
* Provers/classical: renamed addaltern to addafter, addSaltern to 
1073 
addSafter; 

1074 

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

1076 
as well; 

12253  1077 

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

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

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

1082 
support requires further installations, e.g. from 

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

1084 

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

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

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

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

1089 

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

1092 

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

1095 
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

1096 

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

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

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

11551  1102 

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

1105 
isolatin characters may now be used; the related isatools 

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

1107 

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

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

1110 
terminal); 

1111 

11314  1112 

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

1113 

11062  1114 
New in Isabelle992 (February 2001) 
1115 
 

1116 

10224  1117 
*** Overview of INCOMPATIBILITIES *** 
1118 

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

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

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

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

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

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

1127 

10998  1128 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
1129 
gfp_Tarski to gfp_unfold; 

10224  1130 

10288  1131 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
1132 

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

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

10793  1136 

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

1139 

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

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

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

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

1145 
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

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

1147 

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

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

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

1150 

10224  1151 

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

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

1153 

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

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

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

1158 
typewriter); 

1159 

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

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

1161 
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

1162 

10858  1163 
* some more standard symbols; see Appendix A of the system manual for 
11062  1164 
the complete list of symbols defined in isabellesym.sty; 
10858  1165 

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

1168 
definitions); 

1169 

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

1172 
actual humanreadable proof documents. Please do not include goal 

1173 
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

1174 

11062  1175 
* proper indentation of antiquoted output with proportional LaTeX 
1176 
fonts; 

10862  1177 

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

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

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

1180 

11062  1181 
* isatool unsymbolize tunes sources for plain ASCII communication; 
1182 

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

1183 

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

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

1185 

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

1188 
documents, due to unpredictable outcome and noncompositional proof 

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

1190 
for Prologstyle synthesis of proven results; 

1191 

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

1194 

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

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

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

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

1199 

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

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

1202 

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

1204 
statements as well; 

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

1205 

11097  1206 
* Pure: more robust selection of calculational rules; 
1207 

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

1210 

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

1212 
lemmas, using the graph browser tool; 

1213 

10944  1214 
* Pure: predict failure of "show" in interactive mode; 
1215 

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

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

1217 

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

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

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

1220 

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

1224 

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

1227 
the result to be shown in each case; 

1228 

10770  1229 
* HOL: added 'recdef_tc' command; 
1230 

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

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

1232 

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

1233 

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

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

1235 

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

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

1237 
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

1238 
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

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

1241 

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

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

1245 

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

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

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

1250 
literature; 

1251 

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

1255 

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

1258 

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

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

1260 
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

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

1262 

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

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

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

1265 

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

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

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

1268 

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

1271 
functions for the reals; 

10756  1272 

11094  1273 
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; 
10391  1274 

10858  1275 

10474  1276 
*** CTT *** 
1277 

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

10474  1280 

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

1283 

10474  1284 

10391  1285 
*** General *** 
1286 

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

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

1290 
the Isabelle inference kernel has been greatly improved; 

1291 

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

1294 

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

1297 

11124  1298 
* system: support Poly/ML 4.0; 
1299 

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

1301 

10391  1302 

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

1303 

10103  1304 
New in Isabelle991 (October 2000) 
1305 
 

8015  1306 

10003  1307 
*** Overview of INCOMPATIBILITIES *** 
8014  1308 

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

1311 
issue the following ML commands: 

1312 

1313 
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; 

1314 
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; 

8788  1315 

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

10003  1318 

1319 
* HOL: nat_less_induct renamed to less_induct; 

1320 

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

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

8967  1323 

10003  1324 
select_equality > some_equality 
1325 
select_eq_Ex > some_eq_ex 

1326 
selectI2EX > someI2_ex 

1327 
selectI2 > someI2 

1328 
selectI > someI 

1329 
select1_equality > some1_equality 

1330 
Eps_sym_eq > some_sym_eq_trivial 

1331 
Eps_eq > some_eq_trivial 

1332 

1333 
* HOL: exhaust_tac on datatypes superceded by new generic case_tac; 

1334 

1335 
* HOL: removed obsolete theorem binding expand_if (refer to split_if 

1336 
instead); 

1337 

1338 
* HOL: the recursion equations generated by 'recdef' are now called 

1339 
f.simps instead of f.rules; 

1340 

1341 
* HOL: qed_spec_mp now also handles bounded ALL as well; 

1342 

1343 
* HOL: 0 is now overloaded, so the type constraint ":: nat" may 

1344 
sometimes be needed; 

1345 

1346 
* HOL: the constant for "f``x" is now "image" rather than "op ``"; 

8014  1347 

10065  1348 
* HOL: the constant for "f``x" is now "vimage" rather than "op ``"; 
1349 

9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset

1350 
* HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian 
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset

1351 
product is now "<*>" instead of "Times"; the lexicographic product is 
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset

1352 
now "<*lex*>" instead of "**"; 
8705  1353 

10003  1354 
* HOL: theory Sexp is now in HOL/Induct examples (it used to be part 
1355 
of main HOL, but was unused); better use HOL's datatype package; 

9971  1356 

10137
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

1357 
* HOL: removed "symbols" syntax for constant "override" of theory Map; 
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

1358 
the old syntax may be recovered as follows: 
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

1359 

d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

1360 
syntax (symbols) 
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

1361 
override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)" 
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

1362 
(infixl "\\<oplus>" 100) 
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset

1363 

8848  1364 
* HOL/Real: "rabs" replaced by overloaded "abs" function; 
1365 

8887
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset

1366 
* HOL/ML: even fewer consts are declared as global (see theories Ord, 
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset

1367 
Lfp, Gfp, WF); this only affects ML packages that refer to const names 
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset

1368 
internally; 
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset

1369 

10003  1370 
* HOL and ZF: syntax for quotienting wrt an equivalence relation 
1371 
changed from A/r to A//r; 

9908  1372 

10003  1373 
* ZF: new treatment of arithmetic (nat & int) may break some old 
1374 
proofs; 

8921
7c04c98132c4
* Pure: changed syntax of local blocks from {{ }} to { };
wenzelm
parents:
8887
diff
changeset

1375 

10003  1376 
* Isar: renamed some attributes (RS > THEN, simplify > simplified, 
1377 
rulify > rule_format, elimify > elim_format, ...); 

9542  1378 

9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset

1379 
* Isar/Provers: intro/elim/dest attributes changed; renamed 
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset

1380 
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one 
9937  1381 
should have to change intro!! to intro? only); replaced "delrule" by 
1382 
"rule del"; 

9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset

1383 

9612  1384 
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; 
1385 

9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset

1386 
* Provers: strengthened force_tac by using new first_best_tac; 
9402  1387 

10003  1388 
* LaTeX document preparation: several changes of isabelle.sty (see 
1389 
lib/texinputs); 

8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset

1390 

8014  1391 

8487  1392 
*** Document preparation *** 
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

1393 

9198
0ab3c81e9425
* formal comments (text blocks etc.) in newstyle theories may now
wenzelm
parents:
9185
diff
changeset

1394 
* formal comments (text blocks etc.) in newstyle theories may now 
9753  1395 
contain antiquotations of thm/prop/term/typ/text to be presented 
1396 
according to latex print mode; concrete syntax is like this: 

1397 
@{term[show_types] "f(x) = a + x"}; 

9198
0ab3c81e9425
* formal comments (text blocks etc.) in newstyle theories may now
wenzelm
parents:
9185
diff
changeset

1398 

8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

1399 
* isatool mkdir provides easy setup of Isabelle session directories, 
8518  1400 
including proper document sources; 
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset

1401 

a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
