author  wenzelm 
Tue, 17 May 2005 10:19:44 +0200  
changeset 15973  5fd94d84470f 
parent 15931  8d2fdcc558d1 
child 15979  c81578ac2d31 
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 

15130  9 
* Theory headers: the new header syntax for Isar theories is 
10 

11 
theory <name> 

15148  12 
imports <theory1> ... <theoryn> 
15130  13 
begin 
14 

15148  15 
optionally also with a "files" section. The syntax 
15130  16 

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

18 

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

20 
The syntax of oldstyle theories has not changed. 

21 

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

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

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

24 

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

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

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

27 

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

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

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

30 

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

33 

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

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

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

38 
name simplesubst. 

39 

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

42 
contains !! or ==>. 

43 

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

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

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

48 
to observe strictly sequential dependencies of definitions within a 

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

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

51 
'defs' separately. 

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

52 

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

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

56 
expressions. Secondly, in a local context with structure 

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

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

59 
show_structs controls printing of implicit structures. Typical 

60 
applications of these concepts involve record types and locales. 

61 

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

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

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

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

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

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

67 
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

68 
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

69 

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

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

73 
objectlogic specifications. 

74 

15744
daa84ebbdf94
Pure: command 'no_syntax' removes grammar declarations;
wenzelm
parents:
15727
diff
changeset

75 
* Pure: command 'no_syntax' removes grammar declarations (and 
daa84ebbdf94
Pure: command 'no_syntax' removes grammar declarations;
wenzelm
parents:
15727
diff
changeset

76 
translations) resulting from the given syntax specification, which 
daa84ebbdf94
Pure: command 'no_syntax' removes grammar declarations;
wenzelm
parents:
15727
diff
changeset

77 
is interpreted in the same manner as for the 'syntax' command. 
daa84ebbdf94
Pure: command 'no_syntax' removes grammar declarations;
wenzelm
parents:
15727
diff
changeset

78 

15022  79 
* Pure: print_tac now outputs the goal through the trace channel. 
80 

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

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

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

84 
value is true. 

15018  85 

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

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

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

88 

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

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

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

91 

15883
abff581e1d83
new thms_containing that searches for patterns instead of constants
kleing
parents:
15852
diff
changeset

92 
* Pure: new version of thms_containing that searches for a list 
abff581e1d83
new thms_containing that searches for patterns instead of constants
kleing
parents:
15852
diff
changeset

93 
of patterns instead of a list of constants. Available in 
abff581e1d83
new thms_containing that searches for patterns instead of constants
kleing
parents:
15852
diff
changeset

94 
ProofGeneral under ProofGeneral > Find Theorems or Cc Cf. 
abff581e1d83
new thms_containing that searches for patterns instead of constants
kleing
parents:
15852
diff
changeset

95 
Example search: "(_::nat) + _ + _" "_ ==> _" 
abff581e1d83
new thms_containing that searches for patterns instead of constants
kleing
parents:
15852
diff
changeset

96 

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

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

98 

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

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

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

101 

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

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

103 
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

104 
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

105 

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

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

107 
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

108 
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

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

110 
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

111 
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

112 
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

113 

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

118 

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

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

121 

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

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

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

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

126 

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

129 
instantiation of the locale parameters and compute proof obligations from 

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

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

132 
context. Interpretation is smart in that already active interpretations 

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

134 
in duplicate. 

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

15763
b901a127ac73
Interpretation supports statically scoped attributes; documentation.
ballarin
parents:
15744
diff
changeset

136 
For details, see the Isar Reference manual. 
15696  137 

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

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

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

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

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

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

143 

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

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

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

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

147 

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

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

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

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

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

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

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

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

155 

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

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

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

158 

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

161 

15801  162 
* Pure: reorganized bootstrapping of the Pure theories; CPure is now 
163 
derived from Pure, which contains all common declarations already. 

164 
Both theories are defined via plain Isabelle/Isar .thy files. 

