author  wenzelm 
Mon, 05 Sep 2005 17:38:15 +0200  
changeset 17259  dda237f1d299 
parent 17228  19b460b39dad 
child 17269  c5a52602c4a7 
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> 

16234  12 
imports <theory1> ... <theoryN> 
13 
uses <file1> ... <fileM> 

15130  14 
begin 
15 

16234  16 
where the 'uses' part is optional. The previous syntax 
17 

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

19 

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

17189  22 
nonIsar theories now, but these are likely to disappear soon. 
15130  23 

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

24 
* Theory loader: parent theories can now also be referred to via 
16234  25 
relative and absolute paths. 
26 

27 
* Improved version of thms_containing searches for a list of criteria 

28 
instead of a list of constants. Known criteria are: intro, elim, dest, 

29 
name:string, simp:term, and any term. Criteria can be preceded by '' 

30 
to select theorems that do not match. Intro, elim, dest select 

31 
theorems that match the current goal, name:s selects theorems whose 

32 
fully qualified name contain s, and simp:term selects all 

33 
simplification rules whose lhs match term. Any other term is 

34 
interpreted as pattern and selects all theorems matching the 

35 
pattern. Available in ProofGeneral under 'ProofGeneral > Find 

36 
Theorems' or Cc Cf. Example: 

37 

38 
Cc Cf (100) "(_::nat) + _ + _" intro name:"HOL." 

39 

40 
prints the last 100 theorems matching the pattern "(_::nat) + _ + _", 

41 
matching the current goal as introduction rule and not having "HOL." 

42 
in their name (i.e. not being defined in theory HOL). 

16013
3010430d894d
removed find_rewrites (superceded by improved thms_containing);
wenzelm
parents:
16000
diff
changeset

43 

15703  44 

45 
*** Document preparation *** 

46 

16234  47 
* Commands 'display_drafts' and 'print_drafts' perform simple output 
48 
of raw sources. Only those symbols that do not require additional 

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

50 
displayed properly, everything else is left verbatim. isatool display 

