author  wenzelm 
Tue, 10 Jan 2006 19:36:59 +0100  
changeset 18644  b59766bc66c9 
parent 18642  6954633b6a76 
child 18674  98d380757893 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

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

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

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

6 

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

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

8 

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

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

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

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

12 

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

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

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

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

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

17 

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

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

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

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

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

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

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

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

25 

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

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

27 

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

28 

17865  29 
*** Document preparation *** 
30 

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

17865  33 

34 

17779  35 
*** Pure *** 
36 

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

39 

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

41 
then guess x and y by clarify 

42 

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

44 
proof tools being involved here. 

45 

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

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

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

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

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

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

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

54 

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

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

18020  58 

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

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

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

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

63 

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

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

67 

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

70 
metalevel equations. Thus many occurrences of the 'unfold' method or 

71 
'unfolded' attribute may be replaced by firstclass proof text. 

72 

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

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

76 
(using objectlogic connectives for this purpose has been long 

77 
obsolete anyway). The subsequent proof patterns illustrate advanced 

78 
techniques of natural induction; general datatypes and inductive sets 

18267  79 
work analogously (see also src/HOL/Lambda for realistic examples). 
80 

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

18239  82 
parameters: 
18233  83 

84 
lemma 

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

86 
assumes a: "A n x" 

87 
shows "P n x" 

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

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

18248  90 
case 0 
18233  91 
show ?case sorry 
92 
next 

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

18233  96 
show ?case sorry 
97 
qed 

98 

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

104 
lemma 

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

106 
assumes a: "A (a x)" 

107 
shows "P (a x)" 

108 
using a 

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

110 
... 

111 

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

114 

115 
(3) This is how to perform existential reasoning ('obtain') by 

116 
induction, while avoiding explicit objectlogic encodings: 

117 

118 
fix n :: nat 

119 
obtain x :: 'a where "P n x" and "Q n x" 

120 
proof (induct n fixing: thesis) 

121 
case 0 

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

18399  123 
then show thesis by (rule 0) 
18267  124 
next 
125 
case (Suc n) 

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

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

128 
then show thesis by (rule Suc.prems) 

129 
qed 

130 

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

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

133 
existence statement through the induction as expected. 

18233  134 

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

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

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

137 
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

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

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

140 

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

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

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

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

144 

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

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

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

147 

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

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

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

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

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

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

153 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

172 

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

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

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

175 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

203 

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

204 
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

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

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

207 

18507  208 
lemma 
209 
shows "a : A ==> P1 a" 

210 
"a : A ==> P2 a" 

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

212 
"b : B ==> Q2 b" 

213 
"b : B ==> Q3 b" 

214 
proof (induct set: A B) 

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

215 

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

218 

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

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

220 
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

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

222 

18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18549
diff
changeset

223 
* Provers/classical: stricter checks to ensure that supplied intro, dest and 
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18549
diff
changeset

224 
elim rules are wellformed; dest and elim rules must have at least one premise. 
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18549
diff
changeset

225 

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

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

227 
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

228 
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

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

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

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

232 

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

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

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

235 
for example "A > B" => "Pi A (%_. B)". 
17779  236 

17865  237 

17806  238 
*** HOL *** 
239 

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

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

243 

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

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

17779  247 

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

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

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

252 

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

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

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

255 

18446  256 
* Library: added theory Coinductive_List of potentially infinite lists 
257 
as greatest fixedpoint. 

18399  258 

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

259 

17878  260 
*** ML *** 
261 

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

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

263 

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

264 
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

265 
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

266 

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

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

270 
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

271 
sequence. "fold_burrow" has an additional context. 
18540  272 

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

274 
"unflat" from the user. 

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

275 

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

278 

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

279 
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

280 
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

281 

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

284 
given more convenient names and signatures reminiscent of similar 

285 
functions for alists, tables, etc: 

18051  286 

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

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

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

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

291 

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

294 

295 
* Pure/General: name_mangler.ML provides a functor for generic name 

296 
mangling (bijective mapping from any expression values to strings). 

297 

298 
* Pure/General: rat.ML implements rational numbers. 

299 

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

304 
* Pure: type Context.generic attribute is now the preferred 

