author  nipkow 
Sun, 09 Apr 2006 14:31:37 +0200  
changeset 19377  1f717bd6b7ea 
parent 19363  667b5ea637dd 
child 19508  d5236f5b0a71 
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 

19254  37 
* Command 'no_translations' removes translation rules from theory 
38 
syntax. 

39 

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

42 

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

44 
then guess x and y by clarify 

45 

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

47 
proof tools being involved here. 

48 

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

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

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

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

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

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

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

57 

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

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

18020  61 

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

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

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

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

66 

18308  67 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
68 

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

70 

18540  71 
* Isar: added command 'unfolding', which is structurally similar to 
72 
'using', but affects both the goal state and facts by unfolding given 

18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

73 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  74 
'unfolded' attribute may be replaced by firstclass proof text. 
75 

18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

76 
* Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded', 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

77 
and command 'unfolding' now all support objectlevel equalities 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

78 
(potentially conditional). The underlying notion of rewrite rule is 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

79 
analogous to the 'rule_format' attribute, but *not* that of the 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

80 
Simplifier (which is usually more generous). 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

81 

19220  82 
* Isar: the goal restriction operator [N] (default N = 1) evaluates a 
83 
method expression within a sandbox consisting of the first N 

19240  84 
subgoals, which need to exist. For example, ``simp_all [3]'' 
85 
simplifies the first three subgoals, while (rule foo, simp_all)[] 

86 
simplifies all new goals that emerge from applying rule foo to the 

87 
originally first one. 

19220  88 

18901  89 
* Isar: the conclusion of a long theorem statement is now either 
90 
'shows' (a simultaneous conjunction, as before), or 'obtains' 

91 
(essentially a disjunction of cases with local parameters and 

92 
assumptions). The latter allows to express general elimination rules 

18910  93 
adequately; in this notation common elimination rules look like this: 
18901  94 

95 
lemma exE:  "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis" 

96 
assumes "EX x. P x" 

97 
obtains x where "P x" 

98 

99 
lemma conjE:  "A & B ==> (A ==> B ==> thesis) ==> thesis" 

100 
assumes "A & B" 

101 
obtains A and B 

102 

103 
lemma disjE:  "A  B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis" 

104 
assumes "A  B" 

105 
obtains 

106 
A 

107 
 B 

108 

18910  109 
The subsequent classical rules even refer to the formal "thesis" 
18901  110 
explicitly: 
111 

112 
lemma classical:  "(~ thesis ==> thesis) ==> thesis" 

113 
obtains "~ thesis" 

114 

18910  115 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
116 
obtains "thesis ==> something" 

18901  117 

118 
The actual proof of an 'obtains' statement is analogous to that of the 

18910  119 
Isar proof element 'obtain', only that there may be several cases. 
120 
Optional case names may be specified in parentheses; these will be 

121 
available both in the present proof and as annotations in the 

122 
resulting rule, for later use with the 'cases' method (cf. attribute 

123 
case_names). 

18901  124 

19263  125 
* Isar: 'print_statement' prints theorems from the current theory or 
126 
proof context in long statement form, according to the syntax of a 

127 
toplevel lemma. 

128 

18901  129 
* Isar: 'obtain' takes an optional case name for the local context 
130 
introduction rule (default "that"). 

131 

19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

132 
* Isar/locales: new derived specification elements 'definition', 
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

133 
'abbreviation', 'axiomatization', which support typeinference, admit 
19083  134 
objectlevel specifications (equality, equivalence). See also the 
135 
isarref manual. Examples: 

19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

136 

085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

137 
definition 
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

138 
"f x y = x + y + 1" 
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

139 
"g x = f x x" 
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

140 

085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

141 
thm f_def g_def 
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

142 

085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

143 
axiomatization 
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

144 
eq (infix "===" 50) 
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

145 
where eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

146 

19363  147 
abbreviation 
19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

148 
neq (infix "=!=" 50) 
19363  149 
"x =!= y == ~ (x === y)" 
19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

150 

19083  151 
These specifications may be also used in a locale context. Then the 
152 
constants being introduced depend on certain fixed parameters, and the 

153 
constant name is qualified by the locale base name. An internal 

154 
abbreviation takes care for convenient input and output, making the 

19088  155 
parameters implicit and using the original short name. See also 
19083  156 
HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic 
157 
entities from a monomorphic theory. 

158 

159 
Presently, abbreviations are only available 'in' a target locale, but 

19363  160 
not inherited by general import expressions. Also note that 
161 
'abbreviation' may be used as a typesafe replacement for 'syntax' + 

