author  wenzelm 
Wed, 24 May 2006 22:13:50 +0200  
changeset 19714  ceacd4422b97 
parent 19711  2401b1a3087f 
child 19715  3294407dd556 
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 
19714  41 
dependencies. The overloading scheme is slightly more general than 
42 
that of Haskell98, although Isabelle does not demand an exact 

43 
correspondence to type class and instance declarations. 

44 
INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more 

45 
exotic versions of overloading  at the discretion of the user! 

19711  46 

47 
Polymorphic constants are represented via type arguments, i.e. the 

48 
instantiation that matches an instance against the most general 

49 
declaration given in the signature. For example, with the declaration 

50 
c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented 

51 
as c(nat). Overloading is essentially simultaneous structural 

52 
recursion over such type arguments. Incomplete specification patterns 

19714  53 
impose global constraints on all occurrences, e.g. c('a * 'a) on the 
54 
LHS means that more general c('a * 'b) will be disallowed on the RHS. 

55 
Command 'print_theory' outputs the normalized system of recursive 

56 
equations, see section "definitions". 

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

57 

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

60 

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

62 
then guess x and y by clarify 

63 

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

65 
proof tools being involved here. 

66 

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

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

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

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

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

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

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

75 

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

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

18020  79 

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

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

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

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

84 

18308  85 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
86 

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

88 

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

91 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  92 
'unfolded' attribute may be replaced by firstclass proof text. 
93 

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

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

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

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

97 
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

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

99 

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

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

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

105 
originally first one. 

19220  106 

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

109 
(essentially a disjunction of cases with local parameters and 

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

18910  111 
adequately; in this notation common elimination rules look like this: 
18901  112 

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

114 
assumes "EX x. P x" 

115 
obtains x where "P x" 

116 

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

118 
assumes "A & B" 

119 
obtains A and B 

120 

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

122 
assumes "A  B" 

123 
obtains 

124 
A 

125 
 B 

126 

18910  127 
The subsequent classical rules even refer to the formal "thesis" 
18901  128 
explicitly: 
129 

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

131 
obtains "~ thesis" 

132 

18910  133 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
134 
obtains "thesis ==> something" 

18901  135 

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

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

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

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

141 
case_names). 

18901  142 

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

145 
toplevel lemma. 

146 

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

149 

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

152 
to occur. 

153 

19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

154 
* Pure: syntax "CONST name" produces a fully internalized constant 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

155 
according to the current context. This is particularly useful for 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

156 
syntax translations that should refer to internal constant 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

157 
representations independently of name spaces. 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

158 

c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

159 
* Isar/locales: 'const_syntax' provides a robust interface to the 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

160 
'syntax' primitive that also works in a locale context. Type 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

161 
declaration and internal syntactic representation of given constants 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

162 
retrieved from the context. 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

163 

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

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

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

168 

19665  169 
axiomatization 
170 
eq (infix "===" 50) 

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

172 

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

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

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

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

176 

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

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

180 

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

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

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

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

188 

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

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

192 
'translations' in common applications. 

19084  193 

19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

194 
Concrete syntax is attached to specified constants in internal form, 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

195 
independently of name spaces. The parse tree representation is 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

196 
slightly different  use 'const_syntax' instead of raw 'syntax', and 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

197 
'translations' with explicit "CONST" markup to accommodate this. 
19665  198 

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

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

202 
(using objectlogic connectives for this purpose has been long 

203 
obsolete anyway). The subsequent proof patterns illustrate advanced 

204 
techniques of natural induction; general datatypes and inductive sets 

18267  205 
work analogously (see also src/HOL/Lambda for realistic examples). 
206 

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

18239  208 
parameters: 
18233  209 

210 
lemma 

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

212 
assumes a: "A n x" 

213 
shows "P n x" 

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

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

18248  216 
case 0 
18233  217 
show ?case sorry 
218 
next 

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