305 
representation for global vs. local attributes while avoiding code 

306 
duplication; Attrib.theory/context/generic converts between different 

307 
types of attributes. Various Pure/HOL/ZF packages work with generic 

308 
attributes now, INCOMPATIBILITY. 

309 

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

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

313 
fold_map combinators. 

18051  314 

18020  315 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  316 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  317 
achieve the old behaviour. 
318 

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

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

321 
statements. 

322 

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

324 
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

325 
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

326 
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

327 
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

328 

18590
f6a553aa3d81
Pure/Isar: Toplevel.theory_to_proof admits transactions that modify the theory;
wenzelm
parents:
18568
diff
changeset

329 
* Pure/Isar: Toplevel.theory_to_proof admits transactions that modify 
f6a553aa3d81
Pure/Isar: Toplevel.theory_to_proof admits transactions that modify the theory;
wenzelm
parents:
18568
diff
changeset

330 
the theory before entering a proof state. Transactions now always see 
f6a553aa3d81
Pure/Isar: Toplevel.theory_to_proof admits transactions that modify the theory;
wenzelm
parents:
18568
diff
changeset

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

332 
batch mode. 
18567  333 

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

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

17890  337 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  338 
(solver, looper etc.) may depend on arbitrary proof data. 
339 

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

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

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

343 
former Simplifier.inherit_bounds, which is already included here  

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

17878  346 

347 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

350 
INCOMPATIBILITY. 

351 

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

354 

17878  355 

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

356 

17720  357 
New in Isabelle2005 (October 2005) 
358 
 

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

359 

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

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

361 

15130  362 
* Theory headers: the new header syntax for Isar theories is 
363 

364 
theory <name> 

16234  365 
imports <theory1> ... <theoryN> 
366 
uses <file1> ... <fileM> 

15130  367 
begin 
368 

16234  369 
where the 'uses' part is optional. The previous syntax 
370 

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

372 

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

17371  375 
nonIsar theories now, but these will disappear soon. 
15130  376 

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

377 
* Theory loader: parent theories can now also be referred to via 
16234  378 
relative and absolute paths. 
379 

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

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

381 
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

382 
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

383 
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

384 
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

385 
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

386 
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

387 
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

388 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  389 

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

390 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  391 

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

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

394 
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

395 

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

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

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

398 

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

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

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

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

17385  406 

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

409 
faster. 

410 

15703  411 

412 
*** Document preparation *** 

413 

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

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

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

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

419 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

420 

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

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

422 
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

423 
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

424 
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

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

426 
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

427 
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

428 
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

429 
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

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

431 

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

432 
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

433 
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

434 
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

435 
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

436 
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

437 
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

438 
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

439 
specified above. 
16234  440 

17402  441 
* Several new antiquotations: 
15979  442 

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

444 

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

446 

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

15979  449 

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

16234  451 
theorem applying a "style" to it 
452 

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

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

454 

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

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

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

461 
typechecked ML expressions verbatim. 
16234  462 

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

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

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

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

467 

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

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

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

471 

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

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

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

474 

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

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

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

477 

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

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

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

480 

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

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

482 
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

483 
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

484 

16234  485 

486 
*** Pure *** 

487 

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

489 
automatic typeinference of declared constants; additional support for 

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

491 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

492 
sequential dependencies of definitions within a single 'constdefs' 

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

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

495 

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

497 
indexed syntax provides a notational device for subscripted 

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

499 
expressions. Secondly, in a local context with structure 

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

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

502 
show_structs controls printing of implicit structures. Typical 

503 
applications of these concepts involve record types and locales. 

504 

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

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

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

508 

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

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

511 
parsing/printing, see also isarref manual. 

512 

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

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

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

517 
INCOMPATIBILITY. 

518 

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

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

520 
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

521 
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

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

523 

16234  524 
* Improved internal renaming of symbolic identifiers  attach primes 
525 
instead of base 26 numbers. 

526 

527 
* New flag show_question_marks controls printing of leading question 

528 
marks in schematic variable names. 

529 

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

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

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

533 

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

535 
by simp 

536 

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

538 

17548  539 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  540 
annotations as "(00...)". 
541 

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

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