162 
'translations' in common applications. 

19084  163 

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

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

167 
(using objectlogic connectives for this purpose has been long 

168 
obsolete anyway). The subsequent proof patterns illustrate advanced 

169 
techniques of natural induction; general datatypes and inductive sets 

18267  170 
work analogously (see also src/HOL/Lambda for realistic examples). 
171 

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

18239  173 
parameters: 
18233  174 

175 
lemma 

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

177 
assumes a: "A n x" 

178 
shows "P n x" 

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

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

18248  181 
case 0 
18233  182 
show ?case sorry 
183 
next 

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

18233  187 
show ?case sorry 
188 
qed 

189 

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

195 
lemma 

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

197 
assumes a: "A (a x)" 

198 
shows "P (a x)" 

199 
using a 

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

201 
... 

202 

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

205 

18901  206 
(3) This is how to perform existential reasoning ('obtains' or 
207 
'obtain') by induction, while avoiding explicit objectlogic 

208 
encodings: 

209 

210 
lemma 

211 
fixes n :: nat 

212 
obtains x :: 'a where "P n x" and "Q n x" 

18267  213 
proof (induct n fixing: thesis) 
214 
case 0 

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

18399  216 
then show thesis by (rule 0) 
18267  217 
next 
218 
case (Suc n) 

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

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

221 
then show thesis by (rule Suc.prems) 

222 
qed 

223 

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

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

226 
existence statement through the induction as expected. 

18233  227 

18506
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

228 
* Provers/induct: mutual induction rules are now specified as a list 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

229 
of rule sharing the same induction cases. HOL packages usually 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

230 
provide foo_bar.inducts for mutually defined items foo and bar 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

231 
(e.g. inductive sets or datatypes). INCOMPATIBILITY, users need to 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

232 
specify mutual induction rules differently, i.e. like this: 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

233 

96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

234 
(induct rule: foo_bar.inducts) 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

235 
(induct set: foo bar) 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

236 
(induct type: foo bar) 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

237 

96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

238 
The ML function ProjectRule.projections turns oldstyle rules into the 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

239 
new format. 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

240 

96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

241 
* Provers/induct: improved handling of simultaneous goals. Instead of 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

242 
introducing objectlevel conjunction, the statement is now split into 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

243 
several conclusions, while the corresponding symbolic cases are 
18601
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

244 
nested accordingly. INCOMPATIBILITY, proofs need to be structured 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

245 
explicitly. For example: 
18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

246 

8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

247 
lemma 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

248 
fixes n :: nat 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

249 
shows "P n" and "Q n" 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

250 
proof (induct n) 
18601
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

251 
case 0 case 1 
18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

252 
show "P 0" sorry 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

253 
next 
18601
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

254 
case 0 case 2 
18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

255 
show "Q 0" sorry 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

256 
next 
18601
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

257 
case (Suc n) case 1 
18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

258 
note `P n` and `Q n` 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

259 
show "P (Suc n)" sorry 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

260 
next 
18601
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

261 
case (Suc n) case 2 
18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

262 
note `P n` and `Q n` 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

263 
show "Q (Suc n)" sorry 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

264 
qed 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

265 

18601
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

266 
The split into subcases may be deferred as follows  this is 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

267 
particularly relevant for goal statements with local premises. 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

268 

b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

269 
lemma 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

270 
fixes n :: nat 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

271 
shows "A n ==> P n" and "B n ==> Q n" 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

272 
proof (induct n) 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

273 
case 0 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

274 
{ 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

275 
case 1 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

276 
note `A 0` 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

277 
show "P 0" sorry 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

278 
next 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

279 
case 2 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

280 
note `B 0` 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

281 
show "Q 0" sorry 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

282 
} 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

283 
next 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

284 
case (Suc n) 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

285 
note `A n ==> P n` and `B n ==> Q n` 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

286 
{ 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

287 
case 1 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

288 
note `A (Suc n)` 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

289 
show "P (Suc n)" sorry 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

290 
next 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

291 
case 2 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

292 
note `B (Suc n)` 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

293 
show "Q (Suc n)" sorry 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

294 
} 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

295 
qed 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

296 

18506
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

297 
If simultaneous goals are to be used with mutual rules, the statement 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

298 
needs to be structured carefully as a twolevel conjunction, using 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

299 
lists of propositions separated by 'and': 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

300 

18507  301 
lemma 
302 
shows "a : A ==> P1 a" 

303 
"a : A ==> P2 a" 

304 
and "b : B ==> Q1 b" 

