wenzelm@5363
|
1 |
Isabelle NEWS -- history user-relevant changes
|
wenzelm@5363
|
2 |
==============================================
|
wenzelm@2553
|
3 |
|
wenzelm@17754
|
4 |
New in this Isabelle release
|
wenzelm@17754
|
5 |
----------------------------
|
wenzelm@17754
|
6 |
|
wenzelm@17754
|
7 |
*** General ***
|
wenzelm@17754
|
8 |
|
wenzelm@17918
|
9 |
* Theory syntax: the header format ``theory A = B + C:'' has been
|
wenzelm@17918
|
10 |
discontinued in favour of ``theory A imports B C begin''. Use isatool
|
wenzelm@17918
|
11 |
fixheaders to convert existing theory files. INCOMPATIBILITY.
|
wenzelm@17918
|
12 |
|
wenzelm@17918
|
13 |
* Theory syntax: the old non-Isar theory file format has been
|
wenzelm@17918
|
14 |
discontinued altogether. Note that ML proof scripts may still be used
|
wenzelm@17918
|
15 |
with Isar theories; migration is usually quite simple with the ML
|
wenzelm@17918
|
16 |
function use_legacy_bindings. INCOMPATIBILITY.
|
wenzelm@17918
|
17 |
|
wenzelm@17981
|
18 |
* Legacy goal package: reduced interface to the bare minimum required
|
wenzelm@17981
|
19 |
to keep existing proof scripts running. Most other user-level
|
wenzelm@17981
|
20 |
functions are now part of the OldGoals structure, which is *not* open
|
wenzelm@17981
|
21 |
by default (consider isatool expandshort before open OldGoals).
|
wenzelm@17981
|
22 |
Removed top_sg, prin, printyp, pprint_term/typ altogether, because
|
wenzelm@17981
|
23 |
these tend to cause confusion about the actual goal (!) context being
|
wenzelm@17981
|
24 |
used here, which is not necessarily the same as the_context().
|
wenzelm@17918
|
25 |
|
wenzelm@17754
|
26 |
* Command 'find_theorems': support "*" wildcard in "name:" criterion.
|
wenzelm@17754
|
27 |
|
wenzelm@17754
|
28 |
|
wenzelm@17865
|
29 |
*** Document preparation ***
|
wenzelm@17865
|
30 |
|
wenzelm@17869
|
31 |
* Added antiquotations @{ML_type text} and @{ML_struct text} which
|
wenzelm@17869
|
32 |
check the given source text as ML type/structure, printing verbatim.
|
wenzelm@17865
|
33 |
|
wenzelm@17865
|
34 |
|
wenzelm@17779
|
35 |
*** Pure ***
|
wenzelm@17779
|
36 |
|
wenzelm@17865
|
37 |
* Isar: improper proof element 'guess' is like 'obtain', but derives
|
wenzelm@17865
|
38 |
the obtained context from the course of reasoning! For example:
|
wenzelm@17865
|
39 |
|
wenzelm@17865
|
40 |
assume "EX x y. A x & B y" -- "any previous fact"
|
wenzelm@17865
|
41 |
then guess x and y by clarify
|
wenzelm@17865
|
42 |
|
wenzelm@17865
|
43 |
This technique is potentially adventurous, depending on the facts and
|
wenzelm@17865
|
44 |
proof tools being involved here.
|
wenzelm@17865
|
45 |
|
wenzelm@18020
|
46 |
* Isar: known facts from the proof context may be specified as literal
|
wenzelm@18020
|
47 |
propositions, using ASCII back-quote syntax. This works wherever
|
wenzelm@18020
|
48 |
named facts used to be allowed so far, in proof commands, proof
|
wenzelm@18020
|
49 |
methods, attributes etc. Literal facts are retrieved from the context
|
wenzelm@18020
|
50 |
according to unification of type and term parameters. For example,
|
wenzelm@18020
|
51 |
provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
|
wenzelm@18020
|
52 |
theorems in the current context, then these are valid literal facts:
|
wenzelm@18020
|
53 |
`A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
|
wenzelm@18020
|
54 |
|
wenzelm@18020
|
55 |
There is also a proof method "fact" which does the same composition
|
wenzelm@18044
|
56 |
for explicit goal states, e.g. the following proof texts coincide with
|
wenzelm@18044
|
57 |
certain special cases of literal facts:
|
wenzelm@18020
|
58 |
|
wenzelm@18020
|
59 |
have "A" by fact == note `A`
|
wenzelm@18020
|
60 |
have "A ==> B" by fact == note `A ==> B`
|
wenzelm@18020
|
61 |
have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
|
wenzelm@18020
|
62 |
have "P a ==> Q a" by fact == note `P a ==> Q a`
|
wenzelm@18020
|
63 |
|
wenzelm@18308
|
64 |
* Isar: 'def' now admits simultaneous definitions, e.g.:
|
wenzelm@18308
|
65 |
|
wenzelm@18308
|
66 |
def x == "t" and y == "u"
|
wenzelm@18308
|
67 |
|
wenzelm@18233
|
68 |
* Provers/induct: improved internal context management to support
|
wenzelm@18233
|
69 |
local fixes and defines on-the-fly. Thus explicit meta-level
|
wenzelm@18233
|
70 |
connectives !! and ==> are rarely required anymore in inductive goals
|
wenzelm@18233
|
71 |
(using object-logic connectives for this purpose has been long
|
wenzelm@18233
|
72 |
obsolete anyway). The subsequent proof patterns illustrate advanced
|
wenzelm@18233
|
73 |
techniques of natural induction; general datatypes and inductive sets
|
wenzelm@18267
|
74 |
work analogously (see also src/HOL/Lambda for realistic examples).
|
wenzelm@18267
|
75 |
|
wenzelm@18267
|
76 |
(1) This is how to ``strengthen'' an inductive goal wrt. certain
|
wenzelm@18239
|
77 |
parameters:
|
wenzelm@18233
|
78 |
|
wenzelm@18233
|
79 |
lemma
|
wenzelm@18233
|
80 |
fixes n :: nat and x :: 'a
|
wenzelm@18233
|
81 |
assumes a: "A n x"
|
wenzelm@18233
|
82 |
shows "P n x"
|
wenzelm@18233
|
83 |
using a -- {* make induct insert fact a *}
|
wenzelm@18233
|
84 |
proof (induct n fixing: x) -- {* generalize goal to "!!x. A n x ==> P n x" *}
|
wenzelm@18248
|
85 |
case 0
|
wenzelm@18233
|
86 |
show ?case sorry
|
wenzelm@18233
|
87 |
next
|
wenzelm@18248
|
88 |
case (Suc n)
|
wenzelm@18239
|
89 |
note `!!x. A n x ==> P n x` -- {* induction hypothesis, according to induction rule *}
|
wenzelm@18239
|
90 |
note `A (Suc n) x` -- {* induction premise, stemming from fact a *}
|
wenzelm@18233
|
91 |
show ?case sorry
|
wenzelm@18233
|
92 |
qed
|
wenzelm@18233
|
93 |
|
wenzelm@18267
|
94 |
(2) This is how to perform induction over ``expressions of a certain
|
wenzelm@18233
|
95 |
form'', using a locally defined inductive parameter n == "a x"
|
wenzelm@18239
|
96 |
together with strengthening (the latter is usually required to get
|
wenzelm@18267
|
97 |
sufficiently flexible induction hypotheses):
|
wenzelm@18233
|
98 |
|
wenzelm@18233
|
99 |
lemma
|
wenzelm@18233
|
100 |
fixes a :: "'a => nat"
|
wenzelm@18233
|
101 |
assumes a: "A (a x)"
|
wenzelm@18233
|
102 |
shows "P (a x)"
|
wenzelm@18233
|
103 |
using a
|
wenzelm@18233
|
104 |
proof (induct n == "a x" fixing: x)
|
wenzelm@18233
|
105 |
...
|
wenzelm@18233
|
106 |
|
wenzelm@18267
|
107 |
See also HOL/Isar_examples/Puzzle.thy for an application of the this
|
wenzelm@18267
|
108 |
particular technique.
|
wenzelm@18267
|
109 |
|
wenzelm@18267
|
110 |
(3) This is how to perform existential reasoning ('obtain') by
|
wenzelm@18267
|
111 |
induction, while avoiding explicit object-logic encodings:
|
wenzelm@18267
|
112 |
|
wenzelm@18267
|
113 |
fix n :: nat
|
wenzelm@18267
|
114 |
obtain x :: 'a where "P n x" and "Q n x"
|
wenzelm@18267
|
115 |
proof (induct n fixing: thesis)
|
wenzelm@18267
|
116 |
case 0
|
wenzelm@18267
|
117 |
obtain x where "P 0 x" and "Q 0 x" sorry
|
wenzelm@18399
|
118 |
then show thesis by (rule 0)
|
wenzelm@18267
|
119 |
next
|
wenzelm@18267
|
120 |
case (Suc n)
|
wenzelm@18267
|
121 |
obtain x where "P n x" and "Q n x" by (rule Suc.hyps)
|
wenzelm@18267
|
122 |
obtain x where "P (Suc n) x" and "Q (Suc n) x" sorry
|
wenzelm@18267
|
123 |
then show thesis by (rule Suc.prems)
|
wenzelm@18267
|
124 |
qed
|
wenzelm@18267
|
125 |
|
wenzelm@18267
|
126 |
Here the 'fixing: thesis' specification essentially modifies the scope
|
wenzelm@18267
|
127 |
of the formal thesis parameter, in order to the get the whole
|
wenzelm@18267
|
128 |
existence statement through the induction as expected.
|
wenzelm@18233
|
129 |
|
wenzelm@18480
|
130 |
* Provers/induct: mutual goals no longer result in object-level
|
wenzelm@18480
|
131 |
conjunction, but in properly split meta-level statements,
|
wenzelm@18480
|
132 |
INCOMPATIBILITY. The corresponding cases are duplicated accordingly,
|
wenzelm@18480
|
133 |
with the case names being indexed according to the number of
|
wenzelm@18480
|
134 |
conjuncts. For example:
|
wenzelm@18480
|
135 |
|
wenzelm@18480
|
136 |
lemma
|
wenzelm@18480
|
137 |
fixes n :: nat
|
wenzelm@18480
|
138 |
shows "P n" and "Q n"
|
wenzelm@18480
|
139 |
proof (induct n)
|
wenzelm@18480
|
140 |
case 01
|
wenzelm@18480
|
141 |
show "P 0" sorry
|
wenzelm@18480
|
142 |
next
|
wenzelm@18480
|
143 |
case 02
|
wenzelm@18480
|
144 |
show "Q 0" sorry
|
wenzelm@18480
|
145 |
next
|
wenzelm@18480
|
146 |
case (Suc1 n)
|
wenzelm@18480
|
147 |
note `P n` and `Q n`
|
wenzelm@18480
|
148 |
show "P (Suc n)" sorry
|
wenzelm@18480
|
149 |
next
|
wenzelm@18480
|
150 |
case (Suc2 n)
|
wenzelm@18480
|
151 |
note `P n` and `Q n`
|
wenzelm@18480
|
152 |
show "Q (Suc n)" sorry
|
wenzelm@18480
|
153 |
qed
|
wenzelm@18480
|
154 |
|
wenzelm@18480
|
155 |
* Provers/induct: mutual induction rules are now specified as a list
|
wenzelm@18480
|
156 |
of rule sharing the same induction cases. HOL packages usually
|
wenzelm@18480
|
157 |
provide foo_bar.inducts for mutually defined items foo and bar
|
wenzelm@18480
|
158 |
(e.g. inductive sets or datatypes). INCOMPATIBILITY, users need to
|
wenzelm@18480
|
159 |
specify mutual induction rules differently, e.g. like this:
|
wenzelm@18480
|
160 |
|
wenzelm@18480
|
161 |
(induct rule: foo_bar.inducts)
|
wenzelm@18480
|
162 |
(induct set: foo bar)
|
wenzelm@18480
|
163 |
(induct type: foo bar)
|
wenzelm@18480
|
164 |
|
wenzelm@18480
|
165 |
Moreover, the ML function ProjectRule.projections turns old-style
|
wenzelm@18480
|
166 |
rules into the new format.
|
wenzelm@18480
|
167 |
|
wenzelm@18399
|
168 |
* Provers/induct: support coinduction as well. See
|
wenzelm@18399
|
169 |
src/HOL/Library/Coinductive_List.thy for various examples.
|
wenzelm@18399
|
170 |
|
wenzelm@17779
|
171 |
* Input syntax now supports dummy variable binding "%_. b", where the
|
wenzelm@17779
|
172 |
body does not mention the bound variable. Note that dummy patterns
|
wenzelm@17779
|
173 |
implicitly depend on their context of bounds, which makes "{_. _}"
|
wenzelm@17780
|
174 |
match any set comprehension as expected. Potential INCOMPATIBILITY --
|
wenzelm@17780
|
175 |
parse translations need to cope with syntactic constant "_idtdummy" in
|
wenzelm@17780
|
176 |
the binding position.
|
wenzelm@17780
|
177 |
|
wenzelm@17780
|
178 |
* Removed obsolete syntactic constant "_K" and its associated parse
|
wenzelm@17780
|
179 |
translation. INCOMPATIBILITY -- use dummy abstraction instead, for
|
wenzelm@17779
|
180 |
example "A -> B" => "Pi A (%_. B)".
|
wenzelm@17779
|
181 |
|
wenzelm@17865
|
182 |
|
nipkow@17806
|
183 |
*** HOL ***
|
nipkow@17806
|
184 |
|
wenzelm@17996
|
185 |
* Alternative iff syntax "A <-> B" for equality on bool (with priority
|
wenzelm@17996
|
186 |
25 like -->); output depends on the "iff" print_mode, the default is
|
wenzelm@17996
|
187 |
"A = B" (with priority 50).
|
wenzelm@17996
|
188 |
|
wenzelm@17865
|
189 |
* In the context of the assumption "~(s = t)" the Simplifier rewrites
|
wenzelm@17865
|
190 |
"t = s" to False (by simproc "neq_simproc"). For backward
|
wenzelm@17865
|
191 |
compatibility this can be disabled by ML "reset use_neq_simproc".
|
wenzelm@17779
|
192 |
|
webertj@17809
|
193 |
* Tactics 'sat' and 'satx' reimplemented, several improvements: goals
|
webertj@17809
|
194 |
no longer need to be stated as "<prems> ==> False", equivalences (i.e.
|
wenzelm@17865
|
195 |
"=" on type bool) are handled, variable names of the form "lit_<n>"
|
wenzelm@17865
|
196 |
are no longer reserved, significant speedup.
|
wenzelm@17865
|
197 |
|
wenzelm@18480
|
198 |
* inductive and datatype: provide projections of mutual rules, bundled
|
wenzelm@18480
|
199 |
as foo_bar.inducts;
|
wenzelm@18480
|
200 |
|
wenzelm@18446
|
201 |
* Library: added theory Coinductive_List of potentially infinite lists
|
wenzelm@18446
|
202 |
as greatest fixed-point.
|
wenzelm@18399
|
203 |
|
webertj@17809
|
204 |
|
wenzelm@17878
|
205 |
*** ML ***
|
wenzelm@17878
|
206 |
|
haftmann@18450
|
207 |
* Pure/library:
|
haftmann@18450
|
208 |
|
haftmann@18450
|
209 |
val burrow: ('a list -> 'b list) -> 'a list list -> 'b list list
|
haftmann@18450
|
210 |
val burrow_split: ('a list -> 'c * 'b list) -> 'a list list -> 'c * 'b list list
|
haftmann@18450
|
211 |
|
haftmann@18450
|
212 |
The semantics of "burrow" is: "take a function with *simulatanously* transforms
|
haftmann@18450
|
213 |
a list of value, and apply it *simulatanously* to a list of list of values of the
|
haftmann@18450
|
214 |
appropriate type". Confer this with "map" which would *not* apply its argument
|
haftmann@18450
|
215 |
function simulatanously but in sequence. "burrow_split" allows the transformator
|
haftmann@18450
|
216 |
function to yield an additional side result.
|
haftmann@18450
|
217 |
|
haftmann@18450
|
218 |
Both actually avoid the usage of "unflat" since they hide away "unflat"
|
haftmann@18450
|
219 |
from the user.
|
haftmann@18450
|
220 |
|
wenzelm@18446
|
221 |
* Pure/library: functions map2 and fold2 with curried syntax for
|
wenzelm@18446
|
222 |
simultanous mapping and folding:
|
wenzelm@18446
|
223 |
|
haftmann@18422
|
224 |
val map2: ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list
|
haftmann@18422
|
225 |
val fold2: ('a -> 'b -> 'c -> 'c) -> 'a list -> 'b list -> 'c -> 'c
|
haftmann@18422
|
226 |
|
wenzelm@18446
|
227 |
* Pure/library: indexed lists - some functions in the Isabelle library
|
wenzelm@18446
|
228 |
treating lists over 'a as finite mappings from [0...n] to 'a have been
|
wenzelm@18446
|
229 |
given more convenient names and signatures reminiscent of similar
|
wenzelm@18446
|
230 |
functions for alists, tables, etc:
|
haftmann@18051
|
231 |
|
haftmann@18051
|
232 |
val nth: 'a list -> int -> 'a
|
haftmann@18051
|
233 |
val nth_update: int * 'a -> 'a list -> 'a list
|
haftmann@18051
|
234 |
val nth_map: int -> ('a -> 'a) -> 'a list -> 'a list
|
haftmann@18051
|
235 |
val fold_index: (int * 'a -> 'b -> 'b) -> 'a list -> 'b -> 'b
|
haftmann@18051
|
236 |
|
wenzelm@18446
|
237 |
Note that fold_index starts counting at index 0, not 1 like foldln
|
wenzelm@18446
|
238 |
used to.
|
wenzelm@18446
|
239 |
|
wenzelm@18446
|
240 |
* Pure/General: name_mangler.ML provides a functor for generic name
|
wenzelm@18446
|
241 |
mangling (bijective mapping from any expression values to strings).
|
wenzelm@18446
|
242 |
|
wenzelm@18446
|
243 |
* Pure/General: rat.ML implements rational numbers.
|
wenzelm@18446
|
244 |
|
wenzelm@18446
|
245 |
* Pure: several functions of signature "... -> theory -> theory * ..."
|
wenzelm@18446
|
246 |
have been reoriented to "... -> theory -> ... * theory" in order to
|
wenzelm@18446
|
247 |
allow natural usage in combination with the ||>, ||>>, |-> and
|
wenzelm@18446
|
248 |
fold_map combinators.
|
haftmann@18051
|
249 |
|
wenzelm@18020
|
250 |
* Pure: primitive rule lift_rule now takes goal cterm instead of an
|
wenzelm@18145
|
251 |
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
|
wenzelm@18020
|
252 |
achieve the old behaviour.
|
wenzelm@18020
|
253 |
|
wenzelm@18020
|
254 |
* Pure: the "Goal" constant is now called "prop", supporting a
|
wenzelm@18020
|
255 |
slightly more general idea of ``protecting'' meta-level rule
|
wenzelm@18020
|
256 |
statements.
|
wenzelm@18020
|
257 |
|
wenzelm@17981
|
258 |
* Internal goals: structure Goal provides simple interfaces for
|
wenzelm@17981
|
259 |
init/conclude/finish and tactical prove operations (replacing former
|
wenzelm@17981
|
260 |
Tactic.prove). Note that OldGoals.prove_goalw_cterm has long been
|
wenzelm@17981
|
261 |
obsolete, it is ill-behaved in a local proof context (e.g. with local
|
wenzelm@17981
|
262 |
fixes/assumes or in a locale context).
|
wenzelm@17981
|
263 |
|
wenzelm@17878
|
264 |
* Simplifier: the simpset of a running simplification process now
|
wenzelm@17878
|
265 |
contains a proof context (cf. Simplifier.the_context), which is the
|
wenzelm@17878
|
266 |
very context that the initial simpset has been retrieved from (by
|
wenzelm@17890
|
267 |
simpset_of/local_simpset_of). Consequently, all plug-in components
|
wenzelm@17878
|
268 |
(solver, looper etc.) may depend on arbitrary proof data.
|
wenzelm@17878
|
269 |
|
wenzelm@17878
|
270 |
* Simplifier.inherit_context inherits the proof context (plus the
|
wenzelm@17878
|
271 |
local bounds) of the current simplification process; any simproc
|
wenzelm@17878
|
272 |
etc. that calls the Simplifier recursively should do this! Removed
|
wenzelm@17878
|
273 |
former Simplifier.inherit_bounds, which is already included here --
|
wenzelm@17890
|
274 |
INCOMPATIBILITY. Tools based on low-level rewriting may even have to
|
wenzelm@17890
|
275 |
specify an explicit context using Simplifier.context/theory_context.
|
wenzelm@17878
|
276 |
|
wenzelm@17878
|
277 |
* Simplifier/Classical Reasoner: more abstract interfaces
|
wenzelm@17878
|
278 |
change_simpset/claset for modifying the simpset/claset reference of a
|
wenzelm@17878
|
279 |
theory; raw versions simpset/claset_ref etc. have been discontinued --
|
wenzelm@17878
|
280 |
INCOMPATIBILITY.
|
wenzelm@17878
|
281 |
|
wenzelm@17878
|
282 |
|
wenzelm@17754
|
283 |
|
wenzelm@17720
|
284 |
New in Isabelle2005 (October 2005)
|
wenzelm@17720
|
285 |
----------------------------------
|
wenzelm@14655
|
286 |
|
wenzelm@14655
|
287 |
*** General ***
|
wenzelm@14655
|
288 |
|
nipkow@15130
|
289 |
* Theory headers: the new header syntax for Isar theories is
|
nipkow@15130
|
290 |
|
nipkow@15130
|
291 |
theory <name>
|
wenzelm@16234
|
292 |
imports <theory1> ... <theoryN>
|
wenzelm@16234
|
293 |
uses <file1> ... <fileM>
|
nipkow@15130
|
294 |
begin
|
nipkow@15130
|
295 |
|
wenzelm@16234
|
296 |
where the 'uses' part is optional. The previous syntax
|
wenzelm@16234
|
297 |
|
wenzelm@16234
|
298 |
theory <name> = <theory1> + ... + <theoryN>:
|
wenzelm@16234
|
299 |
|
wenzelm@16717
|
300 |
will disappear in the next release. Use isatool fixheaders to convert
|
wenzelm@16717
|
301 |
existing theory files. Note that there is no change in ancient
|
wenzelm@17371
|
302 |
non-Isar theories now, but these will disappear soon.
|
nipkow@15130
|
303 |
|
berghofe@15475
|
304 |
* Theory loader: parent theories can now also be referred to via
|
wenzelm@16234
|
305 |
relative and absolute paths.
|
wenzelm@16234
|
306 |
|
wenzelm@17408
|
307 |
* Command 'find_theorems' searches for a list of criteria instead of a
|
wenzelm@17408
|
308 |
list of constants. Known criteria are: intro, elim, dest, name:string,
|
wenzelm@17408
|
309 |
simp:term, and any term. Criteria can be preceded by '-' to select
|
wenzelm@17408
|
310 |
theorems that do not match. Intro, elim, dest select theorems that
|
wenzelm@17408
|
311 |
match the current goal, name:s selects theorems whose fully qualified
|
wenzelm@17408
|
312 |
name contain s, and simp:term selects all simplification rules whose
|
wenzelm@17408
|
313 |
lhs match term. Any other term is interpreted as pattern and selects
|
wenzelm@17408
|
314 |
all theorems matching the pattern. Available in ProofGeneral under
|
wenzelm@17408
|
315 |
'ProofGeneral -> Find Theorems' or C-c C-f. Example:
|
wenzelm@16234
|
316 |
|
wenzelm@17275
|
317 |
C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
|
wenzelm@16234
|
318 |
|
wenzelm@16234
|
319 |
prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
|
wenzelm@16234
|
320 |
matching the current goal as introduction rule and not having "HOL."
|
wenzelm@16234
|
321 |
in their name (i.e. not being defined in theory HOL).
|
wenzelm@16234
|
322 |
|
wenzelm@17408
|
323 |
* Command 'thms_containing' has been discontinued in favour of
|
wenzelm@17408
|
324 |
'find_theorems'; INCOMPATIBILITY.
|
wenzelm@17408
|
325 |
|
wenzelm@17385
|
326 |
* Communication with Proof General is now 8bit clean, which means that
|
wenzelm@17385
|
327 |
Unicode text in UTF-8 encoding may be used within theory texts (both
|
wenzelm@17408
|
328 |
formal and informal parts). Cf. option -U of the Isabelle Proof
|
wenzelm@17538
|
329 |
General interface. Here are some simple examples (cf. src/HOL/ex):
|
wenzelm@17538
|
330 |
|
wenzelm@17538
|
331 |
http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
|
wenzelm@17538
|
332 |
http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
|
wenzelm@17385
|
333 |
|
wenzelm@17425
|
334 |
* Improved efficiency of the Simplifier and, to a lesser degree, the
|
wenzelm@17425
|
335 |
Classical Reasoner. Typical big applications run around 2 times
|
wenzelm@17425
|
336 |
faster.
|
wenzelm@17425
|
337 |
|
wenzelm@16234
|
338 |
|
wenzelm@16234
|
339 |
*** Document preparation ***
|
wenzelm@16234
|
340 |
|
wenzelm@16234
|
341 |
* Commands 'display_drafts' and 'print_drafts' perform simple output
|
wenzelm@16234
|
342 |
of raw sources. Only those symbols that do not require additional
|
wenzelm@16234
|
343 |
LaTeX packages (depending on comments in isabellesym.sty) are
|
wenzelm@16234
|
344 |
displayed properly, everything else is left verbatim. isatool display
|
wenzelm@16234
|
345 |
and isatool print are used as front ends (these are subject to the
|
wenzelm@16234
|
346 |
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
|
wenzelm@16234
|
347 |
|
wenzelm@17047
|
348 |
* Command tags control specific markup of certain regions of text,
|
wenzelm@17047
|
349 |
notably folding and hiding. Predefined tags include "theory" (for
|
wenzelm@17047
|
350 |
theory begin and end), "proof" for proof commands, and "ML" for
|
wenzelm@17047
|
351 |
commands involving ML code; the additional tags "visible" and
|
wenzelm@17047
|
352 |
"invisible" are unused by default. Users may give explicit tag
|
wenzelm@17047
|
353 |
specifications in the text, e.g. ''by %invisible (auto)''. The
|
wenzelm@17047
|
354 |
interpretation of tags is determined by the LaTeX job during document
|
wenzelm@17047
|
355 |
preparation: see option -V of isatool usedir, or options -n and -t of
|
wenzelm@17047
|
356 |
isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
|
wenzelm@17047
|
357 |
\isadroptag.
|
wenzelm@17047
|
358 |
|
wenzelm@17047
|
359 |
Several document versions may be produced at the same time via isatool
|
wenzelm@17047
|
360 |
usedir (the generated index.html will link all of them). Typical
|
wenzelm@17047
|
361 |
specifications include ''-V document=theory,proof,ML'' to present
|
wenzelm@17047
|
362 |
theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
|
wenzelm@17047
|
363 |
proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
|
wenzelm@17047
|
364 |
these parts without any formal replacement text. The Isabelle site
|
wenzelm@17047
|
365 |
default settings produce ''document'' and ''outline'' versions as
|
wenzelm@17047
|
366 |
specified above.
|
wenzelm@16234
|
367 |
|
haftmann@17402
|
368 |
* Several new antiquotations:
|
wenzelm@16234
|
369 |
|
wenzelm@16234
|
370 |
@{term_type term} prints a term with its type annotated;
|
wenzelm@16234
|
371 |
|
wenzelm@16234
|
372 |
@{typeof term} prints the type of a term;
|
wenzelm@16234
|
373 |
|
wenzelm@16234
|
374 |
@{const const} is the same as @{term const}, but checks that the
|
wenzelm@16234
|
375 |
argument is a known logical constant;
|
wenzelm@16234
|
376 |
|
wenzelm@16234
|
377 |
@{term_style style term} and @{thm_style style thm} print a term or
|
wenzelm@16234
|
378 |
theorem applying a "style" to it
|
wenzelm@16234
|
379 |
|
wenzelm@17117
|
380 |
@{ML text}
|
wenzelm@17117
|
381 |
|
wenzelm@16234
|
382 |
Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
|
wenzelm@16234
|
383 |
definitions, equations, inequations etc., 'concl' printing only the
|
schirmer@17393
|
384 |
conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
|
wenzelm@16234
|
385 |
to print the specified premise. TermStyle.add_style provides an ML
|
wenzelm@16234
|
386 |
interface for introducing further styles. See also the "LaTeX Sugar"
|
wenzelm@17117
|
387 |
document practical applications. The ML antiquotation prints
|
wenzelm@17117
|
388 |
type-checked ML expressions verbatim.
|
wenzelm@16234
|
389 |
|
wenzelm@17259
|
390 |
* Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
|
wenzelm@17259
|
391 |
and 'text' support optional locale specification '(in loc)', which
|
wenzelm@17269
|
392 |
specifies the default context for interpreting antiquotations. For
|
wenzelm@17269
|
393 |
example: 'text (in lattice) {* @{thm inf_assoc}*}'.
|
wenzelm@17259
|
394 |
|
wenzelm@17259
|
395 |
* Option 'locale=NAME' of antiquotations specifies an alternative
|
wenzelm@17259
|
396 |
context interpreting the subsequent argument. For example: @{thm
|
wenzelm@17269
|
397 |
[locale=lattice] inf_assoc}.
|
wenzelm@17259
|
398 |
|
wenzelm@17097
|
399 |
* Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
|
wenzelm@17097
|
400 |
a proof context.
|
wenzelm@17097
|
401 |
|
wenzelm@17097
|
402 |
* Proper output of antiquotations for theory commands involving a
|
wenzelm@17097
|
403 |
proof context (such as 'locale' or 'theorem (in loc) ...').
|
wenzelm@17097
|
404 |
|
wenzelm@17193
|
405 |
* Delimiters of outer tokens (string etc.) now produce separate LaTeX
|
wenzelm@17193
|
406 |
macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
|
wenzelm@17193
|
407 |
|
wenzelm@17193
|
408 |
* isatool usedir: new option -C (default true) controls whether option
|
wenzelm@17193
|
409 |
-D should include a copy of the original document directory; -C false
|
wenzelm@17193
|
410 |
prevents unwanted effects such as copying of administrative CVS data.
|
wenzelm@17193
|
411 |
|
wenzelm@16234
|
412 |
|
wenzelm@16234
|
413 |
*** Pure ***
|
wenzelm@16234
|
414 |
|
wenzelm@16234
|
415 |
* Considerably improved version of 'constdefs' command. Now performs
|
wenzelm@16234
|
416 |
automatic type-inference of declared constants; additional support for
|
wenzelm@16234
|
417 |
local structure declarations (cf. locales and HOL records), see also
|
wenzelm@16234
|
418 |
isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
|
wenzelm@16234
|
419 |
sequential dependencies of definitions within a single 'constdefs'
|
wenzelm@16234
|
420 |
section; moreover, the declared name needs to be an identifier. If
|
wenzelm@16234
|
421 |
all fails, consider to fall back on 'consts' and 'defs' separately.
|
wenzelm@16234
|
422 |
|
wenzelm@16234
|
423 |
* Improved indexed syntax and implicit structures. First of all,
|
wenzelm@16234
|
424 |
indexed syntax provides a notational device for subscripted
|
wenzelm@16234
|
425 |
application, using the new syntax \<^bsub>term\<^esub> for arbitrary
|
wenzelm@16234
|
426 |
expressions. Secondly, in a local context with structure
|
wenzelm@16234
|
427 |
declarations, number indexes \<^sub>n or the empty index (default
|
wenzelm@16234
|
428 |
number 1) refer to a certain fixed variable implicitly; option
|
wenzelm@16234
|
429 |
show_structs controls printing of implicit structures. Typical
|
wenzelm@16234
|
430 |
applications of these concepts involve record types and locales.
|
wenzelm@16234
|
431 |
|
wenzelm@16234
|
432 |
* New command 'no_syntax' removes grammar declarations (and
|
wenzelm@16234
|
433 |
translations) resulting from the given syntax specification, which is
|
wenzelm@16234
|
434 |
interpreted in the same manner as for the 'syntax' command.
|
wenzelm@16234
|
435 |
|
wenzelm@16234
|
436 |
* 'Advanced' translation functions (parse_translation etc.) may depend
|
wenzelm@16234
|
437 |
on the signature of the theory context being presently used for
|
wenzelm@16234
|
438 |
parsing/printing, see also isar-ref manual.
|
wenzelm@16234
|
439 |
|
wenzelm@16856
|
440 |
* Improved 'oracle' command provides a type-safe interface to turn an
|
wenzelm@16856
|
441 |
ML expression of type theory -> T -> term into a primitive rule of
|
wenzelm@16856
|
442 |
type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
|
wenzelm@16856
|
443 |
is already included here); see also FOL/ex/IffExample.thy;
|
wenzelm@16856
|
444 |
INCOMPATIBILITY.
|
wenzelm@16856
|
445 |
|
wenzelm@17275
|
446 |
* axclass: name space prefix for class "c" is now "c_class" (was "c"
|
wenzelm@17275
|
447 |
before); "cI" is no longer bound, use "c.intro" instead.
|
wenzelm@17275
|
448 |
INCOMPATIBILITY. This change avoids clashes of fact bindings for
|
wenzelm@17275
|
449 |
axclasses vs. locales.
|
wenzelm@17275
|
450 |
|
wenzelm@16234
|
451 |
* Improved internal renaming of symbolic identifiers -- attach primes
|
wenzelm@16234
|
452 |
instead of base 26 numbers.
|
wenzelm@16234
|
453 |
|
wenzelm@16234
|
454 |
* New flag show_question_marks controls printing of leading question
|
wenzelm@16234
|
455 |
marks in schematic variable names.
|
wenzelm@16234
|
456 |
|
wenzelm@16234
|
457 |
* In schematic variable names, *any* symbol following \<^isub> or
|
wenzelm@16234
|
458 |
\<^isup> is now treated as part of the base name. For example, the
|
wenzelm@16234
|
459 |
following works without printing of awkward ".0" indexes:
|
wenzelm@16234
|
460 |
|
wenzelm@16234
|
461 |
lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
|
wenzelm@16234
|
462 |
by simp
|
wenzelm@16234
|
463 |
|
wenzelm@16234
|
464 |
* Inner syntax includes (*(*nested*) comments*).
|
wenzelm@16234
|
465 |
|
wenzelm@17548
|
466 |
* Pretty printer now supports unbreakable blocks, specified in mixfix
|
wenzelm@16234
|
467 |
annotations as "(00...)".
|
wenzelm@16234
|
468 |
|
wenzelm@16234
|
469 |
* Clear separation of logical types and nonterminals, where the latter
|
wenzelm@16234
|
470 |
may only occur in 'syntax' specifications or type abbreviations.
|
wenzelm@16234
|
471 |
Before that distinction was only partially implemented via type class
|
wenzelm@16234
|
472 |
"logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
|
wenzelm@16234
|
473 |
use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
|
wenzelm@16234
|
474 |
exotic syntax specifications may require further adaption
|
wenzelm@17691
|
475 |
(e.g. Cube/Cube.thy).
|
wenzelm@16234
|
476 |
|
wenzelm@16234
|
477 |
* Removed obsolete type class "logic", use the top sort {} instead.
|
wenzelm@16234
|
478 |
Note that non-logical types should be declared as 'nonterminals'
|
wenzelm@16234
|
479 |
rather than 'types'. INCOMPATIBILITY for new object-logic
|
wenzelm@16234
|
480 |
specifications.
|
wenzelm@16234
|
481 |
|
ballarin@17095
|
482 |
* Attributes 'induct' and 'cases': type or set names may now be
|
ballarin@17095
|
483 |
locally fixed variables as well.
|
ballarin@17095
|
484 |
|
wenzelm@16234
|
485 |
* Simplifier: can now control the depth to which conditional rewriting
|
wenzelm@16234
|
486 |
is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
|
wenzelm@16234
|
487 |
Limit.
|
wenzelm@16234
|
488 |
|
wenzelm@16234
|
489 |
* Simplifier: simplification procedures may now take the current
|
wenzelm@16234
|
490 |
simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
|
wenzelm@16234
|
491 |
interface), which is very useful for calling the Simplifier
|
wenzelm@16234
|
492 |
recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
|
wenzelm@16234
|
493 |
is gone -- use prems_of_ss on the simpset instead. Moreover, the
|
wenzelm@16234
|
494 |
low-level mk_simproc no longer applies Logic.varify internally, to
|
wenzelm@16234
|
495 |
allow for use in a context of fixed variables.
|
wenzelm@16234
|
496 |
|
wenzelm@16234
|
497 |
* thin_tac now works even if the assumption being deleted contains !!
|
wenzelm@16234
|
498 |
or ==>. More generally, erule now works even if the major premise of
|
wenzelm@16234
|
499 |
the elimination rule contains !! or ==>.
|
wenzelm@16234
|
500 |
|
wenzelm@17597
|
501 |
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
|
nipkow@17590
|
502 |
|
wenzelm@16234
|
503 |
* Reorganized bootstrapping of the Pure theories; CPure is now derived
|
wenzelm@16234
|
504 |
from Pure, which contains all common declarations already. Both
|
wenzelm@16234
|
505 |
theories are defined via plain Isabelle/Isar .thy files.
|
wenzelm@16234
|
506 |
INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
|
wenzelm@16234
|
507 |
CPure.elim / CPure.dest attributes) now appear in the Pure name space;
|
wenzelm@16234
|
508 |
use isatool fixcpure to adapt your theory and ML sources.
|
wenzelm@16234
|
509 |
|
wenzelm@16234
|
510 |
* New syntax 'name(i-j, i-, i, ...)' for referring to specific
|
wenzelm@16234
|
511 |
selections of theorems in named facts via index ranges.
|
wenzelm@16234
|
512 |
|
wenzelm@17097
|
513 |
* 'print_theorems': in theory mode, really print the difference
|
wenzelm@17097
|
514 |
wrt. the last state (works for interactive theory development only),
|
wenzelm@17097
|
515 |
in proof mode print all local facts (cf. 'print_facts');
|
wenzelm@17097
|
516 |
|
wenzelm@17397
|
517 |
* 'hide': option '(open)' hides only base names.
|
wenzelm@17397
|
518 |
|
wenzelm@17275
|
519 |
* More efficient treatment of intermediate checkpoints in interactive
|
wenzelm@17275
|
520 |
theory development.
|
wenzelm@17275
|
521 |
|
berghofe@17663
|
522 |
* Code generator is now invoked via code_module (incremental code
|
wenzelm@17664
|
523 |
generation) and code_library (modular code generation, ML structures
|
wenzelm@17664
|
524 |
for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
|
wenzelm@17664
|
525 |
must be quoted when used as identifiers.
|
wenzelm@17664
|
526 |
|
wenzelm@17664
|
527 |
* New 'value' command for reading, evaluating and printing terms using
|
wenzelm@17664
|
528 |
the code generator. INCOMPATIBILITY: command keyword 'value' must be
|
wenzelm@17664
|
529 |
quoted when used as identifier.
|
berghofe@17663
|
530 |
|
wenzelm@16234
|
531 |
|
wenzelm@16234
|
532 |
*** Locales ***
|
ballarin@17095
|
533 |
|
wenzelm@17385
|
534 |
* New commands for the interpretation of locale expressions in
|
wenzelm@17385
|
535 |
theories (1), locales (2) and proof contexts (3). These generate
|
wenzelm@17385
|
536 |
proof obligations from the expression specification. After the
|
wenzelm@17385
|
537 |
obligations have been discharged, theorems of the expression are added
|
wenzelm@17385
|
538 |
to the theory, target locale or proof context. The synopsis of the
|
wenzelm@17385
|
539 |
commands is a follows:
|
wenzelm@17385
|
540 |
|
ballarin@17095
|
541 |
(1) interpretation expr inst
|
ballarin@17095
|
542 |
(2) interpretation target < expr
|
ballarin@17095
|
543 |
(3) interpret expr inst
|
wenzelm@17385
|
544 |
|
ballarin@17095
|
545 |
Interpretation in theories and proof contexts require a parameter
|
ballarin@17095
|
546 |
instantiation of terms from the current context. This is applied to
|
wenzelm@17385
|
547 |
specifications and theorems of the interpreted expression.
|
wenzelm@17385
|
548 |
Interpretation in locales only permits parameter renaming through the
|
wenzelm@17385
|
549 |
locale expression. Interpretation is smart in that interpretations
|
wenzelm@17385
|
550 |
that are active already do not occur in proof obligations, neither are
|
wenzelm@17385
|
551 |
instantiated theorems stored in duplicate. Use 'print_interps' to
|
wenzelm@17385
|
552 |
inspect active interpretations of a particular locale. For details,
|
ballarin@17436
|
553 |
see the Isar Reference manual. Examples can be found in
|
ballarin@17436
|
554 |
HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
|
wenzelm@16234
|
555 |
|
wenzelm@16234
|
556 |
INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
|
wenzelm@16234
|
557 |
'interpret' instead.
|
wenzelm@16234
|
558 |
|
wenzelm@17385
|
559 |
* New context element 'constrains' for adding type constraints to
|
wenzelm@17385
|
560 |
parameters.
|
wenzelm@17385
|
561 |
|
wenzelm@17385
|
562 |
* Context expressions: renaming of parameters with syntax
|
wenzelm@17385
|
563 |
redeclaration.
|
ballarin@17095
|
564 |
|
ballarin@17095
|
565 |
* Locale declaration: 'includes' disallowed.
|
ballarin@17095
|
566 |
|
wenzelm@16234
|
567 |
* Proper static binding of attribute syntax -- i.e. types / terms /
|
wenzelm@16234
|
568 |
facts mentioned as arguments are always those of the locale definition
|
wenzelm@16234
|
569 |
context, independently of the context of later invocations. Moreover,
|
wenzelm@16234
|
570 |
locale operations (renaming and type / term instantiation) are applied
|
wenzelm@16234
|
571 |
to attribute arguments as expected.
|
wenzelm@16234
|
572 |
|
wenzelm@16234
|
573 |
INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
|
wenzelm@16234
|
574 |
actual attributes; rare situations may require Attrib.attribute to
|
wenzelm@16234
|
575 |
embed those attributes into Attrib.src that lack concrete syntax.
|
wenzelm@16234
|
576 |
Attribute implementations need to cooperate properly with the static
|
wenzelm@16234
|
577 |
binding mechanism. Basic parsers Args.XXX_typ/term/prop and
|
wenzelm@16234
|
578 |
Attrib.XXX_thm etc. already do the right thing without further
|
wenzelm@16234
|
579 |
intervention. Only unusual applications -- such as "where" or "of"
|
wenzelm@16234
|
580 |
(cf. src/Pure/Isar/attrib.ML), which process arguments depending both
|
wenzelm@16234
|
581 |
on the context and the facts involved -- may have to assign parsed
|
wenzelm@16234
|
582 |
values to argument tokens explicitly.
|
wenzelm@16234
|
583 |
|
wenzelm@16234
|
584 |
* Changed parameter management in theorem generation for long goal
|
wenzelm@16234
|
585 |
statements with 'includes'. INCOMPATIBILITY: produces a different
|
wenzelm@16234
|
586 |
theorem statement in rare situations.
|
wenzelm@16234
|
587 |
|
ballarin@17228
|
588 |
* Locale inspection command 'print_locale' omits notes elements. Use
|
ballarin@17228
|
589 |
'print_locale!' to have them included in the output.
|
ballarin@17228
|
590 |
|
wenzelm@16234
|
591 |
|
wenzelm@16234
|
592 |
*** Provers ***
|
wenzelm@16234
|
593 |
|
wenzelm@16234
|
594 |
* Provers/hypsubst.ML: improved version of the subst method, for
|
wenzelm@16234
|
595 |
single-step rewriting: it now works in bound variable contexts. New is
|
wenzelm@16234
|
596 |
'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
|
wenzelm@16234
|
597 |
rewrite a different subterm than the original subst method, which is
|
wenzelm@16234
|
598 |
still available as 'simplesubst'.
|
berghofe@15475
|
599 |
|
wenzelm@16013
|
600 |
* Provers/quasi.ML: new transitivity reasoners for transitivity only
|
wenzelm@16234
|
601 |
and quasi orders.
|
ballarin@15103
|
602 |
|
wenzelm@16013
|
603 |
* Provers/trancl.ML: new transitivity reasoner for transitive and
|
wenzelm@16234
|
604 |
reflexive-transitive closure of relations.
|
ballarin@15076
|
605 |
|
wenzelm@16013
|
606 |
* Provers/blast.ML: new reference depth_limit to make blast's depth
|
wenzelm@16234
|
607 |
limit (previously hard-coded with a value of 20) user-definable.
|
wenzelm@15801
|
608 |
|
wenzelm@16013
|
609 |
* Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
|
wenzelm@16234
|
610 |
is peformed already. Object-logics merely need to finish their
|
wenzelm@16234
|
611 |
initial simpset configuration as before. INCOMPATIBILITY.
|
berghofe@15436
|
612 |
|
wenzelm@15703
|
613 |
|
wenzelm@15703
|
614 |
*** HOL ***
|
wenzelm@15703
|
615 |
|
wenzelm@16234
|
616 |
* Symbolic syntax of Hilbert Choice Operator is now as follows:
|
wenzelm@15703
|
617 |
|
wenzelm@15703
|
618 |
syntax (epsilon)
|
wenzelm@15703
|
619 |
"_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
|
wenzelm@15703
|
620 |
|
wenzelm@16234
|
621 |
The symbol \<some> is displayed as the alternative epsilon of LaTeX
|
wenzelm@16234
|
622 |
and x-symbol; use option '-m epsilon' to get it actually printed.
|
wenzelm@16234
|
623 |
Moreover, the mathematically important symbolic identifier \<epsilon>
|
wenzelm@16234
|
624 |
becomes available as variable, constant etc. INCOMPATIBILITY,
|
wenzelm@16234
|
625 |
|
wenzelm@16234
|
626 |
* "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
|
wenzelm@16234
|
627 |
Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
|
wenzelm@17371
|
628 |
is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
|
avigad@17016
|
629 |
support corresponding Isar calculations.
|
wenzelm@16234
|
630 |
|
wenzelm@16234
|
631 |
* "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
|
wenzelm@16234
|
632 |
instead of ":".
|
wenzelm@16234
|
633 |
|
wenzelm@16234
|
634 |
* theory SetInterval: changed the syntax for open intervals:
|
wenzelm@16234
|
635 |
|
wenzelm@16234
|
636 |
Old New
|
wenzelm@16234
|
637 |
{..n(} {..<n}
|
wenzelm@16234
|
638 |
{)n..} {n<..}
|
wenzelm@16234
|
639 |
{m..n(} {m..<n}
|
wenzelm@16234
|
640 |
{)m..n} {m<..n}
|
wenzelm@16234
|
641 |
{)m..n(} {m<..<n}
|
wenzelm@16234
|
642 |
|
wenzelm@16234
|
643 |
The old syntax is still supported but will disappear in the next
|
wenzelm@16234
|
644 |
release. For conversion use the following Emacs search and replace
|
wenzelm@16234
|
645 |
patterns (these are not perfect but work quite well):
|
wenzelm@15703
|
646 |
|
wenzelm@15703
|
647 |
{)\([^\.]*\)\.\. -> {\1<\.\.}
|
wenzelm@15703
|
648 |
\.\.\([^(}]*\)(} -> \.\.<\1}
|
wenzelm@15703
|
649 |
|
wenzelm@17533
|
650 |
* Theory Commutative_Ring (in Library): method comm_ring for proving
|
wenzelm@17533
|
651 |
equalities in commutative rings; method 'algebra' provides a generic
|
wenzelm@17533
|
652 |
interface.
|
wenzelm@17389
|
653 |
|
wenzelm@17389
|
654 |
* Theory Finite_Set: changed the syntax for 'setsum', summation over
|
wenzelm@16234
|
655 |
finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
|
wenzelm@17371
|
656 |
now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
|
paulson@17189
|
657 |
be a tuple pattern.
|
wenzelm@16234
|
658 |
|
wenzelm@16234
|
659 |
Some new syntax forms are available:
|
wenzelm@16234
|
660 |
|
wenzelm@16234
|
661 |
"\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
|
wenzelm@16234
|
662 |
"\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
|
wenzelm@16234
|
663 |
"\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
|
wenzelm@16234
|
664 |
"\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
|
wenzelm@16234
|
665 |
|
wenzelm@16234
|
666 |
The latter form "\<Sum>x < k. e" used to be based on a separate
|
wenzelm@16234
|
667 |
function "Summation", which has been discontinued.
|
wenzelm@16234
|
668 |
|
wenzelm@16234
|
669 |
* theory Finite_Set: in structured induction proofs, the insert case
|
wenzelm@16234
|
670 |
is now 'case (insert x F)' instead of the old counterintuitive 'case
|
wenzelm@16234
|
671 |
(insert F x)'.
|
wenzelm@16234
|
672 |
|
wenzelm@16234
|
673 |
* The 'refute' command has been extended to support a much larger
|
wenzelm@16234
|
674 |
fragment of HOL, including axiomatic type classes, constdefs and
|
wenzelm@16234
|
675 |
typedefs, inductive datatypes and recursion.
|
wenzelm@16234
|
676 |
|
webertj@17700
|
677 |
* New tactics 'sat' and 'satx' to prove propositional tautologies.
|
webertj@17700
|
678 |
Requires zChaff with proof generation to be installed. See
|
webertj@17700
|
679 |
HOL/ex/SAT_Examples.thy for examples.
|
webertj@17619
|
680 |
|
wenzelm@16234
|
681 |
* Datatype induction via method 'induct' now preserves the name of the
|
wenzelm@16234
|
682 |
induction variable. For example, when proving P(xs::'a list) by
|
wenzelm@16234
|
683 |
induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
|
wenzelm@16234
|
684 |
than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
|
wenzelm@16234
|
685 |
in unstructured proof scripts.
|
wenzelm@16234
|
686 |
|
wenzelm@16234
|
687 |
* Reworked implementation of records. Improved scalability for
|
wenzelm@16234
|
688 |
records with many fields, avoiding performance problems for type
|
wenzelm@16234
|
689 |
inference. Records are no longer composed of nested field types, but
|
wenzelm@16234
|
690 |
of nested extension types. Therefore the record type only grows linear
|
wenzelm@16234
|
691 |
in the number of extensions and not in the number of fields. The
|
wenzelm@16234
|
692 |
top-level (users) view on records is preserved. Potential
|
wenzelm@16234
|
693 |
INCOMPATIBILITY only in strange cases, where the theory depends on the
|
wenzelm@16234
|
694 |
old record representation. The type generated for a record is called
|
wenzelm@16234
|
695 |
<record_name>_ext_type.
|
wenzelm@16234
|
696 |
|
wenzelm@16234
|
697 |
Flag record_quick_and_dirty_sensitive can be enabled to skip the
|
wenzelm@16234
|
698 |
proofs triggered by a record definition or a simproc (if
|
wenzelm@16234
|
699 |
quick_and_dirty is enabled). Definitions of large records can take
|
wenzelm@16234
|
700 |
quite long.
|
wenzelm@16234
|
701 |
|
wenzelm@16234
|
702 |
New simproc record_upd_simproc for simplification of multiple record
|
wenzelm@16234
|
703 |
updates enabled by default. Moreover, trivial updates are also
|
wenzelm@16234
|
704 |
removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
|
wenzelm@16234
|
705 |
occasionally, since simplification is more powerful by default.
|
wenzelm@16234
|
706 |
|
wenzelm@17275
|
707 |
* typedef: proper support for polymorphic sets, which contain extra
|
wenzelm@17275
|
708 |
type-variables in the term.
|
wenzelm@17275
|
709 |
|
wenzelm@16234
|
710 |
* Simplifier: automatically reasons about transitivity chains
|
wenzelm@16234
|
711 |
involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
|
wenzelm@16234
|
712 |
provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
|
wenzelm@16234
|
713 |
old proofs break occasionally as simplification may now solve more
|
wenzelm@16234
|
714 |
goals than previously.
|
wenzelm@16234
|
715 |
|
wenzelm@16234
|
716 |
* Simplifier: converts x <= y into x = y if assumption y <= x is
|
wenzelm@16234
|
717 |
present. Works for all partial orders (class "order"), in particular
|
wenzelm@16234
|
718 |
numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
|
wenzelm@16234
|
719 |
just like y <= x.
|
wenzelm@16234
|
720 |
|
wenzelm@16234
|
721 |
* Simplifier: new simproc for "let x = a in f x". If a is a free or
|
wenzelm@16234
|
722 |
bound variable or a constant then the let is unfolded. Otherwise
|
wenzelm@16234
|
723 |
first a is simplified to b, and then f b is simplified to g. If
|
wenzelm@16234
|
724 |
possible we abstract b from g arriving at "let x = b in h x",
|
wenzelm@16234
|
725 |
otherwise we unfold the let and arrive at g. The simproc can be
|
wenzelm@16234
|
726 |
enabled/disabled by the reference use_let_simproc. Potential
|
wenzelm@16234
|
727 |
INCOMPATIBILITY since simplification is more powerful by default.
|
webertj@15776
|
728 |
|
paulson@16563
|
729 |
* Classical reasoning: the meson method now accepts theorems as arguments.
|
paulson@16563
|
730 |
|
paulson@17595
|
731 |
* Prover support: pre-release of the Isabelle-ATP linkup, which runs background
|
paulson@17595
|
732 |
jobs to provide advice on the provability of subgoals.
|
paulson@17595
|
733 |
|
wenzelm@16891
|
734 |
* Theory OrderedGroup and Ring_and_Field: various additions and
|
wenzelm@16891
|
735 |
improvements to faciliate calculations involving equalities and
|
wenzelm@16891
|
736 |
inequalities.
|
wenzelm@16891
|
737 |
|
wenzelm@16891
|
738 |
The following theorems have been eliminated or modified
|
wenzelm@16891
|
739 |
(INCOMPATIBILITY):
|
avigad@16888
|
740 |
|
avigad@16888
|
741 |
abs_eq now named abs_of_nonneg
|
wenzelm@17371
|
742 |
abs_of_ge_0 now named abs_of_nonneg
|
wenzelm@17371
|
743 |
abs_minus_eq now named abs_of_nonpos
|
avigad@16888
|
744 |
imp_abs_id now named abs_of_nonneg
|
avigad@16888
|
745 |
imp_abs_neg_id now named abs_of_nonpos
|
avigad@16888
|
746 |
mult_pos now named mult_pos_pos
|
avigad@16888
|
747 |
mult_pos_le now named mult_nonneg_nonneg
|
avigad@16888
|
748 |
mult_pos_neg_le now named mult_nonneg_nonpos
|
avigad@16888
|
749 |
mult_pos_neg2_le now named mult_nonneg_nonpos2
|
avigad@16888
|
750 |
mult_neg now named mult_neg_neg
|
avigad@16888
|
751 |
mult_neg_le now named mult_nonpos_nonpos
|
avigad@16888
|
752 |
|
wenzelm@16891
|
753 |
* Theory Parity: added rules for simplifying exponents.
|
wenzelm@16891
|
754 |
|
nipkow@17092
|
755 |
* Theory List:
|
nipkow@17092
|
756 |
|
nipkow@17092
|
757 |
The following theorems have been eliminated or modified
|
nipkow@17092
|
758 |
(INCOMPATIBILITY):
|
nipkow@17092
|
759 |
|
nipkow@17092
|
760 |
list_all_Nil now named list_all.simps(1)
|
nipkow@17092
|
761 |
list_all_Cons now named list_all.simps(2)
|
nipkow@17092
|
762 |
list_all_conv now named list_all_iff
|
nipkow@17092
|
763 |
set_mem_eq now named mem_iff
|
nipkow@17092
|
764 |
|
wenzelm@16929
|
765 |
* Theories SetsAndFunctions and BigO (see HOL/Library) support
|
wenzelm@16929
|
766 |
asymptotic "big O" calculations. See the notes in BigO.thy.
|
wenzelm@16929
|
767 |
|
avigad@16888
|
768 |
|
avigad@16888
|
769 |
*** HOL-Complex ***
|
avigad@16888
|
770 |
|
wenzelm@16891
|
771 |
* Theory RealDef: better support for embedding natural numbers and
|
wenzelm@16891
|
772 |
integers in the reals.
|
wenzelm@16891
|
773 |
|
wenzelm@16891
|
774 |
The following theorems have been eliminated or modified
|
wenzelm@16891
|
775 |
(INCOMPATIBILITY):
|
wenzelm@16891
|
776 |
|
avigad@17016
|
777 |
exp_ge_add_one_self now requires no hypotheses
|
avigad@17016
|
778 |
real_of_int_add reversed direction of equality (use [symmetric])
|
avigad@17016
|
779 |
real_of_int_minus reversed direction of equality (use [symmetric])
|
avigad@17016
|
780 |
real_of_int_diff reversed direction of equality (use [symmetric])
|
avigad@17016
|
781 |
real_of_int_mult reversed direction of equality (use [symmetric])
|
wenzelm@16891
|
782 |
|
wenzelm@16891
|
783 |
* Theory RComplete: expanded support for floor and ceiling functions.
|
avigad@16888
|
784 |
|
avigad@16962
|
785 |
* Theory Ln is new, with properties of the natural logarithm
|
avigad@16962
|
786 |
|
wenzelm@17423
|
787 |
* Hyperreal: There is a new type constructor "star" for making
|
wenzelm@17423
|
788 |
nonstandard types. The old type names are now type synonyms:
|
wenzelm@17423
|
789 |
|
wenzelm@17423
|
790 |
hypreal = real star
|
wenzelm@17423
|
791 |
hypnat = nat star
|
wenzelm@17423
|
792 |
hcomplex = complex star
|
wenzelm@17423
|
793 |
|
wenzelm@17423
|
794 |
* Hyperreal: Many groups of similarly-defined constants have been
|
huffman@17442
|
795 |
replaced by polymorphic versions (INCOMPATIBILITY):
|
wenzelm@17423
|
796 |
|
wenzelm@17423
|
797 |
star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
|
wenzelm@17423
|
798 |
|
wenzelm@17423
|
799 |
starset <-- starsetNat, starsetC
|
wenzelm@17423
|
800 |
*s* <-- *sNat*, *sc*
|
wenzelm@17423
|
801 |
starset_n <-- starsetNat_n, starsetC_n
|
wenzelm@17423
|
802 |
*sn* <-- *sNatn*, *scn*
|
wenzelm@17423
|
803 |
InternalSets <-- InternalNatSets, InternalCSets
|
wenzelm@17423
|
804 |
|
huffman@17442
|
805 |
starfun <-- starfun{Nat,Nat2,C,RC,CR}
|
wenzelm@17423
|
806 |
*f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
|
huffman@17442
|
807 |
starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
|
wenzelm@17423
|
808 |
*fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
|
huffman@17442
|
809 |
InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
|
wenzelm@17423
|
810 |
|
wenzelm@17423
|
811 |
* Hyperreal: Many type-specific theorems have been removed in favor of
|
huffman@17442
|
812 |
theorems specific to various axiomatic type classes (INCOMPATIBILITY):
|
huffman@17442
|
813 |
|
huffman@17442
|
814 |
add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
|
huffman@17442
|
815 |
add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
|
huffman@17442
|
816 |
OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
|
huffman@17442
|
817 |
OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
|
wenzelm@17423
|
818 |
right_minus <-- hypreal_add_minus
|
huffman@17442
|
819 |
left_minus <-- {hypreal,hcomplex}_add_minus_left
|
huffman@17442
|
820 |
mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
|
huffman@17442
|
821 |
mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
|
huffman@17442
|
822 |
mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
|
wenzelm@17423
|
823 |
mult_1_right <-- hcomplex_mult_one_right
|
wenzelm@17423
|
824 |
mult_zero_left <-- hcomplex_mult_zero_left
|
huffman@17442
|
825 |
left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
|
wenzelm@17423
|
826 |
right_distrib <-- hypnat_add_mult_distrib2
|
huffman@17442
|
827 |
zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
|
wenzelm@17423
|
828 |
right_inverse <-- hypreal_mult_inverse
|
wenzelm@17423
|
829 |
left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
|
huffman@17442
|
830 |
order_refl <-- {hypreal,hypnat}_le_refl
|
huffman@17442
|
831 |
order_trans <-- {hypreal,hypnat}_le_trans
|
huffman@17442
|
832 |
order_antisym <-- {hypreal,hypnat}_le_anti_sym
|
huffman@17442
|
833 |
order_less_le <-- {hypreal,hypnat}_less_le
|
huffman@17442
|
834 |
linorder_linear <-- {hypreal,hypnat}_le_linear
|
huffman@17442
|
835 |
add_left_mono <-- {hypreal,hypnat}_add_left_mono
|
huffman@17442
|
836 |
mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
|
wenzelm@17423
|
837 |
add_nonneg_nonneg <-- hypreal_le_add_order
|
wenzelm@17423
|
838 |
|
wenzelm@17423
|
839 |
* Hyperreal: Separate theorems having to do with type-specific
|
wenzelm@17423
|
840 |
versions of constants have been merged into theorems that apply to the
|
huffman@17442
|
841 |
new polymorphic constants (INCOMPATIBILITY):
|
huffman@17442
|
842 |
|
huffman@17442
|
843 |
STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
|
huffman@17442
|
844 |
STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
|
huffman@17442
|
845 |
STAR_Un <-- {STAR,NatStar,STARC}_Un
|
huffman@17442
|
846 |
STAR_Int <-- {STAR,NatStar,STARC}_Int
|
huffman@17442
|
847 |
STAR_Compl <-- {STAR,NatStar,STARC}_Compl
|
huffman@17442
|
848 |
STAR_subset <-- {STAR,NatStar,STARC}_subset
|
huffman@17442
|
849 |
STAR_mem <-- {STAR,NatStar,STARC}_mem
|
huffman@17442
|
850 |
STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
|
huffman@17442
|
851 |
STAR_diff <-- {STAR,STARC}_diff
|
huffman@17442
|
852 |
STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
|
huffman@17442
|
853 |
STARC_hcomplex_of_complex}_image_subset
|
huffman@17442
|
854 |
starset_n_Un <-- starset{Nat,C}_n_Un
|
huffman@17442
|
855 |
starset_n_Int <-- starset{Nat,C}_n_Int
|
huffman@17442
|
856 |
starset_n_Compl <-- starset{Nat,C}_n_Compl
|
huffman@17442
|
857 |
starset_n_diff <-- starset{Nat,C}_n_diff
|
huffman@17442
|
858 |
InternalSets_Un <-- Internal{Nat,C}Sets_Un
|
huffman@17442
|
859 |
InternalSets_Int <-- Internal{Nat,C}Sets_Int
|
huffman@17442
|
860 |
InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
|
huffman@17442
|
861 |
InternalSets_diff <-- Internal{Nat,C}Sets_diff
|
huffman@17442
|
862 |
InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
|
huffman@17442
|
863 |
InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
|
huffman@17442
|
864 |
starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
|
huffman@17442
|
865 |
starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
|
huffman@17442
|
866 |
starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
|
huffman@17442
|
867 |
starfun <-- starfun{Nat,Nat2,C,RC,CR}
|
huffman@17442
|
868 |
starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
|
huffman@17442
|
869 |
starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
|
huffman@17442
|
870 |
starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
|
huffman@17442
|
871 |
starfun_diff <-- starfun{C,RC,CR}_diff
|
huffman@17442
|
872 |
starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
|
huffman@17442
|
873 |
starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
|
huffman@17442
|
874 |
starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
|
huffman@17442
|
875 |
starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
|
huffman@17442
|
876 |
starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
|
huffman@17442
|
877 |
starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
|
wenzelm@17423
|
878 |
starfun_Id <-- starfunC_Id
|
huffman@17442
|
879 |
starfun_approx <-- starfun{Nat,CR}_approx
|
huffman@17442
|
880 |
starfun_capprox <-- starfun{C,RC}_capprox
|
wenzelm@17423
|
881 |
starfun_abs <-- starfunNat_rabs
|
huffman@17442
|
882 |
starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
|
huffman@17442
|
883 |
starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
|
wenzelm@17423
|
884 |
starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
|
huffman@17442
|
885 |
starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
|
huffman@17442
|
886 |
starfun_add_capprox <-- starfun{C,RC}_add_capprox
|
wenzelm@17423
|
887 |
starfun_add_approx <-- starfunCR_add_approx
|
wenzelm@17423
|
888 |
starfun_inverse_inverse <-- starfunC_inverse_inverse
|
huffman@17442
|
889 |
starfun_divide <-- starfun{C,CR,RC}_divide
|
huffman@17442
|
890 |
starfun_n <-- starfun{Nat,C}_n
|
huffman@17442
|
891 |
starfun_n_mult <-- starfun{Nat,C}_n_mult
|
huffman@17442
|
892 |
starfun_n_add <-- starfun{Nat,C}_n_add
|
wenzelm@17423
|
893 |
starfun_n_add_minus <-- starfunNat_n_add_minus
|
huffman@17442
|
894 |
starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
|
huffman@17442
|
895 |
starfun_n_minus <-- starfun{Nat,C}_n_minus
|
huffman@17442
|
896 |
starfun_n_eq <-- starfun{Nat,C}_n_eq
|
huffman@17442
|
897 |
|
huffman@17442
|
898 |
star_n_add <-- {hypreal,hypnat,hcomplex}_add
|
huffman@17442
|
899 |
star_n_minus <-- {hypreal,hcomplex}_minus
|
huffman@17442
|
900 |
star_n_diff <-- {hypreal,hcomplex}_diff
|
huffman@17442
|
901 |
star_n_mult <-- {hypreal,hcomplex}_mult
|
huffman@17442
|
902 |
star_n_inverse <-- {hypreal,hcomplex}_inverse
|
huffman@17442
|
903 |
star_n_le <-- {hypreal,hypnat}_le
|
huffman@17442
|
904 |
star_n_less <-- {hypreal,hypnat}_less
|
huffman@17442
|
905 |
star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
|
huffman@17442
|
906 |
star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
|
wenzelm@17423
|
907 |
star_n_abs <-- hypreal_hrabs
|
wenzelm@17423
|
908 |
star_n_divide <-- hcomplex_divide
|
wenzelm@17423
|
909 |
|
huffman@17442
|
910 |
star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
|
huffman@17442
|
911 |
star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
|
wenzelm@17423
|
912 |
star_of_diff <-- hypreal_of_real_diff
|
huffman@17442
|
913 |
star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
|
huffman@17442
|
914 |
star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
|
huffman@17442
|
915 |
star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
|
huffman@17442
|
916 |
star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
|
huffman@17442
|
917 |
star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
|
huffman@17442
|
918 |
star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
|
huffman@17442
|
919 |
star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
|
huffman@17442
|
920 |
star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
|
huffman@17442
|
921 |
star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
|
huffman@17442
|
922 |
star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
|
huffman@17442
|
923 |
star_of_number_of <-- {hypreal,hcomplex}_number_of
|
wenzelm@17423
|
924 |
star_of_number_less <-- number_of_less_hypreal_of_real_iff
|
wenzelm@17423
|
925 |
star_of_number_le <-- number_of_le_hypreal_of_real_iff
|
wenzelm@17423
|
926 |
star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
|
wenzelm@17423
|
927 |
star_of_less_number <-- hypreal_of_real_less_number_of_iff
|
wenzelm@17423
|
928 |
star_of_le_number <-- hypreal_of_real_le_number_of_iff
|
wenzelm@17423
|
929 |
star_of_power <-- hypreal_of_real_power
|
wenzelm@17423
|
930 |
star_of_eq_0 <-- hcomplex_of_complex_zero_iff
|
wenzelm@17423
|
931 |
|
huffman@17442
|
932 |
* Hyperreal: new method "transfer" that implements the transfer
|
huffman@17442
|
933 |
principle of nonstandard analysis. With a subgoal that mentions
|
huffman@17442
|
934 |
nonstandard types like "'a star", the command "apply transfer"
|
huffman@17442
|
935 |
replaces it with an equivalent one that mentions only standard types.
|
huffman@17442
|
936 |
To be successful, all free variables must have standard types; non-
|
huffman@17442
|
937 |
standard variables must have explicit universal quantifiers.
|
huffman@17442
|
938 |
|
wenzelm@17641
|
939 |
* Hyperreal: A theory of Taylor series.
|
wenzelm@17641
|
940 |
|
wenzelm@15703
|
941 |
|
wenzelm@15703
|
942 |
*** HOLCF ***
|
wenzelm@15703
|
943 |
|
wenzelm@17533
|
944 |
* Discontinued special version of 'constdefs' (which used to support
|
wenzelm@17533
|
945 |
continuous functions) in favor of the general Pure one with full
|
wenzelm@17533
|
946 |
type-inference.
|
wenzelm@17533
|
947 |
|
wenzelm@17533
|
948 |
* New simplification procedure for solving continuity conditions; it
|
wenzelm@17533
|
949 |
is much faster on terms with many nested lambda abstractions (cubic
|
huffman@17442
|
950 |
instead of exponential time).
|
huffman@17442
|
951 |
|
wenzelm@17533
|
952 |
* New syntax for domain package: selector names are now optional.
|
huffman@17442
|
953 |
Parentheses should be omitted unless argument is lazy, for example:
|
huffman@17442
|
954 |
|
huffman@17442
|
955 |
domain 'a stream = cons "'a" (lazy "'a stream")
|
huffman@17442
|
956 |
|
wenzelm@17533
|
957 |
* New command 'fixrec' for defining recursive functions with pattern
|
wenzelm@17533
|
958 |
matching; defining multiple functions with mutual recursion is also
|
wenzelm@17533
|
959 |
supported. Patterns may include the constants cpair, spair, up, sinl,
|
wenzelm@17533
|
960 |
sinr, or any data constructor defined by the domain package. The given
|
wenzelm@17533
|
961 |
equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
|
wenzelm@17533
|
962 |
syntax and examples.
|
wenzelm@17533
|
963 |
|
wenzelm@17533
|
964 |
* New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
|
wenzelm@17533
|
965 |
of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
|
wenzelm@17533
|
966 |
but the proof obligation additionally includes an admissibility
|
wenzelm@17533
|
967 |
requirement. The packages generate instances of class cpo or pcpo,
|
wenzelm@17533
|
968 |
with continuity and strictness theorems for Rep and Abs.
|
huffman@17442
|
969 |
|
huffman@17584
|
970 |
* HOLCF: Many theorems have been renamed according to a more standard naming
|
huffman@17584
|
971 |
scheme (INCOMPATIBILITY):
|
huffman@17584
|
972 |
|
huffman@17584
|
973 |
foo_inject: "foo$x = foo$y ==> x = y"
|
huffman@17584
|
974 |
foo_eq: "(foo$x = foo$y) = (x = y)"
|
huffman@17584
|
975 |
foo_less: "(foo$x << foo$y) = (x << y)"
|
huffman@17584
|
976 |
foo_strict: "foo$UU = UU"
|
huffman@17584
|
977 |
foo_defined: "... ==> foo$x ~= UU"
|
huffman@17584
|
978 |
foo_defined_iff: "(foo$x = UU) = (x = UU)"
|
huffman@17584
|
979 |
|
wenzelm@15703
|
980 |
|
wenzelm@15703
|
981 |
*** ZF ***
|
wenzelm@15703
|
982 |
|
wenzelm@16234
|
983 |
* ZF/ex: theories Group and Ring provide examples in abstract algebra,
|
wenzelm@16234
|
984 |
including the First Isomorphism Theorem (on quotienting by the kernel
|
wenzelm@16234
|
985 |
of a homomorphism).
|
wenzelm@15703
|
986 |
|
wenzelm@15703
|
987 |
* ZF/Simplifier: install second copy of type solver that actually
|
wenzelm@16234
|
988 |
makes use of TC rules declared to Isar proof contexts (or locales);
|
wenzelm@16234
|
989 |
the old version is still required for ML proof scripts.
|
wenzelm@15703
|
990 |
|
wenzelm@15703
|
991 |
|
wenzelm@17445
|
992 |
*** Cube ***
|
wenzelm@17445
|
993 |
|
wenzelm@17445
|
994 |
* Converted to Isar theory format; use locales instead of axiomatic
|
wenzelm@17445
|
995 |
theories.
|
wenzelm@17445
|
996 |
|
wenzelm@17445
|
997 |
|
wenzelm@15703
|
998 |
*** ML ***
|
wenzelm@15703
|
999 |
|
wenzelm@15973
|
1000 |
* Pure/library.ML no longer defines its own option datatype, but uses
|
wenzelm@16234
|
1001 |
that of the SML basis, which has constructors NONE and SOME instead of
|
wenzelm@16234
|
1002 |
None and Some, as well as exception Option.Option instead of OPTION.
|
wenzelm@16234
|
1003 |
The functions the, if_none, is_some, is_none have been adapted
|
wenzelm@16234
|
1004 |
accordingly, while Option.map replaces apsome.
|
wenzelm@15973
|
1005 |
|
wenzelm@16860
|
1006 |
* Pure/library.ML: the exception LIST has been given up in favour of
|
wenzelm@16860
|
1007 |
the standard exceptions Empty and Subscript, as well as
|
wenzelm@16860
|
1008 |
Library.UnequalLengths. Function like Library.hd and Library.tl are
|
wenzelm@16860
|
1009 |
superceded by the standard hd and tl functions etc.
|
wenzelm@16860
|
1010 |
|
wenzelm@16860
|
1011 |
A number of basic list functions are no longer exported to the ML
|
wenzelm@16860
|
1012 |
toplevel, as they are variants of predefined functions. The following
|
wenzelm@16234
|
1013 |
suggests how one can translate existing code:
|
wenzelm@15973
|
1014 |
|
wenzelm@15973
|
1015 |
rev_append xs ys = List.revAppend (xs, ys)
|
wenzelm@15973
|
1016 |
nth_elem (i, xs) = List.nth (xs, i)
|
wenzelm@15973
|
1017 |
last_elem xs = List.last xs
|
wenzelm@15973
|
1018 |
flat xss = List.concat xss
|
wenzelm@16234
|
1019 |
seq fs = List.app fs
|
wenzelm@15973
|
1020 |
partition P xs = List.partition P xs
|
wenzelm@15973
|
1021 |
mapfilter f xs = List.mapPartial f xs
|
wenzelm@15973
|
1022 |
|
wenzelm@16860
|
1023 |
* Pure/library.ML: several combinators for linear functional
|
wenzelm@16860
|
1024 |
transformations, notably reverse application and composition:
|
wenzelm@16860
|
1025 |
|
wenzelm@17371
|
1026 |
x |> f f #> g
|
wenzelm@17371
|
1027 |
(x, y) |-> f f #-> g
|
wenzelm@16860
|
1028 |
|
haftmann@17495
|
1029 |
* Pure/library.ML: introduced/changed precedence of infix operators:
|
haftmann@17495
|
1030 |
|
haftmann@17495
|
1031 |
infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
|
haftmann@17495
|
1032 |
infix 2 ?;
|
haftmann@17495
|
1033 |
infix 3 o oo ooo oooo;
|
haftmann@17495
|
1034 |
infix 4 ~~ upto downto;
|
haftmann@17495
|
1035 |
|
haftmann@17495
|
1036 |
Maybe INCOMPATIBILITY when any of those is used in conjunction with other
|
haftmann@17495
|
1037 |
infix operators.
|
haftmann@17495
|
1038 |
|
wenzelm@17408
|
1039 |
* Pure/library.ML: natural list combinators fold, fold_rev, and
|
haftmann@16869
|
1040 |
fold_map support linear functional transformations and nesting. For
|
wenzelm@16860
|
1041 |
example:
|
wenzelm@16860
|
1042 |
|
wenzelm@16860
|
1043 |
fold f [x1, ..., xN] y =
|
wenzelm@16860
|
1044 |
y |> f x1 |> ... |> f xN
|
wenzelm@16860
|
1045 |
|
wenzelm@16860
|
1046 |
(fold o fold) f [xs1, ..., xsN] y =
|
wenzelm@16860
|
1047 |
y |> fold f xs1 |> ... |> fold f xsN
|
wenzelm@16860
|
1048 |
|
wenzelm@16860
|
1049 |
fold f [x1, ..., xN] =
|
wenzelm@16860
|
1050 |
f x1 #> ... #> f xN
|
wenzelm@16860
|
1051 |
|
wenzelm@16860
|
1052 |
(fold o fold) f [xs1, ..., xsN] =
|
wenzelm@16860
|
1053 |
fold f xs1 #> ... #> fold f xsN
|
wenzelm@16860
|
1054 |
|
wenzelm@17408
|
1055 |
* Pure/library.ML: the following selectors on type 'a option are
|
wenzelm@17408
|
1056 |
available:
|
wenzelm@17408
|
1057 |
|
wenzelm@17408
|
1058 |
the: 'a option -> 'a (*partial*)
|
wenzelm@17408
|
1059 |
these: 'a option -> 'a where 'a = 'b list
|
haftmann@17402
|
1060 |
the_default: 'a -> 'a option -> 'a
|
haftmann@17402
|
1061 |
the_list: 'a option -> 'a list
|
haftmann@17402
|
1062 |
|
wenzelm@17408
|
1063 |
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides
|
wenzelm@17408
|
1064 |
basic operations for association lists, following natural argument
|
haftmann@17564
|
1065 |
order; moreover the explicit equality predicate passed here avoids
|
haftmann@17495
|
1066 |
potentially expensive polymorphic runtime equality checks.
|
haftmann@17495
|
1067 |
The old functions may be expressed as follows:
|
wenzelm@17408
|
1068 |
|
wenzelm@17408
|
1069 |
assoc = uncurry (AList.lookup (op =))
|
wenzelm@17408
|
1070 |
assocs = these oo AList.lookup (op =)
|
wenzelm@17408
|
1071 |
overwrite = uncurry (AList.update (op =)) o swap
|
wenzelm@17408
|
1072 |
|
haftmann@17564
|
1073 |
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides
|
haftmann@17564
|
1074 |
|
haftmann@17564
|
1075 |
val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
|
haftmann@17564
|
1076 |
val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
|
haftmann@17564
|
1077 |
|
haftmann@17564
|
1078 |
replacing make_keylist and keyfilter (occassionally used)
|
haftmann@17564
|
1079 |
Naive rewrites:
|
haftmann@17564
|
1080 |
|
haftmann@17564
|
1081 |
make_keylist = AList.make
|
haftmann@17564
|
1082 |
keyfilter = AList.find (op =)
|
haftmann@17564
|
1083 |
|
haftmann@17564
|
1084 |
* eq_fst and eq_snd now take explicit equality parameter, thus
|
haftmann@17564
|
1085 |
avoiding eqtypes. Naive rewrites:
|
haftmann@17564
|
1086 |
|
haftmann@17564
|
1087 |
eq_fst = eq_fst (op =)
|
haftmann@17564
|
1088 |
eq_snd = eq_snd (op =)
|
haftmann@17564
|
1089 |
|
haftmann@17564
|
1090 |
* Removed deprecated apl and apr (rarely used).
|
haftmann@17564
|
1091 |
Naive rewrites:
|
haftmann@17564
|
1092 |
|
haftmann@17564
|
1093 |
apl (n, op) =>>= curry op n
|
haftmann@17564
|
1094 |
apr (op, m) =>>= fn n => op (n, m)
|
haftmann@17564
|
1095 |
|
wenzelm@17408
|
1096 |
* Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
|
wenzelm@17408
|
1097 |
provides a reasonably efficient light-weight implementation of sets as
|
wenzelm@17408
|
1098 |
lists.
|
wenzelm@17408
|
1099 |
|
wenzelm@17408
|
1100 |
* Pure/General: generic tables (cf. Pure/General/table.ML) provide a
|
wenzelm@17408
|
1101 |
few new operations; existing lookup and update are now curried to
|
wenzelm@17408
|
1102 |
follow natural argument order (for use with fold etc.);
|
wenzelm@17408
|
1103 |
INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
|
wenzelm@17408
|
1104 |
|
wenzelm@17408
|
1105 |
* Pure/General: output via the Isabelle channels of
|
wenzelm@17408
|
1106 |
writeln/warning/error etc. is now passed through Output.output, with a
|
wenzelm@17408
|
1107 |
hook for arbitrary transformations depending on the print_mode
|
wenzelm@17408
|
1108 |
(cf. Output.add_mode -- the first active mode that provides a output
|
wenzelm@17408
|
1109 |
function wins). Already formatted output may be embedded into further
|
wenzelm@17408
|
1110 |
text via Output.raw; the result of Pretty.string_of/str_of and derived
|
wenzelm@17408
|
1111 |
functions (string_of_term/cterm/thm etc.) is already marked raw to
|
wenzelm@17408
|
1112 |
accommodate easy composition of diagnostic messages etc. Programmers
|
wenzelm@17408
|
1113 |
rarely need to care about Output.output or Output.raw at all, with
|
wenzelm@17408
|
1114 |
some notable exceptions: Output.output is required when bypassing the
|
wenzelm@17408
|
1115 |
standard channels (writeln etc.), or in token translations to produce
|
wenzelm@17408
|
1116 |
properly formatted results; Output.raw is required when capturing
|
wenzelm@17408
|
1117 |
already output material that will eventually be presented to the user
|
wenzelm@17408
|
1118 |
a second time. For the default print mode, both Output.output and
|
wenzelm@17408
|
1119 |
Output.raw have no effect.
|
wenzelm@17408
|
1120 |
|
wenzelm@17408
|
1121 |
* Pure/General: Output.time_accumulator NAME creates an operator ('a
|
wenzelm@17408
|
1122 |
-> 'b) -> 'a -> 'b to measure runtime and count invocations; the
|
wenzelm@17408
|
1123 |
cumulative results are displayed at the end of a batch session.
|
wenzelm@17408
|
1124 |
|
wenzelm@17408
|
1125 |
* Pure/General: File.sysify_path and File.quote_sysify path have been
|
wenzelm@17408
|
1126 |
replaced by File.platform_path and File.shell_path (with appropriate
|
wenzelm@17408
|
1127 |
hooks). This provides a clean interface for unusual systems where the
|
wenzelm@17408
|
1128 |
internal and external process view of file names are different.
|
wenzelm@17408
|
1129 |
|
wenzelm@16689
|
1130 |
* Pure: more efficient orders for basic syntactic entities: added
|
wenzelm@16689
|
1131 |
fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
|
wenzelm@16689
|
1132 |
and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
|
wenzelm@16689
|
1133 |
NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
|
wenzelm@16689
|
1134 |
orders now -- potential INCOMPATIBILITY for code that depends on a
|
wenzelm@16689
|
1135 |
particular order for Symtab.keys, Symtab.dest, etc. (consider using
|
wenzelm@16689
|
1136 |
Library.sort_strings on result).
|
wenzelm@16689
|
1137 |
|
wenzelm@17408
|
1138 |
* Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
|
wenzelm@17408
|
1139 |
fold_types traverse types/terms from left to right, observing natural
|
wenzelm@17408
|
1140 |
argument order. Supercedes previous foldl_XXX versions, add_frees,
|
wenzelm@17408
|
1141 |
add_vars etc. have been adapted as well: INCOMPATIBILITY.
|
wenzelm@17408
|
1142 |
|
wenzelm@16151
|
1143 |
* Pure: name spaces have been refined, with significant changes of the
|
wenzelm@16234
|
1144 |
internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
|
wenzelm@16234
|
1145 |
to extern(_table). The plain name entry path is superceded by a
|
wenzelm@16234
|
1146 |
general 'naming' context, which also includes the 'policy' to produce
|
wenzelm@16234
|
1147 |
a fully qualified name and external accesses of a fully qualified
|
wenzelm@16234
|
1148 |
name; NameSpace.extend is superceded by context dependent
|
wenzelm@16234
|
1149 |
Sign.declare_name. Several theory and proof context operations modify
|
wenzelm@16234
|
1150 |
the naming context. Especially note Theory.restore_naming and
|
wenzelm@16234
|
1151 |
ProofContext.restore_naming to get back to a sane state; note that
|
wenzelm@16234
|
1152 |
Theory.add_path is no longer sufficient to recover from
|
wenzelm@16234
|
1153 |
Theory.absolute_path in particular.
|
wenzelm@16234
|
1154 |
|
wenzelm@16234
|
1155 |
* Pure: new flags short_names (default false) and unique_names
|
wenzelm@16234
|
1156 |
(default true) for controlling output of qualified names. If
|
wenzelm@16234
|
1157 |
short_names is set, names are printed unqualified. If unique_names is
|
wenzelm@16234
|
1158 |
reset, the name prefix is reduced to the minimum required to achieve
|
wenzelm@16234
|
1159 |
the original result when interning again, even if there is an overlap
|
wenzelm@16234
|
1160 |
with earlier declarations.
|
wenzelm@16151
|
1161 |
|
wenzelm@16456
|
1162 |
* Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
|
wenzelm@16456
|
1163 |
now 'extend', and 'merge' gets an additional Pretty.pp argument
|
wenzelm@16456
|
1164 |
(useful for printing error messages). INCOMPATIBILITY.
|
wenzelm@16456
|
1165 |
|
wenzelm@16456
|
1166 |
* Pure: major reorganization of the theory context. Type Sign.sg and
|
wenzelm@16456
|
1167 |
Theory.theory are now identified, referring to the universal
|
wenzelm@16456
|
1168 |
Context.theory (see Pure/context.ML). Actual signature and theory
|
wenzelm@16456
|
1169 |
content is managed as theory data. The old code and interfaces were
|
wenzelm@16456
|
1170 |
spread over many files and structures; the new arrangement introduces
|
wenzelm@16456
|
1171 |
considerable INCOMPATIBILITY to gain more clarity:
|
wenzelm@16456
|
1172 |
|
wenzelm@16456
|
1173 |
Context -- theory management operations (name, identity, inclusion,
|
wenzelm@16456
|
1174 |
parents, ancestors, merge, etc.), plus generic theory data;
|
wenzelm@16456
|
1175 |
|
wenzelm@16456
|
1176 |
Sign -- logical signature and syntax operations (declaring consts,
|
wenzelm@16456
|
1177 |
types, etc.), plus certify/read for common entities;
|
wenzelm@16456
|
1178 |
|
wenzelm@16456
|
1179 |
Theory -- logical theory operations (stating axioms, definitions,
|
wenzelm@16456
|
1180 |
oracles), plus a copy of logical signature operations (consts,
|
wenzelm@16456
|
1181 |
types, etc.); also a few basic management operations (Theory.copy,
|
wenzelm@16456
|
1182 |
Theory.merge, etc.)
|
wenzelm@16456
|
1183 |
|
wenzelm@16456
|
1184 |
The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
|
wenzelm@16456
|
1185 |
etc.) as well as the sign field in Thm.rep_thm etc. have been retained
|
wenzelm@16456
|
1186 |
for convenience -- they merely return the theory.
|
wenzelm@16456
|
1187 |
|
wenzelm@17193
|
1188 |
* Pure: type Type.tsig is superceded by theory in most interfaces.
|
wenzelm@17193
|
1189 |
|
wenzelm@16547
|
1190 |
* Pure: the Isar proof context type is already defined early in Pure
|
wenzelm@16547
|
1191 |
as Context.proof (note that ProofContext.context and Proof.context are
|
wenzelm@16547
|
1192 |
aliases, where the latter is the preferred name). This enables other
|
wenzelm@16547
|
1193 |
Isabelle components to refer to that type even before Isar is present.
|
wenzelm@16547
|
1194 |
|
wenzelm@16373
|
1195 |
* Pure/sign/theory: discontinued named name spaces (i.e. classK,
|
wenzelm@16373
|
1196 |
typeK, constK, axiomK, oracleK), but provide explicit operations for
|
wenzelm@16373
|
1197 |
any of these kinds. For example, Sign.intern typeK is now
|
wenzelm@16373
|
1198 |
Sign.intern_type, Theory.hide_space Sign.typeK is now
|
wenzelm@16373
|
1199 |
Theory.hide_types. Also note that former
|
wenzelm@16373
|
1200 |
Theory.hide_classes/types/consts are now
|
wenzelm@16373
|
1201 |
Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
|
wenzelm@16373
|
1202 |
internalize their arguments! INCOMPATIBILITY.
|
wenzelm@16373
|
1203 |
|
wenzelm@16506
|
1204 |
* Pure: get_thm interface (of PureThy and ProofContext) expects
|
wenzelm@16506
|
1205 |
datatype thmref (with constructors Name and NameSelection) instead of
|
wenzelm@16506
|
1206 |
plain string -- INCOMPATIBILITY;
|
wenzelm@16506
|
1207 |
|
wenzelm@16151
|
1208 |
* Pure: cases produced by proof methods specify options, where NONE
|
wenzelm@16234
|
1209 |
means to remove case bindings -- INCOMPATIBILITY in
|
wenzelm@16234
|
1210 |
(RAW_)METHOD_CASES.
|
wenzelm@16151
|
1211 |
|
wenzelm@16373
|
1212 |
* Pure: the following operations retrieve axioms or theorems from a
|
wenzelm@16373
|
1213 |
theory node or theory hierarchy, respectively:
|
wenzelm@16373
|
1214 |
|
wenzelm@16373
|
1215 |
Theory.axioms_of: theory -> (string * term) list
|
wenzelm@16373
|
1216 |
Theory.all_axioms_of: theory -> (string * term) list
|
wenzelm@16373
|
1217 |
PureThy.thms_of: theory -> (string * thm) list
|
wenzelm@16373
|
1218 |
PureThy.all_thms_of: theory -> (string * thm) list
|
wenzelm@16373
|
1219 |
|
wenzelm@16718
|
1220 |
* Pure: print_tac now outputs the goal through the trace channel.
|
wenzelm@16718
|
1221 |
|
wenzelm@17408
|
1222 |
* Isar toplevel: improved diagnostics, mostly for Poly/ML only.
|
wenzelm@17408
|
1223 |
Reference Toplevel.debug (default false) controls detailed printing
|
wenzelm@17408
|
1224 |
and tracing of low-level exceptions; Toplevel.profiling (default 0)
|
wenzelm@17408
|
1225 |
controls execution profiling -- set to 1 for time and 2 for space
|
wenzelm@17408
|
1226 |
(both increase the runtime).
|
wenzelm@17408
|
1227 |
|
wenzelm@17408
|
1228 |
* Isar session: The initial use of ROOT.ML is now always timed,
|
wenzelm@17408
|
1229 |
i.e. the log will show the actual process times, in contrast to the
|
wenzelm@17408
|
1230 |
elapsed wall-clock time that the outer shell wrapper produces.
|
wenzelm@17408
|
1231 |
|
wenzelm@17408
|
1232 |
* Simplifier: improved handling of bound variables (nameless
|
wenzelm@16997
|
1233 |
representation, avoid allocating new strings). Simprocs that invoke
|
wenzelm@16997
|
1234 |
the Simplifier recursively should use Simplifier.inherit_bounds to
|
wenzelm@17720
|
1235 |
avoid local name clashes. Failure to do so produces warnings
|
wenzelm@17720
|
1236 |
"Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
|
wenzelm@17720
|
1237 |
for further details.
|
wenzelm@16234
|
1238 |
|
wenzelm@17166
|
1239 |
* ML functions legacy_bindings and use_legacy_bindings produce ML fact
|
wenzelm@17166
|
1240 |
bindings for all theorems stored within a given theory; this may help
|
wenzelm@17166
|
1241 |
in porting non-Isar theories to Isar ones, while keeping ML proof
|
wenzelm@17166
|
1242 |
scripts for the time being.
|
wenzelm@17166
|
1243 |
|
wenzelm@17457
|
1244 |
* ML operator HTML.with_charset specifies the charset begin used for
|
wenzelm@17457
|
1245 |
generated HTML files. For example:
|
wenzelm@17457
|
1246 |
|
wenzelm@17457
|
1247 |
HTML.with_charset "utf-8" use_thy "Hebrew";
|
wenzelm@17538
|
1248 |
HTML.with_charset "utf-8" use_thy "Chinese";
|
wenzelm@17457
|
1249 |
|
wenzelm@16234
|
1250 |
|
wenzelm@16234
|
1251 |
*** System ***
|
wenzelm@16234
|
1252 |
|
wenzelm@16234
|
1253 |
* Allow symlinks to all proper Isabelle executables (Isabelle,
|
wenzelm@16234
|
1254 |
isabelle, isatool etc.).
|
wenzelm@16234
|
1255 |
|
wenzelm@16234
|
1256 |
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for
|
wenzelm@16234
|
1257 |
isatool doc, isatool mkdir, display_drafts etc.).
|
wenzelm@16234
|
1258 |
|
wenzelm@16234
|
1259 |
* isatool usedir: option -f allows specification of the ML file to be
|
wenzelm@16234
|
1260 |
used by Isabelle; default is ROOT.ML.
|
wenzelm@16234
|
1261 |
|
wenzelm@16251
|
1262 |
* New isatool version outputs the version identifier of the Isabelle
|
wenzelm@16251
|
1263 |
distribution being used.
|
wenzelm@16251
|
1264 |
|
wenzelm@16251
|
1265 |
* HOL: new isatool dimacs2hol converts files in DIMACS CNF format
|
wenzelm@16234
|
1266 |
(containing Boolean satisfiability problems) into Isabelle/HOL
|
wenzelm@16234
|
1267 |
theories.
|
paulson@14885
|
1268 |
|
paulson@14885
|
1269 |
|
wenzelm@14655
|
1270 |
|
wenzelm@14606
|
1271 |
New in Isabelle2004 (April 2004)
|
wenzelm@14606
|
1272 |
--------------------------------
|
wenzelm@13280
|
1273 |
|
skalberg@14171
|
1274 |
*** General ***
|
skalberg@14171
|
1275 |
|
ballarin@14398
|
1276 |
* Provers/order.ML: new efficient reasoner for partial and linear orders.
|
ballarin@14398
|
1277 |
Replaces linorder.ML.
|
ballarin@14398
|
1278 |
|
wenzelm@14606
|
1279 |
* Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
|
wenzelm@14606
|
1280 |
(\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
|
skalberg@14173
|
1281 |
(\<a>...\<z>), are now considered normal letters, and can therefore
|
skalberg@14173
|
1282 |
be used anywhere where an ASCII letter (a...zA...Z) has until
|
skalberg@14173
|
1283 |
now. COMPATIBILITY: This obviously changes the parsing of some
|
skalberg@14173
|
1284 |
terms, especially where a symbol has been used as a binder, say
|
skalberg@14173
|
1285 |
'\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
|
skalberg@14173
|
1286 |
as an identifier. Fix it by inserting a space around former
|
skalberg@14173
|
1287 |
symbols. Call 'isatool fixgreek' to try to fix parsing errors in
|
skalberg@14173
|
1288 |
existing theory and ML files.
|
skalberg@14171
|
1289 |
|
paulson@14237
|
1290 |
* Pure: Macintosh and Windows line-breaks are now allowed in theory files.
|
paulson@14237
|
1291 |
|
wenzelm@14731
|
1292 |
* Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
|
wenzelm@14731
|
1293 |
allowed in identifiers. Similar to Greek letters \<^isub> is now considered
|
wenzelm@14731
|
1294 |
a normal (but invisible) letter. For multiple letter subscripts repeat
|
wenzelm@14731
|
1295 |
\<^isub> like this: x\<^isub>1\<^isub>2.
|
kleing@14233
|
1296 |
|
kleing@14333
|
1297 |
* Pure: There are now sub-/superscripts that can span more than one
|
kleing@14333
|
1298 |
character. Text between \<^bsub> and \<^esub> is set in subscript in
|
wenzelm@14606
|
1299 |
ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
|
wenzelm@14606
|
1300 |
superscript. The new control characters are not identifier parts.
|
kleing@14333
|
1301 |
|
schirmer@14561
|
1302 |
* Pure: Control-symbols of the form \<^raw:...> will literally print the
|
wenzelm@14606
|
1303 |
content of "..." to the latex file instead of \isacntrl... . The "..."
|
wenzelm@14606
|
1304 |
may consist of any printable characters excluding the end bracket >.
|
schirmer@14361
|
1305 |
|
paulson@14237
|
1306 |
* Pure: Using new Isar command "finalconsts" (or the ML functions
|
paulson@14237
|
1307 |
Theory.add_finals or Theory.add_finals_i) it is now possible to
|
paulson@14237
|
1308 |
declare constants "final", which prevents their being given a definition
|
paulson@14237
|
1309 |
later. It is useful for constants whose behaviour is fixed axiomatically
|
skalberg@14224
|
1310 |
rather than definitionally, such as the meta-logic connectives.
|
skalberg@14224
|
1311 |
|
wenzelm@14606
|
1312 |
* Pure: 'instance' now handles general arities with general sorts
|
wenzelm@14606
|
1313 |
(i.e. intersections of classes),
|
skalberg@14503
|
1314 |
|
kleing@14547
|
1315 |
* Presentation: generated HTML now uses a CSS style sheet to make layout
|
wenzelm@14731
|
1316 |
(somewhat) independent of content. It is copied from lib/html/isabelle.css.
|
kleing@14547
|
1317 |
It can be changed to alter the colors/layout of generated pages.
|
kleing@14547
|
1318 |
|
wenzelm@14556
|
1319 |
|
ballarin@14175
|
1320 |
*** Isar ***
|
ballarin@14175
|
1321 |
|
ballarin@14508
|
1322 |
* Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
|
ballarin@14508
|
1323 |
cut_tac, subgoal_tac and thin_tac:
|
ballarin@14175
|
1324 |
- Now understand static (Isar) contexts. As a consequence, users of Isar
|
ballarin@14175
|
1325 |
locales are no longer forced to write Isar proof scripts.
|
ballarin@14175
|
1326 |
For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
|
ballarin@14175
|
1327 |
emulations.
|
ballarin@14175
|
1328 |
- INCOMPATIBILITY: names of variables to be instantiated may no
|
ballarin@14211
|
1329 |
longer be enclosed in quotes. Instead, precede variable name with `?'.
|
ballarin@14211
|
1330 |
This is consistent with the instantiation attribute "where".
|
ballarin@14211
|
1331 |
|
ballarin@14257
|
1332 |
* Attributes "where" and "of":
|
ballarin@14285
|
1333 |
- Now take type variables of instantiated theorem into account when reading
|
ballarin@14285
|
1334 |
the instantiation string. This fixes a bug that caused instantiated
|
ballarin@14285
|
1335 |
theorems to have too special types in some circumstances.
|
ballarin@14285
|
1336 |
- "where" permits explicit instantiations of type variables.
|
ballarin@14257
|
1337 |
|
wenzelm@14556
|
1338 |
* Calculation commands "moreover" and "also" no longer interfere with
|
wenzelm@14556
|
1339 |
current facts ("this"), admitting arbitrary combinations with "then"
|
wenzelm@14556
|
1340 |
and derived forms.
|
kleing@14283
|
1341 |
|
ballarin@14211
|
1342 |
* Locales:
|
ballarin@14211
|
1343 |
- Goal statements involving the context element "includes" no longer
|
ballarin@14211
|
1344 |
generate theorems with internal delta predicates (those ending on
|
ballarin@14211
|
1345 |
"_axioms") in the premise.
|
ballarin@14211
|
1346 |
Resolve particular premise with <locale>.intro to obtain old form.
|
ballarin@14211
|
1347 |
- Fixed bug in type inference ("unify_frozen") that prevented mix of target
|
ballarin@14211
|
1348 |
specification and "includes" elements in goal statement.
|
ballarin@14254
|
1349 |
- Rule sets <locale>.intro and <locale>.axioms no longer declared as
|
ballarin@14254
|
1350 |
[intro?] and [elim?] (respectively) by default.
|
ballarin@14508
|
1351 |
- Experimental command for instantiation of locales in proof contexts:
|
ballarin@14551
|
1352 |
instantiate <label>[<attrs>]: <loc>
|
ballarin@14508
|
1353 |
Instantiates locale <loc> and adds all its theorems to the current context
|
ballarin@14551
|
1354 |
taking into account their attributes. Label and attrs are optional
|
ballarin@14551
|
1355 |
modifiers, like in theorem declarations. If present, names of
|
ballarin@14551
|
1356 |
instantiated theorems are qualified with <label>, and the attributes
|
ballarin@14551
|
1357 |
<attrs> are applied after any attributes these theorems might have already.
|
ballarin@14551
|
1358 |
If the locale has assumptions, a chained fact of the form
|
ballarin@14508
|
1359 |
"<loc> t1 ... tn" is expected from which instantiations of the parameters
|
ballarin@14551
|
1360 |
are derived. The command does not support old-style locales declared
|
ballarin@14551
|
1361 |
with "locale (open)".
|
ballarin@14551
|
1362 |
A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
|
ballarin@14175
|
1363 |
|
ballarin@14175
|
1364 |
* HOL: Tactic emulation methods induct_tac and case_tac understand static
|
ballarin@14175
|
1365 |
(Isar) contexts.
|
ballarin@14175
|
1366 |
|
wenzelm@14556
|
1367 |
|
kleing@14136
|
1368 |
*** HOL ***
|
kleing@14136
|
1369 |
|
kleing@14624
|
1370 |
* Proof import: new image HOL4 contains the imported library from
|
kleing@14624
|
1371 |
the HOL4 system with about 2500 theorems. It is imported by
|
kleing@14624
|
1372 |
replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
|
kleing@14624
|
1373 |
can be used like any other Isabelle image. See
|
kleing@14624
|
1374 |
HOL/Import/HOL/README for more information.
|
kleing@14624
|
1375 |
|
ballarin@14398
|
1376 |
* Simplifier:
|
ballarin@14398
|
1377 |
- Much improved handling of linear and partial orders.
|
ballarin@14398
|
1378 |
Reasoners for linear and partial orders are set up for type classes
|
ballarin@14398
|
1379 |
"linorder" and "order" respectively, and are added to the default simpset
|
ballarin@14398
|
1380 |
as solvers. This means that the simplifier can build transitivity chains
|
ballarin@14398
|
1381 |
to solve goals from the assumptions.
|
ballarin@14398
|
1382 |
- INCOMPATIBILITY: old proofs break occasionally. Typically, applications
|
ballarin@14398
|
1383 |
of blast or auto after simplification become unnecessary because the goal
|
ballarin@14398
|
1384 |
is solved by simplification already.
|
ballarin@14398
|
1385 |
|
wenzelm@14731
|
1386 |
* Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
|
paulson@14389
|
1387 |
all proved in axiomatic type classes for semirings, rings and fields.
|
paulson@14389
|
1388 |
|
paulson@14389
|
1389 |
* Numerics:
|
paulson@14389
|
1390 |
- Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
|
wenzelm@14731
|
1391 |
now formalized using the Ring_and_Field theory mentioned above.
|
paulson@14389
|
1392 |
- INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
|
paulson@14389
|
1393 |
than before, because now they are set up once in a generic manner.
|
wenzelm@14731
|
1394 |
- INCOMPATIBILITY: many type-specific arithmetic laws have gone.
|
paulson@14480
|
1395 |
Look for the general versions in Ring_and_Field (and Power if they concern
|
paulson@14480
|
1396 |
exponentiation).
|
paulson@14389
|
1397 |
|
paulson@14401
|
1398 |
* Type "rat" of the rational numbers is now available in HOL-Complex.
|
paulson@14389
|
1399 |
|
schirmer@14255
|
1400 |
* Records:
|
schirmer@14255
|
1401 |
- Record types are now by default printed with their type abbreviation
|
schirmer@14255
|
1402 |
instead of the list of all field types. This can be configured via
|
schirmer@14255
|
1403 |
the reference "print_record_type_abbr".
|
wenzelm@14731
|
1404 |
- Simproc "record_upd_simproc" for simplification of multiple updates added
|
schirmer@14255
|
1405 |
(not enabled by default).
|
schirmer@14427
|
1406 |
- Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
|
schirmer@14427
|
1407 |
EX x. x = sel r to True (not enabled by default).
|
schirmer@14255
|
1408 |
- Tactic "record_split_simp_tac" to split and simplify records added.
|
wenzelm@14731
|
1409 |
|
kleing@14136
|
1410 |
* 'specification' command added, allowing for definition by
|
skalberg@14224
|
1411 |
specification. There is also an 'ax_specification' command that
|
skalberg@14224
|
1412 |
introduces the new constants axiomatically.
|
kleing@14136
|
1413 |
|
nipkow@14375
|
1414 |
* arith(_tac) is now able to generate counterexamples for reals as well.
|
nipkow@14375
|
1415 |
|
ballarin@14399
|
1416 |
* HOL-Algebra: new locale "ring" for non-commutative rings.
|
ballarin@14399
|
1417 |
|
paulson@14243
|
1418 |
* HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
|
kleing@14610
|
1419 |
definitions, thanks to Sava Krsti\'{c} and John Matthews.
|
kleing@14610
|
1420 |
|
wenzelm@14731
|
1421 |
* HOL-Matrix: a first theory for matrices in HOL with an application of
|
kleing@14610
|
1422 |
matrix theory to linear programming.
|
kleing@14136
|
1423 |
|
nipkow@14380
|
1424 |
* Unions and Intersections:
|
nipkow@15119
|
1425 |
The latex output syntax of UN and INT has been changed
|
nipkow@15119
|
1426 |
from "\Union x \in A. B" to "\Union_{x \in A} B"
|
nipkow@15119
|
1427 |
i.e. the index formulae has become a subscript.
|
nipkow@15119
|
1428 |
Similarly for "\Union x. B", and for \Inter instead of \Union.
|
nipkow@14380
|
1429 |
|
kleing@14418
|
1430 |
* Unions and Intersections over Intervals:
|
wenzelm@14731
|
1431 |
There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
|
wenzelm@14731
|
1432 |
also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
|
kleing@14418
|
1433 |
like in normal math, and corresponding versions for < and for intersection.
|
kleing@14418
|
1434 |
|
nipkow@15677
|
1435 |
* HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
|
nipkow@15677
|
1436 |
lexicographic dictonary ordering has been added as "lexord".
|
nipkow@15677
|
1437 |
|
paulson@14401
|
1438 |
* ML: the legacy theory structures Int and List have been removed. They had
|
paulson@14401
|
1439 |
conflicted with ML Basis Library structures having the same names.
|
nipkow@14380
|
1440 |
|
webertj@14464
|
1441 |
* 'refute' command added to search for (finite) countermodels. Only works
|
webertj@14464
|
1442 |
for a fragment of HOL. The installation of an external SAT solver is
|
webertj@14464
|
1443 |
highly recommended. See "HOL/Refute.thy" for details.
|
webertj@14464
|
1444 |
|
berghofe@14602
|
1445 |
* 'quickcheck' command: Allows to find counterexamples by evaluating
|
berghofe@14602
|
1446 |
formulae under an assignment of free variables to random values.
|
berghofe@14602
|
1447 |
In contrast to 'refute', it can deal with inductive datatypes,
|
berghofe@14602
|
1448 |
but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
|
berghofe@14602
|
1449 |
for examples.
|
webertj@14464
|
1450 |
|
wenzelm@14606
|
1451 |
|
oheimb@14536
|
1452 |
*** HOLCF ***
|
oheimb@14536
|
1453 |
|
oheimb@14536
|
1454 |
* Streams now come with concatenation and are part of the HOLCF image
|
oheimb@14536
|
1455 |
|
wenzelm@14572
|
1456 |
|
wenzelm@14572
|
1457 |
|
kleing@14136
|
1458 |
New in Isabelle2003 (May 2003)
|
wenzelm@14606
|
1459 |
------------------------------
|
kleing@14136
|
1460 |
|
wenzelm@13280
|
1461 |
*** General ***
|
wenzelm@13280
|
1462 |
|
berghofe@13618
|
1463 |
* Provers/simplifier:
|
berghofe@13618
|
1464 |
|
nipkow@13781
|
1465 |
- Completely reimplemented method simp (ML: Asm_full_simp_tac):
|
berghofe@13618
|
1466 |
Assumptions are now subject to complete mutual simplification,
|
berghofe@13618
|
1467 |
not just from left to right. The simplifier now preserves
|
berghofe@13618
|
1468 |
the order of assumptions.
|
berghofe@13618
|
1469 |
|
berghofe@13618
|
1470 |
Potential INCOMPATIBILITY:
|
berghofe@13618
|
1471 |
|
nipkow@13781
|
1472 |
-- simp sometimes diverges where the old version did
|
nipkow@13781
|
1473 |
not, e.g. invoking simp on the goal
|
berghofe@13618
|
1474 |
|
berghofe@13618
|
1475 |
[| P (f x); y = x; f x = f y |] ==> Q
|
berghofe@13618
|
1476 |
|
nipkow@13781
|
1477 |
now gives rise to the infinite reduction sequence
|
nipkow@13781
|
1478 |
|
nipkow@13781
|
1479 |
P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
|
nipkow@13781
|
1480 |
|
nipkow@13781
|
1481 |
Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
|
nipkow@13781
|
1482 |
kind of problem.
|
nipkow@13781
|
1483 |
|
nipkow@13781
|
1484 |
-- Tactics combining classical reasoner and simplification (such as auto)
|
nipkow@13781
|
1485 |
are also affected by this change, because many of them rely on
|
nipkow@13781
|
1486 |
simp. They may sometimes diverge as well or yield a different numbers
|
nipkow@13781
|
1487 |
of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
|
nipkow@13781
|
1488 |
in case of problems. Sometimes subsequent calls to the classical
|
nipkow@13781
|
1489 |
reasoner will fail because a preceeding call to the simplifier too
|
nipkow@13781
|
1490 |
eagerly simplified the goal, e.g. deleted redundant premises.
|
berghofe@13618
|
1491 |
|
berghofe@13618
|
1492 |
- The simplifier trace now shows the names of the applied rewrite rules
|
berghofe@13618
|
1493 |
|
nipkow@13829
|
1494 |
- You can limit the number of recursive invocations of the simplifier
|
nipkow@13829
|
1495 |
during conditional rewriting (where the simplifie tries to solve the
|
nipkow@13829
|
1496 |
conditions before applying the rewrite rule):
|
nipkow@13829
|
1497 |
ML "simp_depth_limit := n"
|
nipkow@13829
|
1498 |
where n is an integer. Thus you can force termination where previously
|
nipkow@13829
|
1499 |
the simplifier would diverge.
|
nipkow@13829
|
1500 |
|
ballarin@13835
|
1501 |
- Accepts free variables as head terms in congruence rules. Useful in Isar.
|
nipkow@13829
|
1502 |
|
ballarin@13938
|
1503 |
- No longer aborts on failed congruence proof. Instead, the
|
ballarin@13938
|
1504 |
congruence is ignored.
|
ballarin@13938
|
1505 |
|
berghofe@14008
|
1506 |
* Pure: New generic framework for extracting programs from constructive
|
berghofe@14008
|
1507 |
proofs. See HOL/Extraction.thy for an example instantiation, as well
|
berghofe@14008
|
1508 |
as HOL/Extraction for some case studies.
|
berghofe@14008
|
1509 |
|
nipkow@13868
|
1510 |
* Pure: The main goal of the proof state is no longer shown by default, only
|
nipkow@13868
|
1511 |
the subgoals. This behaviour is controlled by a new flag.
|
ballarin@13835
|
1512 |
PG menu: Isabelle/Isar -> Settings -> Show Main Goal
|
nipkow@13815
|
1513 |
(ML: Proof.show_main_goal).
|
nipkow@13815
|
1514 |
|
nipkow@13815
|
1515 |
* Pure: You can find all matching introduction rules for subgoal 1, i.e. all
|
nipkow@13815
|
1516 |
rules whose conclusion matches subgoal 1:
|
nipkow@13815
|
1517 |
PG menu: Isabelle/Isar -> Show me -> matching rules
|
nipkow@13815
|
1518 |
The rules are ordered by how closely they match the subgoal.
|
nipkow@13815
|
1519 |
In particular, rules that solve a subgoal outright are displayed first
|
nipkow@13815
|
1520 |
(or rather last, the way they are printed).
|
nipkow@13815
|
1521 |
(ML: ProofGeneral.print_intros())
|
nipkow@13815
|
1522 |
|
nipkow@13815
|
1523 |
* Pure: New flag trace_unify_fail causes unification to print
|
nipkow@13781
|
1524 |
diagnostic information (PG: in trace buffer) when it fails. This is
|
nipkow@13781
|
1525 |
useful for figuring out why single step proofs like rule, erule or
|
nipkow@13781
|
1526 |
assumption failed.
|
nipkow@13781
|
1527 |
|
nipkow@13815
|
1528 |
* Pure: Locale specifications now produce predicate definitions
|
wenzelm@13410
|
1529 |
according to the body of text (covering assumptions modulo local
|
wenzelm@13410
|
1530 |
definitions); predicate "loc_axioms" covers newly introduced text,
|
wenzelm@13410
|
1531 |
while "loc" is cumulative wrt. all included locale expressions; the
|
wenzelm@13410
|
1532 |
latter view is presented only on export into the global theory
|
wenzelm@13410
|
1533 |
context; potential INCOMPATIBILITY, use "(open)" option to fall back
|
wenzelm@13410
|
1534 |
on the old view without predicates;
|
wenzelm@13410
|
1535 |
|
wenzelm@13459
|
1536 |
* Pure: predefined locales "var" and "struct" are useful for sharing
|
wenzelm@13459
|
1537 |
parameters (as in CASL, for example); just specify something like
|
wenzelm@13459
|
1538 |
``var x + var y + struct M'' as import;
|
wenzelm@13459
|
1539 |
|
wenzelm@13463
|
1540 |
* Pure: improved thms_containing: proper indexing of facts instead of
|
wenzelm@13463
|
1541 |
raw theorems; check validity of results wrt. current name space;
|
wenzelm@13463
|
1542 |
include local facts of proof configuration (also covers active
|
wenzelm@13541
|
1543 |
locales), cover fixed variables in index; may use "_" in term
|
wenzelm@13541
|
1544 |
specification; an optional limit for the number of printed facts may
|
wenzelm@13541
|
1545 |
be given (the default is 40);
|
wenzelm@13541
|
1546 |
|
wenzelm@13541
|
1547 |
* Pure: disallow duplicate fact bindings within new-style theory files
|
wenzelm@13541
|
1548 |
(batch-mode only);
|
wenzelm@13540
|
1549 |
|
wenzelm@13463
|
1550 |
* Provers: improved induct method: assumptions introduced by case
|
wenzelm@13463
|
1551 |
"foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
|
wenzelm@13463
|
1552 |
the goal statement); "foo" still refers to all facts collectively;
|
wenzelm@13463
|
1553 |
|
paulson@13550
|
1554 |
* Provers: the function blast.overloaded has been removed: all constants
|
paulson@13550
|
1555 |
are regarded as potentially overloaded, which improves robustness in exchange
|
paulson@13550
|
1556 |
for slight decrease in efficiency;
|
paulson@13550
|
1557 |
|
nipkow@13781
|
1558 |
* Provers/linorder: New generic prover for transitivity reasoning over
|
nipkow@13781
|
1559 |
linear orders. Note: this prover is not efficient!
|
nipkow@13781
|
1560 |
|
wenzelm@13522
|
1561 |
* Isar: preview of problems to finish 'show' now produce an error
|
wenzelm@13522
|
1562 |
rather than just a warning (in interactive mode);
|
wenzelm@13522
|
1563 |
|
wenzelm@13280
|
1564 |
|
nipkow@13158
|
1565 |
*** HOL ***
|
nipkow@13158
|
1566 |
|
nipkow@13899
|
1567 |
* arith(_tac)
|
nipkow@13899
|
1568 |
|
nipkow@13899
|
1569 |
- Produces a counter example if it cannot prove a goal.
|
nipkow@13899
|
1570 |
Note that the counter example may be spurious if the goal is not a formula
|
nipkow@13899
|
1571 |
of quantifier-free linear arithmetic.
|
nipkow@13899
|
1572 |
In ProofGeneral the counter example appears in the trace buffer.
|
nipkow@13899
|
1573 |
|
nipkow@13899
|
1574 |
- Knows about div k and mod k where k is a numeral of type nat or int.
|
nipkow@13899
|
1575 |
|
nipkow@13899
|
1576 |
- Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
|
nipkow@13899
|
1577 |
linear arithmetic fails. This takes account of quantifiers and divisibility.
|
wenzelm@14731
|
1578 |
Presburger arithmetic can also be called explicitly via presburger(_tac).
|
nipkow@13899
|
1579 |
|
nipkow@13899
|
1580 |
* simp's arithmetic capabilities have been enhanced a bit: it now
|
nipkow@13899
|
1581 |
takes ~= in premises into account (by performing a case split);
|
nipkow@13899
|
1582 |
|
nipkow@13899
|
1583 |
* simp reduces "m*(n div m) + n mod m" to n, even if the two summands
|
nipkow@13899
|
1584 |
are distributed over a sum of terms;
|
nipkow@13899
|
1585 |
|
ballarin@13735
|
1586 |
* New tactic "trans_tac" and method "trans" instantiate
|
ballarin@13735
|
1587 |
Provers/linorder.ML for axclasses "order" and "linorder" (predicates
|
wenzelm@14731
|
1588 |
"<=", "<" and "=").
|
wenzelm@14731
|
1589 |
|
wenzelm@14731
|
1590 |
* function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
|
paulson@13587
|
1591 |
HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
|
paulson@13587
|
1592 |
|
wenzelm@13443
|
1593 |
* 'typedef' command has new option "open" to suppress the set
|
wenzelm@13443
|
1594 |
definition;
|
wenzelm@13443
|
1595 |
|
wenzelm@13522
|
1596 |
* functions Min and Max on finite sets have been introduced (theory
|
wenzelm@13522
|
1597 |
Finite_Set);
|
nipkow@13492
|
1598 |
|
wenzelm@13443
|
1599 |
* attribute [symmetric] now works for relations as well; it turns
|
wenzelm@13443
|
1600 |
(x,y) : R^-1 into (y,x) : R, and vice versa;
|
wenzelm@13443
|
1601 |
|
nipkow@13613
|
1602 |
* induct over a !!-quantified statement (say !!x1..xn):
|
nipkow@13613
|
1603 |
each "case" automatically performs "fix x1 .. xn" with exactly those names.
|
nipkow@13613
|
1604 |
|
nipkow@13899
|
1605 |
* Map: `empty' is no longer a constant but a syntactic abbreviation for
|
nipkow@13899
|
1606 |
%x. None. Warning: empty_def now refers to the previously hidden definition
|
nipkow@13899
|
1607 |
of the empty set.
|
nipkow@13899
|
1608 |
|
ballarin@14018
|
1609 |
* Algebra: formalization of classical algebra. Intended as base for
|
ballarin@14018
|
1610 |
any algebraic development in Isabelle. Currently covers group theory
|
ballarin@14018
|
1611 |
(up to Sylow's theorem) and ring theory (Universal Property of
|
ballarin@14018
|
1612 |
Univariate Polynomials). Contributions welcome;
|
paulson@13960
|
1613 |
|
paulson@13960
|
1614 |
* GroupTheory: deleted, since its material has been moved to Algebra;
|
paulson@13960
|
1615 |
|
wenzelm@14731
|
1616 |
* Complex: new directory of the complex numbers with numeric constants,
|
wenzelm@14731
|
1617 |
nonstandard complex numbers, and some complex analysis, standard and
|
paulson@13966
|
1618 |
nonstandard (Jacques Fleuriot);
|
paulson@13966
|
1619 |
|
paulson@13966
|
1620 |
* HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
|
paulson@13966
|
1621 |
|
wenzelm@14731
|
1622 |
* Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
|
paulson@13966
|
1623 |
Fleuriot);
|
paulson@13960
|
1624 |
|
wenzelm@13549
|
1625 |
* Real/HahnBanach: updated and adapted to locales;
|
wenzelm@13549
|
1626 |
|
ballarin@13995
|
1627 |
* NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
|
ballarin@13995
|
1628 |
Gray and Kramer);
|
paulson@13872
|
1629 |
|
paulson@13872
|
1630 |
* UNITY: added the Meier-Sanders theory of progress sets;
|
paulson@13872
|
1631 |
|
kleing@14011
|
1632 |
* MicroJava: bytecode verifier and lightweight bytecode verifier
|
kleing@14011
|
1633 |
as abstract algorithms, instantiated to the JVM;
|
kleing@14011
|
1634 |
|
schirmer@14010
|
1635 |
* Bali: Java source language formalization. Type system, operational
|
schirmer@14010
|
1636 |
semantics, axiomatic semantics. Supported language features:
|
schirmer@14010
|
1637 |
classes, interfaces, objects,virtual methods, static methods,
|
schirmer@14010
|
1638 |
static/instance fields, arrays, access modifiers, definite
|
schirmer@14010
|
1639 |
assignment, exceptions.
|
wenzelm@13549
|
1640 |
|
kleing@14011
|
1641 |
|
wenzelm@13549
|
1642 |
*** ZF ***
|
wenzelm@13549
|
1643 |
|
webertj@15154
|
1644 |
* ZF/Constructible: consistency proof for AC (Gdel's constructible
|
wenzelm@13549
|
1645 |
universe, etc.);
|
wenzelm@13549
|
1646 |
|
paulson@13872
|
1647 |
* Main ZF: virtually all theories converted to new-style format;
|
nipkow@13518
|
1648 |
|
wenzelm@13280
|
1649 |
|
wenzelm@13478
|
1650 |
*** ML ***
|
wenzelm@13478
|
1651 |
|
wenzelm@13478
|
1652 |
* Pure: Tactic.prove provides sane interface for internal proofs;
|
wenzelm@13478
|
1653 |
omits the infamous "standard" operation, so this is more appropriate
|
wenzelm@13478
|
1654 |
than prove_goalw_cterm in many situations (e.g. in simprocs);
|
wenzelm@13478
|
1655 |
|
wenzelm@13478
|
1656 |
* Pure: improved error reporting of simprocs;
|
wenzelm@13478
|
1657 |
|
wenzelm@13478
|
1658 |
* Provers: Simplifier.simproc(_i) provides sane interface for setting
|
wenzelm@13478
|
1659 |
up simprocs;
|
wenzelm@13478
|
1660 |
|
wenzelm@13478
|
1661 |
|
kleing@13953
|
1662 |
*** Document preparation ***
|
kleing@13953
|
1663 |
|
kleing@13953
|
1664 |
* uses \par instead of \\ for line breaks in theory text. This may
|
kleing@13953
|
1665 |
shift some page breaks in large documents. To get the old behaviour
|
kleing@13953
|
1666 |
use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
|
kleing@13953
|
1667 |
|
wenzelm@14731
|
1668 |
* minimized dependencies of isabelle.sty and isabellesym.sty on
|
kleing@13953
|
1669 |
other packages
|
kleing@13953
|
1670 |
|
kleing@13953
|
1671 |
* \<euro> now needs package babel/greek instead of marvosym (which
|
kleing@13953
|
1672 |
broke \Rightarrow)
|
kleing@13953
|
1673 |
|
wenzelm@14731
|
1674 |
* normal size for \<zero>...\<nine> (uses \mathbf instead of
|
kleing@13954
|
1675 |
textcomp package)
|
kleing@13953
|
1676 |
|
wenzelm@13280
|
1677 |
|
wenzelm@14572
|
1678 |
|
wenzelm@12984
|
1679 |
New in Isabelle2002 (March 2002)
|
wenzelm@12984
|
1680 |
--------------------------------
|
wenzelm@11474
|
1681 |
|
wenzelm@11572
|
1682 |
*** Document preparation ***
|
wenzelm@11572
|
1683 |
|
wenzelm@11842
|
1684 |
* greatly simplified document preparation setup, including more
|
wenzelm@11842
|
1685 |
graceful interpretation of isatool usedir -i/-d/-D options, and more
|
wenzelm@11842
|
1686 |
instructive isatool mkdir; users should basically be able to get
|
wenzelm@12899
|
1687 |
started with "isatool mkdir HOL Test && isatool make"; alternatively,
|
wenzelm@12899
|
1688 |
users may run a separate document processing stage manually like this:
|
wenzelm@12899
|
1689 |
"isatool usedir -D output HOL Test && isatool document Test/output";
|
wenzelm@11842
|
1690 |
|
wenzelm@11842
|
1691 |
* theory dependency graph may now be incorporated into documents;
|
wenzelm@11842
|
1692 |
isatool usedir -g true will produce session_graph.eps/.pdf for use
|
wenzelm@11842
|
1693 |
with \includegraphics of LaTeX;
|
wenzelm@11842
|
1694 |
|
wenzelm@11864
|
1695 |
* proper spacing of consecutive markup elements, especially text
|
wenzelm@11864
|
1696 |
blocks after section headings;
|
wenzelm@11864
|
1697 |
|
wenzelm@11572
|
1698 |
* support bold style (for single symbols only), input syntax is like
|
wenzelm@11572
|
1699 |
this: "\<^bold>\<alpha>" or "\<^bold>A";
|
wenzelm@11572
|
1700 |
|
wenzelm@11814
|
1701 |
* \<bullet> is now output as bold \cdot by default, which looks much
|
wenzelm@11572
|
1702 |
better in printed text;
|
wenzelm@11572
|
1703 |
|
wenzelm@11712
|
1704 |
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
|
wenzelm@11712
|
1705 |
note that these symbols are currently unavailable in Proof General /
|
wenzelm@12769
|
1706 |
X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
|
wenzelm@12690
|
1707 |
|
wenzelm@12690
|
1708 |
* isatool latex no longer depends on changed TEXINPUTS, instead
|
wenzelm@12690
|
1709 |
isatool document copies the Isabelle style files to the target
|
wenzelm@12690
|
1710 |
location;
|
wenzelm@11712
|
1711 |
|
wenzelm@11572
|
1712 |
|
wenzelm@11633
|
1713 |
*** Isar ***
|
wenzelm@11633
|
1714 |
|
wenzelm@12312
|
1715 |
* Pure/Provers: improved proof by cases and induction;
|
wenzelm@12280
|
1716 |
- 'case' command admits impromptu naming of parameters (such as
|
wenzelm@12280
|
1717 |
"case (Suc n)");
|
wenzelm@12280
|
1718 |
- 'induct' method divinates rule instantiation from the inductive
|
wenzelm@12280
|
1719 |
claim; no longer requires excessive ?P bindings for proper
|
wenzelm@12280
|
1720 |
instantiation of cases;
|
wenzelm@12280
|
1721 |
- 'induct' method properly enumerates all possibilities of set/type
|
wenzelm@12280
|
1722 |
rules; as a consequence facts may be also passed through *type*
|
wenzelm@12280
|
1723 |
rules without further ado;
|
wenzelm@12280
|
1724 |
- 'induct' method now derives symbolic cases from the *rulified*
|
wenzelm@12280
|
1725 |
rule (before it used to rulify cases stemming from the internal
|
wenzelm@12280
|
1726 |
atomized version); this means that the context of a non-atomic
|
wenzelm@12280
|
1727 |
statement becomes is included in the hypothesis, avoiding the
|
wenzelm@12280
|
1728 |
slightly cumbersome show "PROP ?case" form;
|
wenzelm@12280
|
1729 |
- 'induct' may now use elim-style induction rules without chaining
|
wenzelm@12280
|
1730 |
facts, using ``missing'' premises from the goal state; this allows
|
wenzelm@12280
|
1731 |
rules stemming from inductive sets to be applied in unstructured
|
wenzelm@12280
|
1732 |
scripts, while still benefitting from proper handling of non-atomic
|
wenzelm@12280
|
1733 |
statements; NB: major inductive premises need to be put first, all
|
wenzelm@12280
|
1734 |
the rest of the goal is passed through the induction;
|
wenzelm@12280
|
1735 |
- 'induct' proper support for mutual induction involving non-atomic
|
wenzelm@12280
|
1736 |
rule statements (uses the new concept of simultaneous goals, see
|
wenzelm@12280
|
1737 |
below);
|
wenzelm@12853
|
1738 |
- append all possible rule selections, but only use the first
|
wenzelm@12853
|
1739 |
success (no backtracking);
|
wenzelm@11995
|
1740 |
- removed obsolete "(simplified)" and "(stripped)" options of methods;
|
wenzelm@12754
|
1741 |
- undeclared rule case names default to numbers 1, 2, 3, ...;
|
wenzelm@12754
|
1742 |
- added 'print_induct_rules' (covered by help item in recent Proof
|
wenzelm@12754
|
1743 |
General versions);
|
wenzelm@11995
|
1744 |
- moved induct/cases attributes to Pure, methods to Provers;
|
wenzelm@11995
|
1745 |
- generic method setup instantiated for FOL and HOL;
|
wenzelm@11986
|
1746 |
|
wenzelm@12163
|
1747 |
* Pure: support multiple simultaneous goal statements, for example
|
wenzelm@12163
|
1748 |
"have a: A and b: B" (same for 'theorem' etc.); being a pure
|
wenzelm@12163
|
1749 |
meta-level mechanism, this acts as if several individual goals had
|
wenzelm@12163
|
1750 |
been stated separately; in particular common proof methods need to be
|
wenzelm@12163
|
1751 |
repeated in order to cover all claims; note that a single elimination
|
wenzelm@12163
|
1752 |
step is *not* sufficient to establish the two conjunctions, so this
|
wenzelm@12163
|
1753 |
fails:
|
wenzelm@12163
|
1754 |
|
wenzelm@12163
|
1755 |
assume "A & B" then have A and B .. (*".." fails*)
|
wenzelm@12163
|
1756 |
|
wenzelm@12163
|
1757 |
better use "obtain" in situations as above; alternative refer to
|
wenzelm@12163
|
1758 |
multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
|
wenzelm@12163
|
1759 |
|
wenzelm@12078
|
1760 |
* Pure: proper integration with ``locales''; unlike the original
|
webertj@15154
|
1761 |
version by Florian Kammller, Isar locales package high-level proof
|
wenzelm@12078
|
1762 |
contexts rather than raw logical ones (e.g. we admit to include
|
wenzelm@12280
|
1763 |
attributes everywhere); operations on locales include merge and
|
wenzelm@12964
|
1764 |
rename; support for implicit arguments (``structures''); simultaneous
|
wenzelm@12964
|
1765 |
type-inference over imports and text; see also HOL/ex/Locales.thy for
|
wenzelm@12964
|
1766 |
some examples;
|
wenzelm@12078
|
1767 |
|
wenzelm@12707
|
1768 |
* Pure: the following commands have been ``localized'', supporting a
|
wenzelm@12707
|
1769 |
target locale specification "(in name)": 'lemma', 'theorem',
|
wenzelm@12707
|
1770 |
'corollary', 'lemmas', 'theorems', 'declare'; the results will be
|
wenzelm@12707
|
1771 |
stored both within the locale and at the theory level (exported and
|
wenzelm@12707
|
1772 |
qualified by the locale name);
|
wenzelm@12707
|
1773 |
|
wenzelm@12964
|
1774 |
* Pure: theory goals may now be specified in ``long'' form, with
|
wenzelm@12964
|
1775 |
ad-hoc contexts consisting of arbitrary locale elements. for example
|
wenzelm@12964
|
1776 |
``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
|
wenzelm@12964
|
1777 |
definitions may be given, too); the result is a meta-level rule with
|
wenzelm@12964
|
1778 |
the context elements being discharged in the obvious way;
|
wenzelm@12964
|
1779 |
|
wenzelm@12964
|
1780 |
* Pure: new proof command 'using' allows to augment currently used
|
wenzelm@12964
|
1781 |
facts after a goal statement ('using' is syntactically analogous to
|
wenzelm@12964
|
1782 |
'apply', but acts on the goal's facts only); this allows chained facts
|
wenzelm@12964
|
1783 |
to be separated into parts given before and after a claim, as in
|
wenzelm@12964
|
1784 |
``from a and b have C using d and e <proof>'';
|
wenzelm@12078
|
1785 |
|
wenzelm@11722
|
1786 |
* Pure: renamed "antecedent" case to "rule_context";
|
wenzelm@11722
|
1787 |
|
wenzelm@12964
|
1788 |
* Pure: new 'judgment' command records explicit information about the
|
wenzelm@12964
|
1789 |
object-logic embedding (used by several tools internally); no longer
|
wenzelm@12964
|
1790 |
use hard-wired "Trueprop";
|
wenzelm@12964
|
1791 |
|
wenzelm@11738
|
1792 |
* Pure: added 'corollary' command;
|
wenzelm@11738
|
1793 |
|
wenzelm@11722
|
1794 |
* Pure: fixed 'token_translation' command;
|
wenzelm@11722
|
1795 |
|
wenzelm@11899
|
1796 |
* Pure: removed obsolete 'exported' attribute;
|
wenzelm@11899
|
1797 |
|
wenzelm@11933
|
1798 |
* Pure: dummy pattern "_" in is/let is now automatically lifted over
|
wenzelm@11933
|
1799 |
bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
|
wenzelm@11899
|
1800 |
supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
|
wenzelm@11899
|
1801 |
|
wenzelm@11952
|
1802 |
* Pure: method 'atomize' presents local goal premises as object-level
|
wenzelm@11952
|
1803 |
statements (atomic meta-level propositions); setup controlled via
|
wenzelm@11952
|
1804 |
rewrite rules declarations of 'atomize' attribute; example
|
wenzelm@11952
|
1805 |
application: 'induct' method with proper rule statements in improper
|
wenzelm@11952
|
1806 |
proof *scripts*;
|
wenzelm@11952
|
1807 |
|
wenzelm@12106
|
1808 |
* Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
|
wenzelm@12106
|
1809 |
now consider the syntactic context of assumptions, giving a better
|
wenzelm@12106
|
1810 |
chance to get type-inference of the arguments right (this is
|
wenzelm@12106
|
1811 |
especially important for locales);
|
wenzelm@12106
|
1812 |
|
wenzelm@12312
|
1813 |
* Pure: "sorry" no longer requires quick_and_dirty in interactive
|
wenzelm@12312
|
1814 |
mode;
|
wenzelm@12312
|
1815 |
|
wenzelm@12405
|
1816 |
* Pure/obtain: the formal conclusion "thesis", being marked as
|
wenzelm@12405
|
1817 |
``internal'', may no longer be reference directly in the text;
|
wenzelm@12405
|
1818 |
potential INCOMPATIBILITY, may need to use "?thesis" in rare
|
wenzelm@12405
|
1819 |
situations;
|
wenzelm@12405
|
1820 |
|
wenzelm@12405
|
1821 |
* Pure: generic 'sym' attribute which declares a rule both as pure
|
wenzelm@12405
|
1822 |
'elim?' and for the 'symmetric' operation;
|
wenzelm@12405
|
1823 |
|
wenzelm@12877
|
1824 |
* Pure: marginal comments ``--'' may now occur just anywhere in the
|
wenzelm@12877
|
1825 |
text; the fixed correlation with particular command syntax has been
|
wenzelm@12877
|
1826 |
discontinued;
|
wenzelm@12877
|
1827 |
|
berghofe@13023
|
1828 |
* Pure: new method 'rules' is particularly well-suited for proof
|
berghofe@13023
|
1829 |
search in intuitionistic logic; a bit slower than 'blast' or 'fast',
|
berghofe@13023
|
1830 |
but often produces more compact proof terms with less detours;
|
berghofe@13023
|
1831 |
|
wenzelm@12364
|
1832 |
* Pure/Provers/classical: simplified integration with pure rule
|
wenzelm@12364
|
1833 |
attributes and methods; the classical "intro?/elim?/dest?"
|
wenzelm@12364
|
1834 |
declarations coincide with the pure ones; the "rule" method no longer
|
wenzelm@12364
|
1835 |
includes classically swapped intros; "intro" and "elim" methods no
|
wenzelm@12364
|
1836 |
longer pick rules from the context; also got rid of ML declarations
|
wenzelm@12364
|
1837 |
AddXIs/AddXEs/AddXDs; all of this has some potential for
|
wenzelm@12364
|
1838 |
INCOMPATIBILITY;
|
wenzelm@12364
|
1839 |
|
wenzelm@12405
|
1840 |
* Provers/classical: attribute 'swapped' produces classical inversions
|
wenzelm@12405
|
1841 |
of introduction rules;
|
wenzelm@12405
|
1842 |
|
wenzelm@12364
|
1843 |
* Provers/simplifier: 'simplified' attribute may refer to explicit
|
wenzelm@12364
|
1844 |
rules instead of full simplifier context; 'iff' attribute handles
|
wenzelm@12364
|
1845 |
conditional rules;
|
wenzelm@11936
|
1846 |
|
wenzelm@11745
|
1847 |
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
|
wenzelm@11745
|
1848 |
|
wenzelm@11690
|
1849 |
* HOL: 'recdef' now fails on unfinished automated proofs, use
|
wenzelm@11633
|
1850 |
"(permissive)" option to recover old behavior;
|
wenzelm@11633
|
1851 |
|
wenzelm@11933
|
1852 |
* HOL: 'inductive' no longer features separate (collective) attributes
|
wenzelm@11933
|
1853 |
for 'intros' (was found too confusing);
|
wenzelm@11933
|
1854 |
|
wenzelm@12405
|
1855 |
* HOL: properly declared induction rules less_induct and
|
wenzelm@12405
|
1856 |
wf_induct_rule;
|
wenzelm@12405
|
1857 |
|
kleing@11788
|
1858 |
|
wenzelm@11474
|
1859 |
*** HOL ***
|
wenzelm@11474
|
1860 |
|
wenzelm@11702
|
1861 |
* HOL: moved over to sane numeral syntax; the new policy is as
|
wenzelm@11702
|
1862 |
follows:
|
wenzelm@11702
|
1863 |
|
wenzelm@11702
|
1864 |
- 0 and 1 are polymorphic constants, which are defined on any
|
wenzelm@11702
|
1865 |
numeric type (nat, int, real etc.);
|
wenzelm@11702
|
1866 |
|
wenzelm@11702
|
1867 |
- 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
|
wenzelm@11702
|
1868 |
binary representation internally;
|
wenzelm@11702
|
1869 |
|
wenzelm@11702
|
1870 |
- type nat has special constructor Suc, and generally prefers Suc 0
|
wenzelm@11702
|
1871 |
over 1::nat and Suc (Suc 0) over 2::nat;
|
wenzelm@11702
|
1872 |
|
wenzelm@12364
|
1873 |
This change may cause significant problems of INCOMPATIBILITY; here
|
wenzelm@12364
|
1874 |
are some hints on converting existing sources:
|
wenzelm@11702
|
1875 |
|
wenzelm@11702
|
1876 |
- due to the new "num" token, "-0" and "-1" etc. are now atomic
|
wenzelm@11702
|
1877 |
entities, so expressions involving "-" (unary or binary minus) need
|
wenzelm@11702
|
1878 |
to be spaced properly;
|
wenzelm@11702
|
1879 |
|
wenzelm@11702
|
1880 |
- existing occurrences of "1" may need to be constraint "1::nat" or
|
wenzelm@11702
|
1881 |
even replaced by Suc 0; similar for old "2";
|
wenzelm@11702
|
1882 |
|
wenzelm@11702
|
1883 |
- replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
|
wenzelm@11702
|
1884 |
|
wenzelm@11702
|
1885 |
- remove all special provisions on numerals in proofs;
|
wenzelm@11702
|
1886 |
|
wenzelm@13042
|
1887 |
* HOL: simp rules nat_number expand numerals on nat to Suc/0
|
wenzelm@12837
|
1888 |
representation (depends on bin_arith_simps in the default context);
|
wenzelm@12837
|
1889 |
|
wenzelm@12736
|
1890 |
* HOL: symbolic syntax for x^2 (numeral 2);
|
wenzelm@12736
|
1891 |
|
wenzelm@12335
|
1892 |
* HOL: the class of all HOL types is now called "type" rather than
|
wenzelm@12335
|
1893 |
"term"; INCOMPATIBILITY, need to adapt references to this type class
|
wenzelm@12335
|
1894 |
in axclass/classes, instance/arities, and (usually rare) occurrences
|
wenzelm@12335
|
1895 |
in typings (of consts etc.); internally the class is called
|
wenzelm@12335
|
1896 |
"HOL.type", ML programs should refer to HOLogic.typeS;
|
wenzelm@12335
|
1897 |
|
wenzelm@12280
|
1898 |
* HOL/record package improvements:
|
wenzelm@12280
|
1899 |
- new derived operations "fields" to build a partial record section,
|
wenzelm@12280
|
1900 |
"extend" to promote a fixed record to a record scheme, and
|
wenzelm@12280
|
1901 |
"truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
|
wenzelm@12280
|
1902 |
declared as simp by default;
|
wenzelm@12587
|
1903 |
- shared operations ("more", "fields", etc.) now need to be always
|
wenzelm@12587
|
1904 |
qualified) --- potential INCOMPATIBILITY;
|
wenzelm@12280
|
1905 |
- removed "make_scheme" operations (use "make" with "extend") --
|
wenzelm@12280
|
1906 |
INCOMPATIBILITY;
|
wenzelm@11937
|
1907 |
- removed "more" class (simply use "term") -- INCOMPATIBILITY;
|
wenzelm@12253
|
1908 |
- provides cases/induct rules for use with corresponding Isar
|
wenzelm@12253
|
1909 |
methods (for concrete records, record schemes, concrete more
|
wenzelm@12280
|
1910 |
parts, and schematic more parts -- in that order);
|
wenzelm@11930
|
1911 |
- internal definitions directly based on a light-weight abstract
|
wenzelm@11930
|
1912 |
theory of product types over typedef rather than datatype;
|
wenzelm@11930
|
1913 |
|
berghofe@13023
|
1914 |
* HOL: generic code generator for generating executable ML code from
|
berghofe@13023
|
1915 |
specifications; specific support for HOL constructs such as inductive
|
berghofe@13023
|
1916 |
datatypes and sets, as well as recursive functions; can be invoked
|
berghofe@13023
|
1917 |
via 'generate_code' theory section;
|
berghofe@13023
|
1918 |
|
wenzelm@11933
|
1919 |
* HOL: canonical cases/induct rules for n-tuples (n = 3..7);
|
wenzelm@11933
|
1920 |
|
paulson@13824
|
1921 |
* HOL: consolidated and renamed several theories. In particular:
|
wenzelm@14731
|
1922 |
Ord.thy has been absorbed into HOL.thy
|
wenzelm@14731
|
1923 |
String.thy has been absorbed into List.thy
|
wenzelm@14731
|
1924 |
|
wenzelm@11802
|
1925 |
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
|
wenzelm@11802
|
1926 |
(beware of argument permutation!);
|
wenzelm@11802
|
1927 |
|
wenzelm@11657
|
1928 |
* HOL: linorder_less_split superseded by linorder_cases;
|
wenzelm@11657
|
1929 |
|
wenzelm@12917
|
1930 |
* HOL/List: "nodups" renamed to "distinct";
|
nipkow@12889
|
1931 |
|
wenzelm@11633
|
1932 |
* HOL: added "The" definite description operator; move Hilbert's "Eps"
|
paulson@13824
|
1933 |
to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
|
paulson@13824
|
1934 |
- Ex_def has changed, now need to use some_eq_ex
|
wenzelm@11437
|
1935 |
|
wenzelm@11572
|
1936 |
* HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
|
wenzelm@11572
|
1937 |
in this (rare) case use:
|
wenzelm@11572
|
1938 |
|
wenzelm@11572
|
1939 |
delSWrapper "split_all_tac"
|
wenzelm@11572
|
1940 |
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
|
wenzelm@11572
|
1941 |
|
wenzelm@11572
|
1942 |
* HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
|
wenzelm@11474
|
1943 |
MAY FAIL;
|
nipkow@11361
|
1944 |
|
wenzelm@11572
|
1945 |
* HOL: introduced f^n = f o ... o f; warning: due to the limits of
|
wenzelm@11572
|
1946 |
Isabelle's type classes, ^ on functions and relations has too general
|
wenzelm@11572
|
1947 |
a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
|
wenzelm@11572
|
1948 |
necessary to attach explicit type constraints;
|
nipkow@11307
|
1949 |
|
wenzelm@12917
|
1950 |
* HOL/Relation: the prefix name of the infix "O" has been changed from
|
wenzelm@12917
|
1951 |
"comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
|
wenzelm@12917
|
1952 |
renamed accordingly (eg "compI" -> "rel_compI").
|
nipkow@12489
|
1953 |
|
wenzelm@11487
|
1954 |
* HOL: syntax translations now work properly with numerals and records
|
wenzelm@11487
|
1955 |
expressions;
|
wenzelm@11474
|
1956 |
|
wenzelm@12457
|
1957 |
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
|
wenzelm@12457
|
1958 |
of "lam" -- INCOMPATIBILITY;
|
wenzelm@11474
|
1959 |
|
wenzelm@11933
|
1960 |
* HOL: got rid of some global declarations (potential INCOMPATIBILITY
|
wenzelm@11933
|
1961 |
for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
|
wenzelm@11933
|
1962 |
renamed "Product_Type.unit";
|
wenzelm@11611
|
1963 |
|
nipkow@12564
|
1964 |
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
|
nipkow@12564
|
1965 |
|
wenzelm@12924
|
1966 |
* HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
|
wenzelm@12924
|
1967 |
the "cases" method);
|
wenzelm@12924
|
1968 |
|
wenzelm@12597
|
1969 |
* HOL/GroupTheory: group theory examples including Sylow's theorem (by
|
webertj@15154
|
1970 |
Florian Kammller);
|
wenzelm@12597
|
1971 |
|
wenzelm@12608
|
1972 |
* HOL/IMP: updated and converted to new-style theory format; several
|
wenzelm@12608
|
1973 |
parts turned into readable document, with proper Isar proof texts and
|
wenzelm@12608
|
1974 |
some explanations (by Gerwin Klein);
|
wenzelm@12597
|
1975 |
|
wenzelm@12734
|
1976 |
* HOL-Real: added Complex_Numbers (by Gertrud Bauer);
|
wenzelm@12734
|
1977 |
|
wenzelm@12690
|
1978 |
* HOL-Hyperreal is now a logic image;
|
wenzelm@12690
|
1979 |
|
wenzelm@11611
|
1980 |
|
wenzelm@12022
|
1981 |
*** HOLCF ***
|
wenzelm@12022
|
1982 |
|
wenzelm@12622
|
1983 |
* Isar: consts/constdefs supports mixfix syntax for continuous
|
wenzelm@12622
|
1984 |
operations;
|
wenzelm@12622
|
1985 |
|
wenzelm@12622
|
1986 |
* Isar: domain package adapted to new-style theory format, e.g. see
|
wenzelm@12622
|
1987 |
HOLCF/ex/Dnat.thy;
|
wenzelm@12622
|
1988 |
|
wenzelm@12622
|
1989 |
* theory Lift: proper use of rep_datatype lift instead of ML hacks --
|
wenzelm@12280
|
1990 |
potential INCOMPATIBILITY; now use plain induct_tac instead of former
|
wenzelm@12280
|
1991 |
lift.induct_tac, always use UU instead of Undef;
|
wenzelm@12022
|
1992 |
|
wenzelm@12597
|
1993 |
* HOLCF/IMP: updated and converted to new-style theory;
|
wenzelm@12597
|
1994 |
|
wenzelm@12022
|
1995 |
|
wenzelm@11474
|
1996 |
*** ZF ***
|
wenzelm@11474
|
1997 |
|
wenzelm@12622
|
1998 |
* Isar: proper integration of logic-specific tools and packages,
|
wenzelm@12622
|
1999 |
including theory commands '(co)inductive', '(co)datatype',
|
wenzelm@12622
|
2000 |
'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
|
wenzelm@12622
|
2001 |
'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
|
wenzelm@12622
|
2002 |
|
wenzelm@12622
|
2003 |
* theory Main no longer includes AC; for the Axiom of Choice, base
|
wenzelm@12622
|
2004 |
your theory on Main_ZFC;
|
wenzelm@12622
|
2005 |
|
wenzelm@12622
|
2006 |
* the integer library now covers quotients and remainders, with many
|
wenzelm@12622
|
2007 |
laws relating division to addition, multiplication, etc.;
|
paulson@12563
|
2008 |
|
wenzelm@12280
|
2009 |
* ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
|
wenzelm@12280
|
2010 |
typeless version of the formalism;
|
wenzelm@12280
|
2011 |
|
wenzelm@13025
|
2012 |
* ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
|
wenzelm@13025
|
2013 |
format;
|
wenzelm@12608
|
2014 |
|
wenzelm@12280
|
2015 |
* ZF/Induct: new directory for examples of inductive definitions,
|
wenzelm@12608
|
2016 |
including theory Multiset for multiset orderings; converted to
|
wenzelm@12608
|
2017 |
new-style theory format;
|
wenzelm@12177
|
2018 |
|
wenzelm@13025
|
2019 |
* ZF: many new theorems about lists, ordinals, etc.;
|
paulson@12850
|
2020 |
|
wenzelm@11474
|
2021 |
|
wenzelm@11474
|
2022 |
*** General ***
|
wenzelm@11474
|
2023 |
|
wenzelm@12280
|
2024 |
* Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
|
wenzelm@12280
|
2025 |
variable proof controls level of detail: 0 = no proofs (only oracle
|
wenzelm@12280
|
2026 |
dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
|
wenzelm@12280
|
2027 |
also ref manual for further ML interfaces;
|
wenzelm@12280
|
2028 |
|
wenzelm@12280
|
2029 |
* Pure/axclass: removed obsolete ML interface
|
wenzelm@12280
|
2030 |
goal_subclass/goal_arity;
|
wenzelm@12280
|
2031 |
|
wenzelm@12280
|
2032 |
* Pure/syntax: new token syntax "num" for plain numerals (without "#"
|
wenzelm@12280
|
2033 |
of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
|
wenzelm@12280
|
2034 |
separate tokens, so expressions involving minus need to be spaced
|
wenzelm@12280
|
2035 |
properly;
|
wenzelm@12280
|
2036 |
|
wenzelm@12312
|
2037 |
* Pure/syntax: support non-oriented infixes, using keyword "infix"
|
wenzelm@12312
|
2038 |
rather than "infixl" or "infixr";
|
wenzelm@12312
|
2039 |
|
wenzelm@12312
|
2040 |
* Pure/syntax: concrete syntax for dummy type variables admits genuine
|
wenzelm@12312
|
2041 |
sort constraint specifications in type inference; e.g. "x::_::foo"
|
wenzelm@12312
|
2042 |
ensures that the type of "x" is of sort "foo" (but not necessarily a
|
wenzelm@12312
|
2043 |
type variable);
|
wenzelm@12280
|
2044 |
|
wenzelm@12280
|
2045 |
* Pure/syntax: print modes "type_brackets" and "no_type_brackets"
|
wenzelm@12280
|
2046 |
control output of nested => (types); the default behavior is
|
wenzelm@12280
|
2047 |
"type_brackets";
|
wenzelm@12280
|
2048 |
|
wenzelm@12280
|
2049 |
* Pure/syntax: builtin parse translation for "_constify" turns valued
|
wenzelm@11817
|
2050 |
tokens into AST constants;
|
wenzelm@11474
|
2051 |
|
wenzelm@12280
|
2052 |
* Pure/syntax: prefer later declarations of translations and print
|
wenzelm@12280
|
2053 |
translation functions; potential INCOMPATIBILITY: need to reverse
|
wenzelm@12280
|
2054 |
multiple declarations for same syntax element constant;
|
wenzelm@12280
|
2055 |
|
wenzelm@12832
|
2056 |
* Pure/show_hyps reset by default (in accordance to existing Isar
|
wenzelm@12832
|
2057 |
practice);
|
wenzelm@12832
|
2058 |
|
wenzelm@12280
|
2059 |
* Provers/classical: renamed addaltern to addafter, addSaltern to
|
wenzelm@12280
|
2060 |
addSafter;
|
wenzelm@12280
|
2061 |
|
wenzelm@12280
|
2062 |
* Provers/clasimp: ``iff'' declarations now handle conditional rules
|
wenzelm@12280
|
2063 |
as well;
|
wenzelm@12253
|
2064 |
|
wenzelm@12538
|
2065 |
* system: tested support for MacOS X; should be able to get Isabelle +
|
wenzelm@12538
|
2066 |
Proof General to work in a plain Terminal after installing Poly/ML
|
wenzelm@12538
|
2067 |
(e.g. from the Isabelle distribution area) and GNU bash alone
|
wenzelm@12538
|
2068 |
(e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
|
wenzelm@12538
|
2069 |
support requires further installations, e.g. from
|
wenzelm@12538
|
2070 |
http://fink.sourceforge.net/);
|
wenzelm@12538
|
2071 |
|
wenzelm@12280
|
2072 |
* system: support Poly/ML 4.1.1 (able to manage larger heaps);
|
wenzelm@11551
|
2073 |
|
wenzelm@12753
|
2074 |
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
|
wenzelm@12753
|
2075 |
of 40 MB), cf. ML_OPTIONS;
|
wenzelm@12753
|
2076 |
|
wenzelm@11633
|
2077 |
* system: Proof General keywords specification is now part of the
|
wenzelm@11633
|
2078 |
Isabelle distribution (see etc/isar-keywords.el);
|
wenzelm@11633
|
2079 |
|
wenzelm@12728
|
2080 |
* system: support for persistent Proof General sessions (refrain from
|
wenzelm@12728
|
2081 |
outdating all loaded theories on startup); user may create writable
|
wenzelm@12728
|
2082 |
logic images like this: ``isabelle -q HOL Test'';
|
wenzelm@12597
|
2083 |
|
wenzelm@11551
|
2084 |
* system: smart selection of Isabelle process versus Isabelle
|
wenzelm@11572
|
2085 |
interface, accommodates case-insensitive file systems (e.g. HFS+); may
|
wenzelm@11572
|
2086 |
run both "isabelle" and "Isabelle" even if file names are badly
|
wenzelm@11572
|
2087 |
damaged (executable inspects the case of the first letter of its own
|
wenzelm@11572
|
2088 |
name); added separate "isabelle-process" and "isabelle-interface";
|
wenzelm@11551
|
2089 |
|
wenzelm@12472
|
2090 |
* system: refrain from any attempt at filtering input streams; no
|
wenzelm@12472
|
2091 |
longer support ``8bit'' encoding of old isabelle font, instead proper
|
wenzelm@12472
|
2092 |
iso-latin characters may now be used; the related isatools
|
wenzelm@12472
|
2093 |
"symbolinput" and "nonascii" have disappeared as well;
|
wenzelm@12472
|
2094 |
|
wenzelm@12472
|
2095 |
* system: removed old "xterm" interface (the print modes "xterm" and
|
wenzelm@12472
|
2096 |
"xterm_color" are still available for direct use in a suitable
|
wenzelm@12472
|
2097 |
terminal);
|
wenzelm@12472
|
2098 |
|
paulson@11314
|
2099 |
|
oheimb@11169
|
2100 |
|
wenzelm@11062
|
2101 |
New in Isabelle99-2 (February 2001)
|
wenzelm@11062
|
2102 |
-----------------------------------
|
wenzelm@11062
|
2103 |
|
nipkow@10224
|
2104 |
*** Overview of INCOMPATIBILITIES ***
|
nipkow@10224
|
2105 |
|
paulson@11241
|
2106 |
* HOL: please note that theories in the Library and elsewhere often use the
|
paulson@11241
|
2107 |
new-style (Isar) format; to refer to their theorems in an ML script you must
|
wenzelm@12622
|
2108 |
bind them to ML identifers by e.g. val thm_name = thm "thm_name";
|
paulson@11241
|
2109 |
|
wenzelm@11043
|
2110 |
* HOL: inductive package no longer splits induction rule aggressively,
|
wenzelm@11043
|
2111 |
but only as far as specified by the introductions given; the old
|
oheimb@11130
|
2112 |
format may be recovered via ML function complete_split_rule or attribute
|
wenzelm@11043
|
2113 |
'split_rule (complete)';
|
wenzelm@11043
|
2114 |
|
wenzelm@10998
|
2115 |
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
|
wenzelm@10998
|
2116 |
gfp_Tarski to gfp_unfold;
|
nipkow@10224
|
2117 |
|
paulson@10288
|
2118 |
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
|
paulson@10288
|
2119 |
|
wenzelm@10858
|
2120 |
* HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
|
wenzelm@10858
|
2121 |
relation); infix "^^" has been renamed "``"; infix "``" has been
|
wenzelm@10858
|
2122 |
renamed "`"; "univalent" has been renamed "single_valued";
|
nipkow@10793
|
2123 |
|
wenzelm@10998
|
2124 |
* HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
|
wenzelm@10998
|
2125 |
operation;
|
wenzelm@10998
|
2126 |
|
nipkow@10868
|
2127 |
* HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
|
nipkow@10856
|
2128 |
|
wenzelm@10391
|
2129 |
* Isar: 'obtain' no longer declares "that" fact as simp/intro;
|
wenzelm@10391
|
2130 |
|
wenzelm@10401
|
2131 |
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
|
wenzelm@10401
|
2132 |
consequence, it is no longer monotonic wrt. the local goal context
|
wenzelm@10401
|
2133 |
(which is now passed through the inductive cases);
|
wenzelm@10401
|
2134 |
|
wenzelm@10976
|
2135 |
* Document preparation: renamed standard symbols \<ll> to \<lless> and
|
wenzelm@10976
|
2136 |
\<gg> to \<ggreater>;
|
wenzelm@10976
|
2137 |
|
nipkow@10224
|
2138 |
|
wenzelm@10245
|
2139 |
*** Document preparation ***
|
wenzelm@10245
|
2140 |
|
wenzelm@10858
|
2141 |
* \isabellestyle{NAME} selects version of Isabelle output (currently
|
wenzelm@10858
|
2142 |
available: are "it" for near math-mode best-style output, "sl" for
|
wenzelm@10858
|
2143 |
slanted text style, and "tt" for plain type-writer; if no
|
wenzelm@10858
|
2144 |
\isabellestyle command is given, output is according to slanted
|
wenzelm@10858
|
2145 |
type-writer);
|
wenzelm@10858
|
2146 |
|
wenzelm@10322
|
2147 |
* support sub/super scripts (for single symbols only), input syntax is
|
wenzelm@10322
|
2148 |
like this: "A\<^sup>*" or "A\<^sup>\<star>";
|
wenzelm@10322
|
2149 |
|
wenzelm@10858
|
2150 |
* some more standard symbols; see Appendix A of the system manual for
|
wenzelm@11062
|
2151 |
the complete list of symbols defined in isabellesym.sty;
|
wenzelm@10858
|
2152 |
|
wenzelm@10998
|
2153 |
* improved isabelle style files; more abstract symbol implementation
|
wenzelm@10998
|
2154 |
(should now use \isamath{...} and \isatext{...} in custom symbol
|
wenzelm@10998
|
2155 |
definitions);
|
wenzelm@10998
|
2156 |
|
wenzelm@10634
|
2157 |
* antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
|
wenzelm@10634
|
2158 |
state; Note that presentation of goal states does not conform to
|
wenzelm@10634
|
2159 |
actual human-readable proof documents. Please do not include goal
|
wenzelm@10634
|
2160 |
states into document output unless you really know what you are doing!
|
wenzelm@10322
|
2161 |
|
wenzelm@11062
|
2162 |
* proper indentation of antiquoted output with proportional LaTeX
|
wenzelm@11062
|
2163 |
fonts;
|
wenzelm@10862
|
2164 |
|
wenzelm@11050
|
2165 |
* no_document ML operator temporarily disables LaTeX document
|
wenzelm@11050
|
2166 |
generation;
|
wenzelm@11050
|
2167 |
|
wenzelm@11062
|
2168 |
* isatool unsymbolize tunes sources for plain ASCII communication;
|
wenzelm@11062
|
2169 |
|
wenzelm@10322
|
2170 |
|
wenzelm@10306
|
2171 |
*** Isar ***
|
wenzelm@10306
|
2172 |
|
wenzelm@10547
|
2173 |
* Pure: Isar now suffers initial goal statements to contain unbound
|
wenzelm@10547
|
2174 |
schematic variables (this does not conform to actual readable proof
|
wenzelm@10547
|
2175 |
documents, due to unpredictable outcome and non-compositional proof
|
wenzelm@10547
|
2176 |
checking); users who know what they are doing may use schematic goals
|
wenzelm@10547
|
2177 |
for Prolog-style synthesis of proven results;
|
wenzelm@10547
|
2178 |
|
wenzelm@10391
|
2179 |
* Pure: assumption method (an implicit finishing) now handles actual
|
wenzelm@10391
|
2180 |
rules as well;
|
wenzelm@10391
|
2181 |
|
wenzelm@10391
|
2182 |
* Pure: improved 'obtain' --- moved to Pure, insert "that" into
|
wenzelm@10391
|
2183 |
initial goal, declare "that" only as Pure intro (only for single
|
wenzelm@10391
|
2184 |
steps); the "that" rule assumption may now be involved in implicit
|
wenzelm@10391
|
2185 |
finishing, thus ".." becomes a feasible for trivial obtains;
|
wenzelm@10391
|
2186 |
|
wenzelm@10391
|
2187 |
* Pure: default proof step now includes 'intro_classes'; thus trivial
|
wenzelm@10391
|
2188 |
instance proofs may be performed by "..";
|
wenzelm@10391
|
2189 |
|
wenzelm@10391
|
2190 |
* Pure: ?thesis / ?this / "..." now work for pure meta-level
|
wenzelm@10391
|
2191 |
statements as well;
|
wenzelm@10306
|
2192 |
|
wenzelm@11097
|
2193 |
* Pure: more robust selection of calculational rules;
|
wenzelm@11097
|
2194 |
|
wenzelm@10858
|
2195 |
* Pure: the builtin notion of 'finished' goal now includes the ==-refl
|
wenzelm@10858
|
2196 |
rule (as well as the assumption rule);
|
wenzelm@10858
|
2197 |
|
wenzelm@10858
|
2198 |
* Pure: 'thm_deps' command visualizes dependencies of theorems and
|
wenzelm@10858
|
2199 |
lemmas, using the graph browser tool;
|
wenzelm@10858
|
2200 |
|
wenzelm@10944
|
2201 |
* Pure: predict failure of "show" in interactive mode;
|
wenzelm@10944
|
2202 |
|
wenzelm@11016
|
2203 |
* Pure: 'thms_containing' now takes actual terms as arguments;
|
wenzelm@11016
|
2204 |
|
wenzelm@10401
|
2205 |
* HOL: improved method 'induct' --- now handles non-atomic goals
|
wenzelm@10401
|
2206 |
(potential INCOMPATIBILITY); tuned error handling;
|
wenzelm@10401
|
2207 |
|
wenzelm@10557
|
2208 |
* HOL: cases and induct rules now provide explicit hints about the
|
wenzelm@10547
|
2209 |
number of facts to be consumed (0 for "type" and 1 for "set" rules);
|
wenzelm@10547
|
2210 |
any remaining facts are inserted into the goal verbatim;
|
wenzelm@10547
|
2211 |
|
wenzelm@10858
|
2212 |
* HOL: local contexts (aka cases) may now contain term bindings as
|
wenzelm@10858
|
2213 |
well; the 'cases' and 'induct' methods new provide a ?case binding for
|
wenzelm@10858
|
2214 |
the result to be shown in each case;
|
wenzelm@10858
|
2215 |
|
wenzelm@10770
|
2216 |
* HOL: added 'recdef_tc' command;
|
wenzelm@10770
|
2217 |
|
wenzelm@11016
|
2218 |
* isatool convert assists in eliminating legacy ML scripts;
|
wenzelm@11016
|
2219 |
|
wenzelm@10306
|
2220 |
|
wenzelm@10245
|
2221 |
*** HOL ***
|
wenzelm@10245
|
2222 |
|
wenzelm@10245
|
2223 |
* HOL/Library: a collection of generic theories to be used together
|
wenzelm@10245
|
2224 |
with main HOL; the theory loader path already includes this directory
|
wenzelm@10245
|
2225 |
by default; the following existing theories have been moved here:
|
wenzelm@10245
|
2226 |
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
|
wenzelm@10337
|
2227 |
(as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
|
wenzelm@10245
|
2228 |
|
wenzelm@10966
|
2229 |
* HOL/Unix: "Some aspects of Unix file-system security", a typical
|
wenzelm@10966
|
2230 |
modelling and verification task performed in Isabelle/HOL +
|
wenzelm@10966
|
2231 |
Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
|
wenzelm@10966
|
2232 |
|
wenzelm@11094
|
2233 |
* HOL/Algebra: special summation operator SUM no longer exists, it has
|
wenzelm@11094
|
2234 |
been replaced by setsum; infix 'assoc' now has priority 50 (like
|
wenzelm@11094
|
2235 |
'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
|
wenzelm@11094
|
2236 |
'domain', this makes the theory consistent with mathematical
|
wenzelm@11094
|
2237 |
literature;
|
wenzelm@11094
|
2238 |
|
wenzelm@10514
|
2239 |
* HOL basics: added overloaded operations "inverse" and "divide"
|
wenzelm@10726
|
2240 |
(infix "/"), syntax for generic "abs" operation, generic summation
|
wenzelm@11094
|
2241 |
operator \<Sum>;
|
wenzelm@10452
|
2242 |
|
wenzelm@10391
|
2243 |
* HOL/typedef: simplified package, provide more useful rules (see also
|
wenzelm@10391
|
2244 |
HOL/subset.thy);
|
wenzelm@10391
|
2245 |
|
wenzelm@10915
|
2246 |
* HOL/datatype: induction rule for arbitrarily branching datatypes is
|
wenzelm@10915
|
2247 |
now expressed as a proper nested rule (old-style tactic scripts may
|
wenzelm@10915
|
2248 |
require atomize_strip_tac to cope with non-atomic premises);
|
wenzelm@10915
|
2249 |
|
wenzelm@10915
|
2250 |
* HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
|
wenzelm@10915
|
2251 |
to "split_conv" (old name still available for compatibility);
|
wenzelm@10915
|
2252 |
|
wenzelm@10915
|
2253 |
* HOL: improved concrete syntax for strings (e.g. allows translation
|
wenzelm@10915
|
2254 |
rules with string literals);
|
wenzelm@10915
|
2255 |
|
paulson@12245
|
2256 |
* HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
|
paulson@12245
|
2257 |
and Fleuriot's mechanization of analysis, including the transcendental
|
paulson@12245
|
2258 |
functions for the reals;
|
paulson@10756
|
2259 |
|
wenzelm@11094
|
2260 |
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
|
wenzelm@10391
|
2261 |
|
wenzelm@10858
|
2262 |
|
paulson@10474
|
2263 |
*** CTT ***
|
paulson@10474
|
2264 |
|
wenzelm@10547
|
2265 |
* CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
|
wenzelm@10547
|
2266 |
"lam" is displayed as TWO lambda-symbols
|
paulson@10474
|
2267 |
|
wenzelm@10547
|
2268 |
* CTT: theory Main now available, containing everything (that is, Bool
|
wenzelm@10547
|
2269 |
and Arith);
|
wenzelm@10547
|
2270 |
|
paulson@10474
|
2271 |
|
wenzelm@10391
|
2272 |
*** General ***
|
wenzelm@10391
|
2273 |
|
wenzelm@10547
|
2274 |
* Pure: the Simplifier has been implemented properly as a derived rule
|
wenzelm@10547
|
2275 |
outside of the actual kernel (at last!); the overall performance
|
wenzelm@10547
|
2276 |
penalty in practical applications is about 50%, while reliability of
|
wenzelm@10547
|
2277 |
the Isabelle inference kernel has been greatly improved;
|
wenzelm@10547
|
2278 |
|
wenzelm@11112
|
2279 |
* print modes "brackets" and "no_brackets" control output of nested =>
|
wenzelm@11112
|
2280 |
(types) and ==> (props); the default behaviour is "brackets";
|
wenzelm@11112
|
2281 |
|
wenzelm@10391
|
2282 |
* Provers: fast_tac (and friends) now handle actual object-logic rules
|
wenzelm@10391
|
2283 |
as assumptions as well;
|
wenzelm@10391
|
2284 |
|
wenzelm@11124
|
2285 |
* system: support Poly/ML 4.0;
|
wenzelm@11124
|
2286 |
|
wenzelm@11124
|
2287 |
* system: isatool install handles KDE version 1 or 2;
|
wenzelm@11124
|
2288 |
|
wenzelm@10391
|
2289 |
|
wenzelm@10245
|
2290 |
|
wenzelm@10103
|
2291 |
New in Isabelle99-1 (October 2000)
|
wenzelm@10103
|
2292 |
----------------------------------
|
wenzelm@8015
|
2293 |
|
wenzelm@10003
|
2294 |
*** Overview of INCOMPATIBILITIES ***
|
paulson@8014
|
2295 |
|
wenzelm@8848
|
2296 |
* HOL: simplification of natural numbers is much changed; to partly
|
wenzelm@8848
|
2297 |
recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
|
wenzelm@8848
|
2298 |
issue the following ML commands:
|
wenzelm@8848
|
2299 |
|
wenzelm@8848
|
2300 |
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
|
wenzelm@8848
|
2301 |
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
|
paulson@8788
|
2302 |
|
wenzelm@10129
|
2303 |
* HOL: simplification no longer dives into case-expressions; this is
|
wenzelm@10129
|
2304 |
controlled by "t.weak_case_cong" for each datatype t;
|
paulson@8967
|
2305 |
|
wenzelm@10003
|
2306 |
* HOL: nat_less_induct renamed to less_induct;
|
wenzelm@10003
|
2307 |
|
wenzelm@10003
|
2308 |
* HOL: systematic renaming of the SOME (Eps) rules, may use isatool
|
wenzelm@10003
|
2309 |
fixsome to patch .thy and .ML sources automatically;
|
wenzelm@10003
|
2310 |
|
wenzelm@10003
|
2311 |
select_equality -> some_equality
|
wenzelm@10003
|
2312 |
select_eq_Ex -> some_eq_ex
|
wenzelm@10003
|
2313 |
selectI2EX -> someI2_ex
|
wenzelm@10003
|
2314 |
selectI2 -> someI2
|
wenzelm@10003
|
2315 |
selectI -> someI
|
wenzelm@10003
|
2316 |
select1_equality -> some1_equality
|
wenzelm@10003
|
2317 |
Eps_sym_eq -> some_sym_eq_trivial
|
wenzelm@10003
|
2318 |
Eps_eq -> some_eq_trivial
|
wenzelm@10003
|
2319 |
|
wenzelm@10003
|
2320 |
* HOL: exhaust_tac on datatypes superceded by new generic case_tac;
|
wenzelm@10003
|
2321 |
|
wenzelm@10003
|
2322 |
* HOL: removed obsolete theorem binding expand_if (refer to split_if
|
wenzelm@10003
|
2323 |
instead);
|
wenzelm@10003
|
2324 |
|
wenzelm@10003
|
2325 |
* HOL: the recursion equations generated by 'recdef' are now called
|
wenzelm@10003
|
2326 |
f.simps instead of f.rules;
|
wenzelm@10003
|
2327 |
|
wenzelm@10003
|
2328 |
* HOL: qed_spec_mp now also handles bounded ALL as well;
|
wenzelm@10003
|
2329 |
|
wenzelm@10003
|
2330 |
* HOL: 0 is now overloaded, so the type constraint ":: nat" may
|
wenzelm@10003
|
2331 |
sometimes be needed;
|
wenzelm@10003
|
2332 |
|
wenzelm@10003
|
2333 |
* HOL: the constant for "f``x" is now "image" rather than "op ``";
|
paulson@8014
|
2334 |
|
paulson@10065
|
2335 |
* HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
|
paulson@10065
|
2336 |
|
wenzelm@9330
|
2337 |
* HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
|
wenzelm@9330
|
2338 |
product is now "<*>" instead of "Times"; the lexicographic product is
|
wenzelm@9330
|
2339 |
now "<*lex*>" instead of "**";
|
nipkow@8705
|
2340 |
|
wenzelm@10003
|
2341 |
* HOL: theory Sexp is now in HOL/Induct examples (it used to be part
|
wenzelm@10003
|
2342 |
of main HOL, but was unused); better use HOL's datatype package;
|
paulson@9971
|
2343 |
|
wenzelm@10137
|
2344 |
* HOL: removed "symbols" syntax for constant "override" of theory Map;
|
wenzelm@10137
|
2345 |
the old syntax may be recovered as follows:
|
wenzelm@10137
|
2346 |
|
wenzelm@10137
|
2347 |
syntax (symbols)
|
wenzelm@10137
|
2348 |
override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
|
wenzelm@10137
|
2349 |
(infixl "\\<oplus>" 100)
|
wenzelm@10137
|
2350 |
|
wenzelm@8848
|
2351 |
* HOL/Real: "rabs" replaced by overloaded "abs" function;
|
wenzelm@8848
|
2352 |
|
wenzelm@8887
|
2353 |
* HOL/ML: even fewer consts are declared as global (see theories Ord,
|
wenzelm@8887
|
2354 |
Lfp, Gfp, WF); this only affects ML packages that refer to const names
|
wenzelm@8887
|
2355 |
internally;
|
wenzelm@8887
|
2356 |
|
wenzelm@10003
|
2357 |
* HOL and ZF: syntax for quotienting wrt an equivalence relation
|
wenzelm@10003
|
2358 |
changed from A/r to A//r;
|
wenzelm@9908
|
2359 |
|
wenzelm@10003
|
2360 |
* ZF: new treatment of arithmetic (nat & int) may break some old
|
wenzelm@10003
|
2361 |
proofs;
|
paulson@9388
|
2362 |
|
wenzelm@10003
|
2363 |
* Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
|
wenzelm@10003
|
2364 |
rulify -> rule_format, elimify -> elim_format, ...);
|
paulson@9542
|
2365 |
|
wenzelm@9941
|
2366 |
* Isar/Provers: intro/elim/dest attributes changed; renamed
|
wenzelm@9941
|
2367 |
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
|
wenzelm@9937
|
2368 |
should have to change intro!! to intro? only); replaced "delrule" by
|
wenzelm@9937
|
2369 |
"rule del";
|
wenzelm@9437
|
2370 |
|
wenzelm@9612
|
2371 |
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
|
wenzelm@9612
|
2372 |
|
wenzelm@9437
|
2373 |
* Provers: strengthened force_tac by using new first_best_tac;
|
oheimb@9402
|
2374 |
|
wenzelm@10003
|
2375 |
* LaTeX document preparation: several changes of isabelle.sty (see
|
wenzelm@10003
|
2376 |
lib/texinputs);
|
wenzelm@8729
|
2377 |
|
paulson@8014
|
2378 |
|
wenzelm@8487
|
2379 |
*** Document preparation ***
|
wenzelm@8358
|
2380 |
|
wenzelm@9198
|
2381 |
* formal comments (text blocks etc.) in new-style theories may now
|
wenzelm@9753
|
2382 |
contain antiquotations of thm/prop/term/typ/text to be presented
|
wenzelm@9753
|
2383 |
according to latex print mode; concrete syntax is like this:
|
wenzelm@9753
|
2384 |
@{term[show_types] "f(x) = a + x"};
|
wenzelm@9198
|
2385 |
|
wenzelm@8358
|
2386 |
* isatool mkdir provides easy setup of Isabelle session directories,
|
wenzelm@8518
|
2387 |
including proper document sources;
|
wenzelm@8358
|
2388 |
|
wenzelm@8358
|
2389 |
* generated LaTeX sources are now deleted after successful run
|
wenzelm@8358
|
2390 |
(isatool document -c); may retain a copy somewhere else via -D option
|
wenzelm@8358
|
2391 |
of isatool usedir;
|
wenzelm@8358
|
2392 |
|
wenzelm@8566
|
2393 |
* isatool usedir -D now lets isatool latex -o sty update the Isabelle
|
wenzelm@10003
|
2394 |
style files, achieving self-contained LaTeX sources and simplifying
|
wenzelm@10003
|
2395 |
LaTeX debugging;
|
wenzelm@8566
|
2396 |
|
wenzelm@8518
|
2397 |
* old-style theories now produce (crude) LaTeX output as well;
|
wenzelm@8358
|
2398 |
|
wenzelm@9057
|
2399 |
* browser info session directories are now self-contained (may be put
|
wenzelm@9437
|
2400 |
on WWW server seperately); improved graphs of nested sessions; removed
|
wenzelm@9437
|
2401 |
graph for 'all sessions';
|
wenzelm@9057
|
2402 |
|
wenzelm@10003
|
2403 |
* several improvements in isabelle style files; \isabellestyle{it}
|
wenzelm@10003
|
2404 |
produces fake math mode output; \isamarkupheader is now \section by
|
wenzelm@10003
|
2405 |
default; see lib/texinputs/isabelle.sty etc.;
|
wenzelm@9489
|
2406 |
|
wenzelm@8358
|
2407 |
|
wenzelm@8184
|
2408 |
*** Isar ***
|
wenzelm@8184
|
2409 |
|
wenzelm@10003
|
2410 |
* Isar/Pure: local results and corresponding term bindings are now
|
wenzelm@10003
|
2411 |
subject to Hindley-Milner polymorphism (similar to ML); this
|
wenzelm@10003
|
2412 |
accommodates incremental type-inference very nicely;
|
wenzelm@8283
|
2413 |
|
wenzelm@10003
|
2414 |
* Isar/Pure: new derived language element 'obtain' supports
|
wenzelm@10003
|
2415 |
generalized existence reasoning;
|
wenzelm@8621
|
2416 |
|
wenzelm@10003
|
2417 |
* Isar/Pure: new calculational elements 'moreover' and 'ultimately'
|
wenzelm@10003
|
2418 |
support accumulation of results, without applying any rules yet;
|
wenzelm@10003
|
2419 |
useful to collect intermediate results without explicit name
|
wenzelm@10003
|
2420 |
references, and for use with transitivity rules with more than 2
|
wenzelm@10003
|
2421 |
premises;
|
wenzelm@8184
|
2422 |
|
wenzelm@10003
|
2423 |
* Isar/Pure: scalable support for case-analysis type proofs: new
|
wenzelm@10003
|
2424 |
'case' language element refers to local contexts symbolically, as
|
wenzelm@10003
|
2425 |
produced by certain proof methods; internally, case names are attached
|
wenzelm@10003
|
2426 |
to theorems as "tags";
|
wenzelm@8440
|
2427 |
|
wenzelm@10003
|
2428 |
* Isar/Pure: theory command 'hide' removes declarations from
|
wenzelm@9330
|
2429 |
class/type/const name spaces;
|
wenzelm@9330
|
2430 |
|
wenzelm@10003
|
2431 |
* Isar/Pure: theory command 'defs' supports option "(overloaded)" to
|
wenzelm@9330
|
2432 |
indicate potential overloading;
|
wenzelm@9330
|
2433 |
|
wenzelm@10003
|
2434 |
* Isar/Pure: changed syntax of local blocks from {{ }} to { };
|
wenzelm@8921
|
2435 |
|
wenzelm@10003
|
2436 |
* Isar/Pure: syntax of sorts made 'inner', i.e. have to write
|
wenzelm@10003
|
2437 |
"{a,b,c}" instead of {a,b,c};
|
wenzelm@9612
|
2438 |
|
wenzelm@10003
|
2439 |
* Isar/Pure now provides its own version of intro/elim/dest
|
wenzelm@10003
|
2440 |
attributes; useful for building new logics, but beware of confusion
|
wenzelm@10003
|
2441 |
with the version in Provers/classical;
|
wenzelm@8921
|
2442 |
|
wenzelm@10003
|
2443 |
* Isar/Pure: the local context of (non-atomic) goals is provided via
|
wenzelm@10003
|
2444 |
case name 'antecedent';
|
wenzelm@8621
|
2445 |
|
wenzelm@10003
|
2446 |
* Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
|
wenzelm@10003
|
2447 |
to the current context is now done automatically);
|
wenzelm@8991
|
2448 |
|
wenzelm@10003
|
2449 |
* Isar/Pure: theory command 'method_setup' provides a simple interface
|
wenzelm@10003
|
2450 |
for definining proof methods in ML;
|
wenzelm@9011
|
2451 |
|
wenzelm@10003
|
2452 |
* Isar/Provers: intro/elim/dest attributes changed; renamed
|
wenzelm@9941
|
2453 |
intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
|
wenzelm@9941
|
2454 |
most cases, one should have to change intro!! to intro? only);
|
wenzelm@9941
|
2455 |
replaced "delrule" by "rule del";
|
wenzelm@8283
|
2456 |
|
wenzelm@10003
|
2457 |
* Isar/Provers: new 'hypsubst' method, plain 'subst' method and
|
wenzelm@10003
|
2458 |
'symmetric' attribute (the latter supercedes [RS sym]);
|
wenzelm@9612
|
2459 |
|
wenzelm@10003
|
2460 |
* Isar/Provers: splitter support (via 'split' attribute and 'simp'
|
wenzelm@10003
|
2461 |
method modifier); 'simp' method: 'only:' modifier removes loopers as
|
wenzelm@10003
|
2462 |
well (including splits);
|
wenzelm@10003
|
2463 |
|
wenzelm@10003
|
2464 |
* Isar/Provers: Simplifier and Classical methods now support all kind
|
wenzelm@10003
|
2465 |
of modifiers used in the past, including 'cong', 'iff', etc.
|
wenzelm@10003
|
2466 |
|
wenzelm@10003
|
2467 |
* Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
|
wenzelm@10003
|
2468 |
of Simplifier and Classical reasoner);
|
wenzelm@10003
|
2469 |
|
wenzelm@10003
|
2470 |
* Isar/HOL: new proof method 'cases' and improved version of 'induct'
|
wenzelm@10003
|
2471 |
now support named cases; major packages (inductive, datatype, primrec,
|
wenzelm@10003
|
2472 |
recdef) support case names and properly name parameters;
|
wenzelm@10003
|
2473 |
|
wenzelm@10003
|
2474 |
* Isar/HOL: new transitivity rules for substitution in inequalities --
|
wenzelm@10003
|
2475 |
monotonicity conditions are extracted to be proven at end of
|
wenzelm@10003
|
2476 |
calculations;
|
wenzelm@10003
|
2477 |
|
wenzelm@10003
|
2478 |
* Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
|
wenzelm@10003
|
2479 |
method anyway;
|
wenzelm@10003
|
2480 |
|
wenzelm@10003
|
2481 |
* Isar/HOL: removed old expand_if = split_if; theorems if_splits =
|
wenzelm@10003
|
2482 |
split_if split_if_asm; datatype package provides theorems foo.splits =
|
wenzelm@10003
|
2483 |
foo.split foo.split_asm for each datatype;
|
wenzelm@10003
|
2484 |
|
wenzelm@10003
|
2485 |
* Isar/HOL: tuned inductive package, rename "intrs" to "intros"
|
wenzelm@10003
|
2486 |
(potential INCOMPATIBILITY), emulation of mk_cases feature for proof
|
wenzelm@10003
|
2487 |
scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
|
wenzelm@10003
|
2488 |
use "(cases (simplified))" method in proper proof texts);
|
wenzelm@10003
|
2489 |
|
wenzelm@10003
|
2490 |
* Isar/HOL: added global 'arith_split' attribute for 'arith' method;
|
wenzelm@10003
|
2491 |
|
wenzelm@10003
|
2492 |
* Isar: names of theorems etc. may be natural numbers as well;
|
wenzelm@10003
|
2493 |
|
wenzelm@10003
|
2494 |
* Isar: 'pr' command: optional arguments for goals_limit and
|
wenzelm@9724
|
2495 |
ProofContext.prems_limit; no longer prints theory contexts, but only
|
wenzelm@9724
|
2496 |
proof states;
|
wenzelm@8487
|
2497 |
|
wenzelm@10003
|
2498 |
* Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
|
wenzelm@8518
|
2499 |
additional print modes to be specified; e.g. "pr(latex)" will print
|
wenzelm@8518
|
2500 |
proof state according to the Isabelle LaTeX style;
|
wenzelm@8487
|
2501 |
|
wenzelm@10003
|
2502 |
* Isar: improved support for emulating tactic scripts, including proof
|
wenzelm@9612
|
2503 |
methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
|
wenzelm@9612
|
2504 |
'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
|
wenzelm@9612
|
2505 |
(for HOL datatypes);
|
wenzelm@8534
|
2506 |
|
wenzelm@10003
|
2507 |
* Isar: simplified (more robust) goal selection of proof methods: 1st
|
wenzelm@10003
|
2508 |
goal, all goals, or explicit goal specifier (tactic emulation); thus
|
wenzelm@10003
|
2509 |
'proof method scripts' have to be in depth-first order;
|
wenzelm@8673
|
2510 |
|
wenzelm@10003
|
2511 |
* Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
|
wenzelm@8729
|
2512 |
|
wenzelm@10003
|
2513 |
* Isar: removed 'help' command, which hasn't been too helpful anyway;
|
wenzelm@10003
|
2514 |
should instead use individual commands for printing items
|
wenzelm@10003
|
2515 |
(print_commands, print_methods etc.);
|
wenzelm@9224
|
2516 |
|
wenzelm@10003
|
2517 |
* Isar: added 'nothing' --- the empty list of theorems;
|
wenzelm@9239
|
2518 |
|
wenzelm@8184
|
2519 |
|
paulson@8014
|
2520 |
*** HOL ***
|
paulson@8014
|
2521 |
|
wenzelm@10080
|
2522 |
* HOL/MicroJava: formalization of a fragment of Java, together with a
|
wenzelm@10080
|
2523 |
corresponding virtual machine and a specification of its bytecode
|
wenzelm@10080
|
2524 |
verifier and a lightweight bytecode verifier, including proofs of
|
wenzelm@10080
|
2525 |
type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
|
wenzelm@10080
|
2526 |
Cornelia Pusch (see also the homepage of project Bali at
|
wenzelm@10080
|
2527 |
http://isabelle.in.tum.de/Bali/);
|
wenzelm@10080
|
2528 |
|
wenzelm@8518
|
2529 |
* HOL/Algebra: new theory of rings and univariate polynomials, by
|
wenzelm@8518
|
2530 |
Clemens Ballarin;
|
paulson@8014
|
2531 |
|
wenzelm@10157
|
2532 |
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
|
wenzelm@10003
|
2533 |
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
|
wenzelm@10003
|
2534 |
Rasmussen;
|
wenzelm@8007
|
2535 |
|
wenzelm@10157
|
2536 |
* HOL/Lattice: fundamental concepts of lattice theory and order
|
wenzelm@10157
|
2537 |
structures, including duals, properties of bounds versus algebraic
|
wenzelm@10157
|
2538 |
laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
|
wenzelm@10157
|
2539 |
Theorem for complete lattices etc.; may also serve as a demonstration
|
wenzelm@10157
|
2540 |
for abstract algebraic reasoning using axiomatic type classes, and
|
wenzelm@10157
|
2541 |
mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
|
wenzelm@10157
|
2542 |
|
wenzelm@10003
|
2543 |
* HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
|
wenzelm@10003
|
2544 |
von Oheimb;
|
wenzelm@8570
|
2545 |
|
wenzelm@10164
|
2546 |
* HOL/IMPP: extension of IMP with local variables and mutually
|
wenzelm@10164
|
2547 |
recursive procedures, by David von Oheimb;
|
wenzelm@10164
|
2548 |
|
wenzelm@10003
|
2549 |
* HOL/Lambda: converted into new-style theory and document;
|
paulson@9542
|
2550 |
|
wenzelm@10003
|
2551 |
* HOL/ex/Multiquote: example of multiple nested quotations and
|
wenzelm@10003
|
2552 |
anti-quotations -- basically a generalized version of de-Bruijn
|
wenzelm@10003
|
2553 |
representation; very useful in avoiding lifting of operations;
|
wenzelm@8848
|
2554 |
|
wenzelm@9612
|
2555 |
* HOL/record: added general record equality rule to simpset; fixed
|
wenzelm@9612
|
2556 |
select-update simplification procedure to handle extended records as
|
wenzelm@9612
|
2557 |
well; admit "r" as field name;
|
paulson@9542
|
2558 |
|
paulson@8967
|
2559 |
* HOL: 0 is now overloaded over the new sort "zero", allowing its use with
|
paulson@8967
|
2560 |
other numeric types and also as the identity of groups, rings, etc.;
|
paulson@8967
|
2561 |
|
paulson@8967
|
2562 |
* HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
|
paulson@8967
|
2563 |
Types nat and int belong to this axclass;
|
paulson@8967
|
2564 |
|
wenzelm@10003
|
2565 |
* HOL: greatly improved simplification involving numerals of type nat, int, real:
|
paulson@8788
|
2566 |
(i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
|
paulson@8832
|
2567 |
i*j + k + j*#3*i simplifies to #4*(i*j) + k
|
paulson@8832
|
2568 |
two terms #m*u and #n*u are replaced by #(m+n)*u
|
paulson@8832
|
2569 |
(where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
|
paulson@8832
|
2570 |
and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
|
paulson@8832
|
2571 |
or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
|
paulson@8736
|
2572 |
|
wenzelm@10003
|
2573 |
* HOL: meson_tac is available (previously in ex/meson.ML); it is a
|
wenzelm@10003
|
2574 |
powerful prover for predicate logic but knows nothing of clasets; see
|
wenzelm@10003
|
2575 |
ex/mesontest.ML and ex/mesontest2.ML for example applications;
|
paulson@9835
|
2576 |
|
wenzelm@8848
|
2577 |
* HOL: new version of "case_tac" subsumes both boolean case split and
|
wenzelm@8440
|
2578 |
"exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
|
wenzelm@8518
|
2579 |
exists, may define val exhaust_tac = case_tac for ad-hoc portability;
|
wenzelm@8440
|
2580 |
|
wenzelm@8848
|
2581 |
* HOL: simplification no longer dives into case-expressions: only the
|
wenzelm@10129
|
2582 |
selector expression is simplified, but not the remaining arms; to
|
wenzelm@10129
|
2583 |
enable full simplification of case-expressions for datatype t, you may
|
wenzelm@10129
|
2584 |
remove t.weak_case_cong from the simpset, either globally (Delcongs
|
wenzelm@10129
|
2585 |
[thm"t.weak_case_cong"];) or locally (delcongs [...]).
|
nipkow@8603
|
2586 |
|
wenzelm@8848
|
2587 |
* HOL/recdef: the recursion equations generated by 'recdef' for
|
wenzelm@8848
|
2588 |
function 'f' are now called f.simps instead of f.rules; if all
|
wenzelm@8848
|
2589 |
termination conditions are proved automatically, these simplification
|
wenzelm@8848
|
2590 |
rules are added to the simpset, as in primrec; rules may be named
|
wenzelm@8848
|
2591 |
individually as well, resulting in a separate list of theorems for
|
wenzelm@8848
|
2592 |
each equation;
|
wenzelm@8848
|
2593 |
|
wenzelm@9489
|
2594 |
* HOL/While is a new theory that provides a while-combinator. It
|
wenzelm@9489
|
2595 |
permits the definition of tail-recursive functions without the
|
wenzelm@9489
|
2596 |
provision of a termination measure. The latter is necessary once the
|
wenzelm@9489
|
2597 |
invariant proof rule for while is applied.
|
nipkow@9457
|
2598 |
|
wenzelm@10003
|
2599 |
* HOL: new (overloaded) notation for the set of elements below/above
|
wenzelm@10003
|
2600 |
some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
|
nipkow@8925
|
2601 |
|
wenzelm@8848
|
2602 |
* HOL: theorems impI, allI, ballI bound as "strip";
|
wenzelm@8848
|
2603 |
|
wenzelm@10003
|
2604 |
* HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
|
nipkow@9746
|
2605 |
induct_tac th "x1 ... xn" expects th to have a conclusion of the form
|
nipkow@9746
|
2606 |
P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
|
nipkow@9746
|
2607 |
|
wenzelm@10003
|
2608 |
* HOL/Real: "rabs" replaced by overloaded "abs" function;
|
nipkow@9737
|
2609 |
|
wenzelm@10003
|
2610 |
* HOL: theory Sexp now in HOL/Induct examples (it used to be part of
|
wenzelm@10003
|
2611 |
main HOL, but was unused);
|
nipkow@8626
|
2612 |
|
wenzelm@10003
|
2613 |
* HOL: fewer consts declared as global (e.g. have to refer to
|
wenzelm@10003
|
2614 |
"Lfp.lfp" instead of "lfp" internally; affects ML packages only);
|
wenzelm@8887
|
2615 |
|
wenzelm@10003
|
2616 |
* HOL: tuned AST representation of nested pairs, avoiding bogus output
|
wenzelm@10003
|
2617 |
in case of overlap with user translations (e.g. judgements over
|
wenzelm@10003
|
2618 |
tuples); (note that the underlying logical represenation is still
|
wenzelm@10003
|
2619 |
bogus);
|
wenzelm@9349
|
2620 |
|
nipkow@8412
|
2621 |
|
paulson@9542
|
2622 |
*** ZF ***
|
paulson@9542
|
2623 |
|
wenzelm@10003
|
2624 |
* ZF: simplification automatically cancels common terms in arithmetic
|
wenzelm@10003
|
2625 |
expressions over nat and int;
|
paulson@9542
|
2626 |
|
wenzelm@10003
|
2627 |
* ZF: new treatment of nat to minimize type-checking: all operators
|
wenzelm@10003
|
2628 |
coerce their operands to a natural number using the function natify,
|
wenzelm@10003
|
2629 |
making the algebraic laws unconditional;
|
paulson@9542
|
2630 |
|
wenzelm@10003
|
2631 |
* ZF: as above, for int: operators coerce their operands to an integer
|
wenzelm@10003
|
2632 |
using the function intify;
|
paulson@9542
|
2633 |
|
wenzelm@10003
|
2634 |
* ZF: the integer library now contains many of the usual laws for the
|
wenzelm@10003
|
2635 |
orderings, including $<=, and monotonicity laws for $+ and $*;
|
paulson@9542
|
2636 |
|
wenzelm@10003
|
2637 |
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
|
wenzelm@10003
|
2638 |
simplification;
|
paulson@9542
|
2639 |
|
wenzelm@10003
|
2640 |
* FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
|
wenzelm@10003
|
2641 |
to the simplifier and classical reasoner simultaneously;
|
paulson@9388
|
2642 |
|
paulson@9388
|
2643 |
|
wenzelm@8358
|
2644 |
*** General ***
|
wenzelm@8358
|
2645 |
|
wenzelm@10003
|
2646 |
* Provers: blast_tac now handles actual object-logic rules as
|
wenzelm@10003
|
2647 |
assumptions; note that auto_tac uses blast_tac internally as well;
|
wenzelm@10003
|
2648 |
|
wenzelm@10003
|
2649 |
* Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
|
wenzelm@10003
|
2650 |
outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
|
wenzelm@10003
|
2651 |
|
wenzelm@9941
|
2652 |
* Provers: delrules now handles destruct rules as well (no longer need
|
wenzelm@9941
|
2653 |
explicit make_elim);
|
wenzelm@9941
|
2654 |
|
wenzelm@10003
|
2655 |
* Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
|
wenzelm@10003
|
2656 |
[| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
|
wenzelm@10003
|
2657 |
use instead the strong form,
|
wenzelm@10003
|
2658 |
[| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
|
wenzelm@10003
|
2659 |
in HOL, FOL and ZF the function cla_make_elim will create such rules
|
wenzelm@10003
|
2660 |
from destruct-rules;
|
wenzelm@9489
|
2661 |
|
wenzelm@9709
|
2662 |
* Provers: Simplifier.easy_setup provides a fast path to basic
|
wenzelm@9709
|
2663 |
Simplifier setup for new object-logics;
|
wenzelm@9349
|
2664 |
|
wenzelm@9709
|
2665 |
* Pure: AST translation rules no longer require constant head on LHS;
|
wenzelm@8729
|
2666 |
|
wenzelm@9709
|
2667 |
* Pure: improved name spaces: ambiguous output is qualified; support
|
wenzelm@9709
|
2668 |
for hiding of names;
|
wenzelm@8358
|
2669 |
|
wenzelm@10003
|
2670 |
* system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
|
wenzelm@10003
|
2671 |
XSYMBOL_HOME; no longer need to do manual configuration in most
|
wenzelm@10003
|
2672 |
situations;
|
wenzelm@10003
|
2673 |
|
wenzelm@9709
|
2674 |
* system: compression of ML heaps images may now be controlled via -c
|
wenzelm@9709
|
2675 |
option of isabelle and isatool usedir (currently only observed by
|
wenzelm@9709
|
2676 |
Poly/ML);
|
wenzelm@9709
|
2677 |
|
wenzelm@9981
|
2678 |
* system: isatool installfonts may handle X-Symbol fonts as well (very
|
wenzelm@9981
|
2679 |
useful for remote X11);
|
wenzelm@9981
|
2680 |
|
wenzelm@9709
|
2681 |
* system: provide TAGS file for Isabelle sources;
|
wenzelm@9052
|
2682 |
|
wenzelm@9288
|
2683 |
* ML: infix 'OF' is a version of 'MRS' with more appropriate argument
|
wenzelm@9288
|
2684 |
order;
|
wenzelm@9288
|
2685 |
|
wenzelm@8994
|
2686 |
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
|
wenzelm@8994
|
2687 |
timing flag supersedes proof_timing and Toplevel.trace;
|
wenzelm@8994
|
2688 |
|
wenzelm@10003
|
2689 |
* ML: new combinators |>> and |>>> for incremental transformations
|
wenzelm@10003
|
2690 |
with secondary results (e.g. certain theory extensions):
|
wenzelm@10003
|
2691 |
|
wenzelm@9330
|
2692 |
* ML: PureThy.add_defs gets additional argument to indicate potential
|
wenzelm@9330
|
2693 |
overloading (usually false);
|
wenzelm@9330
|
2694 |
|
wenzelm@10003
|
2695 |
* ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
|
wenzelm@10003
|
2696 |
results;
|
wenzelm@8440
|
2697 |
|
wenzelm@8358
|
2698 |
|
wenzelm@8015
|
2699 |
|
wenzelm@7986
|
2700 |
New in Isabelle99 (October 1999)
|
wenzelm@7986
|
2701 |
--------------------------------
|
oheimb@4649
|
2702 |
|
paulson@5931
|
2703 |
*** Overview of INCOMPATIBILITIES (see below for more details) ***
|
paulson@5931
|
2704 |
|
paulson@6922
|
2705 |
* HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
|
paulson@6922
|
2706 |
are no longer simplified. (This allows the simplifier to unfold recursive
|
paulson@6922
|
2707 |
functional programs.) To restore the old behaviour, declare
|
wenzelm@7215
|
2708 |
|
wenzelm@7215
|
2709 |
Delcongs [if_weak_cong];
|
paulson@6922
|
2710 |
|
wenzelm@6269
|
2711 |
* HOL: Removed the obsolete syntax "Compl A"; use -A for set
|
wenzelm@6269
|
2712 |
complement;
|
paulson@5931
|
2713 |
|
wenzelm@6269
|
2714 |
* HOL: the predicate "inj" is now defined by translation to "inj_on";
|
paulson@6174
|
2715 |
|
berghofe@7847
|
2716 |
* HOL/datatype: mutual_induct_tac no longer exists --
|
berghofe@7847
|
2717 |
use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
|
berghofe@7847
|
2718 |
|
wenzelm@6386
|
2719 |
* HOL/typedef: fixed type inference for representing set; type
|
wenzelm@6386
|
2720 |
arguments now have to occur explicitly on the rhs as type constraints;
|
wenzelm@6386
|
2721 |
|
wenzelm@6269
|
2722 |
* ZF: The con_defs part of an inductive definition may no longer refer
|
wenzelm@6269
|
2723 |
to constants declared in the same theory;
|
nipkow@6057
|
2724 |
|
wenzelm@6269
|
2725 |
* HOL, ZF: the function mk_cases, generated by the inductive
|
wenzelm@6269
|
2726 |
definition package, has lost an argument. To simplify its result, it
|
wenzelm@6269
|
2727 |
uses the default simpset instead of a supplied list of theorems.
|
paulson@6141
|
2728 |
|
wenzelm@7215
|
2729 |
* HOL/List: the constructors of type list are now Nil and Cons;
|
wenzelm@7215
|
2730 |
|
nipkow@7619
|
2731 |
* Simplifier: the type of the infix ML functions
|
wenzelm@8729
|
2732 |
setSSolver addSSolver setSolver addSolver
|
nipkow@7619
|
2733 |
is now simpset * solver -> simpset where `solver' is a new abstract type
|
nipkow@7619
|
2734 |
for packaging solvers. A solver is created via
|
wenzelm@8729
|
2735 |
mk_solver: string -> (thm list -> int -> tactic) -> solver
|
nipkow@7619
|
2736 |
where the string argument is only a comment.
|
nipkow@6057
|
2737 |
|
wenzelm@7647
|
2738 |
|
paulson@6069
|
2739 |
*** Proof tools ***
|
paulson@6069
|
2740 |
|
wenzelm@6343
|
2741 |
* Provers/Arith/fast_lin_arith.ML contains a functor for creating a
|
wenzelm@6343
|
2742 |
decision procedure for linear arithmetic. Currently it is used for
|
wenzelm@7593
|
2743 |
types `nat', `int', and `real' in HOL (see below); it can, should and
|
wenzelm@7593
|
2744 |
will be instantiated for other types and logics as well.
|
paulson@6069
|
2745 |
|
nipkow@7324
|
2746 |
* The simplifier now accepts rewrite rules with flexible heads, eg
|
nipkow@7324
|
2747 |
hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
|
nipkow@7324
|
2748 |
They are applied like any rule with a non-pattern lhs, i.e. by first-order
|
nipkow@7324
|
2749 |
matching.
|
paulson@6069
|
2750 |
|
wenzelm@7593
|
2751 |
|
paulson@6014
|
2752 |
*** General ***
|
paulson@6014
|
2753 |
|
wenzelm@7986
|
2754 |
* New Isabelle/Isar subsystem provides an alternative to traditional
|
wenzelm@7215
|
2755 |
tactical theorem proving; together with the ProofGeneral/isar user
|
wenzelm@7215
|
2756 |
interface it offers an interactive environment for developing human
|
wenzelm@7215
|
2757 |
readable proof documents (Isar == Intelligible semi-automated
|
wenzelm@7886
|
2758 |
reasoning); for further information see isatool doc isar-ref,
|
wenzelm@7986
|
2759 |
src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
|
wenzelm@7886
|
2760 |
|
wenzelm@9612
|
2761 |
* improved and simplified presentation of theories: better HTML markup
|
wenzelm@9612
|
2762 |
(including colors), graph views in several sizes; isatool usedir now
|
wenzelm@9612
|
2763 |
provides a proper interface for user theories (via -P option); actual
|
wenzelm@9612
|
2764 |
document preparation based on (PDF)LaTeX is available as well (for
|
wenzelm@9612
|
2765 |
new-style theories only); see isatool doc system for more information;
|
wenzelm@7215
|
2766 |
|
wenzelm@7252
|
2767 |
* native support for Proof General, both for classic Isabelle and
|
wenzelm@7986
|
2768 |
Isabelle/Isar;
|
wenzelm@7215
|
2769 |
|
wenzelm@7791
|
2770 |
* ML function thm_deps visualizes dependencies of theorems and lemmas,
|
wenzelm@7791
|
2771 |
using the graph browser tool;
|
wenzelm@7791
|
2772 |
|
wenzelm@6751
|
2773 |
* Isabelle manuals now also available as PDF;
|
wenzelm@6751
|
2774 |
|
wenzelm@6449
|
2775 |
* theory loader rewritten from scratch (may not be fully
|
wenzelm@6449
|
2776 |
bug-compatible); old loadpath variable has been replaced by show_path,
|
wenzelm@6671
|
2777 |
add_path, del_path, reset_path functions; new operations such as
|
wenzelm@7593
|
2778 |
update_thy, touch_thy, remove_thy, use/update_thy_only (see also
|
wenzelm@7593
|
2779 |
isatool doc ref);
|
wenzelm@6449
|
2780 |
|
wenzelm@7215
|
2781 |
* improved isatool install: option -k creates KDE application icon,
|
wenzelm@7215
|
2782 |
option -p DIR installs standalone binaries;
|
wenzelm@7215
|
2783 |
|
wenzelm@7215
|
2784 |
* added ML_PLATFORM setting (useful for cross-platform installations);
|
wenzelm@7215
|
2785 |
more robust handling of platform specific ML images for SML/NJ;
|
wenzelm@7215
|
2786 |
|
wenzelm@7886
|
2787 |
* the settings environment is now statically scoped, i.e. it is never
|
wenzelm@7986
|
2788 |
created again in sub-processes invoked from isabelle, isatool, or
|
wenzelm@7886
|
2789 |
Isabelle;
|
wenzelm@7886
|
2790 |
|
wenzelm@7215
|
2791 |
* path element specification '~~' refers to '$ISABELLE_HOME';
|
wenzelm@7215
|
2792 |
|
wenzelm@6343
|
2793 |
* in locales, the "assumes" and "defines" parts may be omitted if
|
wenzelm@6343
|
2794 |
empty;
|
wenzelm@5973
|
2795 |
|
wenzelm@6269
|
2796 |
* new print_mode "xsymbols" for extended symbol support (e.g. genuine
|
wenzelm@6269
|
2797 |
long arrows);
|
wenzelm@6259
|
2798 |
|
wenzelm@6343
|
2799 |
* new print_mode "HTML";
|
wenzelm@6343
|
2800 |
|
wenzelm@6343
|
2801 |
* new flag show_tags controls display of tags of theorems (which are
|
wenzelm@6343
|
2802 |
basically just comments that may be attached by some tools);
|
wenzelm@6343
|
2803 |
|
wenzelm@6461
|
2804 |
* Isamode 2.6 requires patch to accomodate change of Isabelle font
|
wenzelm@6461
|
2805 |
mode and goal output format:
|
wenzelm@6461
|
2806 |
|
wenzelm@6461
|
2807 |
diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
|
wenzelm@6461
|
2808 |
244c244
|
wenzelm@6461
|
2809 |
< (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
|
wenzelm@6461
|
2810 |
---
|
wenzelm@6533
|
2811 |
> (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
|
wenzelm@6461
|
2812 |
diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
|
wenzelm@6461
|
2813 |
181c181
|
wenzelm@6461
|
2814 |
< (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
|
wenzelm@6461
|
2815 |
---
|
wenzelm@6461
|
2816 |
> (defconst proofstate-proofstart-regexp "^Level [0-9]+"
|
wenzelm@6461
|
2817 |
|
wenzelm@7450
|
2818 |
* function bind_thms stores lists of theorems (cf. bind_thm);
|
wenzelm@7450
|
2819 |
|
wenzelm@7593
|
2820 |
* new shorthand tactics ftac, eatac, datac, fatac;
|
wenzelm@7593
|
2821 |
|
wenzelm@7593
|
2822 |
* qed (and friends) now accept "" as result name; in that case the
|
wenzelm@7986
|
2823 |
theorem is not stored, but proper checks and presentation of the
|
wenzelm@7986
|
2824 |
result still apply;
|
wenzelm@7593
|
2825 |
|
wenzelm@7805
|
2826 |
* theorem database now also indexes constants "Trueprop", "all",
|
wenzelm@7805
|
2827 |
"==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
|
wenzelm@7805
|
2828 |
|
oheimb@6028
|
2829 |
|
nipkow@6057
|
2830 |
*** HOL ***
|
nipkow@6057
|
2831 |
|
wenzelm@7215
|
2832 |
** HOL arithmetic **
|
wenzelm@7215
|
2833 |
|
wenzelm@6343
|
2834 |
* There are now decision procedures for linear arithmetic over nat and
|
wenzelm@6343
|
2835 |
int:
|
nipkow@6131
|
2836 |
|
wenzelm@6343
|
2837 |
1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
|
wenzelm@6343
|
2838 |
`+', `-', `Suc', `min', `max' and numerical constants; other subterms
|
wenzelm@6343
|
2839 |
are treated as atomic; subformulae not involving type `nat' or `int'
|
wenzelm@6343
|
2840 |
are ignored; quantified subformulae are ignored unless they are
|
wenzelm@6343
|
2841 |
positive universal or negative existential. The tactic has to be
|
wenzelm@6343
|
2842 |
invoked by hand and can be a little bit slow. In particular, the
|
wenzelm@6343
|
2843 |
running time is exponential in the number of occurrences of `min' and
|
wenzelm@6343
|
2844 |
`max', and `-' on `nat'.
|
nipkow@6131
|
2845 |
|
wenzelm@6343
|
2846 |
2. fast_arith_tac is a cut-down version of arith_tac: it only takes
|
wenzelm@6343
|
2847 |
(negated) (in)equalities among the premises and the conclusion into
|
wenzelm@6343
|
2848 |
account (i.e. no compound formulae) and does not know about `min' and
|
wenzelm@6343
|
2849 |
`max', and `-' on `nat'. It is fast and is used automatically by the
|
wenzelm@6343
|
2850 |
simplifier.
|
nipkow@6131
|
2851 |
|
wenzelm@6343
|
2852 |
NB: At the moment, these decision procedures do not cope with mixed
|
wenzelm@6343
|
2853 |
nat/int formulae where the two parts interact, such as `m < n ==>
|
wenzelm@6343
|
2854 |
int(m) < int(n)'.
|
oheimb@6028
|
2855 |
|
wenzelm@7215
|
2856 |
* HOL/Numeral provides a generic theory of numerals (encoded
|
wenzelm@7313
|
2857 |
efficiently as bit strings); setup for types nat/int/real is in place;
|
wenzelm@7215
|
2858 |
INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
|
wenzelm@7215
|
2859 |
int, existing theories and proof scripts may require a few additional
|
wenzelm@7215
|
2860 |
type constraints;
|
paulson@7157
|
2861 |
|
wenzelm@7215
|
2862 |
* integer division and remainder can now be performed on constant
|
wenzelm@7215
|
2863 |
arguments;
|
paulson@6922
|
2864 |
|
wenzelm@7215
|
2865 |
* many properties of integer multiplication, division and remainder
|
wenzelm@7215
|
2866 |
are now available;
|
wenzelm@7215
|
2867 |
|
paulson@7287
|
2868 |
* An interface to the Stanford Validity Checker (SVC) is available through the
|
paulson@7287
|
2869 |
tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
|
paulson@7287
|
2870 |
are proved automatically. SVC must be installed separately, and its results
|
paulson@7287
|
2871 |
must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
|
paulson@7287
|
2872 |
invocation of the underlying oracle). For SVC see
|
paulson@7444
|
2873 |
http://verify.stanford.edu/SVC
|
paulson@6922
|
2874 |
|
wenzelm@7125
|
2875 |
* IsaMakefile: the HOL-Real target now builds an actual image;
|
wenzelm@7125
|
2876 |
|
wenzelm@7215
|
2877 |
|
wenzelm@7215
|
2878 |
** HOL misc **
|
wenzelm@7215
|
2879 |
|
wenzelm@7595
|
2880 |
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
|
wenzelm@7595
|
2881 |
(in Isabelle/Isar) -- by Gertrud Bauer;
|
wenzelm@7595
|
2882 |
|
wenzelm@7691
|
2883 |
* HOL/BCV: generic model of bytecode verification, i.e. data-flow
|
wenzelm@7691
|
2884 |
analysis for assembly languages with subtypes;
|
wenzelm@7691
|
2885 |
|
wenzelm@6278
|
2886 |
* HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
|
wenzelm@6278
|
2887 |
-- avoids syntactic ambiguities and treats state, transition, and
|
wenzelm@6278
|
2888 |
temporal levels more uniformly; introduces INCOMPATIBILITIES due to
|
wenzelm@6278
|
2889 |
changed syntax and (many) tactics;
|
wenzelm@6278
|
2890 |
|
wenzelm@7791
|
2891 |
* HOL/inductive: Now also handles more general introduction rules such
|
wenzelm@7791
|
2892 |
as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
|
wenzelm@7791
|
2893 |
theorems are now maintained within the theory (maintained via the
|
wenzelm@7791
|
2894 |
"mono" attribute);
|
berghofe@7780
|
2895 |
|
wenzelm@7238
|
2896 |
* HOL/datatype: Now also handles arbitrarily branching datatypes
|
wenzelm@7238
|
2897 |
(using function types) such as
|
wenzelm@7238
|
2898 |
|
wenzelm@7238
|
2899 |
datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
|
berghofe@7047
|
2900 |
|
wenzelm@7326
|
2901 |
* HOL/record: record_simproc (part of the default simpset) takes care
|
wenzelm@7326
|
2902 |
of selectors applied to updated records; record_split_tac is no longer
|
wenzelm@7327
|
2903 |
part of the default claset; update_defs may now be removed from the
|
wenzelm@7327
|
2904 |
simpset in many cases; COMPATIBILITY: old behavior achieved by
|
wenzelm@7326
|
2905 |
|
wenzelm@7326
|
2906 |
claset_ref () := claset() addSWrapper record_split_wrapper;
|
wenzelm@7326
|
2907 |
Delsimprocs [record_simproc]
|
wenzelm@7326
|
2908 |
|
wenzelm@6386
|
2909 |
* HOL/typedef: fixed type inference for representing set; type
|
wenzelm@6386
|
2910 |
arguments now have to occur explicitly on the rhs as type constraints;
|
wenzelm@6386
|
2911 |
|
paulson@7287
|
2912 |
* HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
|
paulson@7287
|
2913 |
names rather than an ML expression;
|
paulson@7287
|
2914 |
|
paulson@7287
|
2915 |
* HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
|
paulson@7287
|
2916 |
supplied later. Program schemes can be defined, such as
|
paulson@7287
|
2917 |
"While B C s = (if B s then While B C (C s) else s)"
|
paulson@7287
|
2918 |
where the well-founded relation can be chosen after B and C have been given.
|
wenzelm@6563
|
2919 |
|
wenzelm@7215
|
2920 |
* HOL/List: the constructors of type list are now Nil and Cons;
|
wenzelm@7215
|
2921 |
INCOMPATIBILITY: while [] and infix # syntax is still there, of
|
wenzelm@7215
|
2922 |
course, ML tools referring to List.list.op # etc. have to be adapted;
|
wenzelm@7215
|
2923 |
|
wenzelm@7238
|
2924 |
* HOL_quantifiers flag superseded by "HOL" print mode, which is
|
wenzelm@7238
|
2925 |
disabled by default; run isabelle with option -m HOL to get back to
|
wenzelm@7238
|
2926 |
the original Gordon/HOL-style output;
|
wenzelm@7238
|
2927 |
|
wenzelm@7238
|
2928 |
* HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
|
wenzelm@7238
|
2929 |
ALL x<=y. P, EX x<y. P, EX x<=y. P;
|
wenzelm@7238
|
2930 |
|
wenzelm@7238
|
2931 |
* HOL basic syntax simplified (more orthogonal): all variants of
|
wenzelm@7238
|
2932 |
All/Ex now support plain / symbolic / HOL notation; plain syntax for
|
wenzelm@7238
|
2933 |
Eps operator is provided as well: "SOME x. P[x]";
|
wenzelm@7238
|
2934 |
|
berghofe@7320
|
2935 |
* HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
|
wenzelm@7261
|
2936 |
|
wenzelm@7280
|
2937 |
* HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
|
wenzelm@7280
|
2938 |
thus available for user theories;
|
wenzelm@7280
|
2939 |
|
wenzelm@7300
|
2940 |
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
|
wenzelm@7300
|
2941 |
HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
|
wenzelm@7300
|
2942 |
time;
|
wenzelm@7300
|
2943 |
|
wenzelm@7986
|
2944 |
* HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
|
wenzelm@7986
|
2945 |
several times and then mp;
|
oheimb@7492
|
2946 |
|
wenzelm@7215
|
2947 |
|
paulson@7113
|
2948 |
*** LK ***
|
paulson@7113
|
2949 |
|
wenzelm@7215
|
2950 |
* the notation <<...>> is now available as a notation for sequences of
|
wenzelm@7215
|
2951 |
formulas;
|
paulson@7113
|
2952 |
|
paulson@7113
|
2953 |
* the simplifier is now installed
|
paulson@7113
|
2954 |
|
wenzelm@8729
|
2955 |
* the axiom system has been generalized (thanks to Soren Heilmann)
|
paulson@7113
|
2956 |
|
paulson@7113
|
2957 |
* the classical reasoner now has a default rule database
|
paulson@7113
|
2958 |
|
paulson@7113
|
2959 |
|
paulson@6064
|
2960 |
*** ZF ***
|
paulson@6064
|
2961 |
|
paulson@6064
|
2962 |
* new primrec section allows primitive recursive functions to be given
|
wenzelm@6269
|
2963 |
directly (as in HOL) over datatypes and the natural numbers;
|
paulson@6064
|
2964 |
|
wenzelm@6269
|
2965 |
* new tactics induct_tac and exhaust_tac for induction (or case
|
wenzelm@6269
|
2966 |
analysis) over datatypes and the natural numbers;
|
paulson@6064
|
2967 |
|
paulson@6064
|
2968 |
* the datatype declaration of type T now defines the recursor T_rec;
|
paulson@6064
|
2969 |
|
paulson@6141
|
2970 |
* simplification automatically does freeness reasoning for datatype
|
wenzelm@6269
|
2971 |
constructors;
|
paulson@6141
|
2972 |
|
wenzelm@6269
|
2973 |
* automatic type-inference, with AddTCs command to insert new
|
wenzelm@6269
|
2974 |
type-checking rules;
|
paulson@6155
|
2975 |
|
wenzelm@6269
|
2976 |
* datatype introduction rules are now added as Safe Introduction rules
|
wenzelm@6269
|
2977 |
to the claset;
|
paulson@6155
|
2978 |
|
wenzelm@6269
|
2979 |
* the syntax "if P then x else y" is now available in addition to
|
wenzelm@6269
|
2980 |
if(P,x,y);
|
wenzelm@6269
|
2981 |
|
paulson@6069
|
2982 |
|
wenzelm@6343
|
2983 |
*** Internal programming interfaces ***
|
wenzelm@6343
|
2984 |
|
wenzelm@7919
|
2985 |
* tuned simplifier trace output; new flag debug_simp;
|
wenzelm@7919
|
2986 |
|
wenzelm@7420
|
2987 |
* structures Vartab / Termtab (instances of TableFun) offer efficient
|
wenzelm@7420
|
2988 |
tables indexed by indexname_ord / term_ord (compatible with aconv);
|
wenzelm@7420
|
2989 |
|
wenzelm@6386
|
2990 |
* AxClass.axclass_tac lost the theory argument;
|
wenzelm@6386
|
2991 |
|
wenzelm@6343
|
2992 |
* tuned current_goals_markers semantics: begin / end goal avoids
|
wenzelm@6343
|
2993 |
printing empty lines;
|
wenzelm@6343
|
2994 |
|
wenzelm@6343
|
2995 |
* removed prs and prs_fn hook, which was broken because it did not
|
wenzelm@6343
|
2996 |
include \n in its semantics, forcing writeln to add one
|
wenzelm@6343
|
2997 |
uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
|
wenzelm@6343
|
2998 |
string -> unit if you really want to output text without newline;
|
wenzelm@6343
|
2999 |
|
wenzelm@6343
|
3000 |
* Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
|
wenzelm@6343
|
3001 |
plain output, interface builders may have to enable 'isabelle_font'
|
wenzelm@6343
|
3002 |
mode to get Isabelle font glyphs as before;
|
wenzelm@6343
|
3003 |
|
wenzelm@6343
|
3004 |
* refined token_translation interface; INCOMPATIBILITY: output length
|
wenzelm@6343
|
3005 |
now of type real instead of int;
|
wenzelm@6343
|
3006 |
|
wenzelm@7196
|
3007 |
* theory loader actions may be traced via new ThyInfo.add_hook
|
wenzelm@7196
|
3008 |
interface (see src/Pure/Thy/thy_info.ML); example application: keep
|
wenzelm@7196
|
3009 |
your own database of information attached to *whole* theories -- as
|
wenzelm@7196
|
3010 |
opposed to intra-theory data slots offered via TheoryDataFun;
|
wenzelm@7196
|
3011 |
|
wenzelm@7647
|
3012 |
* proper handling of dangling sort hypotheses (at last!);
|
wenzelm@7647
|
3013 |
Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
|
wenzelm@7647
|
3014 |
extra sort hypotheses that can be witnessed from the type signature;
|
wenzelm@7986
|
3015 |
the force_strip_shyps flag is gone, any remaining shyps are simply
|
wenzelm@7986
|
3016 |
left in the theorem (with a warning issued by strip_shyps_warning);
|
wenzelm@7647
|
3017 |
|
wenzelm@6343
|
3018 |
|
paulson@6064
|
3019 |
|
wenzelm@5781
|
3020 |
New in Isabelle98-1 (October 1998)
|
wenzelm@5781
|
3021 |
----------------------------------
|
wenzelm@5781
|
3022 |
|
wenzelm@5127
|
3023 |
*** Overview of INCOMPATIBILITIES (see below for more details) ***
|
wenzelm@4842
|
3024 |
|
wenzelm@5726
|
3025 |
* several changes of automated proof tools;
|
wenzelm@5207
|
3026 |
|
wenzelm@5726
|
3027 |
* HOL: major changes to the inductive and datatype packages, including
|
wenzelm@5726
|
3028 |
some minor incompatibilities of theory syntax;
|
wenzelm@5373
|
3029 |
|
wenzelm@5726
|
3030 |
* HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
|
wenzelm@5217
|
3031 |
called `inj_on';
|
paulson@5160
|
3032 |
|
nipkow@5275
|
3033 |
* HOL: removed duplicate thms in Arith:
|
nipkow@5275
|
3034 |
less_imp_add_less should be replaced by trans_less_add1
|
nipkow@5275
|
3035 |
le_imp_add_le should be replaced by trans_le_add1
|
paulson@5160
|
3036 |
|
wenzelm@5726
|
3037 |
* HOL: unary minus is now overloaded (new type constraints may be
|
wenzelm@5726
|
3038 |
required);
|
paulson@5490
|
3039 |
|
wenzelm@5726
|
3040 |
* HOL and ZF: unary minus for integers is now #- instead of #~. In
|
wenzelm@5726
|
3041 |
ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
|
wenzelm@5726
|
3042 |
now taken as an integer constant.
|
paulson@5541
|
3043 |
|
wenzelm@5726
|
3044 |
* Pure: ML function 'theory_of' renamed to 'theory';
|
wenzelm@5397
|
3045 |
|
wenzelm@5363
|
3046 |
|
wenzelm@5127
|
3047 |
*** Proof tools ***
|
nipkow@4880
|
3048 |
|
nipkow@5657
|
3049 |
* Simplifier:
|
nipkow@5657
|
3050 |
1. Asm_full_simp_tac is now more aggressive.
|
nipkow@5657
|
3051 |
1. It will sometimes reorient premises if that increases their power to
|
nipkow@5657
|
3052 |
simplify.
|
nipkow@5657
|
3053 |
2. It does no longer proceed strictly from left to right but may also
|
nipkow@5657
|
3054 |
rotate premises to achieve further simplification.
|
nipkow@5657
|
3055 |
For compatibility reasons there is now Asm_lr_simp_tac which is like the
|
nipkow@5657
|
3056 |
old Asm_full_simp_tac in that it does not rotate premises.
|
nipkow@5657
|
3057 |
2. The simplifier now knows a little bit about nat-arithmetic.
|
nipkow@4880
|
3058 |
|
wenzelm@5127
|
3059 |
* Classical reasoner: wrapper mechanism for the classical reasoner now
|
wenzelm@5127
|
3060 |
allows for selected deletion of wrappers, by introduction of names for
|
wenzelm@5127
|
3061 |
wrapper functionals. This implies that addbefore, addSbefore,
|
wenzelm@5127
|
3062 |
addaltern, and addSaltern now take a pair (name, tactic) as argument,
|
wenzelm@5127
|
3063 |
and that adding two tactics with the same name overwrites the first
|
wenzelm@5127
|
3064 |
one (emitting a warning).
|
oheimb@4824
|
3065 |
type wrapper = (int -> tactic) -> (int -> tactic)
|
oheimb@4649
|
3066 |
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
|
oheimb@4824
|
3067 |
addWrapper, addSWrapper: claset * (string * wrapper) -> claset
|
oheimb@4824
|
3068 |
delWrapper, delSWrapper: claset * string -> claset
|
oheimb@4649
|
3069 |
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
|
oheimb@4649
|
3070 |
|
wenzelm@5705
|
3071 |
* Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
|
wenzelm@5726
|
3072 |
semantics; addbefore now affects only the unsafe part of step_tac
|
wenzelm@5726
|
3073 |
etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
|
wenzelm@5726
|
3074 |
FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
|
wenzelm@5726
|
3075 |
by Force_tac;
|
oheimb@5524
|
3076 |
|
wenzelm@5726
|
3077 |
* Classical reasoner: setwrapper to setWrapper and compwrapper to
|
wenzelm@5726
|
3078 |
compWrapper; added safe wrapper (and access functions for it);
|
oheimb@5524
|
3079 |
|
wenzelm@5127
|
3080 |
* HOL/split_all_tac is now much faster and fails if there is nothing
|
wenzelm@5726
|
3081 |
to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
|
wenzelm@5726
|
3082 |
and the names of the automatically generated variables have changed.
|
wenzelm@5726
|
3083 |
split_all_tac has moved within claset() from unsafe wrappers to safe
|
wenzelm@5726
|
3084 |
wrappers, which means that !!-bound variables are split much more
|
wenzelm@5726
|
3085 |
aggressively, and safe_tac and clarify_tac now split such variables.
|
wenzelm@5726
|
3086 |
If this splitting is not appropriate, use delSWrapper "split_all_tac".
|
wenzelm@5726
|
3087 |
Note: the same holds for record_split_tac, which does the job of
|
wenzelm@5726
|
3088 |
split_all_tac for record fields.
|
wenzelm@5127
|
3089 |
|
wenzelm@5726
|
3090 |
* HOL/Simplifier: Rewrite rules for case distinctions can now be added
|
wenzelm@5726
|
3091 |
permanently to the default simpset using Addsplits just like
|
wenzelm@5726
|
3092 |
Addsimps. They can be removed via Delsplits just like
|
wenzelm@5726
|
3093 |
Delsimps. Lower-case versions are also available.
|
wenzelm@5127
|
3094 |
|
wenzelm@5726
|
3095 |
* HOL/Simplifier: The rule split_if is now part of the default
|
wenzelm@5726
|
3096 |
simpset. This means that the simplifier will eliminate all occurrences
|
wenzelm@5726
|
3097 |
of if-then-else in the conclusion of a goal. To prevent this, you can
|
wenzelm@5726
|
3098 |
either remove split_if completely from the default simpset by
|
wenzelm@5726
|
3099 |
`Delsplits [split_if]' or remove it in a specific call of the
|
wenzelm@5726
|
3100 |
simplifier using `... delsplits [split_if]'. You can also add/delete
|
wenzelm@5726
|
3101 |
other case splitting rules to/from the default simpset: every datatype
|
wenzelm@5726
|
3102 |
generates suitable rules `split_t_case' and `split_t_case_asm' (where
|
wenzelm@5726
|
3103 |
t is the name of the datatype).
|
wenzelm@5127
|
3104 |
|
wenzelm@5726
|
3105 |
* Classical reasoner / Simplifier combination: new force_tac (and
|
wenzelm@5127
|
3106 |
derivatives Force_tac, force) combines rewriting and classical
|
wenzelm@5127
|
3107 |
reasoning (and whatever other tools) similarly to auto_tac, but is
|
wenzelm@5726
|
3108 |
aimed to solve the given subgoal completely.
|
wenzelm@5127
|
3109 |
|
wenzelm@5127
|
3110 |
|
wenzelm@5127
|
3111 |
*** General ***
|
wenzelm@5127
|
3112 |
|
wenzelm@5217
|
3113 |
* new top-level commands `Goal' and `Goalw' that improve upon `goal'
|
wenzelm@5127
|
3114 |
and `goalw': the theory is no longer needed as an explicit argument -
|
wenzelm@5127
|
3115 |
the current theory context is used; assumptions are no longer returned
|
wenzelm@5127
|
3116 |
at the ML-level unless one of them starts with ==> or !!; it is
|
wenzelm@5217
|
3117 |
recommended to convert to these new commands using isatool fixgoal
|
wenzelm@5217
|
3118 |
(backup your sources first!);
|
wenzelm@4842
|
3119 |
|
wenzelm@5217
|
3120 |
* new top-level commands 'thm' and 'thms' for retrieving theorems from
|
wenzelm@5207
|
3121 |
the current theory context, and 'theory' to lookup stored theories;
|
paulson@4806
|
3122 |
|
paulson@5722
|
3123 |
* new theory section 'locale' for declaring constants, assumptions and
|
paulson@5722
|
3124 |
definitions that have local scope;
|
paulson@5722
|
3125 |
|
wenzelm@5127
|
3126 |
* new theory section 'nonterminals' for purely syntactic types;
|
wenzelm@4858
|
3127 |
|
wenzelm@5127
|
3128 |
* new theory section 'setup' for generic ML setup functions
|
wenzelm@5127
|
3129 |
(e.g. package initialization);
|
wenzelm@4869
|
3130 |
|
wenzelm@5131
|
3131 |
* the distribution now includes Isabelle icons: see
|
wenzelm@5131
|
3132 |
lib/logo/isabelle-{small,tiny}.xpm;
|
wenzelm@5131
|
3133 |
|
wenzelm@5363
|
3134 |
* isatool install - install binaries with absolute references to
|
wenzelm@5363
|
3135 |
ISABELLE_HOME/bin;
|
wenzelm@5363
|
3136 |
|
wenzelm@5572
|
3137 |
* isatool logo -- create instances of the Isabelle logo (as EPS);
|
wenzelm@5572
|
3138 |
|
wenzelm@5407
|
3139 |
* print mode 'emacs' reserved for Isamode;
|
wenzelm@5407
|
3140 |
|
wenzelm@5726
|
3141 |
* support multiple print (ast) translations per constant name;
|
wenzelm@5726
|
3142 |
|
wenzelm@6925
|
3143 |
* theorems involving oracles are now printed with a suffixed [!];
|
wenzelm@6925
|
3144 |
|
wenzelm@4711
|
3145 |
|
paulson@4661
|
3146 |
*** HOL ***
|
paulson@4661
|
3147 |
|
wenzelm@5710
|
3148 |
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
|
nipkow@5709
|
3149 |
|
wenzelm@5217
|
3150 |
* HOL/inductive package reorganized and improved: now supports mutual
|
paulson@5267
|
3151 |
definitions such as
|
berghofe@5214
|
3152 |
|
wenzelm@5217
|
3153 |
inductive EVEN ODD
|
wenzelm@5217
|
3154 |
intrs
|
wenzelm@5217
|
3155 |
null "0 : EVEN"
|
wenzelm@5217
|
3156 |
oddI "n : EVEN ==> Suc n : ODD"
|
wenzelm@5217
|
3157 |
evenI "n : ODD ==> Suc n : EVEN"
|
berghofe@5214
|
3158 |
|
wenzelm@5217
|
3159 |
new theorem list "elims" contains an elimination rule for each of the
|
wenzelm@5217
|
3160 |
recursive sets; inductive definitions now handle disjunctive premises
|
wenzelm@5217
|
3161 |
correctly (also ZF);
|
berghofe@5214
|
3162 |
|
wenzelm@5217
|
3163 |
INCOMPATIBILITIES: requires Inductive as an ancestor; component
|
wenzelm@5217
|
3164 |
"mutual_induct" no longer exists - the induction rule is always
|
wenzelm@5217
|
3165 |
contained in "induct";
|
berghofe@5214
|
3166 |
|
berghofe@5214
|
3167 |
|
wenzelm@5217
|
3168 |
* HOL/datatype package re-implemented and greatly improved: now
|
paulson@5267
|
3169 |
supports mutually recursive datatypes such as
|
berghofe@5214
|
3170 |
|
wenzelm@5217
|
3171 |
datatype
|
wenzelm@5217
|
3172 |
'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
|
wenzelm@5217
|
3173 |
| SUM ('a aexp) ('a aexp)
|
wenzelm@5217
|
3174 |
| DIFF ('a aexp) ('a aexp)
|
wenzelm@5217
|
3175 |
| NUM 'a
|
wenzelm@5217
|
3176 |
and
|
wenzelm@5217
|
3177 |
'a bexp = LESS ('a aexp) ('a aexp)
|
wenzelm@5217
|
3178 |
| AND ('a bexp) ('a bexp)
|
wenzelm@5217
|
3179 |
| OR ('a bexp) ('a bexp)
|
wenzelm@5217
|
3180 |
|
paulson@5267
|
3181 |
as well as indirectly recursive datatypes such as
|
wenzelm@5217
|
3182 |
|
wenzelm@5217
|
3183 |
datatype
|
wenzelm@5217
|
3184 |
('a, 'b) term = Var 'a
|
wenzelm@5217
|
3185 |
| App 'b ((('a, 'b) term) list)
|
wenzelm@5217
|
3186 |
|
wenzelm@5217
|
3187 |
The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
|
wenzelm@5217
|
3188 |
induction on mutually / indirectly recursive datatypes.
|
wenzelm@5217
|
3189 |
|
wenzelm@5217
|
3190 |
Primrec equations are now stored in theory and can be accessed via
|
wenzelm@5217
|
3191 |
<function_name>.simps.
|
wenzelm@5217
|
3192 |
|
wenzelm@5217
|
3193 |
INCOMPATIBILITIES:
|
wenzelm@5217
|
3194 |
|
wenzelm@5217
|
3195 |
- Theories using datatypes must now have theory Datatype as an
|
wenzelm@5217
|
3196 |
ancestor.
|
wenzelm@5217
|
3197 |
- The specific <typename>.induct_tac no longer exists - use the
|
wenzelm@5217
|
3198 |
generic induct_tac instead.
|
berghofe@5226
|
3199 |
- natE has been renamed to nat.exhaust - use exhaust_tac
|
wenzelm@5217
|
3200 |
instead of res_inst_tac ... natE. Note that the variable
|
berghofe@5226
|
3201 |
names in nat.exhaust differ from the names in natE, this
|
wenzelm@5217
|
3202 |
may cause some "fragile" proofs to fail.
|
wenzelm@5217
|
3203 |
- The theorems split_<typename>_case and split_<typename>_case_asm
|
wenzelm@5217
|
3204 |
have been renamed to <typename>.split and <typename>.split_asm.
|
wenzelm@5217
|
3205 |
- Since default sorts of type variables are now handled correctly,
|
wenzelm@5217
|
3206 |
some datatype definitions may have to be annotated with explicit
|
wenzelm@5217
|
3207 |
sort constraints.
|
wenzelm@5217
|
3208 |
- Primrec definitions no longer require function name and type
|
wenzelm@5217
|
3209 |
of recursive argument.
|
wenzelm@5217
|
3210 |
|
wenzelm@5217
|
3211 |
Consider using isatool fixdatatype to adapt your theories and proof
|
wenzelm@5217
|
3212 |
scripts to the new package (backup your sources first!).
|
wenzelm@5217
|
3213 |
|
wenzelm@5217
|
3214 |
|
wenzelm@5726
|
3215 |
* HOL/record package: considerably improved implementation; now
|
wenzelm@5726
|
3216 |
includes concrete syntax for record types, terms, updates; theorems
|
wenzelm@5726
|
3217 |
for surjective pairing and splitting !!-bound record variables; proof
|
wenzelm@5726
|
3218 |
support is as follows:
|
wenzelm@5726
|
3219 |
|
wenzelm@5726
|
3220 |
1) standard conversions (selectors or updates applied to record
|
wenzelm@5726
|
3221 |
constructor terms) are part of the standard simpset;
|
wenzelm@5726
|
3222 |
|
wenzelm@5726
|
3223 |
2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
|
wenzelm@5726
|
3224 |
made part of standard simpset and claset via addIffs;
|
wenzelm@5726
|
3225 |
|
wenzelm@5726
|
3226 |
3) a tactic for record field splitting (record_split_tac) is part of
|
wenzelm@5726
|
3227 |
the standard claset (addSWrapper);
|
wenzelm@5726
|
3228 |
|
wenzelm@5726
|
3229 |
To get a better idea about these rules you may retrieve them via
|
wenzelm@5726
|
3230 |
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
|
wenzelm@5726
|
3231 |
the name of your record type.
|
wenzelm@5726
|
3232 |
|
wenzelm@5726
|
3233 |
The split tactic 3) conceptually simplifies by the following rule:
|
wenzelm@5726
|
3234 |
|
wenzelm@5726
|
3235 |
"(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
|
wenzelm@5726
|
3236 |
|
wenzelm@5726
|
3237 |
Thus any record variable that is bound by meta-all will automatically
|
wenzelm@5726
|
3238 |
blow up into some record constructor term, consequently the
|
wenzelm@5726
|
3239 |
simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
|
wenzelm@5726
|
3240 |
solve record problems automatically.
|
wenzelm@5726
|
3241 |
|
berghofe@5214
|
3242 |
|
wenzelm@5125
|
3243 |
* reorganized the main HOL image: HOL/Integ and String loaded by
|
wenzelm@5125
|
3244 |
default; theory Main includes everything;
|
wenzelm@5125
|
3245 |
|
paulson@5650
|
3246 |
* automatic simplification of integer sums and comparisons, using cancellation;
|
paulson@5650
|
3247 |
|
oheimb@5526
|
3248 |
* added option_map_eq_Some and not_Some_eq to the default simpset and claset;
|
wenzelm@5125
|
3249 |
|
wenzelm@5127
|
3250 |
* added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
|
wenzelm@5125
|
3251 |
|
wenzelm@5127
|
3252 |
* many new identities for unions, intersections, set difference, etc.;
|
wenzelm@5127
|
3253 |
|
wenzelm@5127
|
3254 |
* expand_if, expand_split, expand_sum_case and expand_nat_case are now
|
wenzelm@5127
|
3255 |
called split_if, split_split, split_sum_case and split_nat_case (to go
|
wenzelm@5127
|
3256 |
with add/delsplits);
|
wenzelm@5127
|
3257 |
|
wenzelm@5127
|
3258 |
* HOL/Prod introduces simplification procedure unit_eq_proc rewriting
|
wenzelm@5127
|
3259 |
(?x::unit) = (); this is made part of the default simpset, which COULD
|
wenzelm@5127
|
3260 |
MAKE EXISTING PROOFS FAIL under rare circumstances (consider
|
wenzelm@5207
|
3261 |
'Delsimprocs [unit_eq_proc];' as last resort); also note that
|
wenzelm@5207
|
3262 |
unit_abs_eta_conv is added in order to counter the effect of
|
wenzelm@5207
|
3263 |
unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
|
wenzelm@5207
|
3264 |
%u.f();
|
wenzelm@5127
|
3265 |
|
wenzelm@5217
|
3266 |
* HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
|
wenzelm@5217
|
3267 |
makes more sense);
|
wenzelm@5127
|
3268 |
|
paulson@5475
|
3269 |
* HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
|
paulson@5475
|
3270 |
It and 'sym RS equals0D' are now in the default claset, giving automatic
|
paulson@5475
|
3271 |
disjointness reasoning but breaking a few old proofs.
|
paulson@5267
|
3272 |
|
wenzelm@5217
|
3273 |
* HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
|
wenzelm@5217
|
3274 |
to 'converse' from 'inverse' (for compatibility with ZF and some
|
wenzelm@5217
|
3275 |
literature);
|
berghofe@5109
|
3276 |
|
wenzelm@5127
|
3277 |
* HOL/recdef can now declare non-recursive functions, with {} supplied as
|
wenzelm@5127
|
3278 |
the well-founded relation;
|
wenzelm@5085
|
3279 |
|
paulson@5490
|
3280 |
* HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
|
paulson@5490
|
3281 |
Compl A. The "Compl" syntax remains available as input syntax for this
|
paulson@5490
|
3282 |
release ONLY.
|
paulson@5490
|
3283 |
|
wenzelm@5127
|
3284 |
* HOL/Update: new theory of function updates:
|
wenzelm@5127
|
3285 |
f(a:=b) == %x. if x=a then b else f x
|
wenzelm@5127
|
3286 |
may also be iterated as in f(a:=b,c:=d,...);
|
oheimb@4824
|
3287 |
|
wenzelm@5127
|
3288 |
* HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
|
paulson@4899
|
3289 |
|
nipkow@5282
|
3290 |
* HOL/List:
|
nipkow@5282
|
3291 |
- new function list_update written xs[i:=v] that updates the i-th
|
nipkow@5282
|
3292 |
list position. May also be iterated as in xs[i:=a,j:=b,...].
|
nipkow@5428
|
3293 |
- new function `upt' written [i..j(] which generates the list
|
nipkow@5428
|
3294 |
[i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
|
nipkow@5428
|
3295 |
bound write [i..j], which is a shorthand for [i..j+1(].
|
nipkow@5282
|
3296 |
- new lexicographic orderings and corresponding wellfoundedness theorems.
|
paulson@4779
|
3297 |
|
wenzelm@5127
|
3298 |
* HOL/Arith:
|
wenzelm@5127
|
3299 |
- removed 'pred' (predecessor) function;
|
wenzelm@5127
|
3300 |
- generalized some theorems about n-1;
|
wenzelm@5127
|
3301 |
- many new laws about "div" and "mod";
|
wenzelm@5127
|
3302 |
- new laws about greatest common divisors (see theory ex/Primes);
|
oheimb@4766
|
3303 |
|
wenzelm@5127
|
3304 |
* HOL/Relation: renamed the relational operator r^-1 "converse"
|
wenzelm@4842
|
3305 |
instead of "inverse";
|
wenzelm@4711
|
3306 |
|
nipkow@5651
|
3307 |
* HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
|
nipkow@5651
|
3308 |
of the multiset ordering;
|
nipkow@5651
|
3309 |
|
wenzelm@5127
|
3310 |
* directory HOL/Real: a construction of the reals using Dedekind cuts
|
nipkow@5651
|
3311 |
(not included by default);
|
paulson@4806
|
3312 |
|
wenzelm@5127
|
3313 |
* directory HOL/UNITY: Chandy and Misra's UNITY formalism;
|
wenzelm@4711
|
3314 |
|
nipkow@5651
|
3315 |
* directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
|
nipkow@5651
|
3316 |
programs, i.e. different program variables may have different types.
|
nipkow@5651
|
3317 |
|
paulson@5142
|
3318 |
* calling (stac rew i) now fails if "rew" has no effect on the goal
|
paulson@5142
|
3319 |
[previously, this check worked only if the rewrite rule was unconditional]
|
paulson@5308
|
3320 |
Now rew can involve either definitions or equalities (either == or =).
|
wenzelm@5002
|
3321 |
|
wenzelm@5363
|
3322 |
|
paulson@4879
|
3323 |
*** ZF ***
|
paulson@4879
|
3324 |
|
paulson@5332
|
3325 |
* theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
|
paulson@5332
|
3326 |
only the theorems proved on ZF.ML;
|
paulson@5160
|
3327 |
|
paulson@5475
|
3328 |
* ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
|
paulson@5475
|
3329 |
It and 'sym RS equals0D' are now in the default claset, giving automatic
|
paulson@5475
|
3330 |
disjointness reasoning but breaking a few old proofs.
|
paulson@5267
|
3331 |
|
paulson@5160
|
3332 |
* ZF/Update: new theory of function updates
|
paulson@5160
|
3333 |
with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
|
paulson@5160
|
3334 |
may also be iterated as in f(a:=b,c:=d,...);
|
paulson@5160
|
3335 |
|
paulson@4879
|
3336 |
* in let x=t in u(x), neither t nor u(x) has to be an FOL term.
|
oheimb@4649
|
3337 |
|
paulson@5142
|
3338 |
* calling (stac rew i) now fails if "rew" has no effect on the goal
|
paulson@5142
|
3339 |
[previously, this check worked only if the rewrite rule was unconditional]
|
paulson@5308
|
3340 |
Now rew can involve either definitions or equalities (either == or =).
|
paulson@5142
|
3341 |
|
paulson@5160
|
3342 |
* case_tac provided for compatibility with HOL
|
paulson@5160
|
3343 |
(like the old excluded_middle_tac, but with subgoals swapped)
|
paulson@5160
|
3344 |
|
wenzelm@4842
|
3345 |
|
wenzelm@5127
|
3346 |
*** Internal programming interfaces ***
|
wenzelm@5002
|
3347 |
|
wenzelm@5251
|
3348 |
* Pure: several new basic modules made available for general use, see
|
wenzelm@5251
|
3349 |
also src/Pure/README;
|
wenzelm@5207
|
3350 |
|
wenzelm@5008
|
3351 |
* improved the theory data mechanism to support encapsulation (data
|
wenzelm@5008
|
3352 |
kind name replaced by private Object.kind, acting as authorization
|
wenzelm@5373
|
3353 |
key); new type-safe user interface via functor TheoryDataFun; generic
|
wenzelm@5373
|
3354 |
print_data function becomes basically useless;
|
wenzelm@5002
|
3355 |
|
wenzelm@5251
|
3356 |
* removed global_names compatibility flag -- all theory declarations
|
wenzelm@5251
|
3357 |
are qualified by default;
|
wenzelm@5251
|
3358 |
|
wenzelm@5085
|
3359 |
* module Pure/Syntax now offers quote / antiquote translation
|
wenzelm@5085
|
3360 |
functions (useful for Hoare logic etc. with implicit dependencies);
|
wenzelm@5373
|
3361 |
see HOL/ex/Antiquote for an example use;
|
wenzelm@5085
|
3362 |
|
wenzelm@5127
|
3363 |
* Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
|
wenzelm@5127
|
3364 |
cterm -> thm;
|
wenzelm@5127
|
3365 |
|
wenzelm@5207
|
3366 |
* new tactical CHANGED_GOAL for checking that a tactic modifies a
|
wenzelm@5207
|
3367 |
subgoal;
|
paulson@5142
|
3368 |
|
wenzelm@5251
|
3369 |
* Display.print_goals function moved to Locale.print_goals;
|
wenzelm@5251
|
3370 |
|
wenzelm@5731
|
3371 |
* standard print function for goals supports current_goals_markers
|
wenzelm@5731
|
3372 |
variable for marking begin of proof, end of proof, start of goal; the
|
wenzelm@5731
|
3373 |
default is ("", "", ""); setting current_goals_markers := ("<proof>",
|
wenzelm@5731
|
3374 |
"</proof>", "<goal>") causes SGML like tagged proof state printing,
|
wenzelm@5731
|
3375 |
for example;
|
wenzelm@5731
|
3376 |
|
wenzelm@5002
|
3377 |
|
wenzelm@5002
|
3378 |
|
wenzelm@4410
|
3379 |
New in Isabelle98 (January 1998)
|
wenzelm@4410
|
3380 |
--------------------------------
|
wenzelm@4410
|
3381 |
|
wenzelm@4410
|
3382 |
*** Overview of INCOMPATIBILITIES (see below for more details) ***
|
wenzelm@4410
|
3383 |
|
wenzelm@4410
|
3384 |
* changed lexical syntax of terms / types: dots made part of long
|
wenzelm@4410
|
3385 |
identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
|
wenzelm@4410
|
3386 |
|
wenzelm@4410
|
3387 |
* simpset (and claset) reference variable replaced by functions
|
wenzelm@4410
|
3388 |
simpset / simpset_ref;
|
wenzelm@4410
|
3389 |
|
wenzelm@4410
|
3390 |
* no longer supports theory aliases (via merge) and non-trivial
|
wenzelm@4410
|
3391 |
implicit merge of thms' signatures;
|
wenzelm@4410
|
3392 |
|
wenzelm@4410
|
3393 |
* most internal names of constants changed due to qualified names;
|
wenzelm@4410
|
3394 |
|
wenzelm@4410
|
3395 |
* changed Pure/Sequence interface (see Pure/seq.ML);
|
wenzelm@4410
|
3396 |
|
wenzelm@3454
|
3397 |
|
paulson@3715
|
3398 |
*** General Changes ***
|
wenzelm@3697
|
3399 |
|
wenzelm@4174
|
3400 |
* hierachically structured name spaces (for consts, types, axms, thms
|
wenzelm@3943
|
3401 |
etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
|
wenzelm@4108
|
3402 |
old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
|
wenzelm@4108
|
3403 |
isatool fixdots ensures space after dots (e.g. "%x. x"); set
|
wenzelm@4174
|
3404 |
long_names for fully qualified output names; NOTE: ML programs
|
wenzelm@4174
|
3405 |
(special tactics, packages etc.) referring to internal names may have
|
wenzelm@4174
|
3406 |
to be adapted to cope with fully qualified names; in case of severe
|
wenzelm@4174
|
3407 |
backward campatibility problems try setting 'global_names' at compile
|
wenzelm@4174
|
3408 |
time to have enrything declared within a flat name space; one may also
|
wenzelm@4174
|
3409 |
fine tune name declarations in theories via the 'global' and 'local'
|
wenzelm@4174
|
3410 |
section;
|
wenzelm@4108
|
3411 |
|
wenzelm@4108
|
3412 |
* reimplemented the implicit simpset and claset using the new anytype
|
wenzelm@4108
|
3413 |
data filed in signatures; references simpset:simpset ref etc. are
|
wenzelm@4108
|
3414 |
replaced by functions simpset:unit->simpset and
|
wenzelm@4108
|
3415 |
simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
|
wenzelm@4108
|
3416 |
to patch your ML files accordingly;
|
paulson@3856
|
3417 |
|
wenzelm@3857
|
3418 |
* HTML output now includes theory graph data for display with Java
|
wenzelm@3857
|
3419 |
applet or isatool browser; data generated automatically via isatool
|
wenzelm@3901
|
3420 |
usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
|
wenzelm@3857
|
3421 |
|
paulson@3856
|
3422 |
* defs may now be conditional; improved rewrite_goals_tac to handle
|
paulson@3856
|
3423 |
conditional equations;
|
paulson@3856
|
3424 |
|
wenzelm@4174
|
3425 |
* defs now admits additional type arguments, using TYPE('a) syntax;
|
wenzelm@4174
|
3426 |
|
wenzelm@3901
|
3427 |
* theory aliases via merge (e.g. M=A+B+C) no longer supported, always
|
wenzelm@3901
|
3428 |
creates a new theory node; implicit merge of thms' signatures is
|
wenzelm@4112
|
3429 |
restricted to 'trivial' ones; COMPATIBILITY: one may have to use
|
wenzelm@3901
|
3430 |
transfer:theory->thm->thm in (rare) cases;
|
wenzelm@3901
|
3431 |
|
wenzelm@3968
|
3432 |
* improved handling of draft signatures / theories; draft thms (and
|
wenzelm@3968
|
3433 |
ctyps, cterms) are automatically promoted to real ones;
|
wenzelm@3968
|
3434 |
|
wenzelm@3901
|
3435 |
* slightly changed interfaces for oracles: admit many per theory, named
|
wenzelm@3901
|
3436 |
(e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
|
wenzelm@3901
|
3437 |
|
wenzelm@3901
|
3438 |
* print_goals: optional output of const types (set show_consts and
|
wenzelm@3901
|
3439 |
show_types);
|
wenzelm@3851
|
3440 |
|
wenzelm@4388
|
3441 |
* improved output of warnings (###) and errors (***);
|
wenzelm@3697
|
3442 |
|
paulson@4178
|
3443 |
* subgoal_tac displays a warning if the new subgoal has type variables;
|
paulson@4178
|
3444 |
|
paulson@3715
|
3445 |
* removed old README and Makefiles;
|
paulson@3715
|
3446 |
|
paulson@3856
|
3447 |
* replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
|
wenzelm@3670
|
3448 |
|
paulson@3715
|
3449 |
* removed obsolete init_pps and init_database;
|
paulson@3715
|
3450 |
|
paulson@3715
|
3451 |
* deleted the obsolete tactical STATE, which was declared by
|
paulson@3715
|
3452 |
fun STATE tacfun st = tacfun st st;
|
paulson@3715
|
3453 |
|
wenzelm@4388
|
3454 |
* cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
|
wenzelm@4388
|
3455 |
(which abbreviates $HOME);
|
wenzelm@4269
|
3456 |
|
wenzelm@4269
|
3457 |
* changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
|
wenzelm@4269
|
3458 |
use isatool fixseq to adapt your ML programs (this works for fully
|
wenzelm@4269
|
3459 |
qualified references to the Sequence structure only!);
|
wenzelm@4269
|
3460 |
|
wenzelm@4381
|
3461 |
* use_thy no longer requires writable current directory; it always
|
wenzelm@4381
|
3462 |
reloads .ML *and* .thy file, if either one is out of date;
|
wenzelm@4269
|
3463 |
|
paulson@3715
|
3464 |
|
paulson@3715
|
3465 |
*** Classical Reasoner ***
|
paulson@3715
|
3466 |
|
wenzelm@3744
|
3467 |
* Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
|
wenzelm@3744
|
3468 |
tactics that use classical reasoning to simplify a subgoal without
|
wenzelm@3744
|
3469 |
splitting it into several subgoals;
|
paulson@3715
|
3470 |
|
paulson@3719
|
3471 |
* Safe_tac: like safe_tac but uses the default claset;
|
paulson@3719
|
3472 |
|
paulson@3715
|
3473 |
|
paulson@3715
|
3474 |
*** Simplifier ***
|
paulson@3715
|
3475 |
|
paulson@3715
|
3476 |
* added simplification meta rules:
|
paulson@3715
|
3477 |
(asm_)(full_)simplify: simpset -> thm -> thm;
|
paulson@3715
|
3478 |
|
paulson@3715
|
3479 |
* simplifier.ML no longer part of Pure -- has to be loaded by object
|
paulson@3715
|
3480 |
logics (again);
|
paulson@3715
|
3481 |
|
paulson@3715
|
3482 |
* added prems argument to simplification procedures;
|
paulson@3715
|
3483 |
|
paulson@4325
|
3484 |
* HOL, FOL, ZF: added infix function `addsplits':
|
paulson@4325
|
3485 |
instead of `<simpset> setloop (split_tac <thms>)'
|
paulson@4325
|
3486 |
you can simply write `<simpset> addsplits <thms>'
|
paulson@4325
|
3487 |
|
paulson@3715
|
3488 |
|
paulson@3715
|
3489 |
*** Syntax ***
|
paulson@3715
|
3490 |
|
wenzelm@4174
|
3491 |
* TYPE('a) syntax for type reflection terms;
|
wenzelm@4174
|
3492 |
|
wenzelm@3985
|
3493 |
* no longer handles consts with name "" -- declare as 'syntax' instead;
|
paulson@3856
|
3494 |
|
paulson@3856
|
3495 |
* pretty printer: changed order of mixfix annotation preference (again!);
|
wenzelm@3846
|
3496 |
|
paulson@3715
|
3497 |
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
|
paulson@3715
|
3498 |
|
paulson@3715
|
3499 |
|
paulson@3715
|
3500 |
*** HOL ***
|
paulson@3715
|
3501 |
|
wenzelm@5726
|
3502 |
* HOL: there is a new splitter `split_asm_tac' that can be used e.g.
|
oheimb@4189
|
3503 |
with `addloop' of the simplifier to faciliate case splitting in premises.
|
oheimb@4189
|
3504 |
|
nipkow@4035
|
3505 |
* HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
|
wenzelm@3985
|
3506 |
|
wenzelm@3985
|
3507 |
* HOL/Auth: new protocol proofs including some for the Internet
|
nipkow@4035
|
3508 |
protocol TLS;
|
wenzelm@3985
|
3509 |
|
wenzelm@4125
|
3510 |
* HOL/Map: new theory of `maps' a la VDM;
|
nipkow@3982
|
3511 |
|
wenzelm@4335
|
3512 |
* HOL/simplifier: simplification procedures nat_cancel_sums for
|
wenzelm@4335
|
3513 |
cancelling out common nat summands from =, <, <= (in)equalities, or
|
wenzelm@4335
|
3514 |
differences; simplification procedures nat_cancel_factor for
|
wenzelm@4335
|
3515 |
cancelling common factor from =, <, <= (in)equalities over natural
|
wenzelm@4373
|
3516 |
sums; nat_cancel contains both kinds of procedures, it is installed by
|
wenzelm@4373
|
3517 |
default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
|
wenzelm@4335
|
3518 |
|
nipkow@3580
|
3519 |
* HOL/simplifier: terms of the form
|
paulson@4325
|
3520 |
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
|
nipkow@3580
|
3521 |
are rewritten to
|
nipkow@4035
|
3522 |
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
|
nipkow@4035
|
3523 |
and those of the form
|
paulson@4325
|
3524 |
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
|
nipkow@4035
|
3525 |
are rewritten to
|
nipkow@4035
|
3526 |
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
|
nipkow@3580
|
3527 |
|
nipkow@4035
|
3528 |
* HOL/datatype
|
nipkow@4035
|
3529 |
Each datatype `t' now comes with a theorem `split_t_case' of the form
|
nipkow@4035
|
3530 |
|
nipkow@4035
|
3531 |
P(t_case f1 ... fn x) =
|
nipkow@4035
|
3532 |
( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
|
nipkow@4035
|
3533 |
...
|
oheimb@4189
|
3534 |
(!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
|
nipkow@4035
|
3535 |
)
|
nipkow@4035
|
3536 |
|
oheimb@4930
|
3537 |
and a theorem `split_t_case_asm' of the form
|
oheimb@4189
|
3538 |
|
oheimb@4189
|
3539 |
P(t_case f1 ... fn x) =
|
oheimb@4189
|
3540 |
~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
|
oheimb@4189
|
3541 |
...
|
oheimb@4189
|
3542 |
(? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
|
oheimb@4189
|
3543 |
)
|
oheimb@4930
|
3544 |
which can be added to a simpset via `addsplits'. The existing theorems
|
oheimb@4930
|
3545 |
expand_list_case and expand_option_case have been renamed to
|
oheimb@4930
|
3546 |
split_list_case and split_option_case.
|
oheimb@4189
|
3547 |
|
nipkow@4361
|
3548 |
* HOL/Arithmetic:
|
nipkow@4361
|
3549 |
- `pred n' is automatically converted to `n-1'.
|
nipkow@4361
|
3550 |
Users are strongly encouraged not to use `pred' any longer,
|
nipkow@4361
|
3551 |
because it will disappear altogether at some point.
|
nipkow@4361
|
3552 |
- Users are strongly encouraged to write "0 < n" rather than
|
nipkow@4361
|
3553 |
"n ~= 0". Theorems and proof tools have been modified towards this
|
nipkow@4361
|
3554 |
`standard'.
|
nipkow@4357
|
3555 |
|
nipkow@4502
|
3556 |
* HOL/Lists:
|
nipkow@4502
|
3557 |
the function "set_of_list" has been renamed "set" (and its theorems too);
|
nipkow@4502
|
3558 |
the function "nth" now takes its arguments in the reverse order and
|
nipkow@4502
|
3559 |
has acquired the infix notation "!" as in "xs!n".
|
paulson@3570
|
3560 |
|
paulson@4154
|
3561 |
* HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
|
paulson@4154
|
3562 |
|
paulson@4154
|
3563 |
* HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
|
paulson@4154
|
3564 |
specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
|
paulson@4154
|
3565 |
|
wenzelm@4575
|
3566 |
* HOL/record: extensible records with schematic structural subtyping
|
wenzelm@4575
|
3567 |
(single inheritance); EXPERIMENTAL version demonstrating the encoding,
|
wenzelm@4575
|
3568 |
still lacks various theorems and concrete record syntax;
|
wenzelm@4575
|
3569 |
|
wenzelm@4125
|
3570 |
|
paulson@3715
|
3571 |
*** HOLCF ***
|
wenzelm@3511
|
3572 |
|
wenzelm@4125
|
3573 |
* removed "axioms" and "generated by" sections;
|
wenzelm@4125
|
3574 |
|
oheimb@4123
|
3575 |
* replaced "ops" section by extended "consts" section, which is capable of
|
wenzelm@4125
|
3576 |
handling the continuous function space "->" directly;
|
wenzelm@4125
|
3577 |
|
wenzelm@4125
|
3578 |
* domain package:
|
wenzelm@4125
|
3579 |
. proves theorems immediately and stores them in the theory,
|
wenzelm@4125
|
3580 |
. creates hierachical name space,
|
wenzelm@4125
|
3581 |
. now uses normal mixfix annotations (instead of cinfix...),
|
wenzelm@4125
|
3582 |
. minor changes to some names and values (for consistency),
|
wenzelm@4125
|
3583 |
. e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
|
wenzelm@4125
|
3584 |
. separator between mutual domain defs: changed "," to "and",
|
wenzelm@4125
|
3585 |
. improved handling of sort constraints; now they have to
|
wenzelm@4125
|
3586 |
appear on the left-hand side of the equations only;
|
oheimb@4123
|
3587 |
|
oheimb@4123
|
3588 |
* fixed LAM <x,y,zs>.b syntax;
|
wenzelm@3535
|
3589 |
|
wenzelm@3744
|
3590 |
* added extended adm_tac to simplifier in HOLCF -- can now discharge
|
wenzelm@3744
|
3591 |
adm (%x. P (t x)), where P is chainfinite and t continuous;
|
wenzelm@3579
|
3592 |
|
wenzelm@3579
|
3593 |
|
paulson@3719
|
3594 |
*** FOL and ZF ***
|
paulson@3719
|
3595 |
|
wenzelm@5726
|
3596 |
* FOL: there is a new splitter `split_asm_tac' that can be used e.g.
|
oheimb@4189
|
3597 |
with `addloop' of the simplifier to faciliate case splitting in premises.
|
oheimb@4189
|
3598 |
|
wenzelm@3744
|
3599 |
* qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
|
wenzelm@3744
|
3600 |
in HOL, they strip ALL and --> from proved theorems;
|
wenzelm@3744
|
3601 |
|
paulson@3719
|
3602 |
|
wenzelm@3579
|
3603 |
|
wenzelm@3006
|
3604 |
New in Isabelle94-8 (May 1997)
|
wenzelm@3006
|
3605 |
------------------------------
|
wenzelm@2654
|
3606 |
|
paulson@3002
|
3607 |
*** General Changes ***
|
paulson@3002
|
3608 |
|
paulson@3002
|
3609 |
* new utilities to build / run / maintain Isabelle etc. (in parts
|
paulson@3002
|
3610 |
still somewhat experimental); old Makefiles etc. still functional;
|
wenzelm@2971
|
3611 |
|
wenzelm@3205
|
3612 |
* new 'Isabelle System Manual';
|
wenzelm@3205
|
3613 |
|
wenzelm@2825
|
3614 |
* INSTALL text, together with ./configure and ./build scripts;
|
wenzelm@2773
|
3615 |
|
wenzelm@3006
|
3616 |
* reimplemented type inference for greater efficiency, better error
|
wenzelm@3006
|
3617 |
messages and clean internal interface;
|
paulson@3002
|
3618 |
|
paulson@3002
|
3619 |
* prlim command for dealing with lots of subgoals (an easier way of
|
paulson@3002
|
3620 |
setting goals_limit);
|
paulson@3002
|
3621 |
|
wenzelm@3006
|
3622 |
|
wenzelm@3006
|
3623 |
*** Syntax ***
|
paulson@3002
|
3624 |
|
wenzelm@3116
|
3625 |
* supports alternative (named) syntax tables (parser and pretty
|
wenzelm@3116
|
3626 |
printer); internal interface is provided by add_modesyntax(_i);
|
wenzelm@3116
|
3627 |
|
paulson@3002
|
3628 |
* Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
|
paulson@3002
|
3629 |
be used in conjunction with the Isabelle symbol font; uses the
|
paulson@3002
|
3630 |
"symbols" syntax table;
|
paulson@3002
|
3631 |
|
wenzelm@2705
|
3632 |
* added token_translation interface (may translate name tokens in
|
wenzelm@2756
|
3633 |
arbitrary ways, dependent on their type (free, bound, tfree, ...) and
|
wenzelm@3116
|
3634 |
the current print_mode); IMPORTANT: user print translation functions
|
wenzelm@3116
|
3635 |
are responsible for marking newly introduced bounds
|
wenzelm@3116
|
3636 |
(Syntax.mark_boundT);
|
wenzelm@2705
|
3637 |
|
wenzelm@2730
|
3638 |
* token translations for modes "xterm" and "xterm_color" that display
|
wenzelm@3006
|
3639 |
names in bold, underline etc. or colors (which requires a color
|
wenzelm@3006
|
3640 |
version of xterm);
|
wenzelm@2730
|
3641 |
|
paulson@3002
|
3642 |
* infixes may now be declared with names independent of their syntax;
|
paulson@3002
|
3643 |
|
paulson@3002
|
3644 |
* added typed_print_translation (like print_translation, but may
|
paulson@3002
|
3645 |
access type of constant);
|
paulson@3002
|
3646 |
|
wenzelm@3006
|
3647 |
|
paulson@3002
|
3648 |
*** Classical Reasoner ***
|
paulson@3002
|
3649 |
|
paulson@3002
|
3650 |
Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
|
paulson@3002
|
3651 |
some limitations. Blast_tac...
|
paulson@3002
|
3652 |
+ ignores addss, addbefore, addafter; this restriction is intrinsic
|
paulson@3002
|
3653 |
+ ignores elimination rules that don't have the correct format
|
wenzelm@5726
|
3654 |
(the conclusion MUST be a formula variable)
|
paulson@3002
|
3655 |
+ ignores types, which can make HOL proofs fail
|
paulson@3002
|
3656 |
+ rules must not require higher-order unification, e.g. apply_type in ZF
|
paulson@3002
|
3657 |
[message "Function Var's argument not a bound variable" relates to this]
|
paulson@3002
|
3658 |
+ its proof strategy is more general but can actually be slower
|
paulson@3002
|
3659 |
|
wenzelm@3107
|
3660 |
* substitution with equality assumptions no longer permutes other
|
wenzelm@3107
|
3661 |
assumptions;
|
paulson@3002
|
3662 |
|
paulson@3002
|
3663 |
* minor changes in semantics of addafter (now called addaltern); renamed
|
paulson@3002
|
3664 |
setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
|
wenzelm@3107
|
3665 |
(and access functions for it);
|
paulson@3002
|
3666 |
|
wenzelm@5726
|
3667 |
* improved combination of classical reasoner and simplifier:
|
oheimb@3317
|
3668 |
+ functions for handling clasimpsets
|
oheimb@3317
|
3669 |
+ improvement of addss: now the simplifier is called _after_ the
|
oheimb@3317
|
3670 |
safe steps.
|
oheimb@3317
|
3671 |
+ safe variant of addss called addSss: uses safe simplifications
|
wenzelm@5726
|
3672 |
_during_ the safe steps. It is more complete as it allows multiple
|
oheimb@3317
|
3673 |
instantiations of unknowns (e.g. with slow_tac).
|
wenzelm@3006
|
3674 |
|
paulson@3002
|
3675 |
*** Simplifier ***
|
paulson@3002
|
3676 |
|
wenzelm@3006
|
3677 |
* added interface for simplification procedures (functions that
|
wenzelm@3006
|
3678 |
produce *proven* rewrite rules on the fly, depending on current
|
wenzelm@3006
|
3679 |
redex);
|
wenzelm@3006
|
3680 |
|
wenzelm@3006
|
3681 |
* ordering on terms as parameter (used for ordered rewriting);
|
wenzelm@3006
|
3682 |
|
wenzelm@3107
|
3683 |
* new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
|
paulson@3002
|
3684 |
|
paulson@3002
|
3685 |
* the solver is now split into a safe and an unsafe part.
|
paulson@3002
|
3686 |
This should be invisible for the normal user, except that the
|
paulson@3002
|
3687 |
functions setsolver and addsolver have been renamed to setSolver and
|
wenzelm@3107
|
3688 |
addSolver; added safe_asm_full_simp_tac;
|
paulson@3002
|
3689 |
|
paulson@3002
|
3690 |
|
paulson@3002
|
3691 |
*** HOL ***
|
paulson@3002
|
3692 |
|
nipkow@3042
|
3693 |
* a generic induction tactic `induct_tac' which works for all datatypes and
|
wenzelm@3107
|
3694 |
also for type `nat';
|
nipkow@3042
|
3695 |
|
nipkow@3316
|
3696 |
* a generic case distinction tactic `exhaust_tac' which works for all
|
nipkow@3316
|
3697 |
datatypes and also for type `nat';
|
nipkow@3316
|
3698 |
|
nipkow@3316
|
3699 |
* each datatype comes with a function `size';
|
nipkow@3316
|
3700 |
|
paulson@3002
|
3701 |
* patterns in case expressions allow tuple patterns as arguments to
|
wenzelm@3107
|
3702 |
constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
|
paulson@3002
|
3703 |
|
paulson@3002
|
3704 |
* primrec now also works with type nat;
|
paulson@3002
|
3705 |
|
paulson@3338
|
3706 |
* recdef: a new declaration form, allows general recursive functions to be
|
paulson@3338
|
3707 |
defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
|
paulson@3338
|
3708 |
|
paulson@3002
|
3709 |
* the constant for negation has been renamed from "not" to "Not" to
|
wenzelm@3107
|
3710 |
harmonize with FOL, ZF, LK, etc.;
|
paulson@3002
|
3711 |
|
wenzelm@3107
|
3712 |
* HOL/ex/LFilter theory of a corecursive "filter" functional for
|
wenzelm@3107
|
3713 |
infinite lists;
|
paulson@3002
|
3714 |
|
wenzelm@3227
|
3715 |
* HOL/Modelcheck demonstrates invocation of model checker oracle;
|
wenzelm@3227
|
3716 |
|
paulson@3002
|
3717 |
* HOL/ex/Ring.thy declares cring_simp, which solves equational
|
paulson@3002
|
3718 |
problems in commutative rings, using axiomatic type classes for + and *;
|
paulson@3002
|
3719 |
|
paulson@3002
|
3720 |
* more examples in HOL/MiniML and HOL/Auth;
|
paulson@3002
|
3721 |
|
paulson@3002
|
3722 |
* more default rewrite rules for quantifiers, union/intersection;
|
paulson@3002
|
3723 |
|
nipkow@3321
|
3724 |
* a new constant `arbitrary == @x.False';
|
nipkow@3321
|
3725 |
|
wenzelm@3107
|
3726 |
* HOLCF/IOA replaces old HOL/IOA;
|
wenzelm@3107
|
3727 |
|
wenzelm@5726
|
3728 |
* HOLCF changes: derived all rules and arities
|
wenzelm@5726
|
3729 |
+ axiomatic type classes instead of classes
|
slotosch@2653
|
3730 |
+ typedef instead of faking type definitions
|
paulson@2747
|
3731 |
+ eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
|
wenzelm@2730
|
3732 |
+ new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
|
slotosch@2653
|
3733 |
+ eliminated the types void, one, tr
|
slotosch@2653
|
3734 |
+ use unit lift and bool lift (with translations) instead of one and tr
|
slotosch@2653
|
3735 |
+ eliminated blift from Lift3.thy (use Def instead of blift)
|
wenzelm@3107
|
3736 |
all eliminated rules are derived as theorems --> no visible changes ;
|
oheimb@2649
|
3737 |
|
wenzelm@3006
|
3738 |
|
paulson@3002
|
3739 |
*** ZF ***
|
wenzelm@2553
|
3740 |
|
paulson@2865
|
3741 |
* ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
|
paulson@2865
|
3742 |
rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
|
paulson@2865
|
3743 |
as ZF_cs addSIs [equalityI];
|
wenzelm@2553
|
3744 |
|
wenzelm@2554
|
3745 |
|
wenzelm@2732
|
3746 |
|
wenzelm@2553
|
3747 |
New in Isabelle94-7 (November 96)
|
wenzelm@2553
|
3748 |
---------------------------------
|
wenzelm@2553
|
3749 |
|
wenzelm@2553
|
3750 |
* allowing negative levels (as offsets) in prlev and choplev;
|
wenzelm@2553
|
3751 |
|
wenzelm@2554
|
3752 |
* super-linear speedup for large simplifications;
|
wenzelm@2554
|
3753 |
|
wenzelm@2554
|
3754 |
* FOL, ZF and HOL now use miniscoping: rewriting pushes
|
wenzelm@2554
|
3755 |
quantifications in as far as possible (COULD MAKE EXISTING PROOFS
|
wenzelm@2554
|
3756 |
FAIL); can suppress it using the command Delsimps (ex_simps @
|
wenzelm@2554
|
3757 |
all_simps); De Morgan laws are also now included, by default;
|
wenzelm@2554
|
3758 |
|
wenzelm@2554
|
3759 |
* improved printing of ==> : ~:
|
wenzelm@2554
|
3760 |
|
wenzelm@2554
|
3761 |
* new object-logic "Sequents" adds linear logic, while replacing LK
|
wenzelm@2554
|
3762 |
and Modal (thanks to Sara Kalvala);
|
wenzelm@2554
|
3763 |
|
wenzelm@2554
|
3764 |
* HOL/Auth: correctness proofs for authentication protocols;
|
wenzelm@2554
|
3765 |
|
wenzelm@2554
|
3766 |
* HOL: new auto_tac combines rewriting and classical reasoning (many
|
wenzelm@2554
|
3767 |
examples on HOL/Auth);
|
wenzelm@2554
|
3768 |
|
wenzelm@2554
|
3769 |
* HOL: new command AddIffs for declaring theorems of the form P=Q to
|
wenzelm@2554
|
3770 |
the rewriter and classical reasoner simultaneously;
|
wenzelm@2554
|
3771 |
|
wenzelm@2554
|
3772 |
* function uresult no longer returns theorems in "standard" format;
|
wenzelm@2554
|
3773 |
regain previous version by: val uresult = standard o uresult;
|
wenzelm@2554
|
3774 |
|
wenzelm@2554
|
3775 |
|
wenzelm@2554
|
3776 |
|
wenzelm@2554
|
3777 |
New in Isabelle94-6
|
wenzelm@2554
|
3778 |
-------------------
|
wenzelm@2554
|
3779 |
|
wenzelm@2554
|
3780 |
* oracles -- these establish an interface between Isabelle and trusted
|
wenzelm@2554
|
3781 |
external reasoners, which may deliver results as theorems;
|
wenzelm@2554
|
3782 |
|
wenzelm@2554
|
3783 |
* proof objects (in particular record all uses of oracles);
|
wenzelm@2554
|
3784 |
|
wenzelm@2554
|
3785 |
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
|
wenzelm@2554
|
3786 |
|
wenzelm@2554
|
3787 |
* "constdefs" section in theory files;
|
wenzelm@2554
|
3788 |
|
wenzelm@2554
|
3789 |
* "primrec" section (HOL) no longer requires names;
|
wenzelm@2554
|
3790 |
|
wenzelm@2554
|
3791 |
* internal type "tactic" now simply "thm -> thm Sequence.seq";
|
wenzelm@2554
|
3792 |
|
wenzelm@2554
|
3793 |
|
wenzelm@2554
|
3794 |
|
wenzelm@2554
|
3795 |
New in Isabelle94-5
|
wenzelm@2554
|
3796 |
-------------------
|
wenzelm@2554
|
3797 |
|
wenzelm@2554
|
3798 |
* reduced space requirements;
|
wenzelm@2554
|
3799 |
|
wenzelm@2554
|
3800 |
* automatic HTML generation from theories;
|
wenzelm@2554
|
3801 |
|
wenzelm@2554
|
3802 |
* theory files no longer require "..." (quotes) around most types;
|
wenzelm@2554
|
3803 |
|
wenzelm@2554
|
3804 |
* new examples, including two proofs of the Church-Rosser theorem;
|
wenzelm@2554
|
3805 |
|
wenzelm@2554
|
3806 |
* non-curried (1994) version of HOL is no longer distributed;
|
wenzelm@2554
|
3807 |
|
wenzelm@2553
|
3808 |
|
paulson@2557
|
3809 |
|
paulson@2557
|
3810 |
New in Isabelle94-4
|
paulson@2557
|
3811 |
-------------------
|
paulson@2557
|
3812 |
|
paulson@2747
|
3813 |
* greatly reduced space requirements;
|
paulson@2557
|
3814 |
|
paulson@2557
|
3815 |
* theory files (.thy) no longer require \...\ escapes at line breaks;
|
paulson@2557
|
3816 |
|
wenzelm@5726
|
3817 |
* searchable theorem database (see the section "Retrieving theorems" on
|
paulson@2557
|
3818 |
page 8 of the Reference Manual);
|
paulson@2557
|
3819 |
|
paulson@2557
|
3820 |
* new examples, including Grabczewski's monumental case study of the
|
paulson@2557
|
3821 |
Axiom of Choice;
|
paulson@2557
|
3822 |
|
paulson@2557
|
3823 |
* The previous version of HOL renamed to Old_HOL;
|
paulson@2557
|
3824 |
|
wenzelm@5726
|
3825 |
* The new version of HOL (previously called CHOL) uses a curried syntax
|
paulson@2557
|
3826 |
for functions. Application looks like f a b instead of f(a,b);
|
paulson@2557
|
3827 |
|
paulson@2557
|
3828 |
* Mutually recursive inductive definitions finally work in HOL;
|
paulson@2557
|
3829 |
|
paulson@2557
|
3830 |
* In ZF, pattern-matching on tuples is now available in all abstractions and
|
paulson@2557
|
3831 |
translates to the operator "split";
|
paulson@2557
|
3832 |
|
paulson@2557
|
3833 |
|
paulson@2557
|
3834 |
|
paulson@2557
|
3835 |
New in Isabelle94-3
|
paulson@2557
|
3836 |
-------------------
|
paulson@2557
|
3837 |
|
wenzelm@5726
|
3838 |
* new infix operator, addss, allowing the classical reasoner to
|
paulson@2557
|
3839 |
perform simplification at each step of its search. Example:
|
wenzelm@5726
|
3840 |
fast_tac (cs addss ss)
|
paulson@2557
|
3841 |
|
wenzelm@5726
|
3842 |
* a new logic, CHOL, the same as HOL, but with a curried syntax
|
wenzelm@5726
|
3843 |
for functions. Application looks like f a b instead of f(a,b). Also pairs
|
paulson@2557
|
3844 |
look like (a,b) instead of <a,b>;
|
paulson@2557
|
3845 |
|
paulson@2557
|
3846 |
* PLEASE NOTE: CHOL will eventually replace HOL!
|
paulson@2557
|
3847 |
|
paulson@2557
|
3848 |
* In CHOL, pattern-matching on tuples is now available in all abstractions.
|
paulson@2557
|
3849 |
It translates to the operator "split". A new theory of integers is available;
|
paulson@2557
|
3850 |
|
paulson@2557
|
3851 |
* In ZF, integer numerals now denote two's-complement binary integers.
|
paulson@2557
|
3852 |
Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
|
paulson@2557
|
3853 |
|
wenzelm@5726
|
3854 |
* Many new examples: I/O automata, Church-Rosser theorem, equivalents
|
paulson@2557
|
3855 |
of the Axiom of Choice;
|
paulson@2557
|
3856 |
|
paulson@2557
|
3857 |
|
paulson@2557
|
3858 |
|
paulson@2557
|
3859 |
New in Isabelle94-2
|
paulson@2557
|
3860 |
-------------------
|
paulson@2557
|
3861 |
|
wenzelm@5726
|
3862 |
* Significantly faster resolution;
|
paulson@2557
|
3863 |
|
paulson@2557
|
3864 |
* the different sections in a .thy file can now be mixed and repeated
|
paulson@2557
|
3865 |
freely;
|
paulson@2557
|
3866 |
|
paulson@2557
|
3867 |
* Database of theorems for FOL, HOL and ZF. New
|
paulson@2557
|
3868 |
commands including qed, qed_goal and bind_thm store theorems in the database.
|
paulson@2557
|
3869 |
|
paulson@2557
|
3870 |
* Simple database queries: return a named theorem (get_thm) or all theorems of
|
paulson@2557
|
3871 |
a given theory (thms_of), or find out what theory a theorem was proved in
|
paulson@2557
|
3872 |
(theory_of_thm);
|
paulson@2557
|
3873 |
|
paulson@2557
|
3874 |
* Bugs fixed in the inductive definition and datatype packages;
|
paulson@2557
|
3875 |
|
paulson@2557
|
3876 |
* The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
|
paulson@2557
|
3877 |
and HOL_dup_cs obsolete;
|
paulson@2557
|
3878 |
|
paulson@2557
|
3879 |
* Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
|
paulson@2557
|
3880 |
have been removed;
|
paulson@2557
|
3881 |
|
paulson@2557
|
3882 |
* Simpler definition of function space in ZF;
|
paulson@2557
|
3883 |
|
paulson@2557
|
3884 |
* new results about cardinal and ordinal arithmetic in ZF;
|
paulson@2557
|
3885 |
|
paulson@2557
|
3886 |
* 'subtype' facility in HOL for introducing new types as subsets of existing
|
paulson@2557
|
3887 |
types;
|
paulson@2557
|
3888 |
|
paulson@2557
|
3889 |
|
wenzelm@2553
|
3890 |
$Id$
|