544 
Before that distinction was only partially implemented via type class 

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

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

547 
exotic syntax specifications may require further adaption 

17691  548 
(e.g. Cube/Cube.thy). 
16234  549 

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

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

552 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

553 
specifications. 

554 

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

557 

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

560 
Limit. 

561 

562 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

568 
allow for use in a context of fixed variables. 

569 

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

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

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

573 

17597  574 
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. 
17590  575 

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

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

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

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

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

582 

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

584 
selections of theorems in named facts via index ranges. 

585 

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

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

587 
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

588 
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

589 

17397  590 
* 'hide': option '(open)' hides only base names. 
591 

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

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

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

594 

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

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

598 
must be quoted when used as identifiers. 

599 

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

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

602 
quoted when used as identifier. 

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

603 

16234  604 

605 
*** Locales *** 

17095  606 

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

609 
proof obligations from the expression specification. After the 

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

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

612 
commands is a follows: 

613 

17095  614 
(1) interpretation expr inst 
615 
(2) interpretation target < expr 

616 
(3) interpret expr inst 

17385  617 

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

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

622 
locale expression. Interpretation is smart in that interpretations 

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

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

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

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

16234  628 

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

630 
'interpret' instead. 

631 

17385  632 
* New context element 'constrains' for adding type constraints to 
633 
parameters. 

634 

635 
* Context expressions: renaming of parameters with syntax 

636 
redeclaration. 

17095  637 

638 
* Locale declaration: 'includes' disallowed. 

639 

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

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

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

644 
to attribute arguments as expected. 

645 

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

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

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

649 
Attribute implementations need to cooperate properly with the static 

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

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

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

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

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

655 
values to argument tokens explicitly. 

656 

657 
* Changed parameter management in theorem generation for long goal 

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

659 
theorem statement in rare situations. 

660 

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

663 

16234  664 

665 
*** Provers *** 

666 

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

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

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

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

671 
still available as 'simplesubst'. 

672 

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

674 
and quasi orders. 

675 

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

677 
reflexivetransitive closure of relations. 

678 

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

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

681 

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

683 
is peformed already. Objectlogics merely need to finish their 

684 
initial simpset configuration as before. INCOMPATIBILITY. 

15703  685 

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

686 

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

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

688 

16234  689 
* Symbolic syntax of Hilbert Choice Operator is now as follows: 
14878  690 

691 
syntax (epsilon) 

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

693 

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

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

697 
becomes available as variable, constant etc. INCOMPATIBILITY, 

698 

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

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

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

702 
support corresponding Isar calculations. 
16234  703 

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

705 
instead of ":". 

706 

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

708 

709 
Old New 

710 
{..n(} {..<n} 

711 
{)n..} {n<..} 

712 
{m..n(} {m..<n} 

713 
{)m..n} {m<..n} 

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

715 

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

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

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

15046  719 

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

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

722 

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

725 
interface. 

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

726 

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

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

732 
Some new syntax forms are available: 

733 

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

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

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

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

738 

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

740 
function "Summation", which has been discontinued. 

741 

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

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

744 
(insert F x)'. 

745 

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

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

748 
typedefs, inductive datatypes and recursion. 

749 

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

752 
HOL/ex/SAT_Examples.thy for examples. 

17619  753 

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

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

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

758 
in unstructured proof scripts. 

759 

760 
* Reworked implementation of records. Improved scalability for 

761 
records with many fields, avoiding performance problems for type 

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

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

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

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

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

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

768 
<record_name>_ext_type. 

769 

770 
Flag record_quick_and_dirty_sensitive can be enabled to skip the 

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

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

773 
quite long. 

774 

775 
New simproc record_upd_simproc for simplification of multiple record 

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

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

778 
occasionally, since simplification is more powerful by default. 

779 

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

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

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

782 

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

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

786 
old proofs break occasionally as simplification may now solve more 

787 
goals than previously. 

788 

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

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

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

792 
just like y <= x. 

793 

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

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

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

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

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

799 
enabled/disabled by the reference use_let_simproc. Potential 

800 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  801 

16563  802 
* Classical reasoning: the meson method now accepts theorems as arguments. 
803 

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

