author  wenzelm 
Thu, 15 Sep 2005 20:27:48 +0200  
changeset 17425  67c84a7d29f7 
parent 17423  de6b33a4efda 
child 17436  4e603046e539 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

17398  4 
New in Isabelle2005 (September 2005) 
5 
 

14655
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 

17371  22 
nonIsar theories now, but these will disappear soon. 
15130  23 

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

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

17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

27 
* Command 'find_theorems' searches for a list of criteria instead of a 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

28 
list of constants. Known criteria are: intro, elim, dest, name:string, 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

29 
simp:term, and any term. Criteria can be preceded by '' to select 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

30 
theorems that do not match. Intro, elim, dest select theorems that 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

31 
match the current goal, name:s selects theorems whose fully qualified 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

32 
name contain s, and simp:term selects all simplification rules whose 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

33 
lhs match term. Any other term is interpreted as pattern and selects 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

34 
all theorems matching the pattern. Available in ProofGeneral under 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

35 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  36 

17275
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

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

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

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

41 
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

42 

17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

43 
* Command 'thms_containing' has been discontinued in favour of 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

44 
'find_theorems'; INCOMPATIBILITY. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

45 

17385  46 
* Communication with Proof General is now 8bit clean, which means that 
47 
Unicode text in UTF8 encoding may be used within theory texts (both 

17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

48 
formal and informal parts). Cf. option U of the Isabelle Proof 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

49 
General interface; HOL/ex/Hebrew.thy provides a simple example. 
17385  50 

17425  51 
* Improved efficiency of the Simplifier and, to a lesser degree, the 
52 
Classical Reasoner. Typical big applications run around 2 times 

53 
faster. 

54 

15703  55 

56 
*** Document preparation *** 

57 

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

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

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

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

63 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

64 

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

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

66 
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

67 
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

68 
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

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

70 
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

71 
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

72 
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

73 
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

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

75 

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

76 
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

77 
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

78 
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

79 
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

80 
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

81 
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

82 
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

83 
specified above. 
16234  84 

17402  85 
* Several new antiquotations: 
15979  86 

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

88 

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

90 

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

15979  93 

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

16234  95 
theorem applying a "style" to it 
96 

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

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

98 

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

17393  101 
conclusion of a metalogical statement theorem, and 'prem1' .. 'prem19' 
16234  102 
to print the specified premise. TermStyle.add_style provides an ML 
103 
interface for introducing further styles. See also the "LaTeX Sugar" 

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

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

105 
typechecked ML expressions verbatim. 
16234  106 

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

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

108 
and 'text' support optional locale specification '(in loc)', which 
17269  109 
specifies the default context for interpreting antiquotations. For 
110 
example: 'text (in lattice) {* @{thm inf_assoc}*}'. 

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

111 

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

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

113 
context interpreting the subsequent argument. For example: @{thm 
17269  114 
[locale=lattice] inf_assoc}. 
17259
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

115 

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

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

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

118 

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

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

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

121 

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

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

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

124 

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

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

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

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

128 

16234  129 

130 
*** Pure *** 

131 

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

133 
automatic typeinference of declared constants; additional support for 

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

135 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

136 
sequential dependencies of definitions within a single 'constdefs' 

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

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

139 

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

141 
indexed syntax provides a notational device for subscripted 

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

143 
expressions. Secondly, in a local context with structure 

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

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

146 
show_structs controls printing of implicit structures. Typical 

147 
applications of these concepts involve record types and locales. 

148 

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

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

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

152 

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

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

155 
parsing/printing, see also isarref manual. 

156 

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

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

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

161 
INCOMPATIBILITY. 

162 

17275
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

163 
* axclass: name space prefix for class "c" is now "c_class" (was "c" 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

164 
before); "cI" is no longer bound, use "c.intro" instead. 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

165 
INCOMPATIBILITY. This change avoids clashes of fact bindings for 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

166 
axclasses vs. locales. 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

167 

16234  168 
* Improved internal renaming of symbolic identifiers  attach primes 
169 
instead of base 26 numbers. 

170 

171 
* New flag show_question_marks controls printing of leading question 

172 
marks in schematic variable names. 

173 

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

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

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

177 

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

179 
by simp 

180 

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

182 

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

184 
annotations as "(00...)". 

185 

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

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

188 
Before that distinction was only partially implemented via type class 

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

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

191 
exotic syntax specifications may require further adaption 

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

193 

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

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

196 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

197 
specifications. 

198 

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

201 

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

204 
Limit. 

205 

206 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

212 
allow for use in a context of fixed variables. 

213 

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

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

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

217 

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

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

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

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

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

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

224 

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

226 
selections of theorems in named facts via index ranges. 

227 

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

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

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

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

231 

