author  wenzelm 
Wed, 19 Oct 2005 21:52:30 +0200  
changeset 17918  93e26302733e 
parent 17890  fddb41d3cfa5 
child 17981  2602be0d99ae 
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 

17918
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

9 
* Theory syntax: the header format ``theory A = B + C:'' has been 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

10 
discontinued in favour of ``theory A imports B C begin''. Use isatool 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

11 
fixheaders to convert existing theory files. INCOMPATIBILITY. 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

12 

93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

13 
* Theory syntax: the old nonIsar theory file format has been 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

14 
discontinued altogether. Note that ML proof scripts may still be used 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

15 
with Isar theories; migration is usually quite simple with the ML 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

16 
function use_legacy_bindings. INCOMPATIBILITY. 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

17 

93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

18 
* Legacy goal package: removed former userlevel functions top_sg, 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

19 
prin, printyp, pprint_term/typ, which tend to cause confusion about 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

20 
the actual goal (!) context being used here. 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

21 

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

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

23 

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

24 

17865  25 
*** Document preparation *** 
26 

17869  27 
* Added antiquotations @{ML_type text} and @{ML_struct text} which 
28 
check the given source text as ML type/structure, printing verbatim. 

17865  29 

30 

17779  31 
*** Pure *** 
32 

17865  33 
* Isar: improper proof element 'guess' is like 'obtain', but derives 
34 
the obtained context from the course of reasoning! For example: 

35 

36 
assume "EX x y. A x & B y"  "any previous fact" 

37 
then guess x and y by clarify 

38 

39 
This technique is potentially adventurous, depending on the facts and 

40 
proof tools being involved here. 

41 

17779  42 
* Input syntax now supports dummy variable binding "%_. b", where the 
43 
body does not mention the bound variable. Note that dummy patterns 

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

17780  45 
match any set comprehension as expected. Potential INCOMPATIBILITY  
46 
parse translations need to cope with syntactic constant "_idtdummy" in 

47 
the binding position. 

48 

49 
* Removed obsolete syntactic constant "_K" and its associated parse 

50 
translation. INCOMPATIBILITY  use dummy abstraction instead, for 

17779  51 
example "A > B" => "Pi A (%_. B)". 
52 

17865  53 

17806  54 
*** HOL *** 
55 

17865  56 
* In the context of the assumption "~(s = t)" the Simplifier rewrites 
57 
"t = s" to False (by simproc "neq_simproc"). For backward 

58 
compatibility this can be disabled by ML "reset use_neq_simproc". 

17779  59 

17809
195045659c06
Tactics sat and satx reimplemented, several improvements
webertj
parents:
17806
diff
changeset

60 
* Tactics 'sat' and 'satx' reimplemented, several improvements: goals 
195045659c06
Tactics sat and satx reimplemented, several improvements
webertj
parents:
17806
diff
changeset

61 
no longer need to be stated as "<prems> ==> False", equivalences (i.e. 
17865  62 
"=" on type bool) are handled, variable names of the form "lit_<n>" 
63 
are no longer reserved, significant speedup. 

64 

17809
195045659c06
Tactics sat and satx reimplemented, several improvements
webertj
parents:
17806
diff
changeset

65 

17878  66 
*** ML *** 
67 

68 
* Simplifier: the simpset of a running simplification process now 

69 
contains a proof context (cf. Simplifier.the_context), which is the 

