author  avigad 
Fri, 29 Jul 2005 19:47:41 +0200  
changeset 16962  f99dd1274c5f 
parent 16929  b23c54fd31f7 
child 16997  7dfc99f62dd9 
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 

22 
nonIsar theories. 

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 

54 
* There is now a flag to control hiding of proofs and some other 

55 
commands (such as 'ML' or 'parse/print_translation') in document 

56 
output. Hiding is enabled by default, and can be disabled by the 

57 
option 'H false' of isatool usedir or by resetting the reference 

58 
variable IsarOutput.hide_commands in ML. Additional commands to be 

59 
hidden may be declared using IsarOutput.add_hidden_commands. 

60 

15979  61 
* Several new antiquotation: 
62 

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

64 

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

66 

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

15979  69 

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

16234  71 
theorem applying a "style" to it 
72 

73 
Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of 

74 
definitions, equations, inequations etc., 'concl' printing only the 

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

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

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

78 
document practical applications. 

79 

80 

81 
*** Pure *** 

82 

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

84 
automatic typeinference of declared constants; additional support for 

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

86 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

87 
sequential dependencies of definitions within a single 'constdefs' 

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

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

90 

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

92 
indexed syntax provides a notational device for subscripted 

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

94 
expressions. Secondly, in a local context with structure 

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

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

97 
show_structs controls printing of implicit structures. Typical 

98 
applications of these concepts involve record types and locales. 

99 

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

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

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

103 

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

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

106 
parsing/printing, see also isarref manual. 

107 

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

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

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

112 
INCOMPATIBILITY. 

113 

16234  114 
* Improved internal renaming of symbolic identifiers  attach primes 
115 
instead of base 26 numbers. 

116 

117 
* New flag show_question_marks controls printing of leading question 

118 
marks in schematic variable names. 

119 

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

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

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

123 

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

125 
by simp 

126 

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

128 

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

130 
annotations as "(00...)". 

131 

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

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

134 
Before that distinction was only partially implemented via type class 

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

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

137 
exotic syntax specifications may require further adaption 

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

139 

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

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

142 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

143 
specifications. 

144 

145 
* Simplifier: can now control the depth to which conditional rewriting 

146 
is traced via the PG menu Isabelle > Settings > Trace Simp Depth 

147 
Limit. 

148 

149 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

155 
allow for use in a context of fixed variables. 

156 

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

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

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

160 

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

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

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

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

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

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

167 

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

169 
selections of theorems in named facts via index ranges. 

170 

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

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

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

173 

16234  174 

175 
*** Locales *** 

176 

177 
* New commands for the interpretation of locale expressions in 

178 
theories ('interpretation') and proof contexts ('interpret'). These 

179 
take an instantiation of the locale parameters and compute proof 

180 
obligations from the instantiated specification. After the 

181 
obligations have been discharged, the instantiated theorems of the 

182 
locale are added to the theory or proof context. Interpretation is 

183 
smart in that already active interpretations do not occur in proof 

184 
obligations, neither are instantiated theorems stored in duplicate. 

185 
Use print_interps to inspect active interpretations of a particular 

186 
locale. For details, see the Isar Reference manual. 

187 

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

189 
'interpret' instead. 

190 

191 
* Proper static binding of attribute syntax  i.e. types / terms / 

192 
facts mentioned as arguments are always those of the locale definition 

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

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

195 
to attribute arguments as expected. 

196 

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

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

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

200 
Attribute implementations need to cooperate properly with the static 

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

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

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

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

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

206 
values to argument tokens explicitly. 

207 

208 
* New context element "constrains" adds type constraints to parameters  

209 
there is no logical significance. 

210 

211 
* Context expressions: renaming parameters permits syntax 

212 
redeclaration as well. 

213 

214 
* Locale definition: 'includes' now disallowed. 

215 

216 
* Changed parameter management in theorem generation for long goal 

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

218 
theorem statement in rare situations. 

219 

220 
* Attributes 'induct' and 'cases': type or set names may now be 

221 
locally fixed variables as well. 

15703  222 

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

16234  224 
alternative context used for evaluating and printing the subsequent 
225 
argument, as in @{thm [locale=LC] fold_commute}, for example. 

226 

227 

228 
*** Provers *** 

229 

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

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

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

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

234 
still available as 'simplesubst'. 

235 

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

237 
and quasi orders. 

238 

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

240 
reflexivetransitive closure of relations. 

241 

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

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

244 

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

246 
is peformed already. Objectlogics merely need to finish their 

247 
initial simpset configuration as before. INCOMPATIBILITY. 

15703  248 

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

249 

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

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

251 

