author  wenzelm 
Tue, 16 May 2006 21:33:23 +0200  
changeset 19665  8885951e9c2d 
parent 19653  39c37e16f748 
child 19682  c8c301eb965a 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

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

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

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

6 

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

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

8 

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

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

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

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

12 

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

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

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

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

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

17 

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

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

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

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

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

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

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

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

25 

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

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

27 

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

28 

17865  29 
*** Document preparation *** 
30 

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

17865  33 

34 

17779  35 
*** Pure *** 
36 

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

39 

19625
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

40 
* Overloaded definitions are now actually checked for acyclic 
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

41 
dependencies. Overloading of some constant c :: 'a decl is restricted 
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

42 
to schematic instances c :: ('b)t decl, for any type constructor t. 
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

43 
The RHS may mention overloaded constants recursively at type instances 
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

44 
corresponding to the immediate argument types 'b. This scheme covers 
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

45 
the disciplined overloading of Haskell98, although Isabelle does not 
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

46 
demand an exact correspondence to type class and instance 
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

47 
declarations. There is an internal dependency graph of all overloaded 
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

48 
and nonoverloaded definitions, which ensures that the collection of 
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

49 
interdependent constants in a theory can still be interpreted in terms 
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

50 
of the basic logic. 
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

51 

285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

52 
INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more 
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

53 
exotic overloading schemes  at the discretion of the user! 
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

54 

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

57 

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

59 
then guess x and y by clarify 

60 

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

62 
proof tools being involved here. 

63 

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

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

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

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

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

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

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

72 

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

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

18020  76 

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

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

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

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

81 

18308  82 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
83 

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

85 

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

88 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  89 
'unfolded' attribute may be replaced by firstclass proof text. 
90 

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

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

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

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

94 
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

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

96 

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

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

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

102 
originally first one. 

19220  103 

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

106 
(essentially a disjunction of cases with local parameters and 

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

18910  108 
adequately; in this notation common elimination rules look like this: 
18901  109 

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

111 
assumes "EX x. P x" 

112 
obtains x where "P x" 

113 

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

115 
assumes "A & B" 

116 
obtains A and B 

117 

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

119 
assumes "A  B" 

120 
obtains 

121 
A 

122 
 B 

123 

18910  124 
The subsequent classical rules even refer to the formal "thesis" 
18901  125 
explicitly: 
126 

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

128 
obtains "~ thesis" 

129 

18910  130 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
131 
obtains "thesis ==> something" 

18901  132 

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

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

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

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

138 
case_names). 

18901  139 

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

142 
toplevel lemma. 

143 

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

146 

19587  147 
* Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use 
148 
explicit (is "_ ==> ?foo") in the rare cases where this still happens 

149 
to occur. 

150 

19665  151 
* Isar/locales: new derived specification elements 'axiomatization', 
152 
'definition', 'abbreviation', which support typeinference, admit 

19083  153 
objectlevel specifications (equality, equivalence). See also the 
154 
isarref manual. Examples: 

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

155 

19665  156 
axiomatization 
157 
eq (infix "===" 50) 

158 
where eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

159 

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

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

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

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

163 

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

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

167 

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

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

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

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

175 

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

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

179 
'translations' in common applications. 

19084  180 

19665  181 
* Isar/locales: 'const_syntax' provides a robust interface to the 
182 
'syntax' primitive that also works in a locale context. Type 

183 
declaration and internal syntactic representation of given constants 

184 
retrieved from the context. 

185 

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

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

189 
(using objectlogic connectives for this purpose has been long 

190 
obsolete anyway). The subsequent proof patterns illustrate advanced 

191 
techniques of natural induction; general datatypes and inductive sets 

18267  192 
work analogously (see also src/HOL/Lambda for realistic examples). 
193 

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

18239  195 
parameters: 
18233  196 

197 
lemma 

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

199 
assumes a: "A n x" 

200 
shows "P n x" 

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

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

18248  203 
case 0 
18233  204 
show ?case sorry 
205 
next 

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

18233  209 
show ?case sorry 
210 
qed 

211 

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

217 
lemma 

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

219 
assumes a: "A (a x)" 

220 
shows "P (a x)" 

221 
using a 

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

223 
... 

224 

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

227 

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

230 
encodings: 

231 

232 
lemma 

233 
fixes n :: nat 

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

18267  235 
proof (induct n fixing: thesis) 
236 
case 0 

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

18399  238 
then show thesis by (rule 0) 
18267  239 
next 
240 
case (Suc n) 

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

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

243 
then show thesis by (rule Suc.prems) 

244 
qed 

245 

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

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

248 
existence statement through the induction as expected. 

18233  249 

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

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

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

252 
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

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

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

255 

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

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

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

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

259 

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

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

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

262 

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

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

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

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

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

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

268 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

287 

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

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

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

290 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

318 

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

319 
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

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

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

322 

18507  323 
lemma 
324 
shows "a : A ==> P1 a" 

325 
"a : A ==> P2 a" 

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

327 
"b : B ==> Q2 b" 

328 
"b : B ==> Q3 b" 

329 
proof (induct set: A B) 

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

330 

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

333 

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

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

337 
have been suppressed. 

338 

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

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

340 
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

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

342 

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

345 
least one premise. 

346 

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

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

351 

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

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

353 
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

354 
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

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

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

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

358 

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

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

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

361 
for example "A > B" => "Pi A (%_. B)". 
17779  362 

17865  363 

17806  364 
*** HOL *** 
365 

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

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

369 

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

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

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

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

374 
op * ~> HOL.times 
19277  375 
op < ~> Orderings.less 
376 
op <= ~> Orderings.less_eq 

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

377 

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

378 
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

379 

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

382 
may go wrong. 

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

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

384 

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

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

387 

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

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

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

392 
distribution). 