70 
very context that the initial simpset has been retrieved from (by 

17890  71 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  72 
(solver, looper etc.) may depend on arbitrary proof data. 
73 

74 
* Simplifier.inherit_context inherits the proof context (plus the 

75 
local bounds) of the current simplification process; any simproc 

76 
etc. that calls the Simplifier recursively should do this! Removed 

77 
former Simplifier.inherit_bounds, which is already included here  

17890  78 
INCOMPATIBILITY. Tools based on lowlevel rewriting may even have to 
79 
specify an explicit context using Simplifier.context/theory_context. 

17878  80 

81 
* Simplifier/Classical Reasoner: more abstract interfaces 

82 
change_simpset/claset for modifying the simpset/claset reference of a 

83 
theory; raw versions simpset/claset_ref etc. have been discontinued  

84 
INCOMPATIBILITY. 

85 

86 

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

87 

17720  88 
New in Isabelle2005 (October 2005) 
89 
 

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

90 

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

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

92 

15130  93 
* Theory headers: the new header syntax for Isar theories is 
94 

95 
theory <name> 

16234  96 
imports <theory1> ... <theoryN> 
97 
uses <file1> ... <fileM> 

15130  98 
begin 
99 

16234  100 
where the 'uses' part is optional. The previous syntax 
101 

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

103 

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

17371  106 
nonIsar theories now, but these will disappear soon. 
15130  107 

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

108 
* Theory loader: parent theories can now also be referred to via 
16234  109 
relative and absolute paths. 
110 

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

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

112 
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

113 
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

114 
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

115 
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

116 
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

117 
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

118 
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

119 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  120 

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

121 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  122 

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

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

125 
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

126 

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

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

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

129 

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

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

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

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

17385  137 

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

140 
faster. 

141 

15703  142 

143 
*** Document preparation *** 

144 

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

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

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

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

150 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

151 

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

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

153 
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

154 
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

155 
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

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

157 
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

158 
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

159 
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

160 
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

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

162 

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

163 
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

164 
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

165 
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

166 
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

167 
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

168 
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

169 
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

170 
specified above. 
16234  171 

17402  172 
* Several new antiquotations: 
15979  173 

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

175 

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

177 

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

15979  180 

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

16234  182 
theorem applying a "style" to it 
183 

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

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

185 

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

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

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

192 
typechecked ML expressions verbatim. 
16234  193 

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

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

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

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

198 

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

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

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

202 

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

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

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

205 

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

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

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

208 

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

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

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

211 

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

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

213 
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

214 
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

215 

16234  216 

217 
*** Pure *** 

218 

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

220 
automatic typeinference of declared constants; additional support for 

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

222 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

223 
sequential dependencies of definitions within a single 'constdefs' 

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

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

226 

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

228 
indexed syntax provides a notational device for subscripted 

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

230 
expressions. Secondly, in a local context with structure 

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

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

233 
show_structs controls printing of implicit structures. Typical 

234 
applications of these concepts involve record types and locales. 

235 

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

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

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

239 

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

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

242 
parsing/printing, see also isarref manual. 

243 

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

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

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

248 
INCOMPATIBILITY. 

249 

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

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

251 
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

252 
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

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

254 

16234  255 
* Improved internal renaming of symbolic identifiers  attach primes 
256 
instead of base 26 numbers. 

257 

258 
* New flag show_question_marks controls printing of leading question 

259 
marks in schematic variable names. 

260 

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

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

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

264 

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

266 
by simp 

267 

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

269 

17548  270 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  271 
annotations as "(00...)". 
272 

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

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

275 
Before that distinction was only partially implemented via type class 

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

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

278 
exotic syntax specifications may require further adaption 

17691  279 
(e.g. Cube/Cube.thy). 
16234  280 

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

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

283 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

284 
specifications. 

285 

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

288 

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

291 
Limit. 

292 

293 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

299 
allow for use in a context of fixed variables. 

300 

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

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

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

304 

17597  305 
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. 
17590  306 

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

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

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

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

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

313 

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

315 
selections of theorems in named facts via index ranges. 

316 

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

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

318 
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

319 
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

320 

17397  321 
* 'hide': option '(open)' hides only base names. 
322 

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

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

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

325 

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

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

329 
must be quoted when used as identifiers. 

330 

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

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

333 
quoted when used as identifier. 

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

334 

16234  335 

336 
*** Locales *** 

17095  337 

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

340 
proof obligations from the expression specification. After the 

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

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

343 
commands is a follows: 

344 

17095  345 
(1) interpretation expr inst 
346 
(2) interpretation target < expr 

347 
(3) interpret expr inst 

17385  348 

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

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

353 
locale expression. Interpretation is smart in that interpretations 

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

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

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

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

16234  359 

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

361 
'interpret' instead. 

362 

17385  363 
* New context element 'constrains' for adding type constraints to 
364 
parameters. 

365 

366 
* Context expressions: renaming of parameters with syntax 

367 
redeclaration. 

17095  368 

369 
* Locale declaration: 'includes' disallowed. 

370 

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

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

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

375 
to attribute arguments as expected. 

376 

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

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

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

380 
Attribute implementations need to cooperate properly with the static 

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

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

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

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

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

386 
values to argument tokens explicitly. 

387 

388 
* Changed parameter management in theorem generation for long goal 

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

390 
theorem statement in rare situations. 

391 

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

394 

16234  395 

396 
*** Provers *** 

397 

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

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

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

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

402 
still available as 'simplesubst'. 

403 

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

405 
and quasi orders. 

406 

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

408 
reflexivetransitive closure of relations. 

409 

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

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

412 

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

414 
is peformed already. Objectlogics merely need to finish their 

415 
initial simpset configuration as before. INCOMPATIBILITY. 

15703  416 

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

417 

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

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

419 

16234  420 
* Symbolic syntax of Hilbert Choice Operator is now as follows: 
14878  421 

422 
syntax (epsilon) 

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

424 

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

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

428 
becomes available as variable, constant etc. INCOMPATIBILITY, 

429 

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

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

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

433 
support corresponding Isar calculations. 
16234  434 

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

436 
instead of ":". 

437 

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

439 

440 
Old New 

441 
{..n(} {..<n} 

442 
{)n..} {n<..} 

443 
{m..n(} {m..<n} 

444 
{)m..n} {m<..n} 

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

446 

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

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

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

15046  450 

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

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

453 

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

456 
interface. 

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

457 

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

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

463 
Some new syntax forms are available: 

464 

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

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

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

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

469 

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

471 
function "Summation", which has been discontinued. 

472 

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

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

475 
(insert F x)'. 

476 

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

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

479 
typedefs, inductive datatypes and recursion. 

480 

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

483 
HOL/ex/SAT_Examples.thy for examples. 

17619  484 

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

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

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

489 
in unstructured proof scripts. 

490 

491 
* Reworked implementation of records. Improved scalability for 

492 
records with many fields, avoiding performance problems for type 

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

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

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

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

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

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

499 
<record_name>_ext_type. 

500 

501 
Flag record_quick_and_dirty_sensitive can be enabled to skip the 

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

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

504 
quite long. 

505 

506 
New simproc record_upd_simproc for simplification of multiple record 

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

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

509 
occasionally, since simplification is more powerful by default. 

510 

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

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

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

513 

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

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

517 
old proofs break occasionally as simplification may now solve more 

518 
goals than previously. 

519 

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

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

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

523 
just like y <= x. 

524 

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

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

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

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

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

530 
enabled/disabled by the reference use_let_simproc. Potential 

531 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  532 

16563  533 
* Classical reasoning: the meson method now accepts theorems as arguments. 
534 

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

537 

16891  538 
* Theory OrderedGroup and Ring_and_Field: various additions and 
539 
improvements to faciliate calculations involving equalities and 

540 
inequalities. 

541 

542 
The following theorems have been eliminated or modified 

543 
(INCOMPATIBILITY): 

16888  544 

545 
abs_eq now named abs_of_nonneg 

17371  546 
abs_of_ge_0 now named abs_of_nonneg 
547 
abs_minus_eq now named abs_of_nonpos 

16888  548 
imp_abs_id now named abs_of_nonneg 
549 
imp_abs_neg_id now named abs_of_nonpos 

550 
mult_pos now named mult_pos_pos 

551 
mult_pos_le now named mult_nonneg_nonneg 

552 
mult_pos_neg_le now named mult_nonneg_nonpos 

553 
mult_pos_neg2_le now named mult_nonneg_nonpos2 

554 
mult_neg now named mult_neg_neg 

555 
mult_neg_le now named mult_nonpos_nonpos 

556 

16891  557 
* Theory Parity: added rules for simplifying exponents. 
558 

17092  559 
* Theory List: 
560 

561 
The following theorems have been eliminated or modified 

562 
(INCOMPATIBILITY): 

563 

564 
list_all_Nil now named list_all.simps(1) 

565 
list_all_Cons now named list_all.simps(2) 

566 
list_all_conv now named list_all_iff 

567 
set_mem_eq now named mem_iff 

568 

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

571 

16888  572 

573 
*** HOLComplex *** 

574 

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

577 

578 
The following theorems have been eliminated or modified 

579 
(INCOMPATIBILITY): 

580 

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

581 
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

582 
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

583 
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

584 
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

585 
real_of_int_mult reversed direction of equality (use [symmetric]) 
16891  586 

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

16888  588 

16962  589 
* Theory Ln is new, with properties of the natural logarithm 
590 

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

593 

594 
hypreal = real star 

595 
hypnat = nat star 

596 
hcomplex = complex star 

597 

598 
* Hyperreal: Many groups of similarlydefined constants have been 

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

599 
replaced by polymorphic versions (INCOMPATIBILITY): 
17423  600 

601 
star_of < hypreal_of_real, hypnat_of_nat, hcomplex_of_complex 

602 

603 
starset < starsetNat, starsetC 

604 
*s* < *sNat*, *sc* 

605 
starset_n < starsetNat_n, starsetC_n 

606 
*sn* < *sNatn*, *scn* 

607 
InternalSets < InternalNatSets, InternalCSets 

608 

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

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

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

613 
InternalFuns < InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs 
17423  614 

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

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

617 

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

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

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

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

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

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

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

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

626 
mult_1_left < {hypreal,hypnat}_mult_1, hcomplex_mult_one_left 
17423  627 
mult_1_right < hcomplex_mult_one_right 
628 
mult_zero_left < hcomplex_mult_zero_left 

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

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

631 
zero_neq_one < {hypreal,hypnat,hcomplex}_zero_not_eq_one 
17423  632 
right_inverse < hypreal_mult_inverse 
633 
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

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

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

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

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

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

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

640 
mult_strict_left_mono < {hypreal,hypnat}_mult_less_mono2 
17423  641 
add_nonneg_nonneg < hypreal_le_add_order 
642 

643 
* Hyperreal: Separate theorems having to do with typespecific 

644 
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

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

646 

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

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

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

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

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

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

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

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

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

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

656 
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

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

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

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

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

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

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

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

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

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

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

667 
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

668 
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

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

670 
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

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

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

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

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

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

676 
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

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

678 
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

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

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

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

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

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

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

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

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

690 
starfun_add_capprox < starfun{C,RC}_add_capprox 
17423  691 
starfun_add_approx < starfunCR_add_approx 
692 
starfun_inverse_inverse < starfunC_inverse_inverse 

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

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

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

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

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

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

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

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

701 

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

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

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

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

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

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

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

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

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

710 
star_n_one_num < {hypreal,hypnat,hcomplex}_one_num 
17423  711 
star_n_abs < hypreal_hrabs 
712 
star_n_divide < hcomplex_divide 

713 

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

714 
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

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

717 
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

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

719 
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

720 
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

721 
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

722 
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

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

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

725 
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

726 
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

727 
star_of_number_of < {hypreal,hcomplex}_number_of 
17423  728 
star_of_number_less < number_of_less_hypreal_of_real_iff 
729 
star_of_number_le < number_of_le_hypreal_of_real_iff 

730 
star_of_eq_number < hypreal_of_real_eq_number_of_iff 

731 
star_of_less_number < hypreal_of_real_less_number_of_iff 

732 
star_of_le_number < hypreal_of_real_le_number_of_iff 

733 
star_of_power < hypreal_of_real_power 

734 
star_of_eq_0 < hcomplex_of_complex_zero_iff 

735 

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

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

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

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

739 
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

740 
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

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

742 

17641  743 
* Hyperreal: A theory of Taylor series. 
744 

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

745 

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

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

747 

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

750 
typeinference. 

751 

752 
* New simplification procedure for solving continuity conditions; it 

753 
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

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

755 

17533  756 
* 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

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

758 

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

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

760 

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

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

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

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

766 
syntax and examples. 

767 

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

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

770 
but the proof obligation additionally includes an admissibility 

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

772 
with continuity and strictness theorems for Rep and Abs. 

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

773 

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

776 

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

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

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

780 
foo_strict: "foo$UU = UU" 

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

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

783 

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

784 

14885  785 
*** ZF *** 
786 

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

789 
of a homomorphism). 

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