165 
INCOMPATIBILITY: elements of CPure (such as the CPure.intro / 

166 
CPure.elim / CPure.dest attributes) now appear in the Pure name 

167 
space; use isatool fixcpure to adapt your theory and ML sources. 

168 

15703  169 

170 
*** Document preparation *** 

171 

15931  172 
* New antiquotation @{term_type term} printing a term with its 
173 
type annotated 

174 

175 
* New antiquotation @{typeof term} printing the  surprise  the type of 

176 
a term 

177 

178 
* New antiquotation @{const const} which is the same as @{term const} except 

179 
that const must be a defined constant identifier; helpful for early detection 

180 
of typoes 

181 

182 
* Two new antiquotations @{term_style style term} and @{thm_style style thm} 

183 
which print a term / theorem applying a "style" to it; predefined styles 

184 
are "lhs" and "rhs" printing the lhs/rhs of definitions, equations, 

185 
inequations etc. and "conclusion" printing only the conclusion of a theorem. 

186 
More styles may be defined using ML; see the "LaTeX Sugar" document for more 

15703  187 

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

189 
alternative context used for evaluating and printing the subsequent 

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

191 

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

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

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

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

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

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

198 

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

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

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

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

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

204 
declared using IsarOutput.add_hidden_commands. 

205 

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

206 

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

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

208 

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

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

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

213 

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

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

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

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

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

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

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

222 
called <record_name>_ext_type. 

223 

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

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

227 
records can take quite long. 

228 

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

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

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

232 
occasionally, since simplification is more powerful by default. 

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

233 

14878  234 
* HOL: symbolic syntax of Hilbert Choice Operator is now as follows: 
235 

236 
syntax (epsilon) 

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

238 

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

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

241 
Moreover, the mathematically important symbolic identifier 

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

243 

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

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

15356  247 

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

250 

15046  251 
* HOL/SetInterval: The syntax for open intervals has changed: 
252 

253 
Old New 

254 
{..n(} > {..<n} 

255 
{)n..} > {n<..} 

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

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

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

259 

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

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

262 

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

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

265 

266 
They are not perfect but work quite well. 

267 

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

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

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

272 

273 
There is new syntax for summation over finite sets: 

15046  274 

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

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

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

15046  279 

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

281 
now translates into 'setsum' as above. 

282 

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

285 

15200  286 
* HOL/Simplifier: 
287 

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

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

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

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

292 

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

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

295 
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

296 

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

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

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

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

302 
enabled/disabled by the reference use_let_simproc. Potential 

303 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  304 

305 
* HOL: The 'refute' command has been extended to support a much larger 

306 
fragment of HOL, including axiomatic type classes, constdefs and typedefs, 

307 
inductive datatypes and recursion. 

308 

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

309 

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

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

311 

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

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

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

315 

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

316 

14885  317 
*** ZF *** 
318 

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

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

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

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

322 

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

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

324 
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

325 
the old version is still required for ML proof scripts. 
14885  326 

327 

15703  328 
*** System *** 
329 

15852
4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

330 
* Allow symlinks to all proper Isabelle executables (Isabelle, 
4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

331 
isabelle, isatool etc.). 
4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

332 

4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

333 
* isabelleprocess: Poly/ML no longer needs Perl to run an interactive 
4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

334 
session. 
4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

335 

4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

336 
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for 
4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

337 
isatool doc, isatool mkdir, display_drafts etc.). 
15703  338 

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

340 
used by Isabelle; default is ROOT.ML. 

341 

15852
4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

342 
* HOL: isatool dimacs2hol converts files in DIMACS CNF format 
4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

343 
(containing Boolean satisfiability problems) into Isabelle/HOL 
4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

344 
theories. 
15703  345 

346 

347 
*** ML *** 

348 

15973  349 
* Pure/library.ML no longer defines its own option datatype, but uses 
350 
that of the SML basis, which has constructors NONE and SOME instead 

351 
of None and Some, as well as exception Option.Option instead of 

352 
OPTION. The functions the, if_none, is_some, is_none have been 

