author  wenzelm 
Sat, 28 Jan 2006 17:28:48 +0100  
changeset 18815  cb778c0ce1b5 
parent 18738  b6925d782fae 
child 18862  bd83590be0f7 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

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

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

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

6 

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

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

8 

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

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

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

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

12 

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

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

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

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

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

17 

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

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

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

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

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

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

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

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

25 

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

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

27 

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

28 

17865  29 
*** Document preparation *** 
30 

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

17865  33 

34 

17779  35 
*** Pure *** 
36 

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

39 

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

41 
then guess x and y by clarify 

42 

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

44 
proof tools being involved here. 

45 

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

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

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

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

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

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

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

54 

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

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

18020  58 

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

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

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

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

63 

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

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

67 

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

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

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

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

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

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

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

76 
analogous to the 'rule_format' attribute, but *not* that of the 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

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

78 

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

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

82 
(using objectlogic connectives for this purpose has been long 

83 
obsolete anyway). The subsequent proof patterns illustrate advanced 

84 
techniques of natural induction; general datatypes and inductive sets 

18267  85 
work analogously (see also src/HOL/Lambda for realistic examples). 
86 

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

18239  88 
parameters: 
18233  89 

90 
lemma 

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

92 
assumes a: "A n x" 

93 
shows "P n x" 

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

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

18248  96 
case 0 
18233  97 
show ?case sorry 
98 
next 

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

18233  102 
show ?case sorry 
103 
qed 

104 

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

110 
lemma 

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

112 
assumes a: "A (a x)" 

113 
shows "P (a x)" 

114 
using a 

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

116 
... 

117 

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

120 

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

122 
induction, while avoiding explicit objectlogic encodings: 

123 

124 
fix n :: nat 

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

126 
proof (induct n fixing: thesis) 

127 
case 0 

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

18399  129 
then show thesis by (rule 0) 
18267  130 
next 
131 
case (Suc n) 

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

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

134 
then show thesis by (rule Suc.prems) 

135 
qed 

136 

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

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

139 
existence statement through the induction as expected. 

18233  140 

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

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

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

143 
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

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

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

146 

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

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

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

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

150 

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

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

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

153 

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

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

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

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

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

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

159 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

178 

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

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

180 
particularly relevant for goal statements with local premises. 
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 
lemma 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

209 

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

210 
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

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

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

213 

18507  214 
lemma 
215 
shows "a : A ==> P1 a" 

216 
"a : A ==> P2 a" 

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

218 
"b : B ==> Q2 b" 

219 
"b : B ==> Q3 b" 

220 
proof (induct set: A B) 

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

221 

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

224 

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

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

228 
have been suppressed. 

229 

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

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

231 
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

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

233 

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

236 
least one premise. 

237 

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

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

242 

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

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

244 
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

245 
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

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

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

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

249 

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

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

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

252 
for example "A > B" => "Pi A (%_. B)". 
17779  253 

17865  254 

17806  255 
*** HOL *** 
256 

18694  257 
* Prefer ex1I over ex_ex1I in singlestep reasoning, e.g. by the 
258 
'rule' method. 

259 

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

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

263 

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

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

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

17779  269 

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

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

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

274 

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

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

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

277 

18446  278 
* Library: added theory Coinductive_List of potentially infinite lists 
279 
as greatest fixedpoint. 

18399  280 

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

281 

17878  282 
*** ML *** 
283 

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

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

285 

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

286 
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

287 
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

288 

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

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

292 
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

293 
sequence. "fold_burrow" has an additional context. 
18540  294 

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

296 
"unflat" from the user. 

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

297 

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

300 

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

301 
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

302 
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

303 

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

306 
given more convenient names and signatures reminiscent of similar 

307 
functions for alists, tables, etc: 

18051  308 

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

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

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

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

313 

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

316 

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

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

319 

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

321 

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

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

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

18738  329 
minimizing code duplication. Thm.rule_attribute and 
330 
Thm.declaration_attribute build canonical attributes; see also 

331 
structure Context for further operations on Context.generic. 

18737  332 

333 
INCOMPATIBILITY, need to adapt attribute type declarations and 

334 
definitions. Hint: make proper use of GenericDataFun and generic 

335 
Args/Attrib syntax instead of working around legacy code. 

18642  336 

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

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

340 
fold_map combinators. 

18051  341 

18020  342 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  343 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  344 
achieve the old behaviour. 
345 

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

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

348 
statements. 

349 

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

351 
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

352 
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

353 
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

354 
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

355 

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

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

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

