author  nipkow 
Wed, 17 Aug 2005 14:19:17 +0200  
changeset 17092  16971afe75f6 
parent 17047  e2e2d75bb37b 
child 17095  669005f73b81 
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 

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

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

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

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

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

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

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

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

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

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

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

64 

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

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

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

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

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

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

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

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

72 
specified above. 
16234  73 

15979  74 
* Several new antiquotation: 
75 

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

77 

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

79 

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

15979  82 

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

16234  84 
theorem applying a "style" to it 
85 

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

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

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

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

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

91 
document practical applications. 

92 

93 

94 
*** Pure *** 

95 

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

97 
automatic typeinference of declared constants; additional support for 

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

99 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

100 
sequential dependencies of definitions within a single 'constdefs' 

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

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

103 

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

105 
indexed syntax provides a notational device for subscripted 

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

107 
expressions. Secondly, in a local context with structure 

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

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

110 
show_structs controls printing of implicit structures. Typical 

111 
applications of these concepts involve record types and locales. 

112 

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

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

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

116 

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

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

119 
parsing/printing, see also isarref manual. 

120 

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

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

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

125 
INCOMPATIBILITY. 

126 

16234  127 
* Improved internal renaming of symbolic identifiers  attach primes 
128 
instead of base 26 numbers. 

129 

130 
* New flag show_question_marks controls printing of leading question 

131 
marks in schematic variable names. 

132 

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

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

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

136 

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

138 
by simp 

139 

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

141 

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

143 
annotations as "(00...)". 

144 

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

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

147 
Before that distinction was only partially implemented via type class 

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

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

150 
exotic syntax specifications may require further adaption 

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

152 

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

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

155 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

156 
specifications. 

157 

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

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

160 
Limit. 

161 

162 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

168 
allow for use in a context of fixed variables. 

169 

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

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

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

173 

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

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

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

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

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

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

180 

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

182 
selections of theorems in named facts via index ranges. 

183 

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

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

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

186 

16234  187 

188 
*** Locales *** 

189 

190 
* New commands for the interpretation of locale expressions in 

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

192 
take an instantiation of the locale parameters and compute proof 

193 
obligations from the instantiated specification. After the 

194 
obligations have been discharged, the instantiated theorems of the 

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

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

197 
obligations, neither are instantiated theorems stored in duplicate. 

198 
Use print_interps to inspect active interpretations of a particular 

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

200 

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

202 
'interpret' instead. 

203 

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

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

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

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

208 
to attribute arguments as expected. 

209 

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

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

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

213 
Attribute implementations need to cooperate properly with the static 

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

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

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

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

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

219 
values to argument tokens explicitly. 

220 

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

222 
there is no logical significance. 

223 

224 
* Context expressions: renaming parameters permits syntax 

225 
redeclaration as well. 

226 

227 
* Locale definition: 'includes' now disallowed. 

228 

229 
* Changed parameter management in theorem generation for long goal 

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

231 
theorem statement in rare situations. 

232 

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

234 
locally fixed variables as well. 

15703  235 

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

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

239 

240 

241 
*** Provers *** 

242 

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

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

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

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

247 
still available as 'simplesubst'. 

248 

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

250 
and quasi orders. 

251 

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

253 
reflexivetransitive closure of relations. 

254 

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

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

257 

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

259 
is peformed already. Objectlogics merely need to finish their 

260 
initial simpset configuration as before. INCOMPATIBILITY. 

15703  261 

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

262 

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

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

264 

16234  265 
* Symbolic syntax of Hilbert Choice Operator is now as follows: 
14878  266 

267 
syntax (epsilon) 

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

269 

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

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

273 
becomes available as variable, constant etc. INCOMPATIBILITY, 

274 

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

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

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

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

278 
support corresponding Isar calculations. 
16234  279 

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

281 
instead of ":". 

282 

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

284 

285 
Old New 

286 
{..n(} {..<n} 

287 
{)n..} {n<..} 

288 
{m..n(} {m..<n} 

289 
{)m..n} {m<..n} 

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

291 

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

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

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

15046  295 

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

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

298 

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

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

302 

303 
Some new syntax forms are available: 

304 

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

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

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

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

309 

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

311 
function "Summation", which has been discontinued. 

312 

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

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