806 

16891  807 
* Theory OrderedGroup and Ring_and_Field: various additions and 
808 
improvements to faciliate calculations involving equalities and 

809 
inequalities. 

810 

811 
The following theorems have been eliminated or modified 

812 
(INCOMPATIBILITY): 

16888  813 

814 
abs_eq now named abs_of_nonneg 

17371  815 
abs_of_ge_0 now named abs_of_nonneg 
816 
abs_minus_eq now named abs_of_nonpos 

16888  817 
imp_abs_id now named abs_of_nonneg 
818 
imp_abs_neg_id now named abs_of_nonpos 

819 
mult_pos now named mult_pos_pos 

820 
mult_pos_le now named mult_nonneg_nonneg 

821 
mult_pos_neg_le now named mult_nonneg_nonpos 

822 
mult_pos_neg2_le now named mult_nonneg_nonpos2 

823 
mult_neg now named mult_neg_neg 

824 
mult_neg_le now named mult_nonpos_nonpos 

825 

16891  826 
* Theory Parity: added rules for simplifying exponents. 
827 

17092  828 
* Theory List: 
829 

830 
The following theorems have been eliminated or modified 

831 
(INCOMPATIBILITY): 

832 

833 
list_all_Nil now named list_all.simps(1) 

834 
list_all_Cons now named list_all.simps(2) 

835 
list_all_conv now named list_all_iff 

836 
set_mem_eq now named mem_iff 

837 

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

840 

16888  841 

842 
*** HOLComplex *** 

843 

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

846 

847 
The following theorems have been eliminated or modified 

848 
(INCOMPATIBILITY): 

849 

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

850 
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

851 
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

852 
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

853 
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

854 
real_of_int_mult reversed direction of equality (use [symmetric]) 
16891  855 

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

16888  857 

16962  858 
* Theory Ln is new, with properties of the natural logarithm 
859 

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

862 

863 
hypreal = real star 

864 
hypnat = nat star 

865 
hcomplex = complex star 

866 

867 
* Hyperreal: Many groups of similarlydefined constants have been 

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

868 
replaced by polymorphic versions (INCOMPATIBILITY): 
17423  869 

870 
star_of < hypreal_of_real, hypnat_of_nat, hcomplex_of_complex 

871 

872 
starset < starsetNat, starsetC 

873 
*s* < *sNat*, *sc* 

874 
starset_n < starsetNat_n, starsetC_n 

875 
*sn* < *sNatn*, *scn* 

876 
InternalSets < InternalNatSets, InternalCSets 

877 

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

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

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

882 
InternalFuns < InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs 
17423  883 

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

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

886 

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

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

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

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

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

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

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

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

895 
mult_1_left < {hypreal,hypnat}_mult_1, hcomplex_mult_one_left 
17423  896 
mult_1_right < hcomplex_mult_one_right 
897 
mult_zero_left < hcomplex_mult_zero_left 

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

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

900 
zero_neq_one < {hypreal,hypnat,hcomplex}_zero_not_eq_one 
17423  901 
right_inverse < hypreal_mult_inverse 
902 
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

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

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

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

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

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

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

909 
mult_strict_left_mono < {hypreal,hypnat}_mult_less_mono2 
17423  910 
add_nonneg_nonneg < hypreal_le_add_order 
911 

912 
* Hyperreal: Separate theorems having to do with typespecific 

913 
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

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

915 

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

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

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

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

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

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

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

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

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

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

925 
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

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

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

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

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

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

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

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

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

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

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

936 
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

937 
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

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

939 
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

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

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

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

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

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

945 
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

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

947 
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

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

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

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

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

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

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

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

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

959 
starfun_add_capprox < starfun{C,RC}_add_capprox 
17423  960 
starfun_add_approx < starfunCR_add_approx 
961 
starfun_inverse_inverse < starfunC_inverse_inverse 

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

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

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

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

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

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

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

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

970 

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

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

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

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

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

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

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

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

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

979 
star_n_one_num < {hypreal,hypnat,hcomplex}_one_num 
17423  980 
star_n_abs < hypreal_hrabs 
981 
star_n_divide < hcomplex_divide 

982 

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

983 
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

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

