author  wenzelm 
Wed, 07 Jun 2006 02:04:20 +0200  
changeset 19814  faa698d46686 
parent 19783  82f365a14960 
child 19855  ee5cd747c10a 
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 

19814
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

18 
* Theory syntax: some popular names (e.g. "class", "if") are now 
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

19 
keywords. INCOMPATIBILITY, use double quotes. 
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

20 

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

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

22 
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

23 
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

24 
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

25 
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

26 
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

27 
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

28 

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

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

30 

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

31 

17865  32 
*** Document preparation *** 
33 

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

17865  36 

37 

17779  38 
*** Pure *** 
39 

19254  40 
* Command 'no_translations' removes translation rules from theory 
41 
syntax. 

42 

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

43 
* Overloaded definitions are now actually checked for acyclic 
19714  44 
dependencies. The overloading scheme is slightly more general than 
45 
that of Haskell98, although Isabelle does not demand an exact 

46 
correspondence to type class and instance declarations. 

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

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

19711  49 

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

51 
instantiation that matches an instance against the most general 

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

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

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

55 
recursion over such type arguments. Incomplete specification patterns 

19714  56 
impose global constraints on all occurrences, e.g. c('a * 'a) on the 
19715  57 
LHS means that more general c('a * 'b) will be disallowed on any RHS. 
19714  58 
Command 'print_theory' outputs the normalized system of recursive 
59 
equations, see section "definitions". 

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

60 

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

63 

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

65 
then guess x and y by clarify 

66 

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

68 
proof tools being involved here. 

69 

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

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

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

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

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

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

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

78 

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

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

18020  82 

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

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

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

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

87 

18308  88 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
89 

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

91 

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

94 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  95 
'unfolded' attribute may be replaced by firstclass proof text. 
96 

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

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

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

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

100 
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

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

102 

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

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

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

108 
originally first one. 

19220  109 

19814
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

110 
* Isar: schematic goals are no longer restricted to higherorder 
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

111 
patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as 
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

112 
expected. 
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

113 

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

116 
(essentially a disjunction of cases with local parameters and 

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

18910  118 
adequately; in this notation common elimination rules look like this: 
18901  119 

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

121 
assumes "EX x. P x" 

122 
obtains x where "P x" 

123 

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

125 
assumes "A & B" 

126 
obtains A and B 

127 

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

129 
assumes "A  B" 

130 
obtains 

131 
A 

132 
 B 

133 

18910  134 
The subsequent classical rules even refer to the formal "thesis" 
18901  135 
explicitly: 
136 

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

138 
obtains "~ thesis" 

139 

18910  140 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
141 
obtains "thesis ==> something" 

18901  142 

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

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

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

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

148 
case_names). 

18901  149 

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

152 
toplevel lemma. 

153 

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

156 

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

159 
to occur. 

160 

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

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

162 
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

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

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

165 

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

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

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

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

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

170 

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

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

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

175 

19665  176 
axiomatization 
177 
eq (infix "===" 50) 

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

179 

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

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

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

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

183 

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

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

187 

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

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

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

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

195 

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

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

199 
'translations' in common applications. 

19084  200 

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

201 
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

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

203 
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

204 
'translations' with explicit "CONST" markup to accommodate this. 
19665  205 

19783  206 
* Isar/locales: improved parameter handling: 
207 
 use of locales "var" and "struct" no longer necessary; 

208 
 parameter renamings are no longer required to be injective. 

209 
This enables, for example, to define a locale for endomorphisms thus: 

210 
locale endom = homom mult mult h. 

211 

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

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

215 
(using objectlogic connectives for this purpose has been long 

216 
obsolete anyway). The subsequent proof patterns illustrate advanced 

217 
techniques of natural induction; general datatypes and inductive sets 

18267  218 
work analogously (see also src/HOL/Lambda for realistic examples). 
219 

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

18239  221 
parameters: 
18233  222 

223 
lemma 

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

225 
assumes a: "A n x" 