305 
"b : B ==> Q2 b" 

306 
"b : B ==> Q3 b" 

307 
proof (induct set: A B) 

18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

308 

18399  309 
* Provers/induct: support coinduction as well. See 
310 
src/HOL/Library/Coinductive_List.thy for various examples. 

311 

18674  312 
* Simplifier: by default the simplifier trace only shows top level rewrites 
313 
now. That is, trace_simp_depth_limit is set to 1 by default. Thus there is 

314 
less danger of being flooded by the trace. The trace indicates where parts 

315 
have been suppressed. 

316 

18536
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

317 
* Provers/classical: removed obsolete classical version of elim_format 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

318 
attribute; classical elim/dest rules are now treated uniformly when 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

319 
manipulating the claset. 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

320 

18694  321 
* Provers/classical: stricter checks to ensure that supplied intro, 
322 
dest and elim rules are wellformed; dest and elim rules must have at 

323 
least one premise. 

324 

325 
* Provers/classical: attributes dest/elim/intro take an optional 

18695  326 
weight argument for the rule (just as the Pure versions). Weights are 
18696  327 
ignored by automated tools, but determine the search order of single 
18694  328 
rule steps. 
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18549
diff
changeset

329 

18536
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

330 
* Syntax: input syntax now supports dummy variable binding "%_. b", 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

331 
where the body does not mention the bound variable. Note that dummy 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

332 
patterns implicitly depend on their context of bounds, which makes 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

333 
"{_. _}" match any set comprehension as expected. Potential 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

334 
INCOMPATIBILITY  parse translations need to cope with syntactic 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

335 
constant "_idtdummy" in the binding position. 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

336 

ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

337 
* Syntax: removed obsolete syntactic constant "_K" and its associated 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

338 
parse translation. INCOMPATIBILITY  use dummy abstraction instead, 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

339 
for example "A > B" => "Pi A (%_. B)". 
17779  340 

17865  341 

17806  342 
*** HOL *** 
343 

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

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

347 

19279  348 
* Renamed constants in HOL.thy and Orderings.thy: 
19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

349 
op + ~> HOL.plus 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

350 
op  ~> HOL.minus 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

351 
uminus ~> HOL.uminus 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

352 
op * ~> HOL.times 
19277  353 
op < ~> Orderings.less 
354 
op <= ~> Orderings.less_eq 

19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

355 

77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

356 
Adaptions may be required in the following cases: 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

357 

19377  358 
a) Userdefined constants using any of the names "plus", "minus", "times", 
359 
"less" or "less_eq". The standard syntax translations for "+", "" and "*" 

360 
may go wrong. 

19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

361 
INCOMPATIBILITY: use more specific names. 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

362 

19277  363 
b) Variables named "plus", "minus", "times", "less", "less_eq" 
19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

364 
INCOMPATIBILITY: use more specific names. 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

365 

19377  366 
c) Permutative equations (e.g. "a + b = b + a") 
367 
Since the change of names also changes the order of terms, permutative 

368 
rewrite rules may get applied in a different order. Experience shows that 

369 
this is rarely the case (only two adaptions in the whole Isabelle 

370 
distribution). 

371 
INCOMPATIBILITY: rewrite proofs 

19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

372 

77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

373 
d) ML code directly refering to constant names 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

374 
This in general only affects handwritten proof tactics, simprocs and so on. 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

375 
INCOMPATIBILITY: grep your sourcecode and replace names. 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

376 

18674  377 
* "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only). 
378 

19377  379 
* The old set interval syntax "{m..n(}" (and relatives) has been removed. 
380 
Use "{m..<n}" (and relatives) instead. 

381 

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

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

17779  385 

18979  386 
* "m dvd n" where m and n are numbers is evaluated to True/False by simp. 
387 