51 
and isatool print are used as front ends (these are subject to the 

52 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

53 

17047
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

54 
* Command tags control specific markup of certain regions of text, 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

55 
notably folding and hiding. Predefined tags include "theory" (for 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

56 
theory begin and end), "proof" for proof commands, and "ML" for 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

57 
commands involving ML code; the additional tags "visible" and 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

58 
"invisible" are unused by default. Users may give explicit tag 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

59 
specifications in the text, e.g. ''by %invisible (auto)''. The 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

60 
interpretation of tags is determined by the LaTeX job during document 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

61 
preparation: see option V of isatool usedir, or options n and t of 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

62 
isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag, 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

63 
\isadroptag. 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

64 

e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

65 
Several document versions may be produced at the same time via isatool 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

66 
usedir (the generated index.html will link all of them). Typical 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

67 
specifications include ''V document=theory,proof,ML'' to present 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

68 
theory/proof/ML parts faithfully, ''V outline=/proof,/ML'' to fold 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

69 
proof and ML commands, and ''V mutilated=theory,proof,ML'' to omit 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

70 
these parts without any formal replacement text. The Isabelle site 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

71 
default settings produce ''document'' and ''outline'' versions as 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

72 
specified above. 
16234  73 

15979  74 
* Several new antiquotation: 
75 

76 
@{term_type term} prints a term with its type annotated; 

77 

78 
@{typeof term} prints the type of a term; 

79 

16234  80 
@{const const} is the same as @{term const}, but checks that the 
81 
argument is a known logical constant; 

15979  82 

83 
@{term_style style term} and @{thm_style style thm} print a term or 

16234  84 
theorem applying a "style" to it 
85 

17117
e2bed9e82454
* The ML antiquotation prints typechecked ML expressions verbatim.
wenzelm
parents:
17097
diff
changeset

86 
@{ML text} 
e2bed9e82454
* The ML antiquotation prints typechecked ML expressions verbatim.
wenzelm
parents:
17097
diff
changeset

87 

16234  88 
Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of 
89 
definitions, equations, inequations etc., 'concl' printing only the 

90 
conclusion of a metalogical statement theorem, and 'prem1' .. 'prem9' 

91 
to print the specified premise. TermStyle.add_style provides an ML 

92 
interface for introducing further styles. See also the "LaTeX Sugar" 

17117
e2bed9e82454
* The ML antiquotation prints typechecked ML expressions verbatim.
wenzelm
parents:
17097
diff
changeset

93 
document practical applications. The ML antiquotation prints 
e2bed9e82454
* The ML antiquotation prints typechecked ML expressions verbatim.
wenzelm
parents:
17097
diff
changeset

94 
typechecked ML expressions verbatim. 
16234  95 

17259
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

96 
* Markup commands 'chapter', 'section', 'subsection', 'subsubsection', 
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

97 
and 'text' support optional locale specification '(in loc)', which 
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

98 
specifies the default context for interpreting antiquotations. 
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

99 
For example: 'text (in LC) {* @{thm fold_cummute}*}'. 
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

100 

dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

101 
* Option 'locale=NAME' of antiquotations specifies an alternative 
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

102 
context interpreting the subsequent argument. For example: @{thm 
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

103 
[locale=LC] fold_commute}. 
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

104 

17097
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

105 
* Proper output of proof terms (@{prf ...} and @{full_prf ...}) within 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

106 
a proof context. 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

107 

78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

108 
* Proper output of antiquotations for theory commands involving a 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

109 
proof context (such as 'locale' or 'theorem (in loc) ...'). 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

110 

17193
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

111 
* Delimiters of outer tokens (string etc.) now produce separate LaTeX 
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

112 
macros (\isachardoublequoteopen, isachardoublequoteclose etc.). 
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

113 

83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

114 
* isatool usedir: new option C (default true) controls whether option 
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

115 
D should include a copy of the original document directory; C false 
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

116 
prevents unwanted effects such as copying of administrative CVS data. 
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

117 

16234  118 

119 
*** Pure *** 

120 

121 
* Considerably improved version of 'constdefs' command. Now performs 

122 
automatic typeinference of declared constants; additional support for 

123 
local structure declarations (cf. locales and HOL records), see also 

124 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

125 
sequential dependencies of definitions within a single 'constdefs' 

126 
section; moreover, the declared name needs to be an identifier. If 

127 
all fails, consider to fall back on 'consts' and 'defs' separately. 

128 

129 
* Improved indexed syntax and implicit structures. First of all, 

130 
indexed syntax provides a notational device for subscripted 

131 
application, using the new syntax \<^bsub>term\<^esub> for arbitrary 

132 
expressions. Secondly, in a local context with structure 

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

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

135 
show_structs controls printing of implicit structures. Typical 

136 
applications of these concepts involve record types and locales. 

137 

138 
* New command 'no_syntax' removes grammar declarations (and 

139 
translations) resulting from the given syntax specification, which is 

140 
interpreted in the same manner as for the 'syntax' command. 

141 

142 
* 'Advanced' translation functions (parse_translation etc.) may depend 

143 
on the signature of the theory context being presently used for 

144 
parsing/printing, see also isarref manual. 

145 

16856  146 
* Improved 'oracle' command provides a typesafe interface to turn an 
147 
ML expression of type theory > T > term into a primitive rule of 

148 
type theory > T > thm (i.e. the functionality of Thm.invoke_oracle 

149 
is already included here); see also FOL/ex/IffExample.thy; 

150 
INCOMPATIBILITY. 

151 

16234  152 
* Improved internal renaming of symbolic identifiers  attach primes 
153 
instead of base 26 numbers. 

154 

155 
* New flag show_question_marks controls printing of leading question 

156 
marks in schematic variable names. 

157 

158 
* In schematic variable names, *any* symbol following \<^isub> or 

159 
\<^isup> is now treated as part of the base name. For example, the 

160 
following works without printing of awkward ".0" indexes: 

161 

162 
lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1" 

163 
by simp 

164 

165 
* Inner syntax includes (*(*nested*) comments*). 

166 

167 
* Pretty pinter now supports unbreakable blocks, specified in mixfix 

168 
annotations as "(00...)". 

169 

170 
* Clear separation of logical types and nonterminals, where the latter 

171 
may only occur in 'syntax' specifications or type abbreviations. 

172 
Before that distinction was only partially implemented via type class 

173 
"logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper 

174 
use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very 

175 
exotic syntax specifications may require further adaption 

176 
(e.g. Cube/Base.thy). 

177 

178 
* Removed obsolete type class "logic", use the top sort {} instead. 

179 
Note that nonlogical types should be declared as 'nonterminals' 

180 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

181 
specifications. 

182 

17095  183 
* Attributes 'induct' and 'cases': type or set names may now be 
184 
locally fixed variables as well. 

185 

16234  186 
* Simplifier: can now control the depth to which conditional rewriting 
187 
is traced via the PG menu Isabelle > Settings > Trace Simp Depth 

188 
Limit. 

189 

190 
* Simplifier: simplification procedures may now take the current 

191 
simpset into account (cf. Simplifier.simproc(_i) / mk_simproc 

192 
interface), which is very useful for calling the Simplifier 

193 
recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs 

194 
is gone  use prems_of_ss on the simpset instead. Moreover, the 

195 
lowlevel mk_simproc no longer applies Logic.varify internally, to 

196 
allow for use in a context of fixed variables. 

197 

198 
* thin_tac now works even if the assumption being deleted contains !! 

199 
or ==>. More generally, erule now works even if the major premise of 

200 
the elimination rule contains !! or ==>. 

201 

202 
* Reorganized bootstrapping of the Pure theories; CPure is now derived 

203 
from Pure, which contains all common declarations already. Both 

204 
theories are defined via plain Isabelle/Isar .thy files. 

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

206 
CPure.elim / CPure.dest attributes) now appear in the Pure name space; 

207 
use isatool fixcpure to adapt your theory and ML sources. 

208 

209 
* New syntax 'name(ij, i, i, ...)' for referring to specific 

210 
selections of theorems in named facts via index ranges. 

211 

16506
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset

212 
* More efficient treatment of intermediate checkpoints in interactive 
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset

213 
theory development. 
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset

214 

17097
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

215 
* 'print_theorems': in theory mode, really print the difference 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

216 
wrt. the last state (works for interactive theory development only), 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

217 
in proof mode print all local facts (cf. 'print_facts'); 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

218 

16234  219 

220 
*** Locales *** 

17095  221 

222 
* New commands for the interpretation of locale expressions in theories (1), 

223 
locales (2) and proof contexts (3). These generate proof obligations from 

224 
the expression specification. After the obligations have been discharged, 

225 
theorems of the expression are added to the theory, target locale or proof 

226 
context. The synopsis of the commands is a follows: 

227 
(1) interpretation expr inst 

228 
(2) interpretation target < expr 

229 
(3) interpret expr inst 

230 
Interpretation in theories and proof contexts require a parameter 

231 
instantiation of terms from the current context. This is applied to 

232 
specifications and theorems of the interpreted expression. Interpretation 