16234  252 
* Symbolic syntax of Hilbert Choice Operator is now as follows: 
14878  253 

254 
syntax (epsilon) 

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

256 

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

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

260 
becomes available as variable, constant etc. INCOMPATIBILITY, 

261 

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

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

264 
is \<ge>. 

265 

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

267 
instead of ":". 

268 

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

270 

271 
Old New 

272 
{..n(} {..<n} 

273 
{)n..} {n<..} 

274 
{m..n(} {m..<n} 

275 
{)m..n} {m<..n} 

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

277 

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

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

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

15046  281 

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

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

284 

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

287 
now either "SUM x:A. e" or "\<Sum>x \<in> A. e". 

288 

289 
Some new syntax forms are available: 

290 

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

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

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

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

295 

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

297 
function "Summation", which has been discontinued. 

298 

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

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

301 
(insert F x)'. 

302 

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

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

305 
typedefs, inductive datatypes and recursion. 

306 

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

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

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

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

311 
in unstructured proof scripts. 

312 

313 
* Reworked implementation of records. Improved scalability for 

314 
records with many fields, avoiding performance problems for type 

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

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

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

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

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

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

321 
<record_name>_ext_type. 

322 

323 
Flag record_quick_and_dirty_sensitive can be enabled to skip the 

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

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

326 
quite long. 

327 

328 
New simproc record_upd_simproc for simplification of multiple record 

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

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

331 
occasionally, since simplification is more powerful by default. 

332 

333 
* Simplifier: automatically reasons about transitivity chains 

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

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

336 
old proofs break occasionally as simplification may now solve more 

337 
goals than previously. 

338 

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

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

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

342 
just like y <= x. 

343 

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

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

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

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

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

349 
enabled/disabled by the reference use_let_simproc. Potential 

350 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  351 

16563  352 
* Classical reasoning: the meson method now accepts theorems as arguments. 
353 

16891  354 
* Theory OrderedGroup and Ring_and_Field: various additions and 
355 
improvements to faciliate calculations involving equalities and 

356 
inequalities. 

357 

358 
The following theorems have been eliminated or modified 

359 
(INCOMPATIBILITY): 

16888  360 

361 
abs_eq now named abs_of_nonneg 

362 
abs_of_ge_0 now named abs_of_nonneg 

363 
abs_minus_eq now named abs_of_nonpos 

364 
imp_abs_id now named abs_of_nonneg 

365 
imp_abs_neg_id now named abs_of_nonpos 

366 
mult_pos now named mult_pos_pos 

367 
mult_pos_le now named mult_nonneg_nonneg 

368 
mult_pos_neg_le now named mult_nonneg_nonpos 

369 
mult_pos_neg2_le now named mult_nonneg_nonpos2 

370 
mult_neg now named mult_neg_neg 

371 
mult_neg_le now named mult_nonpos_nonpos 

372 

16891  373 
* Theory Parity: added rules for simplifying exponents. 
374 

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

377 

16888  378 

379 
*** HOLComplex *** 

380 

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

383 

384 
The following theorems have been eliminated or modified 

385 
(INCOMPATIBILITY): 

386 

387 
real_of_int_add reversed direction of equality (use [symmetric]) 

388 
real_of_int_minus reversed direction of equality (use [symmetric]) 

389 
real_of_int_diff reversed direction of equality (use [symmetric]) 

390 
real_of_int_mult reversed direction of equality (use [symmetric]) 

391 

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

16888  393 

16962  394 
* Theory Ln is new, with properties of the natural logarithm 
395 

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

396 

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

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

398 

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

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

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

402 

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

403 

14885  404 
*** ZF *** 
405 

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

408 
of a homomorphism). 

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

409 

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

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

15703  413 

414 

415 
*** ML *** 

416 

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

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

421 
accordingly, while Option.map replaces apsome. 

15973  422 

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

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

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

425 
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

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

427 

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

428 
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

429 
toplevel, as they are variants of predefined functions. The following 
16234  430 
suggests how one can translate existing code: 
15973  431 

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

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

434 
last_elem xs = List.last xs 

435 
flat xss = List.concat xss 

16234  436 
seq fs = List.app fs 
15973  437 
partition P xs = List.partition P xs 
438 
mapfilter f xs = List.mapPartial f xs 

439 

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

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

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

442 

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

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

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

445 

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

446 
* Pure/library.ML: canonical list combinators fold, fold_rev, and 
16869  447 
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

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

449 

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

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

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

452 

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

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

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

455 

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

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

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

458 

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

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

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

461 

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

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

463 
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

464 
canonical argument order. Supercedes previous foldl_XXX versions, 
16868  465 
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

466 

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

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

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

