author  wenzelm 
Thu, 08 Dec 2005 12:50:02 +0100  
changeset 18367  c209f4b61b51 
parent 18308  f18a54840629 
child 18370  db5900e7c6c9 
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 

17981
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

18 
* Legacy goal package: reduced interface to the bare minimum required 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

19 
to keep existing proof scripts running. Most other userlevel 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

20 
functions are now part of the OldGoals structure, which is *not* open 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

21 
by default (consider isatool expandshort before open OldGoals). 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

22 
Removed top_sg, prin, printyp, pprint_term/typ altogether, because 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

23 
these tend to cause confusion about the actual goal (!) context being 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

24 
used here, which is not necessarily the same as the_context(). 
17918
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

25 

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

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

27 

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

28 

17865  29 
*** Document preparation *** 
30 

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

17865  33 

34 

17779  35 
*** Pure *** 
36 

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

39 

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

41 
then guess x and y by clarify 

42 

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

44 
proof tools being involved here. 

45 

18020  46 
* Isar: known facts from the proof context may be specified as literal 
47 
propositions, using ASCII backquote syntax. This works wherever 

48 
named facts used to be allowed so far, in proof commands, proof 

49 
methods, attributes etc. Literal facts are retrieved from the context 

50 
according to unification of type and term parameters. For example, 

51 
provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known 

52 
theorems in the current context, then these are valid literal facts: 

53 
`A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc. 

54 

55 
There is also a proof method "fact" which does the same composition 

18044  56 
for explicit goal states, e.g. the following proof texts coincide with 
57 
certain special cases of literal facts: 

18020  58 

59 
have "A" by fact == note `A` 

60 
have "A ==> B" by fact == note `A ==> B` 

61 
have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x` 

62 
have "P a ==> Q a" by fact == note `P a ==> Q a` 

63 

18308  64 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
65 

66 
def x == "t" and y == "u" 

67 

18233  68 
* Provers/induct: improved internal context management to support 
69 
local fixes and defines onthefly. Thus explicit metalevel 

70 
connectives !! and ==> are rarely required anymore in inductive goals 

71 
(using objectlogic connectives for this purpose has been long 

72 
obsolete anyway). The subsequent proof patterns illustrate advanced 

73 
techniques of natural induction; general datatypes and inductive sets 

18267  74 
work analogously (see also src/HOL/Lambda for realistic examples). 
75 

76 
(1) This is how to ``strengthen'' an inductive goal wrt. certain 

18239  77 
parameters: 
18233  78 

79 
lemma 

80 
fixes n :: nat and x :: 'a 

81 
assumes a: "A n x" 

82 
shows "P n x" 

83 
using a  {* make induct insert fact a *} 

84 
proof (induct n fixing: x)  {* generalize goal to "!!x. A n x ==> P n x" *} 

18248  85 
case 0 
18233  86 
show ?case sorry 
87 
next 

18248  88 
case (Suc n) 
18239  89 
note `!!x. A n x ==> P n x`  {* induction hypothesis, according to induction rule *} 
90 
note `A (Suc n) x`  {* induction premise, stemming from fact a *} 

18233  91 
show ?case sorry 
92 
qed 

93 

18267  94 
(2) This is how to perform induction over ``expressions of a certain 
18233  95 
form'', using a locally defined inductive parameter n == "a x" 
18239  96 
together with strengthening (the latter is usually required to get 
18267  97 
sufficiently flexible induction hypotheses): 
18233  98 

99 
lemma 

100 
fixes a :: "'a => nat" 

101 
assumes a: "A (a x)" 

102 
shows "P (a x)" 

103 
using a 

104 
proof (induct n == "a x" fixing: x) 

105 
... 

106 

18267  107 
See also HOL/Isar_examples/Puzzle.thy for an application of the this 
108 
particular technique. 

109 

110 
(3) This is how to perform existential reasoning ('obtain') by 