233 
in locales only permits parameter renaming through the locale expression. 

17139
165c97f9bb63
Printing of interpretations: option to show witness theorems;
ballarin
parents:
17117
diff
changeset

234 
Interpretation is smart in that interpretations that are active already 
17095  235 
do not occur in proof obligations, neither are instantiated theorems stored 
236 
in duplicate. Use 'print_interps' to inspect active interpretations of 

237 
a particular locale. For details, see the Isar Reference manual. 

16234  238 

239 
INCOMPATIBILITY: former 'instantiate' has been withdrawn, use 

240 
'interpret' instead. 

241 

17095  242 
* New context element 'constrains' for adding type constraints to parameters. 
243 

244 
* Context expressions: renaming of parameters with syntax redeclaration. 

245 

246 
* Locale declaration: 'includes' disallowed. 

247 

16234  248 
* Proper static binding of attribute syntax  i.e. types / terms / 
249 
facts mentioned as arguments are always those of the locale definition 

250 
context, independently of the context of later invocations. Moreover, 

251 
locale operations (renaming and type / term instantiation) are applied 

252 
to attribute arguments as expected. 

253 

254 
INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of 

255 
actual attributes; rare situations may require Attrib.attribute to 

256 
embed those attributes into Attrib.src that lack concrete syntax. 

257 
Attribute implementations need to cooperate properly with the static 

258 
binding mechanism. Basic parsers Args.XXX_typ/term/prop and 

259 
Attrib.XXX_thm etc. already do the right thing without further 

260 
intervention. Only unusual applications  such as "where" or "of" 

261 
(cf. src/Pure/Isar/attrib.ML), which process arguments depending both 

262 
on the context and the facts involved  may have to assign parsed 

263 
values to argument tokens explicitly. 

264 

265 
* Changed parameter management in theorem generation for long goal 

266 
statements with 'includes'. INCOMPATIBILITY: produces a different 

267 
theorem statement in rare situations. 

268 

17228  269 
* Locale inspection command 'print_locale' omits notes elements. Use 
270 
'print_locale!' to have them included in the output. 

271 

16234  272 

273 
*** Provers *** 

274 

275 
* Provers/hypsubst.ML: improved version of the subst method, for 

276 
singlestep rewriting: it now works in bound variable contexts. New is 

277 
'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may 

278 
rewrite a different subterm than the original subst method, which is 

279 
still available as 'simplesubst'. 

280 

281 
* Provers/quasi.ML: new transitivity reasoners for transitivity only 

282 
and quasi orders. 

283 

284 
* Provers/trancl.ML: new transitivity reasoner for transitive and 

285 
reflexivetransitive closure of relations. 

286 

287 
* Provers/blast.ML: new reference depth_limit to make blast's depth 

288 
limit (previously hardcoded with a value of 20) userdefinable. 

289 

290 
* Provers/simplifier.ML has been moved to Pure, where Simplifier.setup 

291 
is peformed already. Objectlogics merely need to finish their 

292 
initial simpset configuration as before. INCOMPATIBILITY. 

15703  293 

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

294 

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

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

296 

16234  297 
* Symbolic syntax of Hilbert Choice Operator is now as follows: 
14878  298 

299 
syntax (epsilon) 

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

301 

16234  302 
The symbol \<some> is displayed as the alternative epsilon of LaTeX 
303 
and xsymbol; use option 'm epsilon' to get it actually printed. 

304 
Moreover, the mathematically important symbolic identifier \<epsilon> 

305 
becomes available as variable, constant etc. INCOMPATIBILITY, 

306 

307 
* "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x". 

308 
Similarly for all quantifiers: "ALL x > y" etc. The xsymbol for >= 

17016
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset

309 
is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to 
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset

310 
support corresponding Isar calculations. 
16234  311 

312 
* "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>" 

313 
instead of ":". 

314 

315 
* theory SetInterval: changed the syntax for open intervals: 

316 

317 
Old New 

318 
{..n(} {..<n} 

319 
{)n..} {n<..} 

320 
{m..n(} {m..<n} 

321 
{)m..n} {m<..n} 

322 
{)m..n(} {m<..<n} 

323 

324 
The old syntax is still supported but will disappear in the next 

325 
release. For conversion use the following Emacs search and replace 

326 
patterns (these are not perfect but work quite well): 

15046  327 

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

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

330 

16234  331 
* theory Finite_Set: changed the syntax for 'setsum', summation over 
332 
finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is 

17189  333 
now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can 
334 
be a tuple pattern. 

16234  335 

336 
Some new syntax forms are available: 

337 

338 
"\<Sum>x  P. e" for "setsum (%x. e) {x. P}" 

339 
"\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}" 

340 
"\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}" 

341 
"\<Sum>x < k. e" for "setsum (%x. e) {..<k}" 

342 

343 
The latter form "\<Sum>x < k. e" used to be based on a separate 

344 
function "Summation", which has been discontinued. 

345 

346 
* theory Finite_Set: in structured induction proofs, the insert case 

347 
is now 'case (insert x F)' instead of the old counterintuitive 'case 

348 
(insert F x)'. 

349 

350 
* The 'refute' command has been extended to support a much larger 

351 
fragment of HOL, including axiomatic type classes, constdefs and 

352 
typedefs, inductive datatypes and recursion. 

353 

354 
* Datatype induction via method 'induct' now preserves the name of the 