353 
adapted accordingly, while Option.map replaces apsome. 

354 

355 
* The exception LIST is no more, the standard exceptions Empty and 

356 
Subscript, as well as Library.UnequalLengths are used instead. This 

357 
means that function like Library.hd and Library.tl are gone, as the 

358 
standard hd and tl functions suffice. 

359 

360 
A number of basic functions are now no longer exported to the ML 

361 
toplevel, as they are variants of standard functions. The following 

362 
suggests how one can translate existing code: 

363 

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

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

366 
last_elem xs = List.last xs 

367 
flat xss = List.concat xss 

368 
seq fs = app fs 

369 
partition P xs = List.partition P xs 

370 
filter P xs = List.filter P xs 

371 
mapfilter f xs = List.mapPartial f xs 

372 

15703  373 
* Pure: output via the Isabelle channels of writeln/warning/error 
374 
etc. is now passed through Output.output, with a hook for arbitrary 

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

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

377 
Already formatted output may be embedded into further text via 

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

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

380 
accommodate easy composition of diagnostic messages etc. 

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

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

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

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

385 
required when capturing already output material that will eventually 

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

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

388 

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

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

391 
components are stored in the theory and patched into the 

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

393 
dependent components are maintained by the following theory 

394 
operations: 

395 

396 
Simplifier.add_context_simprocs 

397 
Simplifier.del_context_simprocs 

398 
Simplifier.set_context_subgoaler 

399 
Simplifier.reset_context_subgoaler 

400 
Simplifier.add_context_looper 

401 
Simplifier.del_context_looper 

402 
Simplifier.add_context_unsafe_solver 

403 
Simplifier.add_context_safe_solver 

404 

405 
Classical.add_context_safe_wrapper 

406 
Classical.del_context_safe_wrapper 

407 
Classical.add_context_unsafe_wrapper 

408 
Classical.del_context_unsafe_wrapper 

409 

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

411 
local_simpset_of and local_claset_of to instead of the primitive 

412 
Simplifier.get_local_simpset and Classical.get_local_claset, 

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

414 

415 

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

416 

14606  417 
New in Isabelle2004 (April 2004) 
418 
 

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

419 

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

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

421 

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

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

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

424 

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

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

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

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

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

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

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

434 
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

435 

14237  436 
* Pure: Macintosh and Windows linebreaks are now allowed in theory files. 
437 

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

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

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

14233  442 

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

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

14333  447 

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

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

451 

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

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

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

14224  456 
rather than definitionally, such as the metalogic connectives. 
457 

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

460 

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

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

465 

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

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

467 

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

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

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

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

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

472 
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

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

474 
 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

475 
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

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

477 

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

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

479 
 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

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

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

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

483 

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

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

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

486 
and derived forms. 
14283  487 

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

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

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

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

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

492 
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

493 
 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

494 
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

495 
 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

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

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

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

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

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

504 
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

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

508 
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

509 

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

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

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

512 

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

513 

14136  514 
*** HOL *** 
515 

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

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

519 
can be used like any other Isabelle image. See 

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

521 

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

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

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

524 
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

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

526 
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

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

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

529 
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

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

531 

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

535 
* Numerics: 

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

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

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

14389  543 

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

14255  546 
* Records: 
547 
 Record types are now by default printed with their type abbreviation 

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

549 
the reference "print_record_type_abbr". 

14731  550 
 Simproc "record_upd_simproc" for simplification of multiple updates added 
14255  551 
(not enabled by default). 
14427  552 
 Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp. 
553 
EX x. x = sel r to True (not enabled by default). 

14255  554 
 Tactic "record_split_simp_tac" to split and simplify records added. 
14731  555 

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

14136  559 

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

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

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

563 

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

14731  567 
* HOLMatrix: a first theory for matrices in HOL with an application of 
14610  568 
matrix theory to linear programming. 
14136  569 

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

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

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

14380  575 

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

14418  579 
like in normal math, and corresponding versions for < and for intersection. 
580 

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

