author | wenzelm |
Tue, 13 Nov 2001 22:25:59 +0100 | |
changeset 12177 | b1c16d685a99 |
parent 12163 | 04c98351f9af |
child 12210 | 2f510d8d8291 |
permissions | -rw-r--r-- |
11437 | 1 |
|
5363 | 2 |
Isabelle NEWS -- history user-relevant changes |
3 |
============================================== |
|
2553 | 4 |
|
11474 | 5 |
New in Isabelle2001 (?? 2001) |
6 |
----------------------------- |
|
7 |
||
11572 | 8 |
*** Document preparation *** |
9 |
||
11842
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
10 |
* greatly simplified document preparation setup, including more |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
11 |
graceful interpretation of isatool usedir -i/-d/-D options, and more |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
12 |
instructive isatool mkdir; users should basically be able to get |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
13 |
started with "isatool mkdir Test && isatool make"; |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
14 |
|
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
15 |
* theory dependency graph may now be incorporated into documents; |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
16 |
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
|
17 |
with \includegraphics of LaTeX; |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
18 |
|
11864
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset
|
19 |
* proper spacing of consecutive markup elements, especially text |
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset
|
20 |
blocks after section headings; |
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset
|
21 |
|
11572 | 22 |
* support bold style (for single symbols only), input syntax is like |
23 |
this: "\<^bold>\<alpha>" or "\<^bold>A"; |
|
24 |
||
11814 | 25 |
* \<bullet> is now output as bold \cdot by default, which looks much |
11572 | 26 |
better in printed text; |
27 |
||
11712
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset
|
28 |
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>; |
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset
|
29 |
note that these symbols are currently unavailable in Proof General / |
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset
|
30 |
X-Symbol; |
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset
|
31 |
|
11572 | 32 |
|
11633 | 33 |
*** Isar *** |
34 |
||
11690 | 35 |
* improved proof by cases and induction: |
11995
4a622f5fb164
- 'induct' may now use elim-style induction rules without chaining
wenzelm
parents:
11986
diff
changeset
|
36 |
- removed obsolete "(simplified)" and "(stripped)" options of methods; |
4a622f5fb164
- 'induct' may now use elim-style induction rules without chaining
wenzelm
parents:
11986
diff
changeset
|
37 |
- added 'print_induct_rules' (covered by help item in Proof General > 3.3); |
4a622f5fb164
- 'induct' may now use elim-style induction rules without chaining
wenzelm
parents:
11986
diff
changeset
|
38 |
- 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
|
39 |
- 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
|
40 |
|
11797 | 41 |
- 'case' command admits impromptu naming of parameters (such as |
11986
26b95a6f3f79
- 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset
|
42 |
"case (Suc n)"); |
26b95a6f3f79
- 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset
|
43 |
|
11797 | 44 |
- 'induct' method divinates rule instantiation from the inductive |
11986
26b95a6f3f79
- 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset
|
45 |
claim; no longer requires excessive ?P bindings for proper |
26b95a6f3f79
- 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset
|
46 |
instantiation of cases; |
26b95a6f3f79
- 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset
|
47 |
|
11797 | 48 |
- 'induct' method properly enumerates all possibilities of set/type |
11986
26b95a6f3f79
- 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset
|
49 |
rules; as a consequence facts may be also passed through *type* rules |
26b95a6f3f79
- 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset
|
50 |
without further ado; |
26b95a6f3f79
- 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset
|
51 |
|
26b95a6f3f79
- 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset
|
52 |
- 'induct' method now derives symbolic cases from the *rulified* |
26b95a6f3f79
- 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset
|
53 |
rule (before it used to rulify cases stemming from the internal |
26b95a6f3f79
- 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset
|
54 |
atomized version); this means that the context of a non-atomic |
26b95a6f3f79
- 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset
|
55 |
statement becomes is included in the hypothesis, avoiding the slightly |
26b95a6f3f79
- 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset
|
56 |
cumbersome show "PROP ?case" form; |
26b95a6f3f79
- 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset
|
57 |
|
11995
4a622f5fb164
- 'induct' may now use elim-style induction rules without chaining
wenzelm
parents:
11986
diff
changeset
|
58 |
- 'induct' may now use elim-style induction rules without chaining |
4a622f5fb164
- 'induct' may now use elim-style induction rules without chaining
wenzelm
parents:
11986
diff
changeset
|
59 |
facts, using ``missing'' premises from the goal state; this allows |
4a622f5fb164
- 'induct' may now use elim-style induction rules without chaining
wenzelm
parents:
11986
diff
changeset
|
60 |
rules stemming from inductive sets to be applied in unstructured |
4a622f5fb164
- 'induct' may now use elim-style induction rules without chaining
wenzelm
parents:
11986
diff
changeset
|
61 |
scripts, while still benefitting from proper handling of non-atomic |
4a622f5fb164
- 'induct' may now use elim-style induction rules without chaining
wenzelm
parents:
11986
diff
changeset
|
62 |
statements; NB: major inductive premises need to be put first, all the |
4a622f5fb164
- 'induct' may now use elim-style induction rules without chaining
wenzelm
parents:
11986
diff
changeset
|
63 |
rest of the goal is passed through the induction; |
11690 | 64 |
|
12163
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
65 |
- 'induct' proper support for mutual induction involving non-atomic |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
66 |
rule statements (uses the new concept of simultaneous goals, see |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
67 |
below); |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
68 |
|
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
69 |
* Pure: support multiple simultaneous goal statements, for example |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
70 |
"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
|
71 |
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
|
72 |
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
|
73 |
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
|
74 |
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
|
75 |
fails: |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
76 |
|
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
77 |
assume "A & B" then have A and B .. (*".." fails*) |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
78 |
|
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
79 |
better use "obtain" in situations as above; alternative refer to |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
80 |
multi-step methods like 'auto', 'simp_all', 'blast+' etc.; |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
81 |
|
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
82 |
* Pure: proper integration with ``locales''; unlike the original |
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
83 |
version by Florian Kammueller, Isar locales package high-level proof |
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
84 |
contexts rather than raw logical ones (e.g. we admit to include |
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
85 |
attributes everywhere); |
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
86 |
|
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
87 |
* Pure: theory goals now support ad-hoc contexts, which are discharged |
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
88 |
in the result, as in ``lemma (assumes A and B) K: A .''; syntax |
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
89 |
coincides with that of a locale body; |
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
90 |
|
11722 | 91 |
* Pure: renamed "antecedent" case to "rule_context"; |
92 |
||
11738 | 93 |
* Pure: added 'corollary' command; |
94 |
||
11722 | 95 |
* Pure: fixed 'token_translation' command; |
96 |
||
11899 | 97 |
* Pure: removed obsolete 'exported' attribute; |
98 |
||
11933 | 99 |
* Pure: dummy pattern "_" in is/let is now automatically lifted over |
100 |
bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x") |
|
11899 | 101 |
supersedes more cumbersome ... (is "ALL x. _ x --> ?C x"); |
102 |
||
11952
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
103 |
* 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
|
104 |
statements (atomic meta-level propositions); setup controlled via |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
105 |
rewrite rules declarations of 'atomize' attribute; example |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
106 |
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
|
107 |
proof *scripts*; |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
108 |
|
12106
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
109 |
* 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
|
110 |
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
|
111 |
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
|
112 |
especially important for locales); |
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
113 |
|
11936
fef099613354
* Provers: 'simplified' attribute may refer to explicit rules instead
wenzelm
parents:
11933
diff
changeset
|
114 |
* Provers: 'simplified' attribute may refer to explicit rules instead |
fef099613354
* Provers: 'simplified' attribute may refer to explicit rules instead
wenzelm
parents:
11933
diff
changeset
|
115 |
of full simplifier context; 'iff' attribute handles conditional rules; |
fef099613354
* Provers: 'simplified' attribute may refer to explicit rules instead
wenzelm
parents:
11933
diff
changeset
|
116 |
|
11745
06cd8c3b5487
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm
parents:
11738
diff
changeset
|
117 |
* 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
|
118 |
|
11690 | 119 |
* HOL: 'recdef' now fails on unfinished automated proofs, use |
11633 | 120 |
"(permissive)" option to recover old behavior; |
121 |
||
11933 | 122 |
* HOL: 'inductive' no longer features separate (collective) attributes |
123 |
for 'intros' (was found too confusing); |
|
124 |
||
11788
60054fee3c16
canonical 'cases'/'induct' rules for n-tuples (n=3..7)
kleing
parents:
11745
diff
changeset
|
125 |
|
11633 | 126 |
|
11474 | 127 |
*** HOL *** |
128 |
||
11702 | 129 |
* HOL: moved over to sane numeral syntax; the new policy is as |
130 |
follows: |
|
131 |
||
132 |
- 0 and 1 are polymorphic constants, which are defined on any |
|
133 |
numeric type (nat, int, real etc.); |
|
134 |
||
135 |
- 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based |
|
136 |
binary representation internally; |
|
137 |
||
138 |
- type nat has special constructor Suc, and generally prefers Suc 0 |
|
139 |
over 1::nat and Suc (Suc 0) over 2::nat; |
|
140 |
||
141 |
This change may cause significant INCOMPATIBILITIES; here are some |
|
142 |
hints on converting existing sources: |
|
143 |
||
144 |
- due to the new "num" token, "-0" and "-1" etc. are now atomic |
|
145 |
entities, so expressions involving "-" (unary or binary minus) need |
|
146 |
to be spaced properly; |
|
147 |
||
148 |
- existing occurrences of "1" may need to be constraint "1::nat" or |
|
149 |
even replaced by Suc 0; similar for old "2"; |
|
150 |
||
151 |
- replace "#nnn" by "nnn", and "#-nnn" by "-nnn"; |
|
152 |
||
153 |
- remove all special provisions on numerals in proofs; |
|
154 |
||
11930 | 155 |
* HOL/record: |
11937 | 156 |
- removed old "make" and "make_scheme" operations -- INCOMPATIBILITY; |
157 |
- removed "more" class (simply use "term") -- INCOMPATIBILITY; |
|
11930 | 158 |
- provides cases/induct rules for use with corresponding Isar methods; |
11936
fef099613354
* Provers: 'simplified' attribute may refer to explicit rules instead
wenzelm
parents:
11933
diff
changeset
|
159 |
- new derived operations "make" (for adding fields of current |
fef099613354
* Provers: 'simplified' attribute may refer to explicit rules instead
wenzelm
parents:
11933
diff
changeset
|
160 |
record), "extend" to promote fixed record to record scheme, and |
fef099613354
* Provers: 'simplified' attribute may refer to explicit rules instead
wenzelm
parents:
11933
diff
changeset
|
161 |
"truncate" for the reverse; cf. theorems "derived_defs", which are |
fef099613354
* Provers: 'simplified' attribute may refer to explicit rules instead
wenzelm
parents:
11933
diff
changeset
|
162 |
*not* declared as simp by default; |
11930 | 163 |
- internal definitions directly based on a light-weight abstract |
164 |
theory of product types over typedef rather than datatype; |
|
165 |
||
11933 | 166 |
* HOL: canonical cases/induct rules for n-tuples (n = 3..7); |
167 |
||
11802
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset
|
168 |
* 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
|
169 |
(beware of argument permutation!); |
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset
|
170 |
|
11657 | 171 |
* HOL: linorder_less_split superseded by linorder_cases; |
172 |
||
11633 | 173 |
* HOL: added "The" definite description operator; move Hilbert's "Eps" |
174 |
to peripheral theory "Hilbert_Choice"; |
|
11437 | 175 |
|
11572 | 176 |
* HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so |
177 |
in this (rare) case use: |
|
178 |
||
179 |
delSWrapper "split_all_tac" |
|
180 |
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) |
|
181 |
||
182 |
* HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS |
|
11474 | 183 |
MAY FAIL; |
11361 | 184 |
|
11572 | 185 |
* HOL: introduced f^n = f o ... o f; warning: due to the limits of |
186 |
Isabelle's type classes, ^ on functions and relations has too general |
|
187 |
a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be |
|
188 |
necessary to attach explicit type constraints; |
|
11307 | 189 |
|
11487
95071c9e85a3
* HOL: syntax translations now work properly with numerals and records
wenzelm
parents:
11475
diff
changeset
|
190 |
* 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
|
191 |
expressions; |
11474 | 192 |
|
193 |
* HOL/GroupTheory: group theory examples including Sylow's theorem, by |
|
11937 | 194 |
Florian Kammüller; |
11474 | 195 |
|
11933 | 196 |
* HOL: got rid of some global declarations (potential INCOMPATIBILITY |
197 |
for ML tools): const "()" renamed "Product_Type.Unity", type "unit" |
|
198 |
renamed "Product_Type.unit"; |
|
11611 | 199 |
|
200 |
||
12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
201 |
*** HOLCF *** |
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
202 |
|
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
203 |
* proper rep_datatype lift (see theory Lift); use plain induct_tac |
12034
4471077c4d4f
* 'domain' package adapted to new-style theories, e.g. see
wenzelm
parents:
12022
diff
changeset
|
204 |
instead of former lift.induct_tac; always use UU instead of Undef; |
4471077c4d4f
* 'domain' package adapted to new-style theories, e.g. see
wenzelm
parents:
12022
diff
changeset
|
205 |
|
4471077c4d4f
* 'domain' package adapted to new-style theories, e.g. see
wenzelm
parents:
12022
diff
changeset
|
206 |
* 'domain' package adapted to new-style theories, e.g. see |
4471077c4d4f
* 'domain' package adapted to new-style theories, e.g. see
wenzelm
parents:
12022
diff
changeset
|
207 |
HOLCF/ex/Dnat.thy; |
12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
208 |
|
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
209 |
|
11474 | 210 |
*** ZF *** |
211 |
||
12177
b1c16d685a99
* ZF: new-style theory commands 'inductive', 'inductive_cases', and
wenzelm
parents:
12163
diff
changeset
|
212 |
* ZF: new-style theory commands 'inductive', 'inductive_cases', and |
b1c16d685a99
* ZF: new-style theory commands 'inductive', 'inductive_cases', and
wenzelm
parents:
12163
diff
changeset
|
213 |
methods 'ind_cases', 'induct_tac', 'case_tac'; |
b1c16d685a99
* ZF: new-style theory commands 'inductive', 'inductive_cases', and
wenzelm
parents:
12163
diff
changeset
|
214 |
|
11474 | 215 |
* ZF: the integer library now covers quotients and remainders, with |
216 |
many laws relating division to addition, multiplication, etc.; |
|
217 |
||
12177
b1c16d685a99
* ZF: new-style theory commands 'inductive', 'inductive_cases', and
wenzelm
parents:
12163
diff
changeset
|
218 |
* ZF/Induct: new directory for examples of inductive definitions, |
b1c16d685a99
* ZF: new-style theory commands 'inductive', 'inductive_cases', and
wenzelm
parents:
12163
diff
changeset
|
219 |
including theory Multiset for multiset orderings; |
b1c16d685a99
* ZF: new-style theory commands 'inductive', 'inductive_cases', and
wenzelm
parents:
12163
diff
changeset
|
220 |
|
b1c16d685a99
* ZF: new-style theory commands 'inductive', 'inductive_cases', and
wenzelm
parents:
12163
diff
changeset
|
221 |
* ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a |
b1c16d685a99
* ZF: new-style theory commands 'inductive', 'inductive_cases', and
wenzelm
parents:
12163
diff
changeset
|
222 |
typeless version of the formalism; |
12159 | 223 |
|
11474 | 224 |
|
225 |
*** General *** |
|
226 |
||
11817 | 227 |
* kernel: meta-level proof terms (by Stefan Berghofer), see also ref |
228 |
manual; |
|
229 |
||
11965
c84eb86d9a5f
* Pure/axclass: removed obsolete ML interface goal_subclass/goal_arity;
wenzelm
parents:
11952
diff
changeset
|
230 |
* Pure/axclass: removed obsolete ML interface goal_subclass/goal_arity; |
c84eb86d9a5f
* Pure/axclass: removed obsolete ML interface goal_subclass/goal_arity;
wenzelm
parents:
11952
diff
changeset
|
231 |
|
11921
2a0e9622dc51
* clasimp: ``iff'' declarations now handle conditional rules as well;
wenzelm
parents:
11899
diff
changeset
|
232 |
* classical: renamed addaltern to addafter, addSaltern to addSafter; |
2a0e9622dc51
* clasimp: ``iff'' declarations now handle conditional rules as well;
wenzelm
parents:
11899
diff
changeset
|
233 |
|
2a0e9622dc51
* clasimp: ``iff'' declarations now handle conditional rules as well;
wenzelm
parents:
11899
diff
changeset
|
234 |
* clasimp: ``iff'' declarations now handle conditional rules as well; |
11474 | 235 |
|
11817 | 236 |
* syntax: new token syntax "num" for plain numerals (without "#" of |
237 |
"xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now separate |
|
238 |
tokens, so expressions involving minus need to be spaced properly; |
|
239 |
||
11657 | 240 |
* syntax: support non-oriented infixes; |
241 |
||
11817 | 242 |
* syntax: print modes "type_brackets" and "no_type_brackets" control |
243 |
output of nested => (types); the default behavior is "type_brackets"; |
|
244 |
||
245 |
* syntax: builtin parse translation for "_constify" turns valued |
|
246 |
tokens into AST constants; |
|
11474 | 247 |
|
12106
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
248 |
* system: refrain from any attempt at filtering input streams; no |
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
249 |
longer support ``8bit'' encoding of old isabelle font, instead proper |
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
250 |
iso-latin characters may now be used; |
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
251 |
|
11572 | 252 |
* system: support Poly/ML 4.1.1 (now able to manage large heaps); |
11551 | 253 |
|
11633 | 254 |
* system: Proof General keywords specification is now part of the |
255 |
Isabelle distribution (see etc/isar-keywords.el); |
|
256 |
||
11551 | 257 |
* system: smart selection of Isabelle process versus Isabelle |
11572 | 258 |
interface, accommodates case-insensitive file systems (e.g. HFS+); may |
259 |
run both "isabelle" and "Isabelle" even if file names are badly |
|
260 |
damaged (executable inspects the case of the first letter of its own |
|
261 |
name); added separate "isabelle-process" and "isabelle-interface"; |
|
11551 | 262 |
|
11314 | 263 |
|
11169
98c2f741e32b
made split_all_tac safe introducing safe_full_simp_tac, EXISTING PROOFS MAY FAIL
oheimb
parents:
11130
diff
changeset
|
264 |
|
11062 | 265 |
New in Isabelle99-2 (February 2001) |
266 |
----------------------------------- |
|
267 |
||
10224 | 268 |
*** Overview of INCOMPATIBILITIES *** |
269 |
||
11241 | 270 |
* HOL: please note that theories in the Library and elsewhere often use the |
271 |
new-style (Isar) format; to refer to their theorems in an ML script you must |
|
272 |
bind them to ML identifers by e.g. val thm_name = thm "thm_name"; |
|
273 |
||
11043
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset
|
274 |
* HOL: inductive package no longer splits induction rule aggressively, |
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset
|
275 |
but only as far as specified by the introductions given; the old |
11130 | 276 |
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
|
277 |
'split_rule (complete)'; |
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset
|
278 |
|
10998 | 279 |
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, |
280 |
gfp_Tarski to gfp_unfold; |
|
10224 | 281 |
|
10288 | 282 |
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; |
283 |
||
10858 | 284 |
* HOL: infix "dvd" now has priority 50 rather than 70 (because it is a |
285 |
relation); infix "^^" has been renamed "``"; infix "``" has been |
|
286 |
renamed "`"; "univalent" has been renamed "single_valued"; |
|
10793 | 287 |
|
10998 | 288 |
* HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse" |
289 |
operation; |
|
290 |
||
10868 | 291 |
* HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>; |
10856 | 292 |
|
10391 | 293 |
* Isar: 'obtain' no longer declares "that" fact as simp/intro; |
294 |
||
10401
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
295 |
* 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
|
296 |
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
|
297 |
(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
|
298 |
|
10976
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset
|
299 |
* Document preparation: renamed standard symbols \<ll> to \<lless> and |
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset
|
300 |
\<gg> to \<ggreater>; |
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset
|
301 |
|
10224 | 302 |
|
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
303 |
*** Document preparation *** |
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
304 |
|
10858 | 305 |
* \isabellestyle{NAME} selects version of Isabelle output (currently |
306 |
available: are "it" for near math-mode best-style output, "sl" for |
|
307 |
slanted text style, and "tt" for plain type-writer; if no |
|
308 |
\isabellestyle command is given, output is according to slanted |
|
309 |
type-writer); |
|
310 |
||
10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset
|
311 |
* 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
|
312 |
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
|
313 |
|
10858 | 314 |
* some more standard symbols; see Appendix A of the system manual for |
11062 | 315 |
the complete list of symbols defined in isabellesym.sty; |
10858 | 316 |
|
10998 | 317 |
* improved isabelle style files; more abstract symbol implementation |
318 |
(should now use \isamath{...} and \isatext{...} in custom symbol |
|
319 |
definitions); |
|
320 |
||
10634 | 321 |
* antiquotation @{goals} and @{subgoals} for output of *dynamic* goals |
322 |
state; Note that presentation of goal states does not conform to |
|
323 |
actual human-readable proof documents. Please do not include goal |
|
324 |
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
|
325 |
|
11062 | 326 |
* proper indentation of antiquoted output with proportional LaTeX |
327 |
fonts; |
|
10862 | 328 |
|
11050
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset
|
329 |
* no_document ML operator temporarily disables LaTeX document |
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset
|
330 |
generation; |
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset
|
331 |
|
11062 | 332 |
* isatool unsymbolize tunes sources for plain ASCII communication; |
333 |
||
10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset
|
334 |
|
10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset
|
335 |
*** Isar *** |
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset
|
336 |
|
10547 | 337 |
* Pure: Isar now suffers initial goal statements to contain unbound |
338 |
schematic variables (this does not conform to actual readable proof |
|
339 |
documents, due to unpredictable outcome and non-compositional proof |
|
340 |
checking); users who know what they are doing may use schematic goals |
|
341 |
for Prolog-style synthesis of proven results; |
|
342 |
||
10391 | 343 |
* Pure: assumption method (an implicit finishing) now handles actual |
344 |
rules as well; |
|
345 |
||
346 |
* Pure: improved 'obtain' --- moved to Pure, insert "that" into |
|
347 |
initial goal, declare "that" only as Pure intro (only for single |
|
348 |
steps); the "that" rule assumption may now be involved in implicit |
|
349 |
finishing, thus ".." becomes a feasible for trivial obtains; |
|
350 |
||
351 |
* Pure: default proof step now includes 'intro_classes'; thus trivial |
|
352 |
instance proofs may be performed by ".."; |
|
353 |
||
354 |
* Pure: ?thesis / ?this / "..." now work for pure meta-level |
|
355 |
statements as well; |
|
10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset
|
356 |
|
11097 | 357 |
* Pure: more robust selection of calculational rules; |
358 |
||
10858 | 359 |
* Pure: the builtin notion of 'finished' goal now includes the ==-refl |
360 |
rule (as well as the assumption rule); |
|
361 |
||
362 |
* Pure: 'thm_deps' command visualizes dependencies of theorems and |
|
363 |
lemmas, using the graph browser tool; |
|
364 |
||
10944 | 365 |
* Pure: predict failure of "show" in interactive mode; |
366 |
||
11016
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset
|
367 |
* Pure: 'thms_containing' now takes actual terms as arguments; |
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset
|
368 |
|
10401
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
369 |
* 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
|
370 |
(potential INCOMPATIBILITY); tuned error handling; |
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
371 |
|
10557 | 372 |
* HOL: cases and induct rules now provide explicit hints about the |
10547 | 373 |
number of facts to be consumed (0 for "type" and 1 for "set" rules); |
374 |
any remaining facts are inserted into the goal verbatim; |
|
375 |
||
10858 | 376 |
* HOL: local contexts (aka cases) may now contain term bindings as |
377 |
well; the 'cases' and 'induct' methods new provide a ?case binding for |
|
378 |
the result to be shown in each case; |
|
379 |
||
10770 | 380 |
* HOL: added 'recdef_tc' command; |
381 |
||
11016
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset
|
382 |
* isatool convert assists in eliminating legacy ML scripts; |
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset
|
383 |
|
10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset
|
384 |
|
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
385 |
*** HOL *** |
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
386 |
|
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
387 |
* 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
|
388 |
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
|
389 |
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
|
390 |
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While |
10337 | 391 |
(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
|
392 |
|
10966 | 393 |
* HOL/Unix: "Some aspects of Unix file-system security", a typical |
394 |
modelling and verification task performed in Isabelle/HOL + |
|
395 |
Isabelle/Isar + Isabelle document preparation (by Markus Wenzel). |
|
396 |
||
11094 | 397 |
* HOL/Algebra: special summation operator SUM no longer exists, it has |
398 |
been replaced by setsum; infix 'assoc' now has priority 50 (like |
|
399 |
'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to |
|
400 |
'domain', this makes the theory consistent with mathematical |
|
401 |
literature; |
|
402 |
||
10514 | 403 |
* HOL basics: added overloaded operations "inverse" and "divide" |
10726 | 404 |
(infix "/"), syntax for generic "abs" operation, generic summation |
11094 | 405 |
operator \<Sum>; |
10452
abeefb0a79ae
* added overloaded operations "inverse" and "divide" (infix "/");
wenzelm
parents:
10428
diff
changeset
|
406 |
|
10391 | 407 |
* HOL/typedef: simplified package, provide more useful rules (see also |
408 |
HOL/subset.thy); |
|
409 |
||
10915
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
410 |
* HOL/datatype: induction rule for arbitrarily branching datatypes is |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
411 |
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
|
412 |
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
|
413 |
|
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
414 |
* 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
|
415 |
to "split_conv" (old name still available for compatibility); |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
416 |
|
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
417 |
* 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
|
418 |
rules with string literals); |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
419 |
|
10944 | 420 |
* HOL-Hyperreal: a new target, extending HOL-Real with the hyperreals |
421 |
and Fleuriot's mechanization of analysis; |
|
10756 | 422 |
|
11094 | 423 |
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; |
10391 | 424 |
|
10858 | 425 |
|
10474 | 426 |
*** CTT *** |
427 |
||
10547 | 428 |
* CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that |
429 |
"lam" is displayed as TWO lambda-symbols |
|
10474 | 430 |
|
10547 | 431 |
* CTT: theory Main now available, containing everything (that is, Bool |
432 |
and Arith); |
|
433 |
||
10474 | 434 |
|
10391 | 435 |
*** General *** |
436 |
||
10547 | 437 |
* Pure: the Simplifier has been implemented properly as a derived rule |
438 |
outside of the actual kernel (at last!); the overall performance |
|
439 |
penalty in practical applications is about 50%, while reliability of |
|
440 |
the Isabelle inference kernel has been greatly improved; |
|
441 |
||
11112 | 442 |
* print modes "brackets" and "no_brackets" control output of nested => |
443 |
(types) and ==> (props); the default behaviour is "brackets"; |
|
444 |
||
10391 | 445 |
* Provers: fast_tac (and friends) now handle actual object-logic rules |
446 |
as assumptions as well; |
|
447 |
||
11124 | 448 |
* system: support Poly/ML 4.0; |
449 |
||
450 |
* system: isatool install handles KDE version 1 or 2; |
|
451 |
||
10391 | 452 |
|
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
453 |
|
10103 | 454 |
New in Isabelle99-1 (October 2000) |
455 |
---------------------------------- |
|
8015 | 456 |
|
10003 | 457 |
*** Overview of INCOMPATIBILITIES *** |
8014 | 458 |
|
8848 | 459 |
* HOL: simplification of natural numbers is much changed; to partly |
460 |
recover the old behaviour (e.g. to prevent n+n rewriting to #2*n) |
|
461 |
issue the following ML commands: |
|
462 |
||
463 |
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; |
|
464 |
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; |
|
8788 | 465 |
|
10129 | 466 |
* HOL: simplification no longer dives into case-expressions; this is |
467 |
controlled by "t.weak_case_cong" for each datatype t; |
|
10003 | 468 |
|
469 |
* HOL: nat_less_induct renamed to less_induct; |
|
470 |
||
471 |
* HOL: systematic renaming of the SOME (Eps) rules, may use isatool |
|
472 |
fixsome to patch .thy and .ML sources automatically; |
|
8967 | 473 |
|
10003 | 474 |
select_equality -> some_equality |
475 |
select_eq_Ex -> some_eq_ex |
|
476 |
selectI2EX -> someI2_ex |
|
477 |
selectI2 -> someI2 |
|
478 |
selectI -> someI |
|
479 |
select1_equality -> some1_equality |
|
480 |
Eps_sym_eq -> some_sym_eq_trivial |
|
481 |
Eps_eq -> some_eq_trivial |
|
482 |
||
483 |
* HOL: exhaust_tac on datatypes superceded by new generic case_tac; |
|
484 |
||
485 |
* HOL: removed obsolete theorem binding expand_if (refer to split_if |
|
486 |
instead); |
|
487 |
||
488 |
* HOL: the recursion equations generated by 'recdef' are now called |
|
489 |
f.simps instead of f.rules; |
|
490 |
||
491 |
* HOL: qed_spec_mp now also handles bounded ALL as well; |
|
492 |
||
493 |
* HOL: 0 is now overloaded, so the type constraint ":: nat" may |
|
494 |
sometimes be needed; |
|
495 |
||
496 |
* HOL: the constant for "f``x" is now "image" rather than "op ``"; |
|
8014 | 497 |
|
10065 | 498 |
* HOL: the constant for "f-``x" is now "vimage" rather than "op -``"; |
499 |
||
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
500 |
* 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
|
501 |
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
|
502 |
now "<*lex*>" instead of "**"; |
8705 | 503 |
|
10003 | 504 |
* HOL: theory Sexp is now in HOL/Induct examples (it used to be part |
505 |
of main HOL, but was unused); better use HOL's datatype package; |
|
9971 | 506 |
|
10137
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
507 |
* HOL: removed "symbols" syntax for constant "override" of theory Map; |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
508 |
the old syntax may be recovered as follows: |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
509 |
|
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
510 |
syntax (symbols) |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
511 |
override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)" |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
512 |
(infixl "\\<oplus>" 100) |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
513 |
|
8848 | 514 |
* HOL/Real: "rabs" replaced by overloaded "abs" function; |
515 |
||
8887
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset
|
516 |
* 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
|
517 |
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
|
518 |
internally; |
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset
|
519 |
|
10003 | 520 |
* HOL and ZF: syntax for quotienting wrt an equivalence relation |
521 |
changed from A/r to A//r; |
|
9908 | 522 |
|
10003 | 523 |
* ZF: new treatment of arithmetic (nat & int) may break some old |
524 |
proofs; |
|
8921
7c04c98132c4
* Pure: changed syntax of local blocks from {{ }} to { };
wenzelm
parents:
8887
diff
changeset
|
525 |
|
10003 | 526 |
* Isar: renamed some attributes (RS -> THEN, simplify -> simplified, |
527 |
rulify -> rule_format, elimify -> elim_format, ...); |
|
9542 | 528 |
|
9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
529 |
* Isar/Provers: intro/elim/dest attributes changed; renamed |
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
530 |
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one |
9937 | 531 |
should have to change intro!! to intro? only); replaced "delrule" by |
532 |
"rule del"; |
|
9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset
|
533 |
|
9612 | 534 |
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; |
535 |
||
9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset
|
536 |
* Provers: strengthened force_tac by using new first_best_tac; |
9402 | 537 |
|
10003 | 538 |
* LaTeX document preparation: several changes of isabelle.sty (see |
539 |
lib/texinputs); |
|
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
540 |
|
8014 | 541 |
|
8487 | 542 |
*** Document preparation *** |
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
543 |
|
9198
0ab3c81e9425
* formal comments (text blocks etc.) in new-style theories may now
wenzelm
parents:
9185
diff
changeset
|
544 |
* formal comments (text blocks etc.) in new-style theories may now |
9753 | 545 |
contain antiquotations of thm/prop/term/typ/text to be presented |
546 |
according to latex print mode; concrete syntax is like this: |
|
547 |
@{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
|
548 |
|
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
549 |
* isatool mkdir provides easy setup of Isabelle session directories, |
8518 | 550 |
including proper document sources; |
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
551 |
|
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
552 |
* generated LaTeX sources are now deleted after successful run |
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
553 |
(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
|
554 |
of isatool usedir; |
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
555 |
|
8566 | 556 |
* isatool usedir -D now lets isatool latex -o sty update the Isabelle |
10003 | 557 |
style files, achieving self-contained LaTeX sources and simplifying |
558 |
LaTeX debugging; |
|
8566 | 559 |
|
8518 | 560 |
* 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
|
561 |
|
9057
af1ca1acf292
* browser info session directories are now self-contained (may be put
wenzelm
parents:
9052
diff
changeset
|
562 |
* 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
|
563 |
on WWW server seperately); improved graphs of nested sessions; removed |
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset
|
564 |
graph for 'all sessions'; |
9057
af1ca1acf292
* browser info session directories are now self-contained (may be put
wenzelm
parents:
9052
diff
changeset
|
565 |
|
10003 | 566 |
* several improvements in isabelle style files; \isabellestyle{it} |
567 |
produces fake math mode output; \isamarkupheader is now \section by |
|
568 |
default; see lib/texinputs/isabelle.sty etc.; |
|
9489
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
569 |
|
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
570 |
|
8184 | 571 |
*** Isar *** |
572 |
||
10003 | 573 |
* Isar/Pure: local results and corresponding term bindings are now |
574 |
subject to Hindley-Milner polymorphism (similar to ML); this |
|
575 |
accommodates incremental type-inference very nicely; |
|
8283
0a319c5746eb
* Pure now provides its own version of intro/elim/dest attributes;
wenzelm
parents:
8271
diff
changeset
|
576 |
|
10003 | 577 |
* Isar/Pure: new derived language element 'obtain' supports |
578 |
generalized existence reasoning; |
|
8621
8ba0f90f6f35
* Isar/Pure: local results and corresponding term bindings are now
wenzelm
parents:
8603
diff
changeset
|
579 |
|
10003 | 580 |
* Isar/Pure: new calculational elements 'moreover' and 'ultimately' |
581 |
support accumulation of results, without applying any rules yet; |
|
582 |
useful to collect intermediate results without explicit name |
|
583 |
references, and for use with transitivity rules with more than 2 |
|
584 |
premises; |
|
8184 | 585 |
|
10003 | 586 |
* Isar/Pure: scalable support for case-analysis type proofs: new |
587 |
'case' language element refers to local contexts symbolically, as |
|
588 |
produced by certain proof methods; internally, case names are attached |
|
589 |
to theorems as "tags"; |
|
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
590 |
|
10003 | 591 |
* Isar/Pure: theory command 'hide' removes declarations from |
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
592 |
class/type/const name spaces; |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
593 |
|
10003 | 594 |
* 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
|
595 |
indicate potential overloading; |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
596 |
|
10003 | 597 |
* 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
|
598 |
|
10003 | 599 |
* Isar/Pure: syntax of sorts made 'inner', i.e. have to write |
600 |
"{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
|
601 |
|
10003 | 602 |
* Isar/Pure now provides its own version of intro/elim/dest |
603 |
attributes; useful for building new logics, but beware of confusion |
|
604 |
with the version in Provers/classical; |
|
9612 | 605 |
|
10003 | 606 |
* Isar/Pure: the local context of (non-atomic) goals is provided via |
607 |
case name 'antecedent'; |
|
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
608 |
|
10003 | 609 |
* Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms |
610 |
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
|
611 |
|
10003 | 612 |
* Isar/Pure: theory command 'method_setup' provides a simple interface |
613 |
for definining proof methods in ML; |
|
9612 | 614 |
|
10003 | 615 |
* 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
|
616 |
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
|
617 |
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
|
618 |
replaced "delrule" by "rule del"; |
8283
0a319c5746eb
* Pure now provides its own version of intro/elim/dest attributes;
wenzelm
parents:
8271
diff
changeset
|
619 |
|
10003 | 620 |
* Isar/Provers: new 'hypsubst' method, plain 'subst' method and |
621 |
'symmetric' attribute (the latter supercedes [RS sym]); |
|
622 |
||
623 |
* Isar/Provers: splitter support (via 'split' attribute and 'simp' |
|
624 |
method modifier); 'simp' method: 'only:' modifier removes loopers as |
|
625 |
well (including splits); |
|
626 |
||
627 |
* Isar/Provers: Simplifier and Classical methods now support all kind |
|
628 |
of modifiers used in the past, including 'cong', 'iff', etc. |
|
629 |
||
630 |
* Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination |
|
631 |
of Simplifier and Classical reasoner); |
|
632 |
||
633 |
* Isar/HOL: new proof method 'cases' and improved version of 'induct' |
|
634 |
now support named cases; major packages (inductive, datatype, primrec, |
|
635 |
recdef) support case names and properly name parameters; |
|
9612 | 636 |
|
10003 | 637 |
* Isar/HOL: new transitivity rules for substitution in inequalities -- |
638 |
monotonicity conditions are extracted to be proven at end of |
|
639 |
calculations; |
|
640 |
||
641 |
* Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof |
|
642 |
method anyway; |
|
643 |
||
644 |
* Isar/HOL: removed old expand_if = split_if; theorems if_splits = |
|
645 |
split_if split_if_asm; datatype package provides theorems foo.splits = |
|
646 |
foo.split foo.split_asm for each datatype; |
|
647 |
||
648 |
* Isar/HOL: tuned inductive package, rename "intrs" to "intros" |
|
649 |
(potential INCOMPATIBILITY), emulation of mk_cases feature for proof |
|
650 |
scripts: new 'inductive_cases' command and 'ind_cases' method; (Note: |
|
651 |
use "(cases (simplified))" method in proper proof texts); |
|
652 |
||
653 |
* Isar/HOL: added global 'arith_split' attribute for 'arith' method; |
|
654 |
||
655 |
* Isar: names of theorems etc. may be natural numbers as well; |
|
656 |
||
657 |
* Isar: 'pr' command: optional arguments for goals_limit and |
|
9724
2030c5d63741
* 'pr' command: optional argument for ProofContext.prems_limit;
wenzelm
parents:
9709
diff
changeset
|
658 |
ProofContext.prems_limit; no longer prints theory contexts, but only |
2030c5d63741
* 'pr' command: optional argument for ProofContext.prems_limit;
wenzelm
parents:
9709
diff
changeset
|
659 |
proof states; |
8487 | 660 |
|
10003 | 661 |
* Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit |
8518 | 662 |
additional print modes to be specified; e.g. "pr(latex)" will print |
663 |
proof state according to the Isabelle LaTeX style; |
|
8487 | 664 |
|
10003 | 665 |
* Isar: improved support for emulating tactic scripts, including proof |
9612 | 666 |
methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac', |
667 |
'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac' |
|
668 |
(for HOL datatypes); |
|
8534 | 669 |
|
10003 | 670 |
* Isar: simplified (more robust) goal selection of proof methods: 1st |
671 |
goal, all goals, or explicit goal specifier (tactic emulation); thus |
|
672 |
'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
|
673 |
|
10003 | 674 |
* 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
|
675 |
|
10003 | 676 |
* Isar: removed 'help' command, which hasn't been too helpful anyway; |
677 |
should instead use individual commands for printing items |
|
678 |
(print_commands, print_methods etc.); |
|
9224
0da360494917
* Isar: removed 'help' command, which hasn't been too helpful anyway;
wenzelm
parents:
9198
diff
changeset
|
679 |
|
10003 | 680 |
* Isar: added 'nothing' --- the empty list of theorems; |
9239 | 681 |
|
8184 | 682 |
|
8014 | 683 |
*** HOL *** |
684 |
||
10080 | 685 |
* HOL/MicroJava: formalization of a fragment of Java, together with a |
686 |
corresponding virtual machine and a specification of its bytecode |
|
687 |
verifier and a lightweight bytecode verifier, including proofs of |
|
688 |
type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and |
|
689 |
Cornelia Pusch (see also the homepage of project Bali at |
|
690 |
http://isabelle.in.tum.de/Bali/); |
|
691 |
||
8518 | 692 |
* HOL/Algebra: new theory of rings and univariate polynomials, by |
693 |
Clemens Ballarin; |
|
8014 | 694 |
|
10157
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
695 |
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese |
10003 | 696 |
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M |
697 |
Rasmussen; |
|
8570 | 698 |
|
10157
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
699 |
* 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
|
700 |
structures, including duals, properties of bounds versus algebraic |
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
701 |
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
|
702 |
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
|
703 |
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
|
704 |
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
|
705 |
|
10003 | 706 |
* HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David |
707 |
von Oheimb; |
|
9542 | 708 |
|
10164
c240747082aa
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm
parents:
10157
diff
changeset
|
709 |
* 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
|
710 |
recursive procedures, by David von Oheimb; |
c240747082aa
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm
parents:
10157
diff
changeset
|
711 |
|
10003 | 712 |
* HOL/Lambda: converted into new-style theory and document; |
9542 | 713 |
|
10003 | 714 |
* HOL/ex/Multiquote: example of multiple nested quotations and |
715 |
anti-quotations -- basically a generalized version of de-Bruijn |
|
716 |
representation; very useful in avoiding lifting of operations; |
|
8848 | 717 |
|
9612 | 718 |
* HOL/record: added general record equality rule to simpset; fixed |
719 |
select-update simplification procedure to handle extended records as |
|
720 |
well; admit "r" as field name; |
|
9542 | 721 |
|
8967 | 722 |
* HOL: 0 is now overloaded over the new sort "zero", allowing its use with |
723 |
other numeric types and also as the identity of groups, rings, etc.; |
|
724 |
||
725 |
* HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity. |
|
726 |
Types nat and int belong to this axclass; |
|
727 |
||
10003 | 728 |
* HOL: greatly improved simplification involving numerals of type nat, int, real: |
8788 | 729 |
(i + #8 + j) = Suc k simplifies to #7 + (i + j) = k |
8832 | 730 |
i*j + k + j*#3*i simplifies to #4*(i*j) + k |
731 |
two terms #m*u and #n*u are replaced by #(m+n)*u |
|
732 |
(where #m, #n and u can implicitly be 1; this is simproc combine_numerals) |
|
733 |
and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y |
|
734 |
or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals); |
|
8736 | 735 |
|
10003 | 736 |
* HOL: meson_tac is available (previously in ex/meson.ML); it is a |
737 |
powerful prover for predicate logic but knows nothing of clasets; see |
|
738 |
ex/mesontest.ML and ex/mesontest2.ML for example applications; |
|
9835 | 739 |
|
8848 | 740 |
* 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
|
741 |
"exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer |
8518 | 742 |
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
|
743 |
|
8848 | 744 |
* HOL: simplification no longer dives into case-expressions: only the |
10129 | 745 |
selector expression is simplified, but not the remaining arms; to |
746 |
enable full simplification of case-expressions for datatype t, you may |
|
747 |
remove t.weak_case_cong from the simpset, either globally (Delcongs |
|
748 |
[thm"t.weak_case_cong"];) or locally (delcongs [...]). |
|
8603 | 749 |
|
8848 | 750 |
* HOL/recdef: the recursion equations generated by 'recdef' for |
751 |
function 'f' are now called f.simps instead of f.rules; if all |
|
752 |
termination conditions are proved automatically, these simplification |
|
753 |
rules are added to the simpset, as in primrec; rules may be named |
|
754 |
individually as well, resulting in a separate list of theorems for |
|
755 |
each equation; |
|
756 |
||
9489
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
757 |
* 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
|
758 |
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
|
759 |
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
|
760 |
invariant proof rule for while is applied. |
9457 | 761 |
|
10003 | 762 |
* HOL: new (overloaded) notation for the set of elements below/above |
763 |
some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval. |
|
8925 | 764 |
|
8848 | 765 |
* HOL: theorems impI, allI, ballI bound as "strip"; |
766 |
||
10003 | 767 |
* HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic |
9746 | 768 |
induct_tac th "x1 ... xn" expects th to have a conclusion of the form |
769 |
P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th; |
|
770 |
||
10003 | 771 |
* HOL/Real: "rabs" replaced by overloaded "abs" function; |
9737 | 772 |
|
10003 | 773 |
* HOL: theory Sexp now in HOL/Induct examples (it used to be part of |
774 |
main HOL, but was unused); |
|
8626 | 775 |
|
10003 | 776 |
* HOL: fewer consts declared as global (e.g. have to refer to |
777 |
"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
|
778 |
|
10003 | 779 |
* HOL: tuned AST representation of nested pairs, avoiding bogus output |
780 |
in case of overlap with user translations (e.g. judgements over |
|
781 |
tuples); (note that the underlying logical represenation is still |
|
782 |
bogus); |
|
9349
d43669fb423d
* tuned AST representation of nested pairs, avoiding bogus output in
wenzelm
parents:
9335
diff
changeset
|
783 |
|
8412 | 784 |
|
9542 | 785 |
*** ZF *** |
786 |
||
10003 | 787 |
* ZF: simplification automatically cancels common terms in arithmetic |
788 |
expressions over nat and int; |
|
9542 | 789 |
|
10003 | 790 |
* ZF: new treatment of nat to minimize type-checking: all operators |
791 |
coerce their operands to a natural number using the function natify, |
|
792 |
making the algebraic laws unconditional; |
|
9542 | 793 |
|
10003 | 794 |
* ZF: as above, for int: operators coerce their operands to an integer |
795 |
using the function intify; |
|
9542 | 796 |
|
10003 | 797 |
* ZF: the integer library now contains many of the usual laws for the |
798 |
orderings, including $<=, and monotonicity laws for $+ and $*; |
|
9542 | 799 |
|
10003 | 800 |
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic |
801 |
simplification; |
|
9388 | 802 |
|
10003 | 803 |
* FOL and ZF: AddIffs now available, giving theorems of the form P<->Q |
804 |
to the simplifier and classical reasoner simultaneously; |
|
9388 | 805 |
|
806 |
||
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
807 |
*** General *** |
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
808 |
|
10003 | 809 |
* Provers: blast_tac now handles actual object-logic rules as |
810 |
assumptions; note that auto_tac uses blast_tac internally as well; |
|
811 |
||
812 |
* Provers: new functions rulify/rulify_no_asm: thm -> thm for turning |
|
813 |
outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm; |
|
814 |
||
9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
815 |
* 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
|
816 |
explicit make_elim); |
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
817 |
|
10003 | 818 |
* Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g. |
819 |
[| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W |
|
820 |
use instead the strong form, |
|
821 |
[| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W |
|
822 |
in HOL, FOL and ZF the function cla_make_elim will create such rules |
|
823 |
from destruct-rules; |
|
9489
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
824 |
|
9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
825 |
* Provers: Simplifier.easy_setup provides a fast path to basic |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
826 |
Simplifier setup for new object-logics; |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
827 |
|
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
828 |
* 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
|
829 |
|
9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
830 |
* Pure: improved name spaces: ambiguous output is qualified; support |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
831 |
for hiding of names; |
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
832 |
|
10003 | 833 |
* system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and |
834 |
XSYMBOL_HOME; no longer need to do manual configuration in most |
|
835 |
situations; |
|
836 |
||
9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
837 |
* 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
|
838 |
option of isabelle and isatool usedir (currently only observed by |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
839 |
Poly/ML); |
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
840 |
|
9981
01a0c4772c18
system: isatool installfonts may handle X-Symbol fonts as well;
wenzelm
parents:
9971
diff
changeset
|
841 |
* 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
|
842 |
useful for remote X11); |
01a0c4772c18
system: isatool installfonts may handle X-Symbol fonts as well;
wenzelm
parents:
9971
diff
changeset
|
843 |
|
9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
844 |
* system: provide TAGS file for Isabelle sources; |
9052 | 845 |
|
9288
06a55195741b
infix 'OF' is a version of 'MRS' with more appropriate argument order;
wenzelm
parents:
9239
diff
changeset
|
846 |
* 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
|
847 |
order; |
06a55195741b
infix 'OF' is a version of 'MRS' with more appropriate argument order;
wenzelm
parents:
9239
diff
changeset
|
848 |
|
8994
803533fbb3ec
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
wenzelm
parents:
8991
diff
changeset
|
849 |
* 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
|
850 |
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
|
851 |
|
10003 | 852 |
* ML: new combinators |>> and |>>> for incremental transformations |
853 |
with secondary results (e.g. certain theory extensions): |
|
854 |
||
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
855 |
* 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
|
856 |
overloading (usually false); |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
857 |
|
10003 | 858 |
* ML: PureThy.add_thms/add_axioms/add_defs now return theorems as |
859 |
results; |
|
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
860 |
|
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
861 |
|
8015 | 862 |
|
7986 | 863 |
New in Isabelle99 (October 1999) |
864 |
-------------------------------- |
|
4649 | 865 |
|
5931 | 866 |
*** Overview of INCOMPATIBILITIES (see below for more details) *** |
867 |
||
6922 | 868 |
* HOL: The THEN and ELSE parts of conditional expressions (if P then x else y) |
869 |
are no longer simplified. (This allows the simplifier to unfold recursive |
|
870 |
functional programs.) To restore the old behaviour, declare |
|
7215 | 871 |
|
872 |
Delcongs [if_weak_cong]; |
|
6922 | 873 |
|
6269 | 874 |
* HOL: Removed the obsolete syntax "Compl A"; use -A for set |
875 |
complement; |
|
5931 | 876 |
|
6269 | 877 |
* HOL: the predicate "inj" is now defined by translation to "inj_on"; |
6174 | 878 |
|
7847 | 879 |
* HOL/datatype: mutual_induct_tac no longer exists -- |
880 |
use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"] |
|
881 |
||
6386
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
882 |
* HOL/typedef: fixed type inference for representing set; type |
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
883 |
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
|
884 |
|
6269 | 885 |
* ZF: The con_defs part of an inductive definition may no longer refer |
886 |
to constants declared in the same theory; |
|
6057 | 887 |
|
6269 | 888 |
* HOL, ZF: the function mk_cases, generated by the inductive |
889 |
definition package, has lost an argument. To simplify its result, it |
|
890 |
uses the default simpset instead of a supplied list of theorems. |
|
6141 | 891 |
|
7215 | 892 |
* HOL/List: the constructors of type list are now Nil and Cons; |
893 |
||
7619 | 894 |
* Simplifier: the type of the infix ML functions |
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
895 |
setSSolver addSSolver setSolver addSolver |
7619 | 896 |
is now simpset * solver -> simpset where `solver' is a new abstract type |
897 |
for packaging solvers. A solver is created via |
|
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
898 |
mk_solver: string -> (thm list -> int -> tactic) -> solver |
7619 | 899 |
where the string argument is only a comment. |
6057 | 900 |
|
7647
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset
|
901 |
|
6069 | 902 |
*** Proof tools *** |
903 |
||
6343 | 904 |
* Provers/Arith/fast_lin_arith.ML contains a functor for creating a |
905 |
decision procedure for linear arithmetic. Currently it is used for |
|
7593 | 906 |
types `nat', `int', and `real' in HOL (see below); it can, should and |
907 |
will be instantiated for other types and logics as well. |
|
6069 | 908 |
|
7324 | 909 |
* The simplifier now accepts rewrite rules with flexible heads, eg |
910 |
hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y |
|
911 |
They are applied like any rule with a non-pattern lhs, i.e. by first-order |
|
912 |
matching. |
|
6069 | 913 |
|
7593 | 914 |
|
6014 | 915 |
*** General *** |
916 |
||
7986 | 917 |
* New Isabelle/Isar subsystem provides an alternative to traditional |
7215 | 918 |
tactical theorem proving; together with the ProofGeneral/isar user |
919 |
interface it offers an interactive environment for developing human |
|
920 |
readable proof documents (Isar == Intelligible semi-automated |
|
7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
921 |
reasoning); for further information see isatool doc isar-ref, |
7986 | 922 |
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
|
923 |
|
9612 | 924 |
* improved and simplified presentation of theories: better HTML markup |
925 |
(including colors), graph views in several sizes; isatool usedir now |
|
926 |
provides a proper interface for user theories (via -P option); actual |
|
927 |
document preparation based on (PDF)LaTeX is available as well (for |
|
928 |
new-style theories only); see isatool doc system for more information; |
|
7215 | 929 |
|
7252 | 930 |
* native support for Proof General, both for classic Isabelle and |
7986 | 931 |
Isabelle/Isar; |
7215 | 932 |
|
7791 | 933 |
* ML function thm_deps visualizes dependencies of theorems and lemmas, |
934 |
using the graph browser tool; |
|
935 |
||
6751 | 936 |
* Isabelle manuals now also available as PDF; |
937 |
||
6449 | 938 |
* theory loader rewritten from scratch (may not be fully |
939 |
bug-compatible); old loadpath variable has been replaced by show_path, |
|
6671 | 940 |
add_path, del_path, reset_path functions; new operations such as |
7593 | 941 |
update_thy, touch_thy, remove_thy, use/update_thy_only (see also |
942 |
isatool doc ref); |
|
6449 | 943 |
|
7215 | 944 |
* improved isatool install: option -k creates KDE application icon, |
945 |
option -p DIR installs standalone binaries; |
|
946 |
||
947 |
* added ML_PLATFORM setting (useful for cross-platform installations); |
|
948 |
more robust handling of platform specific ML images for SML/NJ; |
|
949 |
||
7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
950 |
* the settings environment is now statically scoped, i.e. it is never |
7986 | 951 |
created again in sub-processes invoked from isabelle, isatool, or |
7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
952 |
Isabelle; |
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
953 |
|
7215 | 954 |
* path element specification '~~' refers to '$ISABELLE_HOME'; |
955 |
||
6343 | 956 |
* in locales, the "assumes" and "defines" parts may be omitted if |
957 |
empty; |
|
5973 | 958 |
|
6269 | 959 |
* new print_mode "xsymbols" for extended symbol support (e.g. genuine |
960 |
long arrows); |
|
6259
488bdc1bd11a
path element specification '~~' refers to '$ISABELLE_HOME';
wenzelm
parents:
6174
diff
changeset
|
961 |
|
6343 | 962 |
* new print_mode "HTML"; |
963 |
||
964 |
* new flag show_tags controls display of tags of theorems (which are |
|
965 |
basically just comments that may be attached by some tools); |
|
966 |
||
6461 | 967 |
* Isamode 2.6 requires patch to accomodate change of Isabelle font |
968 |
mode and goal output format: |
|
969 |
||
970 |
diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el |
|
971 |
244c244 |
|
972 |
< (list (isa-getenv "ISABELLE") "-msymbols" logic-name) |
|
973 |
--- |
|
6533 | 974 |
> (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name) |
6461 | 975 |
diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el |
976 |
181c181 |
|
977 |
< (defconst proofstate-proofstart-regexp "^Level [0-9]+$" |
|
978 |
--- |
|
979 |
> (defconst proofstate-proofstart-regexp "^Level [0-9]+" |
|
980 |
||
7450 | 981 |
* function bind_thms stores lists of theorems (cf. bind_thm); |
982 |
||
7593 | 983 |
* new shorthand tactics ftac, eatac, datac, fatac; |
984 |
||
985 |
* qed (and friends) now accept "" as result name; in that case the |
|
7986 | 986 |
theorem is not stored, but proper checks and presentation of the |
987 |
result still apply; |
|
7593 | 988 |
|
7805
0ae9ddc36fe0
theorem database now also indexes constants "Trueprop", "all",
wenzelm
parents:
7791
diff
changeset
|
989 |
* theorem database now also indexes constants "Trueprop", "all", |
0ae9ddc36fe0
theorem database now also indexes constants "Trueprop", "all",
wenzelm
parents:
7791
diff
changeset
|
990 |
"==>", "=="; thus thms_containing, findI etc. may retrieve more rules; |
0ae9ddc36fe0
theorem database now also indexes constants "Trueprop", "all",
wenzelm
parents:
7791
diff
changeset
|
991 |
|
6028 | 992 |
|
6057 | 993 |
*** HOL *** |
994 |
||
7215 | 995 |
** HOL arithmetic ** |
996 |
||
6343 | 997 |
* There are now decision procedures for linear arithmetic over nat and |
998 |
int: |
|
6131 | 999 |
|
6343 | 1000 |
1. arith_tac copes with arbitrary formulae involving `=', `<', `<=', |
1001 |
`+', `-', `Suc', `min', `max' and numerical constants; other subterms |
|
1002 |
are treated as atomic; subformulae not involving type `nat' or `int' |
|
1003 |
are ignored; quantified subformulae are ignored unless they are |
|
1004 |
positive universal or negative existential. The tactic has to be |
|
1005 |
invoked by hand and can be a little bit slow. In particular, the |
|
1006 |
running time is exponential in the number of occurrences of `min' and |
|
1007 |
`max', and `-' on `nat'. |
|
6131 | 1008 |
|
6343 | 1009 |
2. fast_arith_tac is a cut-down version of arith_tac: it only takes |
1010 |
(negated) (in)equalities among the premises and the conclusion into |
|
1011 |
account (i.e. no compound formulae) and does not know about `min' and |
|
1012 |
`max', and `-' on `nat'. It is fast and is used automatically by the |
|
1013 |
simplifier. |
|
6131 | 1014 |
|
6343 | 1015 |
NB: At the moment, these decision procedures do not cope with mixed |
1016 |
nat/int formulae where the two parts interact, such as `m < n ==> |
|
1017 |
int(m) < int(n)'. |
|
6028 | 1018 |
|
7215 | 1019 |
* HOL/Numeral provides a generic theory of numerals (encoded |
7313 | 1020 |
efficiently as bit strings); setup for types nat/int/real is in place; |
7215 | 1021 |
INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than |
1022 |
int, existing theories and proof scripts may require a few additional |
|
1023 |
type constraints; |
|
1024 |
||
1025 |
* integer division and remainder can now be performed on constant |
|
1026 |
arguments; |
|
7157 | 1027 |
|
7215 | 1028 |
* many properties of integer multiplication, division and remainder |
1029 |
are now available; |
|
6922 | 1030 |
|
7287 | 1031 |
* An interface to the Stanford Validity Checker (SVC) is available through the |
1032 |
tactic svc_tac. Propositional tautologies and theorems of linear arithmetic |
|
1033 |
are proved automatically. SVC must be installed separately, and its results |
|
1034 |
must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any |
|
1035 |
invocation of the underlying oracle). For SVC see |
|
7444 | 1036 |
http://verify.stanford.edu/SVC |
6922 | 1037 |
|
7125 | 1038 |
* IsaMakefile: the HOL-Real target now builds an actual image; |
1039 |
||
7215 | 1040 |
|
1041 |
** HOL misc ** |
|
1042 |
||
7595
5f5d575ddac3
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
wenzelm
parents:
7593
diff
changeset
|
1043 |
* 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
|
1044 |
(in Isabelle/Isar) -- by Gertrud Bauer; |
5f5d575ddac3
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
wenzelm
parents:
7593
diff
changeset
|
1045 |
|
7691 | 1046 |
* HOL/BCV: generic model of bytecode verification, i.e. data-flow |
1047 |
analysis for assembly languages with subtypes; |
|
1048 |
||
6278 | 1049 |
* HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization |
1050 |
-- avoids syntactic ambiguities and treats state, transition, and |
|
1051 |
temporal levels more uniformly; introduces INCOMPATIBILITIES due to |
|
1052 |
changed syntax and (many) tactics; |
|
1053 |
||
7791 | 1054 |
* HOL/inductive: Now also handles more general introduction rules such |
1055 |
as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity |
|
1056 |
theorems are now maintained within the theory (maintained via the |
|
1057 |
"mono" attribute); |
|
7780
099742c562aa
Documented changes to HOL/inductive and function thm_deps.
berghofe
parents:
7691
diff
changeset
|
1058 |
|
7238
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1059 |
* HOL/datatype: Now also handles arbitrarily branching datatypes |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1060 |
(using function types) such as |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1061 |
|
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1062 |
datatype 'a tree = Atom 'a | Branch "nat => 'a tree" |
7047
d103b875ef1d
Datatype package now handles arbitrarily branching datatypes.
berghofe
parents:
6925
diff
changeset
|
1063 |
|
7326 | 1064 |
* HOL/record: record_simproc (part of the default simpset) takes care |
1065 |
of selectors applied to updated records; record_split_tac is no longer |
|
7327 | 1066 |
part of the default claset; update_defs may now be removed from the |
1067 |
simpset in many cases; COMPATIBILITY: old behavior achieved by |
|
7326 | 1068 |
|
1069 |
claset_ref () := claset() addSWrapper record_split_wrapper; |
|
1070 |
Delsimprocs [record_simproc] |
|
1071 |
||
6386
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
1072 |
* HOL/typedef: fixed type inference for representing set; type |
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
1073 |
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
|
1074 |
|
7287 | 1075 |
* HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem |
1076 |
names rather than an ML expression; |
|
1077 |
||
1078 |
* HOL/defer_recdef (TFL): like recdef but the well-founded relation can be |
|
1079 |
supplied later. Program schemes can be defined, such as |
|
1080 |
"While B C s = (if B s then While B C (C s) else s)" |
|
1081 |
where the well-founded relation can be chosen after B and C have been given. |
|
6563 | 1082 |
|
7215 | 1083 |
* HOL/List: the constructors of type list are now Nil and Cons; |
1084 |
INCOMPATIBILITY: while [] and infix # syntax is still there, of |
|
1085 |
course, ML tools referring to List.list.op # etc. have to be adapted; |
|
1086 |
||
7238
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1087 |
* HOL_quantifiers flag superseded by "HOL" print mode, which is |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1088 |
disabled by default; run isabelle with option -m HOL to get back to |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1089 |
the original Gordon/HOL-style output; |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1090 |
|
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1091 |
* HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P, |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1092 |
ALL x<=y. P, EX x<y. P, EX x<=y. P; |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1093 |
|
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1094 |
* HOL basic syntax simplified (more orthogonal): all variants of |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1095 |
All/Ex now support plain / symbolic / HOL notation; plain syntax for |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1096 |
Eps operator is provided as well: "SOME x. P[x]"; |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1097 |
|
7320 | 1098 |
* HOL/Sum.thy: sum_case has been moved to HOL/Datatype; |
7261 | 1099 |
|
7280 | 1100 |
* HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made |
1101 |
thus available for user theories; |
|
1102 |
||
7300
8439bf404c28
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with HOL/List;
wenzelm
parents:
7287
diff
changeset
|
1103 |
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with |
8439bf404c28
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with HOL/List;
wenzelm
parents:
7287
diff
changeset
|
1104 |
HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the |
8439bf404c28
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with HOL/List;
wenzelm
parents:
7287
diff
changeset
|
1105 |
time; |
8439bf404c28
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with HOL/List;
wenzelm
parents:
7287
diff
changeset
|
1106 |
|
7986 | 1107 |
* HOL: new tactic smp_tac: int -> int -> tactic, which applies spec |
1108 |
several times and then mp; |
|
7492 | 1109 |
|
7215 | 1110 |
|
7113 | 1111 |
*** LK *** |
1112 |
||
7215 | 1113 |
* the notation <<...>> is now available as a notation for sequences of |
1114 |
formulas; |
|
7113 | 1115 |
|
1116 |
* the simplifier is now installed |
|
1117 |
||
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
1118 |
* the axiom system has been generalized (thanks to Soren Heilmann) |
7113 | 1119 |
|
1120 |
* the classical reasoner now has a default rule database |
|
1121 |
||
1122 |
||
6064 | 1123 |
*** ZF *** |
1124 |
||
1125 |
* new primrec section allows primitive recursive functions to be given |
|
6269 | 1126 |
directly (as in HOL) over datatypes and the natural numbers; |
6064 | 1127 |
|
6269 | 1128 |
* new tactics induct_tac and exhaust_tac for induction (or case |
1129 |
analysis) over datatypes and the natural numbers; |
|
6064 | 1130 |
|
1131 |
* the datatype declaration of type T now defines the recursor T_rec; |
|
1132 |
||
6141 | 1133 |
* simplification automatically does freeness reasoning for datatype |
6269 | 1134 |
constructors; |
6141 | 1135 |
|
6269 | 1136 |
* automatic type-inference, with AddTCs command to insert new |
1137 |
type-checking rules; |
|
6155 | 1138 |
|
6269 | 1139 |
* datatype introduction rules are now added as Safe Introduction rules |
1140 |
to the claset; |
|
6155 | 1141 |
|
6269 | 1142 |
* the syntax "if P then x else y" is now available in addition to |
1143 |
if(P,x,y); |
|
1144 |
||
6069 | 1145 |
|
6343 | 1146 |
*** Internal programming interfaces *** |
1147 |
||
7919
35c18affc1d8
tuned simplifier trace output; new flag debug_simp
wenzelm
parents:
7886
diff
changeset
|
1148 |
* tuned simplifier trace output; new flag debug_simp; |
35c18affc1d8
tuned simplifier trace output; new flag debug_simp
wenzelm
parents:
7886
diff
changeset
|
1149 |
|
7420
cba45c114f3b
structures Vartab / Termtab (instances of TableFun);
wenzelm
parents:
7327
diff
changeset
|
1150 |
* structures Vartab / Termtab (instances of TableFun) offer efficient |
cba45c114f3b
structures Vartab / Termtab (instances of TableFun);
wenzelm
parents:
7327
diff
changeset
|
1151 |
tables indexed by indexname_ord / term_ord (compatible with aconv); |
cba45c114f3b
structures Vartab / Termtab (instances of TableFun);
wenzelm
parents:
7327
diff
changeset
|
1152 |
|
6386
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
1153 |
* AxClass.axclass_tac lost the theory argument; |
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
1154 |
|
6343 | 1155 |
* tuned current_goals_markers semantics: begin / end goal avoids |
1156 |
printing empty lines; |
|
1157 |
||
1158 |
* removed prs and prs_fn hook, which was broken because it did not |
|
1159 |
include \n in its semantics, forcing writeln to add one |
|
1160 |
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: |
|
1161 |
string -> unit if you really want to output text without newline; |
|
1162 |
||
1163 |
* Symbol.output subject to print mode; INCOMPATIBILITY: defaults to |
|
1164 |
plain output, interface builders may have to enable 'isabelle_font' |
|
1165 |
mode to get Isabelle font glyphs as before; |
|
1166 |
||
1167 |
* refined token_translation interface; INCOMPATIBILITY: output length |
|
1168 |
now of type real instead of int; |
|
1169 |
||
7196 | 1170 |
* theory loader actions may be traced via new ThyInfo.add_hook |
1171 |
interface (see src/Pure/Thy/thy_info.ML); example application: keep |
|
1172 |
your own database of information attached to *whole* theories -- as |
|
1173 |
opposed to intra-theory data slots offered via TheoryDataFun; |
|
1174 |
||
7647
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset
|
1175 |
* proper handling of dangling sort hypotheses (at last!); |
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset
|
1176 |
Thm.strip_shyps and Drule.strip_shyps_warning take care of removing |
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset
|
1177 |
extra sort hypotheses that can be witnessed from the type signature; |
7986 | 1178 |
the force_strip_shyps flag is gone, any remaining shyps are simply |
1179 |
left in the theorem (with a warning issued by strip_shyps_warning); |
|
7647
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset
|
1180 |
|
6343 | 1181 |
|
6064 | 1182 |
|
5781 | 1183 |
New in Isabelle98-1 (October 1998) |
1184 |
---------------------------------- |
|
1185 |
||
5127 | 1186 |
*** Overview of INCOMPATIBILITIES (see below for more details) *** |
4842 | 1187 |
|
5726 | 1188 |
* several changes of automated proof tools; |
5373 | 1189 |
|
5726 | 1190 |
* HOL: major changes to the inductive and datatype packages, including |
1191 |
some minor incompatibilities of theory syntax; |
|
5214 | 1192 |
|
5726 | 1193 |
* HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now |
5217 | 1194 |
called `inj_on'; |
5160 | 1195 |
|
5275 | 1196 |
* HOL: removed duplicate thms in Arith: |
1197 |
less_imp_add_less should be replaced by trans_less_add1 |
|
1198 |
le_imp_add_le should be replaced by trans_le_add1 |
|
5160 | 1199 |
|
5726 | 1200 |
* HOL: unary minus is now overloaded (new type constraints may be |
1201 |
required); |
|
5490 | 1202 |
|
5726 | 1203 |
* HOL and ZF: unary minus for integers is now #- instead of #~. In |
1204 |
ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is |
|
1205 |
now taken as an integer constant. |
|
5541 | 1206 |
|
5726 | 1207 |
* Pure: ML function 'theory_of' renamed to 'theory'; |
5397
034ed25535b9
* Pure: ML function 'theory_of' replaced by 'theory';
wenzelm
parents:
5373
diff
changeset
|
1208 |
|
5363 | 1209 |
|
5127 | 1210 |
*** Proof tools *** |
4880 | 1211 |
|
5657
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
1212 |
* Simplifier: |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
1213 |
1. Asm_full_simp_tac is now more aggressive. |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
1214 |
1. It will sometimes reorient premises if that increases their power to |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
1215 |
simplify. |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
1216 |
2. It does no longer proceed strictly from left to right but may also |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
1217 |
rotate premises to achieve further simplification. |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
1218 |
For compatibility reasons there is now Asm_lr_simp_tac which is like the |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
1219 |
old Asm_full_simp_tac in that it does not rotate premises. |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
1220 |
2. The simplifier now knows a little bit about nat-arithmetic. |
4880 | 1221 |
|
5127 | 1222 |
* Classical reasoner: wrapper mechanism for the classical reasoner now |
1223 |
allows for selected deletion of wrappers, by introduction of names for |
|
1224 |
wrapper functionals. This implies that addbefore, addSbefore, |
|
1225 |
addaltern, and addSaltern now take a pair (name, tactic) as argument, |
|
1226 |
and that adding two tactics with the same name overwrites the first |
|
1227 |
one (emitting a warning). |
|
4824 | 1228 |
type wrapper = (int -> tactic) -> (int -> tactic) |
4649 | 1229 |
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by |
4824 | 1230 |
addWrapper, addSWrapper: claset * (string * wrapper) -> claset |
1231 |
delWrapper, delSWrapper: claset * string -> claset |
|
4649 | 1232 |
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; |
1233 |
||
5705
56f2030c46c6
tuned (all proofs are INSTABLE by David's definition of instability);
wenzelm
parents:
5671
diff
changeset
|
1234 |
* Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE |
5726 | 1235 |
semantics; addbefore now affects only the unsafe part of step_tac |
1236 |
etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY |
|
1237 |
FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac |
|
1238 |
by Force_tac; |
|
5524 | 1239 |
|
5726 | 1240 |
* Classical reasoner: setwrapper to setWrapper and compwrapper to |
1241 |
compWrapper; added safe wrapper (and access functions for it); |
|
5524 | 1242 |
|
5127 | 1243 |
* HOL/split_all_tac is now much faster and fails if there is nothing |
5726 | 1244 |
to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order |
1245 |
and the names of the automatically generated variables have changed. |
|
1246 |
split_all_tac has moved within claset() from unsafe wrappers to safe |
|
1247 |
wrappers, which means that !!-bound variables are split much more |
|
1248 |
aggressively, and safe_tac and clarify_tac now split such variables. |
|
1249 |
If this splitting is not appropriate, use delSWrapper "split_all_tac". |
|
1250 |
Note: the same holds for record_split_tac, which does the job of |
|
1251 |
split_all_tac for record fields. |
|
5127 | 1252 |
|
5726 | 1253 |
* HOL/Simplifier: Rewrite rules for case distinctions can now be added |
1254 |
permanently to the default simpset using Addsplits just like |
|
1255 |
Addsimps. They can be removed via Delsplits just like |
|
1256 |
Delsimps. Lower-case versions are also available. |
|
5127 | 1257 |
|
5726 | 1258 |
* HOL/Simplifier: The rule split_if is now part of the default |
1259 |
simpset. This means that the simplifier will eliminate all occurrences |
|
1260 |
of if-then-else in the conclusion of a goal. To prevent this, you can |
|
1261 |
either remove split_if completely from the default simpset by |
|
1262 |
`Delsplits [split_if]' or remove it in a specific call of the |
|
1263 |
simplifier using `... delsplits [split_if]'. You can also add/delete |
|
1264 |
other case splitting rules to/from the default simpset: every datatype |
|
1265 |
generates suitable rules `split_t_case' and `split_t_case_asm' (where |
|
1266 |
t is the name of the datatype). |
|
5127 | 1267 |
|
5726 | 1268 |
* Classical reasoner / Simplifier combination: new force_tac (and |
5127 | 1269 |
derivatives Force_tac, force) combines rewriting and classical |
1270 |
reasoning (and whatever other tools) similarly to auto_tac, but is |
|
5726 | 1271 |
aimed to solve the given subgoal completely. |
5127 | 1272 |
|
1273 |
||
1274 |
*** General *** |
|
1275 |
||
5217 | 1276 |
* new top-level commands `Goal' and `Goalw' that improve upon `goal' |
5127 | 1277 |
and `goalw': the theory is no longer needed as an explicit argument - |
1278 |
the current theory context is used; assumptions are no longer returned |
|
1279 |
at the ML-level unless one of them starts with ==> or !!; it is |
|
5217 | 1280 |
recommended to convert to these new commands using isatool fixgoal |
1281 |
(backup your sources first!); |
|
4842 | 1282 |
|
5217 | 1283 |
* new top-level commands 'thm' and 'thms' for retrieving theorems from |
5207 | 1284 |
the current theory context, and 'theory' to lookup stored theories; |
4806 | 1285 |
|
5722 | 1286 |
* new theory section 'locale' for declaring constants, assumptions and |
1287 |
definitions that have local scope; |
|
1288 |
||
5127 | 1289 |
* new theory section 'nonterminals' for purely syntactic types; |
4858 | 1290 |
|
5127 | 1291 |
* new theory section 'setup' for generic ML setup functions |
1292 |
(e.g. package initialization); |
|
4869 | 1293 |
|
5131 | 1294 |
* the distribution now includes Isabelle icons: see |
1295 |
lib/logo/isabelle-{small,tiny}.xpm; |
|
1296 |
||
5363 | 1297 |
* isatool install - install binaries with absolute references to |
1298 |
ISABELLE_HOME/bin; |
|
1299 |
||
5572 | 1300 |
* isatool logo -- create instances of the Isabelle logo (as EPS); |
1301 |
||
5407 | 1302 |
* print mode 'emacs' reserved for Isamode; |
1303 |
||
5726 | 1304 |
* support multiple print (ast) translations per constant name; |
1305 |
||
6925
8d4d45ec6a3d
theorems involving oracles are now printed with a suffixed [!];
wenzelm
parents:
6922
diff
changeset
|
1306 |
* theorems involving oracles are now printed with a suffixed [!]; |
8d4d45ec6a3d
theorems involving oracles are now printed with a suffixed [!];
wenzelm
parents:
6922
diff
changeset
|
1307 |
|
4711 | 1308 |
|
4661 | 1309 |
*** HOL *** |
1310 |
||
5710 | 1311 |
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial'); |
5709 | 1312 |
|
5217 | 1313 |
* HOL/inductive package reorganized and improved: now supports mutual |
5267 | 1314 |
definitions such as |
5217 | 1315 |
|
1316 |
inductive EVEN ODD |
|
1317 |
intrs |
|
1318 |
null "0 : EVEN" |
|
1319 |
oddI "n : EVEN ==> Suc n : ODD" |
|
1320 |
evenI "n : ODD ==> Suc n : EVEN" |
|
1321 |
||
1322 |
new theorem list "elims" contains an elimination rule for each of the |
|
1323 |
recursive sets; inductive definitions now handle disjunctive premises |
|
1324 |
correctly (also ZF); |
|
5214 | 1325 |
|
5217 | 1326 |
INCOMPATIBILITIES: requires Inductive as an ancestor; component |
1327 |
"mutual_induct" no longer exists - the induction rule is always |
|
1328 |
contained in "induct"; |
|
1329 |
||
1330 |
||
1331 |
* HOL/datatype package re-implemented and greatly improved: now |
|
5267 | 1332 |
supports mutually recursive datatypes such as |
5217 | 1333 |
|
1334 |
datatype |
|
1335 |
'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp) |
|
1336 |
| SUM ('a aexp) ('a aexp) |
|
1337 |
| DIFF ('a aexp) ('a aexp) |
|
1338 |
| NUM 'a |
|
1339 |
and |
|
1340 |
'a bexp = LESS ('a aexp) ('a aexp) |
|
1341 |
| AND ('a bexp) ('a bexp) |
|
1342 |
| OR ('a bexp) ('a bexp) |
|
1343 |
||
5267 | 1344 |
as well as indirectly recursive datatypes such as |
5214 | 1345 |
|
5217 | 1346 |
datatype |
1347 |
('a, 'b) term = Var 'a |
|
1348 |
| App 'b ((('a, 'b) term) list) |
|
5214 | 1349 |
|
5217 | 1350 |
The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs |
1351 |
induction on mutually / indirectly recursive datatypes. |
|
1352 |
||
1353 |
Primrec equations are now stored in theory and can be accessed via |
|
1354 |
<function_name>.simps. |
|
1355 |
||
1356 |
INCOMPATIBILITIES: |
|
5214 | 1357 |
|
5217 | 1358 |
- Theories using datatypes must now have theory Datatype as an |
1359 |
ancestor. |
|
1360 |
- The specific <typename>.induct_tac no longer exists - use the |
|
1361 |
generic induct_tac instead. |
|
5226 | 1362 |
- natE has been renamed to nat.exhaust - use exhaust_tac |
5217 | 1363 |
instead of res_inst_tac ... natE. Note that the variable |
5226 | 1364 |
names in nat.exhaust differ from the names in natE, this |
5217 | 1365 |
may cause some "fragile" proofs to fail. |
1366 |
- The theorems split_<typename>_case and split_<typename>_case_asm |
|
1367 |
have been renamed to <typename>.split and <typename>.split_asm. |
|
1368 |
- Since default sorts of type variables are now handled correctly, |
|
1369 |
some datatype definitions may have to be annotated with explicit |
|
1370 |
sort constraints. |
|
1371 |
- Primrec definitions no longer require function name and type |
|
1372 |
of recursive argument. |
|
5214 | 1373 |
|
5217 | 1374 |
Consider using isatool fixdatatype to adapt your theories and proof |
1375 |
scripts to the new package (backup your sources first!). |
|
1376 |
||
1377 |
||
5726 | 1378 |
* HOL/record package: considerably improved implementation; now |
1379 |
includes concrete syntax for record types, terms, updates; theorems |
|
1380 |
for surjective pairing and splitting !!-bound record variables; proof |
|
1381 |
support is as follows: |
|
1382 |
||
1383 |
1) standard conversions (selectors or updates applied to record |
|
1384 |
constructor terms) are part of the standard simpset; |
|
1385 |
||
1386 |
2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are |
|
1387 |
made part of standard simpset and claset via addIffs; |
|
1388 |
||
1389 |
3) a tactic for record field splitting (record_split_tac) is part of |
|
1390 |
the standard claset (addSWrapper); |
|
1391 |
||
1392 |
To get a better idea about these rules you may retrieve them via |
|
1393 |
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is |
|
1394 |
the name of your record type. |
|
1395 |
||
1396 |
The split tactic 3) conceptually simplifies by the following rule: |
|
1397 |
||
1398 |
"(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))" |
|
1399 |
||
1400 |
Thus any record variable that is bound by meta-all will automatically |
|
1401 |
blow up into some record constructor term, consequently the |
|
1402 |
simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall |
|
1403 |
solve record problems automatically. |
|
1404 |
||
5214 | 1405 |
|
5125 | 1406 |
* reorganized the main HOL image: HOL/Integ and String loaded by |
1407 |
default; theory Main includes everything; |
|
1408 |
||
5650 | 1409 |
* automatic simplification of integer sums and comparisons, using cancellation; |
1410 |
||
5526 | 1411 |
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; |
5127 | 1412 |
|
1413 |
* added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset; |
|
1414 |
||
1415 |
* many new identities for unions, intersections, set difference, etc.; |
|
1416 |
||
1417 |
* expand_if, expand_split, expand_sum_case and expand_nat_case are now |
|
1418 |
called split_if, split_split, split_sum_case and split_nat_case (to go |
|
1419 |
with add/delsplits); |
|
5125 | 1420 |
|