355 
induction variable. For example, when proving P(xs::'a list) by 

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

357 
than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY 

358 
in unstructured proof scripts. 

359 

360 
* Reworked implementation of records. Improved scalability for 

361 
records with many fields, avoiding performance problems for type 

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

363 
of nested extension types. Therefore the record type only grows linear 

364 
in the number of extensions and not in the number of fields. The 

365 
toplevel (users) view on records is preserved. Potential 

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

367 
old record representation. The type generated for a record is called 

368 
<record_name>_ext_type. 

369 

370 
Flag record_quick_and_dirty_sensitive can be enabled to skip the 

371 
proofs triggered by a record definition or a simproc (if 

372 
quick_and_dirty is enabled). Definitions of large records can take 

373 
quite long. 

374 

375 
New simproc record_upd_simproc for simplification of multiple record 

376 
updates enabled by default. Moreover, trivial updates are also 

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

378 
occasionally, since simplification is more powerful by default. 

379 

380 
* Simplifier: automatically reasons about transitivity chains 

381 
involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics 

382 
provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY: 

383 
old proofs break occasionally as simplification may now solve more 

384 
goals than previously. 

385 

386 
* Simplifier: converts x <= y into x = y if assumption y <= x is 

387 
present. Works for all partial orders (class "order"), in particular 

388 
numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y 

389 
just like y <= x. 

390 

391 
* Simplifier: new simproc for "let x = a in f x". If a is a free or 

392 
bound variable or a constant then the let is unfolded. Otherwise 

393 
first a is simplified to b, and then f b is simplified to g. If 

394 
possible we abstract b from g arriving at "let x = b in h x", 

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

396 
enabled/disabled by the reference use_let_simproc. Potential 

397 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  398 

16563  399 
* Classical reasoning: the meson method now accepts theorems as arguments. 
400 

16891  401 
* Theory OrderedGroup and Ring_and_Field: various additions and 
402 
improvements to faciliate calculations involving equalities and 

403 
inequalities. 

404 

405 
The following theorems have been eliminated or modified 

406 
(INCOMPATIBILITY): 

16888  407 

408 
abs_eq now named abs_of_nonneg 

409 
abs_of_ge_0 now named abs_of_nonneg 

410 
abs_minus_eq now named abs_of_nonpos 

411 
imp_abs_id now named abs_of_nonneg 

412 
imp_abs_neg_id now named abs_of_nonpos 

413 
mult_pos now named mult_pos_pos 

414 
mult_pos_le now named mult_nonneg_nonneg 

415 
mult_pos_neg_le now named mult_nonneg_nonpos 

416 
mult_pos_neg2_le now named mult_nonneg_nonpos2 

417 
mult_neg now named mult_neg_neg 

418 
mult_neg_le now named mult_nonpos_nonpos 

419 

16891  420 
* Theory Parity: added rules for simplifying exponents. 
421 

17092  422 
* Theory List: 
423 

424 
The following theorems have been eliminated or modified 

425 
(INCOMPATIBILITY): 

426 

427 
list_all_Nil now named list_all.simps(1) 

428 
list_all_Cons now named list_all.simps(2) 

429 
list_all_conv now named list_all_iff 

430 
set_mem_eq now named mem_iff 

431 

16929  432 
* Theories SetsAndFunctions and BigO (see HOL/Library) support 
433 
asymptotic "big O" calculations. See the notes in BigO.thy. 

434 

16888  435 

436 
*** HOLComplex *** 

437 

16891  438 
* Theory RealDef: better support for embedding natural numbers and 
439 
integers in the reals. 

440 

441 
The following theorems have been eliminated or modified 

442 
(INCOMPATIBILITY): 

443 

17016
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset

444 
exp_ge_add_one_self now requires no hypotheses 
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset

445 
real_of_int_add reversed direction of equality (use [symmetric]) 
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset

446 
real_of_int_minus reversed direction of equality (use [symmetric]) 
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset

447 
real_of_int_diff reversed direction of equality (use [symmetric]) 
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset

448 
real_of_int_mult reversed direction of equality (use [symmetric]) 
16891  449 

450 
* Theory RComplete: expanded support for floor and ceiling functions. 

16888  451 

16962  452 
* Theory Ln is new, with properties of the natural logarithm 
453 

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

454 

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

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

456 

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

457 
* HOLCF: discontinued special version of 'constdefs' (which used to 
16234  458 
support continuous functions) in favor of the general Pure one with 
459 
full typeinference. 

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

460 

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

461 

14885  462 
*** ZF *** 
463 

16234  464 
* ZF/ex: theories Group and Ring provide examples in abstract algebra, 
465 
including the First Isomorphism Theorem (on quotienting by the kernel 

466 
of a homomorphism). 

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

467 

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

468 
* ZF/Simplifier: install second copy of type solver that actually 
16234  469 
makes use of TC rules declared to Isar proof contexts (or locales); 
470 
the old version is still required for ML proof scripts. 

15703  471 

472 

473 
*** ML *** 

474 

15973  475 
* Pure/library.ML no longer defines its own option datatype, but uses 
16234  476 
that of the SML basis, which has constructors NONE and SOME instead of 
477 
None and Some, as well as exception Option.Option instead of OPTION. 

478 
The functions the, if_none, is_some, is_none have been adapted 

479 
accordingly, while Option.map replaces apsome. 

15973  480 

16860
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

481 
* Pure/library.ML: the exception LIST has been given up in favour of 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

482 
the standard exceptions Empty and Subscript, as well as 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

483 
Library.UnequalLengths. Function like Library.hd and Library.tl are 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

484 
superceded by the standard hd and tl functions etc. 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

485 

43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

486 
A number of basic list functions are no longer exported to the ML 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

487 
toplevel, as they are variants of predefined functions. The following 
16234  488 
suggests how one can translate existing code: 
15973  489 

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

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

492 
last_elem xs = List.last xs 

493 
flat xss = List.concat xss 

16234  494 
seq fs = List.app fs 
15973  495 
partition P xs = List.partition P xs 
496 
mapfilter f xs = List.mapPartial f xs 

497 

16860
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

498 
* Pure/library.ML: several combinators for linear functional 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

499 
transformations, notably reverse application and composition: 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

500 

43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

501 
x > f f #> g 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

502 
(x, y) > f f #> g 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

503 

43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

504 
* Pure/library.ML: canonical list combinators fold, fold_rev, and 
16869  505 
fold_map support linear functional transformations and nesting. For 
16860
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

506 
example: 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

507 

43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

508 
fold f [x1, ..., xN] y = 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

509 
y > f x1 > ... > f xN 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

510 

43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

511 
(fold o fold) f [xs1, ..., xsN] y = 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

512 
y > fold f xs1 > ... > fold f xsN 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

513 

43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

514 
fold f [x1, ..., xN] = 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

515 
f x1 #> ... #> f xN 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

516 

43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

517 
(fold o fold) f [xs1, ..., xsN] = 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

518 
fold f xs1 #> ... #> fold f xsN 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

519 

43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

520 
* Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types, 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

521 
fold_types traverse types/terms from left to right, observing 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

522 
canonical argument order. Supercedes previous foldl_XXX versions, 
16868  523 
add_frees, add_vars etc. have been adapted as well: INCOMPATIBILITY. 
16860
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

524 

15703  525 
* Pure: output via the Isabelle channels of writeln/warning/error 
16234  526 
etc. is now passed through Output.output, with a hook for arbitrary 
527 
transformations depending on the print_mode (cf. Output.add_mode  

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

529 
formatted output may be embedded into further text via Output.raw; the 

530 
result of Pretty.string_of/str_of and derived functions 

531 
(string_of_term/cterm/thm etc.) is already marked raw to accommodate 

532 
easy composition of diagnostic messages etc. Programmers rarely need 

533 
to care about Output.output or Output.raw at all, with some notable 

534 
exceptions: Output.output is required when bypassing the standard 

535 
channels (writeln etc.), or in token translations to produce properly 

536 
formatted results; Output.raw is required when capturing already 

537 
output material that will eventually be presented to the user a second 

538 
time. For the default print mode, both Output.output and Output.raw 

539 
have no effect. 

540 

16718  541 
* Pure: Output.time_accumulator NAME creates an operator ('a > 'b) > 
542 
'a > 'b to measure runtime and count invocations; the cumulative 

543 
results are displayed at the end of a batch session. 

544 

545 
* Isar toplevel: improved diagnostics, mostly for Poly/ML only. 

546 
Reference Toplevel.debug (default false) controls detailed printing 

547 
and tracing of lowlevel exceptions; Toplevel.profiling (default 0) 

548 
controls execution profiling  set to 1 for time and 2 for space 

549 
(both increase the runtime). 

15703  550 

16799
978dcf30c3dd
* Isar session: The initial use of ROOT.ML is now always timed;
wenzelm
parents:
16718
diff
changeset

551 
* Isar session: The initial use of ROOT.ML is now always timed, 
978dcf30c3dd
* Isar session: The initial use of ROOT.ML is now always timed;
wenzelm
parents:
16718
diff
changeset

552 
i.e. the log will show the actual process times, in contrast to the 
978dcf30c3dd
* Isar session: The initial use of ROOT.ML is now always timed;
wenzelm
parents:
16718
diff
changeset

553 
elapsed wallclock time that the outer shell wrapper produces. 
978dcf30c3dd
* Isar session: The initial use of ROOT.ML is now always timed;
wenzelm
parents:
16718
diff
changeset

554 

16689
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

555 
* Pure: structure OrdList (cf. Pure/General/ord_list.ML) provides a 
16690  556 
reasonably efficient lightweight implementation of sets as lists. 
16689
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

557 

05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

558 
* Pure: more efficient orders for basic syntactic entities: added 
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

559 
fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord 
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

560 
and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is 
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

561 
NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast 
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

562 
orders now  potential INCOMPATIBILITY for code that depends on a 
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

563 
particular order for Symtab.keys, Symtab.dest, etc. (consider using 
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

564 
Library.sort_strings on result). 
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

565 

16151  566 
* Pure: name spaces have been refined, with significant changes of the 
16234  567 
internal interfaces  INCOMPATIBILITY. Renamed cond_extern(_table) 
568 
to extern(_table). The plain name entry path is superceded by a 

569 
general 'naming' context, which also includes the 'policy' to produce 

570 
a fully qualified name and external accesses of a fully qualified 

571 
name; NameSpace.extend is superceded by context dependent 

572 
Sign.declare_name. Several theory and proof context operations modify 

573 
the naming context. Especially note Theory.restore_naming and 

574 
ProofContext.restore_naming to get back to a sane state; note that 

575 
Theory.add_path is no longer sufficient to recover from 

576 
Theory.absolute_path in particular. 

577 

578 
* Pure: new flags short_names (default false) and unique_names 

579 
(default true) for controlling output of qualified names. If 

580 
short_names is set, names are printed unqualified. If unique_names is 

581 
reset, the name prefix is reduced to the minimum required to achieve 

582 
the original result when interning again, even if there is an overlap 

583 
with earlier declarations. 

16151  584 

16456
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

585 
* Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

586 
now 'extend', and 'merge' gets an additional Pretty.pp argument 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

587 
(useful for printing error messages). INCOMPATIBILITY. 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

588 

451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

589 
* Pure: major reorganization of the theory context. Type Sign.sg and 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

590 
Theory.theory are now identified, referring to the universal 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

591 
Context.theory (see Pure/context.ML). Actual signature and theory 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

592 
content is managed as theory data. The old code and interfaces were 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

593 
spread over many files and structures; the new arrangement introduces 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

594 
considerable INCOMPATIBILITY to gain more clarity: 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

595 

451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

596 
Context  theory management operations (name, identity, inclusion, 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

597 
parents, ancestors, merge, etc.), plus generic theory data; 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

598 

451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

599 
Sign  logical signature and syntax operations (declaring consts, 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

600 
types, etc.), plus certify/read for common entities; 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

601 

451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

602 
Theory  logical theory operations (stating axioms, definitions, 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

603 
oracles), plus a copy of logical signature operations (consts, 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

604 
types, etc.); also a few basic management operations (Theory.copy, 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

605 
Theory.merge, etc.) 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

606 

451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

607 
The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

608 
etc.) as well as the sign field in Thm.rep_thm etc. have been retained 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

609 
for convenience  they merely return the theory. 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

610 

17193
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

611 
* Pure: type Type.tsig is superceded by theory in most interfaces. 
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

612 

16547
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset

613 
* Pure: the Isar proof context type is already defined early in Pure 
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset

614 
as Context.proof (note that ProofContext.context and Proof.context are 
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset

615 
aliases, where the latter is the preferred name). This enables other 
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset

616 
Isabelle components to refer to that type even before Isar is present. 
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset

617 

16373
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

618 
* Pure/sign/theory: discontinued named name spaces (i.e. classK, 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

619 
typeK, constK, axiomK, oracleK), but provide explicit operations for 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

620 
any of these kinds. For example, Sign.intern typeK is now 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

621 
Sign.intern_type, Theory.hide_space Sign.typeK is now 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

622 
Theory.hide_types. Also note that former 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

623 
Theory.hide_classes/types/consts are now 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

624 
Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

625 
internalize their arguments! INCOMPATIBILITY. 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

626 

16506
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset

627 
* Pure: get_thm interface (of PureThy and ProofContext) expects 
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset

628 
datatype thmref (with constructors Name and NameSelection) instead of 
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset

629 
plain string  INCOMPATIBILITY; 
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset

630 

16151  631 
* Pure: cases produced by proof methods specify options, where NONE 
16234  632 
means to remove case bindings  INCOMPATIBILITY in 
633 
(RAW_)METHOD_CASES. 

16151  634 

16373
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

635 
* Pure: the following operations retrieve axioms or theorems from a 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

636 
theory node or theory hierarchy, respectively: 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

637 

9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

638 
Theory.axioms_of: theory > (string * term) list 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

639 
Theory.all_axioms_of: theory > (string * term) list 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

640 
PureThy.thms_of: theory > (string * thm) list 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

641 
PureThy.all_thms_of: theory > (string * thm) list 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

642 

16718  643 
* Pure: print_tac now outputs the goal through the trace channel. 
644 

16997
7dfc99f62dd9
* Pure/Simplifier: improved handling of bound variables;
wenzelm
parents:
16962
diff
changeset

645 
* Pure/Simplifier: improved handling of bound variables (nameless 
7dfc99f62dd9
* Pure/Simplifier: improved handling of bound variables;
wenzelm
parents:
16962
diff
changeset

646 
representation, avoid allocating new strings). Simprocs that invoke 
7dfc99f62dd9
* Pure/Simplifier: improved handling of bound variables;
wenzelm
parents:
16962
diff
changeset

647 
the Simplifier recursively should use Simplifier.inherit_bounds to 
7dfc99f62dd9
* Pure/Simplifier: improved handling of bound variables;
wenzelm
parents:
16962
diff
changeset

648 
avoid local name clashes. 
7dfc99f62dd9
* Pure/Simplifier: improved handling of bound variables;
wenzelm
parents:
16962
diff
changeset

649 

7dfc99f62dd9
* Pure/Simplifier: improved handling of bound variables;
wenzelm
parents:
16962
diff
changeset

650 
* Pure/Provers: Simplifier and Classical Reasoner now support proof 
7dfc99f62dd9
* Pure/Simplifier: improved handling of bound variables;
wenzelm
parents:
16962
diff
changeset

651 
context dependent plugins (simprocs, solvers, wrappers etc.). These 
7dfc99f62dd9
* Pure/Simplifier: improved handling of bound variables;
wenzelm
parents:
16962
diff
changeset

652 
extra components are stored in the theory and patched into the 
16234  653 
simpset/claset when used in an Isar proof context. Context dependent 
654 
components are maintained by the following theory operations: 

655 

656 
Simplifier.add_context_simprocs 

657 
Simplifier.del_context_simprocs 

658 
Simplifier.set_context_subgoaler 

659 
Simplifier.reset_context_subgoaler 

660 
Simplifier.add_context_looper 

661 
Simplifier.del_context_looper 

662 
Simplifier.add_context_unsafe_solver 

663 
Simplifier.add_context_safe_solver 

664 

665 
Classical.add_context_safe_wrapper 

666 
Classical.del_context_safe_wrapper 

667 
Classical.add_context_unsafe_wrapper 

668 
Classical.del_context_unsafe_wrapper 

669 

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

671 
local_simpset_of and local_claset_of to instead of the primitive 

672 
Simplifier.get_local_simpset and Classical.get_local_claset, 

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

674 

16251
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset

675 
* File.sysify_path and File.quote_sysify path have been replaced by 
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset

676 
File.platform_path and File.shell_path (with appropriate hooks). This 
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset

677 
provides a clean interface for unusual systems where the internal and 
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset

678 
external process view of file names are different. 
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset

679 

17166  680 
* ML functions legacy_bindings and use_legacy_bindings produce ML fact 
681 
bindings for all theorems stored within a given theory; this may help 

682 
in porting nonIsar theories to Isar ones, while keeping ML proof 

683 
scripts for the time being. 

684 

16234  685 

686 
*** System *** 

687 

688 
* Allow symlinks to all proper Isabelle executables (Isabelle, 

689 
isabelle, isatool etc.). 

690 

691 
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for 

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

693 

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

695 
used by Isabelle; default is ROOT.ML. 

696 

16251
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset

697 
* New isatool version outputs the version identifier of the Isabelle 
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset

698 
distribution being used. 
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset

699 

121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset

700 
* HOL: new isatool dimacs2hol converts files in DIMACS CNF format 
16234  701 
(containing Boolean satisfiability problems) into Isabelle/HOL 
702 
theories. 

15703  703 

704 

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

705 

14606  706 
New in Isabelle2004 (April 2004) 
707 
 

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

708 

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

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

710 

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

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

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

713 

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

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

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

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

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

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

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

723 
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

724 

14237  725 
* Pure: Macintosh and Windows linebreaks are now allowed in theory files. 
726 

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

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

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

14233  731 

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

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

14333  736 

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

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

740 

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

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

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

14224  745 
rather than definitionally, such as the metalogic connectives. 
746 

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

749 

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

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

754 

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

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

756 

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

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

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

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

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

761 
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

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

763 
 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

764 
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

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

766 

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

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

768 
 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

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

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

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

772 

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

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

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

775 
and derived forms. 
14283  776 

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

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

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

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

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

781 
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

782 
 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

783 
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

784 
 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

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

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

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

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

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

793 
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

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

797 
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

798 

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

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

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

801 

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

802 

14136  803 
*** HOL *** 
804 

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

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

808 
can be used like any other Isabelle image. See 

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

810 

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

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

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

813 
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

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

815 
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

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

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

818 
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

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

820 

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

824 
* Numerics: 

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

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

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

14389  832 

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

14255  835 
* Records: 
836 
 Record types are now by default printed with their type abbreviation 

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

838 
the reference "print_record_type_abbr". 

14731  839 
 Simproc "record_upd_simproc" for simplification of multiple updates added 
14255  840 
(not enabled by default). 
14427  841 
 Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp. 
842 
EX x. x = sel r to True (not enabled by default). 

14255  843 
 Tactic "record_split_simp_tac" to split and simplify records added. 
14731  844 

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

14136  848 

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

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

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

852 

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

14731  856 
* HOLMatrix: a first theory for matrices in HOL with an application of 
14610  857 
matrix theory to linear programming. 
14136  858 

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

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

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

14380  864 

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

14418  868 
like in normal math, and corresponding versions for < and for intersection. 
869 

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

872 

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

14380  875 

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

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

879 

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

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

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

884 
for examples. 

14464  885 

14606  886 

14536  887 
*** HOLCF *** 
888 

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

890 

14572  891 

892 

14136  893 
New in Isabelle2003 (May 2003) 
14606  894 
 
14136  895 

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

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

897 

13618  898 
* Provers/simplifier: 
899 

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

903 
the order of assumptions. 

904 

905 
Potential INCOMPATIBILITY: 

906 

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

13618  909 

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

911 

13781  912 
now gives rise to the infinite reduction sequence 
913 

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

915 

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

917 
kind of problem. 

918 

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

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

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

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

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

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

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

13618  926 

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

928 

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

931 
conditions before applying the rewrite rule): 