472 
result of Pretty.string_of/str_of and derived functions 

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

474 
easy composition of diagnostic messages etc. Programmers rarely need 

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

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

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

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

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

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

481 
have no effect. 

482 

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

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

486 

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

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

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

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

491 
(both increase the runtime). 

15703  492 

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

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

494 
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

495 
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

496 

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

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

499 

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

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

501 
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

502 
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

503 
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

504 
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

505 
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

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

507 

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

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

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

513 
name; NameSpace.extend is superceded by context dependent 

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

515 
the naming context. Especially note Theory.restore_naming and 

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

517 
Theory.add_path is no longer sufficient to recover from 

518 
Theory.absolute_path in particular. 

519 

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

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

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

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

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

525 
with earlier declarations. 

16151  526 

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

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

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

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

530 

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

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

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

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

534 
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

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

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

537 

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

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

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

540 

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

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

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

543 

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

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

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

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

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

548 

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

549 
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

550 
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

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

552 

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

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

554 
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

555 
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

556 
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

557 

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

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

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

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

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

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

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

564 
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

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

566 

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

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

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

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

570 

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

16151  574 

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

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

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

577 

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

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

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

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

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

582 

16718  583 
* Pure: print_tac now outputs the goal through the trace channel. 
584 

15703  585 
* Provers: Simplifier and Classical Reasoner now support proof context 
16234  586 
dependent plugins (simprocs, solvers, wrappers etc.). These extra 
587 
components are stored in the theory and patched into the 

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

589 
components are maintained by the following theory operations: 

590 

591 
Simplifier.add_context_simprocs 

592 
Simplifier.del_context_simprocs 

593 
Simplifier.set_context_subgoaler 

594 
Simplifier.reset_context_subgoaler 

595 
Simplifier.add_context_looper 

596 
Simplifier.del_context_looper 

597 
Simplifier.add_context_unsafe_solver 

598 
Simplifier.add_context_safe_solver 

599 

600 
Classical.add_context_safe_wrapper 

601 
Classical.del_context_safe_wrapper 

602 
Classical.add_context_unsafe_wrapper 

603 
Classical.del_context_unsafe_wrapper 

604 

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

606 
local_simpset_of and local_claset_of to instead of the primitive 

607 
Simplifier.get_local_simpset and Classical.get_local_claset, 

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

609 

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

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

611 
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

612 
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

613 
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

614 

16234  615 

616 
*** System *** 

617 

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

619 
isabelle, isatool etc.). 

620 

621 
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for 

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

623 

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

625 
used by Isabelle; default is ROOT.ML. 

626 

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

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

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

629 

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

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

15703  633 

634 

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

635 

14606  636 
New in Isabelle2004 (April 2004) 
637 
 

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

638 

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

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

640 

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

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

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

643 

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

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

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

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

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

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

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

653 
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

654 

14237  655 
* Pure: Macintosh and Windows linebreaks are now allowed in theory files. 
656 

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

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

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

14233  661 

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

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

14333  666 

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

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

670 

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

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

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

14224  675 
rather than definitionally, such as the metalogic connectives. 
676 

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

679 

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

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

684 

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

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

686 

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

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

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

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

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

691 
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

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

693 
 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

694 
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

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

696 

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

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

698 
 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

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

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

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

702 

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

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

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

705 
and derived forms. 
14283  706 

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

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

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

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

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

711 
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

712 
 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

713 
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

714 
 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

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

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

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

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

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

723 
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

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

727 
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

728 

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

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

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

731 

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

732 

14136  733 
*** HOL *** 
734 

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

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

738 
can be used like any other Isabelle image. See 

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

740 

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

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

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

743 
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

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

745 
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

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

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

748 
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

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

750 

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

754 
* Numerics: 

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

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

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

14389  762 

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

14255  765 
* Records: 
766 
 Record types are now by default printed with their type abbreviation 

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

768 
the reference "print_record_type_abbr". 

14731  769 
 Simproc "record_upd_simproc" for simplification of multiple updates added 
14255  770 
(not enabled by default). 
14427  771 
 Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp. 
772 
EX x. x = sel r to True (not enabled by default). 

14255  773 
 Tactic "record_split_simp_tac" to split and simplify records added. 
14731  774 

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

14136  778 

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

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

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

782 

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

14731  786 
* HOLMatrix: a first theory for matrices in HOL with an application of 
14610  787 
matrix theory to linear programming. 
14136  788 

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

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

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

14380  794 

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

14418  798 
like in normal math, and corresponding versions for < and for intersection. 
799 

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

802 

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

14380  805 

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

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

809 

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

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

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

814 
for examples. 

