author  schirmer 
Mon, 13 Mar 2006 10:41:04 +0100  
changeset 19252  1f7c69a5faac 
parent 19240  3a73cb17a707 
child 19254  efaf5d47049e 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

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

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

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

6 

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

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

8 

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

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

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

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

12 

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

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

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

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

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

17 

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

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

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

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

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

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

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

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

25 

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

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

27 

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

28 

17865  29 
*** Document preparation *** 
30 

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

17865  33 

34 

17779  35 
*** Pure *** 
36 

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

39 

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

41 
then guess x and y by clarify 

42 

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

44 
proof tools being involved here. 

45 

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

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

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

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

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

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

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

54 

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

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

18020  58 

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

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

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

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

63 

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

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

67 

18540  68 
* Isar: added command 'unfolding', which is structurally similar to 
69 
'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

70 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  71 
'unfolded' attribute may be replaced by firstclass proof text. 
72 

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

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

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

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

76 
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

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

78 

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

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

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

84 
originally first one. 

19220  85 

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

88 
(essentially a disjunction of cases with local parameters and 

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

18910  90 
adequately; in this notation common elimination rules look like this: 
18901  91 

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

93 
assumes "EX x. P x" 

94 
obtains x where "P x" 

95 

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

97 
assumes "A & B" 

98 
obtains A and B 

99 

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

101 
assumes "A  B" 

102 
obtains 

103 
A 

104 
 B 

105 

18910  106 
The subsequent classical rules even refer to the formal "thesis" 
18901  107 
explicitly: 
108 

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

110 
obtains "~ thesis" 

111 

18910  112 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
113 
obtains "thesis ==> something" 

18901  114 

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

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

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

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

120 
case_names). 

18901  121 

122 
* Isar: 'obtain' takes an optional case name for the local context 

123 
introduction rule (default "that"). 

124 

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

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

126 
'abbreviation', 'axiomatization', which support typeinference, admit 
19083  127 
objectlevel specifications (equality, equivalence). See also the 
128 
isarref manual. Examples: 

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

129 

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

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

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

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

133 

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

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

135 

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

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

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

138 
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

139 

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

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

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

142 
"(x =!= y) <> ~ (x === y)" 
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

143 

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

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

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

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

151 

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

153 
not inherited by general import expressions. 

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

154 

19084  155 
Also note that 'abbreviation' may be used as a typesafe replacement 
156 
for 'syntax' + 'translations' in common applications. 

157 

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

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

161 
(using objectlogic connectives for this purpose has been long 

162 
obsolete anyway). The subsequent proof patterns illustrate advanced 

163 
techniques of natural induction; general datatypes and inductive sets 

18267  164 
work analogously (see also src/HOL/Lambda for realistic examples). 
165 

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

18239  167 
parameters: 
18233  168 

169 
lemma 

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

171 
assumes a: "A n x" 

172 
shows "P n x" 

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

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

18248  175 
case 0 
18233  176 
show ?case sorry 
177 
next 

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

18233  181 
show ?case sorry 
182 
qed 

183 

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

189 
lemma 

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

191 
assumes a: "A (a x)" 

192 
shows "P (a x)" 

193 
using a 

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

195 
... 

196 

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

199 

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

202 
encodings: 

203 

204 
lemma 

205 
fixes n :: nat 

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

18267  207 
proof (induct n fixing: thesis) 
208 
case 0 

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

18399  210 
then show thesis by (rule 0) 
18267  211 
next 
212 
case (Suc n) 

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

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

215 
then show thesis by (rule Suc.prems) 

216 
qed 

217 

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

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

220 
existence statement through the induction as expected. 

18233  221 

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

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

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

224 
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

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

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

227 

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

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

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

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

231 

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

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

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

234 

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

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

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

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

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

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

240 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

259 

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

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

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

262 

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

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

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

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

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

267 
case 0 
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 
case 1 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

290 

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

291 
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

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

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

294 