932 
ML "simp_depth_limit := n" 

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

934 
the simplifier would diverge. 

935 

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

936 
 Accepts free variables as head terms in congruence rules. Useful in Isar. 
13829  937 

13938  938 
 No longer aborts on failed congruence proof. Instead, the 
939 
congruence is ignored. 

940 

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

943 
as HOL/Extraction for some case studies. 

944 

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

947 
PG menu: Isabelle/Isar > Settings > Show Main Goal 
13815  948 
(ML: Proof.show_main_goal). 
949 

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

951 
rules whose conclusion matches subgoal 1: 

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

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

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

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

956 
(ML: ProofGeneral.print_intros()) 

957 

958 
* Pure: New flag trace_unify_fail causes unification to print 

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

961 
assumption failed. 

962 

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

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

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

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

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

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

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

970 

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

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

972 
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

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

974 

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

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

976 
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

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

980 
be given (the default is 40); 

981 

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

983 
(batchmode only); 

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

984 

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

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

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

987 
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

988 

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

991 
for slight decrease in efficiency; 

992 

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

995 

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

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

997 
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

998 

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

999 

13158  1000 
*** HOL *** 
1001 

13899  1002 
* arith(_tac) 
1003 

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

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

1006 
of quantifierfree linear arithmetic. 

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