17397  232 
* 'hide': option '(open)' hides only base names. 
233 

17275
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

234 
* More efficient treatment of intermediate checkpoints in interactive 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

235 
theory development. 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

236 

16234  237 

238 
*** Locales *** 

17095  239 

17385  240 
* New commands for the interpretation of locale expressions in 
241 
theories (1), locales (2) and proof contexts (3). These generate 

242 
proof obligations from the expression specification. After the 

243 
obligations have been discharged, theorems of the expression are added 

244 
to the theory, target locale or proof context. The synopsis of the 

245 
commands is a follows: 

246 

17095  247 
(1) interpretation expr inst 
248 
(2) interpretation target < expr 

249 
(3) interpret expr inst 

17385  250 

17095  251 
Interpretation in theories and proof contexts require a parameter 
252 
instantiation of terms from the current context. This is applied to 

17385  253 
specifications and theorems of the interpreted expression. 
254 
Interpretation in locales only permits parameter renaming through the 

255 
locale expression. Interpretation is smart in that interpretations 

256 
that are active already do not occur in proof obligations, neither are 

257 
instantiated theorems stored in duplicate. Use 'print_interps' to 

258 
inspect active interpretations of a particular locale. For details, 

259 
see the Isar Reference manual. 

16234  260 

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

262 
'interpret' instead. 

263 

17385  264 
* New context element 'constrains' for adding type constraints to 
265 
parameters. 

266 

267 
* Context expressions: renaming of parameters with syntax 

268 
redeclaration. 

17095  269 

270 
* Locale declaration: 'includes' disallowed. 

271 

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

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

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

276 
to attribute arguments as expected. 

277 

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

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

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

281 
Attribute implementations need to cooperate properly with the static 

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

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

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

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

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

287 
values to argument tokens explicitly. 

288 

289 
* Changed parameter management in theorem generation for long goal 

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

291 
theorem statement in rare situations. 

292 

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

295 

16234  296 

297 
*** Provers *** 

298 

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

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

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

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

303 
still available as 'simplesubst'. 

304 

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

306 
and quasi orders. 

307 

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

309 
reflexivetransitive closure of relations. 

310 

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

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

313 

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

315 
is peformed already. Objectlogics merely need to finish their 

316 
initial simpset configuration as before. INCOMPATIBILITY. 

15703  317 

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

318 

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

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

320 

16234  321 
* Symbolic syntax of Hilbert Choice Operator is now as follows: 
14878  322 

323 
syntax (epsilon) 

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

325 

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

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

329 
becomes available as variable, constant etc. INCOMPATIBILITY, 

330 

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

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

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

334 
support corresponding Isar calculations. 
16234  335 

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

337 
instead of ":". 

338 

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

340 

341 
Old New 

342 
{..n(} {..<n} 

343 
{)n..} {n<..} 

344 
{m..n(} {m..<n} 

345 
{)m..n} {m<..n} 

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

347 

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

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

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

15046  351 

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

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

354 

17389
b4743198b939
Method comm_ring for proving equalities in commutative rings.
wenzelm
parents:
17385
diff
changeset

355 
* Method comm_ring for proving equalities in commutative rings. 
b4743198b939
Method comm_ring for proving equalities in commutative rings.
wenzelm
parents:
17385
diff
changeset

356 

b4743198b939
Method comm_ring for proving equalities in commutative rings.
wenzelm
parents:
17385
diff
changeset

357 
* Theory Finite_Set: changed the syntax for 'setsum', summation over 
16234  358 
finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is 
17371  359 
now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can 
17189  360 
be a tuple pattern. 
16234  361 

362 
Some new syntax forms are available: 

363 

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

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

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

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

368 

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

370 
function "Summation", which has been discontinued. 

371 

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

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

374 
(insert F x)'. 

375 

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

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

378 
typedefs, inductive datatypes and recursion. 

379 

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

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

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

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

384 
in unstructured proof scripts. 

385 

386 
* Reworked implementation of records. Improved scalability for 

387 
records with many fields, avoiding performance problems for type 

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

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

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

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

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

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

394 
<record_name>_ext_type. 

395 

396 
Flag record_quick_and_dirty_sensitive can be enabled to skip the 

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

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

399 
quite long. 

400 

401 
New simproc record_upd_simproc for simplification of multiple record 

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

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

404 
occasionally, since simplification is more powerful by default. 

405 

17275
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

406 
* typedef: proper support for polymorphic sets, which contain extra 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

407 
typevariables in the term. 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

408 

16234  409 
* Simplifier: automatically reasons about transitivity chains 
410 
involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics 

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

412 
old proofs break occasionally as simplification may now solve more 

413 
goals than previously. 

414 

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

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

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

418 
just like y <= x. 

419 

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

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

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

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

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