315 
(insert F x)'. 

316 

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

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

319 
typedefs, inductive datatypes and recursion. 

320 

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

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

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

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

325 
in unstructured proof scripts. 

326 

327 
* Reworked implementation of records. Improved scalability for 

328 
records with many fields, avoiding performance problems for type 

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

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

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

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

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

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

335 
<record_name>_ext_type. 

336 

337 
Flag record_quick_and_dirty_sensitive can be enabled to skip the 

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

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

340 
quite long. 

341 

342 
New simproc record_upd_simproc for simplification of multiple record 

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

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

345 
occasionally, since simplification is more powerful by default. 

346 

347 
* Simplifier: automatically reasons about transitivity chains 

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

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

350 
old proofs break occasionally as simplification may now solve more 

351 
goals than previously. 

352 

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

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

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

356 
just like y <= x. 

357 

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

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

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

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

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

363 
enabled/disabled by the reference use_let_simproc. Potential 

364 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  365 

16563  366 
* Classical reasoning: the meson method now accepts theorems as arguments. 
367 

16891  368 
* Theory OrderedGroup and Ring_and_Field: various additions and 
369 
improvements to faciliate calculations involving equalities and 

370 
inequalities. 

371 

372 
The following theorems have been eliminated or modified 

373 
(INCOMPATIBILITY): 

16888  374 

375 
abs_eq now named abs_of_nonneg 

376 
abs_of_ge_0 now named abs_of_nonneg 

377 
abs_minus_eq now named abs_of_nonpos 

378 
imp_abs_id now named abs_of_nonneg 

379 
imp_abs_neg_id now named abs_of_nonpos 

380 
mult_pos now named mult_pos_pos 

381 
mult_pos_le now named mult_nonneg_nonneg 

382 
mult_pos_neg_le now named mult_nonneg_nonpos 

383 
mult_pos_neg2_le now named mult_nonneg_nonpos2 

384 
mult_neg now named mult_neg_neg 

385 
mult_neg_le now named mult_nonpos_nonpos 

386 

16891  387 
* Theory Parity: added rules for simplifying exponents. 
388 

17092  389 
* Theory List: 
390 

391 
The following theorems have been eliminated or modified 

392 
(INCOMPATIBILITY): 

393 

394 
list_all_Nil now named list_all.simps(1) 

395 
list_all_Cons now named list_all.simps(2) 

396 
list_all_conv now named list_all_iff 

397 
set_mem_eq now named mem_iff 

398 

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

401 

16888  402 

403 
*** HOLComplex *** 

404 

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

407 

408 
The following theorems have been eliminated or modified 

409 
(INCOMPATIBILITY): 

410 

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

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

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

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

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

415 
real_of_int_mult reversed direction of equality (use [symmetric]) 
16891  416 

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

16888  418 

16962  419 
* Theory Ln is new, with properties of the natural logarithm 
420 

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

421 

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

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

423 

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

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

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

427 

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

428 

14885  429 
*** ZF *** 
430 

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

433 
of a homomorphism). 

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

434 

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

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

15703  438 

439 

440 
*** ML *** 

441 

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

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

446 
accordingly, while Option.map replaces apsome. 

15973  447 

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

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

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

450 
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

451 
superceded by the standard hd and tl functions etc. 
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 
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

454 
toplevel, as they are variants of predefined functions. The following 
16234  455 
suggests how one can translate existing code: 
15973  456 

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

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

459 
last_elem xs = List.last xs 

460 
flat xss = List.concat xss 

16234  461 
seq fs = List.app fs 
15973  462 
partition P xs = List.partition P xs 
463 
mapfilter f xs = List.mapPartial f xs 

464 

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

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

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

467 

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

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

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

470 

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

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

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

474 

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

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

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

477 

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

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

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

480 

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

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

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

483 

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

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

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

486 

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

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

488 
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

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

491 

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

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

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

497 
result of Pretty.string_of/str_of and derived functions 

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

499 
easy composition of diagnostic messages etc. Programmers rarely need 

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

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

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

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

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

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

506 
have no effect. 

507 

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

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

511 

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

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

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

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

516 
(both increase the runtime). 

15703  517 

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

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

519 
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

520 
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

521 

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

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

524 

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

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

526 
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

527 
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

528 
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

529 
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

