author  haftmann 
Mon, 23 Jan 2006 14:06:11 +0100  
changeset 18754  4e41252eae57 
parent 18738  b6925d782fae 
child 18815  cb778c0ce1b5 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

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

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

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

6 

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

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

8 

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

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

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

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

12 

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

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

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

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

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

17 

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

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

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

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

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

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

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

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

25 

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

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

27 

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

28 

17865  29 
*** Document preparation *** 
30 

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

17865  33 

34 

17779  35 
*** Pure *** 
36 

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

39 

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

41 
then guess x and y by clarify 

42 

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

44 
proof tools being involved here. 

45 

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

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

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

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

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

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

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

54 

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

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

18020  58 

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

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

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

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

63 

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

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

67 

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

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

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

72 

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

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

76 
(using objectlogic connectives for this purpose has been long 

77 
obsolete anyway). The subsequent proof patterns illustrate advanced 

78 
techniques of natural induction; general datatypes and inductive sets 

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

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

18239  82 
parameters: 
18233  83 

84 
lemma 

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

86 
assumes a: "A n x" 

87 
shows "P n x" 

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

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

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

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

18233  96 
show ?case sorry 
97 
qed 

98 

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

104 
lemma 

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

106 
assumes a: "A (a x)" 

107 
shows "P (a x)" 

108 
using a 

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

110 
... 

111 

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

114 

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

116 
induction, while avoiding explicit objectlogic encodings: 

117 

118 
fix n :: nat 

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

120 
proof (induct n fixing: thesis) 

121 
case 0 

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

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

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

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

128 
then show thesis by (rule Suc.prems) 

129 
qed 

130 

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

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

133 
existence statement through the induction as expected. 

18233  134 

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

135 
* Provers/induct: mutual induction rules are now specified as a list 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

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

137 
provide foo_bar.inducts for mutually defined items foo and bar 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

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

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

140 

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

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

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

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

144 

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

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

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

147 

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

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

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

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

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

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

153 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

172 

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

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

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

175 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

203 

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

204 
If simultaneous goals are to be used with mutual rules, the statement 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

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

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

207 

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

210 
"a : A ==> P2 a" 

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

212 
"b : B ==> Q2 b" 

213 
"b : B ==> Q3 b" 

214 
proof (induct set: A B) 

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

215 

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

218 

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

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

222 
have been suppressed. 

223 

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

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

225 
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

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

227 

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

230 
least one premise. 

231 

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

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

236 

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

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

238 
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

239 
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

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

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

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

243 

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

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

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

246 
for example "A > B" => "Pi A (%_. B)". 
17779  247 

17865  248 

17806  249 
*** HOL *** 
250 

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

253 

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

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

257 

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

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

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

17779  263 

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

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

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

268 

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

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

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

271 

18446  272 
* Library: added theory Coinductive_List of potentially infinite lists 
273 
as greatest fixedpoint. 

18399  274 

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

275 

17878  276 
*** ML *** 
277 

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

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

279 

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

280 
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

281 
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

282 

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

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

286 
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

287 
sequence. "fold_burrow" has an additional context. 
18540  288 

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

290 
"unflat" from the user. 

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

291 

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

294 

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

295 
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

296 
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

297 

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

300 
given more convenient names and signatures reminiscent of similar 

301 
functions for alists, tables, etc: 

18051  302 

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

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

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

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

307 

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

310 

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

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

313 

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

315 

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

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

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

18738  323 
minimizing code duplication. Thm.rule_attribute and 
324 
Thm.declaration_attribute build canonical attributes; see also 

325 
structure Context for further operations on Context.generic. 

18737  326 

327 
INCOMPATIBILITY, need to adapt attribute type declarations and 

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

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

18642  330 

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

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

334 
fold_map combinators. 

18051  335 

18020  336 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  337 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  338 
achieve the old behaviour. 
339 

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

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

342 
statements. 

343 

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

345 
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

346 
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

347 
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

348 
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

349 

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

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

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

353 
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

354 
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

355 

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

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

357 

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

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

18686
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 
Isar.toplevel (fn () => ...) 
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 
INCOMPATIBILITY, removed special transform_error facilities, removed 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

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

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

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

368 

18722
0888eca0f1be
* ML/Isar: theory setup has type (theory > theory);
wenzelm
parents:
18696
diff
changeset

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

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

371 

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

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

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

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