583 

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

14380  586 

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

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

590 

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

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

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

595 
for examples. 

14464  596 

14606  597 

14536  598 
*** HOLCF *** 
599 

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

601 

14572  602 

603 

14136  604 
New in Isabelle2003 (May 2003) 
14606  605 
 
14136  606 

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

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

608 

13618  609 
* Provers/simplifier: 
610 

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

614 
the order of assumptions. 

615 

616 
Potential INCOMPATIBILITY: 

617 

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

13618  620 

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

622 

13781  623 
now gives rise to the infinite reduction sequence 
624 

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

626 

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

628 
kind of problem. 

629 

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

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

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

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

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

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

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

13618  637 

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

639 

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

642 
conditions before applying the rewrite rule): 

643 
ML "simp_depth_limit := n" 

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

645 
the simplifier would diverge. 

646 

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

647 
 Accepts free variables as head terms in congruence rules. Useful in Isar. 
13829  648 

13938  649 
 No longer aborts on failed congruence proof. Instead, the 
650 
congruence is ignored. 

651 

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

654 
as HOL/Extraction for some case studies. 

655 

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

658 
PG menu: Isabelle/Isar > Settings > Show Main Goal 
13815  659 
(ML: Proof.show_main_goal). 
660 

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

662 
rules whose conclusion matches subgoal 1: 

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

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

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

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

667 
(ML: ProofGeneral.print_intros()) 

668 

669 
* Pure: New flag trace_unify_fail causes unification to print 

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

672 
assumption failed. 

673 

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

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

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

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

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

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

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

681 

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

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

683 
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

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

685 

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

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

687 
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

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

691 
be given (the default is 40); 

692 

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

694 
(batchmode only); 

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

695 

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

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

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

698 
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

699 

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

702 
for slight decrease in efficiency; 

703 

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

706 

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

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

708 
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

709 

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

710 

13158  711 
*** HOL *** 
712 

13899  713 
* arith(_tac) 
714 

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

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

717 
of quantifierfree linear arithmetic. 

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

719 

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

721 

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

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

14731  724 
Presburger arithmetic can also be called explicitly via presburger(_tac). 
13899  725 

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

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

728 

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

730 
are distributed over a sum of terms; 

731 

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

14731  734 
"<=", "<" and "="). 
735 

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

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

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

741 

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

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

743 
Finite_Set); 
13492  744 

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

747 

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

750 

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

753 
of the empty set. 

754 

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

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

758 
Univariate Polynomials). Contributions welcome; 

13960  759 

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

761 

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

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

765 

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

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

767 

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

769 
Fleuriot); 
13960  770 

13549  771 
* Real/HahnBanach: updated and adapted to locales; 
772 

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

13872  775 

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

777 

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

780 

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

783 
classes, interfaces, objects,virtual methods, static methods, 

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

785 
assignment, exceptions. 

13549  786 

14011  787 

13549  788 
*** ZF *** 
789 

15154  790 
* ZF/Constructible: consistency proof for AC (Gdel's constructible 
13549  791 
universe, etc.); 
792 

13872  793 
* Main ZF: virtually all theories converted to newstyle format; 
13518  794 

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

795 

13478  796 
*** ML *** 
797 

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

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

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

801 

802 
* Pure: improved error reporting of simprocs; 

803 

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

805 
up simprocs; 

806 

807 

13953  808 
*** Document preparation *** 
809 

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

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

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

813 

14731  814 
* minimized dependencies of isabelle.sty and isabellesym.sty on 
13953  815 
other packages 
816 

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

818 
broke \Rightarrow) 

819 

14731  820 
* normal size for \<zero>...\<nine> (uses \mathbf instead of 
13954  821 
textcomp package) 
13953  822 

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

823 

14572  824 

12984  825 
New in Isabelle2002 (March 2002) 
826 
 

11474  827 

11572  828 
*** Document preparation *** 
829 

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

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

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

832 
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

833 
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

834 
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

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

836 

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

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

838 
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

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