111 
induction, while avoiding explicit objectlogic encodings: 

112 

113 
fix n :: nat 

114 
obtain x :: 'a where "P n x" and "Q n x" 

115 
proof (induct n fixing: thesis) 

116 
case 0 

117 
obtain x where "P 0 x" and "Q 0 x" sorry 

118 
then show thesis by (rule "0.prems") 

119 
next 

120 
case (Suc n) 

121 
obtain x where "P n x" and "Q n x" by (rule Suc.hyps) 

122 
obtain x where "P (Suc n) x" and "Q (Suc n) x" sorry 

123 
then show thesis by (rule Suc.prems) 

124 
qed 

125 

126 
Here the 'fixing: thesis' specification essentially modifies the scope 

127 
of the formal thesis parameter, in order to the get the whole 

128 
existence statement through the induction as expected. 

18233  129 

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

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

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

135 
the binding position. 

136 

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

138 
translation. INCOMPATIBILITY  use dummy abstraction instead, for 

17779  139 
example "A > B" => "Pi A (%_. B)". 
140 

17865  141 

17806  142 
*** HOL *** 
143 

18367
c209f4b61b51
* HOL: Theorem 'swap' is no longer bound at the ML toplevel.
wenzelm
parents:
18308
diff
changeset

144 
* Theorem 'swap' is no longer bound at the ML toplevel. INCOMPATIBILITY, use 
c209f4b61b51
* HOL: Theorem 'swap' is no longer bound at the ML toplevel.
wenzelm
parents:
18308
diff
changeset

145 
Classical.swap instead. 
c209f4b61b51
* HOL: Theorem 'swap' is no longer bound at the ML toplevel.
wenzelm
parents:
18308
diff
changeset

146 

17996  147 
* Alternative iff syntax "A <> B" for equality on bool (with priority 
148 
25 like >); output depends on the "iff" print_mode, the default is 

149 
"A = B" (with priority 50). 

150 

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

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

17779  154 

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

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

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

159 

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

160 

17878  161 
*** ML *** 
162 

17991  163 
* Library: new module Pure/General/rat.ML implementing rational numbers, 
164 
replacing the former functions in the Isabelle library. 

165 

18051  166 
* Library: indexed lists  some functions in the Isabelle library 
167 
treating lists over 'a as finite mappings from [0...n] to 'a 

168 
have been given more convenient names and signatures reminiscent 

169 
of similar functions for alists, tables, etc: 

170 

171 
val nth: 'a list > int > 'a 

172 
val nth_update: int * 'a > 'a list > 'a list 

173 
val nth_map: int > ('a > 'a) > 'a list > 'a list 