19211  388 
* Theorem Cons_eq_map_conv no longer has attribute `simp'. 
389 

19279  390 
* Theorem setsum_mult renamed to setsum_right_distrib. 
391 

19211  392 
* Prefer ex1I over ex_ex1I in singlestep reasoning, e.g. by the 
393 
'rule' method. 

394 

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

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

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

399 

18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

400 
* inductive and datatype: provide projections of mutual rules, bundled 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

401 
as foo_bar.inducts; 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

402 

18446  403 
* Library: added theory Coinductive_List of potentially infinite lists 
404 
as greatest fixedpoint. 

18399  405 

19254  406 
* Library: added theory AssocList which implements (finite) maps as 
19252  407 
association lists. 
17809
195045659c06
Tactics sat and satx reimplemented, several improvements
webertj
parents:
17806
diff
changeset

408 

19254  409 

17878  410 
*** ML *** 
411 

18450
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

412 
* Pure/library: 
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

413 

e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

414 
val burrow: ('a list > 'b list) > 'a list list > 'b list list 
18549
5308a6ea3b96
rearranged burrow_split to fold_burrow to allow composition with fold_map
haftmann
parents:
18540
diff
changeset

415 
val fold_burrow: ('a list > 'c > 'b list * 'd) > 'a list list > 'c > 'b list list * 'd 
18450
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

416 

18540  417 
The semantics of "burrow" is: "take a function with *simulatanously* 
418 
transforms a list of value, and apply it *simulatanously* to a list of 

419 
list of values of the appropriate type". Confer this with "map" which 

420 
would *not* apply its argument function simulatanously but in 

18549
5308a6ea3b96
rearranged burrow_split to fold_burrow to allow composition with fold_map
haftmann
parents:
18540
diff
changeset

421 
sequence. "fold_burrow" has an additional context. 
18540  422 

423 
Both actually avoid the usage of "unflat" since they hide away 

424 
"unflat" from the user. 

18450
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

425 

18446  426 
* Pure/library: functions map2 and fold2 with curried syntax for 
427 
simultanous mapping and folding: 

428 

18422
875451c9d253
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18399
diff
changeset

429 
val map2: ('a > 'b > 'c) > 'a list > 'b list > 'c list 
875451c9d253
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18399
diff
changeset

430 
val fold2: ('a > 'b > 'c > 'c) > 'a list > 'b list > 'c > 'c 
875451c9d253
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18399
diff
changeset

431 

18446  432 
* Pure/library: indexed lists  some functions in the Isabelle library 
433 
treating lists over 'a as finite mappings from [0...n] to 'a have been 

434 
given more convenient names and signatures reminiscent of similar 

435 
functions for alists, tables, etc: 

18051  436 

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

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

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

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

441 

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

444 

19032  445 
* Pure/General/name_mangler.ML provides a functor for generic name 
18446  446 
mangling (bijective mapping from any expression values to strings). 
447 

19032  448 
* Pure/General/rat.ML implements rational numbers. 
449 

450 
* Pure/General/table.ML: the join operations now works via exceptions 

19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

451 
DUP/SAME instead of type option. This is simpler in simple cases, and 
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

452 
admits slightly more efficient complex applications. 
18446  453 

18642  454 
* Pure: datatype Context.generic joins theory/Proof.context and 
18644  455 
provides some facilities for code that works in either kind of 
18642  456 
context, notably GenericDataFun for uniform theory and proof data. 
457 

18862
bd83590be0f7
* Pure: 'advanced' translation functions use Context.generic instead of just theory;
wenzelm
parents:
18815
diff
changeset

458 
* Pure: 'advanced' translation functions (parse_translation etc.) now 
bd83590be0f7
* Pure: 'advanced' translation functions use Context.generic instead of just theory;
wenzelm
parents:
18815
diff
changeset

459 
use Context.generic instead of just theory. 
bd83590be0f7
* Pure: 'advanced' translation functions use Context.generic instead of just theory;
wenzelm
parents:
18815
diff
changeset

460 

18737  461 
* Pure: simplified internal attribute type, which is now always 
462 
Context.generic * thm > Context.generic * thm. Global (theory) 

463 
vs. local (Proof.context) attributes have been discontinued, while 

18738  464 
minimizing code duplication. Thm.rule_attribute and 
465 
Thm.declaration_attribute build canonical attributes; see also 

19006
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

466 
structure Context for further operations on Context.generic, notably 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

467 
GenericDataFun. INCOMPATIBILITY, need to adapt attribute type 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

468 
declarations and definitions. 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

469 

2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

470 
* Pure/Isar: Args/Attrib parsers operate on Context.generic  
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

471 
global/local versions on theory vs. Proof.context have been 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

472 
discontinued; Attrib.syntax and Method.syntax have been adapted 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

473 
accordingly. INCOMPATIBILITY, need to adapt parser expressions for 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

474 
attributes, methods, etc. 
18642  475 

18446  476 
* Pure: several functions of signature "... > theory > theory * ..." 
477 
have been reoriented to "... > theory > ... * theory" in order to 

478 
allow natural usage in combination with the >, >>, > and 

479 
fold_map combinators. 

18051  480 

18020  481 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  482 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  483 
achieve the old behaviour. 
484 

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

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

487 
statements. 

488 

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

490 
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

491 
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

492 
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

493 
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

494 

18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

495 
* Isar: simplified treatment of userlevel errors, using exception 
18687  496 
ERROR of string uniformly. Function error now merely raises ERROR, 
18686
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

497 
without any side effect on output channels. The Isar toplevel takes 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

498 
care of proper display of ERROR exceptions. ML code may use plain 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

499 
handle/can/try; cat_error may be used to concatenate errors like this: 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

500 

cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

501 
... handle ERROR msg => cat_error msg "..." 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

502 

cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

503 
Toplevel ML code (run directly or through the Isar toplevel) may be 
18687  504 
embedded into the Isar toplevel with exception display/debug like 
505 
this: 

18686
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

506 

cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

507 
Isar.toplevel (fn () => ...) 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

508 

cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

509 
INCOMPATIBILITY, removed special transform_error facilities, removed 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

510 
obsolete variants of userlevel exceptions (ERROR_MESSAGE, 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

511 
Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL) 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

512 
 use plain ERROR instead. 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

513 

18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

514 
* Isar: theory setup now has type (theory > theory), instead of a 
18722
0888eca0f1be
* ML/Isar: theory setup has type (theory > theory);
wenzelm
parents:
18696
diff
changeset

515 
list. INCOMPATIBILITY, may use #> to compose setup functions. 
0888eca0f1be
* ML/Isar: theory setup has type (theory > theory);
wenzelm
parents:
18696
diff
changeset

516 

18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

517 
* Isar: installed ML toplevel pretty printer for type Proof.context, 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

518 
subject to ProofContext.debug/verbose flags. 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

519 

cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

520 
* Isar: Toplevel.theory_to_proof admits transactions that modify the 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

521 
theory before entering a proof state. Transactions now always see a 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

522 
quasifunctional intermediate checkpoint, both in interactive and 
18590
f6a553aa3d81
Pure/Isar: Toplevel.theory_to_proof admits transactions that modify the theory;
wenzelm
parents:
18568
diff
changeset

523 
batch mode. 
18567  524 

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

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

17890  528 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  529 
(solver, looper etc.) may depend on arbitrary proof data. 
530 

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

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

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

534 
former Simplifier.inherit_bounds, which is already included here  

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

17878  537 

538 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

541 
INCOMPATIBILITY. 

542 

18540  543 
* Provers: more generic wrt. syntax of objectlogics, avoid hardwired 
544 
"Trueprop" etc. 

545 

17878  546 

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

547 

17720  548 
New in Isabelle2005 (October 2005) 
549 
 

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

550 

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

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

552 

15130  553 
* Theory headers: the new header syntax for Isar theories is 
554 

555 
theory <name> 

16234  556 
imports <theory1> ... <theoryN> 
557 
uses <file1> ... <fileM> 

15130  558 
begin 
559 

16234  560 
where the 'uses' part is optional. The previous syntax 
561 

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

563 

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

17371  566 
nonIsar theories now, but these will disappear soon. 
15130  567 

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

568 
* Theory loader: parent theories can now also be referred to via 
16234  569 
relative and absolute paths. 
570 

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

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

572 
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

573 
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

574 
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

575 
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

576 
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

577 
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

578 
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

579 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  580 

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

581 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  582 

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

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

585 
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

586 

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

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

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

589 

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

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

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

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

17385  597 

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

600 
faster. 

601 

15703  602 

603 
*** Document preparation *** 

604 

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

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

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

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

610 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

611 

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

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

613 
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

614 
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

615 
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

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

617 
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

618 
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

619 
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

620 
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

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

622 

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

623 
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

624 
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

625 
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

626 
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

627 
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

628 
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

629 
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

630 
specified above. 
16234  631 

17402  632 
* Several new antiquotations: 
15979  633 

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

635 

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

637 

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

15979  640 

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

16234  642 
theorem applying a "style" to it 
643 

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

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

645 

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

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

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

652 
typechecked ML expressions verbatim. 
16234  653 

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

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

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

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

658 

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

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

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

662 

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

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

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

665 

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

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

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

668 

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

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

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

671 

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

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

673 
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

674 
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

675 

16234  676 

677 
*** Pure *** 

678 

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

680 
automatic typeinference of declared constants; additional support for 

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

682 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

683 
sequential dependencies of definitions within a single 'constdefs' 

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

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

686 

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

688 
indexed syntax provides a notational device for subscripted 

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

690 
expressions. Secondly, in a local context with structure 

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

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

693 
show_structs controls printing of implicit structures. Typical 

694 
applications of these concepts involve record types and locales. 

695 

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

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

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

699 

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

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

702 
parsing/printing, see also isarref manual. 

703 

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

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

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

708 
INCOMPATIBILITY. 

709 

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

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

711 
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

712 
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

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

714 

16234  715 
* Improved internal renaming of symbolic identifiers  attach primes 
716 
instead of base 26 numbers. 

717 

718 
* New flag show_question_marks controls printing of leading question 

719 
marks in schematic variable names. 

720 

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

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

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

724 

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

726 
by simp 

727 

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

729 

17548  730 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  731 
annotations as "(00...)". 
732 

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

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

735 
Before that distinction was only partially implemented via type class 

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

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

738 
exotic syntax specifications may require further adaption 

17691  739 
(e.g. Cube/Cube.thy). 
16234  740 

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

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

743 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

744 
specifications. 

745 

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

748 

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

751 
Limit. 

752 

753 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

759 
allow for use in a context of fixed variables. 

760 

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

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

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

764 

17597  765 
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. 
17590  766 

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

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

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

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

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

773 

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

775 
selections of theorems in named facts via index ranges. 

776 

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

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

778 
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

779 
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

780 

17397  781 
* 'hide': option '(open)' hides only base names. 
782 

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

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

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

785 

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

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

789 
must be quoted when used as identifiers. 

790 

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

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

793 
quoted when used as identifier. 

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

794 

16234  795 

796 
*** Locales *** 

17095  797 

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

800 
proof obligations from the expression specification. After the 

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

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

803 
commands is a follows: 

804 

17095  805 
(1) interpretation expr inst 
806 
(2) interpretation target < expr 

807 
(3) interpret expr inst 

17385  808 

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

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

813 
locale expression. Interpretation is smart in that interpretations 

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

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

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

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

16234  819 

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

821 
'interpret' instead. 

822 

17385  823 
* New context element 'constrains' for adding type constraints to 
824 
parameters. 

825 

826 
* Context expressions: renaming of parameters with syntax 

827 
redeclaration. 

17095  828 

829 
* Locale declaration: 'includes' disallowed. 

830 

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

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

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

835 
to attribute arguments as expected. 

836 

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

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

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

840 
Attribute implementations need to cooperate properly with the static 

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

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

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

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

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

846 
values to argument tokens explicitly. 

847 

848 
* Changed parameter management in theorem generation for long goal 

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

850 
theorem statement in rare situations. 

851 

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

854 

16234  855 

856 
*** Provers *** 

857 

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

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

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

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

862 
still available as 'simplesubst'. 

863 

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

865 
and quasi orders. 

866 

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

868 
reflexivetransitive closure of relations. 

869 

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

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

872 

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

874 
is peformed already. Objectlogics merely need to finish their 

875 
initial simpset configuration as before. INCOMPATIBILITY. 

15703  876 

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

877 

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

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

879 

16234  880 
* Symbolic syntax of Hilbert Choice Operator is now as follows: 
14878  881 

882 
syntax (epsilon) 

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

884 

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

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

888 
becomes available as variable, constant etc. INCOMPATIBILITY, 

889 

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

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

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

893 
support corresponding Isar calculations. 
16234  894 

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

896 
instead of ":". 

897 

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

899 

900 
Old New 

901 
{..n(} {..<n} 

902 
{)n..} {n<..} 

903 
{m..n(} {m..<n} 

904 
{)m..n} {m<..n} 

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

906 

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

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

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

15046  910 

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

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

913 

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

916 
interface. 

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

917 

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

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

923 
Some new syntax forms are available: 

924 

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

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

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

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

929 

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

931 
function "Summation", which has been discontinued. 

932 

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

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

935 
(insert F x)'. 

936 

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

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

939 
typedefs, inductive datatypes and recursion. 

940 

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

943 
HOL/ex/SAT_Examples.thy for examples. 

17619  944 

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

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

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

949 
in unstructured proof scripts. 

950 

951 
* Reworked implementation of records. Improved scalability for 

952 
records with many fields, avoiding performance problems for type 

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

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

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

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

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

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

959 
<record_name>_ext_type. 

960 

961 
Flag record_quick_and_dirty_sensitive can be enabled to skip the 

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

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

964 
quite long. 

965 

966 
New simproc record_upd_simproc for simplification of multiple record 

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

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

969 
occasionally, since simplification is more powerful by default. 

970 

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

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

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

973 

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

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

977 
old proofs break occasionally as simplification may now solve more 

978 
goals than previously. 

979 

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

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

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

983 
just like y <= x. 

984 

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

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

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

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

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

990 
enabled/disabled by the reference use_let_simproc. Potential 

991 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  992 

16563  993 
* Classical reasoning: the meson method now accepts theorems as arguments. 
994 

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

997 

16891  998 
* Theory OrderedGroup and Ring_and_Field: various additions and 
999 
improvements to faciliate calculations involving equalities and 

1000 
inequalities. 

1001 

1002 
The following theorems have been eliminated or modified 

1003 
(INCOMPATIBILITY): 

16888  1004 

1005 
abs_eq now named abs_of_nonneg 

17371  1006 
abs_of_ge_0 now named abs_of_nonneg 
1007 
abs_minus_eq now named abs_of_nonpos 

16888  1008 
imp_abs_id now named abs_of_nonneg 
1009 
imp_abs_neg_id now named abs_of_nonpos 

1010 
mult_pos now named mult_pos_pos 

1011 
mult_pos_le now named mult_nonneg_nonneg 

1012 
mult_pos_neg_le now named mult_nonneg_nonpos 

1013 
mult_pos_neg2_le now named mult_nonneg_nonpos2 

1014 
mult_neg now named mult_neg_neg 

1015 
mult_neg_le now named mult_nonpos_nonpos 

1016 

16891  1017 
* Theory Parity: added rules for simplifying exponents. 
1018 

17092  1019 
* Theory List: 
1020 

1021 
The following theorems have been eliminated or modified 

1022 
(INCOMPATIBILITY): 

1023 

1024 
list_all_Nil now named list_all.simps(1) 

1025 
list_all_Cons now named list_all.simps(2) 

1026 
list_all_conv now named list_all_iff 

1027 
set_mem_eq now named mem_iff 

1028 

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

1031 

16888  1032 

1033 
*** HOLComplex *** 

1034 

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

1037 

1038 
The following theorems have been eliminated or modified 

1039 
(INCOMPATIBILITY): 

1040 

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

1041 
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

1042 
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

1043 
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

1044 
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

1045 
real_of_int_mult reversed direction of equality (use [symmetric]) 
16891  1046 

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

16888  1048 

16962  1049 
* Theory Ln is new, with properties of the natural logarithm 
1050 

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

1053 

1054 
hypreal = real star 

1055 
hypnat = nat star 

1056 
hcomplex = complex star 

1057 

1058 
* Hyperreal: Many groups of similarlydefined constants have been 

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

1059 
replaced by polymorphic versions (INCOMPATIBILITY): 
17423  1060 

1061 
star_of < hypreal_of_real, hypnat_of_nat, hcomplex_of_complex 

1062 

1063 
starset < starsetNat, starsetC 

1064 
*s* < *sNat*, *sc* 

1065 
starset_n < starsetNat_n, starsetC_n 

1066 
*sn* < *sNatn*, *scn* 

1067 
InternalSets < InternalNatSets, InternalCSets 

1068 

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

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

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

1073 
InternalFuns < InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs 
17423  1074 

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

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

1077 

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

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

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

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

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

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

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

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

1086 
mult_1_left < {hypreal,hypnat}_mult_1, hcomplex_mult_one_left 
17423  1087 
mult_1_right < hcomplex_mult_one_right 
1088 
mult_zero_left < hcomplex_mult_zero_left 

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

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

1091 
zero_neq_one < {hypreal,hypnat,hcomplex}_zero_not_eq_one 
17423  1092 
right_inverse < hypreal_mult_inverse 
1093 
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

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

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

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

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

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

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

1100 
mult_strict_left_mono < {hypreal,hypnat}_mult_less_mono2 
17423  1101 
add_nonneg_nonneg < hypreal_le_add_order 
1102 

1103 
* Hyperreal: Separate theorems having to do with typespecific 

1104 
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

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

1106 

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

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

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

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

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

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

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

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

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

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

1116 
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

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

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

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

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

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

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

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

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

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

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

1127 
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

1128 
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

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

1130 
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

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

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

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

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

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

1136 
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

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

1138 
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

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

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

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

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

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

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

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

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

1150 
starfun_add_capprox < starfun{C,RC}_add_capprox 
17423  1151 
starfun_add_approx < starfunCR_add_approx 
1152 
starfun_inverse_inverse < starfunC_inverse_inverse 

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

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

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

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

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

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

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

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

1161 

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

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

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

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

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

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

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

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

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

1170 
star_n_one_num < {hypreal,hypnat,hcomplex}_one_num 
17423  1171 
star_n_abs < hypreal_hrabs 
1172 
star_n_divide < hcomplex_divide 

1173 

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

1174 
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

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

1177 
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

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

1179 
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

1180 
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

1181 
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

1182 
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

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

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

1185 
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

1186 
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

1187 
star_of_number_of < {hypreal,hcomplex}_number_of 
17423  1188 
star_of_number_less < number_of_less_hypreal_of_real_iff 
1189 
star_of_number_le < number_of_le_hypreal_of_real_iff 

1190 
star_of_eq_number < hypreal_of_real_eq_number_of_iff 

1191 
star_of_less_number < hypreal_of_real_less_number_of_iff 

1192 
star_of_le_number < hypreal_of_real_le_number_of_iff 

1193 
star_of_power < hypreal_of_real_power 

1194 
star_of_eq_0 < hcomplex_of_complex_zero_iff 

1195 

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

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

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

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

1199 
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

1200 
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

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

1202 

17641  1203 
* Hyperreal: A theory of Taylor series. 
1204 

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

1205 

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

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

1207 

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

1210 
typeinference. 

1211 

1212 
* New simplification procedure for solving continuity conditions; it 

1213 
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

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

1215 

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

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

1218 

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

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

1220 

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

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

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

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

1226 
syntax and examples. 

1227 

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

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

1230 
but the proof obligation additionally includes an admissibility 

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

1232 
with continuity and strictness theorems for Rep and Abs. 

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

1233 

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

1236 

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

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

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

1240 
foo_strict: "foo$UU = UU" 

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

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

1243 

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

1244 

14885  1245 
*** ZF *** 
1246 

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

1249 
of a homomorphism). 

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

1250 

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

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

15703  1254 

1255 

17445  1256 
*** Cube *** 
1257 

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

1259 
theories. 

1260 

1261 

15703  1262 
*** ML *** 
1263 

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

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

1268 
accordingly, while Option.map replaces apsome. 

15973  1269 

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

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

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

1272 
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

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

1274 

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

1275 
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

1276 
toplevel, as they are variants of predefined functions. The following 
16234  1277 
suggests how one can translate existing code: 
15973  1278 

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

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

1281 
last_elem xs = List.last xs 

1282 
flat xss = List.concat xss 

16234  1283 
seq fs = List.app fs 
15973  1284 
partition P xs = List.partition P xs 
1285 
mapfilter f xs = List.mapPartial f xs 

1286 

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

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

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

1289 

17371  1290 
x > f f #> g 
1291 
(x, y) > f f #> g 

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

1292 

17495  1293 
* Pure/library.ML: introduced/changed precedence of infix operators: 
1294 

1295 
infix 1 > > > >> >> >>> #> #>; 

1296 
infix 2 ?; 

1297 
infix 3 o oo ooo oooo; 

1298 
infix 4 ~~ upto downto; 

1299 

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

1301 
infix operators. 

1302 

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

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

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

1306 

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

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

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

1309 

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

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

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

1312 

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

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

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

1315 

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

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

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

1318 

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

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

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

1321 

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

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

1323 
these: 'a option > 'a where 'a = 'b list 
17402  1324 
the_default: 'a > 'a option > 'a 
1325 
the_list: 'a option > 'a list 

1326 

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

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

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

1332 

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

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

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

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

1336 

17564  1337 
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides 
1338 

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

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

1341 

1342 
replacing make_keylist and keyfilter (occassionally used) 

1343 
Naive rewrites: 

1344 

1345 
make_keylist = AList.make 

1346 
keyfilter = AList.find (op =) 

1347 

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

1349 
avoiding eqtypes. Naive rewrites: 

1350 

1351 
eq_fst = eq_fst (op =) 

1352 
eq_snd = eq_snd (op =) 

1353 

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

1355 
Naive rewrites: 

1356 

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

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

1359 

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

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

1361 
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

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

1363 

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

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

1365 
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

1366 
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

1367 
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

1368 

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

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

1370 
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

1371 
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

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

1373 
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

1374 
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

1375 
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

1376 
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

1377 
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

1378 
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

1379 
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

1380 
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

1381 
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

1382 
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

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

1384 

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

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

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

1387 
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

1388 

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

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

1390 
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

1391 
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

1392 
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

1393 

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

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

1395 
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

1396 
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

1397 
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

1398 
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

1399 
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

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

1401 

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

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

1403 
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

1404 
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

1405 
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

1406 

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

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

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

1412 
name; NameSpace.extend is superceded by context dependent 

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

421c3522f160
maj 