530 
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

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

532 

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

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

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

538 
name; NameSpace.extend is superceded by context dependent 

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

540 
the naming context. Especially note Theory.restore_naming and 

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

542 
Theory.add_path is no longer sufficient to recover from 

543 
Theory.absolute_path in particular. 

544 

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

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

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

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

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

550 
with earlier declarations. 

16151  551 

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

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

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

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

555 

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

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

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

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

559 
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

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

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

562 

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

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

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

565 

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

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

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

568 

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

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

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

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

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

573 

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

574 
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

575 
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

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

577 

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

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

579 
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

580 
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

581 
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

582 

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

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

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

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

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

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

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

589 
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

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

591 

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

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

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

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

595 

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

16151  599 

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

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

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

602 

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

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

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

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

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

607 

16718  608 
* Pure: print_tac now outputs the goal through the trace channel. 
609 

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

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

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

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

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

614 

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

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

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

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

620 

621 
Simplifier.add_context_simprocs 

622 
Simplifier.del_context_simprocs 

623 
Simplifier.set_context_subgoaler 

624 
Simplifier.reset_context_subgoaler 

625 
Simplifier.add_context_looper 

626 
Simplifier.del_context_looper 

627 
Simplifier.add_context_unsafe_solver 

628 
Simplifier.add_context_safe_solver 

629 

630 
Classical.add_context_safe_wrapper 

631 
Classical.del_context_safe_wrapper 

632 
Classical.add_context_unsafe_wrapper 

633 
Classical.del_context_unsafe_wrapper 

634 

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

636 
local_simpset_of and local_claset_of to instead of the primitive 

637 
Simplifier.get_local_simpset and Classical.get_local_claset, 

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

639 

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

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

641 
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

642 
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

643 
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

644 

16234  645 

646 
*** System *** 

647 

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

649 
isabelle, isatool etc.). 

650 

651 
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for 

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

653 

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

655 
used by Isabelle; default is ROOT.ML. 

656 

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

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

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

659 

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

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

15703  663 

664 

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

665 

14606  666 
New in Isabelle2004 (April 2004) 
667 
 

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

668 

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

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

670 

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

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

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

673 

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

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

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

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

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

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

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

683 
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

684 

14237  685 
* Pure: Macintosh and Windows linebreaks are now allowed in theory files. 
686 

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

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

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

14233  691 

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

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

14333  696 

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

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

700 

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

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

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

14224  705 
rather than definitionally, such as the metalogic connectives. 
706 

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

709 

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

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

714 

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

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

716 

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

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

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

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

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

721 
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

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

723 
 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

724 
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

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

726 

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

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

728 
 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

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

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

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

732 

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

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

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

735 
and derived forms. 
14283  736 

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

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

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

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

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

741 
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

742 
 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

743 
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

744 
 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

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

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

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

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

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

753 
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

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

757 
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

758 

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

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

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

761 

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

762 

14136  763 
*** HOL *** 
764 

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

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

768 
can be used like any other Isabelle image. See 

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

770 

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

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

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

773 
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

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

775 
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

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

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

778 
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

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

780 

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

784 
* Numerics: 

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

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

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

14389  792 

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

14255  795 
* Records: 
796 
 Record types are now by default printed with their type abbreviation 

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

798 
the reference "print_record_type_abbr". 

14731  799 
 Simproc "record_upd_simproc" for simplification of multiple updates added 
14255  800 
(not enabled by default). 
14427  801 
 Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp. 
802 
EX x. x = sel r to True (not enabled by default). 

14255  803 
 Tactic "record_split_simp_tac" to split and simplify records added. 
14731  804 

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

14136  808 

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

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

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

812 

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

14731  816 
* HOLMatrix: a first theory for matrices in HOL with an application of 
14610  817 
matrix theory to linear programming. 
14136  818 

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

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

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

14380  824 

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

14418  828 
like in normal math, and corresponding versions for < and for intersection. 
829 

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

832 

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

14380  835 

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

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

839 

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

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

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

844 
for examples. 

14464  845 

14606  846 

14536  847 
*** HOLCF *** 
848 

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

850 

14572  851 

852 

14136  853 
New in Isabelle2003 (May 2003) 
14606  854 
 
14136  855 

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

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

857 

13618  858 
* Provers/simplifier: 
859 

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