174 
val fold_index: (int * 'a > 'b > 'b) > 'a list > 'b > 'b 

175 

176 
Note that fold_index starts counting at index 0, not 1 like foldln used to. 

177 

18020  178 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  179 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  180 
achieve the old behaviour. 
181 

182 
* Pure: the "Goal" constant is now called "prop", supporting a 

183 
slightly more general idea of ``protecting'' metalevel rule 

184 
statements. 

185 

17981
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

186 
* Internal goals: structure Goal provides simple interfaces for 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

187 
init/conclude/finish and tactical prove operations (replacing former 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

188 
Tactic.prove). Note that OldGoals.prove_goalw_cterm has long been 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

189 
obsolete, it is illbehaved in a local proof context (e.g. with local 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

190 
fixes/assumes or in a locale context). 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

191 

17878  192 
* Simplifier: the simpset of a running simplification process now 
193 
contains a proof context (cf. Simplifier.the_context), which is the 

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

17890  195 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  196 
(solver, looper etc.) may depend on arbitrary proof data. 
197 

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

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

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

201 
former Simplifier.inherit_bounds, which is already included here  

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

17878  204 

205 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

208 
INCOMPATIBILITY. 

209 

210 

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

211 

17720  212 
New in Isabelle2005 (October 2005) 
213 
 

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

214 

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

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

216 

15130  217 
* Theory headers: the new header syntax for Isar theories is 
218 

219 
theory <name> 

16234  220 
imports <theory1> ... <theoryN> 
221 
uses <file1> ... <fileM> 

15130  222 
begin 
223 

16234  224 
where the 'uses' part is optional. The previous syntax 
225 

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

227 

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

17371  230 
nonIsar theories now, but these will disappear soon. 
15130  231 

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

232 
* Theory loader: parent theories can now also be referred to via 
16234  233 
relative and absolute paths. 
234 

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

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

236 
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

237 
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

238 
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

239 
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

240 
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

241 
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

242 
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

243 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  244 

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

245 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  246 

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

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

249 
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

250 

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

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

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

253 

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

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

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

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

17385  261 

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

264 
faster. 

265 

15703  266 

267 
*** Document preparation *** 

268 

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

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

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

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

274 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

275 

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

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

277 
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

278 
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

279 
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

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

281 
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

282 
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

283 
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

284 
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

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

286 

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

287 
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

288 
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

289 
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

290 
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

291 
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

292 
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

293 
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

294 
specified above. 
16234  295 

17402  296 
* Several new antiquotations: 
15979  297 

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

299 

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

301 

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

15979  304 

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

16234  306 
theorem applying a "style" to it 
307 

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

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

309 

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

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

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

316 
typechecked ML expressions verbatim. 
16234  317 

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

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

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

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

322 

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

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

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

326 

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

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

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

329 

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

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

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

332 

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

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

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

335 

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

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

337 
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

338 
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

339 

16234  340 

341 
*** Pure *** 

342 

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

344 
automatic typeinference of declared constants; additional support for 

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

346 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

347 
sequential dependencies of definitions within a single 'constdefs' 

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

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

350 

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

352 
indexed syntax provides a notational device for subscripted 

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

354 
expressions. Secondly, in a local context with structure 

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

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

357 
show_structs controls printing of implicit structures. Typical 

358 
applications of these concepts involve record types and locales. 

359 

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

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

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

363 

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

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

366 
parsing/printing, see also isarref manual. 

367 

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

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

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

372 
INCOMPATIBILITY. 

373 

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

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

375 
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

376 
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

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

378 

16234  379 
* Improved internal renaming of symbolic identifiers  attach primes 
380 
instead of base 26 numbers. 

381 

382 
* New flag show_question_marks controls printing of leading question 

383 
marks in schematic variable names. 

384 

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

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

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

388 

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

390 
by simp 

391 

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

393 

17548  394 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  395 
annotations as "(00...)". 
396 

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

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

399 
Before that distinction was only partially implemented via type class 

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

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

402 
exotic syntax specifications may require further adaption 

17691  403 
(e.g. Cube/Cube.thy). 
16234  404 

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

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

407 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

408 
specifications. 

409 

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

412 

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

415 
Limit. 

416 

417 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

423 
allow for use in a context of fixed variables. 

424 

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

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

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

428 

17597  429 
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. 
17590  430 

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

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

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

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

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

437 

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

439 
selections of theorems in named facts via index ranges. 

440 

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

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

442 
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

443 
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

444 

17397  445 
* 'hide': option '(open)' hides only base names. 
446 

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

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

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

449 

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

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

453 
must be quoted when used as identifiers. 

454 

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

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

457 
quoted when used as identifier. 

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

458 

16234  459 

460 
*** Locales *** 

17095  461 

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

464 
proof obligations from the expression specification. After the 

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

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

467 
commands is a follows: 

468 

17095  469 
(1) interpretation expr inst 
470 
(2) interpretation target < expr 

471 
(3) interpret expr inst 

17385  472 

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

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

477 
locale expression. Interpretation is smart in that interpretations 

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

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

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

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

16234  483 

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

485 
'interpret' instead. 

486 

17385  487 
* New context element 'constrains' for adding type constraints to 
488 
parameters. 

489 

490 
* Context expressions: renaming of parameters with syntax 

491 
redeclaration. 

17095  492 

493 
* Locale declaration: 'includes' disallowed. 

494 

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

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

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

499 
to attribute arguments as expected. 

500 

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

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

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

504 
Attribute implementations need to cooperate properly with the static 

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

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

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

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

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

510 
values to argument tokens explicitly. 

511 

512 
* Changed parameter management in theorem generation for long goal 

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

514 
theorem statement in rare situations. 

515 

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

518 

16234  519 

520 
*** Provers *** 

521 

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

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

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

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

526 
still available as 'simplesubst'. 

527 

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

529 
and quasi orders. 

530 

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

532 
reflexivetransitive closure of relations. 

533 

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

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

536 

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

538 
is peformed already. Objectlogics merely need to finish their 

539 
initial simpset configuration as before. INCOMPATIBILITY. 

15703  540 

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

541 

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

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

543 

16234  544 
* Symbolic syntax of Hilbert Choice Operator is now as follows: 
14878  545 

546 
syntax (epsilon) 

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

548 

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

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

552 
becomes available as variable, constant etc. INCOMPATIBILITY, 

553 

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

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

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

557 
support corresponding Isar calculations. 
16234  558 

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

560 
instead of ":". 

561 

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

563 

564 
Old New 

565 
{..n(} {..<n} 

566 
{)n..} {n<..} 

567 
{m..n(} {m..<n} 

568 
{)m..n} {m<..n} 

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

570 

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

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

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

15046  574 

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

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

577 

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

580 
interface. 

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

581 

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

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

587 
Some new syntax forms are available: 

588 

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

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

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

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

593 

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

595 
function "Summation", which has been discontinued. 

596 

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

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

599 
(insert F x)'. 

600 

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

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

603 
typedefs, inductive datatypes and recursion. 

604 

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

607 
HOL/ex/SAT_Examples.thy for examples. 

17619  608 

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

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

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

613 
in unstructured proof scripts. 

614 

615 
* Reworked implementation of records. Improved scalability for 

616 
records with many fields, avoiding performance problems for type 

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

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

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

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

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

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

623 
<record_name>_ext_type. 

624 

625 
Flag record_quick_and_dirty_sensitive can be enabled to skip the 

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

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

628 
quite long. 

629 

630 
New simproc record_upd_simproc for simplification of multiple record 

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

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

633 
occasionally, since simplification is more powerful by default. 

634 

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

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

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

637 

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

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

641 
old proofs break occasionally as simplification may now solve more 

642 
goals than previously. 

643 

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

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

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

647 
just like y <= x. 

648 

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

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

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

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

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

654 
enabled/disabled by the reference use_let_simproc. Potential 

655 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  656 

16563  657 
* Classical reasoning: the meson method now accepts theorems as arguments. 
658 

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

661 

16891  662 
* Theory OrderedGroup and Ring_and_Field: various additions and 
663 
improvements to faciliate calculations involving equalities and 

664 
inequalities. 

665 

666 
The following theorems have been eliminated or modified 

667 
(INCOMPATIBILITY): 

16888  668 

669 
abs_eq now named abs_of_nonneg 

17371  670 
abs_of_ge_0 now named abs_of_nonneg 
671 
abs_minus_eq now named abs_of_nonpos 

16888  672 
imp_abs_id now named abs_of_nonneg 
673 
imp_abs_neg_id now named abs_of_nonpos 

674 
mult_pos now named mult_pos_pos 

675 
mult_pos_le now named mult_nonneg_nonneg 

676 
mult_pos_neg_le now named mult_nonneg_nonpos 

677 
mult_pos_neg2_le now named mult_nonneg_nonpos2 

678 
mult_neg now named mult_neg_neg 

679 
mult_neg_le now named mult_nonpos_nonpos 

680 

16891  681 
* Theory Parity: added rules for simplifying exponents. 
682 

17092  683 
* Theory List: 
684 

685 
The following theorems have been eliminated or modified 

686 
(INCOMPATIBILITY): 

687 

688 
list_all_Nil now named list_all.simps(1) 

689 
list_all_Cons now named list_all.simps(2) 

690 
list_all_conv now named list_all_iff 

691 
set_mem_eq now named mem_iff 

692 

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

695 

16888  696 

697 
*** HOLComplex *** 

698 

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

701 

702 
The following theorems have been eliminated or modified 

703 
(INCOMPATIBILITY): 

704 

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

705 
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

706 
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

707 
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

708 
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

709 
real_of_int_mult reversed direction of equality (use [symmetric]) 
16891  710 

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

16888  712 

16962  713 
* Theory Ln is new, with properties of the natural logarithm 
714 

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

717 

718 
hypreal = real star 

719 
hypnat = nat star 

720 
hcomplex = complex star 

721 

722 
* Hyperreal: Many groups of similarlydefined constants have been 

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

723 
replaced by polymorphic versions (INCOMPATIBILITY): 
17423  724 

725 
star_of < hypreal_of_real, hypnat_of_nat, hcomplex_of_complex 

726 

727 
starset < starsetNat, starsetC 

728 
*s* < *sNat*, *sc* 

729 
starset_n < starsetNat_n, starsetC_n 

730 
*sn* < *sNatn*, *scn* 

731 
InternalSets < InternalNatSets, InternalCSets 

732 

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

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

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

737 
InternalFuns < InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs 
17423  738 

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

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

741 

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

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

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

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

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

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

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

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

750 
mult_1_left < {hypreal,hypnat}_mult_1, hcomplex_mult_one_left 
17423  751 
mult_1_right < hcomplex_mult_one_right 
752 
mult_zero_left < hcomplex_mult_zero_left 

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

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

755 
zero_neq_one < {hypreal,hypnat,hcomplex}_zero_not_eq_one 
17423  756 
right_inverse < hypreal_mult_inverse 
757 
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

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

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

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

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

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

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

764 
mult_strict_left_mono < {hypreal,hypnat}_mult_less_mono2 
17423  765 
add_nonneg_nonneg < hypreal_le_add_order 
766 

767 
* Hyperreal: Separate theorems having to do with typespecific 

768 
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

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

770 

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

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

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

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

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

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

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

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

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

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

780 
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

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

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

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

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

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

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

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

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

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

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

791 
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

792 
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

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

794 
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

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

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

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

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

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

800 
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

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

802 
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

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

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

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

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

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

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

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

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

814 
starfun_add_capprox < starfun{C,RC}_add_capprox 
17423  815 
starfun_add_approx < starfunCR_add_approx 
816 
starfun_inverse_inverse < starfunC_inverse_inverse 

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

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

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

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

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

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

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

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

825 

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

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

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

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

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

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

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

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

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

834 
star_n_one_num < {hypreal,hypnat,hcomplex}_one_num 
17423  835 
star_n_abs < hypreal_hrabs 
836 
star_n_divide < hcomplex_divide 

837 

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

838 
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

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

841 
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

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

843 
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

844 
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

845 
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

846 
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

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

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

849 
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

850 
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

851 
star_of_number_of < {hypreal,hcomplex}_number_of 
17423  852 
star_of_number_less < number_of_less_hypreal_of_real_iff 
853 
star_of_number_le < number_of_le_hypreal_of_real_iff 

854 
star_of_eq_number < hypreal_of_real_eq_number_of_iff 

855 
star_of_less_number < hypreal_of_real_less_number_of_iff 

856 
star_of_le_number < hypreal_of_real_le_number_of_iff 

857 
star_of_power < hypreal_of_real_power 

858 
star_of_eq_0 < hcomplex_of_complex_zero_iff 

859 

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

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

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

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

863 
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

864 
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

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

866 

17641  867 
* Hyperreal: A theory of Taylor series. 
868 

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

869 

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

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

871 

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

874 
typeinference. 

875 

876 
* New simplification procedure for solving continuity conditions; it 

877 
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

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

879 

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

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

882 

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

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

884 

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

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

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

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

890 
syntax and examples. 

891 

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

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

894 
but the proof obligation additionally includes an admissibility 

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

896 
with continuity and strictness theorems for Rep and Abs. 

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

897 

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

900 

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

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

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

904 
foo_strict: "foo$UU = UU" 

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

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

907 

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

908 

14885  909 
*** ZF *** 
910 

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

913 
of a homomorphism). 

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