359 
care of proper display of ERROR exceptions. ML code may use plain 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

360 
handle/can/try; cat_error may be used to concatenate errors like this: 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

361 

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

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

363 

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

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

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

367 

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

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

369 

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

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

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

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

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

374 

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

375 
* Isar: theory setup now has type (theory > theory), instead of a 
18722
0888eca0f1be
* ML/Isar: theory setup has type (theory > theory);
wenzelm
parents:
18696
diff
changeset

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

377 

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

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

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

380 

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

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

382 
theory before entering a proof state. Transactions now always see a 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

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

384 
batch mode. 
18567  385 

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

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

17890  389 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  390 
(solver, looper etc.) may depend on arbitrary proof data. 
391 

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

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

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

395 
former Simplifier.inherit_bounds, which is already included here  

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

17878  398 

399 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

402 
INCOMPATIBILITY. 

403 

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

406 

17878  407 

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

408 

17720  409 
New in Isabelle2005 (October 2005) 
410 
 

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

411 

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

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

413 

15130  414 
* Theory headers: the new header syntax for Isar theories is 
415 

416 
theory <name> 

16234  417 
imports <theory1> ... <theoryN> 
418 
uses <file1> ... <fileM> 

15130  419 
begin 
420 

16234  421 
where the 'uses' part is optional. The previous syntax 
422 

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

424 

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

17371  427 
nonIsar theories now, but these will disappear soon. 
15130  428 

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

429 
* Theory loader: parent theories can now also be referred to via 
16234  430 
relative and absolute paths. 
431 

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

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

433 
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

434 
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

435 
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

436 
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

437 
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

438 
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

439 
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

440 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  441 

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

442 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  443 

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

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

446 
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

447 

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

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

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

450 

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

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

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

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

17385  458 

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

461 
faster. 

462 

15703  463 

464 
*** Document preparation *** 

465 

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

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

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

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

471 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

472 

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

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

474 
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

475 
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

476 
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

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

478 
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

479 
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

480 
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

481 
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

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

483 

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

484 
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

485 
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

486 
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

487 
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

488 
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

489 
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

490 
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

491 
specified above. 
16234  492 

17402  493 
* Several new antiquotations: 
15979  494 

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

496 

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

498 

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

15979  501 

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

16234  503 
theorem applying a "style" to it 
504 

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

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

506 

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

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

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

513 
typechecked ML expressions verbatim. 
16234  514 

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

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

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

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

519 

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

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

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

523 

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

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

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

526 

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

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

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

529 

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

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

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

532 

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

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

534 
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

535 
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

536 

16234  537 

538 
*** Pure *** 

539 

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

541 
automatic typeinference of declared constants; additional support for 

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

543 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

544 
sequential dependencies of definitions within a single 'constdefs' 

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

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

547 

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

549 
indexed syntax provides a notational device for subscripted 

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

551 
expressions. Secondly, in a local context with structure 

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

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

554 
show_structs controls printing of implicit structures. Typical 

555 
applications of these concepts involve record types and locales. 

556 

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

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

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

560 

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

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

563 
parsing/printing, see also isarref manual. 

564 

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

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

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

569 
INCOMPATIBILITY. 

570 

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

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

572 
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

573 
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

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

575 

16234  576 
* Improved internal renaming of symbolic identifiers  attach primes 
577 
instead of base 26 numbers. 

578 

579 
* New flag show_question_marks controls printing of leading question 

580 
marks in schematic variable names. 

581 

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

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

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

585 

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

587 
by simp 

588 

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

590 

17548  591 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  592 
annotations as "(00...)". 
593 

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

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

596 
Before that distinction was only partially implemented via type class 

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

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

599 
exotic syntax specifications may require further adaption 

17691  600 
(e.g. Cube/Cube.thy). 
16234  601 

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

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

604 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

605 
specifications. 

606 

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

609 

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

612 
Limit. 

613 

614 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

620 
allow for use in a context of fixed variables. 

621 

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

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

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

625 

17597  626 
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. 
17590  627 

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

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

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

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

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

634 

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

636 
selections of theorems in named facts via index ranges. 

637 

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

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

639 
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

640 
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

641 

17397  642 
* 'hide': option '(open)' hides only base names. 
643 

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

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

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

646 

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

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

650 
must be quoted when used as identifiers. 

651 

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

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

654 
quoted when used as identifier. 

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

655 

16234  656 

657 
*** Locales *** 

17095  658 

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

661 
proof obligations from the expression specification. After the 

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

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

664 
commands is a follows: 