14464  815 

14606  816 

14536  817 
*** HOLCF *** 
818 

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

820 

14572  821 

822 

14136  823 
New in Isabelle2003 (May 2003) 
14606  824 
 
14136  825 

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

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

827 

13618  828 
* Provers/simplifier: 
829 

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

833 
the order of assumptions. 

834 

835 
Potential INCOMPATIBILITY: 

836 

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

13618  839 

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

841 

13781  842 
now gives rise to the infinite reduction sequence 
843 

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

845 

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

847 
kind of problem. 

848 

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

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

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

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

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

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

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

13618  856 

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

858 

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

861 
conditions before applying the rewrite rule): 

862 
ML "simp_depth_limit := n" 

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

864 
the simplifier would diverge. 

865 

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

866 
 Accepts free variables as head terms in congruence rules. Useful in Isar. 
13829  867 

13938  868 
 No longer aborts on failed congruence proof. Instead, the 
869 
congruence is ignored. 

870 

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

873 
as HOL/Extraction for some case studies. 

874 

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

877 
PG menu: Isabelle/Isar > Settings > Show Main Goal 
13815  878 
(ML: Proof.show_main_goal). 
879 

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

881 
rules whose conclusion matches subgoal 1: 

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

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

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

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

886 
(ML: ProofGeneral.print_intros()) 

887 

888 
* Pure: New flag trace_unify_fail causes unification to print 

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

891 
assumption failed. 

892 

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

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

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

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

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

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

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

900 

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

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

902 
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

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

904 

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

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

906 
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

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

910 
be given (the default is 40); 

911 

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

913 
(batchmode only); 

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

914 

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

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

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

917 
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

918 

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

921 
for slight decrease in efficiency; 

922 

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

925 

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

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

927 
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

928 

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

929 

13158  930 
*** HOL *** 
931 

13899  932 
* arith(_tac) 
933 

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

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

936 
of quantifierfree linear arithmetic. 

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

938 

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

940 

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

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

14731  943 
Presburger arithmetic can also be called explicitly via presburger(_tac). 
13899  944 

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

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

947 

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

949 
are distributed over a sum of terms; 

950 

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

14731  953 
"<=", "<" and "="). 
954 

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

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

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

960 

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

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

962 
Finite_Set); 
13492  963 

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

966 

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

969 

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

972 
of the empty set. 

973 

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

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

977 
Univariate Polynomials). Contributions welcome; 

13960  978 

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

980 

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

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

984 

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

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

986 

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

988 
Fleuriot); 
13960  989 

13549  990 
* Real/HahnBanach: updated and adapted to locales; 
991 

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

13872  994 

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

996 

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

999 

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

1002 
classes, interfaces, objects,virtual methods, static methods, 

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

1004 
assignment, exceptions. 

13549  1005 

14011  1006 

13549  1007 
*** ZF *** 
1008 

15154  1009 
* ZF/Constructible: consistency proof for AC (Gdel's constructible 
13549  1010 
universe, etc.); 
1011 

13872  1012 
* Main ZF: virtually all theories converted to newstyle format; 
13518  1013 

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

1014 

13478  1015 
*** ML *** 
1016 

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

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

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

1020 

1021 
* Pure: improved error reporting of simprocs; 

1022 

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

1024 
up simprocs; 

1025 

1026 

13953  1027 
*** Document preparation *** 
1028 

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

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

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

1032 

14731  1033 
* minimized dependencies of isabelle.sty and isabellesym.sty on 
13953  1034 
other packages 
1035 

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

1037 
broke \Rightarrow) 

1038 

14731  1039 
* normal size for \<zero>...\<nine> (uses \mathbf instead of 
13954  1040 
textcomp package) 
13953  1041 

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

1042 

14572  1043 

12984  1044 
New in Isabelle2002 (March 2002) 
1045 
 

11474  1046 

11572  1047 
*** Document preparation *** 
1048 

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

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

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

1051 
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

1052 
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

1053 
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

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

1055 

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

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

1057 
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

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

1059 

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

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

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

1062 

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

1065 

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

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

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

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

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

1074 
isatool document copies the Isabelle style files to the target 

1075 
location; 

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

1076 

11572  1077 

11633  1078 
*** Isar *** 
1079 

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

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

1083 
 'induct' method divinates rule instantiation from the inductive 

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

1085 
instantiation of cases; 

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

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

1088 
rules without further ado; 

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

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

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

1092 
statement becomes is included in the hypothesis, avoiding the 

1093 
slightly cumbersome show "PROP ?case" form; 

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

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

1096 
rules stemming from inductive sets to be applied in unstructured 