790 

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

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

15703  794 

795 

17445  796 
*** Cube *** 
797 

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

799 
theories. 

800 

801 

15703  802 
*** ML *** 
803 

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

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

808 
accordingly, while Option.map replaces apsome. 

15973  809 

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

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

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

812 
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

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

814 

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

815 
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

816 
toplevel, as they are variants of predefined functions. The following 
16234  817 
suggests how one can translate existing code: 
15973  818 

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

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

821 
last_elem xs = List.last xs 

822 
flat xss = List.concat xss 

16234  823 
seq fs = List.app fs 
15973  824 
partition P xs = List.partition P xs 
825 
mapfilter f xs = List.mapPartial f xs 

826 

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

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

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

829 

17371  830 
x > f f #> g 
831 
(x, y) > f f #> g 

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

832 

17495  833 
* Pure/library.ML: introduced/changed precedence of infix operators: 
834 

835 
infix 1 > > > >> >> >>> #> #>; 

836 
infix 2 ?; 

837 
infix 3 o oo ooo oooo; 

838 
infix 4 ~~ upto downto; 

839 

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

841 
infix operators. 

842 

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

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

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

846 

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

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

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

849 

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

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

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

852 

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

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

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

855 

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

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

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

858 

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

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

860 
available: 
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 
the: 'a option > 'a (*partial*) 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