665 

17095  666 
(1) interpretation expr inst 
667 
(2) interpretation target < expr 

668 
(3) interpret expr inst 

17385  669 

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

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

674 
locale expression. Interpretation is smart in that interpretations 

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

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

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

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

16234  680 

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

682 
'interpret' instead. 

683 

17385  684 
* New context element 'constrains' for adding type constraints to 
685 
parameters. 

686 

687 
* Context expressions: renaming of parameters with syntax 

688 
redeclaration. 

17095  689 

690 
* Locale declaration: 'includes' disallowed. 

691 

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

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

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

696 
to attribute arguments as expected. 

697 

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

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

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

701 
Attribute implementations need to cooperate properly with the static 

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

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

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

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

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

707 
values to argument tokens explicitly. 

708 

709 
* Changed parameter management in theorem generation for long goal 

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

711 
theorem statement in rare situations. 

712 

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

715 

16234  716 

717 
*** Provers *** 

718 

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

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

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

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

723 
still available as 'simplesubst'. 

724 

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

726 
and quasi orders. 

727 

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

729 
reflexivetransitive closure of relations. 

730 

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

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

733 

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

735 
is peformed already. Objectlogics merely need to finish their 

736 
initial simpset configuration as before. INCOMPATIBILITY. 

15703  737 

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

738 

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

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

740 

16234  741 
* Symbolic syntax of Hilbert Choice Operator is now as follows: 
14878  742 

743 
syntax (epsilon) 

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

745 

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

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

749 
becomes available as variable, constant etc. INCOMPATIBILITY, 

750 

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

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

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

754 
support corresponding Isar calculations. 
16234  755 

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

757 
instead of ":". 

758 

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

760 

761 
Old New 

762 
{..n(} {..<n} 

763 
{)n..} {n<..} 

764 
{m..n(} {m..<n} 

765 
{)m..n} {m<..n} 

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

767 

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

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

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

15046  771 

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

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

774 

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

777 
interface. 

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

778 

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

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

784 
Some new syntax forms are available: 

785 

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

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

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

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

790 

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

792 
function "Summation", which has been discontinued. 

793 

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

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

796 
(insert F x)'. 

797 

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

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

800 
typedefs, inductive datatypes and recursion. 

801 

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

804 
HOL/ex/SAT_Examples.thy for examples. 

17619  805 

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

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

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

810 
in unstructured proof scripts. 

811 

812 
* Reworked implementation of records. Improved scalability for 

813 
records with many fields, avoiding performance problems for type 

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

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

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

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

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

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

820 
<record_name>_ext_type. 

821 

822 
Flag record_quick_and_dirty_sensitive can be enabled to skip the 

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

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

825 
quite long. 

826 

827 
New simproc record_upd_simproc for simplification of multiple record 

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

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

830 
occasionally, since simplification is more powerful by default. 

831 

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

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

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

834 

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

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

838 
old proofs break occasionally as simplification may now solve more 

839 
goals than previously. 

840 

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

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

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

844 
just like y <= x. 

845 

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

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

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

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

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

851 
enabled/disabled by the reference use_let_simproc. Potential 

852 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  853 

16563  854 
* Classical reasoning: the meson method now accepts theorems as arguments. 
855 

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

858 

16891  859 
* Theory OrderedGroup and Ring_and_Field: various additions and 
860 
improvements to faciliate calculations involving equalities and 

861 
inequalities. 

862 

863 
The following theorems have been eliminated or modified 

864 
(INCOMPATIBILITY): 

16888  865 

866 
abs_eq now named abs_of_nonneg 

17371  867 
abs_of_ge_0 now named abs_of_nonneg 
868 
abs_minus_eq now named abs_of_nonpos 

16888  869 
imp_abs_id now named abs_of_nonneg 
870 
imp_abs_neg_id now named abs_of_nonpos 

871 
mult_pos now named mult_pos_pos 

872 
mult_pos_le now named mult_nonneg_nonneg 

873 
mult_pos_neg_le now named mult_nonneg_nonpos 

874 
mult_pos_neg2_le now named mult_nonneg_nonpos2 

875 
mult_neg now named mult_neg_neg 

876 
mult_neg_le now named mult_nonpos_nonpos 

877 

16891  878 
* Theory Parity: added rules for simplifying exponents. 
879 

17092  880 
* Theory List: 
881 

882 
The following theorems have been eliminated or modified 

883 
(INCOMPATIBILITY): 

884 

885 
list_all_Nil now named list_all.simps(1) 