425 
enabled/disabled by the reference use_let_simproc. Potential 

426 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  427 

16563  428 
* Classical reasoning: the meson method now accepts theorems as arguments. 
429 

16891  430 
* Theory OrderedGroup and Ring_and_Field: various additions and 
431 
improvements to faciliate calculations involving equalities and 

432 
inequalities. 

433 

434 
The following theorems have been eliminated or modified 

435 
(INCOMPATIBILITY): 

16888  436 

437 
abs_eq now named abs_of_nonneg 

17371  438 
abs_of_ge_0 now named abs_of_nonneg 
439 
abs_minus_eq now named abs_of_nonpos 

16888  440 
imp_abs_id now named abs_of_nonneg 
441 
imp_abs_neg_id now named abs_of_nonpos 

442 
mult_pos now named mult_pos_pos 

443 
mult_pos_le now named mult_nonneg_nonneg 

444 
mult_pos_neg_le now named mult_nonneg_nonpos 

445 
mult_pos_neg2_le now named mult_nonneg_nonpos2 

446 
mult_neg now named mult_neg_neg 

447 
mult_neg_le now named mult_nonpos_nonpos 

448 

16891  449 
* Theory Parity: added rules for simplifying exponents. 
450 

17092  451 
* Theory List: 
452 

453 
The following theorems have been eliminated or modified 

454 
(INCOMPATIBILITY): 

455 

456 
list_all_Nil now named list_all.simps(1) 

457 
list_all_Cons now named list_all.simps(2) 

458 
list_all_conv now named list_all_iff 

459 
set_mem_eq now named mem_iff 

460 

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

463 

16888  464 

465 
*** HOLComplex *** 

466 

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

469 

470 
The following theorems have been eliminated or modified 

471 
(INCOMPATIBILITY): 

472 

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

473 
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

474 
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

475 
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

476 
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

477 
real_of_int_mult reversed direction of equality (use [symmetric]) 
16891  478 

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

16888  480 

16962  481 
* Theory Ln is new, with properties of the natural logarithm 
482 

17423  483 
* Hyperreal: There is a new type constructor "star" for making 
484 
nonstandard types. The old type names are now type synonyms: 

485 

486 
hypreal = real star 

487 
hypnat = nat star 

488 
hcomplex = complex star 

489 

490 
* Hyperreal: Many groups of similarlydefined constants have been 

491 
replaced by polymorphic versions: 

492 

493 
star_of < hypreal_of_real, hypnat_of_nat, hcomplex_of_complex 

494 

495 
starset < starsetNat, starsetC 

496 
*s* < *sNat*, *sc* 

497 
starset_n < starsetNat_n, starsetC_n 

498 
*sn* < *sNatn*, *scn* 

499 
InternalSets < InternalNatSets, InternalCSets 

500 

501 
starfun < starfunNat, starfunNat2, starfunC, starfunRC, starfunCR 

502 
*f* < *fNat*, *fNat2*, *fc*, *fRc*, *fcR* 

503 
starfun_n < starfunNat_n, starfunNat2_n, starfunC_n, starfunRC_n, starfunCR_n 

504 
*fn* < *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn* 

505 
InternalFuns < InternalNatFuns, InternalNatFuns2, InternalCFuns, InternalRCFuns, InternalCRFuns 

506 

507 
* Hyperreal: Many typespecific theorems have been removed in favor of 

508 
theorems specific to various axiomatic type classes: 

509 

510 
add_commute < hypreal_add_commute, hypnat_add_commute, hcomplex_add_commute 

511 
add_assoc < hypreal_add_assoc, hypnat_add_assoc, hcomplex_add_assoc 

512 
OrderedGroup.add_0 < hypreal_add_zero_left, hypnat_add_zero_left, hcomplex_add_zero_left 

513 
OrderedGroup.add_0_right < hypreal_add_zero_right, hcomplex_add_zero_right 

514 
right_minus < hypreal_add_minus 

515 
left_minus < hypreal_add_minus_left, hcomplex_add_minus_left 

516 
mult_commute < hypreal_mult_commute, hypnat_mult_commute, hcomplex_mult_commute 

517 
mult_assoc < hypreal_mult_assoc, hypnat_mult_assoc, hcomplex_mult_assoc 

518 
mult_1_left < hypreal_mult_1, hypnat_mult_1, hcomplex_mult_one_left 

519 
mult_1_right < hcomplex_mult_one_right 

520 
mult_zero_left < hcomplex_mult_zero_left 

521 
left_distrib < hypreal_add_mult_distrib, hypnat_add_mult_distrib, hcomplex_add_mult_distrib 

522 
right_distrib < hypnat_add_mult_distrib2 