226 
shows "P n x" 

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

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

18248  229 
case 0 
18233  230 
show ?case sorry 
231 
next 

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

18233  235 
show ?case sorry 
236 
qed 

237 

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

243 
lemma 

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

245 
assumes a: "A (a x)" 

246 
shows "P (a x)" 

247 
using a 

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

249 
... 

250 

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

253 

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

256 
encodings: 

257 

258 
lemma 

259 
fixes n :: nat 

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

18267  261 
proof (induct n fixing: thesis) 
262 
case 0 

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

18399  264 
then show thesis by (rule 0) 
18267  265 
next 
266 
case (Suc n) 

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

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

269 
then show thesis by (rule Suc.prems) 

270 
qed 

271 

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

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

274 
existence statement through the induction as expected. 

18233  275 

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

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

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

278 
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

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

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

281 

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

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

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

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

285 

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

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

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

288 

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

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

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

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

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

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

294 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

313 

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

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

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

316 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

344 

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

345 
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

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

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

348 

18507  349 
lemma 
350 
shows "a : A ==> P1 a" 

351 
"a : A ==> P2 a" 

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

353 
"b : B ==> Q2 b" 

354 
"b : B ==> Q3 b" 

355 
proof (induct set: A B) 

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

356 

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

359 

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

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

363 
have been suppressed. 

364 

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

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

366 
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

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

368 

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

371 
least one premise. 

372 

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

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

377 

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

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

379 
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

380 
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

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

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

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

384 

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

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

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

387 
for example "A > B" => "Pi A (%_. B)". 
17779  388 

17865  389 

17806  390 
*** HOL *** 
391 

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

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

395 

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

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

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

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

400 
op * ~> HOL.times 
19277  401 
op < ~> Orderings.less 
402 
op <= ~> Orderings.less_eq 

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

403 

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

404 
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

405 

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

408 
may go wrong. 

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

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

410 

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

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

413 

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

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

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

418 
distribution). 

419 
INCOMPATIBILITY: rewrite proofs 

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

420 

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

421 
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

422 
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

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

424 

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

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

429 

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

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

17779  433 

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