886 
list_all_Cons now named list_all.simps(2) 

887 
list_all_conv now named list_all_iff 

888 
set_mem_eq now named mem_iff 

889 

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

892 

16888  893 

894 
*** HOLComplex *** 

895 

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

898 

899 
The following theorems have been eliminated or modified 

900 
(INCOMPATIBILITY): 

901 

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

902 
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

903 
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

904 
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

905 
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

906 
real_of_int_mult reversed direction of equality (use [symmetric]) 
16891  907 

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

16888  909 

16962  910 
* Theory Ln is new, with properties of the natural logarithm 
911 

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

914 

915 
hypreal = real star 

916 
hypnat = nat star 

917 
hcomplex = complex star 

918 

919 
* Hyperreal: Many groups of similarlydefined constants have been 

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

920 
replaced by polymorphic versions (INCOMPATIBILITY): 
17423  921 

922 
star_of < hypreal_of_real, hypnat_of_nat, hcomplex_of_complex 

923 

924 
starset < starsetNat, starsetC 

925 
*s* < *sNat*, *sc* 

926 
starset_n < starsetNat_n, starsetC_n 

927 
*sn* < *sNatn*, *scn* 

928 
InternalSets < InternalNatSets, InternalCSets 

929 

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

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

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

934 
InternalFuns < InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs 
17423  935 

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

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

938 

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

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

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

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

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

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

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

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

947 
mult_1_left < {hypreal,hypnat}_mult_1, hcomplex_mult_one_left 
17423  948 
mult_1_right < hcomplex_mult_one_right 
949 
mult_zero_left < hcomplex_mult_zero_left 

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

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

952 
zero_neq_one < {hypreal,hypnat,hcomplex}_zero_not_eq_one 
17423  953 
right_inverse < hypreal_mult_inverse 
954 
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

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

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

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

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

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

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

961 
mult_strict_left_mono < {hypreal,hypnat}_mult_less_mono2 
17423  962 
add_nonneg_nonneg < hypreal_le_add_order 
963 

964 
* Hyperreal: Separate theorems having to do with typespecific 

965 
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

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

967 

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

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

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

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

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

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

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

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

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

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

977 
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

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

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

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

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

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

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

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

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

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

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

988 
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

989 
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

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

991 
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

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

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

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

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

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

997 
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

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

999 
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

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

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

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

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

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

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

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

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

1011 
starfun_add_capprox < starfun{C,RC}_add_capprox 
17423  1012 
starfun_add_approx < starfunCR_add_approx 
1013 
starfun_inverse_inverse < starfunC_inverse_inverse 

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

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

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

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

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

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

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

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

1022 

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

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

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

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

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

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

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

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

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

1031 
star_n_one_num < {hypreal,hypnat,hcomplex}_one_num 
17423  1032 
star_n_abs < hypreal_hrabs 
1033 
star_n_divide < hcomplex_divide 

1034 

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

1035 
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

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

1038 
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

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

1040 
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

1041 
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

1042 
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

1043 
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

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

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

1046 
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

1047 
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

1048 
star_of_number_of < {hypreal,hcomplex}_number_of 
17423  1049 
star_of_number_less < number_of_less_hypreal_of_real_iff 
1050 
star_of_number_le < number_of_le_hypreal_of_real_iff 

1051 
star_of_eq_number < hypreal_of_real_eq_number_of_iff 

1052 
star_of_less_number < hypreal_of_real_less_number_of_iff 

1053 
star_of_le_number < hypreal_of_real_le_number_of_iff 

1054 
star_of_power < hypreal_of_real_power 

1055 
star_of_eq_0 < hcomplex_of_complex_zero_iff 

1056 

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

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

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

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

1060 
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

1061 
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

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

1063 

17641  1064 
* Hyperreal: A theory of Taylor series. 
1065 

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

1066 

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

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

1068 

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

1071 
typeinference. 

1072 

1073 
* New simplification procedure for solving continuity conditions; it 

1074 
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

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

1076 

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

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

1079 

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

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

1081 

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

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

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

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

1087 
syntax and examples. 

1088 

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

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

1091 
but the proof obligation additionally includes an admissibility 

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

1093 
with continuity and strictness theorems for Rep and Abs. 

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

1094 

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

1097 

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

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

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

1101 
foo_strict: "foo$UU = UU" 

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

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

1104 

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

1105 

14885  1106 
*** ZF *** 
1107 

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

1110 
of a homomorphism). 

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

1111 

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

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

15703  1115 

1116 