523 
zero_neq_one < hypreal_zero_not_eq_one, hypnat_zero_not_eq_one, hcomplex_zero_not_eq_one 

524 
right_inverse < hypreal_mult_inverse 

525 
left_inverse < hypreal_mult_inverse_left, hcomplex_mult_inv_left 

526 
order_refl < hypreal_le_refl, hypnat_le_refl 

527 
order_trans < hypreal_le_trans, hypnat_le_trans 

528 
order_antisym < hypreal_le_anti_sym, hypnat_le_anti_sym 

529 
order_less_le < hypreal_less_le, hypnat_less_le 

530 
linorder_linear < hypreal_le_linear, hypnat_le_linear 

531 
add_left_mono < hypreal_add_left_mono, hypnat_add_left_mono 

532 
mult_strict_left_mono < hypreal_mult_less_mono2, hypnat_mult_less_mono2 

533 
add_nonneg_nonneg < hypreal_le_add_order 

534 

535 
* Hyperreal: Separate theorems having to do with typespecific 

536 
versions of constants have been merged into theorems that apply to the 

537 
new polymorphic constants: 

538 

539 
STAR_UNIV_set < STAR_real_set, NatStar_real_set, STARC_complex_set 

540 
STAR_empty_set < NatStar_empty_set, STARC_empty_set 

541 
STAR_Un < NatStar_Un, STARC_Un 

542 
STAR_Int < NatStar_Int, STARC_Int 

543 
STAR_Compl < NatStar_Compl, STARC_Compl 

544 
STAR_subset < NatStar_subset, STARC_subset 

545 
STAR_mem < NatStar_mem, STARC_mem 

546 
STAR_mem_Compl < STARC_mem_Compl 

547 
STAR_diff < STARC_diff 

548 
STAR_star_of_image_subset < STAR_hypreal_of_real_image_subset, NatStar_hypreal_of_real_image_subset, STARC_hcomplex_of_complex_image_subset 

549 
starset_n_Un < starsetNat_n_Un, starsetC_n_Un 

550 
starset_n_Int < starsetNat_n_Int, starsetC_n_Int 

551 
starset_n_Compl < starsetNat_n_Compl, starsetC_n_Compl 

552 
starset_n_diff < starsetNat_n_diff, starsetC_n_diff 

553 
InternalSets_Un < InternalNatSets_Un, InternalCSets_Un 

554 
InternalSets_Int < InternalNatSets_Int, InternalCSets_Int 

555 
InternalSets_Compl < InternalNatSets_Compl, InternalCSets_Compl 

556 
InternalSets_diff < InternalNatSets_diff, InternalCSets_diff 

557 
InternalSets_UNIV_diff < InternalNatSets_UNIV_diff, InternalCSets_UNIV_diff 

558 
InternalSets_starset_n < InternalNatSets_starsetNat_n, InternalCSets_starsetC_n 

559 
starset_starset_n_eq < starsetNat_starsetNat_n_eq, starsetC_starsetC_n_eq 

560 
starset_n_starset < starsetNat_n_starsetNat, starsetC_n_starsetC 

561 
starfun_n_starfun < starfunNat_n_starfunNat, starfunNat2_n_starfunNat2, starfunC_n_starfunC, starfunRC_n_starfunRC, starfunCR_n_starfunCR 

562 
starfun < starfunNat, starfunNat2, starfunC, starfunRC, starfunCR 

563 
starfun_mult < starfunNat_mult, starfunNat2_mult, starfunC_mult, starfunRC_mult, starfunCR_mult 

564 
starfun_add < starfunNat_add, starfunNat2_add, starfunC_add, starfunRC_add, starfunCR_add 

565 
starfun_minus < starfunNat_minus, starfunNat2_minus, starfunC_minus, starfunRC_minus, starfunCR_minus 

566 
starfun_diff < starfunC_diff, starfunRC_diff, starfunCR_diff 

567 
starfun_o < starfunNatNat2_o, starfunNat2_o, starfun_stafunNat_o, starfunC_o, starfunC_starfunRC_o, starfun_starfunCR_o 

568 
starfun_o2 < starfunNatNat2_o2, starfun_stafunNat_o2, starfunC_o2, starfunC_starfunRC_o2, starfun_starfunCR_o2 

569 
starfun_const_fun < starfunNat_const_fun, starfunNat2_const_fun, starfunC_const_fun, starfunRC_const_fun, starfunCR_const_fun 

570 
starfun_inverse < starfunNat_inverse, starfunC_inverse, starfunRC_inverse, starfunCR_inverse 

571 
starfun_eq < starfunNat_eq, starfunNat2_eq, starfunC_eq, starfunRC_eq, starfunCR_eq 

572 
starfun_eq_iff < starfunC_eq_iff, starfunRC_eq_iff, starfunCR_eq_iff 