375 
batch mode. 
18567  376 

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

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

17890  380 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  381 
(solver, looper etc.) may depend on arbitrary proof data. 
382 

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

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

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

386 
former Simplifier.inherit_bounds, which is already included here  

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

17878  389 

390 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

393 
INCOMPATIBILITY. 

394 

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

397 

17878  398 

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

399 

17720  400 
New in Isabelle2005 (October 2005) 
401 
 

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

402 

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

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

404 

15130  405 
* Theory headers: the new header syntax for Isar theories is 
406 

407 
theory <name> 

16234  408 
imports <theory1> ... <theoryN> 
409 
uses <file1> ... <fileM> 

15130  410 
begin 
411 

16234  412 
where the 'uses' part is optional. The previous syntax 
413 

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

415 

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

17371  418 
nonIsar theories now, but these will disappear soon. 
15130  419 

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

420 
* Theory loader: parent theories can now also be referred to via 
16234  421 
relative and absolute paths. 
422 

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

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

424 
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

425 
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

426 
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

427 
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

428 
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

429 
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

430 
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

431 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  432 

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

433 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  434 

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

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

437 
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

438 

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

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

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

441 

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

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

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

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

17385  449 

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

452 
faster. 

453 

15703  454 

455 
*** Document preparation *** 

456 

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

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

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

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

462 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

463 

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

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

465 
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

466 
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

467 
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

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

469 
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

470 
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

471 
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

472 
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

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

474 

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

475 
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

476 
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

477 
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

478 
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

479 
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

480 
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

481 
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

482 
specified above. 
16234  483 

17402  484 
* Several new antiquotations: 
15979  485 

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

487 

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

489 

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

15979  492 

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

16234  494 
theorem applying a "style" to it 
495 

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

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

497 

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

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

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

504 
typechecked ML expressions verbatim. 
16234  505 

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

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

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

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

510 

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

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

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

514 

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

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

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

517 

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

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

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

520 

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

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

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

523 

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

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

525 
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

526 
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

527 

16234  528 

529 
*** Pure *** 

530 

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

532 
automatic typeinference of declared constants; additional support for 

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

534 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

535 
sequential dependencies of definitions within a single 'constdefs' 

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

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

538 

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

540 
indexed syntax provides a notational device for subscripted 

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

542 
expressions. Secondly, in a local context with structure 

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

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

545 
show_structs controls printing of implicit structures. Typical 

546 
applications of these concepts involve record types and locales. 

547 

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

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

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

551 

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

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

554 
parsing/printing, see also isarref manual. 

555 

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

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

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

560 
INCOMPATIBILITY. 

561 

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

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

563 
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

564 
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

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

566 

16234  567 
* Improved internal renaming of symbolic identifiers  attach primes 
568 
instead of base 26 numbers. 

569 

570 
* New flag show_question_marks controls printing of leading question 

571 
marks in schematic variable names. 

572 

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

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

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

576 

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

578 
by simp 

579 

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

581 

17548  582 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  583 
annotations as "(00...)". 
584 

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

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

587 
Before that distinction was only partially implemented via type class 

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

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

590 
exotic syntax specifications may require further adaption 

17691  591 
(e.g. Cube/Cube.thy). 
16234  592 

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

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

595 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

596 
specifications. 

597 

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

600 

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

603 
Limit. 

604 

605 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

611 
allow for use in a context of fixed variables. 

612 

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

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

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

616 

17597  617 
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. 
17590  618 

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

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

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

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

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

625 

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

627 
selections of theorems in named facts via index ranges. 

628 

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

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

630 
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

631 
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

632 

17397  633 
* 'hide': option '(open)' hides only base names. 
634 

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

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

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

637 

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

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

641 
must be quoted when used as identifiers. 

642 

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

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

645 
quoted when used as identifier. 

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

646 

16234  647 

648 
*** Locales *** 

17095  649 

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

652 
proof obligations from the expression specification. After the 

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

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

655 
commands is a follows: 

656 

17095  657 
(1) interpretation expr inst 
658 
(2) interpretation target < expr 

659 
(3) interpret expr inst 

17385  660 

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

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

665 
locale expression. Interpretation is smart in that interpretations 

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

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

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

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

16234  671 

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

673 
'interpret' instead. 

674 

17385  675 
* New context element 'constrains' for adding type constraints to 
676 
parameters. 

677 

678 
* Context expressions: renaming of parameters with syntax 