17445  1117 
*** Cube *** 
1118 

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

1120 
theories. 

1121 

1122 

15703  1123 
*** ML *** 
1124 

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

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

1129 
accordingly, while Option.map replaces apsome. 

15973  1130 

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

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

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

1133 
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

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

1135 

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

1136 
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

1137 
toplevel, as they are variants of predefined functions. The following 
16234  1138 
suggests how one can translate existing code: 
15973  1139 

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

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

1142 
last_elem xs = List.last xs 

1143 
flat xss = List.concat xss 

16234  1144 
seq fs = List.app fs 
15973  1145 
partition P xs = List.partition P xs 
1146 
mapfilter f xs = List.mapPartial f xs 

1147 

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

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

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

1150 

17371  1151 
x > f f #> g 
1152 
(x, y) > f f #> g 

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

1153 

17495  1154 
* Pure/library.ML: introduced/changed precedence of infix operators: 
1155 

1156 
infix 1 > > > >> >> >>> #> #>; 

1157 
infix 2 ?; 

1158 
infix 3 o oo ooo oooo; 

1159 
infix 4 ~~ upto downto; 

1160 

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

1162 
infix operators. 

1163 

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

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

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

1167 

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

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

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

1170 

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

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

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

1173 

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

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

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

1176 

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

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

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

1179 

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

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

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

1182 

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

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

1184 
these: 'a option > 'a where 'a = 'b list 
17402  1185 
the_default: 'a > 'a option > 'a 
1186 
the_list: 'a option > 'a list 

1187 

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

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

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

1193 

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

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

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

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

1197 

17564  1198 
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides 
1199 

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

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

1202 

1203 
replacing make_keylist and keyfilter (occassionally used) 

1204 
Naive rewrites: 

1205 

1206 
make_keylist = AList.make 

1207 
keyfilter = AList.find (op =) 

1208 

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

1210 
avoiding eqtypes. Naive rewrites: 

1211 

1212 
eq_fst = eq_fst (op =) 

1213 
eq_snd = eq_snd (op =) 

1214 

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

1216 
Naive rewrites: 

1217 

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

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

1220 

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

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

1222 
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

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

1224 

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

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

1226 
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

1227 
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

1228 
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

1229 

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

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

1231 
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

1232 
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

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

1234 
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

1235 
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

1236 
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

1237 
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

1238 
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

1239 
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

1240 
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

1241 
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

1242 
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

1243 
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

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

1245 

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

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

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

1248 
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

1249 

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

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

1251 
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

1252 
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

1253 
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

1254 

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

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

1256 
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

1257 
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

1258 
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

1259 
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

1260 
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

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

1262 

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

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

1264 
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

1265 
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

1266 
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

1267 

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

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

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

1273 
name; NameSpace.extend is superceded by context dependent 

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

1275 
the naming context. Especially note Theory.restore_naming and 

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

1277 
Theory.add_path is no longer sufficient to recover from 

1278 
Theory.absolute_path in particular. 

1279 

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

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

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

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

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

1285 
with earlier declarations. 

16151  1286 

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

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

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

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

1290 

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

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

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

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

1294 
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

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

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

1297 

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

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

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

1300 

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

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

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

1303 

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

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

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

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

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

1308 

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

1309 
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

1310 
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

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

1312 

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

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

1314 

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

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

1316 
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

1317 
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

1318 
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

1319 

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

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

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

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

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

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

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

1326 
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

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

1328 

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

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

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

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

1332 

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

16151  1336 

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

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

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

1339 

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

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

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

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

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

1344 

16718  1345 
* Pure: print_tac now outputs the goal through the trace channel. 
1346 

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

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

1348 
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

1349 
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

1350 
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

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

1352 

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

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

1354 
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

1355 
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

1356 

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

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

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

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

1362 
for further details. 

16234  1363 

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

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

1367 
scripts for the time being. 

1368 

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

1371 

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

17538  1373 
HTML.with_charset "utf8" use_thy "Chinese"; 
17457  1374 

16234  1375 

1376 
*** System *** 

1377 

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

1379 
isabelle, isatool etc.). 

1380 

1381 
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for 

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

1383 

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

1385 
used by Isabelle; default is ROOT.ML. 

1386 

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

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

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

1389 

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

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

15703  1393 

1394 

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

1395 

14606  1396 
New in Isabelle2004 (April 2004) 
1397 
 

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

1398 

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

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

1400 

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

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

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

1403 

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

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

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

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

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

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

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

a3690aeb79d4
Removed the extended digits again.
sk& 