863 
these: 'a option > 'a where 'a = 'b list 
17402  864 
the_default: 'a > 'a option > 'a 
865 
the_list: 'a option > 'a list 

866 

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

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

868 
basic operations for association lists, following natural argument 
17564  869 
order; moreover the explicit equality predicate passed here avoids 
17495  870 
potentially expensive polymorphic runtime equality checks. 
871 
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

872 

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

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

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

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

876 

17564  877 
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides 
878 

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

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

881 

882 
replacing make_keylist and keyfilter (occassionally used) 

883 
Naive rewrites: 

884 

885 
make_keylist = AList.make 

886 
keyfilter = AList.find (op =) 

887 

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

889 
avoiding eqtypes. Naive rewrites: 

890 

891 
eq_fst = eq_fst (op =) 

892 
eq_snd = eq_snd (op =) 

893 

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

895 
Naive rewrites: 

896 

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

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

899 

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

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

901 
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

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

903 

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

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

905 
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

906 
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

907 
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

908 

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

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

910 
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

911 
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

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

913 
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

914 
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

915 
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

916 
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

917 
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

918 
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

919 
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

920 
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

921 
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

922 
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

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

924 

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

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

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

927 
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

928 

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

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

930 
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

931 
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

932 
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

933 

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

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

935 
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