840 

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

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

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

843 

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

846 

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

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

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

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

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

855 
isatool document copies the Isabelle style files to the target 

856 
location; 

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

857 

11572  858 

11633  859 
*** Isar *** 
860 

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

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

864 
 'induct' method divinates rule instantiation from the inductive 

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

866 
instantiation of cases; 

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

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

869 
rules without further ado; 

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

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

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

873 
statement becomes is included in the hypothesis, avoiding the 

874 
slightly cumbersome show "PROP ?case" form; 

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

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

877 
rules stemming from inductive sets to be applied in unstructured 

878 
scripts, while still benefitting from proper handling of nonatomic 

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

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

881 
 'induct' proper support for mutual induction involving nonatomic 

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

883 
below); 

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

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

886 
 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

887 
 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

888 
 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

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

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

891 
 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

892 

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

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

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

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

896 
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

897 
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

898 
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

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

900 

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

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

902 

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

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

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

905 

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

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

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

912 
some examples; 

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

913 

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

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

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

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

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

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

919 

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

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

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

924 
the context elements being discharged in the obvious way; 

925 

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

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

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

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

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

931 

11722  932 
* Pure: renamed "antecedent" case to "rule_context"; 
933 

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

936 
use hardwired "Trueprop"; 

937 

11738  938 
* Pure: added 'corollary' command; 
939 

11722  940 
* Pure: fixed 'token_translation' command; 
941 

11899  942 
* Pure: removed obsolete 'exported' attribute; 
943 

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

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

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

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

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

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

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

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

953 

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

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

955 
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

956 
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

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

958 

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

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

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

961 

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

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

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

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

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

966 

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

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

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

969 

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

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

971 
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

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

973 

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

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

975 
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

976 
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

977 

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

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

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

980 
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

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

982 
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

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

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

985 

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

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

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

988 

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

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

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

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

992 

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

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

994 

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

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

1000 

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

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

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

1003 

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

1004 

11474  1005 
*** HOL *** 
1006 

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

1009 

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

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

1012 

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

1014 
binary representation internally; 

1015 

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

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

1018 

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

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

1020 
are some hints on converting existing sources: 
11702  1021 

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

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

1024 
to be spaced properly; 

1025 

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

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

1028 

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

1030 

1031 
 remove all special provisions on numerals in proofs; 

1032 

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

12736  1036 
* HOL: symbolic syntax for x^2 (numeral 2); 
1037 

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

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

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

1040 
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

1041 
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

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

1043 

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

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

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

1048 
declared as simp by default; 

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

1049 
 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

1050 
qualified)  potential INCOMPATIBILITY; 
12280  1051 
 removed "make_scheme" operations (use "make" with "extend")  
1052 
INCOMPATIBILITY; 

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

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

1059 

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

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

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

1062 
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

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

1064 

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

13824  1067 
* HOL: consolidated and renamed several theories. In particular: 
14731  1068 
Ord.thy has been absorbed into HOL.thy 
1069 
String.thy has been absorbed into List.thy 

1070 

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

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

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

1073 

11657  1074 
* HOL: linorder_less_split superseded by linorder_cases; 
1075 

12917  1076 
* HOL/List: "nodups" renamed to "distinct"; 
12889  1077 

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

11437  1081 

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

1084 

1085 
delSWrapper "split_all_tac" 

1086 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

1087 

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

11474  1089 
MAY FAIL; 
11361  1090 

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

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

1094 
necessary to attach explicit type constraints; 

11307  1095 

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

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

12489  1099 

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

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

1101 
expressions; 
11474  1102 

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

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

1104 
of "lam"  INCOMPATIBILITY; 
11474  1105 

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

1108 
renamed "Product_Type.unit"; 

11611  1109 

12564  1110 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
1111 

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

1114 

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

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

1117 

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

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

1119 
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

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

1121 

12734  1122 
* HOLReal: added Complex_Numbers (by Gertrud Bauer); 
1123 

12690  1124 
* HOLHyperreal is now a logic image; 
1125 