679 
redeclaration. 

17095  680 

681 
* Locale declaration: 'includes' disallowed. 

682 

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

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

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

687 
to attribute arguments as expected. 

688 

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

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

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

692 
Attribute implementations need to cooperate properly with the static 

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

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

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

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

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

698 
values to argument tokens explicitly. 

699 

700 
* Changed parameter management in theorem generation for long goal 

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

702 
theorem statement in rare situations. 

703 

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

706 

16234  707 

708 
*** Provers *** 

709 

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

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

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

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

714 
still available as 'simplesubst'. 

715 

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

717 
and quasi orders. 

718 

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

720 
reflexivetransitive closure of relations. 

721 

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

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

724 

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

726 
is peformed already. Objectlogics merely need to finish their 

727 
initial simpset configuration as before. INCOMPATIBILITY. 

15703  728 

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

729 

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

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

731 

16234  732 
* Symbolic syntax of Hilbert Choice Operator is now as follows: 
14878  733 

734 
syntax (epsilon) 

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

736 

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

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

740 
becomes available as variable, constant etc. INCOMPATIBILITY, 

741 

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

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

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

745 
support corresponding Isar calculations. 
16234  746 

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

748 
instead of ":". 

749 

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

751 

752 
Old New 

753 
{..n(} {..<n} 

754 
{)n..} {n<..} 

755 
{m..n(} {m..<n} 

756 
{)m..n} {m<..n} 

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

758 

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

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

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

15046  762 

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

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

765 

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

768 
interface. 

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

769 

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

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

775 
Some new syntax forms are available: 

776 

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

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

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

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

781 

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

783 
function "Summation", which has been discontinued. 

784 

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

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

787 
(insert F x)'. 

788 

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

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

791 
typedefs, inductive datatypes and recursion. 

792 

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

795 
HOL/ex/SAT_Examples.thy for examples. 

17619  796 

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

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

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

801 
in unstructured proof scripts. 

802 

803 
* Reworked implementation of records. Improved scalability for 

804 
records with many fields, avoiding performance problems for type 

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

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

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

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

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

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

811 
<record_name>_ext_type. 

812 

813 
Flag record_quick_and_dirty_sensitive can be enabled to skip the 

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

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

816 
quite long. 

817 

818 
New simproc record_upd_simproc for simplification of multiple record 

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

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

821 
occasionally, since simplification is more powerful by default. 

822 

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

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

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

825 

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

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

829 
old proofs break occasionally as simplification may now solve more 

830 
goals than previously. 

831 

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

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

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

835 
just like y <= x. 

836 

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

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

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

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

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

842 
enabled/disabled by the reference use_let_simproc. Potential 

843 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  844 

16563  845 
* Classical reasoning: the meson method now accepts theorems as arguments. 
846 

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

849 

16891  850 
* Theory OrderedGroup and Ring_and_Field: various additions and 
851 
improvements to faciliate calculations involving equalities and 

852 
inequalities. 

853 

854 
The following theorems have been eliminated or modified 

855 
(INCOMPATIBILITY): 

16888  856 

857 
abs_eq now named abs_of_nonneg 

17371  858 
abs_of_ge_0 now named abs_of_nonneg 
859 
abs_minus_eq now named abs_of_nonpos 

16888  860 
imp_abs_id now named abs_of_nonneg 
861 
imp_abs_neg_id now named abs_of_nonpos 

862 
mult_pos now named mult_pos_pos 

863 
mult_pos_le now named mult_nonneg_nonneg 

864 
mult_pos_neg_le now named mult_nonneg_nonpos 

865 
mult_pos_neg2_le now named mult_nonneg_nonpos2 

866 
mult_neg now named mult_neg_neg 

867 
mult_neg_le now named mult_nonpos_nonpos 

868 

16891  869 
* Theory Parity: added rules for simplifying exponents. 
870 

17092  871 
* Theory List: 
872 

873 
The following theorems have been eliminated or modified 

874 
(INCOMPATIBILITY): 

875 

876 
list_all_Nil now named list_all.simps(1) 

877 
list_all_Cons now named list_all.simps(2) 

878 
list_all_conv now named list_all_iff 

879 
set_mem_eq now named mem_iff 

880 

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

883 

16888  884 

885 
*** HOLComplex *** 

886 

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

889 

890 
The following theorems have been eliminated or modified 

891 
(INCOMPATIBILITY): 