863 
the order of assumptions. 

864 

865 
Potential INCOMPATIBILITY: 

866 

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

13618  869 

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

871 

13781  872 
now gives rise to the infinite reduction sequence 
873 

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

875 

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

877 
kind of problem. 

878 

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

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

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

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

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

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

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

13618  886 

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

888 

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

891 
conditions before applying the rewrite rule): 

892 
ML "simp_depth_limit := n" 

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

894 
the simplifier would diverge. 

895 

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

896 
 Accepts free variables as head terms in congruence rules. Useful in Isar. 
13829  897 

13938  898 
 No longer aborts on failed congruence proof. Instead, the 
899 
congruence is ignored. 

900 

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

903 
as HOL/Extraction for some case studies. 

904 

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

907 
PG menu: Isabelle/Isar > Settings > Show Main Goal 
13815  908 
(ML: Proof.show_main_goal). 
909 

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

911 
rules whose conclusion matches subgoal 1: 

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

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

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

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

916 
(ML: ProofGeneral.print_intros()) 

917 

918 
* Pure: New flag trace_unify_fail causes unification to print 

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

921 
assumption failed. 

922 

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

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

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

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

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

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

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

930 

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

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

932 
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

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

934 

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

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

936 
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

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

940 
be given (the default is 40); 

941 

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

943 
(batchmode only); 

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

944 

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

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

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

947 
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

948 

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

951 
for slight decrease in efficiency; 

952 

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

955 

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

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

957 
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

958 

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

959 

13158  960 
*** HOL *** 
961 

13899  962 
* arith(_tac) 
963 

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

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

966 
of quantifierfree linear arithmetic. 

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

968 

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

970 

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

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

14731  973 
Presburger arithmetic can also be called explicitly via presburger(_tac). 
13899  974 

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

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

977 

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

979 
are distributed over a sum of terms; 

980 

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

14731  983 
"<=", "<" and "="). 
984 

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

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

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

990 

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

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

992 
Finite_Set); 
13492  993 

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

996 

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

999 

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

1002 
of the empty set. 

1003 

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

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

1007 
Univariate Polynomials). Contributions welcome; 

13960  1008 

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

1010 

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

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

1014 

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

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

1016 

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

1018 
Fleuriot); 
13960  1019 

13549  1020 
* Real/HahnBanach: updated and adapted to locales; 
1021 

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

13872  1024 

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

1026 

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

1029 

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

1032 
classes, interfaces, objects,virtual methods, static methods, 

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

1034 
assignment, exceptions. 

13549  1035 

14011  1036 

13549  1037 
*** ZF *** 
1038 

15154  1039 
* ZF/Constructible: consistency proof for AC (Gdel's constructible 
13549  1040 
universe, etc.); 
1041 

13872  1042 
* Main ZF: virtually all theories converted to newstyle format; 
13518  1043 

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

1044 

13478  1045 
*** ML *** 
1046 

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

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

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

1050 

1051 
* Pure: improved error reporting of simprocs; 

1052 

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

1054 
up simprocs; 

1055 

1056 

13953  1057 
*** Document preparation *** 
1058 

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

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

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

1062 

14731  1063 
* minimized dependencies of isabelle.sty and isabellesym.sty on 
13953  1064 
other packages 
1065 

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

1067 
broke \Rightarrow) 

1068 

14731  1069 
* normal size for \<zero>...\<nine> (uses \mathbf instead of 
13954  1070 
textcomp package) 
13953  1071 

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

1072 

14572  1073 

12984  1074 
New in Isabelle2002 (March 2002) 
1075 
 

11474  1076 

11572  1077 
*** Document preparation *** 
1078 

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

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

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

1081 
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

1082 
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

1083 
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

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

1085 

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

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

1087 
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

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

1089 

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

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

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

1092 

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

1095 

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

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

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

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

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

1104 
isatool document copies the Isabelle style files to the target 

1105 
location; 

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

1106 

11572  1107 

11633  1108 
*** Isar *** 
1109 

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

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

1113 
 'induct' method divinates rule instantiation from the inductive 

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

1115 
instantiation of cases; 

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

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

1118 
rules without further ado; 

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

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

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

1122 
statement becomes is included in the hypothesis, avoiding the 