573 
starfun_Id < starfunC_Id 

574 
starfun_approx < starfunNat_approx, starfunCR_approx 

575 
starfun_capprox < starfunC_capprox, starfunRC_capprox 

576 
starfun_abs < starfunNat_rabs 

577 
starfun_lambda_cancel < starfunC_lambda_cancel, starfunCR_lambda_cancel, starfunRC_lambda_cancel 

578 
starfun_lambda_cancel2 < starfunC_lambda_cancel2, starfunCR_lambda_cancel2, starfunRC_lambda_cancel2 

579 
starfun_mult_HFinite_approx < starfunCR_mult_HFinite_capprox 

580 
starfun_mult_CFinite_capprox < starfunC_mult_CFinite_capprox, starfunRC_mult_CFinite_capprox 

581 
starfun_add_capprox < starfunC_add_capprox, starfunRC_add_capprox 

582 
starfun_add_approx < starfunCR_add_approx 

583 
starfun_inverse_inverse < starfunC_inverse_inverse 

584 
starfun_divide < starfunC_divide, starfunCR_divide, starfunRC_divide 

585 
starfun_n_congruent < starfunNat_n_congruent, starfunC_n_congruent 

586 
starfun_n < starfunNat_n, starfunC_n 

587 
starfun_n_mult < starfunNat_n_mult, starfunC_n_mult 

588 
starfun_n_add < starfunNat_n_add, starfunC_n_add 

589 
starfun_n_add_minus < starfunNat_n_add_minus 

590 
starfun_n_const_fun < starfunNat_n_const_fun, starfunC_n_const_fun 

591 
starfun_n_minus < starfunNat_n_minus, starfunC_n_minus 

592 
starfun_n_eq < starfunNat_n_eq, starfunC_n_eq 

593 

594 
star_n_add < hypreal_add, hypnat_add, hcomplex_add 

595 
star_n_minus < hypreal_minus, hcomplex_minus 

596 
star_n_diff < hypreal_diff, hcomplex_diff 

597 
star_n_mult < hypreal_mult, hcomplex_mult 

598 
star_n_inverse < hypreal_inverse, hcomplex_inverse 

599 
star_n_le < hypreal_le, hypnat_le 

600 
star_n_less < hypreal_less, hypnat_less 

601 
star_n_zero_num < hypreal_zero_num, hypnat_zero_num, hcomplex_zero_num 

602 
star_n_one_num < hypreal_one_num, hypnat_one_num, hcomplex_one_num 

603 
star_n_abs < hypreal_hrabs 

604 
star_n_divide < hcomplex_divide 

605 

606 
star_of_add < hypreal_of_real_add, hcomplex_of_complex_add 

607 
star_of_minus < hypreal_of_real_minus, hcomplex_of_complex_minus 

608 
star_of_diff < hypreal_of_real_diff 

609 
star_of_mult < hypreal_of_real_mult, hcomplex_of_complex_mult 

610 
star_of_one < hypreal_of_real_one, hcomplex_of_complex_one 

611 
star_of_zero < hypreal_of_real_zero, hcomplex_of_complex_zero 

612 
star_of_le < hypreal_of_real_le_iff 

613 
star_of_less < hypreal_of_real_less_iff 

614 
star_of_eq < hypreal_of_real_eq_iff, hcomplex_of_complex_eq_iff 

615 
star_of_inverse < hypreal_of_real_inverse, hcomplex_of_complex_inverse 

616 
star_of_divide < hypreal_of_real_divide, hcomplex_of_complex_divide 

617 
star_of_of_nat < hypreal_of_real_of_nat, hcomplex_of_complex_of_nat 

618 
star_of_of_int < hypreal_of_real_of_int, hcomplex_of_complex_of_int 

619 
star_of_number_of < hypreal_number_of, hcomplex_number_of 

620 
star_of_number_less < number_of_less_hypreal_of_real_iff 

621 
star_of_number_le < number_of_le_hypreal_of_real_iff 

622 
star_of_eq_number < hypreal_of_real_eq_number_of_iff 

623 
star_of_less_number < hypreal_of_real_less_number_of_iff 

624 
star_of_le_number < hypreal_of_real_le_number_of_iff 

625 
star_of_power < hypreal_of_real_power 

626 
star_of_eq_0 < hcomplex_of_complex_zero_iff 

627 

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

628 

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

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

630 

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

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

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

634 

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

635 

14885  636 
*** ZF *** 
637 

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

640 
of a homomorphism). 

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

641 

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

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

15703  645 

646 

647 
*** ML *** 

648 

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

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

653 
accordingly, while Option.map replaces apsome. 

15973  654 

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

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

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

657 
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

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

659 

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

660 
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