986 
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

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

988 
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

989 
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

990 
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

991 
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

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

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

994 
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

995 
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

996 
star_of_number_of < {hypreal,hcomplex}_number_of 
17423  997 
star_of_number_less < number_of_less_hypreal_of_real_iff 
998 
star_of_number_le < number_of_le_hypreal_of_real_iff 

999 
star_of_eq_number < hypreal_of_real_eq_number_of_iff 

1000 
star_of_less_number < hypreal_of_real_less_number_of_iff 

1001 
star_of_le_number < hypreal_of_real_le_number_of_iff 

1002 
star_of_power < hypreal_of_real_power 

1003 
star_of_eq_0 < hcomplex_of_complex_zero_iff 

1004 

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

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

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

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

1008 
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

1009 
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

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

1011 

17641  1012 
* Hyperreal: A theory of Taylor series. 
1013 

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

1014 

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

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

1016 

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

1019 
typeinference. 

1020 

1021 
* New simplification procedure for solving continuity conditions; it 

1022 
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

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

1024 

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

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

1027 

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

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

1029 

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

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

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

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

1035 
syntax and examples. 

1036 

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

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

1039 
but the proof obligation additionally includes an admissibility 

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

1041 
with continuity and strictness theorems for Rep and Abs. 

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

1042 

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

1045 

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

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

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

1049 
foo_strict: "foo$UU = UU" 

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

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

1052 

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

1053 

14885  1054 
*** ZF *** 
1055 

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

1058 
of a homomorphism). 

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

1059 

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

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

15703  1063 

1064 

17445  1065 
*** Cube *** 
1066 

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

1068 
theories. 

1069 

1070 

15703  1071 
*** ML *** 
1072 

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

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

1077 
accordingly, while Option.map replaces apsome. 

15973  1078 

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

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

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

1081 
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

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

1083 

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

1084 
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

1085 
toplevel, as they are variants of predefined functions. The following 
16234  1086 
suggests how one can translate existing code: 
15973  1087 

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

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

1090 
last_elem xs = List.last xs 

1091 
flat xss = List.concat xss 

16234  1092 
seq fs = List.app fs 
15973  1093 
partition P xs = List.partition P xs 
1094 
mapfilter f xs = List.mapPartial f xs 

1095 

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

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

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

1098 

17371  1099 
x > f f #> g 
1100 
(x, y) > f f #> g 

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

1101 

17495  1102 
* Pure/library.ML: introduced/changed precedence of infix operators: 
1103 

1104 
infix 1 > > > >> >> >>> #> #>; 

1105 
infix 2 ?; 

1106 
infix 3 o oo ooo oooo; 

1107 
infix 4 ~~ upto downto; 

1108 

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

1110 
infix operators. 

1111 

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

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

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

1115 

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

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

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

1118 

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

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

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

1121 

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

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

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

1124 

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

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

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

1127 

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

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

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

1130 

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

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

1132 
these: 'a option > 'a where 'a = 'b list 
17402  1133 
the_default: 'a > 'a option > 'a 
1134 
the_list: 'a option > 'a list 

1135 

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

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

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

1141 

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

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

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

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

1145 

17564  1146 
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides 
1147 

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

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

1150 

1151 
replacing make_keylist and keyfilter (occassionally used) 

1152 
Naive rewrites: 

1153 

1154 
make_keylist = AList.make 

1155 
keyfilter = AList.find (op =) 

1156 

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

1158 
avoiding eqtypes. Naive rewrites: 

1159 

1160 
eq_fst = eq_fst (op =) 

1161 
eq_snd = eq_snd (op =) 

1162 

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

1164 
Naive rewrites: 

1165 

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

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

1168 

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

1169 
* Pure/General: structure OrdList (cf. Pure/General/ord_list.ML) 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1170 
provides a reasonably efficient lightweight implementation of sets as 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

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

1172 

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

1173 
* Pure/General: generic tables (cf. Pure/General/table.ML) provide a 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1174 
few new operations; existing lookup and update are now curried to 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1175 
follow natural argument order (for use with fold etc.); 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1176 
INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1177 

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

