author  wenzelm 
Fri, 07 Oct 2005 22:59:15 +0200  
changeset 17779  407bea05c2da 
parent 17754  58a306d9f736 
child 17780  274eaa114c6d 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

17754
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

4 
New in this Isabelle release 
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

5 
 
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

6 

58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

7 
*** General *** 
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

8 

58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

9 
* Command 'find_theorems': support "*" wildcard in "name:" criterion. 
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

10 

58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

11 

17779  12 
*** Pure *** 
13 

14 
* Input syntax now supports dummy variable binding "%_. b", where the 

15 
body does not mention the bound variable. Note that dummy patterns 

16 
implicitly depend on their context of bounds, which makes "{_. _}" 

17 
match any set comprehension as expected. 

18 

19 
* Removed obsolete syntactic constant _K and its associated parse 

20 
translation. INCOMPATIBILITY, use dummy abstraction instead, for 

21 
example "A > B" => "Pi A (%_. B)". 

22 

23 

17754
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

24 

17720  25 
New in Isabelle2005 (October 2005) 
26 
 

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

27 

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

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

29 

15130  30 
* Theory headers: the new header syntax for Isar theories is 
31 

32 
theory <name> 

16234  33 
imports <theory1> ... <theoryN> 
34 
uses <file1> ... <fileM> 

15130  35 
begin 
36 

16234  37 
where the 'uses' part is optional. The previous syntax 
38 

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

40 

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

17371  43 
nonIsar theories now, but these will disappear soon. 
15130  44 

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

45 
* Theory loader: parent theories can now also be referred to via 
16234  46 
relative and absolute paths. 
47 

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

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

49 
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

50 
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

51 
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

52 
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

53 
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

54 
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

55 
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

56 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  57 

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

58 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  59 

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

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

62 
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

63 

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

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

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

66 

17385  67 
* Communication with Proof General is now 8bit clean, which means that 
68 
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

69 
formal and informal parts). Cf. option U of the Isabelle Proof 
17538  70 
General interface. Here are some simple examples (cf. src/HOL/ex): 
71 

72 
http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html 

73 
http://isabelle.in.tum.de/library/HOL/ex/Chinese.html 

17385  74 

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

77 
faster. 

78 

15703  79 

80 
*** Document preparation *** 

81 

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

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

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

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

87 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

88 

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

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

90 
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

91 
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

92 
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

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

94 
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

95 
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

96 
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

97 
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

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

99 

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

100 
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

101 
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

102 
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

103 
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

104 
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

105 
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

106 
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

107 
specified above. 
16234  108 

17402  109 
* Several new antiquotations: 
15979  110 

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

112 

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

114 

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

15979  117 

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

16234  119 
theorem applying a "style" to it 
120 

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

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

122 

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

17393  125 
conclusion of a metalogical statement theorem, and 'prem1' .. 'prem19' 
16234  126 
to print the specified premise. TermStyle.add_style provides an ML 
127 
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

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

129 
typechecked ML expressions verbatim. 
16234  130 

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

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

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

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

135 

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

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

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

139 

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

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

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

142 

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

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

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

145 

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

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

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

148 

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

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

150 
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

151 
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

152 

16234  153 

154 
*** Pure *** 

155 

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

157 
automatic typeinference of declared constants; additional support for 

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

159 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

160 
sequential dependencies of definitions within a single 'constdefs' 

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

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

163 

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

165 
indexed syntax provides a notational device for subscripted 

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

167 
expressions. Secondly, in a local context with structure 

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

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

170 
show_structs controls printing of implicit structures. Typical 

171 
applications of these concepts involve record types and locales. 

172 

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

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

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

176 

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

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

179 
parsing/printing, see also isarref manual. 

180 

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

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

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

185 
INCOMPATIBILITY. 

186 

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

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

188 
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

189 
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

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

191 

16234  192 
* Improved internal renaming of symbolic identifiers  attach primes 
193 
instead of base 26 numbers. 

194 

195 
* New flag show_question_marks controls printing of leading question 

196 
marks in schematic variable names. 

197 

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

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

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

201 

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

203 
by simp 

204 

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

206 

17548  207 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  208 
annotations as "(00...)". 
209 

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

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

212 
Before that distinction was only partially implemented via type class 

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

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

215 
exotic syntax specifications may require further adaption 