936 
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

937 
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

938 
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

939 
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

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

941 

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

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

943 
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

944 
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

945 
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

946 

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

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

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

952 
name; NameSpace.extend is superceded by context dependent 

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

954 
the naming context. Especially note Theory.restore_naming and 

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

956 
Theory.add_path is no longer sufficient to recover from 

957 
Theory.absolute_path in particular. 

958 

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

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

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

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

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

964 
with earlier declarations. 

16151  965 

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

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

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

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

969 

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

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

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

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

973 
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

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

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

976 

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

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

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

979 

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

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

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

982 

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

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

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

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

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

987 

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

988 
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

989 
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

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

991 

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

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

993 

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

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

995 
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

996 
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

997 
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

998 

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

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

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

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

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

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

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

1005 
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

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

1007 

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

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

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

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

1011 

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

16151  1015 

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

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

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

1018 

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

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

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

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

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

1023 

16718  1024 
* Pure: print_tac now outputs the goal through the trace channel. 
1025 

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

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

1027 
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

1028 
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

1029 
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

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

1031 

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

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

1033 
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

1034 
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

1035 

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

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

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

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

1041 
for further details. 

16234  1042 

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

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

1046 
scripts for the time being. 

1047 

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

1050 

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

17538  1052 
HTML.with_charset "utf8" use_thy "Chinese"; 
17457  1053 

16234  1054 

1055 
*** System *** 

1056 

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

1058 
isabelle, isatool etc.). 

1059 

1060 
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for 

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

1062 

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

1064 
used by Isabelle; default is ROOT.ML. 

1065 

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

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

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

1068 

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

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

15703  1072 

1073 

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

1074 

14606  1075 
New in Isabelle2004 (April 2004) 
1076 
 

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

1077 

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

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

1079 

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

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

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

1082 

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

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

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

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

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

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

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

1092 
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

1093 

14237  1094 
* Pure: Macintosh and Windows linebreaks are now allowed in theory files. 
1095 

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

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

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

14233  1100 

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

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

14333  1105 

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

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