1178 
* Pure/General: output via the Isabelle channels of 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1179 
writeln/warning/error etc. is now passed through Output.output, with a 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1180 
hook for arbitrary transformations depending on the print_mode 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1181 
(cf. Output.add_mode  the first active mode that provides a output 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1182 
function wins). Already formatted output may be embedded into further 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1183 
text via Output.raw; the result of Pretty.string_of/str_of and derived 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1184 
functions (string_of_term/cterm/thm etc.) is already marked raw to 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1185 
accommodate easy composition of diagnostic messages etc. Programmers 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1186 
rarely need to care about Output.output or Output.raw at all, with 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1187 
some notable exceptions: Output.output is required when bypassing the 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1188 
standard channels (writeln etc.), or in token translations to produce 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1189 
properly formatted results; Output.raw is required when capturing 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1190 
already output material that will eventually be presented to the user 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1191 
a second time. For the default print mode, both Output.output and 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

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

1193 

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

1194 
* Pure/General: Output.time_accumulator NAME creates an operator ('a 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1195 
> 'b) > 'a > 'b to measure runtime and count invocations; the 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1196 
cumulative results are displayed at the end of a batch session. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1197 

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

1198 
* Pure/General: File.sysify_path and File.quote_sysify path have been 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1199 
replaced by File.platform_path and File.shell_path (with appropriate 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1200 
hooks). This provides a clean interface for unusual systems where the 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1201 
internal and external process view of file names are different. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1202 

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

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

1204 
fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord 
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

1205 
and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is 
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

1206 
NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast 
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

1207 
orders now  potential INCOMPATIBILITY for code that depends on a 
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

1208 
particular order for Symtab.keys, Symtab.dest, etc. (consider using 
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset

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

1210 

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

1211 
* Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types, 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1212 
fold_types traverse types/terms from left to right, observing natural 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1213 
argument order. Supercedes previous foldl_XXX versions, add_frees, 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1214 
add_vars etc. have been adapted as well: INCOMPATIBILITY. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1215 

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

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

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

1221 
name; NameSpace.extend is superceded by context dependent 

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

1223 
the naming context. Especially note Theory.restore_naming and 

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

1225 
Theory.add_path is no longer sufficient to recover from 

1226 
Theory.absolute_path in particular. 

1227 

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

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

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

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

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

1233 
with earlier declarations. 

16151  1234 

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

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

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

1237 
(useful for printing error messages). INCOMPATIBILITY. 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1238 

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

1239 
* Pure: major reorganization of the theory context. Type Sign.sg and 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1240 
Theory.theory are now identified, referring to the universal 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1241 
Context.theory (see Pure/context.ML). Actual signature and theory 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1242 
content is managed as theory data. The old code and interfaces were 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1243 
spread over many files and structures; the new arrangement introduces 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1244 
considerable INCOMPATIBILITY to gain more clarity: 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1245 

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

1246 
Context  theory management operations (name, identity, inclusion, 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1247 
parents, ancestors, merge, etc.), plus generic theory data; 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1248 

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

1249 
Sign  logical signature and syntax operations (declaring consts, 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1250 
types, etc.), plus certify/read for common entities; 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1251 

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

1252 
Theory  logical theory operations (stating axioms, definitions, 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1253 
oracles), plus a copy of logical signature operations (consts, 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1254 
types, etc.); also a few basic management operations (Theory.copy, 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1255 
Theory.merge, etc.) 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1256 

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

1257 
The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1258 
etc.) as well as the sign field in Thm.rep_thm etc. have been retained 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1259 
for convenience  they merely return the theory. 
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset

1260 

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

1261 
* Pure: type Type.tsig is superceded by theory in most interfaces. 
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

1262 

16547
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset

1263 
* Pure: the Isar proof context type is already defined early in Pure 
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset

1264 
as Context.proof (note that ProofContext.context and Proof.context are 
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset

1265 
aliases, where the latter is the preferred name). This enables other 
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset

1266 
Isabelle components to refer to that type even before Isar is present. 
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset

1267 

16373
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1268 
* Pure/sign/theory: discontinued named name spaces (i.e. classK, 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1269 
typeK, constK, axiomK, oracleK), but provide explicit operations for 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1270 
any of these kinds. For example, Sign.intern typeK is now 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1271 
Sign.intern_type, Theory.hide_space Sign.typeK is now 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1272 
Theory.hide_types. Also note that former 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1273 
Theory.hide_classes/types/consts are now 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1274 
Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1275 
internalize their arguments! INCOMPATIBILITY. 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1276 

16506
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset

1277 
* Pure: get_thm interface (of PureThy and ProofContext) expects 
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset

1278 
datatype thmref (with constructors Name and NameSelection) instead of 
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset

1279 
plain string  INCOMPATIBILITY; 
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset

1280 

16151  1281 
* Pure: cases produced by proof methods specify options, where NONE 
16234  1282 
means to remove case bindings  INCOMPATIBILITY in 
1283 
(RAW_)METHOD_CASES. 

16151  1284 

16373
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1285 
* Pure: the following operations retrieve axioms or theorems from a 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1286 
theory node or theory hierarchy, respectively: 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1287 

9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1288 
Theory.axioms_of: theory > (string * term) list 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1289 
Theory.all_axioms_of: theory > (string * term) list 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1290 
PureThy.thms_of: theory > (string * thm) list 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1291 
PureThy.all_thms_of: theory > (string * thm) list 
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset

1292 

16718  1293 
* Pure: print_tac now outputs the goal through the trace channel. 
1294 

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

1295 
* Isar toplevel: improved diagnostics, mostly for Poly/ML only. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1296 
Reference Toplevel.debug (default false) controls detailed printing 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1297 
and tracing of lowlevel exceptions; Toplevel.profiling (default 0) 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1298 
controls execution profiling  set to 1 for time and 2 for space 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1299 
(both increase the runtime). 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1300 

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

1301 
* Isar session: The initial use of ROOT.ML is now always timed, 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1302 
i.e. the log will show the actual process times, in contrast to the 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1303 
elapsed wallclock time that the outer shell wrapper produces. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

1304 

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

1305 
* Simplifier: improved handling of bound variables (nameless 
16997
7dfc99f62dd9
* Pure/Simplifier: improved handling of bound variables;
wenzelm
parents:
16962
diff
changeset

1306 
representation, avoid allocating new strings). Simprocs that invoke 
7dfc99f62dd9
* Pure/Simplifier: improved handling of bound variables;
wenzelm
parents:
16962
diff
changeset

1307 
the Simplifier recursively should use Simplifier.inherit_bounds to 
17720  1308 
avoid local name clashes. Failure to do so produces warnings 
1309 
"Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds 

1310 
for further details. 

16234  1311 

17166  1312 
* ML functions legacy_bindings and use_legacy_bindings produce ML fact 
1313 
bindings for all theorems stored within a given theory; this may help 

1314 
in porting nonIsar theories to Isar ones, while keeping ML proof 

1315 
scripts for the time being. 

1316 

17457  1317 
* ML operator HTML.with_charset specifies the charset begin used for 
1318 
generated HTML files. For example: 

1319 

1320 
HTML.with_charset "utf8" use_thy "Hebrew"; 

17538  1321 
HTML.with_charset "utf8" use_thy "Chinese"; 
17457  1322 

16234  1323 

1324 
*** System *** 

1325 

1326 
* Allow symlinks to all proper Isabelle executables (Isabelle, 

1327 
isabelle, isatool etc.). 

1328 

1329 
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for 

1330 
isatool doc, isatool mkdir, display_drafts etc.). 