661 
toplevel, as they are variants of predefined functions. The following 
16234  662 
suggests how one can translate existing code: 
15973  663 

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

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

666 
last_elem xs = List.last xs 

667 
flat xss = List.concat xss 

16234  668 
seq fs = List.app fs 
15973  669 
partition P xs = List.partition P xs 
670 
mapfilter f xs = List.mapPartial f xs 

671 

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

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

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

674 

17371  675 
x > f f #> g 
676 
(x, y) > f f #> g 

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

677 

17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

678 
* Pure/library.ML: natural list combinators fold, fold_rev, and 
16869  679 
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

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

681 

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

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

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

684 

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

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

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

687 

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

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

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

690 

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

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

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

693 

17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

694 
* Pure/library.ML: the following selectors on type 'a option are 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

695 
available: 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

696 

551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

697 
the: 'a option > 'a (*partial*) 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

698 
these: 'a option > 'a where 'a = 'b list 
17402  699 
the_default: 'a > 'a option > 'a 
700 
the_list: 'a option > 'a list 

701 

17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

702 
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

703 
basic operations for association lists, following natural argument 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

704 
order. The old functions may be expressed as follows: 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

705 

551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

706 
assoc = uncurry (AList.lookup (op =)) 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

707 
assocs = these oo AList.lookup (op =) 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

708 
overwrite = uncurry (AList.update (op =)) o swap 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

709 

551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

710 
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

711 
basic operations for association lists, following natural argument 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

712 
order; moreover the explicit equality predicate passed here avoids 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

713 
potentially expensive polymorphic runtime equality checks. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

714 

551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

715 
* Pure/General: structure OrdList (cf. Pure/General/ord_list.ML) 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

716 
provides a reasonably efficient lightweight implementation of sets as 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

717 
lists. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

718 

551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

719 
* Pure/General: generic tables (cf. Pure/General/table.ML) provide a 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

720 
few new operations; existing lookup and update are now curried to 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

721 
follow natural argument order (for use with fold etc.); 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

722 
INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

723 

551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

724 
* Pure/General: output via the Isabelle channels of 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

725 
writeln/warning/error etc. is now passed through Output.output, with a 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

726 
hook for arbitrary transformations depending on the print_mode 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

727 
(cf. Output.add_mode  the first active mode that provides a output 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

728 
function wins). Already formatted output may be embedded into further 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

729 
text via Output.raw; the result of Pretty.string_of/str_of and derived 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

730 
functions (string_of_term/cterm/thm etc.) is already marked raw to 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

731 
accommodate easy composition of diagnostic messages etc. Programmers 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

732 
rarely need to care about Output.output or Output.raw at all, with 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

733 
some notable exceptions: Output.output is required when bypassing the 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

734 
standard channels (writeln etc.), or in token translations to produce 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

735 
properly formatted results; Output.raw is required when capturing 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

736 
already output material that will eventually be presented to the user 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

737 
a second time. For the default print mode, both Output.output and 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

738 
Output.raw have no effect. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

739 

551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