1097 
scripts, while still benefitting from proper handling of nonatomic 

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

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

1100 
 'induct' proper support for mutual induction involving nonatomic 

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

1102 
below); 

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

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

1105 
 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

1106 
 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

1107 
 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

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

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

1110 
 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

1111 

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

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

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

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

1115 
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

1116 
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

1117 
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

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

1119 

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

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

1121 

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

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

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

1124 

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

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

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

1131 
some examples; 

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

1132 

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

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

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

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

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

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

1138 

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

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

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

1143 
the context elements being discharged in the obvious way; 

1144 

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

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

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

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

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

1150 

11722  1151 
* Pure: renamed "antecedent" case to "rule_context"; 
1152 

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

1155 
use hardwired "Trueprop"; 

1156 

11738  1157 
* Pure: added 'corollary' command; 
1158 

11722  1159 
* Pure: fixed 'token_translation' command; 
1160 

11899  1161 
* Pure: removed obsolete 'exported' attribute; 
1162 

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

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

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

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

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

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

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

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

1172 

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

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

1174 
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

1175 
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

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

1177 

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

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

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

1180 

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

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

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

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

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

1185 

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

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

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

1188 

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

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

1190 
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

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

1192 

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

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

1194 
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

1195 
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

1196 

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

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

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

1199 
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

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

1201 
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

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

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

1204 

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

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

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

1207 

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

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

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

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

1211 

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

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

1213 

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

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

1219 

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

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

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

1222 

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

1223 

11474  1224 
*** HOL *** 
1225 

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

1228 

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

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

1231 

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

1233 
binary representation internally; 

1234 

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

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

1237 

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

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

1239 
are some hints on converting existing sources: 
11702  1240 

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

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

1243 
to be spaced properly; 

1244 

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

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

1247 

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

1249 

1250 
 remove all special provisions on numerals in proofs; 

1251 

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

12736  1255 
* HOL: symbolic syntax for x^2 (numeral 2); 
1256 

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

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

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

1259 
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

1260 
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

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

1262 

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

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

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

1267 
declared as simp by default; 

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

1268 
 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

1269 
qualified)  potential INCOMPATIBILITY; 
12280  1270 
 removed "make_scheme" operations (use "make" with "extend")  
1271 
INCOMPATIBILITY; 

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

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

1278 

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

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

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

1281 
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

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

1283 

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

13824  1286 
* HOL: consolidated and renamed several theories. In particular: 
14731  1287 
Ord.thy has been absorbed into HOL.thy 
1288 
String.thy has been absorbed into List.thy 

1289 

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

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

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

1292 

11657  1293 
* HOL: linorder_less_split superseded by linorder_cases; 
1294 

12917  1295 
* HOL/List: "nodups" renamed to "distinct"; 
12889  1296 

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

11437  1300 

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

1303 

1304 
delSWrapper "split_all_tac" 

1305 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

1306 

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

11474  1308 
MAY FAIL; 
11361  1309 

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

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

1313 
necessary to attach explicit type constraints; 

11307  1314 

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

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

12489  1318 

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

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

1320 
expressions; 
11474  1321 

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

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

1323 
of "lam"  INCOMPATIBILITY; 
11474  1324 

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

1327 
renamed "Product_Type.unit"; 

11611  1328 

12564  1329 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
1330 

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

1333 

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

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

1336 

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

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

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

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

1340 

12734  1341 
* HOLReal: added Complex_Numbers (by Gertrud Bauer); 
1342 

12690  1343 
* HOLHyperreal is now a logic image; 
1344 

11611  1345 

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

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

1347 

12622  1348 
* Isar: consts/constdefs supports mixfix syntax for continuous 
1349 
operations; 

1350 

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

1352 
HOLCF/ex/Dnat.thy; 

1353 

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

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

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

1357 

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

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

1359 

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

1360 

11474  1361 
*** ZF *** 
1362 

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

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

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

1367 

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

1369 
your theory on Main_ZFC; 

1370 

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

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

12563  1373 

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

1376 

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

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

1379 

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

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

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

1383 

13025  1384 
* ZF: many new theorems about lists, ordinals, etc.; 
12850  1385 

11474  1386 

1387 
*** General *** 

1388 

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

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

1392 
also ref manual for further ML interfaces; 

1393 

1394 
* Pure/axclass: removed obsolete ML interface 

1395 
goal_subclass/goal_arity; 

1396 

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

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

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

1400 
properly; 

1401 

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

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

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

1404 

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

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

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

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

1408 
type variable); 
12280  1409 

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

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

1412 
"type_brackets"; 

1413 

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

11817  1415 
tokens into AST constants; 
11474  1416 

12280 < 