18233  222 
show ?case sorry 
223 
qed 

224 

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

230 
lemma 

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

232 
assumes a: "A (a x)" 

233 
shows "P (a x)" 

234 
using a 

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

236 
... 

237 

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

240 

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

243 
encodings: 

244 

245 
lemma 

246 
fixes n :: nat 

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

18267  248 
proof (induct n fixing: thesis) 
249 
case 0 

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

18399  251 
then show thesis by (rule 0) 
18267  252 
next 
253 
case (Suc n) 

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

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

256 
then show thesis by (rule Suc.prems) 

257 
qed 

258 

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

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

261 
existence statement through the induction as expected. 

18233  262 

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

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

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

265 
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

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

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

268 

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

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

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

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

272 

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

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

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

275 

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

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

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

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

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

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

281 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

300 

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

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

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

303 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

331 

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

332 
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

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

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

335 

18507  336 
lemma 
337 
shows "a : A ==> P1 a" 

338 
"a : A ==> P2 a" 

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

340 
"b : B ==> Q2 b" 

341 
"b : B ==> Q3 b" 

342 
proof (induct set: A B) 

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

343 

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

346 

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

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

350 
have been suppressed. 

351 

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

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

353 
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

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

355 

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

358 
least one premise. 

359 

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

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

364 

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

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

366 
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

367 
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

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

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

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

371 

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

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

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

374 
for example "A > B" => "Pi A (%_. B)". 
17779  375 

17865  376 

17806  377 
*** HOL *** 
378 

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

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

382 

19279  383 
* 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

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

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

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

387 
op * ~> HOL.times 
19277  388 
op < ~> Orderings.less 
389 
op <= ~> Orderings.less_eq 

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

390 

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

391 
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

392 

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

395 
may go wrong. 

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

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

397 

19277  398 
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

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

400 

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

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

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

405 
distribution). 

406 
INCOMPATIBILITY: rewrite proofs 

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

407 

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

408 
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

409 
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

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

411 

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

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

416 

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

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

17779  420 

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