740 
* Pure/General: Output.time_accumulator NAME creates an operator ('a 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

741 
> 'b) > 'a > 'b to measure runtime and count invocations; the 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

742 
cumulative results are displayed at the end of a batch session. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

743 

551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

744 
* Pure/General: File.sysify_path and File.quote_sysify path have been 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

745 
replaced by File.platform_path and File.shell_path (with appropriate 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

746 
hooks). This provides a clean interface for unusual systems where the 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

747 
internal and external process view of file names are different. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

748 

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

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

750 
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

751 
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

752 
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

753 
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

754 
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

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

756 

17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

757 
* Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types, 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

758 
fold_types traverse types/terms from left to right, observing natural 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

759 
argument order. Supercedes previous foldl_XXX versions, add_frees, 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

760 
add_vars etc. have been adapted as well: INCOMPATIBILITY. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

761 

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

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

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

767 
name; NameSpace.extend is superceded by context dependent 

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

769 
the naming context. Especially note Theory.restore_naming and 

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

771 
Theory.add_path is no longer sufficient to recover from 

772 
Theory.absolute_path in particular. 

773 

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

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

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

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

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

779 
with earlier declarations. 

16151  780 

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

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

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

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

784 

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

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

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

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

788 
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

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

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

791 

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

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

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

794 

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

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

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

797 

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

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

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

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

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

802 

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

803 
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

804 
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

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

806 

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

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

808 

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

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

810 
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

811 
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

812 
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

813 

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

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

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

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

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

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

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

820 
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

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

822 

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

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

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

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

826 

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

16151  830 

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

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

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

833 

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

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

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

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

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

838 

16718  839 
* Pure: print_tac now outputs the goal through the trace channel. 
840 

17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

841 
* Isar toplevel: improved diagnostics, mostly for Poly/ML only. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

842 
Reference Toplevel.debug (default false) controls detailed printing 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

843 
and tracing of lowlevel exceptions; Toplevel.profiling (default 0) 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

844 
controls execution profiling  set to 1 for time and 2 for space 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

845 
(both increase the runtime). 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

846 

551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

847 
* Isar session: The initial use of ROOT.ML is now always timed, 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

848 
i.e. the log will show the actual process times, in contrast to the 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

849 
elapsed wallclock time that the outer shell wrapper produces. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

850 

551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

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

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

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

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

855 

17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

856 
* Provers: Simplifier and Classical Reasoner now support proof context 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

857 
dependent plugins (simprocs, solvers, wrappers etc.). These extra 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

858 
components are stored in the theory and patched into the 
16234  859 
simpset/claset when used in an Isar proof context. Context dependent 
860 
components are maintained by the following theory operations: 

861 

862 
Simplifier.add_context_simprocs 

863 
Simplifier.del_context_simprocs 

864 
Simplifier.set_context_subgoaler 

865 
Simplifier.reset_context_subgoaler 

866 
Simplifier.add_context_looper 

867 
Simplifier.del_context_looper 

868 
Simplifier.add_context_unsafe_solver 

869 
Simplifier.add_context_safe_solver 

870 

871 
Classical.add_context_safe_wrapper 

872 
Classical.del_context_safe_wrapper 

873 
Classical.add_context_unsafe_wrapper 

874 
Classical.del_context_unsafe_wrapper 

875 

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

877 
local_simpset_of and local_claset_of to instead of the primitive 

878 
Simplifier.get_local_simpset and Classical.get_local_claset, 

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

880 

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

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

884 
scripts for the time being. 

885 

16234  886 

887 
*** System *** 

888 

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

890 
isabelle, isatool etc.). 

891 

892 
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for 

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

894 

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

896 
used by Isabelle; default is ROOT.ML. 

897 

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

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

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

900 

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

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

15703  904 

905 

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

906 

14606  907 
New in Isabelle2004 (April 2004) 
908 
 

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

909 

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

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

911 

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

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

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

914 

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

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

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

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

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

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

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

924 
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

925 

14237  926 
* Pure: Macintosh and Windows linebreaks are now allowed in theory files. 
927 

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

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

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

14233  932 

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

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

14333  937 

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

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

941 

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

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

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

14224  946 
rather than definitionally, such as the metalogic connectives. 
947 

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

950 

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

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

955 

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

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

957 

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

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

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

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

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

962 
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

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

964 
 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

965 
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

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

967 

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

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

969 
 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

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

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

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

973 

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

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

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

976 
and derived forms. 
14283  977 

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

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

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

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

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

982 
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

983 
 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

984 
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

985 
 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

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

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

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

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

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

994 
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

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

998 
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

999 

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

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

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

1002 

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

1003 

14136  1004 
*** HOL *** 
1005 

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

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

1009 
can be used like any other Isabelle image. See 

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

1011 

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

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

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

1014 
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

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

1016 
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

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

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

1019 
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

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

1021 

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

1025 
* Numerics: 

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

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

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

14389  1033 

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

14255  1036 
* Records: 
1037 
 Record types are now by default printed with their type abbreviation 

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

1039 
the reference "print_record_type_abbr". 

14731  1040 
 Simproc "record_upd_simproc" for simplification of multiple updates added 
14255  1041 
(not enabled by default). 
14427  1042 
 Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp. 
1043 
EX x. x = sel r to True (not enabled by default). 

14255  1044 
 Tactic "record_split_simp_tac" to split and simplify records added. 
14731  1045 

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

14136  1049 

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

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

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

1053 

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

14731  1057 
* HOLMatrix: a first theory for matrices in HOL with an application of 
14610  1058 
matrix theory to linear programming. 
14136  1059 

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

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

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

14380  1065 

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

14418  1069 
like in normal math, and corresponding versions for < and for intersection. 
1070 

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

1073 

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

14380  1076 

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

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

1080 

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

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

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

1085 
for examples. 

14464  1086 

14606  1087 

14536  1088 
*** HOLCF *** 
1089 

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

1091 

14572  1092 

1093 

14136  1094 
New in Isabelle2003 (May 2003) 
14606  1095 
 
14136  1096 

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

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

1098 

13618  1099 
* Provers/simplifier: 
1100 

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

1104 
the order of assumptions. 

1105 

1106 
Potential INCOMPATIBILITY: 

1107 

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

13618  1110 

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

1112 

13781  1113 
now gives rise to the infinite reduction sequence 
1114 

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

1116 

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

1118 
kind of problem. 

1119 

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

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

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

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

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

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

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

13618  1127 

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