892 

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

893 
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

894 
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

895 
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

896 
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

897 
real_of_int_mult reversed direction of equality (use [symmetric]) 
16891  898 

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

16888  900 

16962  901 
* Theory Ln is new, with properties of the natural logarithm 
902 

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

905 

906 
hypreal = real star 

907 
hypnat = nat star 

908 
hcomplex = complex star 

909 

910 
* Hyperreal: Many groups of similarlydefined constants have been 

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

911 
replaced by polymorphic versions (INCOMPATIBILITY): 
17423  912 

913 
star_of < hypreal_of_real, hypnat_of_nat, hcomplex_of_complex 

914 

915 
starset < starsetNat, starsetC 

916 
*s* < *sNat*, *sc* 

917 
starset_n < starsetNat_n, starsetC_n 

918 
*sn* < *sNatn*, *scn* 

919 
InternalSets < InternalNatSets, InternalCSets 

920 

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

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

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

925 
InternalFuns < InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs 
17423  926 

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

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

929 

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

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

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

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

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

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

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

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

938 
mult_1_left < {hypreal,hypnat}_mult_1, hcomplex_mult_one_left 
17423  939 
mult_1_right < hcomplex_mult_one_right 
940 
mult_zero_left < hcomplex_mult_zero_left 

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

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

943 
zero_neq_one < {hypreal,hypnat,hcomplex}_zero_not_eq_one 
17423  944 
right_inverse < hypreal_mult_inverse 
945 
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

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

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

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

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

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

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

952 
mult_strict_left_mono < {hypreal,hypnat}_mult_less_mono2 
17423  953 
add_nonneg_nonneg < hypreal_le_add_order 
954 

955 
* Hyperreal: Separate theorems having to do with typespecific 

956 
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

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

958 

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

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

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

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

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

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

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

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

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

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

968 
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

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

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

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

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

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

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

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

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

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

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

979 
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

980 
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

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

982 
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

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

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

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

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

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

988 
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

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

990 
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

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

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

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

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

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

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

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

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

1002 
starfun_add_capprox < starfun{C,RC}_add_capprox 
17423  1003 
starfun_add_approx < starfunCR_add_approx 
1004 
starfun_inverse_inverse < starfunC_inverse_inverse 

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

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

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

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

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

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

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

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

1013 

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

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

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

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

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

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

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

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

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

1022 
star_n_one_num < {hypreal,hypnat,hcomplex}_one_num 
17423  1023 
star_n_abs < hypreal_hrabs 
1024 
star_n_divide < hcomplex_divide 

1025 

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

1026 
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

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

1029 
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

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

1031 
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

1032 
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

1033 
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

1034 
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

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

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

1037 
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

1038 
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

1039 
star_of_number_of < {hypreal,hcomplex}_number_of 
17423  1040 
star_of_number_less < number_of_less_hypreal_of_real_iff 
1041 
star_of_number_le < number_of_le_hypreal_of_real_iff 

1042 
star_of_eq_number < hypreal_of_real_eq_number_of_iff 

1043 
star_of_less_number < hypreal_of_real_less_number_of_iff 

1044 
star_of_le_number < hypreal_of_real_le_number_of_iff 

1045 
star_of_power < hypreal_of_real_power 

1046 
star_of_eq_0 < hcomplex_of_complex_zero_iff 

1047 

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

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

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

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

1051 
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

1052 
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

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

1054 

17641  1055 
* Hyperreal: A theory of Taylor series. 
1056 

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

1057 

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

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

1059 

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

1062 
typeinference. 

1063 

1064 
* New simplification procedure for solving continuity conditions; it 

1065 
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

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

1067 

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

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

1070 

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

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

1072 

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

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

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

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

1078 
syntax and examples. 

1079 

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

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

1082 
but the proof obligation additionally includes an admissibility 

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

1084 
with continuity and strictness theorems for Rep and Abs. 

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

1085 

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

1088 

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

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

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

1092 
foo_strict: "foo$UU = UU" 

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

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

1095 

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

1096 

14885  1097 
*** ZF *** 
1098 

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

1101 
of a homomorphism). 

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

1102 

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

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

15703  1106 

1107 

17445  1108 
*** Cube *** 
1109 

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

1111 
theories. 

1112 

1113 

15703  1114 
*** ML *** 
1115 

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

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

1120 
accordingly, while Option.map replaces apsome. 