393 
INCOMPATIBILITY: rewrite proofs 

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

394 

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

395 
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

396 
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

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

398 

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

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

403 

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

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

17779  407 

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

19211  410 
* Theorem Cons_eq_map_conv no longer has attribute `simp'. 
411 

19279  412 
* Theorem setsum_mult renamed to setsum_right_distrib. 
413 

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

416 

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

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

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

421 

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

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

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

424 

19572
a4b3176f19dd
* Library: theory Accessible_Part has been move to main HOL.
wenzelm
parents:
19508
diff
changeset

425 
* Library: theory Accessible_Part has been move to main HOL. 
a4b3176f19dd
* Library: theory Accessible_Part has been move to main HOL.
wenzelm
parents:
19508
diff
changeset

426 

18446  427 
* Library: added theory Coinductive_List of potentially infinite lists 
428 
as greatest fixedpoint. 

18399  429 

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

432 

19254  433 

19653  434 
*** HOLComplex *** 
435 

436 
* Theory Real: new method ferrack implements quantifier elimination 

437 
for linear arithmetic over the reals. The quantifier elimination 

438 
feature is used only for decision, for compatibility with arith. This 

439 
means a goal is either solved or left unchanged, no simplification. 

440 

441 

17878  442 
*** ML *** 
443 

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

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

445 

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

446 
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

447 
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

448 

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

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

452 
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

453 
sequence. "fold_burrow" has an additional context. 
18540  454 

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

456 
"unflat" from the user. 

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

457 

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

460 

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

461 
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

462 
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

463 

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

466 
given more convenient names and signatures reminiscent of similar 

467 
functions for alists, tables, etc: 

18051  468 

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

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

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

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

473 

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

476 

19653  477 
* Pure/library: general ``divide_and_conquer'' combinator on lists. 
478 

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

19032  482 
* Pure/General/rat.ML implements rational numbers. 
483 

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

485 
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

486 
admits slightly more efficient complex applications. 
18446  487 

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

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

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

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

494 

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

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

18738  498 
minimizing code duplication. Thm.rule_attribute and 
499 
Thm.declaration_attribute build canonical attributes; see also 

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

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

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

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

503 

19508  504 
* Pure/kernel: consts certification ignores sort constraints given in 
505 
signature declarations. (This information is not relevant to the 

506 
logic, but only for type inference.) IMPORTANT INTERNAL CHANGE. 

507 

508 
* Pure: axiomatic type classes are now purely definitional, with 

509 
explicit proofs of class axioms and super class relations performed 

510 
internally. See Pure/axclass.ML for the main internal interfaces  

511 
notably AxClass.define_class supercedes AxClass.add_axclass, and 

512 
AxClass.axiomatize_class/classrel/arity supercede 

513 
Sign.add_classes/classrel/arities. 

514 

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

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

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

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

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

519 
attributes, methods, etc. 
18642  520 

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

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

524 
fold_map combinators. 

18051  525 

18020  526 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  527 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  528 
achieve the old behaviour. 
529 

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

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

532 
statements. 

533 

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

535 
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

536 
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

537 
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

538 
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

539 

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

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

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

543 
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

544 
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

545 

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

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

547 

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

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

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

551 

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

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

553 

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

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

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

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

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

558 

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

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

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

561 

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

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

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

564 

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

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

566 
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

567 
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

568 
batch mode. 
18567  569 

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

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

17890  573 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  574 
(solver, looper etc.) may depend on arbitrary proof data. 
575 

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

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

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

579 
former Simplifier.inherit_bounds, which is already included here  

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

17878  582 

583 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

586 
INCOMPATIBILITY. 

587 

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

590 

17878  591 

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

592 

17720  593 
New in Isabelle2005 (October 2005) 
594 
 

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

595 

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

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

597 

15130  598 
* Theory headers: the new header syntax for Isar theories is 
599 

600 
theory <name> 

16234  601 
imports <theory1> ... <theoryN> 
602 
uses <file1> ... <fileM> 

15130  603 
begin 
604 

16234  605 
where the 'uses' part is optional. The previous syntax 
606 

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

608 

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

17371  611 
nonIsar theories now, but these will disappear soon. 
15130  612 

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

613 
* Theory loader: parent theories can now also be referred to via 
16234  614 
relative and absolute paths. 
615 

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

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

617 
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

618 
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

619 
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

620 
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

621 
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

622 
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

623 
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

624 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  625 

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

626 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  627 

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

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

630 
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

631 

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

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

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

634 

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

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

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

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

17385  642 

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

645 
faster. 

646 

15703  647 

648 
*** Document preparation *** 

649 

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

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

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

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

655 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

656 

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

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

658 
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

659 
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

660 
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

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

662 
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

663 
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

664 
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

665 
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

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

667 

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

668 
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

669 
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

670 
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

671 
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

672 
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

673 
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

674 
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

675 
specified above. 
16234  676 

17402  677 
* Several new antiquotations: 
15979  678 

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

680 

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

682 

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

15979  685 

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

16234  687 
theorem applying a "style" to it 
688 

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

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

690 

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

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

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

697 
typechecked ML expressions verbatim. 
16234  698 

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

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

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

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

703 

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

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

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

707 

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

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

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

710 

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

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

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

713 

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

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

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

716 

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

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

718 
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

719 
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

720 

16234  721 

722 
*** Pure *** 

723 

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

725 
automatic typeinference of declared constants; additional support for 

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

727 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

728 
sequential dependencies of definitions within a single 'constdefs' 

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

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

731 

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

733 
indexed syntax provides a notational device for subscripted 

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

735 
expressions. Secondly, in a local context with structure 

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

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

738 
show_structs controls printing of implicit structures. Typical 

739 
applications of these concepts involve record types and locales. 

740 

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

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

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

744 

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

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

747 
parsing/printing, see also isarref manual. 

748 

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

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

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

753 
INCOMPATIBILITY. 

754 

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

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

756 
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

757 
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

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

759 

16234  760 
* Improved internal renaming of symbolic identifiers  attach primes 
761 
instead of base 26 numbers. 

762 

763 
* New flag show_question_marks controls printing of leading question 

764 
marks in schematic variable names. 

765 

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

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

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

769 

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

771 
by simp 

772 

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

774 

17548  775 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  776 
annotations as "(00...)". 
777 

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

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

780 
Before that distinction was only partially implemented via type class 

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

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

783 
exotic syntax specifications may require further adaption 

17691  784 
(e.g. Cube/Cube.thy). 
16234  785 

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

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

788 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

789 
specifications. 

790 

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

793 

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

796 
Limit. 

797 

798 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

804 
allow for use in a context of fixed variables. 

805 

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

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

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

809 

17597  810 
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. 
17590  811 

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

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

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

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

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

818 

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

820 
selections of theorems in named facts via index ranges. 

821 

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

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

823 
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

824 
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

825 

17397  826 
* 'hide': option '(open)' hides only base names. 
827 

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

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

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

830 

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

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

834 
must be quoted when used as identifiers. 

835 

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

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

838 
quoted when used as identifier. 

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

839 

16234  840 

841 
*** Locales *** 

17095  842 

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

845 
proof obligations from the expression specification. After the 

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

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

848 
commands is a follows: 

849 

17095  850 
(1) interpretation expr inst 
851 
(2) interpretation target < expr 

852 
(3) interpret expr inst 

17385  853 

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

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

858 
locale expression. Interpretation is smart in that interpretations 

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

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

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

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

16234  864 

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

866 
'interpret' instead. 

867 

17385  868 
* New context element 'constrains' for adding type constraints to 
869 
parameters. 

870 

871 
* Context expressions: renaming of parameters with syntax 

872 
redeclaration. 

17095  873 

874 
* Locale declaration: 'includes' disallowed. 

875 

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

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

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

880 
to attribute arguments as expected. 

881 

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

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

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

885 
Attribute implementations need to cooperate properly with the static 

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

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

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

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

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

891 
values to argument tokens explicitly. 

892 

893 
* Changed parameter management in theorem generation for long goal 

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

895 
theorem statement in rare situations. 

896 

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

899 

16234  900 

901 
*** Provers *** 

902 

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

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

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

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

907 
still available as 'simplesubst'. 

908 

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

910 
and quasi orders. 

911 

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

913 
reflexivetransitive closure of relations. 

914 

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

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

917 

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

919 
is peformed already. Objectlogics merely need to finish their 

920 
initial simpset configuration as before. INCOMPATIBILITY. 

15703  921 

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

922 

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

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

924 

16234  925 
* Symbolic syntax of Hilbert Choice Operator is now as follows: 
14878  926 

927 
syntax (epsilon) 

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

929 

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

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

933 
becomes available as variable, constant etc. INCOMPATIBILITY, 

934 

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

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

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

938 
support corresponding Isar calculations. 
16234  939 

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

941 
instead of ":". 

942 

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

944 

945 
Old New 

946 
{..n(} {..<n} 

947 
{)n..} {n<..} 

948 
{m..n(} {m..<n} 

949 
{)m..n} {m<..n} 

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

951 

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

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

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

15046  955 

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

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

958 

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

961 
interface. 

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

962 

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

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

968 
Some new syntax forms are available: 

969 

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

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

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

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

974 

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

976 
function "Summation", which has been discontinued. 

977 

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

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

980 
(insert F x)'. 

981 

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

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

984 
typedefs, inductive datatypes and recursion. 

985 

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

988 
HOL/ex/SAT_Examples.thy for examples. 

17619  989 

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

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

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

994 
in unstructured proof scripts. 

995 

996 
* Reworked implementation of records. Improved scalability for 

997 
records with many fields, avoiding performance problems for type 

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

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

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

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

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

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

1004 
<record_name>_ext_type. 

1005 

1006 
Flag record_quick_and_dirty_sensitive can be enabled to skip the 

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

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

1009 
quite long. 

1010 

1011 
New simproc record_upd_simproc for simplification of multiple record 

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

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

1014 
occasionally, since simplification is more powerful by default. 

1015 

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

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

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

1018 

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

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

1022 
old proofs break occasionally as simplification may now solve more 

1023 
goals than previously. 

1024 

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

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

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

1028 
just like y <= x. 

1029 

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

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

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

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

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

1035 
enabled/disabled by the reference use_let_simproc. Potential 

1036 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  1037 

16563  1038 
* Classical reasoning: the meson method now accepts theorems as arguments. 
1039 

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

1042 

16891  1043 
* Theory OrderedGroup and Ring_and_Field: various additions and 
1044 
improvements to faciliate calculations involving equalities and 

1045 
inequalities. 

1046 

1047 
The following theorems have been eliminated or modified 

1048 
(INCOMPATIBILITY): 

16888  1049 

1050 
abs_eq now named abs_of_nonneg 

17371  1051 
abs_of_ge_0 now named abs_of_nonneg 
1052 
abs_minus_eq now named abs_of_nonpos 

16888  1053 
imp_abs_id now named abs_of_nonneg 
1054 
imp_abs_neg_id now named abs_of_nonpos 

1055 
mult_pos now named mult_pos_pos 

1056 
mult_pos_le now named mult_nonneg_nonneg 

1057 
mult_pos_neg_le now named mult_nonneg_nonpos 

1058 
mult_pos_neg2_le now named mult_nonneg_nonpos2 

1059 
mult_neg now named mult_neg_neg 

1060 
mult_neg_le now named mult_nonpos_nonpos 

1061 

16891  1062 
* Theory Parity: added rules for simplifying exponents. 
1063 

17092  1064 
* Theory List: 
1065 

1066 
The following theorems have been eliminated or modified 

1067 
(INCOMPATIBILITY): 

1068 

1069 
list_all_Nil now named list_all.simps(1) 

1070 
list_all_Cons now named list_all.simps(2) 

1071 
list_all_conv now named list_all_iff 

1072 
set_mem_eq now named mem_iff 

1073 

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

1076 

16888  1077 

1078 
*** HOLComplex *** 

1079 

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

1082 

1083 
The following theorems have been eliminated or modified 

1084 
(INCOMPATIBILITY): 

1085 

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

1086 
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

1087 
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

1088 
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

1089 
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

1090 
real_of_int_mult reversed direction of equality (use [symmetric]) 
16891  1091 

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

16888  1093 

16962  1094 
* Theory Ln is new, with properties of the natural logarithm 
1095 

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

1098 

1099 
hypreal = real star 

1100 
hypnat = nat star 

1101 
hcomplex = complex star 

1102 

1103 
* Hyperreal: Many groups of similarlydefined constants have been 

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

1104 
replaced by polymorphic versions (INCOMPATIBILITY): 
17423  1105 

1106 
star_of < hypreal_of_real, hypnat_of_nat, hcomplex_of_complex 

1107 

1108 
starset < starsetNat, starsetC 

1109 
*s* < *sNat*, *sc* 

1110 
starset_n < starsetNat_n, starsetC_n 

1111 
*sn* < *sNatn*, *scn* 

1112 
InternalSets < InternalNatSets, InternalCSets 

1113 

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

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

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

1118 
InternalFuns < InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs 
17423  1119 

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

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

1122 

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

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

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

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

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

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

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

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

1131 
mult_1_left < {hypreal,hypnat}_mult_1, hcomplex_mult_one_left 
17423  1132 
mult_1_right < hcomplex_mult_one_right 
1133 
mult_zero_left < hcomplex_mult_zero_left 

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

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

1136 
zero_neq_one < {hypreal,hypnat,hcomplex}_zero_not_eq_one 
17423  1137 
right_inverse < hypreal_mult_inverse 
1138 
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

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

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

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

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

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

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

1145 
mult_strict_left_mono < {hypreal,hypnat}_mult_less_mono2 
17423  1146 
add_nonneg_nonneg < hypreal_le_add_order 
1147 

1148 
* Hyperreal: Separate theorems having to do with typespecific 

1149 
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

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

1151 

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

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

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

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

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

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

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

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

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

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

1161 
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

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

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

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

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

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

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

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

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

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

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

1172 
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

1173 
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

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

1175 
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

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

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

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

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

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

1181 
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

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

1183 
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

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

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

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

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

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

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

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

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

1195 
starfun_add_capprox < starfun{C,RC}_add_capprox 
17423  1196 
starfun_add_approx < starfunCR_add_approx 
1197 
starfun_inverse_inverse < starfunC_inverse_inverse 

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

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

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

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

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

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

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

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

1206 

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

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

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

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

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

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

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

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

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

1215 
star_n_one_num < {hypreal,hypnat,hcomplex}_one_num 
17423  1216 
star_n_abs < hypreal_hrabs 
1217 
star_n_divide < hcomplex_divide 

1218 

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

1219 
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

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

1222 
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

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

1224 
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

1225 
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

1226 
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

1227 
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

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

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

1230 
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

1231 
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

1232 
star_of_number_of < {hypreal,hcomplex}_number_of 
17423  1233 
star_of_number_less < number_of_less_hypreal_of_real_iff 
1234 
star_of_number_le < number_of_le_hypreal_of_real_iff 

1235 
star_of_eq_number < hypreal_of_real_eq_number_of_iff 

1236 
star_of_less_number < hypreal_of_real_less_number_of_iff 

1237 
star_of_le_number < hypreal_of_real_le_number_of_iff 

1238 
star_of_power < hypreal_of_real_power 

1239 
star_of_eq_0 < hcomplex_of_complex_zero_iff 

1240 

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

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

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

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

1244 
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

1245 
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

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

1247 

17641  1248 
* Hyperreal: A theory of Taylor series. 
1249 

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

1250 

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

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

1252 

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

1255 
typeinference. 

1256 

1257 
* New simplification procedure for solving continuity conditions; it 

1258 
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

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

1260 

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

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

1263 

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

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

1265 

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

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

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

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

1271 
syntax and examples. 

1272 

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

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

1275 
but the proof obligation additionally includes an admissibility 

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

1277 
with continuity and strictness theorems for Rep and Abs. 

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

1278 

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

1281 

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

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

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

1285 
foo_strict: "foo$UU = UU" 

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

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

1288 

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

1289 

14885  1290 
*** ZF *** 
1291 

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

1294 
of a homomorphism). 

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

1295 

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

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

15703  1299 

1300 

17445  1301 
*** Cube *** 
1302 

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

1304 
theories. 

1305 

1306 

15703  1307 
*** ML *** 
1308 

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

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

1313 
accordingly, while Option.map replaces apsome. 

15973  1314 

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

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

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

1317 
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

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

1319 

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

1320 
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

1321 
toplevel, as they are variants of predefined functions. The following 
16234  1322 
suggests how one can translate existing code: 
15973  1323 

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

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

1326 
last_elem xs = List.last xs 

1327 
flat xss = List.concat xss 

16234  1328 
seq fs = List.app fs 
15973  1329 
partition P xs = List.partition P xs 
1330 
mapfilter f xs = List.mapPartial f xs 

1331 

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

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

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

1334 

17371  1335 
x > f f #> g 
1336 
(x, y) > f f #> g 

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

1337 

17495  1338 
* Pure/library.ML: introduced/changed precedence of infix operators: 
1339 

1340 
infix 1 > > > >> >> >>> #> #>; 

1341 
infix 2 ?; 

1342 
infix 3 o oo ooo oooo; 

1343 
infix 4 ~~ upto downto; 

1344 

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

1346 
infix operators. 

1347 

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

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

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

1351 

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

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

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

1354 

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

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

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

1357 

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

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

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

1360 

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

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

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

1363 

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

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

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

1366 

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

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

1368 
these: 'a option > 'a where 'a = 'b list 
17402  1369 
the_default: 'a > 'a option > 'a 
1370 
the_list: 'a option > 'a list 

1371 

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

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

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

1377 

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

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

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

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

1381 

17564  1382 
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides 
1383 

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

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

1386 

1387 
replacing make_keylist and keyfilter (occassionally used) 

1388 
Naive rewrites: 

1389 

1390 
make_keylist = AList.make 

1391 
keyfilter = AList.find (op =) 

1392 

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

1394 
avoiding eqtypes. Naive rewrites: 

1395 

1396 
eq_fst = eq_fst (op =) 

1397 
eq_snd = eq_snd (op =) 

1398 

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

1400 
Naive rewrites: 

1401 

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

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

1404 

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

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

1406 
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

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

1408 

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

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

1410 
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

1411 
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

1412 
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

1413 

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

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