1008 

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

1010 

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

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

14731  1013 
Presburger arithmetic can also be called explicitly via presburger(_tac). 
13899  1014 

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

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

1017 

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

1019 
are distributed over a sum of terms; 

1020 

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

14731  1023 
"<=", "<" and "="). 
1024 

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

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

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

1030 

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

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

1032 
Finite_Set); 
13492  1033 

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

1036 

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

1039 

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

1042 
of the empty set. 

1043 

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

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

1047 
Univariate Polynomials). Contributions welcome; 

13960  1048 

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

1050 

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

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

1054 

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

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

1056 

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

1058 
Fleuriot); 
13960  1059 

13549  1060 
* Real/HahnBanach: updated and adapted to locales; 
1061 

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

13872  1064 

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

1066 

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

1069 

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

1072 
classes, interfaces, objects,virtual methods, static methods, 

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

1074 
assignment, exceptions. 

13549  1075 

14011  1076 

13549  1077 
*** ZF *** 
1078 

15154  1079 
* ZF/Constructible: consistency proof for AC (Gdel's constructible 
13549  1080 
universe, etc.); 
1081 

13872  1082 
* Main ZF: virtually all theories converted to newstyle format; 
13518  1083 

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

1084 

13478  1085 
*** ML *** 
1086 

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

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

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