914 

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

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

15703  918 

919 

17445  920 
*** Cube *** 
921 

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

923 
theories. 

924 

925 

15703  926 
*** ML *** 
927 

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

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

932 
accordingly, while Option.map replaces apsome. 

15973  933 

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

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

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

936 
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

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

938 

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

939 
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

940 
toplevel, as they are variants of predefined functions. The following 
16234  941 
suggests how one can translate existing code: 
15973  942 

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

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

945 
last_elem xs = List.last xs 

946 
flat xss = List.concat xss 

16234  947 
seq fs = List.app fs 
15973  948 
partition P xs = List.partition P xs 
949 
mapfilter f xs = List.mapPartial f xs 

950 

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

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

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

953 

17371  954 
x > f f #> g 
955 
(x, y) > f f #> g 

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

956 

17495  957 
* Pure/library.ML: introduced/changed precedence of infix operators: 
958 

959 
infix 1 > > > >> >> >>> #> #>; 

960 
infix 2 ?; 

961 
infix 3 o oo ooo oooo; 

962 
infix 4 ~~ upto downto; 

963 

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

965 
infix operators. 

966 

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

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

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

970 

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

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

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

973 

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

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

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

976 

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

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

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

979 

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

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

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

982 

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

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

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

985 

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

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

987 
these: 'a option > 'a where 'a = 'b list 
17402  988 
the_default: 'a > 'a option > 'a 
989 
the_list: 'a option > 'a list 