18507  295 
lemma 
296 
shows "a : A ==> P1 a" 

297 
"a : A ==> P2 a" 

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

299 
"b : B ==> Q2 b" 

300 
"b : B ==> Q3 b" 

301 
proof (induct set: A B) 

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

302 

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

305 

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

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

309 
have been suppressed. 

310 

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

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

312 
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

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

314 

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

317 
least one premise. 

318 

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

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

323 

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

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

325 
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

326 
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

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

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

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

330 

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

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

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

333 
for example "A > B" => "Pi A (%_. B)". 
17779  334 

17865  335 

17806  336 
*** HOL *** 
337 

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

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

341 

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

342 
* Renamed some (legacynamed) constants in HOL.thy: 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

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

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

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

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

347 

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

348 
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

349 

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

350 
a) Userdefined constants using any of the names "plus", "minus", or "times" 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

351 
The standard syntax translations for "+", "" and "*" may go wrong. 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

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

353 

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

354 
b) Variables named "plus", "minus", or "times" 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

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

356 

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

357 
c) Commutative equations theorems (e. g. "a + b = b + a") 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

358 
Since the changing of names also changes the order of terms, commutative rewrites 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

359 
perhaps will be applied when not applied before or the other way round. 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

360 
Experience shows that thiis is rarely the case (only two adaptions in the whole 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

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

362 
INCOMPATIBILITY: rewrite proof; sometimes already an exchange of a distributive 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

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

364 

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

365 
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

366 
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

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

368 

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

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

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

17779  374 

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

19211  377 
* Theorem Cons_eq_map_conv no longer has attribute `simp'. 
378 

379 
* Prefer ex1I over ex_ex1I in singlestep reasoning, e.g. by the 

380 
'rule' method. 

381 

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

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

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

386 

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

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

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

389 

18446  390 
* Library: added theory Coinductive_List of potentially infinite lists 
391 
as greatest fixedpoint. 

18399  392 

19252  393 
* Library: added theory AssocList which implements (finite) maps as 
394 
association lists. 

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

395 

17878  396 
*** ML *** 
397 

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

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

399 

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

400 
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

401 
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

402 

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

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

406 
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

407 
sequence. "fold_burrow" has an additional context. 
18540  408 

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

410 
"unflat" from the user. 

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

411 

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

414 

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

415 
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

416 
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

417 

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

420 
given more convenient names and signatures reminiscent of similar 

421 
functions for alists, tables, etc: 

18051  422 

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

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

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

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

427 

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

430 

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

19032  434 
* Pure/General/rat.ML implements rational numbers. 
435 

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

437 
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

438 
admits slightly more efficient complex applications. 
18446  439 

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

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

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

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

446 

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

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

18738  450 
minimizing code duplication. Thm.rule_attribute and 
451 
Thm.declaration_attribute build canonical attributes; see also 

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

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

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

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

455 

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

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

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

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

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

460 
attributes, methods, etc. 
18642  461 

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

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

465 
fold_map combinators. 

18051  466 

18020  467 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  468 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  469 
achieve the old behaviour. 
470 

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

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

473 
statements. 

474 

18567  475 
* 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

476 
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

477 
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

478 
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

479 
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

480 

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

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

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

484 
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

485 
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

486 

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

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

488 

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

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

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

492 

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

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

494 

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

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

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

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

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

499 

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

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

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

502 

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

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

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

505 

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

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

507 
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

508 
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

509 
batch mode. 
18567  510 

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

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

17890  514 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  515 
(solver, looper etc.) may depend on arbitrary proof data. 
516 

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

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

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

520 
former Simplifier.inherit_bounds, which is already included here  

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

17878  523 

524 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

527 
INCOMPATIBILITY. 

528 

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

531 

17878  532 

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

533 

17720  534 
New in Isabelle2005 (October 2005) 
535 
 

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

536 

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

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

538 

15130  539 
* Theory headers: the new header syntax for Isar theories is 
540 

541 
theory <name> 

16234  542 
imports <theory1> ... <theoryN> 
543 
uses <file1> ... <fileM> 

15130  544 
begin 
545 

16234  546 
where the 'uses' part is optional. The previous syntax 
547 

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

549 

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

17371  552 
nonIsar theories now, but these will disappear soon. 
15130  553 

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

554 
* Theory loader: parent theories can now also be referred to via 
16234  555 
relative and absolute paths. 
556 

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

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

558 
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

559 
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

560 
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

561 
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

562 
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

563 
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

564 
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

565 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  566 

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

567 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  568 

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

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

571 
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

572 

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

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

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

575 

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

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

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

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

17385  583 

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

586 
faster. 

587 

15703  588 

589 
*** Document preparation *** 

590 

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

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

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

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

596 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

597 

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

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

599 
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

600 
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

601 
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

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

603 
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

604 
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

605 
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

606 
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

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

608 

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

609 
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

610 
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

611 
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

612 
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

613 
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

614 
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

615 
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

616 
specified above. 
16234  617 

17402  618 
* Several new antiquotations: 
15979  619 

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

621 

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

623 

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

15979  626 

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

16234  628 
theorem applying a "style" to it 
629 

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

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

631 

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

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

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

638 
typechecked ML expressions verbatim. 
16234  639 

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

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

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

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

644 

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

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

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

648 

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

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

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

651 

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

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

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

654 

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

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

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

657 

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

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

659 
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

660 
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

661 

16234  662 

663 
*** Pure *** 

664 

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

666 
automatic typeinference of declared constants; additional support for 

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

668 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

669 
sequential dependencies of definitions within a single 'constdefs' 

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

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

672 

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

674 
indexed syntax provides a notational device for subscripted 

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

676 
expressions. Secondly, in a local context with structure 

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

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

679 
show_structs controls printing of implicit structures. Typical 

680 
applications of these concepts involve record types and locales. 

681 

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

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

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

685 

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

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

688 
parsing/printing, see also isarref manual. 

689 

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

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

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

694 
INCOMPATIBILITY. 

695 

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

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

697 
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

698 
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

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

700 

16234  701 
* Improved internal renaming of symbolic identifiers  attach primes 
702 
instead of base 26 numbers. 

703 

704 
* New flag show_question_marks controls printing of leading question 

705 
marks in schematic variable names. 

706 

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

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

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

710 

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

712 
by simp 

713 

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

715 

17548  716 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  717 
annotations as "(00...)". 
718 

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

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

721 
Before that distinction was only partially implemented via type class 

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

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

724 
exotic syntax specifications may require further adaption 

17691  725 
(e.g. Cube/Cube.thy). 
16234  726 

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

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

729 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

730 
specifications. 

731 

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

734 

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

737 
Limit. 

738 

739 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

745 
allow for use in a context of fixed variables. 

746 

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

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

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

750 

17597  751 
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. 
17590  752 

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

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

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

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

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

759 

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

761 
selections of theorems in named facts via index ranges. 

762 

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

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

764 
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

765 
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

766 

17397  767 
* 'hide': option '(open)' hides only base names. 
768 

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

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

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

771 

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

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

775 
must be quoted when used as identifiers. 

776 

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

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

779 
quoted when used as identifier. 

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

780 

16234  781 

782 
*** Locales *** 

17095  783 

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

786 
proof obligations from the expression specification. After the 

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

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

789 
commands is a follows: 

790 

17095  791 
(1) interpretation expr inst 
792 
(2) interpretation target < expr 

793 
(3) interpret expr inst 

17385  794 

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

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

799 
locale expression. Interpretation is smart in that interpretations 

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

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

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

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

16234  805 

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

807 
'interpret' instead. 

808 

17385  809 
* New context element 'constrains' for adding type constraints to 
810 
parameters. 

811 

812 
* Context expressions: renaming of parameters with syntax 

813 
redeclaration. 

17095  814 

815 
* Locale declaration: 'includes' disallowed. 

816 

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

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

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

821 
to attribute arguments as expected. 

822 

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

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

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

826 
Attribute implementations need to cooperate properly with the static 

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

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

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

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

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

832 
values to argument tokens explicitly. 

833 

834 
* Changed parameter management in theorem generation for long goal 

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

836 
theorem statement in rare situations. 

837 

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

840 

16234  841 

842 
*** Provers *** 

843 

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

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

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

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

848 
still available as 'simplesubst'. 

849 

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

851 
and quasi orders. 

852 

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

854 
reflexivetransitive closure of relations. 

855 

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

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

858 

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

860 
is peformed already. Objectlogics merely need to finish their 

861 
initial simpset configuration as before. INCOMPATIBILITY. 

15703  862 

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

863 

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

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

865 

16234  866 
* Symbolic syntax of Hilbert Choice Operator is now as follows: 
14878  867 

868 
syntax (epsilon) 

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

870 

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

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

874 
becomes available as variable, constant etc. INCOMPATIBILITY, 

875 

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

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

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

879 
support corresponding Isar calculations. 
16234  880 

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

882 
instead of ":". 

883 

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

885 

886 
Old New 

887 
{..n(} {..<n} 

888 
{)n..} {n<..} 

889 
{m..n(} {m..<n} 

890 
{)m..n} {m<..n} 

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

892 

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

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

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

15046  896 

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

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

899 

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

902 
interface. 

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

903 

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

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

909 
Some new syntax forms are available: 

910 

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

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

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

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

915 

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

917 
function "Summation", which has been discontinued. 

918 

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

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

921 
(insert F x)'. 

922 

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

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

925 
typedefs, inductive datatypes and recursion. 

926 

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

929 
HOL/ex/SAT_Examples.thy for examples. 

17619  930 

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

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

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

935 
in unstructured proof scripts. 

936 

937 
* Reworked implementation of records. Improved scalability for 

938 
records with many fields, avoiding performance problems for type 

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

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

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

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

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

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

945 
<record_name>_ext_type. 

946 

947 
Flag record_quick_and_dirty_sensitive can be enabled to skip the 

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

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

950 
quite long. 

951 

952 
New simproc record_upd_simproc for simplification of multiple record 

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

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

955 
occasionally, since simplification is more powerful by default. 

956 

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

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

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

959 

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

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

963 
old proofs break occasionally as simplification may now solve more 

964 
goals than previously. 

965 

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

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

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

969 
just like y <= x. 

970 

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

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

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

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

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

976 
enabled/disabled by the reference use_let_simproc. Potential 

977 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  978 

16563  979 
* Classical reasoning: the meson method now accepts theorems as arguments. 
980 

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

983 

16891  984 
* Theory OrderedGroup and Ring_and_Field: various additions and 
985 
improvements to faciliate calculations involving equalities and 

986 
inequalities. 

987 

988 
The following theorems have been eliminated or modified 

989 
(INCOMPATIBILITY): 

16888  990 

991 
abs_eq now named abs_of_nonneg 

17371  992 
abs_of_ge_0 now named abs_of_nonneg 
993 
abs_minus_eq now named abs_of_nonpos 

16888  994 
imp_abs_id now named abs_of_nonneg 
995 
imp_abs_neg_id now named abs_of_nonpos 

996 
mult_pos now named mult_pos_pos 

997 
mult_pos_le now named mult_nonneg_nonneg 

998 
mult_pos_neg_le now named mult_nonneg_nonpos 

999 
mult_pos_neg2_le now named mult_nonneg_nonpos2 

1000 
mult_neg now named mult_neg_neg 

1001 
mult_neg_le now named mult_nonpos_nonpos 

1002 

16891  1003 
* Theory Parity: added rules for simplifying exponents. 
1004 

17092  1005 
* Theory List: 
1006 

1007 
The following theorems have been eliminated or modified 

1008 
(INCOMPATIBILITY): 

1009 

1010 
list_all_Nil now named list_all.simps(1) 

1011 
list_all_Cons now named list_all.simps(2) 

1012 
list_all_conv now named list_all_iff 

1013 
set_mem_eq now named mem_iff 

1014 

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

1017 

16888  1018 

1019 
*** HOLComplex *** 

1020 

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

1023 

1024 
The following theorems have been eliminated or modified 

1025 
(INCOMPATIBILITY): 

1026 

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

1027 
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

1028 
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

1029 
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

1030 
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

1031 
real_of_int_mult reversed direction of equality (use [symmetric]) 
16891  1032 

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

16888  1034 

16962  1035 
* Theory Ln is new, with properties of the natural logarithm 
1036 

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

1039 

1040 
hypreal = real star 

1041 
hypnat = nat star 

1042 
hcomplex = complex star 

1043 

1044 
* Hyperreal: Many groups of similarlydefined constants have been 

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

1045 
replaced by polymorphic versions (INCOMPATIBILITY): 
17423  1046 

1047 
star_of < hypreal_of_real, hypnat_of_nat, hcomplex_of_complex 

1048 

1049 
starset < starsetNat, starsetC 

1050 
*s* < *sNat*, *sc* 

1051 
starset_n < starsetNat_n, starsetC_n 

1052 
*sn* < *sNatn*, *scn* 

1053 
InternalSets < InternalNatSets, InternalCSets 

1054 

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

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

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

1059 
InternalFuns < InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs 
17423  1060 

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

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

1063 

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

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

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

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

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

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

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

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

1072 
mult_1_left < {hypreal,hypnat}_mult_1, hcomplex_mult_one_left 
17423  1073 
mult_1_right < hcomplex_mult_one_right 
1074 
mult_zero_left < hcomplex_mult_zero_left 

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

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

1077 
zero_neq_one < {hypreal,hypnat,hcomplex}_zero_not_eq_one 
17423  1078 
right_inverse < hypreal_mult_inverse 
1079 
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

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

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

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

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

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

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

1086 
mult_strict_left_mono < {hypreal,hypnat}_mult_less_mono2 
17423  1087 
add_nonneg_nonneg < hypreal_le_add_order 
1088 

1089 
* Hyperreal: Separate theorems having to do with typespecific 

1090 
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

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

1092 

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

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

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

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

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

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

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

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

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

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

1102 
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

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

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

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

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

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

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

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

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

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

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

1113 
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

1114 
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

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

1116 
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

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

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

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

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

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

1122 
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

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

1124 
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

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

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

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

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

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

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

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

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

1136 
starfun_add_capprox < starfun{C,RC}_add_capprox 
17423  1137 
starfun_add_approx < starfunCR_add_approx 
1138 
starfun_inverse_inverse < starfunC_inverse_inverse 

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

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

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

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

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

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

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

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

1147 

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

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

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

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

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

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

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

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

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

1156 
star_n_one_num < {hypreal,hypnat,hcomplex}_one_num 
17423  1157 
star_n_abs < hypreal_hrabs 
1158 
star_n_divide < hcomplex_divide 

1159 

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

1160 
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

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

1163 
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

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

1165 
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

1166 
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

1167 
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

1168 
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

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

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

1171 
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

1172 
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

1173 
star_of_number_of < {hypreal,hcomplex}_number_of 
17423  1174 
star_of_number_less < number_of_less_hypreal_of_real_iff 
1175 
star_of_number_le < number_of_le_hypreal_of_real_iff 

1176 
star_of_eq_number < hypreal_of_real_eq_number_of_iff 

1177 
star_of_less_number < hypreal_of_real_less_number_of_iff 

1178 
star_of_le_number < hypreal_of_real_le_number_of_iff 

1179 
star_of_power < hypreal_of_real_power 

1180 
star_of_eq_0 < hcomplex_of_complex_zero_iff 

1181 

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

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

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

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

1185 
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

1186 
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

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

1188 

17641  1189 
* Hyperreal: A theory of Taylor series. 
1190 

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

1191 

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

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

1193 

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

1196 
typeinference. 

1197 

1198 
* New simplification procedure for solving continuity conditions; it 

1199 
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

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

1201 

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

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

1204 

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

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

1206 

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

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

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

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

1212 
syntax and examples. 

1213 

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

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

1216 
but the proof obligation additionally includes an admissibility 

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

1218 
with continuity and strictness theorems for Rep and Abs. 

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

1219 

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

1222 

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

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

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

1226 
foo_strict: "foo$UU = UU" 

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

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

1229 

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

1230 

14885  1231 
*** ZF *** 
1232 

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

1235 
of a homomorphism). 

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

1236 

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

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

15703  1240 

1241 

17445  1242 
*** Cube *** 
1243 

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

1245 
theories. 

1246 

1247 

15703  1248 
*** ML *** 
1249 

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

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

1254 
accordingly, while Option.map replaces apsome. 

15973  1255 

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

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

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

1258 
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

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

1260 

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

1261 
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

1262 
toplevel, as they are variants of predefined functions. The following 
16234  1263 
suggests how one can translate existing code: 
15973  1264 

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

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

1267 
last_elem xs = List.last xs 

1268 
flat xss = List.concat xss 

16234  1269 
seq fs = List.app fs 
15973  1270 
partition P xs = List.partition P xs 
1271 
mapfilter f xs = List.mapPartial f xs 

1272 

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

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

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

1275 

17371  1276 
x > f f #> g 
1277 
(x, y) > f f #> g 

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

1278 

17495  1279 
* Pure/library.ML: introduced/changed precedence of infix operators: 
1280 

1281 
infix 1 > > > >> >> >>> #> #>; 

1282 
infix 2 ?; 

1283 
infix 3 o oo ooo oooo; 

1284 
infix 4 ~~ upto downto; 

1285 

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

1287 
infix operators. 

1288 

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

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

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

1292 

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

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

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

1295 

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

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

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

1298 

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

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

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

1301 

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

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

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

1304 

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

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

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

1307 

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

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

1309 
these: 'a option > 'a where 'a = 'b list 
17402  1310 
the_default: 'a > 'a option > 'a 
1311 
the_list: 'a option > 'a list 

1312 

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

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

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

1318 

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

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

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

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

1322 

17564  1323 
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides 
1324 

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

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

1327 

1328 
replacing make_keylist and keyfilter (occassionally used) 

1329 
Naive rewrites: 

1330 

1331 
make_keylist = AList.make 

1332 
keyfilter = AList.find (op =) 

1333 

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

1335 
avoiding eqtypes. Naive rewrites: 

1336 

1337 
eq_fst = eq_fst (op =) 

1338 
eq_snd = eq_snd (op =) 

1339 

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

1341 
Naive rewrites: 

1342 

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

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

1345 

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

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

1347 
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

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

1349 

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

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

1351 
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

1352 
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

1353 
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

1354 

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

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

1356 
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

1357 
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

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

1359 
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

1360 
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

1361 
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

1362 
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

1363 
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

1364 
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

1365 
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

1366 
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

1367 
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

1368 
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

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

1370 

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

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

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

1373 
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

1374 

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

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

1376 
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

1377 
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

1378 
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

1379 

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

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

1381 
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

1382 
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

1383 
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

1384 
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

1385 
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

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

1387 

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

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

1389 
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

1390 
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

1391 
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

1392 

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

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

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

1398 
name; NameSpace.extend is superceded by context dependent 

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

1400 
the naming context. Especially note Theory.restore_naming and 

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

1402 
Theory.add_path is no longer sufficient to recover from 

1403 
Theory.absolute_path in particular. 

1404 

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

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

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

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

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

1410 
with earlier declarations. 

16151  1411 

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

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

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