1331 

1332 
* isatool usedir: option f allows specification of the ML file to be 

1333 
used by Isabelle; default is ROOT.ML. 

1334 

16251
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset

1335 
* New isatool version outputs the version identifier of the Isabelle 
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset

1336 
distribution being used. 
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset

1337 

121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset

1338 
* HOL: new isatool dimacs2hol converts files in DIMACS CNF format 
16234  1339 
(containing Boolean satisfiability problems) into Isabelle/HOL 
1340 
theories. 

15703  1341 

1342 

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

1343 

14606  1344 
New in Isabelle2004 (April 2004) 
1345 
 

13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

1346 

14171
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset

1347 
*** General *** 
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset

1348 

14398
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

1349 
* Provers/order.ML: new efficient reasoner for partial and linear orders. 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

1350 
Replaces linorder.ML. 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

1351 

14606  1352 
* Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic 
1353 
(\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler 

14173  1354 
(\<a>...\<z>), are now considered normal letters, and can therefore 
1355 
be used anywhere where an ASCII letter (a...zA...Z) has until 

1356 
now. COMPATIBILITY: This obviously changes the parsing of some 

1357 
terms, especially where a symbol has been used as a binder, say 

1358 
'\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed 

1359 
as an identifier. Fix it by inserting a space around former 

1360 
symbols. Call 'isatool fixgreek' to try to fix parsing errors in 

1361 
existing theory and ML files. 

14171
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset

1362 

14237  1363 
* Pure: Macintosh and Windows linebreaks are now allowed in theory files. 
1364 

14731  1365 
* Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now 
1366 
allowed in identifiers. Similar to Greek letters \<^isub> is now considered 

1367 
a normal (but invisible) letter. For multiple letter subscripts repeat 

1368 
\<^isub> like this: x\<^isub>1\<^isub>2. 

14233  1369 

14333  1370 
* Pure: There are now sub/superscripts that can span more than one 
1371 
character. Text between \<^bsub> and \<^esub> is set in subscript in 

14606  1372 
ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in 
1373 
superscript. The new control characters are not identifier parts. 

14333  1374 

14561
c53396af770e
* raw control symbols are of the form \<^raw:...> now.
schirmer
parents:
14556
diff
changeset

1375 
* Pure: Controlsymbols of the form \<^raw:...> will literally print the 
14606  1376 
content of "..." to the latex file instead of \isacntrl... . The "..." 
1377 
may consist of any printable characters excluding the end bracket >. 

14361
ad2f5da643b4
* Support for raw latex output in control symbols: \<^raw...>
schirmer
parents:
14333
diff
changeset

1378 

14237  1379 
* Pure: Using new Isar command "finalconsts" (or the ML functions 
1380 
Theory.add_finals or Theory.add_finals_i) it is now possible to 

1381 
declare constants "final", which prevents their being given a definition 

1382 
later. It is useful for constants whose behaviour is fixed axiomatically 

14224  1383 
rather than definitionally, such as the metalogic connectives. 
1384 

14606  1385 
* Pure: 'instance' now handles general arities with general sorts 
1386 
(i.e. intersections of classes), 

14503
255ad604e08e
Added check that Theory.ML does not occur in the files section of the theory
skalberg
parents:
14480
diff
changeset

1387 

14547  1388 
* Presentation: generated HTML now uses a CSS style sheet to make layout 
14731  1389 
(somewhat) independent of content. It is copied from lib/html/isabelle.css. 
14547  1390 
It can be changed to alter the colors/layout of generated pages. 
1391 

14556
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset

1392 

14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

1393 
*** Isar *** 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

1394 

14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset

1395 
* Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac, 
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset

1396 
cut_tac, subgoal_tac and thin_tac: 
14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

1397 
 Now understand static (Isar) contexts. As a consequence, users of Isar 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

1398 
locales are no longer forced to write Isar proof scripts. 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

1399 
For details see Isar Reference Manual, paragraph 4.3.2: Further tactic 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

1400 
emulations. 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

1401 
 INCOMPATIBILITY: names of variables to be instantiated may no 
14211
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

1402 
longer be enclosed in quotes. Instead, precede variable name with `?'. 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

1403 
This is consistent with the instantiation attribute "where". 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

1404 

14257
a7ef3f7588c5
Type inference bug in Isar attributes "where" and "of" fixed.
ballarin
parents:
14255
diff
changeset

1405 
* Attributes "where" and "of": 
14285
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset

1406 
 Now take type variables of instantiated theorem into account when reading 
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset

1407 
the instantiation string. This fixes a bug that caused instantiated 
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset

1408 
theorems to have too special types in some circumstances. 
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset

1409 
 "where" permits explicit instantiations of type variables. 
14257
a7ef3f7588c5
Type inference bug in Isar attributes "where" and "of" fixed.
ballarin
parents:
14255
diff
changeset

1410 

14556
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset

1411 
* Calcul 