990 

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

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

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

996 

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

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

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

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

1000 

17564  1001 
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides 
1002 

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

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

1005 

1006 
replacing make_keylist and keyfilter (occassionally used) 

1007 
Naive rewrites: 

1008 

1009 
make_keylist = AList.make 

1010 
keyfilter = AList.find (op =) 

1011 

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

1013 
avoiding eqtypes. Naive rewrites: 

1014 

1015 
eq_fst = eq_fst (op =) 

1016 
eq_snd = eq_snd (op =) 

1017 

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

1019 
Naive rewrites: 

1020 

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

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

1023 

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

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

1025 
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

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

1027 

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

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

1029 
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

1030 
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

1031 
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

1032 

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

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

1034 
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

1035 
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

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

1037 
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

1038 
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

1039 
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

1040 
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

1041 
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

1042 
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

1043 
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

1044 
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

1045 
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

1046 
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

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

1048 

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

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

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

1051 
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

1052 

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

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

1054 
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

1055 
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

1056 
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

1057 

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

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

1059 
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

1060 
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

1061 
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

1062 
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

1063 
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

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

1065 

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

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

1067 
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

1068 
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

1069 
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

1070 

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

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

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

1076 
name; NameSpace.extend is superceded by context dependent 

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

1078 
the naming context. Especially note Theory.restore_naming and 

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