17691  216 
(e.g. Cube/Cube.thy). 
16234  217 

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

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

220 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

221 
specifications. 

222 

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

225 

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

228 
Limit. 

229 

230 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

236 
allow for use in a context of fixed variables. 

237 

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

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

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

241 

17597  242 
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. 
17590  243 

16234  244 
* Reorganized bootstrapping of the Pure theories; CPure is now derived 
245 
from Pure, which contains all common declarations already. Both 

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

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

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

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

250 

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

252 
selections of theorems in named facts via index ranges. 

253 

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

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

255 
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

256 
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

257 

17397  258 
* 'hide': option '(open)' hides only base names. 
259 

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

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

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

262 

17663
28be54ff74f8
Added entries for code_module, code_library, and value.
berghofe
parents:
17641
diff
changeset

263 
* Code generator is now invoked via code_module (incremental code 
17664  264 
generation) and code_library (modular code generation, ML structures 
265 
for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains' 

266 
must be quoted when used as identifiers. 

267 

268 
* New 'value' command for reading, evaluating and printing terms using 

269 
the code generator. INCOMPATIBILITY: command keyword 'value' must be 

270 
quoted when used as identifier. 

17663
28be54ff74f8
Added entries for code_module, code_library, and value.
berghofe
parents:
17641
diff
changeset

271 

16234  272 

273 
*** Locales *** 

17095  274 

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

277 
proof obligations from the expression specification. After the 

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

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

280 
commands is a follows: 

281 

17095  282 
(1) interpretation expr inst 
283 
(2) interpretation target < expr 

284 
(3) interpret expr inst 

17385  285 

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

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

290 
locale expression. Interpretation is smart in that interpretations 

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

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

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

17436  294 
see the Isar Reference manual. Examples can be found in 
295 
HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy. 

16234  296 

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

298 
'interpret' instead. 

299 

17385  300 
* New context element 'constrains' for adding type constraints to 
301 
parameters. 

302 

303 
* Context expressions: renaming of parameters with syntax 

304 
redeclaration. 

17095  305 

306 
* Locale declaration: 'includes' disallowed. 

307 

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

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

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

312 
to attribute arguments as expected. 

313 

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

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

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

317 
Attribute implementations need to cooperate properly with the static 

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

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

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

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

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

323 
values to argument tokens explicitly. 

324 

325 
* Changed parameter management in theorem generation for long goal 

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

327 
theorem statement in rare situations. 

328 

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

331 

16234  332 

333 
*** Provers *** 

334 

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

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

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

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

339 
still available as 'simplesubst'. 

340 

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

342 
and quasi orders. 

343 

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

345 
reflexivetransitive closure of relations. 

346 

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

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

349 

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

351 
is peformed already. Objectlogics merely need to finish their 

352 
initial simpset configuration as before. INCOMPATIBILITY. 

15703  353 

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

354 

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

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

356 

16234  357 
* Symbolic syntax of Hilbert Choice Operator is now as follows: 
14878  358 

359 
syntax (epsilon) 

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

361 

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

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

365 
becomes available as variable, constant etc. INCOMPATIBILITY, 

366 

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

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

17371  369 
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

370 
support corresponding Isar calculations. 
16234  371 

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

373 
instead of ":". 

374 

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

376 

377 
Old New 

378 
{..n(} {..<n} 

379 
{)n..} {n<..} 

380 
{m..n(} {m..<n} 

381 
{)m..n} {m<..n} 

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

383 

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

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

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

15046  387 

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

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

390 

17533  391 
* Theory Commutative_Ring (in Library): method comm_ring for proving 
392 
equalities in commutative rings; method 'algebra' provides a generic 

393 
interface. 

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

394 

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

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

400 
Some new syntax forms are available: 

401 

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

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

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

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

406 

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

408 
function "Summation", which has been discontinued. 

409 

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

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

412 
(insert F x)'. 

413 

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

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

416 
typedefs, inductive datatypes and recursion. 

417 

17700  418 
* New tactics 'sat' and 'satx' to prove propositional tautologies. 
419 
Requires zChaff with proof generation to be installed. See 

420 
HOL/ex/SAT_Examples.thy for examples. 

17619  421 

16234  422 
* Datatype induction via method 'induct' now preserves the name of the 
423 
induction variable. For example, when proving P(xs::'a list) by 

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

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

426 
in unstructured proof scripts. 

427 

428 
* Reworked implementation of records. Improved scalability for 

429 
records with many fields, avoiding performance problems for type 

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

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

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

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

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

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

436 
<record_name>_ext_type. 

437 

438 
Flag record_quick_and_dirty_sensitive can be enabled to skip the 

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

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

441 
quite long. 

442 

443 
New simproc record_upd_simproc for simplification of multiple record 

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

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

446 
occasionally, since simplification is more powerful by default. 

447 

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

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

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

450 

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

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

454 
old proofs break occasionally as simplification may now solve more 

455 
goals than previously. 

456 

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

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

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

460 
just like y <= x. 

461 

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

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

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

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

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

467 
enabled/disabled by the reference use_let_simproc. Potential 

468 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  469 

16563  470 
* Classical reasoning: the meson method now accepts theorems as arguments. 
471 

17595  472 
* Prover support: prerelease of the IsabelleATP linkup, which runs background 
473 
jobs to provide advice on the provability of subgoals. 

474 

16891  475 
* Theory OrderedGroup and Ring_and_Field: various additions and 
476 
improvements to faciliate calculations involving equalities and 

477 
inequalities. 

478 

479 
The following theorems have been eliminated or modified 

480 
(INCOMPATIBILITY): 

16888  481 

482 
abs_eq now named abs_of_nonneg 

17371  483 
abs_of_ge_0 now named abs_of_nonneg 
484 
abs_minus_eq now named abs_of_nonpos 

16888  485 
imp_abs_id now named abs_of_nonneg 
486 
imp_abs_neg_id now named abs_of_nonpos 

487 
mult_pos now named mult_pos_pos 

488 
mult_pos_le now named mult_nonneg_nonneg 

489 
mult_pos_neg_le now named mult_nonneg_nonpos 

490 
mult_pos_neg2_le now named mult_nonneg_nonpos2 

491 
mult_neg now named mult_neg_neg 

492 
mult_neg_le now named mult_nonpos_nonpos 

493 

16891  494 
* Theory Parity: added rules for simplifying exponents. 
495 

17092  496 
* Theory List: 
497 

498 
The following theorems have been eliminated or modified 

499 
(INCOMPATIBILITY): 

500 

501 
list_all_Nil now named list_all.simps(1) 

502 
list_all_Cons now named list_all.simps(2) 

503 
list_all_conv now named list_all_iff 

504 
set_mem_eq now named mem_iff 

505 

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

508 

16888  509 

510 
*** HOLComplex *** 

511 

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

514 

515 
The following theorems have been eliminated or modified 

516 
(INCOMPATIBILITY): 

517 

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

518 
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

519 
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

520 
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

521 
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

522 
real_of_int_mult reversed direction of equality (use [symmetric]) 
16891  523 

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

16888  525 

16962  526 
* Theory Ln is new, with properties of the natural logarithm 
527 

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

530 

531 
hypreal = real star 

532 
hypnat = nat star 

533 
hcomplex = complex star 

534 

535 
* Hyperreal: Many groups of similarlydefined constants have been 

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

536 
replaced by polymorphic versions (INCOMPATIBILITY): 
17423  537 

538 
star_of < hypreal_of_real, hypnat_of_nat, hcomplex_of_complex 

539 

540 
starset < starsetNat, starsetC 

541 
*s* < *sNat*, *sc* 

542 
starset_n < starsetNat_n, starsetC_n 

543 
*sn* < *sNatn*, *scn* 

544 
InternalSets < InternalNatSets, InternalCSets 

545 

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

546 
starfun < starfun{Nat,Nat2,C,RC,CR} 
17423  547 
*f* < *fNat*, *fNat2*, *fc*, *fRc*, *fcR* 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

548 
starfun_n < starfun{Nat,Nat2,C,RC,CR}_n 
17423  549 
*fn* < *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn* 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

550 
InternalFuns < InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs 
17423  551 

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

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

553 
theorems specific to various axiomatic type classes (INCOMPATIBILITY): 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

554 

c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

555 
add_commute < {hypreal,hypnat,hcomplex}_add_commute 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

556 
add_assoc < {hypreal,hypnat,hcomplex}_add_assocs 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

557 
OrderedGroup.add_0 < {hypreal,hypnat,hcomplex}_add_zero_left 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

558 
OrderedGroup.add_0_right < {hypreal,hcomplex}_add_zero_right 
17423  559 
right_minus < hypreal_add_minus 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

560 
left_minus < {hypreal,hcomplex}_add_minus_left 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

561 
mult_commute < {hypreal,hypnat,hcomplex}_mult_commute 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

562 
mult_assoc < {hypreal,hypnat,hcomplex}_mult_assoc 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

563 
mult_1_left < {hypreal,hypnat}_mult_1, hcomplex_mult_one_left 
17423  564 
mult_1_right < hcomplex_mult_one_right 
565 
mult_zero_left < hcomplex_mult_zero_left 

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

566 
left_distrib < {hypreal,hypnat,hcomplex}_add_mult_distrib 
17423  567 
right_distrib < hypnat_add_mult_distrib2 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

568 
zero_neq_one < {hypreal,hypnat,hcomplex}_zero_not_eq_one 
17423  569 
right_inverse < hypreal_mult_inverse 
570 
left_inverse < hypreal_mult_inverse_left, hcomplex_mult_inv_left 

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

571 
order_refl < {hypreal,hypnat}_le_refl 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

572 
order_trans < {hypreal,hypnat}_le_trans 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

573 
order_antisym < {hypreal,hypnat}_le_anti_sym 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

574 
order_less_le < {hypreal,hypnat}_less_le 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

575 
linorder_linear < {hypreal,hypnat}_le_linear 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

576 
add_left_mono < {hypreal,hypnat}_add_left_mono 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

577 
mult_strict_left_mono < {hypreal,hypnat}_mult_less_mono2 
17423  578 
add_nonneg_nonneg < hypreal_le_add_order 
579 

580 
* Hyperreal: Separate theorems having to do with typespecific 

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

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

582 
new polymorphic constants (INCOMPATIBILITY): 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

583 

c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

584 
STAR_UNIV_set < {STAR_real,NatStar_real,STARC_complex}_set 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

585 
STAR_empty_set < {STAR,NatStar,STARC}_empty_set 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

586 
STAR_Un < {STAR,NatStar,STARC}_Un 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

587 
STAR_Int < {STAR,NatStar,STARC}_Int 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

588 
STAR_Compl < {STAR,NatStar,STARC}_Compl 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

589 
STAR_subset < {STAR,NatStar,STARC}_subset 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

590 
STAR_mem < {STAR,NatStar,STARC}_mem 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

591 
STAR_mem_Compl < {STAR,STARC}_mem_Compl 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

592 
STAR_diff < {STAR,STARC}_diff 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

593 
STAR_star_of_image_subset < {STAR_hypreal_of_real, NatStar_hypreal_of_real, 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

594 
STARC_hcomplex_of_complex}_image_subset 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

595 
starset_n_Un < starset{Nat,C}_n_Un 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

596 
starset_n_Int < starset{Nat,C}_n_Int 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

597 
starset_n_Compl < starset{Nat,C}_n_Compl 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

598 
starset_n_diff < starset{Nat,C}_n_diff 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

599 
InternalSets_Un < Internal{Nat,C}Sets_Un 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

600 
InternalSets_Int < Internal{Nat,C}Sets_Int 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

601 
InternalSets_Compl < Internal{Nat,C}Sets_Compl 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

602 
InternalSets_diff < Internal{Nat,C}Sets_diff 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

603 
InternalSets_UNIV_diff < Internal{Nat,C}Sets_UNIV_diff 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

604 
InternalSets_starset_n < Internal{Nat,C}Sets_starset{Nat,C}_n 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

605 
starset_starset_n_eq < starset{Nat,C}_starset{Nat,C}_n_eq 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

606 
starset_n_starset < starset{Nat,C}_n_starset{Nat,C} 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

607 
starfun_n_starfun < starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR} 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

608 
starfun < starfun{Nat,Nat2,C,RC,CR} 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

609 
starfun_mult < starfun{Nat,Nat2,C,RC,CR}_mult 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

610 
starfun_add < starfun{Nat,Nat2,C,RC,CR}_add 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

611 
starfun_minus < starfun{Nat,Nat2,C,RC,CR}_minus 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

612 
starfun_diff < starfun{C,RC,CR}_diff 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

613 
starfun_o < starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

614 
starfun_o2 < starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

615 
starfun_const_fun < starfun{Nat,Nat2,C,RC,CR}_const_fun 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

616 
starfun_inverse < starfun{Nat,C,RC,CR}_inverse 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

617 
starfun_eq < starfun{Nat,Nat2,C,RC,CR}_eq 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

618 
starfun_eq_iff < starfun{C,RC,CR}_eq_iff 
17423  619 
starfun_Id < starfunC_Id 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

620 
starfun_approx < starfun{Nat,CR}_approx 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

621 
starfun_capprox < starfun{C,RC}_capprox 
17423  622 
starfun_abs < starfunNat_rabs 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

623 
starfun_lambda_cancel < starfun{C,CR,RC}_lambda_cancel 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

624 
starfun_lambda_cancel2 < starfun{C,CR,RC}_lambda_cancel2 
17423  625 
starfun_mult_HFinite_approx < starfunCR_mult_HFinite_capprox 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

626 
starfun_mult_CFinite_capprox < starfun{C,RC}_mult_CFinite_capprox 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

627 
starfun_add_capprox < starfun{C,RC}_add_capprox 
17423  628 
starfun_add_approx < starfunCR_add_approx 
629 
starfun_inverse_inverse < starfunC_inverse_inverse 

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

630 
starfun_divide < starfun{C,CR,RC}_divide 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

631 
starfun_n < starfun{Nat,C}_n 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

632 
starfun_n_mult < starfun{Nat,C}_n_mult 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

633 
starfun_n_add < starfun{Nat,C}_n_add 
17423  634 
starfun_n_add_minus < starfunNat_n_add_minus 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

635 
starfun_n_const_fun < starfun{Nat,C}_n_const_fun 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

636 
starfun_n_minus < starfun{Nat,C}_n_minus 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

637 
starfun_n_eq < starfun{Nat,C}_n_eq 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

638 

c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

639 
star_n_add < {hypreal,hypnat,hcomplex}_add 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

640 
star_n_minus < {hypreal,hcomplex}_minus 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

641 
star_n_diff < {hypreal,hcomplex}_diff 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

642 
star_n_mult < {hypreal,hcomplex}_mult 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

643 
star_n_inverse < {hypreal,hcomplex}_inverse 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

644 
star_n_le < {hypreal,hypnat}_le 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

645 
star_n_less < {hypreal,hypnat}_less 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

646 
star_n_zero_num < {hypreal,hypnat,hcomplex}_zero_num 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

647 
star_n_one_num < {hypreal,hypnat,hcomplex}_one_num 
17423  648 
star_n_abs < hypreal_hrabs 
649 
star_n_divide < hcomplex_divide 

650 

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

651 
star_of_add < {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

652 
star_of_minus < {hypreal_of_real,hcomplex_of_complex}_minus 
17423  653 
star_of_diff < hypreal_of_real_diff 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

654 
star_of_mult < {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

655 
star_of_one < {hypreal_of_real,hcomplex_of_complex}_one 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

656 
star_of_zero < {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

657 
star_of_le < {hypreal_of_real,hypnat_of_nat}_le_iff 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

658 
star_of_less < {hypreal_of_real,hypnat_of_nat}_less_iff 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

659 
star_of_eq < {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

660 
star_of_inverse < {hypreal_of_real,hcomplex_of_complex}_inverse 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

661 
star_of_divide < {hypreal_of_real,hcomplex_of_complex}_divide 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

662 
star_of_of_nat < {hypreal_of_real,hcomplex_of_complex}_of_nat 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

663 
star_of_of_int < {hypreal_of_real,hcomplex_of_complex}_of_int 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

664 
star_of_number_of < {hypreal,hcomplex}_number_of 
17423  665 
star_of_number_less < number_of_less_hypreal_of_real_iff 
666 
star_of_number_le < number_of_le_hypreal_of_real_iff 

667 
star_of_eq_number < hypreal_of_real_eq_number_of_iff 

668 
star_of_less_number < hypreal_of_real_less_number_of_iff 

669 
star_of_le_number < hypreal_of_real_le_number_of_iff 

670 
star_of_power < hypreal_of_real_power 

671 
star_of_eq_0 < hcomplex_of_complex_zero_iff 

672 

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

673 
* Hyperreal: new method "transfer" that implements the transfer 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

674 
principle of nonstandard analysis. With a subgoal that mentions 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

675 
nonstandard types like "'a star", the command "apply transfer" 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

676 
replaces it with an equivalent one that mentions only standard types. 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

677 
To be successful, all free variables must have standard types; non 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

678 
standard variables must have explicit universal quantifiers. 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

679 

17641  680 
* Hyperreal: A theory of Taylor series. 
681 

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

682 

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

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

684 

17533  685 
* Discontinued special version of 'constdefs' (which used to support 
686 
continuous functions) in favor of the general Pure one with full 

687 
typeinference. 

688 

689 
* New simplification procedure for solving continuity conditions; it 

690 
is much faster on terms with many nested lambda abstractions (cubic 

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

691 
instead of exponential time). 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

692 

17533  693 
* New syntax for domain package: selector names are now optional. 
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

694 
Parentheses should be omitted unless argument is lazy, for example: 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

695 

c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

696 
domain 'a stream = cons "'a" (lazy "'a stream") 
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

697 

17533  698 
* New command 'fixrec' for defining recursive functions with pattern 
699 
matching; defining multiple functions with mutual recursion is also 

700 
supported. Patterns may include the constants cpair, spair, up, sinl, 

701 
sinr, or any data constructor defined by the domain package. The given 

702 
equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for 

703 
syntax and examples. 

704 

705 
* New commands 'cpodef' and 'pcpodef' for defining predicate subtypes 

706 
of cpo and pcpo types. Syntax is exactly like the 'typedef' command, 

707 
but the proof obligation additionally includes an admissibility 

708 
requirement. The packages generate instances of class cpo or pcpo, 

709 
with continuity and strictness theorems for Rep and Abs. 

17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset

710 

17584  711 
* HOLCF: Many theorems have been renamed according to a more standard naming 
712 
scheme (INCOMPATIBILITY): 

713 

714 
foo_inject: "foo$x = foo$y ==> x = y" 

715 
foo_eq: "(foo$x = foo$y) = (x = y)" 

716 
foo_less: "(foo$x << foo$y) = (x << y)" 

717 
foo_strict: "foo$UU = UU" 

718 
foo_defined: "... ==> foo$x ~= UU" 

719 
foo_defined_iff: "(foo$x = UU) = (x = UU)" 

720 

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

721 

14885  722 
*** ZF *** 
723 

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

726 
of a homomorphism). 

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

727 

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

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

15703  731 

732 

17445  733 
*** Cube *** 
734 

735 
* Converted to Isar theory format; use locales instead of axiomatic 

736 
theories. 

737 

738 

15703  739 
*** ML *** 
740 

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

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

745 
accordingly, while Option.map replaces apsome. 

15973  746 

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

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

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

749 
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

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

751 

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

752 
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

753 
toplevel, as they are variants of predefined functions. The following 
16234  754 
suggests how one can translate existing code: 
15973  755 

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

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

758 
last_elem xs = List.last xs 

759 
flat xss = List.concat xss 

16234  760 
seq fs = List.app fs 
15973  761 
partition P xs = List.partition P xs 
762 
mapfilter f xs = List.mapPartial f xs 

763 

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

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

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

766 

17371  767 
x > f f #> g 
768 
(x, y) > f f #> g 

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

769 

17495  770 
* Pure/library.ML: introduced/changed precedence of infix operators: 
771 

772 
infix 1 > > > >> >> >>> #> #>; 

773 
infix 2 ?; 

774 
infix 3 o oo ooo oooo; 

775 
infix 4 ~~ upto downto; 

776 

777 
Maybe INCOMPATIBILITY when any of those is used in conjunction with other 

778 
infix operators. 

779 

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

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

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

783 

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

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

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

786 

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

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

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

789 

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

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

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

792 

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

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

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

795 

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

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

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

798 

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

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

800 
these: 'a option > 'a where 'a = 'b list 
17402  801 
the_default: 'a > 'a option > 'a 
802 
the_list: 'a option > 'a list 

803 

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

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

805 
basic operations for association lists, following natural argument 
17564  806 
order; moreover the explicit equality predicate passed here avoids 
17495  807 
potentially expensive polymorphic runtime equality checks. 
808 
The old functions may be expressed as follows: 

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

809 

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

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

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

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

813 

17564  814 
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides 
815 

816 
val make: ('a > 'b) > 'a list > ('a * 'b) list 

817 
val find: ('a * 'b > bool) > ('c * 'b) list > 'a > 'c list 

818 

819 
replacing make_keylist and keyfilter (occassionally used) 

820 
Naive rewrites: 

821 

822 
make_keylist = AList.make 

823 
keyfilter = AList.find (op =) 

824 

825 
* eq_fst and eq_snd now take explicit equality parameter, thus 

826 
avoiding eqtypes. Naive rewrites: 

827 

828 
eq_fst = eq_fst (op =) 

829 
eq_snd = eq_snd (op =) 

830 

831 
* Removed deprecated apl and apr (rarely used). 

832 
Naive rewrites: 

833 

834 
apl (n, op) =>>= curry op n 

835 
apr (op, m) =>>= fn n => op (n, m) 

836 

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

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

838 
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

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

840 

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

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

842 
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

843 
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

844 
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

845 

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

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

847 
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

848 
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

849 
(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

850 
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

851 
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

852 
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

853 
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

854 
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

855 
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

856 
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

857 
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

858 
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

859 
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

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

861 

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

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

863 
> '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

864 
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

865 

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

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

867 
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

868 
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

869 
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

870 

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

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

872 
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

873 
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

874 
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

875 
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

876 
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

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

878 

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

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

880 
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

881 
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

882 
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

883 

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

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

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

889 
name; NameSpace.extend is superceded by context dependent 

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

891 
the naming context. Especially note Theory.restore_naming and 

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

893 
Theory.add_path is no longer sufficient to recover from 

894 
Theory.absolute_path in particular. 

895 

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

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

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

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

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

901 
with earlier declarations. 

16151  902 

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

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

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

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

906 

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

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

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

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

910 
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

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

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

913 

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

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

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

916 

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

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

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

919 

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

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

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

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

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

924 

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

925 
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

926 
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

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

928 

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

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

930 

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

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

932 
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

933 
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

934 
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

935 

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

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

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

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

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

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

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

942 
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

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

944 

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

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

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

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

948 

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

16151  952 

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

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

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

955 

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

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

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

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

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

960 

16718  961 
* Pure: print_tac now outputs the goal through the trace channel. 
962 

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

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

964 
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

965 
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

966 
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

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

968 

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

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

970 
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

971 
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

972 

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

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

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

975 
the Simplifier recursively should use Simplifier.inherit_bounds to 
17720  976 
avoid local name clashes. Failure to do so produces warnings 
977 
"Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds 

978 
for further details. 

16234  979 

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

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

983 
scripts for the time being. 

984 

17457  985 
* ML operator HTML.with_charset specifies the charset begin used for 
986 
generated HTML files. For example: 

987 

988 
HTML.with_charset "utf8" use_thy "Hebrew"; 

17538  989 
HTML.with_charset "utf8" use_thy "Chinese"; 
17457  990 

16234  991 

992 
*** System *** 

993 

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

995 
isabelle, isatool etc.). 

996 

997 
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for 

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

999 

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

1001 
used by Isabelle; default is ROOT.ML. 

1002 

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

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

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

1005 

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

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

15703  1009 

1010 

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

1011 

14606  1012 
New in Isabelle2004 (April 2004) 
1013 
 

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

1014 

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

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

1016 

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

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

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

1019 

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

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

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

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

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

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

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

1029 
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

1030 

14237  1031 
* Pure: Macintosh and Windows linebreaks are now allowed in theory files. 
1032 

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

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

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

14233  1037 

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

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

14333  1042 

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

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

1046 

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

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

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

14224  1051 
rather than definitionally, such as the metalogic connectives. 
1052 

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

1055 

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

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

1060 

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

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

1062 

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

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

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

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

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

1067 
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

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

1069 
 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

1070 
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

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

1072 

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

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

1074 
 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

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

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

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

1078 

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

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

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

1081 
and derived forms. 
14283  1082 

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

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

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

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

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

1087 
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

1088 
 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

1089 
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

1090 
 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

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

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

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

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

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

1099 
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

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

1103 
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

1104 

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

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

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

1107 

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

1108 

14136  1109 
*** HOL *** 
1110 

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

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

1114 
can be used like any other Isabelle image. See 

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

1116 

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

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

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

1119 
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

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

1121 
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

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

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

1124 
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

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

1126 

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

1130 
* Numerics: 

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

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

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

14389  1138 

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

14255  1141 
* Records: 
1142 
 Record types are now by default printed with their type abbreviation 

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

1144 
the reference "print_record_type_abbr". 

14731  1145 
 Simproc "record_upd_simproc" for simplification of multiple updates added 
14255  1146 
(not enabled by default). 
14427  1147 
 Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp. 
1148 
EX x. x = sel r to True (not enabled by default). 

14255  1149 
 Tactic "record_split_simp_tac" to split and simplify records added. 
14731  1150 

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

14136  1154 

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

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

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

1158 

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

14731  1162 
* HOLMatrix: a first theory for matrices in HOL with an application of 
14610  1163 
matrix theory to linear programming. 
14136  1164 

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

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

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

14380  1170 

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

14418  1174 
like in normal math, and corresponding versions for < and for intersection. 
1175 

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

1178 

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

14380  1181 

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

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

1185 

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

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

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

1190 
for examples. 

14464  1191 

14606  1192 

14536  1193 
*** HOLCF *** 
1194 

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

1196 

14572  1197 

1198 

14136  1199 
New in Isabelle2003 (May 2003) 
14606  1200 
 
14136  1201 

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

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

1203 

13618  1204 
* Provers/simplifier: 
1205 

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

1209 
the order of assumptions. 

1210 

1211 
Potential INCOMPATIBILITY: 

1212 

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

13618  1215 

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

1217 

13781  1218 
now gives rise to the infinite reduction sequence 
1219 

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

1221 

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

1223 
kind of problem. 

1224 

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

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

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

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

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

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

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

13618  1232 

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

1234 

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

1237 
conditions before applying the rewrite rule): 

1238 
ML "simp_depth_limit := n" 

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

1240 
the simplifier would diverge. 

1241 

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

1242 
 Accepts free variables as head terms in congruence rules. Useful in Isar. 
13829  1243 

13938  1244 
 No longer aborts on failed congruence proof. Instead, the 
1245 
congruence is ignored. 

1246 

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

1249 
as HOL/Extraction for some case studies. 

1250 

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

1253 
PG menu: Isabelle/Isar > Settings > Show Main Goal 
13815  1254 
(ML: Proof.show_main_goal). 
1255 

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

1257 
rules whose conclusion matches subgoal 1: 

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

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

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

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

1262 
(ML: ProofGeneral.print_intros()) 

1263 

1264 
* Pure: New flag trace_unify_fail causes unification to print 

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

1267 
assumption failed. 

1268 

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

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

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

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

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

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

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

1276 

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

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

1278 
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

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

1280 

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

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

1282 
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

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

1286 
be given (the default is 40); 

1287 

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

1289 
(batchmode only); 

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

1290 

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

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

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

1293 
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

1294 

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

1297 
for slight decrease in efficiency; 

1298 

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

1301 

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

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

1303 
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

1304 

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

1305 

13158  1306 
*** HOL *** 
1307 

13899  1308 
* arith(_tac) 
1309 

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

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

1312 
of quantifierfree linear arithmetic. 

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

1314 

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

1316 

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

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

14731  1319 
Presburger arithmetic can also be called explicitly via presburger(_tac). 
13899  1320 

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

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

1323 

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

1325 
are distributed over a sum of terms; 

1326 

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

14731  1329 
"<=", "<" and "="). 
1330 

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

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

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

1336 

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

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

1338 
Finite_Set); 
13492  1339 

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

1342 

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

1345 

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

1348 
of the empty set. 

1349 

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

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

1353 
Univariate Polynomials). Contributions welcome; 

13960  1354 

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

1356 

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

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

1360 

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

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

1362 

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

1364 
Fleuriot); 
13960  1365 

13549  1366 
* Real/HahnBanach: updated and adapted to locales; 
1367 

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

13872  1370 

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

1372 

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

1375 

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

1378 
classes, interfaces, objects,virtual methods, static methods, 

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

1380 
assignment, exceptions. 

13549  1381 

14011  1382 

13549  1383 
*** ZF *** 
1384 

15154  1385 
* ZF/Constructible: consistency proof for AC (Gdel's constructible 
13549  1386 
universe, etc.); 
1387 

13872  1388 
* Main ZF: virtually all theories converted to newstyle format; 
13518  1389 

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

1390 

13478  1391 
*** ML *** 
1392 

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

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

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

1396 

1397 
* Pure: improved error reporting of simprocs; 

1398 

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

1400 
up simprocs; 

1401 