1129 

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

1132 
conditions before applying the rewrite rule): 

1133 
ML "simp_depth_limit := n" 

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

1135 
the simplifier would diverge. 

1136 

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

1137 
 Accepts free variables as head terms in congruence rules. Useful in Isar. 
13829  1138 

13938  1139 
 No longer aborts on failed congruence proof. Instead, the 
1140 
congruence is ignored. 

1141 

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

1144 
as HOL/Extraction for some case studies. 

1145 

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

1148 
PG menu: Isabelle/Isar > Settings > Show Main Goal 
13815  1149 
(ML: Proof.show_main_goal). 
1150 

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

1152 
rules whose conclusion matches subgoal 1: 

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

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

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

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

1157 
(ML: ProofGeneral.print_intros()) 

1158 

1159 
* Pure: New flag trace_unify_fail causes unification to print 

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

1162 
assumption failed. 

1163 

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

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

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

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

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

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

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

1171 

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

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

1173 
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

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

1175 

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

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

1177 
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

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

1181 
be given (the default is 40); 

1182 

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

1184 
(batchmode only); 

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

1185 

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

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

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

1188 
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

1189 

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

1192 
for slight decrease in efficiency; 

1193 

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

1196 

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

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

1198 
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

1199 

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

1200 

13158  1201 
*** HOL *** 
1202 

13899  1203 
* arith(_tac) 
1204 

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

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

1207 
of quantifierfree linear arithmetic. 

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

1209 

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

1211 

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

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

14731  1214 
Presburger arithmetic can also be called explicitly via presburger(_tac). 
13899  1215 

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

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

1218 

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

1220 
are distributed over a sum of terms; 

1221 

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

14731  1224 
"<=", "<" and "="). 
1225 

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

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

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

1231 

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

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

1233 
Finite_Set); 
13492  1234 

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

1237 

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

1240 

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

1243 
of the empty set. 

1244 

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

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

1248 
Univariate Polynomials). Contributions welcome; 

13960  1249 

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

1251 

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

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

1255 

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

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

1257 

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

1259 
Fleuriot); 
13960  1260 

13549  1261 
* Real/HahnBanach: updated and adapted to locales; 
1262 

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

13872  1265 

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

1267 

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

1270 

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

1273 
classes, interfaces, objects,virtual methods, static methods, 

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

1275 
assignment, exceptions. 

13549  1276 

14011  1277 

13549  1278 
*** ZF *** 
1279 

15154  1280 
* ZF/Constructible: consistency proof for AC (Gdel's constructible 
13549  1281 
universe, etc.); 
1282 

13872  1283 
* Main ZF: virtually all theories converted to newstyle format; 
13518  1284 

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

1285 

13478  1286 
*** ML *** 
1287 

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

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

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

1291 

1292 
* Pure: improved error reporting of simprocs; 

1293 

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

1295 
up simprocs; 

1296 

1297 

13953  1298 
*** Document preparation *** 
1299 

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

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

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

1303 

14731  1304 
* minimized dependencies of isabelle.sty and isabellesym.sty on 
13953  1305 
other packages 
1306 

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

1308 
broke \Rightarrow) 

1309 

14731  1310 
* normal size for \<zero>...\<nine> (uses \mathbf instead of 
13954  1311 
textcomp package) 
13953  1312 

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

1313 

14572  1314 

12984  1315 
New in Isabelle2002 (March 2002) 
1316 
 

11474  1317 

11572  1318 
*** Document preparation *** 
1319 

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

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

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

1322 
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

1323 
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

1324 
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

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

1326 

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

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

1328 
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

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

1330 

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

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

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

1333 

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

1336 

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

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

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

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

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

1345 
isatool document copies the Isabelle style files to the target 

1346 
location; 

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

1347 

11572  1348 

11633  1349 
*** Isar *** 
1350 

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

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

1354 
 'induct' method divinates rule instantiation from the inductive 

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

1356 
instantiation of cases; 

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

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

1359 
rules without further ado; 

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

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

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

1363 
statement becomes is included in the hypothesis, avoiding the 

1364 
slightly cumbersome show "PROP ?case" form; 

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

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

1367 
rules stemming from inductive sets to be applied in unstructured 

1368 
scripts, while still benefitting from proper handling of nonatomic 

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

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

1371 
 'induct' proper support for mutual induction involving nonatomic 

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

1373 
below); 

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

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

1376 
 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

1377 
 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

1378 
 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

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

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

1381 
 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

1382 

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

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

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

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

1386 
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

1387 
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

1388 
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

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

1390 

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

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

1392 

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

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

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

1395 

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

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

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

1402 
some examples; 

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

1403 

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

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

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

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

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

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

1409 

12964
2ac9265b2cd5
tuned;
< 