1080 
Theory.add_path is no longer sufficient to recover from 

1081 
Theory.absolute_path in particular. 

1082 

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

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

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

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

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

1088 
with earlier declarations. 

16151  1089 

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

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

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

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

1093 

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

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

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

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

1097 
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

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

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

1100 

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

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

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

1103 

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

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

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

1106 

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

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

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

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

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

1111 

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

1112 
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

1113 
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

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

1115 

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

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

1117 

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

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

1119 
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

1120 
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

1121 
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

1122 

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

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

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

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

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

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

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

1129 
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

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

1131 

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

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

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

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

1135 

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

16151  1139 

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

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

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

1142 

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

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

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

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

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

1147 

16718  1148 
* Pure: print_tac now outputs the goal through the trace channel. 
1149 

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

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

1151 
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

1152 
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

1153 
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

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

1155 

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

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

1157 
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

1158 
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

1159 

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

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

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

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

1165 
for further details. 

16234  1166 

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

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

1170 
scripts for the time being. 

1171 

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

1174 

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

17538  1176 
HTML.with_charset "utf8" use_thy "Chinese"; 
17457  1177 

16234  1178 

1179 
*** System *** 

1180 

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

1182 
isabelle, isatool etc.). 

1183 

1184 
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for 

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

1186 

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