1123 
slightly cumbersome show "PROP ?case" form; 

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

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

1126 
rules stemming from inductive sets to be applied in unstructured 

1127 
scripts, while still benefitting from proper handling of nonatomic 

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

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

1130 
 'induct' proper support for mutual induction involving nonatomic 

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

1132 
below); 

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

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

1135 
 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

1136 
 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

1137 
 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

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

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

1140 
 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

1141 

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

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

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

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

1145 
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

1146 
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

1147 
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

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

1149 

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

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

1151 

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

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

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

1154 

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

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

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

1161 
some examples; 

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

1162 

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

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

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

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

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

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

1168 

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

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

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

1173 
the context elements being discharged in the obvious way; 

1174 

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

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

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

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

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

1180 

11722  1181 
* Pure: renamed "antecedent" case to "rule_context"; 
1182 

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

1185 
use hardwired "Trueprop"; 

1186 

11738  1187 
* Pure: added 'corollary' command; 
1188 

11722  1189 
* Pure: fixed 'token_translation' command; 
1190 

11899  1191 
* Pure: removed obsolete 'exported' attribute; 
1192 

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

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

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

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

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

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

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

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

1202 

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

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

1204 
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

1205 
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

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

1207 

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

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

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

1210 

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

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

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

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

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

1215 

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

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

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

1218 

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

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

1220 
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

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

1222 

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

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

1224 
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

1225 
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

1226 

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

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

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

1229 
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

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

1231 
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

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

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

1234 

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

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

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

1237 

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

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

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

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

1241 

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

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

1243 

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

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

1249 

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

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

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

1252 

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

1253 

11474  1254 
*** HOL *** 
1255 

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

1258 

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

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

1261 

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

1263 
binary representation internally; 

1264 

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

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

1267 

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

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

1269 
are some hints on converting existing sources: 
11702  1270 

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

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

1273 
to be spaced properly; 

1274 

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

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

1277 

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

1279 

1280 
 remove all special provisions on numerals in proofs; 

1281 

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

12736  1285 
* HOL: symbolic syntax for x^2 (numeral 2); 
1286 

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

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

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

1289 
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

1290 
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

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

1292 

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

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

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

1297 
declared as simp by default; 

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

1298 
 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

1299 
qualified)  potential INCOMPATIBILITY; 
12280  1300 
 removed "make_scheme" operations (use "make" with "extend")  
1301 
INCOMPATIBILITY; 

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

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

1308 

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

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

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

1311 
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

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

1313 

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

13824  1316 
* HOL: consolidated and renamed several theories. In particular: 
14731  1317 
Ord.thy has been absorbed into HOL.thy 
1318 
String.thy has been absorbed into List.thy 

1319 

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

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

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

1322 

11657  1323 
* HOL: linorder_less_split superseded by linorder_cases; 
1324 

12917  1325 
* HOL/List: "nodups" renamed to "distinct"; 
12889  1326 

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

11437  1330 

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

1333 

1334 
delSWrapper "split_all_tac" 

1335 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

1336 

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

11474  1338 
MAY FAIL; 
11361  1339 

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

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

1343 
necessary to attach explicit type constraints; 

11307  1344 

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

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

12489  1348 

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

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

1350 
expressions; 
11474  1351 

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

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

1353 
of "lam"  INCOMPATIBILITY; 
11474  1354 

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

1357 
renamed "Product_Type.unit"; 

11611  1358 

12564  1359 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
1360 

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

1363 

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

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

1366 

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

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

1368 
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

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

1370 

12734  1371 
* HOLReal: added Complex_Numbers (by Gertrud Bauer); 
1372 

12690  1373 
* HOLHyperreal is now a logic image; 
1374 

11611  1375 

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

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

1377 

12622  1378 
* Isar: consts/constdefs supports mixfix syntax for continuous 
1379 
operations; 

1380 

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

1382 
HOLCF/ex/Dnat.thy; 

1383 

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

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

1387 

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

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

1389 

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

1390 

11474  1391 
*** ZF *** 
1392 

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

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

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

1397 

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

1399 
your theory on Main_ZFC; 

1400 

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

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

12563  1403 

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

1406 

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

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

1409 

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

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

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

1413 

13025  1414 
* ZF: many new theorems about lists, ordinals, etc.; 