19211  423 
* Theorem Cons_eq_map_conv no longer has attribute `simp'. 
424 

19279  425 
* Theorem setsum_mult renamed to setsum_right_distrib. 
426 

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

429 

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

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

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

434 

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

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

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

437 

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

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

439 

18446  440 
* Library: added theory Coinductive_List of potentially infinite lists 
441 
as greatest fixedpoint. 

18399  442 

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

445 

19254  446 

19653  447 
*** HOLComplex *** 
448 

449 
* Theory Real: new method ferrack implements quantifier elimination 

450 
for linear arithmetic over the reals. The quantifier elimination 

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

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

453 

454 

17878  455 
*** ML *** 
456 

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

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

458 

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

459 
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

460 
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

461 

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

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

465 
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

466 
sequence. "fold_burrow" has an additional context. 
18540  467 

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

469 
"unflat" from the user. 

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

470 

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

473 

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

474 
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

475 
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

476 

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

479 
given more convenient names and signatures reminiscent of similar 

480 
functions for alists, tables, etc: 

18051  481 

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

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

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

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

486 

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

489 

19653  490 
* Pure/library: general ``divide_and_conquer'' combinator on lists. 
491 

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

19032  495 
* Pure/General/rat.ML implements rational numbers. 
496 

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

498 
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

499 
admits slightly more efficient complex applications. 
18446  500 

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

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

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

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

507 

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

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

18738  511 
minimizing code duplication. Thm.rule_attribute and 
512 
Thm.declaration_attribute build canonical attributes; see also 

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

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

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

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

516 

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

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

520 

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

522 
explicit proofs of class axioms and super class relations performed 

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

524 
notably AxClass.define_class supercedes AxClass.add_axclass, and 

525 
AxClass.axiomatize_class/classrel/arity supercede 

526 
Sign.add_classes/classrel/arities. 

527 

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

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

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

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

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

532 
attributes, methods, etc. 
18642  533 

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

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

537 
fold_map combinators. 

18051  538 

18020  539 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  540 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  541 
achieve the old behaviour. 
542 

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

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

545 
statements. 

546 

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

548 
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

549 
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

550 
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

551 
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

552 

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

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

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

556 
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

557 
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

558 

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

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

560 

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

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

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

564 

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

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

566 

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

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

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

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

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

571 

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

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

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

574 

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

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

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

577 

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

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

579 
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

580 
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

581 
batch mode. 
18567  582 

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

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

17890  586 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  587 
(solver, looper etc.) may depend on arbitrary proof data. 
588 

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

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

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

592 
former Simplifier.inherit_bounds, which is already included here  

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

17878  595 

596 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

599 
INCOMPATIBILITY. 

600 

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

603 

17878  604 

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

605 

17720  606 
New in Isabelle2005 (October 2005) 
607 
 

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

608 

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

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

610 

15130  611 
* Theory headers: the new header syntax for Isar theories is 
612 

613 
theory <name> 

16234  614 
imports <theory1> ... <theoryN> 
615 
uses <file1> ... <fileM> 

15130  616 
begin 
617 

16234  618 
where the 'uses' part is optional. The previous syntax 
619 

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

621 

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

17371  624 
nonIsar theories now, but these will disappear soon. 
15130  625 

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

626 
* Theory loader: parent theories can now also be referred to via 
16234  627 
relative and absolute paths. 
628 

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

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

630 
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

631 
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

632 
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

633 
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

634 
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

635 
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

636 
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

637 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  638 

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

639 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  640 

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

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

643 
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

644 

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

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

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

647 

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

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

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

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

17385  655 

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

658 
faster. 

659 

15703  660 

661 
*** Document preparation *** 

662 

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

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

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

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

668 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

669 

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

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

671 
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

672 
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

673 
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

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

675 
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

676 
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

677 
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

678 
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

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

680 

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

681 
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

682 
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

683 
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

684 
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

685 
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

686 
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

687 
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

688 
specified above. 
16234  689 

17402  690 
* Several new antiquotations: 
15979  691 

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

693 

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

695 

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

15979  698 

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

16234  700 
theorem applying a "style" to it 
701 

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

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

703 

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

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

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

710 
typechecked ML expressions verbatim. 
16234  711 

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

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

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

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

716 

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

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

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

720 

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

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

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

723 

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

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

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

726 

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

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

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

729 

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

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

731 
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

732 
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

733 

16234  734 

735 
*** Pure *** 

736 

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

738 
automatic typeinference of declared constants; additional support for 

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

740 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

741 
sequential dependencies of definitions within a single 'constdefs' 

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

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

744 

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

746 
indexed syntax provides a notational device for subscripted 

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

748 
expressions. Secondly, in a local context with structure 

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

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

751 
show_structs controls printing of implicit structures. Typical 

752 
applications of these concepts involve record types and locales. 

753 

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

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

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

757 

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

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

760 
parsing/printing, see also isarref manual. 

761 

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

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

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

766 
INCOMPATIBILITY. 

767 

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

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

769 
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

770 
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

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

772 

16234  773 
* Improved internal renaming of symbolic identifiers  attach primes 
774 
instead of base 26 numbers. 

775 

776 
* New flag show_question_marks controls printing of leading question 

777 
marks in schematic variable names. 

778 

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

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

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

782 

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

784 
by simp 

785 

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

787 

17548  788 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  789 
annotations as "(00...)". 
790 

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

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

793 
Before that distinction was only partially implemented via type class 

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

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

796 
exotic syntax specifications may require further adaption 

17691  797 
(e.g. Cube/Cube.thy). 
16234  798 

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

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

801 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

802 
specifications. 

803 

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

806 

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

809 
Limit. 

810 

811 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

817 
allow for use in a context of fixed variables. 

818 

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

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

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

822 

17597  823 
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. 
17590  824 

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

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

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

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

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

831 

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

833 
selections of theorems in named facts via index ranges. 

834 

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

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

836 
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

837 
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

838 

17397  839 
* 'hide': option '(open)' hides only base names. 
840 

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

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

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

843 

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

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

847 
must be quoted when used as identifiers. 

848 

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

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

851 
quoted when used as identifier. 

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

852 

16234  853 

854 
*** Locales *** 

17095  855 

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

858 
proof obligations from the expression specification. After the 

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

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

861 
commands is a follows: 

862 

17095  863 
(1) interpretation expr inst 
864 
(2) interpretation target < expr 

865 
(3) interpret expr inst 

17385  866 

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

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

871 
locale expression. Interpretation is smart in that interpretations 

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

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

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

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

16234  877 

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

879 
'interpret' instead. 

880 

17385  881 
* New context element 'constrains' for adding type constraints to 
882 
parameters. 

883 

884 
* Context expressions: renaming of parameters with syntax 

885 
redeclaration. 

17095  886 

887 
* Locale declaration: 'includes' disallowed. 

888 

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

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

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

893 
to attribute arguments as expected. 

894 

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

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

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

898 
Attribute implementations need to cooperate properly with the static 

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

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

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

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

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

904 
values to argument tokens explicitly. 

905 

906 
* Changed parameter management in theorem generation for long goal 

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

908 
theorem statement in rare situations. 

909 

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

912 

16234  913 

914 
*** Provers *** 

915 

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

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

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

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

920 
still available as 'simplesubst'. 

921 

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

923 
and quasi orders. 

924 

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

926 
reflexivetransitive closure of relations. 

927 

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

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

930 

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

932 
is peformed already. Objectlogics merely need to finish their 

933 
initial simpset configuration as before. INCOMPATIBILITY. 

15703  934 

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

935 

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

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

937 

16234  938 
* Symbolic syntax of Hilbert Choice Operator is now as follows: 
14878  939 

940 
syntax (epsilon) 

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

942 

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

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

946 
becomes available as variable, constant etc. INCOMPATIBILITY, 

947 

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

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

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

951 
support corresponding Isar calculations. 
16234  952 

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

954 
instead of ":". 

955 

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

957 

958 
Old New 

959 
{..n(} {..<n} 

960 
{)n..} {n<..} 

961 
{m..n(} {m..<n} 

962 
{)m..n} {m<..n} 

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

964 

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

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

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

15046  968 

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

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

971 

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

974 
interface. 

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

975 

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

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

981 
Some new syntax forms are available: 

982 

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

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

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

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

987 

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

989 
function "Summation", which has been discontinued. 

990 

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

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

993 
(insert F x)'. 

994 

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

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

997 
typedefs, inductive datatypes and recursion. 

998 

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

1001 
HOL/ex/SAT_Examples.thy for examples. 

17619  1002 

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

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

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

1007 
in unstructured proof scripts. 

1008 

1009 
* Reworked implementation of records. Improved scalability for 

1010 
records with many fields, avoiding performance problems for type 

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

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

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

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

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

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

1017 
<record_name>_ext_type. 

1018 

1019 
Flag record_quick_and_dirty_sensitive can be enabled to skip the 

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

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

1022 
quite long. 

1023 

1024 
New simproc record_upd_simproc for simplification of multiple record 

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

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

1027 
occasionally, since simplification is more powerful by default. 

1028 

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

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

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

1031 

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

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

1035 
old proofs break occasionally as simplification may now solve more 

1036 
goals than previously. 

1037 

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

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

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

1041 
just like y <= x. 

1042 

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

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

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

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

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

1048 
enabled/disabled by the reference use_let_simproc. Potential 

1049 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  1050 

16563  1051 
* Classical reasoning: the meson method now accepts theorems as arguments. 
1052 

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

1055 

16891  1056 
* Theory OrderedGroup and Ring_and_Field: various additions and 
1057 
improvements to faciliate calculations involving equalities and 

1058 
inequalities. 

1059 

1060 
The following theorems have been eliminated or modified 

1061 
(INCOMPATIBILITY): 

16888  1062 

1063 
abs_eq now named abs_of_nonneg 

17371  1064 
abs_of_ge_0 now named abs_of_nonneg 
1065 
abs_minus_eq now named abs_of_nonpos 

16888  1066 
imp_abs_id now named abs_of_nonneg 
1067 
imp_abs_neg_id now named abs_of_nonpos 

1068 
mult_pos now named mult_pos_pos 

1069 
mult_pos_le now named mult_nonneg_nonneg 

1070 
mult_pos_neg_le now named mult_nonneg_nonpos 

1071 
mult_pos_neg2_le now named mult_nonneg_nonpos2 

1072 
mult_neg now named mult_neg_neg 

1073 
mult_neg_le now named mult_nonpos_nonpos 

1074 

16891  1075 
* Theory Parity: added rules for simplifying exponents. 
1076 

17092  1077 
* Theory List: 
1078 

1079 
The following theorems have been eliminated or modified 

1080 
(INCOMPATIBILITY): 

1081 

1082 
list_all_Nil now named list_all.simps(1) 

1083 
list_all_Cons now named list_all.simps(2) 

1084 
list_all_conv now named list_all_iff 

1085 
set_mem_eq now named mem_iff 

1086 

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

1089 

16888  1090 

1091 
*** HOLComplex *** 

1092 

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

1095 

1096 
The following theorems have been eliminated or modified 

1097 
(INCOMPATIBILITY): 

1098 

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

1099 
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

1100 
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

1101 
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

1102 
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

1103 
real_of_int_mult reversed direction of equality (use [symmetric]) 
16891  1104 

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

16888  1106 

16962  1107 
* Theory Ln is new, with properties of the natural logarithm 
1108 

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

1111 

1112 
hypreal = real star 

1113 
hypnat = nat star 

1114 
hcomplex = complex star 

1115 

1116 
* Hyperreal: Many groups of similarlydefined constants have been 

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

1117 
replaced by polymorphic versions (INCOMPATIBILITY): 
17423  1118 

1119 
star_of < hypreal_of_real, hypnat_of_nat, hcomplex_of_complex 

1120 

1121 
starset < starsetNat, starsetC 

1122 
*s* < *sNat*, *sc* 

1123 
starset_n < starsetNat_n, starsetC_n 

1124 
*sn* < *sNatn*, *scn* 

1125 
InternalSets < InternalNatSets, InternalCSets 

1126 

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

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

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

1131 
InternalFuns < InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs 
17423  1132 

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

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

1135 

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

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

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

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

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

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

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

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

1144 
mult_1_left < {hypreal,hypnat}_mult_1, hcomplex_mult_one_left 
17423  1145 
mult_1_right < hcomplex_mult_one_right 
1146 
mult_zero_left < hcomplex_mult_zero_left 

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

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

1149 
zero_neq_one < {hypreal,hypnat,hcomplex}_zero_not_eq_one 
17423  1150 
right_inverse < hypreal_mult_inverse 
1151 
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

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

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

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

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

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

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

1158 
mult_strict_left_mono < {hypreal,hypnat}_mult_less_mono2 
17423  1159 
add_nonneg_nonneg < hypreal_le_add_order 
1160 

1161 
* Hyperreal: Separate theorems having to do with typespecific 

1162 
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

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

1164 

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

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

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

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

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

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

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

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

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

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

1174 
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

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

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

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

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

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

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

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

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

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

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

1185 
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

1186 
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

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

1188 
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

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

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

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

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

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

1194 
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

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

1196 
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

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

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

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

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

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

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

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

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

1208 
starfun_add_capprox < starfun{C,RC}_add_capprox 
17423  1209 
starfun_add_approx < starfunCR_add_approx 
1210 
starfun_inverse_inverse < starfunC_inverse_inverse 

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

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

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

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

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

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

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

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

1219 

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

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

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

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

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

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

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

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

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

1228 
star_n_one_num < {hypreal,hypnat,hcomplex}_one_num 
17423  1229 
star_n_abs < hypreal_hrabs 
1230 
star_n_divide < hcomplex_divide 

1231 

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

1232 
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

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

1235 
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

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

1237 
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

1238 
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

1239 
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

1240 
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

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

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

1243 
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

1244 
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

1245 
star_of_number_of < {hypreal,hcomplex}_number_of 
17423  1246 
star_of_number_less < number_of_less_hypreal_of_real_iff 
1247 
star_of_number_le < number_of_le_hypreal_of_real_iff 

1248 
star_of_eq_number < hypreal_of_real_eq_number_of_iff 

1249 
star_of_less_number < hypreal_of_real_less_number_of_iff 

1250 
star_of_le_number < hypreal_of_real_le_number_of_iff 

1251 
star_of_power < hypreal_of_real_power 

1252 
star_of_eq_0 < hcomplex_of_complex_zero_iff 

1253 

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

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

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

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

1257 
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

1258 
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

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

1260 

17641  1261 
* Hyperreal: A theory of Taylor series. 
1262 

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

1263 

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

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

1265 

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

1268 
typeinference. 

1269 

1270 
* New simplification procedure for solving continuity conditions; it 

1271 
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

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

1273 

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

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

1276 

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

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

1278 

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

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

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

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

1284 
syntax and examples. 

1285 

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

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

1288 
but the proof obligation additionally includes an admissibility 

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

1290 
with continuity and strictness theorems for Rep and Abs. 

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

1291 

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

1294 

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

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

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

1298 
foo_strict: "foo$UU = UU" 

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

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

1301 

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

1302 

14885  1303 
*** ZF *** 
1304 

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

1307 
of a homomorphism). 

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

1308 

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

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

15703  1312 

1313 

17445  1314 
*** Cube *** 
1315 

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

1317 
theories. 

1318 

1319 

15703  1320 
*** ML *** 
1321 

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

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

1326 
accordingly, while Option.map replaces apsome. 

15973  1327 

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

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

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

1330 
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

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

1332 

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

1333 
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

1334 
toplevel, as they are variants of predefined functions. The following 
16234  1335 
suggests how one can translate existing code: 
15973  1336 

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

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

1339 
last_elem xs = List.last xs 

1340 
flat xss = List.concat xss 

16234  1341 
seq fs = List.app fs 
15973  1342 
partition P xs = List.partition P xs 
1343 
mapfilter f xs = List.mapPartial f xs 

1344 

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

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

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

1347 

17371  1348 
x > f f #> g 
1349 
(x, y) > f f #> g 

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

1350 

17495  1351 
* Pure/library.ML: introduced/changed precedence of infix operators: 
1352 

1353 
infix 1 > > > >> >> >>> #> #>; 

1354 
infix 2 ?; 

1355 
infix 3 o oo ooo oooo; 

1356 
infix 4 ~~ upto downto; 

1357 

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

1359 
infix operators. 

1360 

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

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

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

1364 

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

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

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

1367 

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

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

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

1370 

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

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

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

1373 

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

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

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

1376 

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

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

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

1379 

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

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

1381 
these: 'a option > 'a where 'a = 'b list 
17402  1382 
the_default: 'a > 'a option > 'a 
1383 
the_list: 'a option > 'a list 

1384 

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

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

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

1390 

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

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

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

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

1394 

17564  1395 
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides 
1396 

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

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

1399 

1400 
replacing make_keylist and keyfilter (occassionally used) 

1401 
Naive rewrites: 

1402 

1403 
make_keylist = AList.make 

1404 
keyfilter = AList.find (op =) 

1405 

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