1188 
used by Isabelle; default is ROOT.ML. 

1189 

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

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

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

1192 

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

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

15703  1196 

1197 

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

1198 

14606  1199 
New in Isabelle2004 (April 2004) 
1200 
 

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

1201 

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

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

1203 

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

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

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

1206 

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

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

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

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

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

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

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

1216 
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

1217 

14237  1218 
* Pure: Macintosh and Windows linebreaks are now allowed in theory files. 
1219 

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

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

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

14233  1224 

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

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

14333  1229 

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

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

1233 

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

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

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

14224  1238 
rather than definitionally, such as the metalogic connectives. 
1239 

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

1242 

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

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

1247 

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

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

1249 

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

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

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

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

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

1254 
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

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

1256 
 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

1257 
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

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

1259 

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

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

1261 
 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

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

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

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

1265 

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

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

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

1268 
and derived forms. 
14283  1269 

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

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

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

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

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

1274 
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

1275 
 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

1276 
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

1277 
 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

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

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

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

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

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

1286 
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

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

1290 
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

1291 

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

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

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

1294 

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

1295 

14136  1296 
*** HOL *** 
1297 

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

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

1301 
can be used like any other Isabelle image. See 

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

1303 

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

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

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

1306 
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

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

1308 
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

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

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

1311 
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

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

1313 

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

1317 
* Numerics: 

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

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

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

14389  1325 

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

14255  1328 
* Records: 
1329 
 Record types are now by default printed with their type abbreviation 

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

1331 
the reference "print_record_type_abbr". 

14731  1332 
 Simproc "record_upd_simproc" for simplification of multiple updates added 
14255  1333 
(not enabled by default). 
14427  1334 
 Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp. 
1335 
EX x. x = sel r to True (not enabled by default). 

14255  1336 
 Tactic "record_split_simp_tac" to split and simplify records added. 
14731  1337 

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

14136  1341 

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

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

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

1345 

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

14731  1349 
* HOLMatrix: a first theory for matrices in HOL with an application of 
14610  1350 
matrix theory to linear programming. 
14136  1351 

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

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

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

14380  1357 

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

14418  1361 
like in normal math, and corresponding versions for < and for intersection. 
1362 

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

1365 

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

14380  1368 

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

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

1372 

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

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

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

1377 
for examples. 

14464  1378 

14606  1379 

14536  1380 
*** HOLCF *** 
1381 

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

1383 

14572  1384 

1385 

14136  1386 
New in Isabelle2003 (May 2003) 
14606  1387 
 
14136  1388 

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

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

1390 

13618  1391 
* Provers/simplifier: 
1392 

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

1396 
the order of assumptions. 

1397 

1398 
Potential INCOMPATIBILITY: 

1399 

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

13618  1402 

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

1404 

13781  1405 
now gives rise to the infinite reduction sequence 
1406 

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

1408 

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