19211  436 
* Theorem Cons_eq_map_conv no longer has attribute `simp'. 
437 

19279  438 
* Theorem setsum_mult renamed to setsum_right_distrib. 
439 

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

442 

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

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

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

447 

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

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

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

450 

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

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

452 

18446  453 
* Library: added theory Coinductive_List of potentially infinite lists 
454 
as greatest fixedpoint. 

18399  455 

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

458 

19254  459 

19653  460 
*** HOLComplex *** 
461 

462 
* Theory Real: new method ferrack implements quantifier elimination 

463 
for linear arithmetic over the reals. The quantifier elimination 

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

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

466 

467 

17878  468 
*** ML *** 
469 

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

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

471 

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

472 
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

473 
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

474 

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

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

478 
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

479 
sequence. "fold_burrow" has an additional context. 
18540  480 

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

482 
"unflat" from the user. 

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

483 

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

486 

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

487 
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

488 
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

489 

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

492 
given more convenient names and signatures reminiscent of similar 

493 
functions for alists, tables, etc: 

18051  494 

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

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

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

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

499 

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

502 

19653  503 
* Pure/library: general ``divide_and_conquer'' combinator on lists. 
504 

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

19032  508 
* Pure/General/rat.ML implements rational numbers. 
509 

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

511 
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

512 
admits slightly more efficient complex applications. 
18446  513 

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

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

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

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

520 

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

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

18738  524 
minimizing code duplication. Thm.rule_attribute and 
525 
Thm.declaration_attribute build canonical attributes; see also 

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

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

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

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

529 

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

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

533 

19814
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

534 
* Pure: Logic.(un)varify only works in a global context, which is now 
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

535 
enforced instead of silently assumed. INCOMPATIBILITY, may use 
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

536 
Logic.legacy_(un)varify as temporary workaround. 
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

537 

19508  538 
* Pure: axiomatic type classes are now purely definitional, with 
539 
explicit proofs of class axioms and super class relations performed 

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

541 
notably AxClass.define_class supercedes AxClass.add_axclass, and 

542 
AxClass.axiomatize_class/classrel/arity supercede 

543 
Sign.add_classes/classrel/arities. 

544 

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

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

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

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

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

549 
attributes, methods, etc. 
18642  550 

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

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

554 
fold_map combinators. 

18051  555 

18020  556 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  557 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  558 
achieve the old behaviour. 
559 

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

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

562 
statements. 

563 

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

565 
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

566 
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

567 
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

568 
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

569 

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

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

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

573 
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

574 
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

575 

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

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

577 

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

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

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

581 

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

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

583 

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

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

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

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

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

588 

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

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

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

591 

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

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

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

594 

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

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

596 
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

597 
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

598 
batch mode. 
18567  599 

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

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

17890  603 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  604 
(solver, looper etc.) may depend on arbitrary proof data. 
605 

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

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

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

609 
former Simplifier.inherit_bounds, which is already included here  

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

17878  612 

613 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

616 
INCOMPATIBILITY. 

617 

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

620 

17878  621 

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

622 

17720  623 
New in Isabelle2005 (October 2005) 
624 
 

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

625 

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

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

627 

15130  628 
* Theory headers: the new header syntax for Isar theories is 
629 

630 
theory <name> 

16234  631 
imports <theory1> ... <theoryN> 
632 
uses <file1> ... <fileM> 

15130  633 
begin 
634 

16234  635 
where the 'uses' part is optional. The previous syntax 
636 

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

638 

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

17371  641 
nonIsar theories now, but these will disappear soon. 
15130  642 

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

643 
* Theory loader: parent theories can now also be referred to via 
16234  644 
relative and absolute paths. 
645 

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

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

647 
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

648 
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

649 
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

650 
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

651 
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

652 
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

653 
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

654 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  655 

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

656 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  657 

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

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

660 
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

661 

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

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

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

664 

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

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

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

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

17385  672 

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

675 
faster. 

676 

15703  677 

678 
*** Document preparation *** 

679 

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

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

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

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

685 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

686 

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

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

688 
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

689 
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

690 
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

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

692 
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

693 
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

694 
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

695 
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

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

697 

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

698 
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

699 
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

700 
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

701 
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

702 
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

703 
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

704 
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

705 
specified above. 
16234  706 

17402  707 
* Several new antiquotations: 
15979  708 

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

710 

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

712 

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

15979  715 

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

16234  717 
theorem applying a "style" to it 
718 

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

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

720 

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

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

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

727 
typechecked ML expressions verbatim. 
16234  728 

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

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

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

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

733 

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

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

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

737 

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

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

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

740 

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

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

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

743 

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

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

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

746 

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

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

748 
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

749 
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

750 

16234  751 

752 
*** Pure *** 

753 

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

755 
automatic typeinference of declared constants; additional support for 

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

757 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

758 
sequential dependencies of definitions within a single 'constdefs' 

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

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

761 

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

763 
indexed syntax provides a notational device for subscripted 

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

765 
expressions. Secondly, in a local context with structure 

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

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

768 
show_structs controls printing of implicit structures. Typical 

769 
applications of these concepts involve record types and locales. 

770 

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

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

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

774 

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

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

777 
parsing/printing, see also isarref manual. 

778 

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

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

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

783 
INCOMPATIBILITY. 

784 

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

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

786 
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

787 
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

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

789 

16234  790 
* Improved internal renaming of symbolic identifiers  attach primes 
791 
instead of base 26 numbers. 

792 

793 
* New flag show_question_marks controls printing of leading question 

794 
marks in schematic variable names. 

795 

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

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

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

799 

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

801 
by simp 

802 

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

804 

17548  805 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  806 
annotations as "(00...)". 
807 

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

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

810 
Before that distinction was only partially implemented via type class 

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

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

813 
exotic syntax specifications may require further adaption 

17691  814 
(e.g. Cube/Cube.thy). 
16234  815 

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

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

818 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

819 
specifications. 

820 

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

823 

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

826 
Limit. 

827 

828 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

834 
allow for use in a context of fixed variables. 

835 

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

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

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

839 

17597  840 
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. 
17590  841 

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

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

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

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

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

848 

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

850 
selections of theorems in named facts via index ranges. 

851 

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

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

853 
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

854 
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

855 

17397  856 
* 'hide': option '(open)' hides only base names. 
857 

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

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

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

860 

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

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

864 
must be quoted when used as identifiers. 

865 

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

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

868 
quoted when used as identifier. 

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

869 

16234  870 

871 
*** Locales *** 

17095  872 

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

875 
proof obligations from the expression specification. After the 

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

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

878 
commands is a follows: 

879 

17095  880 
(1) interpretation expr inst 
881 
(2) interpretation target < expr 

882 
(3) interpret expr inst 

17385  883 

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

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

888 
locale expression. Interpretation is smart in that interpretations 

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

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

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

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

16234  894 

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

896 
'interpret' instead. 

897 

17385  898 
* New context element 'constrains' for adding type constraints to 
899 
parameters. 

900 

901 
* Context expressions: renaming of parameters with syntax 

902 
redeclaration. 

17095  903 

904 
* Locale declaration: 'includes' disallowed. 

905 

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

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

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

910 
to attribute arguments as expected. 

911 

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

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

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

915 
Attribute implementations need to cooperate properly with the static 

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

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

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

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

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

921 
values to argument tokens explicitly. 

922 

923 
* Changed parameter management in theorem generation for long goal 

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

925 
theorem statement in rare situations. 

926 

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

929 

16234  930 

931 
*** Provers *** 

932 

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

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

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

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

937 
still available as 'simplesubst'. 

938 

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

940 
and quasi orders. 

941 

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

943 
reflexivetransitive closure of relations. 

944 

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

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

947 

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

949 
is peformed already. Objectlogics merely need to finish their 

950 
initial simpset configuration as before. INCOMPATIBILITY. 

15703  951 

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

952 

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

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

954 

16234  955 
* Symbolic syntax of Hilbert Choice Operator is now as follows: 
14878  956 

957 
syntax (epsilon) 

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

959 

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

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

963 
becomes available as variable, constant etc. INCOMPATIBILITY, 

964 

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

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

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

968 
support corresponding Isar calculations. 
16234  969 

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

971 
instead of ":". 

972 

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

974 

975 
Old New 

976 
{..n(} {..<n} 

977 
{)n..} {n<..} 

978 
{m..n(} {m..<n} 

979 
{)m..n} {m<..n} 

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

981 

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

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

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

15046  985 

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

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

988 

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

991 
interface. 

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

992 

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

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

998 
Some new syntax forms are available: 

999 

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

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

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

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

1004 

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

1006 
function "Summation", which has been discontinued. 

1007 

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

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

1010 
(insert F x)'. 

1011 

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

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

1014 
typedefs, inductive datatypes and recursion. 

1015 

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

1018 
HOL/ex/SAT_Examples.thy for examples. 

17619  1019 

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

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

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

1024 
in unstructured proof scripts. 

1025 

1026 
* Reworked implementation of records. Improved scalability for 

1027 
records with many fields, avoiding performance problems for type 

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

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

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

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

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

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

1034 
<record_name>_ext_type. 

1035 

1036 
Flag record_quick_and_dirty_sensitive can be enabled to skip the 

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

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

1039 
quite long. 

1040 

1041 
New simproc record_upd_simproc for simplification of multiple record 

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

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

1044 
occasionally, since simplification is more powerful by default. 

1045 

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

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

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

1048 

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

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

1052 
old proofs break occasionally as simplification may now solve more 

1053 
goals than previously. 

1054 

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

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

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

1058 
just like y <= x. 

1059 

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

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

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

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

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

1065 
enabled/disabled by the reference use_let_simproc. Potential 

1066 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  1067 

16563  1068 
* Classical reasoning: the meson method now accepts theorems as arguments. 
1069 

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

1072 

16891  1073 
* Theory OrderedGroup and Ring_and_Field: various additions and 
1074 
improvements to faciliate calculations involving equalities and 

1075 
inequalities. 

1076 

1077 
The following theorems have been eliminated or modified 

1078 
(INCOMPATIBILITY): 

16888  1079 

1080 
abs_eq now named abs_of_nonneg 

17371  1081 
abs_of_ge_0 now named abs_of_nonneg 
1082 
abs_minus_eq now named abs_of_nonpos 

16888  1083 
imp_abs_id now named abs_of_nonneg 
1084 
imp_abs_neg_id now named abs_of_nonpos 

1085 
mult_pos now named mult_pos_pos 

1086 
mult_pos_le now named mult_nonneg_nonneg 

1087 
mult_pos_neg_le now named mult_nonneg_nonpos 

1088 
mult_pos_neg2_le now named mult_nonneg_nonpos2 

1089 
mult_neg now named mult_neg_neg 

1090 
mult_neg_le now named mult_nonpos_nonpos 

1091 

16891  1092 
* Theory Parity: added rules for simplifying exponents. 
1093 

17092  1094 
* Theory List: 
1095 

1096 
The following theorems have been eliminated or modified 

1097 
(INCOMPATIBILITY): 

1098 

1099 
list_all_Nil now named list_all.simps(1) 

1100 
list_all_Cons now named list_all.simps(2) 

1101 
list_all_conv now named list_all_iff 

1102 
set_mem_eq now named mem_iff 

1103 

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

1106 

16888  1107 

1108 
*** HOLComplex *** 

1109 

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

1112 

1113 
The following theorems have been eliminated or modified 

1114 
(INCOMPATIBILITY): 

1115 

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

1116 
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

1117 
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

1118 
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

1119 
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

1120 
real_of_int_mult reversed direction of equality (use [symmetric]) 
16891  1121 

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

16888  1123 

16962  1124 
* Theory Ln is new, with properties of the natural logarithm 
1125 

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

1128 

1129 
hypreal = real star 

1130 
hypnat = nat star 

1131 
hcomplex = complex star 

1132 

1133 
* Hyperreal: Many groups of similarlydefined constants have been 

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

1134 
replaced by polymorphic versions (INCOMPATIBILITY): 
17423  1135 

1136 
star_of < hypreal_of_real, hypnat_of_nat, hcomplex_of_complex 

1137 

1138 
starset < starsetNat, starsetC 

1139 
*s* < *sNat*, *sc* 

1140 
starset_n < starsetNat_n, starsetC_n 

1141 
*sn* < *sNatn*, *scn* 

1142 
InternalSets < InternalNatSets, InternalCSets 

1143 

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

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

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

1148 
InternalFuns < InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs 
17423  1149 

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

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

1152 

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

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

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

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

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

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

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

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

1161 
mult_1_left < {hypreal,hypnat}_mult_1, hcomplex_mult_one_left 
17423  1162 
mult_1_right < hcomplex_mult_one_right 
1163 
mult_zero_left < hcomplex_mult_zero_left 

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

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

1166 
zero_neq_one < {hypreal,hypnat,hcomplex}_zero_not_eq_one 
17423  1167 
right_inverse < hypreal_mult_inverse 
1168 
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

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

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

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

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

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

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

1175 
mult_strict_left_mono < {hypreal,hypnat}_mult_less_mono2 
17423  1176 
add_nonneg_nonneg < hypreal_le_add_order 
1177 

1178 
* Hyperreal: Separate theorems having to do with typespecific 

1179 
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

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

1181 

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

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

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

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

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

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

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

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

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

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

1191 
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

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

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

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

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

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

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

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

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

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

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

1202 
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

1203 
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

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

1205 
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

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

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

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

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

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

1211 
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

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

1213 
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

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

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

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

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

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

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

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

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

1225 
starfun_add_capprox < starfun{C,RC}_add_capprox 
17423  1226 
starfun_add_approx < starfunCR_add_approx 
1227 
starfun_inverse_inverse < starfunC_inverse_inverse 

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

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

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

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

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

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

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

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

1236 

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

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

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

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

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

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

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

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

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

1245 
star_n_one_num < {hypreal,hypnat,hcomplex}_one_num 
17423  1246 
star_n_abs < hypreal_hrabs 
1247 
star_n_divide < hcomplex_divide 

1248 

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

1249 
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

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

1252 
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

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

1254 
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

1255 
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

1256 
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

1257 
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

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

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

1260 
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

1261 
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

1262 
star_of_number_of < {hypreal,hcomplex}_number_of 
17423  1263 
star_of_number_less < number_of_less_hypreal_of_real_iff 
1264 
star_of_number_le < number_of_le_hypreal_of_real_iff 

1265 
star_of_eq_number < hypreal_of_real_eq_number_of_iff 

1266 
star_of_less_number < hypreal_of_real_less_number_of_iff 

1267 
star_of_le_number < hypreal_of_real_le_number_of_iff 

1268 
star_of_power < hypreal_of_real_power 

1269 
star_of_eq_0 < hcomplex_of_complex_zero_iff 

1270 

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

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

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

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

1274 
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

1275 
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

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

1277 

17641  1278 
* Hyperreal: A theory of Taylor series. 
1279 

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

1280 

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

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

1282 

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

1285 
typeinference. 

1286 

1287 
* New simplification procedure for solving continuity conditions; it 

1288 
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

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

1290 

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

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

1293 

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

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

1295 

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

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

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

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

1301 
syntax and examples. 

1302 

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

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

1305 
but the proof obligation additionally includes an admissibility 

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

1307 
with continuity and strictness theorems for Rep and Abs. 

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

1308 

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

1311 

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

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

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

1315 
foo_strict: "foo$UU = UU" 

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

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

1318 

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

1319 

14885  1320 
*** ZF *** 
1321 

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

1324 
of a homomorphism). 

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

1325 

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

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

15703  1329 

1330 

17445  1331 
*** Cube *** 
1332 

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

1334 
theories. 

1335 

1336 

15703  1337 
*** ML *** 
1338 

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

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

1343 
accordingly, while Option.map replaces apsome. 

15973  1344 

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

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

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

1347 
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

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

1349 

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

1350 
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

1351 
toplevel, as they are variants of predefined functions. The following 
16234  1352 
suggests how one can translate existing code: 
15973  1353 

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

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

1356 
last_elem xs = List.last xs 

1357 
flat xss = List.concat xss 

16234  1358 
seq fs = List.app fs 
15973  1359 
partition P xs = List.partition P xs 
1360 
mapfilter f xs = List.mapPartial f xs 

1361 

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

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

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

1364 

17371  1365 
x > f f #> g 
1366 
(x, y) > f f #> g 

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

1367 

17495  1368 
* Pure/library.ML: introduced/changed precedence of infix operators: 
1369 

1370 
infix 1 > > > >> >> >>> #> #>; 

1371 
infix 2 ?; 

1372 
infix 3 o oo ooo oooo; 

1373 
infix 4 ~~ upto downto; 

1374 

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

1376 
infix operators. 

1377 

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

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

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

1381 

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

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

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

1384 

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

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

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

1387 

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

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

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

1390 

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

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

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

1393 

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

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

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

1396 

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

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

1398 
these: 'a option > 'a where 'a = 'b list 
17402  1399 
the_default: 'a > 'a option > 'a 
1400 
the_list: 'a option > 'a list 

1401 

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

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

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

1407 

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

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

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

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

1411 

17564  1412 
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides 
1413 