1109 

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

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

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

14224  1114 
rather than definitionally, such as the metalogic connectives. 
1115 

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

1118 

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

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

1123 

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

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

1125 

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

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

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

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

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

1130 
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

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

1132 
 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

1133 
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

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

1135 

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

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

1137 
 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

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

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

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

1141 

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

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

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

1144 
and derived forms. 
14283  1145 

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

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

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

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

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

1150 
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

1151 
 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

1152 
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

1153 
 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

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

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

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

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

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

1162 
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

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

1166 
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

1167 

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

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

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

1170 

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

1171 

14136  1172 
*** HOL *** 
1173 

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

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

1177 
can be used like any other Isabelle image. See 

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

1179 

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

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

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

1182 
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

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

1184 
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

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

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

1187 
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

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

1189 

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

1193 
* Numerics: 

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

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

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

14389  1201 

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

14255  1204 
* Records: 
1205 
 Record types are now by default printed with their type abbreviation 

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

1207 
the reference "print_record_type_abbr". 

14731  1208 
 Simproc "record_upd_simproc" for simplification of multiple updates added 
14255  1209 
(not enabled by default). 
14427  1210 
 Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp. 
1211 
EX x. x = sel r to True (not enabled by default). 

14255  1212 
 Tactic "record_split_simp_tac" to split and simplify records added. 
14731  1213 

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

14136  1217 

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

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

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

1221 

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

14731  1225 
* HOLMatrix: a first theory for matrices in HOL with an application of 
14610  1226 
matrix theory to linear programming. 
14136  1227 

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

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

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

14380  1233 

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

14418  1237 
like in normal math, and corresponding versions for < and for intersection. 
1238 

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

1241 

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

14380  1244 

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

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

1248 

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

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

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

1253 
for examples. 

14464  1254 

14606  1255 

14536  1256 
*** HOLCF *** 
1257 

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

1259 

14572  1260 

1261 

14136  1262 
New in Isabelle2003 (May 2003) 
14606  1263 
 
14136  1264 

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

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

1266 

13618  1267 
* Provers/simplifier: 
1268 

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

1272 
the order of assumptions. 

1273 

1274 
Potential INCOMPATIBILITY: 

1275 

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

13618  1278 

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

1280 

13781  1281 
now gives rise to the infinite reduction sequence 
1282 

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

1284 

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

1286 
kind of problem. 

1287 

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

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

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

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

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

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

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

13618  1295 

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

1297 

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

1300 
conditions before applying the rewrite rule): 

1301 
ML "simp_depth_limit := n" 

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

1303 
the simplifier would diverge. 

1304 

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

1305 
 Accepts free variables as head terms in congruence rules. Useful in Isar. 
13829  1306 

13938  1307 
 No longer aborts on failed congruence proof. Instead, the 
1308 
congruence is ignored. 

1309 

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

1312 
as HOL/Extraction for some case studies. 

1313 

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

1316 
PG menu: Isabelle/Isar > Settings > Show Main Goal 
13815  1317 
(ML: Proof.show_main_goal). 
1318 

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

1320 
rules whose conclusion matches subgoal 1: 

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

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

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

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

1325 
(ML: ProofGeneral.print_intros()) 

1326 

1327 
* Pure: New flag trace_unify_fail causes unification to print 

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

1330 
assumption failed. 

1331 

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

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

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

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

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

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

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

1339 

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

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

1341 
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

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

1343 

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

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

1345 
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

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

1349 
be given (the default is 40); 

1350 

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

1352 
(batchmode only); 

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

1353 

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

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

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

1356 
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

1357 

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

1360 
for slight decrease in efficiency; 

1361 

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

1364 

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

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

1366 
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

1367 

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

1368 

13158  1369 
*** HOL *** 
1370 

13899  1371 
* arith(_tac) 
1372 

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

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

1375 
of quantifierfree linear arithmetic. 

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

1377 

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

1379 

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

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

14731  1382 
Presburger arithmetic can also be called explicitly via presburger(_tac). 
13899  1383 

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

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

1386 

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

1388 
are distributed over a sum of terms; 

1389 

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

14731  1392 
"<=", "<" and "="). 
1393 

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

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

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

1399 

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

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

1401 
Finite_Set); 
13492  1402 

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

1405 

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

1408 

13899 