1090 

1091 
* Pure: improved error reporting of simprocs; 

1092 

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

1094 
up simprocs; 

1095 

1096 

13953  1097 
*** Document preparation *** 
1098 

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

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

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

1102 

14731  1103 
* minimized dependencies of isabelle.sty and isabellesym.sty on 
13953  1104 
other packages 
1105 

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

1107 
broke \Rightarrow) 

1108 

14731  1109 
* normal size for \<zero>...\<nine> (uses \mathbf instead of 
13954  1110 
textcomp package) 
13953  1111 

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

1112 

14572  1113 

12984  1114 
New in Isabelle2002 (March 2002) 
1115 
 

11474  1116 

11572  1117 
*** Document preparation *** 
1118 

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

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

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

1121 
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

1122 
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

1123 
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

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

1125 

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

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

1127 
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

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

1129 

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

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

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

1132 

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

1135 

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

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

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

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

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

1144 
isatool document copies the Isabelle style files to the target 

1145 
location; 

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

1146 

11572  1147 

11633  1148 
*** Isar *** 
1149 

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

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

1153 
 'induct' method divinates rule instantiation from the inductive 

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

1155 
instantiation of cases; 

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

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

1158 
rules without further ado; 

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

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

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

1162 
statement becomes is included in the hypothesis, avoiding the 

