author | nipkow |
Sun, 06 Apr 2003 10:08:52 +0200 | |
changeset 13899 | 12c7029d278b |
parent 13881 | f63e2a057fd4 |
child 13938 | b033b53d0c1e |
permissions | -rw-r--r-- |
5363 | 1 |
Isabelle NEWS -- history user-relevant changes |
2 |
============================================== |
|
2553 | 3 |
|
13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
4 |
New in this Isabelle release |
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
5 |
---------------------------- |
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
6 |
|
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
7 |
*** General *** |
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
8 |
|
13618 | 9 |
* Provers/simplifier: |
10 |
||
13781 | 11 |
- Completely reimplemented method simp (ML: Asm_full_simp_tac): |
13618 | 12 |
Assumptions are now subject to complete mutual simplification, |
13 |
not just from left to right. The simplifier now preserves |
|
14 |
the order of assumptions. |
|
15 |
||
16 |
Potential INCOMPATIBILITY: |
|
17 |
||
13781 | 18 |
-- simp sometimes diverges where the old version did |
19 |
not, e.g. invoking simp on the goal |
|
13618 | 20 |
|
21 |
[| P (f x); y = x; f x = f y |] ==> Q |
|
22 |
||
13781 | 23 |
now gives rise to the infinite reduction sequence |
24 |
||
25 |
P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ... |
|
26 |
||
27 |
Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this |
|
28 |
kind of problem. |
|
29 |
||
30 |
-- Tactics combining classical reasoner and simplification (such as auto) |
|
31 |
are also affected by this change, because many of them rely on |
|
32 |
simp. They may sometimes diverge as well or yield a different numbers |
|
33 |
of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto |
|
34 |
in case of problems. Sometimes subsequent calls to the classical |
|
35 |
reasoner will fail because a preceeding call to the simplifier too |
|
36 |
eagerly simplified the goal, e.g. deleted redundant premises. |
|
13618 | 37 |
|
38 |
- The simplifier trace now shows the names of the applied rewrite rules |
|
39 |
||
13829 | 40 |
- You can limit the number of recursive invocations of the simplifier |
41 |
during conditional rewriting (where the simplifie tries to solve the |
|
42 |
conditions before applying the rewrite rule): |
|
43 |
ML "simp_depth_limit := n" |
|
44 |
where n is an integer. Thus you can force termination where previously |
|
45 |
the simplifier would diverge. |
|
46 |
||
13835
12b2ffbe543a
Change to meta simplifier: congruence rules may now have frees as head of term.
ballarin
parents:
13829
diff
changeset
|
47 |
- Accepts free variables as head terms in congruence rules. Useful in Isar. |
13829 | 48 |
|
13868 | 49 |
* Pure: The main goal of the proof state is no longer shown by default, only |
50 |
the subgoals. This behaviour is controlled by a new flag. |
|
13835
12b2ffbe543a
Change to meta simplifier: congruence rules may now have frees as head of term.
ballarin
parents:
13829
diff
changeset
|
51 |
PG menu: Isabelle/Isar -> Settings -> Show Main Goal |
13815 | 52 |
(ML: Proof.show_main_goal). |
53 |
||
54 |
* Pure: You can find all matching introduction rules for subgoal 1, i.e. all |
|
55 |
rules whose conclusion matches subgoal 1: |
|
56 |
PG menu: Isabelle/Isar -> Show me -> matching rules |
|
57 |
The rules are ordered by how closely they match the subgoal. |
|
58 |
In particular, rules that solve a subgoal outright are displayed first |
|
59 |
(or rather last, the way they are printed). |
|
60 |
(ML: ProofGeneral.print_intros()) |
|
61 |
||
62 |
* Pure: New flag trace_unify_fail causes unification to print |
|
13781 | 63 |
diagnostic information (PG: in trace buffer) when it fails. This is |
64 |
useful for figuring out why single step proofs like rule, erule or |
|
65 |
assumption failed. |
|
66 |
||
13815 | 67 |
* Pure: Locale specifications now produce predicate definitions |
13410
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
68 |
according to the body of text (covering assumptions modulo local |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
69 |
definitions); predicate "loc_axioms" covers newly introduced text, |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
70 |
while "loc" is cumulative wrt. all included locale expressions; the |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
71 |
latter view is presented only on export into the global theory |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
72 |
context; potential INCOMPATIBILITY, use "(open)" option to fall back |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
73 |
on the old view without predicates; |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
74 |
|
13459
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset
|
75 |
* Pure: predefined locales "var" and "struct" are useful for sharing |
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset
|
76 |
parameters (as in CASL, for example); just specify something like |
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset
|
77 |
``var x + var y + struct M'' as import; |
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset
|
78 |
|
13463
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
79 |
* Pure: improved thms_containing: proper indexing of facts instead of |
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
80 |
raw theorems; check validity of results wrt. current name space; |
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
81 |
include local facts of proof configuration (also covers active |
13541 | 82 |
locales), cover fixed variables in index; may use "_" in term |
83 |
specification; an optional limit for the number of printed facts may |
|
84 |
be given (the default is 40); |
|
85 |
||
86 |
* Pure: disallow duplicate fact bindings within new-style theory files |
|
87 |
(batch-mode only); |
|
13540
aede0306e214
* Pure: disallow duplicate fact bindings within new-style theory files;
wenzelm
parents:
13522
diff
changeset
|
88 |
|
13463
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
89 |
* Provers: improved induct method: assumptions introduced by case |
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
90 |
"foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from |
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
91 |
the goal statement); "foo" still refers to all facts collectively; |
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
92 |
|
13550 | 93 |
* Provers: the function blast.overloaded has been removed: all constants |
94 |
are regarded as potentially overloaded, which improves robustness in exchange |
|
95 |
for slight decrease in efficiency; |
|
96 |
||
13781 | 97 |
* Provers/linorder: New generic prover for transitivity reasoning over |
98 |
linear orders. Note: this prover is not efficient! |
|
99 |
||
13522
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset
|
100 |
* Isar: preview of problems to finish 'show' now produce an error |
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset
|
101 |
rather than just a warning (in interactive mode); |
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset
|
102 |
|
13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
103 |
|
13158 | 104 |
*** HOL *** |
105 |
||
13899 | 106 |
* arith(_tac) |
107 |
||
108 |
- Produces a counter example if it cannot prove a goal. |
|
109 |
Note that the counter example may be spurious if the goal is not a formula |
|
110 |
of quantifier-free linear arithmetic. |
|
111 |
In ProofGeneral the counter example appears in the trace buffer. |
|
112 |
||
113 |
- Knows about div k and mod k where k is a numeral of type nat or int. |
|
114 |
||
115 |
- Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free |
|
116 |
linear arithmetic fails. This takes account of quantifiers and divisibility. |
|
117 |
Presburger arithmetic can also be called explicitly via presburger(_tac). |
|
118 |
||
119 |
* simp's arithmetic capabilities have been enhanced a bit: it now |
|
120 |
takes ~= in premises into account (by performing a case split); |
|
121 |
||
122 |
* simp reduces "m*(n div m) + n mod m" to n, even if the two summands |
|
123 |
are distributed over a sum of terms; |
|
124 |
||
13735 | 125 |
* New tactic "trans_tac" and method "trans" instantiate |
126 |
Provers/linorder.ML for axclasses "order" and "linorder" (predicates |
|
127 |
"<=", "<" and "="). |
|
128 |
||
13587 | 129 |
* function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main |
130 |
HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp"; |
|
131 |
||
13443 | 132 |
* 'typedef' command has new option "open" to suppress the set |
133 |
definition; |
|
134 |
||
13522
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset
|
135 |
* functions Min and Max on finite sets have been introduced (theory |
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset
|
136 |
Finite_Set); |
13492 | 137 |
|
13443 | 138 |
* attribute [symmetric] now works for relations as well; it turns |
139 |
(x,y) : R^-1 into (y,x) : R, and vice versa; |
|
140 |
||
13613 | 141 |
* induct over a !!-quantified statement (say !!x1..xn): |
142 |
each "case" automatically performs "fix x1 .. xn" with exactly those names. |
|
143 |
||
13899 | 144 |
* Map: `empty' is no longer a constant but a syntactic abbreviation for |
145 |
%x. None. Warning: empty_def now refers to the previously hidden definition |
|
146 |
of the empty set. |
|
147 |
||
13549 | 148 |
* Real/HahnBanach: updated and adapted to locales; |
149 |
||
13872 | 150 |
* GroupTheory: converted to Isar theories, using locales with implicit |
151 |
structures. Also a new, experimental summation operator for abelian groups; |
|
152 |
||
153 |
* NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad, Gray and |
|
154 |
Kramer); |
|
155 |
||
156 |
* UNITY: added the Meier-Sanders theory of progress sets; |
|
157 |
||
13549 | 158 |
|
159 |
*** ZF *** |
|
160 |
||
161 |
* ZF/Constructible: consistency proof for AC (Gödel's constructible |
|
162 |
universe, etc.); |
|
163 |
||
13872 | 164 |
* Main ZF: virtually all theories converted to new-style format; |
13518 | 165 |
|
13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
166 |
|
13478 | 167 |
*** ML *** |
168 |
||
169 |
* Pure: Tactic.prove provides sane interface for internal proofs; |
|
170 |
omits the infamous "standard" operation, so this is more appropriate |
|
171 |
than prove_goalw_cterm in many situations (e.g. in simprocs); |
|
172 |
||
173 |
* Pure: improved error reporting of simprocs; |
|
174 |
||
175 |
* Provers: Simplifier.simproc(_i) provides sane interface for setting |
|
176 |
up simprocs; |
|
177 |
||
178 |
||
13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
179 |
|
12984 | 180 |
New in Isabelle2002 (March 2002) |
181 |
-------------------------------- |
|
11474 | 182 |
|
11572 | 183 |
*** Document preparation *** |
184 |
||
11842
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
185 |
* greatly simplified document preparation setup, including more |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
186 |
graceful interpretation of isatool usedir -i/-d/-D options, and more |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
187 |
instructive isatool mkdir; users should basically be able to get |
12899
7d5b690253ee
"isatool usedir -D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset
|
188 |
started with "isatool mkdir HOL Test && isatool make"; alternatively, |
7d5b690253ee
"isatool usedir -D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset
|
189 |
users may run a separate document processing stage manually like this: |
7d5b690253ee
"isatool usedir -D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset
|
190 |
"isatool usedir -D output HOL Test && isatool document Test/output"; |
11842
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
191 |
|
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
192 |
* theory dependency graph may now be incorporated into documents; |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
193 |
isatool usedir -g true will produce session_graph.eps/.pdf for use |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
194 |
with \includegraphics of LaTeX; |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
195 |
|
11864
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset
|
196 |
* proper spacing of consecutive markup elements, especially text |
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset
|
197 |
blocks after section headings; |
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset
|
198 |
|
11572 | 199 |
* support bold style (for single symbols only), input syntax is like |
200 |
this: "\<^bold>\<alpha>" or "\<^bold>A"; |
|
201 |
||
11814 | 202 |
* \<bullet> is now output as bold \cdot by default, which looks much |
11572 | 203 |
better in printed text; |
204 |
||
11712
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset
|
205 |
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>; |
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset
|
206 |
note that these symbols are currently unavailable in Proof General / |
12769 | 207 |
X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>; |
12690 | 208 |
|
209 |
* isatool latex no longer depends on changed TEXINPUTS, instead |
|
210 |
isatool document copies the Isabelle style files to the target |
|
211 |
location; |
|
11712
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset
|
212 |
|
11572 | 213 |
|
11633 | 214 |
*** Isar *** |
215 |
||
12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
216 |
* Pure/Provers: improved proof by cases and induction; |
12280 | 217 |
- 'case' command admits impromptu naming of parameters (such as |
218 |
"case (Suc n)"); |
|
219 |
- 'induct' method divinates rule instantiation from the inductive |
|
220 |
claim; no longer requires excessive ?P bindings for proper |
|
221 |
instantiation of cases; |
|
222 |
- 'induct' method properly enumerates all possibilities of set/type |
|
223 |
rules; as a consequence facts may be also passed through *type* |
|
224 |
rules without further ado; |
|
225 |
- 'induct' method now derives symbolic cases from the *rulified* |
|
226 |
rule (before it used to rulify cases stemming from the internal |
|
227 |
atomized version); this means that the context of a non-atomic |
|
228 |
statement becomes is included in the hypothesis, avoiding the |
|
229 |
slightly cumbersome show "PROP ?case" form; |
|
230 |
- 'induct' may now use elim-style induction rules without chaining |
|
231 |
facts, using ``missing'' premises from the goal state; this allows |
|
232 |
rules stemming from inductive sets to be applied in unstructured |
|
233 |
scripts, while still benefitting from proper handling of non-atomic |
|
234 |
statements; NB: major inductive premises need to be put first, all |
|
235 |
the rest of the goal is passed through the induction; |
|
236 |
- 'induct' proper support for mutual induction involving non-atomic |
|
237 |
rule statements (uses the new concept of simultaneous goals, see |
|
238 |
below); |
|
12853 | 239 |
- append all possible rule selections, but only use the first |
240 |
success (no backtracking); |
|
11995
4a622f5fb164
- 'induct' may now use elim-style induction rules without chaining
wenzelm
parents:
11986
diff
changeset
|
241 |
- removed obsolete "(simplified)" and "(stripped)" options of methods; |
12754
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset
|
242 |
- undeclared rule case names default to numbers 1, 2, 3, ...; |
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset
|
243 |
- added 'print_induct_rules' (covered by help item in recent Proof |
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset
|
244 |
General versions); |
11995
4a622f5fb164
- 'induct' may now use elim-style induction rules without chaining
wenzelm
parents:
11986
diff
changeset
|
245 |
- moved induct/cases attributes to Pure, methods to Provers; |
4a622f5fb164
- 'induct' may now use elim-style induction rules without chaining
wenzelm
parents:
11986
diff
changeset
|
246 |
- generic method setup instantiated for FOL and HOL; |
11986
26b95a6f3f79
- 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset
|
247 |
|
12163
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
248 |
* Pure: support multiple simultaneous goal statements, for example |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
249 |
"have a: A and b: B" (same for 'theorem' etc.); being a pure |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
250 |
meta-level mechanism, this acts as if several individual goals had |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
251 |
been stated separately; in particular common proof methods need to be |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
252 |
repeated in order to cover all claims; note that a single elimination |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
253 |
step is *not* sufficient to establish the two conjunctions, so this |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
254 |
fails: |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
255 |
|
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
256 |
assume "A & B" then have A and B .. (*".." fails*) |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
257 |
|
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
258 |
better use "obtain" in situations as above; alternative refer to |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
259 |
multi-step methods like 'auto', 'simp_all', 'blast+' etc.; |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
260 |
|
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
261 |
* Pure: proper integration with ``locales''; unlike the original |
12210
2f510d8d8291
* ZF: new-style theory commands '(co)inductive', '(co)datatype',
wenzelm
parents:
12177
diff
changeset
|
262 |
version by Florian Kammüller, Isar locales package high-level proof |
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
263 |
contexts rather than raw logical ones (e.g. we admit to include |
12280 | 264 |
attributes everywhere); operations on locales include merge and |
12964 | 265 |
rename; support for implicit arguments (``structures''); simultaneous |
266 |
type-inference over imports and text; see also HOL/ex/Locales.thy for |
|
267 |
some examples; |
|
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
268 |
|
12707
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
269 |
* Pure: the following commands have been ``localized'', supporting a |
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
270 |
target locale specification "(in name)": 'lemma', 'theorem', |
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
271 |
'corollary', 'lemmas', 'theorems', 'declare'; the results will be |
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
272 |
stored both within the locale and at the theory level (exported and |
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
273 |
qualified by the locale name); |
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
274 |
|
12964 | 275 |
* Pure: theory goals may now be specified in ``long'' form, with |
276 |
ad-hoc contexts consisting of arbitrary locale elements. for example |
|
277 |
``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and |
|
278 |
definitions may be given, too); the result is a meta-level rule with |
|
279 |
the context elements being discharged in the obvious way; |
|
280 |
||
281 |
* Pure: new proof command 'using' allows to augment currently used |
|
282 |
facts after a goal statement ('using' is syntactically analogous to |
|
283 |
'apply', but acts on the goal's facts only); this allows chained facts |
|
284 |
to be separated into parts given before and after a claim, as in |
|
285 |
``from a and b have C using d and e <proof>''; |
|
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
286 |
|
11722 | 287 |
* Pure: renamed "antecedent" case to "rule_context"; |
288 |
||
12964 | 289 |
* Pure: new 'judgment' command records explicit information about the |
290 |
object-logic embedding (used by several tools internally); no longer |
|
291 |
use hard-wired "Trueprop"; |
|
292 |
||
11738 | 293 |
* Pure: added 'corollary' command; |
294 |
||
11722 | 295 |
* Pure: fixed 'token_translation' command; |
296 |
||
11899 | 297 |
* Pure: removed obsolete 'exported' attribute; |
298 |
||
11933 | 299 |
* Pure: dummy pattern "_" in is/let is now automatically lifted over |
300 |
bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x") |
|
11899 | 301 |
supersedes more cumbersome ... (is "ALL x. _ x --> ?C x"); |
302 |
||
11952
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
303 |
* Pure: method 'atomize' presents local goal premises as object-level |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
304 |
statements (atomic meta-level propositions); setup controlled via |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
305 |
rewrite rules declarations of 'atomize' attribute; example |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
306 |
application: 'induct' method with proper rule statements in improper |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
307 |
proof *scripts*; |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
308 |
|
12106
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
309 |
* Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.) |
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
310 |
now consider the syntactic context of assumptions, giving a better |
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
311 |
chance to get type-inference of the arguments right (this is |
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
312 |
especially important for locales); |
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
313 |
|
12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
314 |
* Pure: "sorry" no longer requires quick_and_dirty in interactive |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
315 |
mode; |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
316 |
|
12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
317 |
* Pure/obtain: the formal conclusion "thesis", being marked as |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
318 |
``internal'', may no longer be reference directly in the text; |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
319 |
potential INCOMPATIBILITY, may need to use "?thesis" in rare |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
320 |
situations; |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
321 |
|
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
322 |
* Pure: generic 'sym' attribute which declares a rule both as pure |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
323 |
'elim?' and for the 'symmetric' operation; |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
324 |
|
12877
b9635eb8a448
* Isar/Pure: marginal comments ``--'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset
|
325 |
* Pure: marginal comments ``--'' may now occur just anywhere in the |
b9635eb8a448
* Isar/Pure: marginal comments ``--'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset
|
326 |
text; the fixed correlation with particular command syntax has been |
b9635eb8a448
* Isar/Pure: marginal comments ``--'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset
|
327 |
discontinued; |
b9635eb8a448
* Isar/Pure: marginal comments ``--'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset
|
328 |
|
13023
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
329 |
* Pure: new method 'rules' is particularly well-suited for proof |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
330 |
search in intuitionistic logic; a bit slower than 'blast' or 'fast', |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
331 |
but often produces more compact proof terms with less detours; |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
332 |
|
12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
333 |
* Pure/Provers/classical: simplified integration with pure rule |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
334 |
attributes and methods; the classical "intro?/elim?/dest?" |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
335 |
declarations coincide with the pure ones; the "rule" method no longer |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
336 |
includes classically swapped intros; "intro" and "elim" methods no |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
337 |
longer pick rules from the context; also got rid of ML declarations |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
338 |
AddXIs/AddXEs/AddXDs; all of this has some potential for |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
339 |
INCOMPATIBILITY; |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
340 |
|
12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
341 |
* Provers/classical: attribute 'swapped' produces classical inversions |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
342 |
of introduction rules; |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
343 |
|
12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
344 |
* Provers/simplifier: 'simplified' attribute may refer to explicit |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
345 |
rules instead of full simplifier context; 'iff' attribute handles |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
346 |
conditional rules; |
11936
fef099613354
* Provers: 'simplified' attribute may refer to explicit rules instead
wenzelm
parents:
11933
diff
changeset
|
347 |
|
11745
06cd8c3b5487
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm
parents:
11738
diff
changeset
|
348 |
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms; |
06cd8c3b5487
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm
parents:
11738
diff
changeset
|
349 |
|
11690 | 350 |
* HOL: 'recdef' now fails on unfinished automated proofs, use |
11633 | 351 |
"(permissive)" option to recover old behavior; |
352 |
||
11933 | 353 |
* HOL: 'inductive' no longer features separate (collective) attributes |
354 |
for 'intros' (was found too confusing); |
|
355 |
||
12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
356 |
* HOL: properly declared induction rules less_induct and |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
357 |
wf_induct_rule; |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
358 |
|
11788
60054fee3c16
canonical 'cases'/'induct' rules for n-tuples (n=3..7)
kleing
parents:
11745
diff
changeset
|
359 |
|
11474 | 360 |
*** HOL *** |
361 |
||
11702 | 362 |
* HOL: moved over to sane numeral syntax; the new policy is as |
363 |
follows: |
|
364 |
||
365 |
- 0 and 1 are polymorphic constants, which are defined on any |
|
366 |
numeric type (nat, int, real etc.); |
|
367 |
||
368 |
- 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based |
|
369 |
binary representation internally; |
|
370 |
||
371 |
- type nat has special constructor Suc, and generally prefers Suc 0 |
|
372 |
over 1::nat and Suc (Suc 0) over 2::nat; |
|
373 |
||
12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
374 |
This change may cause significant problems of INCOMPATIBILITY; here |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
375 |
are some hints on converting existing sources: |
11702 | 376 |
|
377 |
- due to the new "num" token, "-0" and "-1" etc. are now atomic |
|
378 |
entities, so expressions involving "-" (unary or binary minus) need |
|
379 |
to be spaced properly; |
|
380 |
||
381 |
- existing occurrences of "1" may need to be constraint "1::nat" or |
|
382 |
even replaced by Suc 0; similar for old "2"; |
|
383 |
||
384 |
- replace "#nnn" by "nnn", and "#-nnn" by "-nnn"; |
|
385 |
||
386 |
- remove all special provisions on numerals in proofs; |
|
387 |
||
13042 | 388 |
* HOL: simp rules nat_number expand numerals on nat to Suc/0 |
12837 | 389 |
representation (depends on bin_arith_simps in the default context); |
390 |
||
12736 | 391 |
* HOL: symbolic syntax for x^2 (numeral 2); |
392 |
||
12335
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
393 |
* HOL: the class of all HOL types is now called "type" rather than |
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
394 |
"term"; INCOMPATIBILITY, need to adapt references to this type class |
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
395 |
in axclass/classes, instance/arities, and (usually rare) occurrences |
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
396 |
in typings (of consts etc.); internally the class is called |
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
397 |
"HOL.type", ML programs should refer to HOLogic.typeS; |
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
398 |
|
12280 | 399 |
* HOL/record package improvements: |
400 |
- new derived operations "fields" to build a partial record section, |
|
401 |
"extend" to promote a fixed record to a record scheme, and |
|
402 |
"truncate" for the reverse; cf. theorems "xxx.defs", which are *not* |
|
403 |
declared as simp by default; |
|
12587
3f3d2ffb5df5
HOL/record: shared operations ("more", "fields", etc.) now need to be
wenzelm
parents:
12564
diff
changeset
|
404 |
- shared operations ("more", "fields", etc.) now need to be always |
3f3d2ffb5df5
HOL/record: shared operations ("more", "fields", etc.) now need to be
wenzelm
parents:
12564
diff
changeset
|
405 |
qualified) --- potential INCOMPATIBILITY; |
12280 | 406 |
- removed "make_scheme" operations (use "make" with "extend") -- |
407 |
INCOMPATIBILITY; |
|
11937 | 408 |
- removed "more" class (simply use "term") -- INCOMPATIBILITY; |
12253 | 409 |
- provides cases/induct rules for use with corresponding Isar |
410 |
methods (for concrete records, record schemes, concrete more |
|
12280 | 411 |
parts, and schematic more parts -- in that order); |
11930 | 412 |
- internal definitions directly based on a light-weight abstract |
413 |
theory of product types over typedef rather than datatype; |
|
414 |
||
13023
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
415 |
* HOL: generic code generator for generating executable ML code from |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
416 |
specifications; specific support for HOL constructs such as inductive |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
417 |
datatypes and sets, as well as recursive functions; can be invoked |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
418 |
via 'generate_code' theory section; |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
419 |
|
11933 | 420 |
* HOL: canonical cases/induct rules for n-tuples (n = 3..7); |
421 |
||
13824 | 422 |
* HOL: consolidated and renamed several theories. In particular: |
423 |
Ord.thy has been absorbed into HOL.thy |
|
424 |
String.thy has been absorbed into List.thy |
|
425 |
||
11802
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset
|
426 |
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A" |
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset
|
427 |
(beware of argument permutation!); |
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset
|
428 |
|
11657 | 429 |
* HOL: linorder_less_split superseded by linorder_cases; |
430 |
||
12917 | 431 |
* HOL/List: "nodups" renamed to "distinct"; |
12889 | 432 |
|
11633 | 433 |
* HOL: added "The" definite description operator; move Hilbert's "Eps" |
13824 | 434 |
to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES: |
435 |
- Ex_def has changed, now need to use some_eq_ex |
|
11437 | 436 |
|
11572 | 437 |
* HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so |
438 |
in this (rare) case use: |
|
439 |
||
440 |
delSWrapper "split_all_tac" |
|
441 |
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) |
|
442 |
||
443 |
* HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS |
|
11474 | 444 |
MAY FAIL; |
11361 | 445 |
|
11572 | 446 |
* HOL: introduced f^n = f o ... o f; warning: due to the limits of |
447 |
Isabelle's type classes, ^ on functions and relations has too general |
|
448 |
a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be |
|
449 |
necessary to attach explicit type constraints; |
|
11307 | 450 |
|
12917 | 451 |
* HOL/Relation: the prefix name of the infix "O" has been changed from |
452 |
"comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been |
|
453 |
renamed accordingly (eg "compI" -> "rel_compI"). |
|
12489 | 454 |
|
11487
95071c9e85a3
* HOL: syntax translations now work properly with numerals and records
wenzelm
parents:
11475
diff
changeset
|
455 |
* HOL: syntax translations now work properly with numerals and records |
95071c9e85a3
* HOL: syntax translations now work properly with numerals and records
wenzelm
parents:
11475
diff
changeset
|
456 |
expressions; |
11474 | 457 |
|
12457
cbfc53e45476
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm
parents:
12405
diff
changeset
|
458 |
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead |
cbfc53e45476
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm
parents:
12405
diff
changeset
|
459 |
of "lam" -- INCOMPATIBILITY; |
11474 | 460 |
|
11933 | 461 |
* HOL: got rid of some global declarations (potential INCOMPATIBILITY |
462 |
for ML tools): const "()" renamed "Product_Type.Unity", type "unit" |
|
463 |
renamed "Product_Type.unit"; |
|
11611 | 464 |
|
12564 | 465 |
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl |
466 |
||
12924 | 467 |
* HOL: removed obsolete theorem "optionE" (use "option.exhaust", or |
468 |
the "cases" method); |
|
469 |
||
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
470 |
* HOL/GroupTheory: group theory examples including Sylow's theorem (by |
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
471 |
Florian Kammüller); |
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
472 |
|
12608
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
473 |
* HOL/IMP: updated and converted to new-style theory format; several |
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
474 |
parts turned into readable document, with proper Isar proof texts and |
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
475 |
some explanations (by Gerwin Klein); |
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
476 |
|
12734 | 477 |
* HOL-Real: added Complex_Numbers (by Gertrud Bauer); |
478 |
||
12690 | 479 |
* HOL-Hyperreal is now a logic image; |
480 |
||
11611 | 481 |
|
12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
482 |
*** HOLCF *** |
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
483 |
|
12622 | 484 |
* Isar: consts/constdefs supports mixfix syntax for continuous |
485 |
operations; |
|
486 |
||
487 |
* Isar: domain package adapted to new-style theory format, e.g. see |
|
488 |
HOLCF/ex/Dnat.thy; |
|
489 |
||
490 |
* theory Lift: proper use of rep_datatype lift instead of ML hacks -- |
|
12280 | 491 |
potential INCOMPATIBILITY; now use plain induct_tac instead of former |
492 |
lift.induct_tac, always use UU instead of Undef; |
|
12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
493 |
|
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
494 |
* HOLCF/IMP: updated and converted to new-style theory; |
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
495 |
|
12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
496 |
|
11474 | 497 |
*** ZF *** |
498 |
||
12622 | 499 |
* Isar: proper integration of logic-specific tools and packages, |
500 |
including theory commands '(co)inductive', '(co)datatype', |
|
501 |
'rep_datatype', 'inductive_cases', as well as methods 'ind_cases', |
|
502 |
'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC'); |
|
503 |
||
504 |
* theory Main no longer includes AC; for the Axiom of Choice, base |
|
505 |
your theory on Main_ZFC; |
|
506 |
||
507 |
* the integer library now covers quotients and remainders, with many |
|
508 |
laws relating division to addition, multiplication, etc.; |
|
12563 | 509 |
|
12280 | 510 |
* ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a |
511 |
typeless version of the formalism; |
|
512 |
||
13025 | 513 |
* ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory |
514 |
format; |
|
12608
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
515 |
|
12280 | 516 |
* ZF/Induct: new directory for examples of inductive definitions, |
12608
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
517 |
including theory Multiset for multiset orderings; converted to |
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
518 |
new-style theory format; |
12177
b1c16d685a99
* ZF: new-style theory commands 'inductive', 'inductive_cases', and
wenzelm
parents:
12163
diff
changeset
|
519 |
|
13025 | 520 |
* ZF: many new theorems about lists, ordinals, etc.; |
12850 | 521 |
|
11474 | 522 |
|
523 |
*** General *** |
|
524 |
||
12280 | 525 |
* Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference |
526 |
variable proof controls level of detail: 0 = no proofs (only oracle |
|
527 |
dependencies), 1 = lemma dependencies, 2 = compact proof terms; see |
|
528 |
also ref manual for further ML interfaces; |
|
529 |
||
530 |
* Pure/axclass: removed obsolete ML interface |
|
531 |
goal_subclass/goal_arity; |
|
532 |
||
533 |
* Pure/syntax: new token syntax "num" for plain numerals (without "#" |
|
534 |
of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now |
|
535 |
separate tokens, so expressions involving minus need to be spaced |
|
536 |
properly; |
|
537 |
||
12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
538 |
* Pure/syntax: support non-oriented infixes, using keyword "infix" |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
539 |
rather than "infixl" or "infixr"; |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
540 |
|
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
541 |
* Pure/syntax: concrete syntax for dummy type variables admits genuine |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
542 |
sort constraint specifications in type inference; e.g. "x::_::foo" |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
543 |
ensures that the type of "x" is of sort "foo" (but not necessarily a |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
544 |
type variable); |
12280 | 545 |
|
546 |
* Pure/syntax: print modes "type_brackets" and "no_type_brackets" |
|
547 |
control output of nested => (types); the default behavior is |
|
548 |
"type_brackets"; |
|
549 |
||
550 |
* Pure/syntax: builtin parse translation for "_constify" turns valued |
|
11817 | 551 |
tokens into AST constants; |
11474 | 552 |
|
12280 | 553 |
* Pure/syntax: prefer later declarations of translations and print |
554 |
translation functions; potential INCOMPATIBILITY: need to reverse |
|
555 |
multiple declarations for same syntax element constant; |
|
556 |
||
12832
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset
|
557 |
* Pure/show_hyps reset by default (in accordance to existing Isar |
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset
|
558 |
practice); |
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset
|
559 |
|
12280 | 560 |
* Provers/classical: renamed addaltern to addafter, addSaltern to |
561 |
addSafter; |
|
562 |
||
563 |
* Provers/clasimp: ``iff'' declarations now handle conditional rules |
|
564 |
as well; |
|
12253 | 565 |
|
12538 | 566 |
* system: tested support for MacOS X; should be able to get Isabelle + |
567 |
Proof General to work in a plain Terminal after installing Poly/ML |
|
568 |
(e.g. from the Isabelle distribution area) and GNU bash alone |
|
569 |
(e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol |
|
570 |
support requires further installations, e.g. from |
|
571 |
http://fink.sourceforge.net/); |
|
572 |
||
12280 | 573 |
* system: support Poly/ML 4.1.1 (able to manage larger heaps); |
11551 | 574 |
|
12753
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset
|
575 |
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead |
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset
|
576 |
of 40 MB), cf. ML_OPTIONS; |
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset
|
577 |
|
11633 | 578 |
* system: Proof General keywords specification is now part of the |
579 |
Isabelle distribution (see etc/isar-keywords.el); |
|
580 |
||
12728 | 581 |
* system: support for persistent Proof General sessions (refrain from |
582 |
outdating all loaded theories on startup); user may create writable |
|
583 |
logic images like this: ``isabelle -q HOL Test''; |
|
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
584 |
|
11551 | 585 |
* system: smart selection of Isabelle process versus Isabelle |
11572 | 586 |
interface, accommodates case-insensitive file systems (e.g. HFS+); may |
587 |
run both "isabelle" and "Isabelle" even if file names are badly |
|
588 |
damaged (executable inspects the case of the first letter of its own |
|
589 |
name); added separate "isabelle-process" and "isabelle-interface"; |
|
11551 | 590 |
|
12472 | 591 |
* system: refrain from any attempt at filtering input streams; no |
592 |
longer support ``8bit'' encoding of old isabelle font, instead proper |
|
593 |
iso-latin characters may now be used; the related isatools |
|
594 |
"symbolinput" and "nonascii" have disappeared as well; |
|
595 |
||
596 |
* system: removed old "xterm" interface (the print modes "xterm" and |
|
597 |
"xterm_color" are still available for direct use in a suitable |
|
598 |
terminal); |
|
599 |
||
11314 | 600 |
|
11169
98c2f741e32b
made split_all_tac safe introducing safe_full_simp_tac, EXISTING PROOFS MAY FAIL
oheimb
parents:
11130
diff
changeset
|
601 |
|
11062 | 602 |
New in Isabelle99-2 (February 2001) |
603 |
----------------------------------- |
|
604 |
||
10224 | 605 |
*** Overview of INCOMPATIBILITIES *** |
606 |
||
11241 | 607 |
* HOL: please note that theories in the Library and elsewhere often use the |
608 |
new-style (Isar) format; to refer to their theorems in an ML script you must |
|
12622 | 609 |
bind them to ML identifers by e.g. val thm_name = thm "thm_name"; |
11241 | 610 |
|
11043
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset
|
611 |
* HOL: inductive package no longer splits induction rule aggressively, |
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset
|
612 |
but only as far as specified by the introductions given; the old |
11130 | 613 |
format may be recovered via ML function complete_split_rule or attribute |
11043
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset
|
614 |
'split_rule (complete)'; |
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset
|
615 |
|
10998 | 616 |
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, |
617 |
gfp_Tarski to gfp_unfold; |
|
10224 | 618 |
|
10288 | 619 |
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; |
620 |
||
10858 | 621 |
* HOL: infix "dvd" now has priority 50 rather than 70 (because it is a |
622 |
relation); infix "^^" has been renamed "``"; infix "``" has been |
|
623 |
renamed "`"; "univalent" has been renamed "single_valued"; |
|
10793 | 624 |
|
10998 | 625 |
* HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse" |
626 |
operation; |
|
627 |
||
10868 | 628 |
* HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>; |
10856 | 629 |
|
10391 | 630 |
* Isar: 'obtain' no longer declares "that" fact as simp/intro; |
631 |
||
10401
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
632 |
* Isar/HOL: method 'induct' now handles non-atomic goals; as a |
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
633 |
consequence, it is no longer monotonic wrt. the local goal context |
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
634 |
(which is now passed through the inductive cases); |
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
635 |
|
10976
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset
|
636 |
* Document preparation: renamed standard symbols \<ll> to \<lless> and |
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset
|
637 |
\<gg> to \<ggreater>; |
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset
|
638 |
|
10224 | 639 |
|
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
640 |
*** Document preparation *** |
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
641 |
|
10858 | 642 |
* \isabellestyle{NAME} selects version of Isabelle output (currently |
643 |
available: are "it" for near math-mode best-style output, "sl" for |
|
644 |
slanted text style, and "tt" for plain type-writer; if no |
|
645 |
\isabellestyle command is given, output is according to slanted |
|
646 |
type-writer); |
|
647 |
||
10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset
|
648 |
* support sub/super scripts (for single symbols only), input syntax is |
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset
|
649 |
like this: "A\<^sup>*" or "A\<^sup>\<star>"; |
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset
|
650 |
|
10858 | 651 |
* some more standard symbols; see Appendix A of the system manual for |
11062 | 652 |
the complete list of symbols defined in isabellesym.sty; |
10858 | 653 |
|
10998 | 654 |
* improved isabelle style files; more abstract symbol implementation |
655 |
(should now use \isamath{...} and \isatext{...} in custom symbol |
|
656 |
definitions); |
|
657 |
||
10634 | 658 |
* antiquotation @{goals} and @{subgoals} for output of *dynamic* goals |
659 |
state; Note that presentation of goal states does not conform to |
|
660 |
actual human-readable proof documents. Please do not include goal |
|
661 |
states into document output unless you really know what you are doing! |
|
10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset
|
662 |
|
11062 | 663 |
* proper indentation of antiquoted output with proportional LaTeX |
664 |
fonts; |
|
10862 | 665 |
|
11050
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset
|
666 |
* no_document ML operator temporarily disables LaTeX document |
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset
|
667 |
generation; |
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset
|
668 |
|
11062 | 669 |
* isatool unsymbolize tunes sources for plain ASCII communication; |
670 |
||
10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset
|
671 |
|
10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset
|
672 |
*** Isar *** |
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset
|
673 |
|
10547 | 674 |
* Pure: Isar now suffers initial goal statements to contain unbound |
675 |
schematic variables (this does not conform to actual readable proof |
|
676 |
documents, due to unpredictable outcome and non-compositional proof |
|
677 |
checking); users who know what they are doing may use schematic goals |
|
678 |
for Prolog-style synthesis of proven results; |
|
679 |
||
10391 | 680 |
* Pure: assumption method (an implicit finishing) now handles actual |
681 |
rules as well; |
|
682 |
||
683 |
* Pure: improved 'obtain' --- moved to Pure, insert "that" into |
|
684 |
initial goal, declare "that" only as Pure intro (only for single |
|
685 |
steps); the "that" rule assumption may now be involved in implicit |
|
686 |
finishing, thus ".." becomes a feasible for trivial obtains; |
|
687 |
||
688 |
* Pure: default proof step now includes 'intro_classes'; thus trivial |
|
689 |
instance proofs may be performed by ".."; |
|
690 |
||
691 |
* Pure: ?thesis / ?this / "..." now work for pure meta-level |
|
692 |
statements as well; |
|
10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset
|
693 |
|
11097 | 694 |
* Pure: more robust selection of calculational rules; |
695 |
||
10858 | 696 |
* Pure: the builtin notion of 'finished' goal now includes the ==-refl |
697 |
rule (as well as the assumption rule); |
|
698 |
||
699 |
* Pure: 'thm_deps' command visualizes dependencies of theorems and |
|
700 |
lemmas, using the graph browser tool; |
|
701 |
||
10944 | 702 |
* Pure: predict failure of "show" in interactive mode; |
703 |
||
11016
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset
|
704 |
* Pure: 'thms_containing' now takes actual terms as arguments; |
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset
|
705 |
|
10401
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
706 |
* HOL: improved method 'induct' --- now handles non-atomic goals |
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
707 |
(potential INCOMPATIBILITY); tuned error handling; |
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
708 |
|
10557 | 709 |
* HOL: cases and induct rules now provide explicit hints about the |
10547 | 710 |
number of facts to be consumed (0 for "type" and 1 for "set" rules); |
711 |
any remaining facts are inserted into the goal verbatim; |
|
712 |
||
10858 | 713 |
* HOL: local contexts (aka cases) may now contain term bindings as |
714 |
well; the 'cases' and 'induct' methods new provide a ?case binding for |
|
715 |
the result to be shown in each case; |
|
716 |
||
10770 | 717 |
* HOL: added 'recdef_tc' command; |
718 |
||
11016
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset
|
719 |
* isatool convert assists in eliminating legacy ML scripts; |
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset
|
720 |
|
10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset
|
721 |
|
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
722 |
*** HOL *** |
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
723 |
|
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
724 |
* HOL/Library: a collection of generic theories to be used together |
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
725 |
with main HOL; the theory loader path already includes this directory |
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
726 |
by default; the following existing theories have been moved here: |
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
727 |
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While |
10337 | 728 |
(as While_Combinator), HOL/Lex/Prefix (as List_Prefix); |
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
729 |
|
10966 | 730 |
* HOL/Unix: "Some aspects of Unix file-system security", a typical |
731 |
modelling and verification task performed in Isabelle/HOL + |
|
732 |
Isabelle/Isar + Isabelle document preparation (by Markus Wenzel). |
|
733 |
||
11094 | 734 |
* HOL/Algebra: special summation operator SUM no longer exists, it has |
735 |
been replaced by setsum; infix 'assoc' now has priority 50 (like |
|
736 |
'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to |
|
737 |
'domain', this makes the theory consistent with mathematical |
|
738 |
literature; |
|
739 |
||
10514 | 740 |
* HOL basics: added overloaded operations "inverse" and "divide" |
10726 | 741 |
(infix "/"), syntax for generic "abs" operation, generic summation |
11094 | 742 |
operator \<Sum>; |
10452
abeefb0a79ae
* added overloaded operations "inverse" and "divide" (infix "/");
wenzelm
parents:
10428
diff
changeset
|
743 |
|
10391 | 744 |
* HOL/typedef: simplified package, provide more useful rules (see also |
745 |
HOL/subset.thy); |
|
746 |
||
10915
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
747 |
* HOL/datatype: induction rule for arbitrarily branching datatypes is |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
748 |
now expressed as a proper nested rule (old-style tactic scripts may |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
749 |
require atomize_strip_tac to cope with non-atomic premises); |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
750 |
|
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
751 |
* HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
752 |
to "split_conv" (old name still available for compatibility); |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
753 |
|
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
754 |
* HOL: improved concrete syntax for strings (e.g. allows translation |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
755 |
rules with string literals); |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
756 |
|
12245 | 757 |
* HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals |
758 |
and Fleuriot's mechanization of analysis, including the transcendental |
|
759 |
functions for the reals; |
|
10756 | 760 |
|
11094 | 761 |
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; |
10391 | 762 |
|
10858 | 763 |
|
10474 | 764 |
*** CTT *** |
765 |
||
10547 | 766 |
* CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that |
767 |
"lam" is displayed as TWO lambda-symbols |
|
10474 | 768 |
|
10547 | 769 |
* CTT: theory Main now available, containing everything (that is, Bool |
770 |
and Arith); |
|
771 |
||
10474 | 772 |
|
10391 | 773 |
*** General *** |
774 |
||
10547 | 775 |
* Pure: the Simplifier has been implemented properly as a derived rule |
776 |
outside of the actual kernel (at last!); the overall performance |
|
777 |
penalty in practical applications is about 50%, while reliability of |
|
778 |
the Isabelle inference kernel has been greatly improved; |
|
779 |
||
11112 | 780 |
* print modes "brackets" and "no_brackets" control output of nested => |
781 |
(types) and ==> (props); the default behaviour is "brackets"; |
|
782 |
||
10391 | 783 |
* Provers: fast_tac (and friends) now handle actual object-logic rules |
784 |
as assumptions as well; |
|
785 |
||
11124 | 786 |
* system: support Poly/ML 4.0; |
787 |
||
788 |
* system: isatool install handles KDE version 1 or 2; |
|
789 |
||
10391 | 790 |
|
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
791 |
|
10103 | 792 |
New in Isabelle99-1 (October 2000) |
793 |
---------------------------------- |
|
8015 | 794 |
|
10003 | 795 |
*** Overview of INCOMPATIBILITIES *** |
8014 | 796 |
|
8848 | 797 |
* HOL: simplification of natural numbers is much changed; to partly |
798 |
recover the old behaviour (e.g. to prevent n+n rewriting to #2*n) |
|
799 |
issue the following ML commands: |
|
800 |
||
801 |
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; |
|
802 |
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; |
|
8788 | 803 |
|
10129 | 804 |
* HOL: simplification no longer dives into case-expressions; this is |
805 |
controlled by "t.weak_case_cong" for each datatype t; |
|
10003 | 806 |
|
807 |
* HOL: nat_less_induct renamed to less_induct; |
|
808 |
||
809 |
* HOL: systematic renaming of the SOME (Eps) rules, may use isatool |
|
810 |
fixsome to patch .thy and .ML sources automatically; |
|
8967 | 811 |
|
10003 | 812 |
select_equality -> some_equality |
813 |
select_eq_Ex -> some_eq_ex |
|
814 |
selectI2EX -> someI2_ex |
|
815 |
selectI2 -> someI2 |
|
816 |
selectI -> someI |
|
817 |
select1_equality -> some1_equality |
|
818 |
Eps_sym_eq -> some_sym_eq_trivial |
|
819 |
Eps_eq -> some_eq_trivial |
|
820 |
||
821 |
* HOL: exhaust_tac on datatypes superceded by new generic case_tac; |
|
822 |
||
823 |
* HOL: removed obsolete theorem binding expand_if (refer to split_if |
|
824 |
instead); |
|
825 |
||
826 |
* HOL: the recursion equations generated by 'recdef' are now called |
|
827 |
f.simps instead of f.rules; |
|
828 |
||
829 |
* HOL: qed_spec_mp now also handles bounded ALL as well; |
|
830 |
||
831 |
* HOL: 0 is now overloaded, so the type constraint ":: nat" may |
|
832 |
sometimes be needed; |
|
833 |
||
834 |
* HOL: the constant for "f``x" is now "image" rather than "op ``"; |
|
8014 | 835 |
|
10065 | 836 |
* HOL: the constant for "f-``x" is now "vimage" rather than "op -``"; |
837 |
||
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
838 |
* HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
839 |
product is now "<*>" instead of "Times"; the lexicographic product is |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
840 |
now "<*lex*>" instead of "**"; |
8705 | 841 |
|
10003 | 842 |
* HOL: theory Sexp is now in HOL/Induct examples (it used to be part |
843 |
of main HOL, but was unused); better use HOL's datatype package; |
|
9971 | 844 |
|
10137
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
845 |
* HOL: removed "symbols" syntax for constant "override" of theory Map; |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
846 |
the old syntax may be recovered as follows: |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
847 |
|
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
848 |
syntax (symbols) |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
849 |
override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)" |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
850 |
(infixl "\\<oplus>" 100) |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
851 |
|
8848 | 852 |
* HOL/Real: "rabs" replaced by overloaded "abs" function; |
853 |
||
8887
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset
|
854 |
* HOL/ML: even fewer consts are declared as global (see theories Ord, |
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset
|
855 |
Lfp, Gfp, WF); this only affects ML packages that refer to const names |
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset
|
856 |
internally; |
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset
|
857 |
|
10003 | 858 |
* HOL and ZF: syntax for quotienting wrt an equivalence relation |
859 |
changed from A/r to A//r; |
|
9908 | 860 |
|
10003 | 861 |
* ZF: new treatment of arithmetic (nat & int) may break some old |
862 |
proofs; |
|
8921
7c04c98132c4
* Pure: changed syntax of local blocks from {{ }} to { };
wenzelm
parents:
8887
diff
changeset
|
863 |
|
10003 | 864 |
* Isar: renamed some attributes (RS -> THEN, simplify -> simplified, |
865 |
rulify -> rule_format, elimify -> elim_format, ...); |
|
9542 | 866 |
|
9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
867 |
* Isar/Provers: intro/elim/dest attributes changed; renamed |
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
868 |
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one |
9937 | 869 |
should have to change intro!! to intro? only); replaced "delrule" by |
870 |
"rule del"; |
|
9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset
|
871 |
|
9612 | 872 |
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; |
873 |
||
9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset
|
874 |
* Provers: strengthened force_tac by using new first_best_tac; |
9402 | 875 |
|
10003 | 876 |
* LaTeX document preparation: several changes of isabelle.sty (see |
877 |
lib/texinputs); |
|
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
878 |
|
8014 | 879 |
|
8487 | 880 |
*** Document preparation *** |
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
881 |
|
9198
0ab3c81e9425
* formal comments (text blocks etc.) in new-style theories may now
wenzelm
parents:
9185
diff
changeset
|
882 |
* formal comments (text blocks etc.) in new-style theories may now |
9753 | 883 |
contain antiquotations of thm/prop/term/typ/text to be presented |
884 |
according to latex print mode; concrete syntax is like this: |
|
885 |
@{term[show_types] "f(x) = a + x"}; |
|
9198
0ab3c81e9425
* formal comments (text blocks etc.) in new-style theories may now
wenzelm
parents:
9185
diff
changeset
|
886 |
|
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
887 |
* isatool mkdir provides easy setup of Isabelle session directories, |
8518 | 888 |
including proper document sources; |
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
889 |
|
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
890 |
* generated LaTeX sources are now deleted after successful run |
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
891 |
(isatool document -c); may retain a copy somewhere else via -D option |
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
892 |
of isatool usedir; |
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
893 |
|
8566 | 894 |
* isatool usedir -D now lets isatool latex -o sty update the Isabelle |
10003 | 895 |
style files, achieving self-contained LaTeX sources and simplifying |
896 |
LaTeX debugging; |
|
8566 | 897 |
|
8518 | 898 |
* old-style theories now produce (crude) LaTeX output as well; |
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
899 |
|
9057
af1ca1acf292
* browser info session directories are now self-contained (may be put
wenzelm
parents:
9052
diff
changeset
|
900 |
* browser info session directories are now self-contained (may be put |
9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset
|
901 |
on WWW server seperately); improved graphs of nested sessions; removed |
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset
|
902 |
graph for 'all sessions'; |
9057
af1ca1acf292
* browser info session directories are now self-contained (may be put
wenzelm
parents:
9052
diff
changeset
|
903 |
|
10003 | 904 |
* several improvements in isabelle style files; \isabellestyle{it} |
905 |
produces fake math mode output; \isamarkupheader is now \section by |
|
906 |
default; see lib/texinputs/isabelle.sty etc.; |
|
9489
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
907 |
|
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
908 |
|
8184 | 909 |
*** Isar *** |
910 |
||
10003 | 911 |
* Isar/Pure: local results and corresponding term bindings are now |
912 |
subject to Hindley-Milner polymorphism (similar to ML); this |
|
913 |
accommodates incremental type-inference very nicely; |
|
8283
0a319c5746eb
* Pure now provides its own version of intro/elim/dest attributes;
wenzelm
parents:
8271
diff
changeset
|
914 |
|
10003 | 915 |
* Isar/Pure: new derived language element 'obtain' supports |
916 |
generalized existence reasoning; |
|
8621
8ba0f90f6f35
* Isar/Pure: local results and corresponding term bindings are now
wenzelm
parents:
8603
diff
changeset
|
917 |
|
10003 | 918 |
* Isar/Pure: new calculational elements 'moreover' and 'ultimately' |
919 |
support accumulation of results, without applying any rules yet; |
|
920 |
useful to collect intermediate results without explicit name |
|
921 |
references, and for use with transitivity rules with more than 2 |
|
922 |
premises; |
|
8184 | 923 |
|
10003 | 924 |
* Isar/Pure: scalable support for case-analysis type proofs: new |
925 |
'case' language element refers to local contexts symbolically, as |
|
926 |
produced by certain proof methods; internally, case names are attached |
|
927 |
to theorems as "tags"; |
|
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
928 |
|
10003 | 929 |
* Isar/Pure: theory command 'hide' removes declarations from |
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
930 |
class/type/const name spaces; |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
931 |
|
10003 | 932 |
* Isar/Pure: theory command 'defs' supports option "(overloaded)" to |
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
933 |
indicate potential overloading; |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
934 |
|
10003 | 935 |
* Isar/Pure: changed syntax of local blocks from {{ }} to { }; |
8621
8ba0f90f6f35
* Isar/Pure: local results and corresponding term bindings are now
wenzelm
parents:
8603
diff
changeset
|
936 |
|
10003 | 937 |
* Isar/Pure: syntax of sorts made 'inner', i.e. have to write |
938 |
"{a,b,c}" instead of {a,b,c}; |
|
9011
0cfc347f8d19
Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms to
wenzelm
parents:
8994
diff
changeset
|
939 |
|
10003 | 940 |
* Isar/Pure now provides its own version of intro/elim/dest |
941 |
attributes; useful for building new logics, but beware of confusion |
|
942 |
with the version in Provers/classical; |
|
9612 | 943 |
|
10003 | 944 |
* Isar/Pure: the local context of (non-atomic) goals is provided via |
945 |
case name 'antecedent'; |
|
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
946 |
|
10003 | 947 |
* Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms |
948 |
to the current context is now done automatically); |
|
9383
c21fa1c48de0
* HOL: removed obsolete expand_if = split_if; theorems if_splits =
wenzelm
parents:
9349
diff
changeset
|
949 |
|
10003 | 950 |
* Isar/Pure: theory command 'method_setup' provides a simple interface |
951 |
for definining proof methods in ML; |
|
9612 | 952 |
|
10003 | 953 |
* Isar/Provers: intro/elim/dest attributes changed; renamed |
9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
954 |
intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in |
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
955 |
most cases, one should have to change intro!! to intro? only); |
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
956 |
replaced "delrule" by "rule del"; |
8283
0a319c5746eb
* Pure now provides its own version of intro/elim/dest attributes;
wenzelm
parents:
8271
diff
changeset
|
957 |
|
10003 | 958 |
* Isar/Provers: new 'hypsubst' method, plain 'subst' method and |
959 |
'symmetric' attribute (the latter supercedes [RS sym]); |
|
960 |
||
961 |
* Isar/Provers: splitter support (via 'split' attribute and 'simp' |
|
962 |
method modifier); 'simp' method: 'only:' modifier removes loopers as |
|
963 |
well (including splits); |
|
964 |
||
965 |
* Isar/Provers: Simplifier and Classical methods now support all kind |
|
966 |
of modifiers used in the past, including 'cong', 'iff', etc. |
|
967 |
||
968 |
* Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination |
|
969 |
of Simplifier and Classical reasoner); |
|
970 |
||
971 |
* Isar/HOL: new proof method 'cases' and improved version of 'induct' |
|
972 |
now support named cases; major packages (inductive, datatype, primrec, |
|
973 |
recdef) support case names and properly name parameters; |
|
9612 | 974 |
|
10003 | 975 |
* Isar/HOL: new transitivity rules for substitution in inequalities -- |
976 |
monotonicity conditions are extracted to be proven at end of |
|
977 |
calculations; |
|
978 |
||
979 |
* Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof |
|
980 |
method anyway; |
|
981 |
||
982 |
* Isar/HOL: removed old expand_if = split_if; theorems if_splits = |
|
983 |
split_if split_if_asm; datatype package provides theorems foo.splits = |
|
984 |
foo.split foo.split_asm for each datatype; |
|
985 |
||
986 |
* Isar/HOL: tuned inductive package, rename "intrs" to "intros" |
|
987 |
(potential INCOMPATIBILITY), emulation of mk_cases feature for proof |
|
988 |
scripts: new 'inductive_cases' command and 'ind_cases' method; (Note: |
|
989 |
use "(cases (simplified))" method in proper proof texts); |
|
990 |
||
991 |
* Isar/HOL: added global 'arith_split' attribute for 'arith' method; |
|
992 |
||
993 |
* Isar: names of theorems etc. may be natural numbers as well; |
|
994 |
||
995 |
* Isar: 'pr' command: optional arguments for goals_limit and |
|
9724
2030c5d63741
* 'pr' command: optional argument for ProofContext.prems_limit;
wenzelm
parents:
9709
diff
changeset
|
996 |
ProofContext.prems_limit; no longer prints theory contexts, but only |
2030c5d63741
* 'pr' command: optional argument for ProofContext.prems_limit;
wenzelm
parents:
9709
diff
changeset
|
997 |
proof states; |
8487 | 998 |
|
10003 | 999 |
* Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit |
8518 | 1000 |
additional print modes to be specified; e.g. "pr(latex)" will print |
1001 |
proof state according to the Isabelle LaTeX style; |
|
8487 | 1002 |
|
10003 | 1003 |
* Isar: improved support for emulating tactic scripts, including proof |
9612 | 1004 |
methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac', |
1005 |
'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac' |
|
1006 |
(for HOL datatypes); |
|
8534 | 1007 |
|
10003 | 1008 |
* Isar: simplified (more robust) goal selection of proof methods: 1st |
1009 |
goal, all goals, or explicit goal specifier (tactic emulation); thus |
|
1010 |
'proof method scripts' have to be in depth-first order; |
|
8673
987ea1a559d0
Isar: simplified (more robust) goal selection of proof methods;
wenzelm
parents:
8655
diff
changeset
|
1011 |
|
10003 | 1012 |
* Isar: tuned 'let' syntax: replaced 'as' keyword by 'and'; |
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
1013 |
|
10003 | 1014 |
* Isar: removed 'help' command, which hasn't been too helpful anyway; |
1015 |
should instead use individual commands for printing items |
|
1016 |
(print_commands, print_methods etc.); |
|
9224
0da360494917
* Isar: removed 'help' command, which hasn't been too helpful anyway;
wenzelm
parents:
9198
diff
changeset
|
1017 |
|
10003 | 1018 |
* Isar: added 'nothing' --- the empty list of theorems; |
9239 | 1019 |
|
8184 | 1020 |
|
8014 | 1021 |
*** HOL *** |
1022 |
||
10080 | 1023 |
* HOL/MicroJava: formalization of a fragment of Java, together with a |
1024 |
corresponding virtual machine and a specification of its bytecode |
|
1025 |
verifier and a lightweight bytecode verifier, including proofs of |
|
1026 |
type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and |
|
1027 |
Cornelia Pusch (see also the homepage of project Bali at |
|
1028 |
http://isabelle.in.tum.de/Bali/); |
|
1029 |
||
8518 | 1030 |
* HOL/Algebra: new theory of rings and univariate polynomials, by |
1031 |
Clemens Ballarin; |
|
8014 | 1032 |
|
10157
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
1033 |
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese |
10003 | 1034 |
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M |
1035 |
Rasmussen; |
|
8570 | 1036 |
|
10157
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
1037 |
* HOL/Lattice: fundamental concepts of lattice theory and order |
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
1038 |
structures, including duals, properties of bounds versus algebraic |
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
1039 |
laws, lattice operations versus set-theoretic ones, the Knaster-Tarski |
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
1040 |
Theorem for complete lattices etc.; may also serve as a demonstration |
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
1041 |
for abstract algebraic reasoning using axiomatic type classes, and |
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
1042 |
mathematics-style proof in Isabelle/Isar; by Markus Wenzel; |
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
1043 |
|
10003 | 1044 |
* HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David |
1045 |
von Oheimb; |
|
9542 | 1046 |
|
10164
c240747082aa
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm
parents:
10157
diff
changeset
|
1047 |
* HOL/IMPP: extension of IMP with local variables and mutually |
c240747082aa
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm
parents:
10157
diff
changeset
|
1048 |
recursive procedures, by David von Oheimb; |
c240747082aa
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm
parents:
10157
diff
changeset
|
1049 |
|
10003 | 1050 |
* HOL/Lambda: converted into new-style theory and document; |
9542 | 1051 |
|
10003 | 1052 |
* HOL/ex/Multiquote: example of multiple nested quotations and |
1053 |
anti-quotations -- basically a generalized version of de-Bruijn |
|
1054 |
representation; very useful in avoiding lifting of operations; |
|
8848 | 1055 |
|
9612 | 1056 |
* HOL/record: added general record equality rule to simpset; fixed |
1057 |
select-update simplification procedure to handle extended records as |
|
1058 |
well; admit "r" as field name; |
|
9542 | 1059 |
|
8967 | 1060 |
* HOL: 0 is now overloaded over the new sort "zero", allowing its use with |
1061 |
other numeric types and also as the identity of groups, rings, etc.; |
|
1062 |
||
1063 |
* HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity. |
|
1064 |
Types nat and int belong to this axclass; |
|
1065 |
||
10003 | 1066 |
* HOL: greatly improved simplification involving numerals of type nat, int, real: |
8788 | 1067 |
(i + #8 + j) = Suc k simplifies to #7 + (i + j) = k |
8832 | 1068 |
i*j + k + j*#3*i simplifies to #4*(i*j) + k |
1069 |
two terms #m*u and #n*u are replaced by #(m+n)*u |
|
1070 |
(where #m, #n and u can implicitly be 1; this is simproc combine_numerals) |
|
1071 |
and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y |
|
1072 |
or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals); |
|
8736 | 1073 |
|
10003 | 1074 |
* HOL: meson_tac is available (previously in ex/meson.ML); it is a |
1075 |
powerful prover for predicate logic but knows nothing of clasets; see |
|
1076 |
ex/mesontest.ML and ex/mesontest2.ML for example applications; |
|
9835 | 1077 |
|
8848 | 1078 |
* HOL: new version of "case_tac" subsumes both boolean case split and |
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
1079 |
"exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer |
8518 | 1080 |
exists, may define val exhaust_tac = case_tac for ad-hoc portability; |
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
1081 |
|
8848 | 1082 |
* HOL: simplification no longer dives into case-expressions: only the |
10129 | 1083 |
selector expression is simplified, but not the remaining arms; to |
1084 |
enable full simplification of case-expressions for datatype t, you may |
|
1085 |
remove t.weak_case_cong from the simpset, either globally (Delcongs |
|
1086 |
[thm"t.weak_case_cong"];) or locally (delcongs [...]). |
|
8603 | 1087 |
|
8848 | 1088 |
* HOL/recdef: the recursion equations generated by 'recdef' for |
1089 |
function 'f' are now called f.simps instead of f.rules; if all |
|
1090 |
termination conditions are proved automatically, these simplification |
|
1091 |
rules are added to the simpset, as in primrec; rules may be named |
|
1092 |
individually as well, resulting in a separate list of theorems for |
|
1093 |
each equation; |
|
1094 |
||
9489
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
1095 |
* HOL/While is a new theory that provides a while-combinator. It |
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
1096 |
permits the definition of tail-recursive functions without the |
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
1097 |
provision of a termination measure. The latter is necessary once the |
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
1098 |
invariant proof rule for while is applied. |
9457 | 1099 |
|
10003 | 1100 |
* HOL: new (overloaded) notation for the set of elements below/above |
1101 |
some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval. |
|
8925 | 1102 |
|
8848 | 1103 |
* HOL: theorems impI, allI, ballI bound as "strip"; |
1104 |
||
10003 | 1105 |
* HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic |
9746 | 1106 |
induct_tac th "x1 ... xn" expects th to have a conclusion of the form |
1107 |
P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th; |
|
1108 |
||
10003 | 1109 |
* HOL/Real: "rabs" replaced by overloaded "abs" function; |
9737 | 1110 |
|
10003 | 1111 |
* HOL: theory Sexp now in HOL/Induct examples (it used to be part of |
1112 |
main HOL, but was unused); |
|
8626 | 1113 |
|
10003 | 1114 |
* HOL: fewer consts declared as global (e.g. have to refer to |
1115 |
"Lfp.lfp" instead of "lfp" internally; affects ML packages only); |
|
8887
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset
|
1116 |
|
10003 | 1117 |
* HOL: tuned AST representation of nested pairs, avoiding bogus output |
1118 |
in case of overlap with user translations (e.g. judgements over |
|
1119 |
tuples); (note that the underlying logical represenation is still |
|
1120 |
bogus); |
|
9349
d43669fb423d
* tuned AST representation of nested pairs, avoiding bogus output in
wenzelm
parents:
9335
diff
changeset
|
1121 |
|
8412 | 1122 |
|
9542 | 1123 |
*** ZF *** |
1124 |
||
10003 | 1125 |
* ZF: simplification automatically cancels common terms in arithmetic |
1126 |
expressions over nat and int; |
|
9542 | 1127 |
|
10003 | 1128 |
* ZF: new treatment of nat to minimize type-checking: all operators |
1129 |
coerce their operands to a natural number using the function natify, |
|
1130 |
making the algebraic laws unconditional; |
|
9542 | 1131 |
|
10003 | 1132 |
* ZF: as above, for int: operators coerce their operands to an integer |
1133 |
using the function intify; |
|
9542 | 1134 |
|
10003 | 1135 |
* ZF: the integer library now contains many of the usual laws for the |
1136 |
orderings, including $<=, and monotonicity laws for $+ and $*; |
|
9542 | 1137 |
|
10003 | 1138 |
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic |
1139 |
simplification; |
|
9388 | 1140 |
|
10003 | 1141 |
* FOL and ZF: AddIffs now available, giving theorems of the form P<->Q |
1142 |
to the simplifier and classical reasoner simultaneously; |
|
9388 | 1143 |
|
1144 |
||
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
1145 |
*** General *** |
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
1146 |
|
10003 | 1147 |
* Provers: blast_tac now handles actual object-logic rules as |
1148 |
assumptions; note that auto_tac uses blast_tac internally as well; |
|
1149 |
||
1150 |
* Provers: new functions rulify/rulify_no_asm: thm -> thm for turning |
|
1151 |
outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm; |
|
1152 |
||
9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
1153 |
* Provers: delrules now handles destruct rules as well (no longer need |
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
1154 |
explicit make_elim); |
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
1155 |
|
10003 | 1156 |
* Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g. |
1157 |
[| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W |
|
1158 |
use instead the strong form, |
|
1159 |
[| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W |
|
1160 |
in HOL, FOL and ZF the function cla_make_elim will create such rules |
|
1161 |
from destruct-rules; |
|
9489
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
1162 |
|
9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
1163 |
* Provers: Simplifier.easy_setup provides a fast path to basic |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
1164 |
Simplifier setup for new object-logics; |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
1165 |
|
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
1166 |
* Pure: AST translation rules no longer require constant head on LHS; |
9349
d43669fb423d
* tuned AST representation of nested pairs, avoiding bogus output in
wenzelm
parents:
9335
diff
changeset
|
1167 |
|
9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
1168 |
* Pure: improved name spaces: ambiguous output is qualified; support |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
1169 |
for hiding of names; |
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
1170 |
|
10003 | 1171 |
* system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and |
1172 |
XSYMBOL_HOME; no longer need to do manual configuration in most |
|
1173 |
situations; |
|
1174 |
||
9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
1175 |
* system: compression of ML heaps images may now be controlled via -c |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
1176 |
option of isabelle and isatool usedir (currently only observed by |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
1177 |
Poly/ML); |
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
1178 |
|
9981
01a0c4772c18
system: isatool installfonts may handle X-Symbol fonts as well;
wenzelm
parents:
9971
diff
changeset
|
1179 |
* system: isatool installfonts may handle X-Symbol fonts as well (very |
01a0c4772c18
system: isatool installfonts may handle X-Symbol fonts as well;
wenzelm
parents:
9971
diff
changeset
|
1180 |
useful for remote X11); |
01a0c4772c18
system: isatool installfonts may handle X-Symbol fonts as well;
wenzelm
parents:
9971
diff
changeset
|
1181 |
|
9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
1182 |
* system: provide TAGS file for Isabelle sources; |
9052 | 1183 |
|
9288
06a55195741b
infix 'OF' is a version of 'MRS' with more appropriate argument order;
wenzelm
parents:
9239
diff
changeset
|
1184 |
* ML: infix 'OF' is a version of 'MRS' with more appropriate argument |
06a55195741b
infix 'OF' is a version of 'MRS' with more appropriate argument order;
wenzelm
parents:
9239
diff
changeset
|
1185 |
order; |
06a55195741b
infix 'OF' is a version of 'MRS' with more appropriate argument order;
wenzelm
parents:
9239
diff
changeset
|
1186 |
|
8994
803533fbb3ec
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
wenzelm
parents:
8991
diff
changeset
|
1187 |
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global |
803533fbb3ec
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
wenzelm
parents:
8991
diff
changeset
|
1188 |
timing flag supersedes proof_timing and Toplevel.trace; |
803533fbb3ec
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
wenzelm
parents:
8991
diff
changeset
|
1189 |
|
10003 | 1190 |
* ML: new combinators |>> and |>>> for incremental transformations |
1191 |
with secondary results (e.g. certain theory extensions): |
|
1192 |
||
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
1193 |
* ML: PureThy.add_defs gets additional argument to indicate potential |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
1194 |
overloading (usually false); |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
1195 |
|
10003 | 1196 |
* ML: PureThy.add_thms/add_axioms/add_defs now return theorems as |
1197 |
results; |
|
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
1198 |
|
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
1199 |
|
8015 | 1200 |
|
7986 | 1201 |
New in Isabelle99 (October 1999) |
1202 |
-------------------------------- |
|
4649 | 1203 |
|
5931 | 1204 |
*** Overview of INCOMPATIBILITIES (see below for more details) *** |
1205 |
||
6922 | 1206 |
* HOL: The THEN and ELSE parts of conditional expressions (if P then x else y) |
1207 |
are no longer simplified. (This allows the simplifier to unfold recursive |
|
1208 |
functional programs.) To restore the old behaviour, declare |
|
7215 | 1209 |
|
1210 |
Delcongs [if_weak_cong]; |
|
6922 | 1211 |
|
6269 | 1212 |
* HOL: Removed the obsolete syntax "Compl A"; use -A for set |
1213 |
complement; |
|
5931 | 1214 |
|
6269 | 1215 |
* HOL: the predicate "inj" is now defined by translation to "inj_on"; |
6174 | 1216 |
|
7847 | 1217 |
* HOL/datatype: mutual_induct_tac no longer exists -- |
1218 |
use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"] |
|
1219 |
||
6386
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
1220 |
* HOL/typedef: fixed type inference for representing set; type |
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
1221 |
arguments now have to occur explicitly on the rhs as type constraints; |
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
1222 |
|
6269 | 1223 |
* ZF: The con_defs part of an inductive definition may no longer refer |
1224 |
to constants declared in the same theory; |
|
6057 | 1225 |
|
6269 | 1226 |
* HOL, ZF: the function mk_cases, generated by the inductive |
1227 |
definition package, has lost an argument. To simplify its result, it |
|
1228 |
uses the default simpset instead of a supplied list of theorems. |
|
6141 | 1229 |
|
7215 | 1230 |
* HOL/List: the constructors of type list are now Nil and Cons; |
1231 |
||
7619 | 1232 |
* Simplifier: the type of the infix ML functions |
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
1233 |
setSSolver addSSolver setSolver addSolver |
7619 | 1234 |
is now simpset * solver -> simpset where `solver' is a new abstract type |
1235 |
for packaging solvers. A solver is created via |
|
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
1236 |
mk_solver: string -> (thm list -> int -> tactic) -> solver |
7619 | 1237 |
where the string argument is only a comment. |
6057 | 1238 |
|
7647
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset
|
1239 |
|
6069 | 1240 |
*** Proof tools *** |
1241 |
||
6343 | 1242 |
* Provers/Arith/fast_lin_arith.ML contains a functor for creating a |
1243 |
decision procedure for linear arithmetic. Currently it is used for |
|
7593 | 1244 |
types `nat', `int', and `real' in HOL (see below); it can, should and |
1245 |
will be instantiated for other types and logics as well. |
|
6069 | 1246 |
|
7324 | 1247 |
* The simplifier now accepts rewrite rules with flexible heads, eg |
1248 |
hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y |
|
1249 |
They are applied like any rule with a non-pattern lhs, i.e. by first-order |
|
1250 |
matching. |
|
6069 | 1251 |
|
7593 | 1252 |
|
6014 | 1253 |
*** General *** |
1254 |
||
7986 | 1255 |
* New Isabelle/Isar subsystem provides an alternative to traditional |
7215 | 1256 |
tactical theorem proving; together with the ProofGeneral/isar user |
1257 |
interface it offers an interactive environment for developing human |
|
1258 |
readable proof documents (Isar == Intelligible semi-automated |
|
7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
1259 |
reasoning); for further information see isatool doc isar-ref, |
7986 | 1260 |
src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/ |
7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
1261 |
|
9612 | 1262 |
* improved and simplified presentation of theories: better HTML markup |
1263 |
(including colors), graph views in several sizes; isatool usedir now |
|
1264 |
provides a proper interface for user theories (via -P option); actual |
|
1265 |
document preparation based on (PDF)LaTeX is available as well (for |
|
1266 |
new-style theories only); see isatool doc system for more information; |
|
7215 | 1267 |
|
7252 | 1268 |
* native support for Proof General, both for classic Isabelle and |
7986 | 1269 |
Isabelle/Isar; |
7215 | 1270 |
|
7791 | 1271 |
* ML function thm_deps visualizes dependencies of theorems and lemmas, |
1272 |
using the graph browser tool; |
|
1273 |
||
6751 | 1274 |
* Isabelle manuals now also available as PDF; |
1275 |
||
6449 | 1276 |
* theory loader rewritten from scratch (may not be fully |
1277 |
bug-compatible); old loadpath variable has been replaced by show_path, |
|
6671 | 1278 |
add_path, del_path, reset_path functions; new operations such as |
7593 | 1279 |
update_thy, touch_thy, remove_thy, use/update_thy_only (see also |
1280 |
isatool doc ref); |
|
6449 | 1281 |
|
7215 | 1282 |
* improved isatool install: option -k creates KDE application icon, |
1283 |
option -p DIR installs standalone binaries; |
|
1284 |
||
1285 |
* added ML_PLATFORM setting (useful for cross-platform installations); |
|
1286 |
more robust handling of platform specific ML images for SML/NJ; |
|
1287 |
||
7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
1288 |
* the settings environment is now statically scoped, i.e. it is never |
7986 | 1289 |
created again in sub-processes invoked from isabelle, isatool, or |
7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
1290 |
Isabelle; |
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
1291 |
|
7215 | 1292 |
* path element specification '~~' refers to '$ISABELLE_HOME'; |
1293 |
||
6343 | 1294 |
* in locales, the "assumes" and "defines" parts may be omitted if |
1295 |
empty; |
|
5973 | 1296 |
|
6269 | 1297 |
* new print_mode "xsymbols" for extended symbol support (e.g. genuine |
1298 |
long arrows); |
|
6259
488bdc1bd11a
path element specification '~~' refers to '$ISABELLE_HOME';
wenzelm
parents:
6174
diff
changeset
|
1299 |
|
6343 | 1300 |
* new print_mode "HTML"; |
1301 |
||
1302 |
* new flag show_tags controls display of tags of theorems (which are |
|
1303 |
basically just comments that may be attached by some tools); |
|
1304 |
||
6461 | 1305 |
* Isamode 2.6 requires patch to accomodate change of Isabelle font |
1306 |
mode and goal output format: |
|
1307 |
||
1308 |
diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el |
|
1309 |
244c244 |
|
1310 |
< (list (isa-getenv "ISABELLE") "-msymbols" logic-name) |
|
1311 |
--- |
|
6533 | 1312 |
> (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name) |
6461 | 1313 |
diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el |
1314 |
181c181 |
|
1315 |
< (defconst proofstate-proofstart-regexp "^Level [0-9]+$" |
|
1316 |
--- |
|
1317 |
> (defconst proofstate-proofstart-regexp "^Level [0-9]+" |
|
1318 |
||
7450 | 1319 |
* function bind_thms stores lists of theorems (cf. bind_thm); |
1320 |
||
7593 | 1321 |
* new shorthand tactics ftac, eatac, datac, fatac; |
1322 |
||
1323 |
* qed (and friends) now accept "" as result name; in that case the |
|
7986 | 1324 |
theorem is not stored, but proper checks and presentation of the |
1325 |
result still apply; |
|
7593 | 1326 |
|
7805
0ae9ddc36fe0
theorem database now also indexes constants "Trueprop", "all",
wenzelm
parents:
7791
diff
changeset
|
1327 |
* theorem database now also indexes constants "Trueprop", "all", |
0ae9ddc36fe0
theorem database now also indexes constants "Trueprop", "all",
wenzelm
parents:
7791
diff
changeset
|
1328 |
"==>", "=="; thus thms_containing, findI etc. may retrieve more rules; |
0ae9ddc36fe0
theorem database now also indexes constants "Trueprop", "all",
wenzelm
parents:
7791
diff
changeset
|
1329 |
|
6028 | 1330 |
|
6057 | 1331 |
*** HOL *** |
1332 |
||
7215 | 1333 |
** HOL arithmetic ** |
1334 |
||
6343 | 1335 |
* There are now decision procedures for linear arithmetic over nat and |
1336 |
int: |
|
6131 | 1337 |
|
6343 | 1338 |
1. arith_tac copes with arbitrary formulae involving `=', `<', `<=', |
1339 |
`+', `-', `Suc', `min', `max' and numerical constants; other subterms |
|
1340 |
are treated as atomic; subformulae not involving type `nat' or `int' |
|
1341 |
are ignored; quantified subformulae are ignored unless they are |
|
1342 |
positive universal or negative existential. The tactic has to be |
|
1343 |
invoked by hand and can be a little bit slow. In particular, the |
|
1344 |
running time is exponential in the number of occurrences of `min' and |
|
1345 |
`max', and `-' on `nat'. |
|
6131 | 1346 |
|
6343 | 1347 |
2. fast_arith_tac is a cut-down version of arith_tac: it only takes |
1348 |
(negated) (in)equalities among the premises and the conclusion into |
|
1349 |
account (i.e. no compound formulae) and does not know about `min' and |
|
1350 |
`max', and `-' on `nat'. It is fast and is used automatically by the |
|
1351 |
simplifier. |
|
6131 | 1352 |
|
6343 | 1353 |
NB: At the moment, these decision procedures do not cope with mixed |
1354 |
nat/int formulae where the two parts interact, such as `m < n ==> |
|
1355 |
int(m) < int(n)'. |
|
6028 | 1356 |
|
7215 | 1357 |
* HOL/Numeral provides a generic theory of numerals (encoded |
7313 | 1358 |
efficiently as bit strings); setup for types nat/int/real is in place; |
7215 | 1359 |
INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than |
1360 |
int, existing theories and proof scripts may require a few additional |
|
1361 |
type constraints; |
|
1362 |
||
1363 |
* integer division and remainder can now be performed on constant |
|
1364 |
arguments; |
|
7157 | 1365 |
|
7215 | 1366 |
* many properties of integer multiplication, division and remainder |
1367 |
are now available; |
|
6922 | 1368 |
|
7287 | 1369 |
* An interface to the Stanford Validity Checker (SVC) is available through the |
1370 |
tactic svc_tac. Propositional tautologies and theorems of linear arithmetic |
|
1371 |
are proved automatically. SVC must be installed separately, and its results |
|
1372 |
must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any |
|
1373 |
invocation of the underlying oracle). For SVC see |
|
7444 | 1374 |
http://verify.stanford.edu/SVC |
6922 | 1375 |
|
7125 | 1376 |
* IsaMakefile: the HOL-Real target now builds an actual image; |
1377 |
||
7215 | 1378 |
|
1379 |
** HOL misc ** |
|
1380 |
||
7595
5f5d575ddac3
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
wenzelm
parents:
7593
diff
changeset
|
1381 |
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces |
5f5d575ddac3
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
wenzelm
parents:
7593
diff
changeset
|
1382 |
(in Isabelle/Isar) -- by Gertrud Bauer; |
5f5d575ddac3
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
wenzelm
parents:
7593
diff
changeset
|
1383 |
|
7691 | 1384 |
* HOL/BCV: generic model of bytecode verification, i.e. data-flow |
1385 |
analysis for assembly languages with subtypes; |
|
1386 |
||
6278 | 1387 |
* HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization |
1388 |
-- avoids syntactic ambiguities and treats state, transition, and |
|
1389 |
temporal levels more uniformly; introduces INCOMPATIBILITIES due to |
|
1390 |
changed syntax and (many) tactics; |
|
1391 |
||
7791 | 1392 |
* HOL/inductive: Now also handles more general introduction rules such |
1393 |
as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity |
|
1394 |
theorems are now maintained within the theory (maintained via the |
|
1395 |
"mono" attribute); |
|
7780
099742c562aa
Documented changes to HOL/inductive and function thm_deps.
berghofe
parents:
7691
diff
changeset
|
1396 |
|
7238
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1397 |
* HOL/datatype: Now also handles arbitrarily branching datatypes |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1398 |
(using function types) such as |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1399 |
|
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1400 |
datatype 'a tree = Atom 'a | Branch "nat => 'a tree" |
7047
d103b875ef1d
Datatype package now handles arbitrarily branching datatypes.
berghofe
parents:
6925
diff
changeset
|
1401 |
|
7326 | 1402 |
* HOL/record: record_simproc (part of the default simpset) takes care |
1403 |
of selectors applied to updated records; record_split_tac is no longer |
|
7327 | 1404 |
part of the default claset; update_defs may now be removed from the |
1405 |
simpset in many cases; COMPATIBILITY: old behavior achieved by |
|
7326 |