15973  1121 

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

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

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

1124 
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

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

1126 

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

1127 
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

1128 
toplevel, as they are variants of predefined functions. The following 
16234  1129 
suggests how one can translate existing code: 
15973  1130 

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

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

1133 
last_elem xs = List.last xs 

1134 
flat xss = List.concat xss 

16234  1135 
seq fs = List.app fs 
15973  1136 
partition P xs = List.partition P xs 
1137 
mapfilter f xs = List.mapPartial f xs 

1138 

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

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

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

1141 

17371  1142 
x > f f #> g 
1143 
(x, y) > f f #> g 

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

1144 

17495  1145 
* Pure/library.ML: introduced/changed precedence of infix operators: 
1146 

1147 
infix 1 > > > >> >> >>> #> #>; 

1148 
infix 2 ?; 

1149 
infix 3 o oo ooo oooo; 

1150 
infix 4 ~~ upto downto; 

1151 

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

1153 
infix operators. 

1154 

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

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

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

1158 

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

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

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

1161 

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

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

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

1164 

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

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

1166 
f x1 #> ... #> f xN 
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 o fold) f [xs1, ..., xsN] = 
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset

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

1170 

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

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

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

1173 

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

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

1175 
these: 'a option > 'a where 'a = 'b list 
17402  1176 
the_default: 'a > 'a option > 'a 
1177 
the_list: 'a option > 'a list 

1178 

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

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

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

1184 

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

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

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

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

1188 

17564  1189 
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides 
1190 

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

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

1193 

1194 
replacing make_keylist and keyfilter (occassionally used) 

1195 
Naive rewrites: 

1196 

1197 
make_keylist = AList.make 

1198 
keyfilter = AList.find (op =) 

1199 

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

1201 
avoiding eqtypes. Naive rewrites: 

1202 

1203 
eq_fst = eq_fst (op =) 

1204 
eq_snd = eq_snd (op =) 

1205 

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

1207 
Naive rewrites: 

1208 

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

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

1211 

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

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

1213 
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

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

1215 

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

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

1217 
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

1218 
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

1219 
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

1220 

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

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

1222 
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

1223 
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

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

1225 
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

1226 
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

1227 
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

1228 
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

1229 
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

1230 
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

1231 
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

1232 
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

1233 
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

1234 
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

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

1236 

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

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

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

1239 
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

1240 

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

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

1242 
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

1243 
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

1244 
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

1245 

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

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

1247 
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

1248 
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

1249 
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

1250 
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

1251 
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

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

1253 

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

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

1255 
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

1256 
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

1257 
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

1258 

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

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

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

1264 
name; NameSpace.extend is superceded by context dependent 

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

1266 
the naming context. Especially note Theory.restore_naming and 

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

1268 
Theory.add_path is no longer sufficient to recover from 

1269 
Theory.absolute_path in particular. 

1270 

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

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

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

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

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

1276 
with earlier declarations. 

16151  1277 

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

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

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

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

1281 

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

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

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

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

1285 
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

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

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

1288 

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

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

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

1291 

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

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

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

1294 

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

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

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

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

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

1299 

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

1300 
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

1301 
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

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

1303 

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

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

1305 

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

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

1307 
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

1308 
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

1309 
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

1310 

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

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

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

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

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

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

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

1317 
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

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

1319 

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

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

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

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

1323 

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

16151  1327 

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

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

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

1330 

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

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

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

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

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

1335 

16718  1336 
* Pure: print_tac now outputs the goal through the trace channel. 
1337 

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

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

1339 
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

1340 
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

1341 
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

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

1343 

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

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

1345 
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

1346 
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

1347 

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

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

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

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

1353 
for further details. 

16234  1354 

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

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

1358 
scripts for the time being. 

1359 

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

1362 

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

17538  1364 
HTML.with_charset "utf8" use_thy "Chinese"; 
17457  1365 

16234  1366 

1367 
*** System *** 

1368 

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

1370 
isabelle, isatool etc.). 

1371 

1372 
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for 

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

1374 

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

1376 
used by Isabelle; default is ROOT.ML. 

1377 

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

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

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

1380 

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

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

15703  1384 

1385 

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

1386 

14606  1387 
New in Isabelle2004 (April 2004) 
1388 
 

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

1389 

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

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

1391 

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

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

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

1394 

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

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

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

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

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

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

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

1404 
existing theory and ML files. 

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