1163 
slightly cumbersome show "PROP ?case" form; 

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

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

1166 
rules stemming from inductive sets to be applied in unstructured 

1167 
scripts, while still benefitting from proper handling of nonatomic 

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

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

1170 
 'induct' proper support for mutual induction involving nonatomic 

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

1172 
below); 

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

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

1175 
 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

1176 
 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

1177 
 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

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

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

1180 
 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

1181 

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

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

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

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

1185 
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

1186 
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

1187 
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

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

1189 

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

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

1191 

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

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

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

1194 

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

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

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

1201 
some examples; 

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

1202 

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

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

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

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

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

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

1208 

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

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

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

1213 
the context elements being discharged in the obvious way; 

1214 

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

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

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

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

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

1220 

11722  1221 
* Pure: renamed "antecedent" case to "rule_context"; 
1222 

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

1225 
use hardwired "Trueprop"; 

1226 

11738  1227 
* Pure: added 'corollary' command; 
1228 

11722  1229 
* Pure: fixed 'token_translation' command; 
1230 

11899  1231 
* Pure: removed obsolete 'exported' attribute; 
1232 

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

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

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

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

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

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

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

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

1242 

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

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

1244 
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

1245 
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

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

1247 

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

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

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

1250 

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

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

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

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

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

1255 

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

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

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

1258 

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

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

1260 
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

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

1262 

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

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

1264 
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

1265 
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

1266 

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

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

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

1269 
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

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

1271 
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

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

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

1274 

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

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

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

1277 

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

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

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

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

1281 

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

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

1283 

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

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

1289 

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

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

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

1292 

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

1293 

11474  1294 
*** HOL *** 
1295 

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

1298 

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

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

1301 

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

1303 
binary representation internally; 

1304 

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

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

1307 

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

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

1309 
are some hints on converting existing sources: 
11702  1310 

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

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

1313 
to be spaced properly; 

1314 

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

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

1317 

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

1319 

1320 
 remove all special provisions on numerals in proofs; 

1321 

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

12736  1325 
* HOL: symbolic syntax for x^2 (numeral 2); 
1326 

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

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

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

1329 
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

1330 
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

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

1332 

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

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

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

1337 
declared as simp by default; 

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

1338 
 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

1339 
qualified)  potential INCOMPATIBILITY; 
12280  1340 
 removed "make_scheme" operations (use "make" with "extend")  
1341 
INCOMPATIBILITY; 

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

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

1348 

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

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

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

1351 
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

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

1353 

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

13824  1356 
* HOL: consolidated and renamed several theories. In particular: 
14731  1357 
Ord.thy has been absorbed into HOL.thy 
1358 
String.thy has been absorbed into List.thy 

1359 

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

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

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

1362 

11657  1363 
* HOL: linorder_less_split superseded by linorder_cases; 
1364 

12917  1365 
* HOL/List: "nodups" renamed to "distinct"; 
12889  1366 

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

11437  1370 

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

1373 

1374 
delSWrapper "split_all_tac" 

1375 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

1376 

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

11474  1378 
MAY FAIL; 
11361  1379 

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

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

1383 
necessary to attach explicit type constraints; 

11307  1384 

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

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

12489  1388 

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

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

1390 
expressions; 
11474  1391 

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

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

1393 
of "lam"  INCOMPATIBILITY; 
11474  1394 

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

1397 
renamed "Product_Type.unit"; 

11611  1398 

12564  1399 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
1400 

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

1403 