11611  1126 

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

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

1128 

12622  1129 
* Isar: consts/constdefs supports mixfix syntax for continuous 
1130 
operations; 

1131 

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

1133 
HOLCF/ex/Dnat.thy; 

1134 

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

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

1138 

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

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

1140 

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

1141 

11474  1142 
*** ZF *** 
1143 

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

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

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

1148 

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

1150 
your theory on Main_ZFC; 

1151 

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

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

12563  1154 

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

1157 

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

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

1160 

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

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

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

1164 

13025  1165 
* ZF: many new theorems about lists, ordinals, etc.; 
12850  1166 

11474  1167 

1168 
*** General *** 

1169 

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

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

1173 
also ref manual for further ML interfaces; 

1174 

1175 
* Pure/axclass: removed obsolete ML interface 

1176 
goal_subclass/goal_arity; 

1177 

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

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

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

1181 
properly; 

1182 

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

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

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

1185 

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

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

1187 
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

1188 
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

1189 
type variable); 
12280  1190 

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

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

1193 
"type_brackets"; 

1194 

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

11817  1196 
tokens into AST constants; 
11474  1197 

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

1200 
multiple declarations for same syntax element constant; 

1201 

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

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

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

1204 

12280  1205 
* Provers/classical: renamed addaltern to addafter, addSaltern to 
1206 
addSafter; 

1207 

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

1209 
as well; 

12253  1210 

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

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

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

1215 
support requires further installations, e.g. from 

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

1217 

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

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

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

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

1222 

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

1225 

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

1228 
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

1229 

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

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

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

11551  1235 

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

1238 
isolatin characters may now be used; the related isatools 

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

1240 

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

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

1243 
terminal); 

1244 

11314  1245 

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

1246 

11062  1247 
New in Isabelle992 (February 2001) 
1248 
 

1249 

10224  1250 
*** Overview of INCOMPATIBILITIES *** 
1251 

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

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

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

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

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

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

1260 

10998  1261 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
1262 
gfp_Tarski to gfp_unfold; 

10224  1263 

10288  1264 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
1265 

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

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

10793  1269 

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

1272 

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

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

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

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

1278 
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

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

1280 

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

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

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

1283 

10224  1284 

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

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

1286 

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

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

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

1291 
typewriter); 

1292 

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

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

1294 
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

1295 

10858  1296 
* some more standard symbols; see Appendix A of the system manual for 
11062  1297 
the complete list of symbols defined in isabellesym.sty; 
10858  1298 

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

1301 
definitions); 

1302 

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

1305 
actual humanreadable proof documents. Please do not include goal 

1306 
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

1307 

11062  1308 
* proper indentation of antiquoted output with proportional LaTeX 
1309 
fonts; 

10862  1310 

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

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

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

1313 

11062  1314 
* isatool unsymbolize tunes sources for plain ASCII communication; 
1315 

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

1316 

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

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

1318 

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

1321 
documents, due to unpredictable outcome and noncompositional proof 

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

1323 
for Prologstyle synthesis of proven results; 

1324 

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

1327 

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

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

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

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

1332 

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

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

1335 

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

1337 
statements as well; 

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

1338 

11097  1339 
* Pure: more robust selection of calculational rules; 
1340 

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

1343 

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

1345 
lemmas, using the graph browser tool; 

1346 

10944  1347 
* Pure: predict failure of "show" in interactive mode; 
1348 

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

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

1350 

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

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

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

1353 

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

1357 

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

1360 
the result to be shown in each case; 

1361 

10770  1362 
* HOL: added 'recdef_tc' command; 
1363 

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

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

1365 

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

1366 

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

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

1368 

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

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

1370 
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

1371 
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

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

1374 

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

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

1378 

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

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

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

1383 
literature; 

1384 

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

1388 

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

1391 

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

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

1393 
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

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

1395 

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

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

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

1398 

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

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

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

1401 

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

1404 
functions for the reals; 

10756  1405 

11094
