author | haftmann |
Thu, 13 Nov 2008 15:58:38 +0100 | |
changeset 28741 | 1b257449f804 |
parent 28710 | e2064974c114 |
child 28855 | 5d21a3e7303c |
permissions | -rw-r--r-- |
5363 | 1 |
Isabelle NEWS -- history user-relevant changes |
2 |
============================================== |
|
2553 | 3 |
|
27122 | 4 |
New in this Isabelle version |
5 |
---------------------------- |
|
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
6 |
|
27599 | 7 |
*** General *** |
8 |
||
28504
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
9 |
* Simplified main Isabelle executables, with less surprises on |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
10 |
case-insensitive file-systems (such as Mac OS). |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
11 |
|
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
12 |
- The main Isabelle tool wrapper is now called "isabelle" instead of |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
13 |
"isatool." |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
14 |
|
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
15 |
- The former "isabelle" alias for "isabelle-process" has been |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
16 |
removed (should rarely occur to regular users). |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
17 |
|
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
18 |
- The "Isabelle" alias for "isabelle-interface" has been removed. |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
19 |
|
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
20 |
Within scripts and make files, the Isabelle environment variables |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
21 |
ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE, |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
22 |
respectively. (The latter are still available as legacy feature.) |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
23 |
|
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
24 |
Also note that user interfaces are now better wrapped as regular |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
25 |
Isabelle tools instead of using the special isabelle-interface wrapper |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
26 |
(which can be confusing if the interface is uninstalled or changed |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
27 |
otherwise). See "isabelle tty" and "isabelle emacs" for contemporary |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
28 |
examples. |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
29 |
|
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
30 |
INCOMPATIBILITY, need to adapt derivative scripts. Users may need to |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
31 |
purge installed copies of Isabelle executables and re-run "isabelle |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
32 |
install -p ...", or use symlinks. |
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelle-process), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset
|
33 |
|
28252 | 34 |
* The Isabelle System Manual (system) has been updated, with formally |
35 |
checked references as hyperlinks. |
|
36 |
||
27599 | 37 |
* Generalized Isar history, with support for linear undo, direct state |
38 |
addressing etc. |
|
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
39 |
|
27191 | 40 |
* Recovered hiding of consts, which was accidentally broken in |
41 |
Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really |
|
42 |
makes c inaccessible; consider using ``hide (open) const c'' instead. |
|
43 |
||
27599 | 44 |
* Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML |
45 |
interface instead. |
|
46 |
||
47 |
||
48 |
*** Pure *** |
|
49 |
||
28629
c5a915b45390
goal-directed proof now enforces strict proof irrelevance wrt. sort hypotheses;
wenzelm
parents:
28606
diff
changeset
|
50 |
* Goal-directed proof now enforces strict proof irrelevance wrt. sort |
c5a915b45390
goal-directed proof now enforces strict proof irrelevance wrt. sort hypotheses;
wenzelm
parents:
28606
diff
changeset
|
51 |
hypotheses. Sorts required in the course of reasoning need to be |
c5a915b45390
goal-directed proof now enforces strict proof irrelevance wrt. sort hypotheses;
wenzelm
parents:
28606
diff
changeset
|
52 |
covered by the constraints in the initial statement, completed by the |
c5a915b45390
goal-directed proof now enforces strict proof irrelevance wrt. sort hypotheses;
wenzelm
parents:
28606
diff
changeset
|
53 |
type instance information of the background theory. Non-trivial sort |
c5a915b45390
goal-directed proof now enforces strict proof irrelevance wrt. sort hypotheses;
wenzelm
parents:
28606
diff
changeset
|
54 |
hypotheses, which rarely occur in practice, may be specified via |
28633 | 55 |
vacuous propositions of the form SORT_CONSTRAINT('a::c). For example: |
28629
c5a915b45390
goal-directed proof now enforces strict proof irrelevance wrt. sort hypotheses;
wenzelm
parents:
28606
diff
changeset
|
56 |
|
c5a915b45390
goal-directed proof now enforces strict proof irrelevance wrt. sort hypotheses;
wenzelm
parents:
28606
diff
changeset
|
57 |
lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ... |
c5a915b45390
goal-directed proof now enforces strict proof irrelevance wrt. sort hypotheses;
wenzelm
parents:
28606
diff
changeset
|
58 |
|
c5a915b45390
goal-directed proof now enforces strict proof irrelevance wrt. sort hypotheses;
wenzelm
parents:
28606
diff
changeset
|
59 |
The result contains an implicit sort hypotheses as before -- |
28631 | 60 |
SORT_CONSTRAINT premises are eliminated as part of the canonical rule |
61 |
normalization. |
|
28629
c5a915b45390
goal-directed proof now enforces strict proof irrelevance wrt. sort hypotheses;
wenzelm
parents:
28606
diff
changeset
|
62 |
|
28178
e56b8b044bef
* Changed defaults for unify configuration options;
wenzelm
parents:
28143
diff
changeset
|
63 |
* Changed defaults for unify configuration options: |
e56b8b044bef
* Changed defaults for unify configuration options;
wenzelm
parents:
28143
diff
changeset
|
64 |
|
e56b8b044bef
* Changed defaults for unify configuration options;
wenzelm
parents:
28143
diff
changeset
|
65 |
unify_trace_bound = 50 (formerly 25) |
e56b8b044bef
* Changed defaults for unify configuration options;
wenzelm
parents:
28143
diff
changeset
|
66 |
unify_search_bound = 60 (formerly 30) |
e56b8b044bef
* Changed defaults for unify configuration options;
wenzelm
parents:
28143
diff
changeset
|
67 |
|
28143 | 68 |
* Different bookkeeping for code equations: |
69 |
a) On theory merge, the last set of code equations for a particular constant |
|
70 |
is taken (in accordance with the policy applied by other parts of the |
|
71 |
code generator framework). |
|
72 |
b) Code equations stemming from explicit declarations (e.g. code attribute) |
|
73 |
gain priority over default code equations stemming from definition, primrec, |
|
74 |
fun etc. |
|
75 |
INCOMPATIBILITY. |
|
76 |
||
28058 | 77 |
* Global versions of theorems stemming from classes do not carry |
78 |
a parameter prefix any longer. INCOMPATIBILITY. |
|
79 |
||
28710 | 80 |
* Dropped locale element "includes". This is a major INCOMPATIBILITY. |
81 |
In existing theorem specifications replace the includes element by the |
|
82 |
respective context elements of the included locale, omitting those that |
|
83 |
are already present in the theorem specification. Multiple assume |
|
84 |
elements of a locale should be replaced by a single one involving the |
|
85 |
locale predicate. In the proof body, declarations (most notably |
|
86 |
theorems) may be regained by interpreting the respective locales in the |
|
87 |
proof context as required (command "interpret"). |
|
88 |
If using "includes" in replacement of a target solely because the |
|
89 |
parameter types in the theorem are not as general as in the target, |
|
90 |
consider declaring a new locale with additional type constraints on the |
|
91 |
parameters (context element "constrains"). |
|
92 |
||
27761
b95e9ba0ca1d
Interpretation command (theory/proof context) no longer simplifies goal.
ballarin
parents:
27717
diff
changeset
|
93 |
* Dropped "locale (open)". INCOMPATBILITY. |
b95e9ba0ca1d
Interpretation command (theory/proof context) no longer simplifies goal.
ballarin
parents:
27717
diff
changeset
|
94 |
|
28085
914183e229e9
Interpretation commands no longer accept interpretation attributes.
ballarin
parents:
28067
diff
changeset
|
95 |
* Interpretation commands no longer attempt to simplify goal. |
27761
b95e9ba0ca1d
Interpretation command (theory/proof context) no longer simplifies goal.
ballarin
parents:
27717
diff
changeset
|
96 |
INCOMPATIBILITY: in rare situations the generated goal differs. Use |
b95e9ba0ca1d
Interpretation command (theory/proof context) no longer simplifies goal.
ballarin
parents:
27717
diff
changeset
|
97 |
methods intro_locales and unfold_locales to clarify. |
27681 | 98 |
|
28085
914183e229e9
Interpretation commands no longer accept interpretation attributes.
ballarin
parents:
28067
diff
changeset
|
99 |
* Interpretation commands no longer accept interpretation attributes. |
914183e229e9
Interpretation commands no longer accept interpretation attributes.
ballarin
parents:
28067
diff
changeset
|
100 |
INCOMPATBILITY. |
914183e229e9
Interpretation commands no longer accept interpretation attributes.
ballarin
parents:
28067
diff
changeset
|
101 |
|
27651
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
102 |
* Command 'instance': attached definitions no longer accepted. |
27141
9bfcdb1905e1
* Attributes cases, induct, coinduct support del option.
wenzelm
parents:
27122
diff
changeset
|
103 |
INCOMPATIBILITY, use proper 'instantiation' target. |
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
104 |
|
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
105 |
* Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY. |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
106 |
|
28114 | 107 |
* The 'axiomatization' command now only works within a global theory |
108 |
context. INCOMPATIBILITY. |
|
109 |
||
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
110 |
|
27381 | 111 |
*** Document preparation *** |
112 |
||
113 |
* Antiquotation @{lemma} now imitates a regular terminal proof, |
|
27392 | 114 |
demanding keyword 'by' and supporting the full method expression |
27519
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset
|
115 |
syntax just like the Isar command 'by'. |
27381 | 116 |
|
117 |
||
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
118 |
*** HOL *** |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
119 |
|
28741 | 120 |
* If methods "eval" and "evaluation" encounter a structured proof state |
121 |
with !!/==>, only the conclusion is evaluated to True (if possible), |
|
122 |
avoiding strange error messages. |
|
123 |
||
124 |
* Simplifier: simproc for let expressions now unfolds if bound variable |
|
125 |
occurs at most one time in let expression body. INCOMPATIBILITY. |
|
126 |
||
28685 | 127 |
* New classes "top" and "bot" with corresponding operations "top" and "bot" |
128 |
in theory Orderings; instantiation of class "complete_lattice" requires |
|
129 |
instantiation of classes "top" and "bot". INCOMPATIBILITY. |
|
130 |
||
131 |
* Changed definition lemma "less_fun_def" in order to provide an instance |
|
132 |
for preorders on functions; use lemma "less_le" instead. INCOMPATIBILITY. |
|
133 |
||
28604
f36496b73227
generic ATP manager based on threads (by Fabian Immler);
wenzelm
parents:
28563
diff
changeset
|
134 |
* Unified theorem tables for both code code generators. Thus |
f36496b73227
generic ATP manager based on threads (by Fabian Immler);
wenzelm
parents:
28563
diff
changeset
|
135 |
[code func] has disappeared and only [code] remains. INCOMPATIBILITY. |
f36496b73227
generic ATP manager based on threads (by Fabian Immler);
wenzelm
parents:
28563
diff
changeset
|
136 |
|
28685 | 137 |
* Constants "undefined" and "default" replace "arbitrary". Usually |
138 |
"undefined" is the right choice to replace "arbitrary", though logically |
|
139 |
there is no difference. INCOMPATIBILITY. |
|
28604
f36496b73227
generic ATP manager based on threads (by Fabian Immler);
wenzelm
parents:
28563
diff
changeset
|
140 |
|
f36496b73227
generic ATP manager based on threads (by Fabian Immler);
wenzelm
parents:
28563
diff
changeset
|
141 |
* Generic ATP manager for Sledgehammer, based on ML threads instead of |
28605 | 142 |
Posix processes. Avoids potentially expensive forking of the ML |
143 |
process. New thread-based implementation also works on non-Unix |
|
144 |
platforms (Cygwin). Provers are no longer hardwired, but defined |
|
28606 | 145 |
within the theory via plain ML wrapper functions. Basic Sledgehammer |
146 |
commands are covered in the isar-ref manual |
|
28604
f36496b73227
generic ATP manager based on threads (by Fabian Immler);
wenzelm
parents:
28563
diff
changeset
|
147 |
|
f36496b73227
generic ATP manager based on threads (by Fabian Immler);
wenzelm
parents:
28563
diff
changeset
|
148 |
* Wrapper scripts for remote SystemOnTPTP service allows to use |
28475 | 149 |
sledgehammer without local ATP installation (Vampire etc.). See also |
150 |
ISABELLE_HOME/contrib/SystemOnTPTP and the VAMPIRE_HOME setting |
|
28604
f36496b73227
generic ATP manager based on threads (by Fabian Immler);
wenzelm
parents:
28563
diff
changeset
|
151 |
variable. Other provers may be included via suitable ML wrappers, see |
f36496b73227
generic ATP manager based on threads (by Fabian Immler);
wenzelm
parents:
28563
diff
changeset
|
152 |
also src/HOL/ATP_Linkup.thy. |
28474
d0b8b0a1fca5
Vampire wrapper script for remote SystemOnTPTP service (by Fabian Immler);
wenzelm
parents:
28350
diff
changeset
|
153 |
|
28350 | 154 |
* Normalization by evaluation now allows non-leftlinear equations. |
155 |
Declare with attribute [code nbe]. |
|
156 |
||
157 |
* Command "value" now integrates different evaluation |
|
28248 | 158 |
mechanisms. The result of the first successful evaluation mechanism |
159 |
is printed. In square brackets a particular named evaluation |
|
160 |
mechanisms may be specified (currently, [SML], [code] or [nbe]). See |
|
161 |
further src/HOL/ex/Eval_Examples.thy. |
|
28227 | 162 |
|
28088
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset
|
163 |
* HOL/Orderings: class "wellorder" moved here, with explicit induction |
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset
|
164 |
rule "less_induct" as assumption. For instantiation of "wellorder" by |
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset
|
165 |
means of predicate "wf", use rule wf_wellorderI. INCOMPATIBILITY. |
27823 | 166 |
|
27793 | 167 |
* HOL/Orderings: added class "preorder" as superclass of "order". |
168 |
INCOMPATIBILITY: Instantiation proofs for order, linorder |
|
169 |
etc. slightly changed. Some theorems named order_class.* now named |
|
170 |
preorder_class.*. |
|
171 |
||
172 |
* HOL/Ring_and_Field and HOL/Divides: Definition of "op dvd" has been |
|
173 |
moved to separate class dvd in Ring_and_Field; a couple of lemmas on |
|
174 |
dvd has been generalized to class comm_semiring_1. Likewise a bunch |
|
175 |
of lemmas from Divides has been generalized from nat to class |
|
176 |
semiring_div. INCOMPATIBILITY. This involves the following theorem |
|
177 |
renames resulting from duplicate elimination: |
|
27651
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
178 |
|
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
179 |
dvd_def_mod ~> dvd_eq_mod_eq_0 |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
180 |
zero_dvd_iff ~> dvd_0_left_iff |
28559 | 181 |
dvd_0 ~> dvd_0_right |
27651
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
182 |
DIVISION_BY_ZERO_DIV ~> div_by_0 |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
183 |
DIVISION_BY_ZERO_MOD ~> mod_by_0 |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
184 |
mult_div ~> div_mult_self2_is_id |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
185 |
mult_mod ~> mod_mult_self2_is_0 |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
186 |
|
27599 | 187 |
* HOL/Library/GCD: Curried operations gcd, lcm (for nat) and zgcd, |
188 |
zlcm (for int); carried together from various gcd/lcm developements in |
|
189 |
the HOL Distribution. zgcd and zlcm replace former igcd and ilcm; |
|
190 |
corresponding theorems renamed accordingly. INCOMPATIBILY. To |
|
191 |
recover tupled syntax, use syntax declarations like: |
|
27556 | 192 |
|
193 |
hide (open) const gcd |
|
194 |
abbreviation gcd where |
|
195 |
"gcd == (%(a, b). GCD.gcd a b)" |
|
196 |
notation (output) |
|
197 |
GCD.gcd ("gcd '(_, _')") |
|
198 |
||
199 |
(analogously for lcm, zgcd, zlcm). |
|
200 |
||
201 |
* HOL/Real/Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY. |
|
27551 | 202 |
|
27651
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
203 |
* New ML antiquotation @{code}: takes constant as argument, generates |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
204 |
corresponding code in background and inserts name of the corresponding |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
205 |
resulting ML value/function/datatype constructor binding in place. |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
206 |
All occurrences of @{code} with a single ML block are generated |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
207 |
simultaneously. Provides a generic and safe interface for |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
208 |
instrumentalizing code generation. See HOL/ex/Code_Antiq for a toy |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
209 |
example, or HOL/Complex/ex/ReflectedFerrack for a more ambitious |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
210 |
application. In future you ought refrain from ad-hoc compiling |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
211 |
generated SML code on the ML toplevel. Note that (for technical |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
212 |
reasons) @{code} cannot refer to constants for which user-defined |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
213 |
serializations are set. Refer to the corresponding ML counterpart |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
214 |
directly in that cases. |
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset
|
215 |
|
27424 | 216 |
* Integrated image HOL-Complex with HOL. Entry points Main.thy and |
217 |
Complex_Main.thy remain as they are. |
|
218 |
||
27599 | 219 |
* New image HOL-Plain provides a minimal HOL with the most important |
220 |
tools available (inductive, datatype, primrec, ...). By convention |
|
221 |
the corresponding theory Plain should be ancestor of every further |
|
222 |
(library) theory. Some library theories now have ancestor Plain |
|
223 |
(instead of Main), thus theory Main occasionally has to be imported |
|
224 |
explicitly. |
|
27421 | 225 |
|
28248 | 226 |
* The metis method now fails in the usual manner, rather than raising |
227 |
an exception, if it determines that it cannot prove the theorem. |
|
28233
f14f34194f63
The metis method now fails in the usual manner, rather than raising an exception,
paulson
parents:
28227
diff
changeset
|
228 |
|
28700
fb92b1d1b285
The metis method no longer fails because the theorem is too trivial
paulson
parents:
28685
diff
changeset
|
229 |
* The metis method no longer fails because the theorem is too trivial |
fb92b1d1b285
The metis method no longer fails because the theorem is too trivial
paulson
parents:
28685
diff
changeset
|
230 |
(contains the empty clause). |
fb92b1d1b285
The metis method no longer fails because the theorem is too trivial
paulson
parents:
28685
diff
changeset
|
231 |
|
27324
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset
|
232 |
* Methods "case_tac" and "induct_tac" now refer to the very same rules |
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset
|
233 |
as the structured Isar versions "cases" and "induct", cf. the |
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset
|
234 |
corresponding "cases" and "induct" attributes. Mutual induction rules |
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset
|
235 |
are now presented as a list of individual projections |
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset
|
236 |
(e.g. foo_bar.inducts for types foo and bar); the old format with |
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset
|
237 |
explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in |
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset
|
238 |
rare situations a different rule is selected --- notably nested tuple |
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset
|
239 |
elimination instead of former prod.exhaust: use explicit (case_tac t |
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset
|
240 |
rule: prod.exhaust) here. |
27122 | 241 |
|
27141
9bfcdb1905e1
* Attributes cases, induct, coinduct support del option.
wenzelm
parents:
27122
diff
changeset
|
242 |
* Attributes "cases", "induct", "coinduct" support "del" option. |
9bfcdb1905e1
* Attributes cases, induct, coinduct support del option.
wenzelm
parents:
27122
diff
changeset
|
243 |
|
27122 | 244 |
* Removed fact "case_split_thm", which duplicates "case_split". |
245 |
||
246 |
* Command 'rep_datatype': instead of theorem names the command now |
|
247 |
takes a list of terms denoting the constructors of the type to be |
|
248 |
represented as datatype. The characteristic theorems have to be |
|
249 |
proven. INCOMPATIBILITY. Also observe that the following theorems |
|
250 |
have disappeared in favour of existing ones: |
|
251 |
||
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
252 |
unit_induct ~> unit.induct |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
253 |
prod_induct ~> prod.induct |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
254 |
sum_induct ~> sum.induct |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
255 |
Suc_Suc_eq ~> nat.inject |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
256 |
Suc_not_Zero Zero_not_Suc ~> nat.distinct |
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
257 |
|
27122 | 258 |
* Library/Nat_Infinity: added addition, numeral syntax and more |
259 |
instantiations for algebraic structures. Removed some duplicate |
|
260 |
theorems. Changes in simp rules. INCOMPATIBILITY. |
|
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
261 |
|
28088
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset
|
262 |
* ATP selection (E/Vampire/Spass) is now via Proof General's settings |
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset
|
263 |
menu. |
28067 | 264 |
|
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
265 |
|
27696 | 266 |
*** HOL-Algebra *** |
267 |
||
27713
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset
|
268 |
* New locales for orders and lattices where the equivalence relation |
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset
|
269 |
is not restricted to equality. INCOMPATIBILITY: all order and |
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset
|
270 |
lattice locales use a record structure with field eq for the |
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset
|
271 |
equivalence. |
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset
|
272 |
|
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset
|
273 |
* New theory of factorial domains. |
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset
|
274 |
|
27696 | 275 |
* Units_l_inv and Units_r_inv are now simprules by default. |
276 |
INCOMPATIBILITY. Simplifier proof that require deletion of l_inv |
|
277 |
and/or r_inv will now also require deletion of these lemmas. |
|
278 |
||
279 |
* Renamed the following theorems. INCOMPATIBILITY. |
|
280 |
UpperD ~> Upper_memD |
|
281 |
LowerD ~> Lower_memD |
|
282 |
least_carrier ~> least_closed |
|
283 |
greatest_carrier ~> greatest_closed |
|
284 |
greatest_Lower_above ~> greatest_Lower_below |
|
27717
21bbd410ba04
Generalised polynomial lemmas from cring to ring.
ballarin
parents:
27713
diff
changeset
|
285 |
one_zero ~> carrier_one_zero |
21bbd410ba04
Generalised polynomial lemmas from cring to ring.
ballarin
parents:
27713
diff
changeset
|
286 |
one_not_zero ~> carrier_one_not_zero (collision with assumption) |
27696 | 287 |
|
27793 | 288 |
|
27485 | 289 |
*** HOL-NSA *** |
290 |
||
291 |
* Created new image HOL-NSA, containing theories of nonstandard |
|
292 |
analysis which were previously part of HOL-Complex. Entry point |
|
293 |
Hyperreal.thy remains valid, but theories formerly using |
|
294 |
Complex_Main.thy should now use new entry point Hypercomplex.thy. |
|
295 |
||
296 |
||
27704 | 297 |
*** ZF *** |
298 |
||
299 |
* Proof of Zorn's Lemma for partial orders. |
|
300 |
||
301 |
||
27246
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset
|
302 |
*** ML *** |
28088
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset
|
303 |
|
28294 | 304 |
* Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm |
305 |
to 'a -> thm, while results are always tagged with an authentic oracle |
|
306 |
name. The Isar command 'oracle' is now polymorphic, no argument type |
|
307 |
is specified. INCOMPATIBILITY, need to simplify existing oracle code |
|
308 |
accordingly. Note that extra performance may be gained by producing |
|
309 |
the cterm carefully, avoiding slow Thm.cterm_of. |
|
310 |
||
28282
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset
|
311 |
* ML bindings produced via Isar commands are stored within the Isar |
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset
|
312 |
context (theory or proof). Consequently, commands like 'use' and 'ML' |
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset
|
313 |
become thread-safe and work with undo as expected (concerning |
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset
|
314 |
top-level bindings, not side-effects on global references). |
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset
|
315 |
INCOMPATIBILITY, need to provide proper Isar context when invoking the |
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset
|
316 |
compiler at runtime; really global bindings need to be given outside a |
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset
|
317 |
theory. [Poly/ML 5.2 or later] |
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset
|
318 |
|
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset
|
319 |
* Command 'ML_prf' is analogous to 'ML' but works within a proof |
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset
|
320 |
context. Top-level ML bindings are stored within the proof context in |
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset
|
321 |
a purely sequential fashion, disregarding the nested proof structure. |
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset
|
322 |
ML bindings introduced by 'ML_prf' are discarded at the end of the |
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset
|
323 |
proof. [Poly/ML 5.2 or later] |
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset
|
324 |
|
28099
fb16a07d6580
* Generic Toplevel.add_hook interface allows to analyze the result of
wenzelm
parents:
28089
diff
changeset
|
325 |
* Generic Toplevel.add_hook interface allows to analyze the result of |
28103
b79e61861f0f
simplified Toplevel.add_hook: cover successful transactions only;
wenzelm
parents:
28099
diff
changeset
|
326 |
transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML |
b79e61861f0f
simplified Toplevel.add_hook: cover successful transactions only;
wenzelm
parents:
28099
diff
changeset
|
327 |
for theorem dependency output of transactions resulting in a new |
b79e61861f0f
simplified Toplevel.add_hook: cover successful transactions only;
wenzelm
parents:
28099
diff
changeset
|
328 |
theory state. |
28099
fb16a07d6580
* Generic Toplevel.add_hook interface allows to analyze the result of
wenzelm
parents:
28089
diff
changeset
|
329 |
|
28088
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset
|
330 |
* Name bindings in higher specification mechanisms (notably |
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset
|
331 |
LocalTheory.define, LocalTheory.note, and derived packages) are now |
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset
|
332 |
formalized as type Name.binding, replacing old bstring. |
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset
|
333 |
INCOMPATIBILITY, need to wrap strings via Name.binding function, see |
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset
|
334 |
also Name.name_of. Packages should pass name bindings given by the |
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset
|
335 |
user to underlying specification mechanisms; this enables precise |
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset
|
336 |
tracking of source positions, for example. |
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset
|
337 |
|
28089
66ae1926482a
* Result facts now refer to the *full* internal name;
wenzelm
parents:
28088
diff
changeset
|
338 |
* Result facts (from PureThy.note_thms, ProofContext.note_thms, |
66ae1926482a
* Result facts now refer to the *full* internal name;
wenzelm
parents:
28088
diff
changeset
|
339 |
LocalTheory.note etc.) now refer to the *full* internal name, not the |
66ae1926482a
* Result facts now refer to the *full* internal name;
wenzelm
parents:
28088
diff
changeset
|
340 |
bstring as before. INCOMPATIBILITY, not detected by ML type-checking! |
66ae1926482a
* Result facts now refer to the *full* internal name;
wenzelm
parents:
28088
diff
changeset
|
341 |
|
27246
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset
|
342 |
* Rules and tactics that read instantiations (read_instantiate, |
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset
|
343 |
res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof |
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset
|
344 |
context, which is required for parsing and type-checking. Moreover, |
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset
|
345 |
the variables are specified as plain indexnames, not string encodings |
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset
|
346 |
thereof. INCOMPATIBILITY. |
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset
|
347 |
|
27287 | 348 |
* Disposed old type and term read functions (Sign.read_def_typ, |
349 |
Sign.read_typ, Sign.read_def_terms, Sign.read_term, |
|
350 |
Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should |
|
351 |
use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global, |
|
27269 | 352 |
Syntax.read_term_global etc.; see also OldGoals.read_term as last |
353 |
resort for legacy applications. |
|
354 |
||
27380 | 355 |
* Antiquotations: block-structured compilation context indicated by |
27391 | 356 |
\<lbrace> ... \<rbrace>; additional antiquotation forms: |
357 |
||
27519
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset
|
358 |
@{let ?pat = term} - term abbreviation (HO matching) |
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset
|
359 |
@{note name = fact} - fact abbreviation |
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset
|
360 |
@{thm fact} - singleton fact (with attributes) |
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset
|
361 |
@{thms fact} - general fact (with attributes) |
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset
|
362 |
@{lemma prop by method} - singleton goal |
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset
|
363 |
@{lemma prop by meth1 meth2} - singleton goal |
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset
|
364 |
@{lemma prop1 ... propN by method} - general goal |
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset
|
365 |
@{lemma prop1 ... propN by meth1 meth2} - general goal |
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset
|
366 |
@{lemma (open) ...} - open derivation |
27380 | 367 |
|
27246
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset
|
368 |
|
27979 | 369 |
*** System *** |
370 |
||
28676
78688a5fafc2
multithreading support only for polyml-5.2.1 or later;
wenzelm
parents:
28633
diff
changeset
|
371 |
* Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for |
78688a5fafc2
multithreading support only for polyml-5.2.1 or later;
wenzelm
parents:
28633
diff
changeset
|
372 |
Poly/ML 5.2.1 or later. |
28254
d67ba23e0277
multithreading for Poly/ML 5.1 is no longer supported;
wenzelm
parents:
28252
diff
changeset
|
373 |
|
28248 | 374 |
* The Isabelle "emacs" tool provides a specific interface to invoke |
375 |
Proof General / Emacs, with more explicit failure if that is not |
|
376 |
installed (the old isabelle-interface script silently falls back on |
|
377 |
isabelle-process). The PROOFGENERAL_HOME setting determines the |
|
378 |
installation location of the Proof General distribution. |
|
379 |
||
27979 | 380 |
* Isabelle/lib/classes/Pure.jar provides basic support to integrate |
381 |
the Isabelle process into a JVM/Scala application. See |
|
382 |
Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java |
|
383 |
process wrapper has been discontinued.) |
|
384 |
||
385 |
* Status messages (with exact source position information) are |
|
386 |
emitted, if proper markup print mode is enabled. This allows |
|
387 |
user-interface components to provide detailed feedback on internal |
|
388 |
prover operations. |
|
389 |
||
390 |
* Homegrown Isabelle font with unicode layout, see Isabelle/lib/fonts. |
|
391 |
||
392 |
||
27143 | 393 |
|
27008 | 394 |
New in Isabelle2008 (June 2008) |
395 |
------------------------------- |
|
25464
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset
|
396 |
|
25522 | 397 |
*** General *** |
398 |
||
27061 | 399 |
* The Isabelle/Isar Reference Manual (isar-ref) has been reorganized |
400 |
and updated, with formally checked references as hyperlinks. |
|
401 |
||
25994 | 402 |
* Theory loader: use_thy (and similar operations) no longer set the |
403 |
implicit ML context, which was occasionally hard to predict and in |
|
404 |
conflict with concurrency. INCOMPATIBILITY, use ML within Isar which |
|
405 |
provides a proper context already. |
|
406 |
||
26323
73efc70edeef
theory loader: discontinued *attached* ML scripts;
wenzelm
parents:
26315
diff
changeset
|
407 |
* Theory loader: old-style ML proof scripts being *attached* to a thy |
73efc70edeef
theory loader: discontinued *attached* ML scripts;
wenzelm
parents:
26315
diff
changeset
|
408 |
file are no longer supported. INCOMPATIBILITY, regular 'uses' and |
73efc70edeef
theory loader: discontinued *attached* ML scripts;
wenzelm
parents:
26315
diff
changeset
|
409 |
'use' within a theory file will do the job. |
73efc70edeef
theory loader: discontinued *attached* ML scripts;
wenzelm
parents:
26315
diff
changeset
|
410 |
|
26650 | 411 |
* Name space merge now observes canonical order, i.e. the second space |
412 |
is inserted into the first one, while existing entries in the first |
|
26659 | 413 |
space take precedence. INCOMPATIBILITY in rare situations, may try to |
26650 | 414 |
swap theory imports. |
415 |
||
27067 | 416 |
* Syntax: symbol \<chi> is now considered a letter. Potential |
417 |
INCOMPATIBILITY in identifier syntax etc. |
|
418 |
||
419 |
* Outer syntax: string tokens no longer admit escaped white space, |
|
420 |
which was an accidental (undocumented) feature. INCOMPATIBILITY, use |
|
421 |
white space without escapes. |
|
422 |
||
423 |
* Outer syntax: string tokens may contain arbitrary character codes |
|
424 |
specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for |
|
425 |
"foo_bar". |
|
426 |
||
25522 | 427 |
|
25502 | 428 |
*** Pure *** |
429 |
||
26718 | 430 |
* Context-dependent token translations. Default setup reverts locally |
431 |
fixed variables, and adds hilite markup for undeclared frees. |
|
432 |
||
26681 | 433 |
* Unused theorems can be found using the new command 'unused_thms'. |
434 |
There are three ways of invoking it: |
|
435 |
||
436 |
(1) unused_thms |
|
437 |
Only finds unused theorems in the current theory. |
|
438 |
||
439 |
(2) unused_thms thy_1 ... thy_n - |
|
440 |
Finds unused theorems in the current theory and all of its ancestors, |
|
441 |
excluding the theories thy_1 ... thy_n and all of their ancestors. |
|
442 |
||
443 |
(3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m |
|
444 |
Finds unused theorems in the theories thy'_1 ... thy'_m and all of |
|
445 |
their ancestors, excluding the theories thy_1 ... thy_n and all of |
|
446 |
their ancestors. |
|
447 |
||
26718 | 448 |
In order to increase the readability of the list produced by |
449 |
unused_thms, theorems that have been created by a particular instance |
|
26874 | 450 |
of a theory command such as 'inductive' or 'function' are considered |
451 |
to belong to the same "group", meaning that if at least one theorem in |
|
26718 | 452 |
this group is used, the other theorems in the same group are no longer |
453 |
reported as unused. Moreover, if all theorems in the group are |
|
454 |
unused, only one theorem in the group is displayed. |
|
455 |
||
456 |
Note that proof objects have to be switched on in order for |
|
457 |
unused_thms to work properly (i.e. !proofs must be >= 1, which is |
|
26874 | 458 |
usually the case when using Proof General with the default settings). |
26681 | 459 |
|
26650 | 460 |
* Authentic naming of facts disallows ad-hoc overwriting of previous |
461 |
theorems within the same name space. INCOMPATIBILITY, need to remove |
|
462 |
duplicate fact bindings, or even accidental fact duplications. Note |
|
463 |
that tools may maintain dynamically scoped facts systematically, using |
|
464 |
PureThy.add_thms_dynamic. |
|
465 |
||
26660 | 466 |
* Command 'hide' now allows to hide from "fact" name space as well. |
467 |
||
26496
49ae9456eba9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26495
diff
changeset
|
468 |
* Eliminated destructive theorem database, simpset, claset, and |
49ae9456eba9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26495
diff
changeset
|
469 |
clasimpset. Potential INCOMPATIBILITY, really need to observe linear |
49ae9456eba9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26495
diff
changeset
|
470 |
update of theories within ML code. |
26479 | 471 |
|
26955
ebbaa935eae0
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm
parents:
26925
diff
changeset
|
472 |
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory. |
ebbaa935eae0
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm
parents:
26925
diff
changeset
|
473 |
INCOMPATIBILITY, object-logics depending on former Pure require |
ebbaa935eae0
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm
parents:
26925
diff
changeset
|
474 |
additional setup PureThy.old_appl_syntax_setup; object-logics |
ebbaa935eae0
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm
parents:
26925
diff
changeset
|
475 |
depending on former CPure need to refer to Pure. |
26650 | 476 |
|
26495 | 477 |
* Commands 'use' and 'ML' are now purely functional, operating on |
26479 | 478 |
theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML' |
479 |
instead. Added 'ML_val' as mere diagnostic replacement for 'ML'. |
|
480 |
INCOMPATIBILITY. |
|
481 |
||
26874 | 482 |
* Command 'setup': discontinued implicit version with ML reference. |
26434 | 483 |
|
25970
9053fd546501
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs here;
wenzelm
parents:
25961
diff
changeset
|
484 |
* Instantiation target allows for simultaneous specification of class |
9053fd546501
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs here;
wenzelm
parents:
25961
diff
changeset
|
485 |
instance operations together with an instantiation proof. |
9053fd546501
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs here;
wenzelm
parents:
25961
diff
changeset
|
486 |
Type-checking phase allows to refer to class operations uniformly. |
27067 | 487 |
See src/HOL/Complex/Complex.thy for an Isar example and |
488 |
src/HOL/Library/Eval.thy for an ML example. |
|
25502 | 489 |
|
26201
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset
|
490 |
* Indexing of literal facts: be more serious about including only |
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset
|
491 |
facts from the visible specification/proof context, but not the |
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset
|
492 |
background context (locale etc.). Affects `prop` notation and method |
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset
|
493 |
"fact". INCOMPATIBILITY: need to name facts explicitly in rare |
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset
|
494 |
situations. |
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset
|
495 |
|
26925
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset
|
496 |
* Method "cases", "induct", "coinduct": removed obsolete/undocumented |
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset
|
497 |
"(open)" option, which used to expose internal bound variables to the |
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset
|
498 |
proof text. |
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset
|
499 |
|
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset
|
500 |
* Isar statements: removed obsolete case "rule_context". |
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset
|
501 |
INCOMPATIBILITY, better use explicit fixes/assumes. |
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset
|
502 |
|
26874 | 503 |
* Locale proofs: default proof step now includes 'unfold_locales'; |
504 |
hence 'proof' without argument may be used to unfold locale |
|
505 |
predicates. |
|
26765 | 506 |
|
507 |
||
26762 | 508 |
*** Document preparation *** |
509 |
||
26914 | 510 |
* Simplified pdfsetup.sty: color/hyperref is used unconditionally for |
511 |
both pdf and dvi (hyperlinks usually work in xdvi as well); removed |
|
512 |
obsolete thumbpdf setup (contemporary PDF viewers do this on the |
|
513 |
spot); renamed link color from "darkblue" to "linkcolor" (default |
|
26920 | 514 |
value unchanged, can be redefined via \definecolor); no longer sets |
515 |
"a4paper" option (unnecessary or even intrusive). |
|
26914 | 516 |
|
27008 | 517 |
* Antiquotation @{lemma A method} proves proposition A by the given |
518 |
method (either a method name or a method name plus (optional) method |
|
519 |
arguments in parentheses) and prints A just like @{prop A}. |
|
26762 | 520 |
|
521 |
||
25464
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset
|
522 |
*** HOL *** |
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset
|
523 |
|
27067 | 524 |
* New primrec package. Specification syntax conforms in style to |
525 |
definition/function/.... No separate induction rule is provided. The |
|
526 |
"primrec" command distinguishes old-style and new-style specifications |
|
527 |
by syntax. The former primrec package is now named OldPrimrecPackage. |
|
528 |
When adjusting theories, beware: constants stemming from new-style |
|
529 |
primrec specifications have authentic syntax. |
|
530 |
||
531 |
* Metis prover is now an order of magnitude faster, and also works |
|
532 |
with multithreading. |
|
533 |
||
534 |
* Metis: the maximum number of clauses that can be produced from a |
|
535 |
theorem is now given by the attribute max_clauses. Theorems that |
|
536 |
exceed this number are ignored, with a warning printed. |
|
537 |
||
538 |
* Sledgehammer no longer produces structured proofs by default. To |
|
539 |
enable, declare [[sledgehammer_full = true]]. Attributes |
|
540 |
reconstruction_modulus, reconstruction_sorts renamed |
|
541 |
sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY. |
|
542 |
||
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset
|
543 |
* Method "induct_scheme" derives user-specified induction rules |
27067 | 544 |
from well-founded induction and completeness of patterns. This factors |
545 |
out some operations that are done internally by the function package |
|
546 |
and makes them available separately. See |
|
547 |
src/HOL/ex/Induction_Scheme.thy for examples. |
|
548 |
||
549 |
* More flexible generation of measure functions for termination |
|
550 |
proofs: Measure functions can be declared by proving a rule of the |
|
551 |
form "is_measure f" and giving it the [measure_function] attribute. |
|
552 |
The "is_measure" predicate is logically meaningless (always true), and |
|
553 |
just guides the heuristic. To find suitable measure functions, the |
|
554 |
termination prover sets up the goal "is_measure ?f" of the appropriate |
|
555 |
type and generates all solutions by prolog-style backwards proof using |
|
556 |
the declared rules. |
|
557 |
||
558 |
This setup also deals with rules like |
|
559 |
||
560 |
"is_measure f ==> is_measure (list_size f)" |
|
561 |
||
562 |
which accommodates nested datatypes that recurse through lists. |
|
563 |
Similar rules are predeclared for products and option types. |
|
564 |
||
26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
565 |
* Turned the type of sets "'a set" into an abbreviation for "'a => bool" |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
566 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
567 |
INCOMPATIBILITIES: |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
568 |
|
27008 | 569 |
- Definitions of overloaded constants on sets have to be replaced by |
570 |
definitions on => and bool. |
|
26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
571 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
572 |
- Some definitions of overloaded operators on sets can now be proved |
27008 | 573 |
using the definitions of the operators on => and bool. Therefore, |
574 |
the following theorems have been renamed: |
|
26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
575 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
576 |
subset_def -> subset_eq |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
577 |
psubset_def -> psubset_eq |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
578 |
set_diff_def -> set_diff_eq |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
579 |
Compl_def -> Compl_eq |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
580 |
Sup_set_def -> Sup_set_eq |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
581 |
Inf_set_def -> Inf_set_eq |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
582 |
sup_set_def -> sup_set_eq |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
583 |
inf_set_def -> inf_set_eq |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
584 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
585 |
- Due to the incompleteness of the HO unification algorithm, some |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
586 |
rules such as subst may require manual instantiation, if some of |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
587 |
the unknowns in the rule is a set. |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
588 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
589 |
- Higher order unification and forward proofs: |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
590 |
The proof pattern |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
591 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
592 |
have "P (S::'a set)" <...> |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
593 |
then have "EX S. P S" .. |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
594 |
|
27008 | 595 |
no longer works (due to the incompleteness of the HO unification |
596 |
algorithm) and must be replaced by the pattern |
|
26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
597 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
598 |
have "EX S. P S" |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
599 |
proof |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
600 |
show "P S" <...> |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
601 |
qed |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
602 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
603 |
- Calculational reasoning with subst (or similar rules): |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
604 |
The proof pattern |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
605 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
606 |
have "P (S::'a set)" <...> |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
607 |
also have "S = T" <...> |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
608 |
finally have "P T" . |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
609 |
|
27008 | 610 |
no longer works (for similar reasons as the previous example) and |
611 |
must be replaced by something like |
|
26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
612 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
613 |
have "P (S::'a set)" <...> |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
614 |
moreover have "S = T" <...> |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
615 |
ultimately have "P T" by simp |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
616 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
617 |
- Tactics or packages written in ML code: |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
618 |
Code performing pattern matching on types via |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
619 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
620 |
Type ("set", [T]) => ... |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
621 |
|
27008 | 622 |
must be rewritten. Moreover, functions like strip_type or |
623 |
binder_types no longer return the right value when applied to a |
|
624 |
type of the form |
|
26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
625 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
626 |
T1 => ... => Tn => U => bool |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
627 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
628 |
rather than |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
629 |
|
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
630 |
T1 => ... => Tn => U set |
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset
|
631 |
|
26874 | 632 |
* Merged theories Wellfounded_Recursion, Accessible_Part and |
27067 | 633 |
Wellfounded_Relations to theory Wellfounded. |
26748
4d51ddd6aa5c
Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
26724
diff
changeset
|
634 |
|
26513 | 635 |
* Explicit class "eq" for executable equality. INCOMPATIBILITY. |
636 |
||
26874 | 637 |
* Class finite no longer treats UNIV as class parameter. Use class |
638 |
enum from theory Library/Enum instead to achieve a similar effect. |
|
26445 | 639 |
INCOMPATIBILITY. |
640 |
||
26874 | 641 |
* Theory List: rule list_induct2 now has explicitly named cases "Nil" |
642 |
and "Cons". INCOMPATIBILITY. |
|
643 |
||
26422
d5883907c514
HOL (and FOL): renamed variables in rules imp_elim and swap;
wenzelm
parents:
26401
diff
changeset
|
644 |
* HOL (and FOL): renamed variables in rules imp_elim and swap. |
d5883907c514
HOL (and FOL): renamed variables in rules imp_elim and swap;
wenzelm
parents:
26401
diff
changeset
|
645 |
Potential INCOMPATIBILITY. |
d5883907c514
HOL (and FOL): renamed variables in rules imp_elim and swap;
wenzelm
parents:
26401
diff
changeset
|
646 |
|
26874 | 647 |
* Theory Product_Type: duplicated lemmas split_Pair_apply and |
648 |
injective_fst_snd removed, use split_eta and prod_eqI instead. |
|
649 |
Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY. |
|
26355 | 650 |
|
26335
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
651 |
* Theory Nat: removed redundant lemmas that merely duplicate lemmas of |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
652 |
the same name in theory Orderings: |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
653 |
|
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
654 |
less_trans |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
655 |
less_linear |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
656 |
le_imp_less_or_eq |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
657 |
le_less_trans |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
658 |
less_le_trans |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
659 |
less_not_sym |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
660 |
less_asym |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
661 |
|
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
662 |
Renamed less_imp_le to less_imp_le_nat, and less_irrefl to |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
663 |
less_irrefl_nat. Potential INCOMPATIBILITY due to more general types |
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset
|
664 |
and different variable names. |
26315
cb3badaa192e
removed redundant less_trans, less_linear, le_imp_less_or_eq, le_less_trans, less_le_trans (cf. Orderings.thy);
wenzelm
parents:
26231
diff
changeset
|
665 |
|
26231 | 666 |
* Library/Option_ord.thy: Canonical order on option type. |
667 |
||
27008 | 668 |
* Library/RBT.thy: Red-black trees, an efficient implementation of |
669 |
finite maps. |
|
26197 | 670 |
|
26231 | 671 |
* Library/Countable.thy: Type class for countable types. |
672 |
||
26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
673 |
* Theory Int: The representation of numerals has changed. The infix |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
674 |
operator BIT and the bit datatype with constructors B0 and B1 have |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
675 |
disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
676 |
place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
677 |
involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1" |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
678 |
accordingly. |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
679 |
|
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
680 |
* Theory Nat: definition of <= and < on natural numbers no longer |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
681 |
depend on well-founded relations. INCOMPATIBILITY. Definitions |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
682 |
le_def and less_def have disappeared. Consider lemmas not_less |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
683 |
[symmetric, where ?'a = nat] and less_eq [symmetric] instead. |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
684 |
|
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
685 |
* Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
686 |
(whose purpose mainly is for various fold_set functionals) have been |
26874 | 687 |
abandoned in favor of the existing algebraic classes |
26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
688 |
ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult, |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
689 |
lower_semilattice (resp. upper_semilattice) and linorder. |
26139 | 690 |
INCOMPATIBILITY. |
26041
c2e15e65165f
locales ACf, ACIf, ACIfSL and ACIfSLlin have been abandoned in favour of the existing algebraic classes ab_semigroup_mult, ab_semigroup_idem_mult, lower_semilattice (resp. uper_semilattice) and linorder
haftmann
parents:
26013
diff
changeset
|
691 |
|
26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
692 |
* Theory Transitive_Closure: induct and cases rules now declare proper |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
693 |
case_names ("base" and "step"). INCOMPATIBILITY. |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
694 |
|
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
695 |
* Theorem Inductive.lfp_ordinal_induct generalized to complete |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
696 |
lattices. The form set-specific version is available as |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
697 |
Inductive.lfp_ordinal_induct_set. |
26013
8764a1f1253b
Theorem Inductive.lfp_ordinal_induct generalized to complete lattices
haftmann
parents:
26006
diff
changeset
|
698 |
|
26874 | 699 |
* Renamed theorems "power.simps" to "power_int.simps". |
27067 | 700 |
INCOMPATIBILITY. |
25961 | 701 |
|
26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
702 |
* Class semiring_div provides basic abstract properties of semirings |
25942 | 703 |
with division and modulo operations. Subsumes former class dvd_mod. |
704 |
||
26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
705 |
* Merged theories IntDef, Numeral and IntArith into unified theory |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
706 |
Int. INCOMPATIBILITY. |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
707 |
|
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
708 |
* Theory Library/Code_Index: type "index" now represents natural |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
709 |
numbers rather than integers. INCOMPATIBILITY. |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
710 |
|
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
711 |
* New class "uminus" with operation "uminus" (split of from class |
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset
|
712 |
"minus" which now only has operation "minus", binary). |
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25900
diff
changeset
|
713 |
INCOMPATIBILITY. |
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25900
diff
changeset
|
714 |
|
25522 | 715 |
* Constants "card", "internal_split", "option_map" now with authentic |
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25900
diff
changeset
|
716 |
syntax. INCOMPATIBILITY. |
25522 | 717 |
|
718 |
* Definitions subset_def, psubset_def, set_diff_def, Compl_def, |
|
719 |
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def, |
|
720 |
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def, |
|
721 |
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def, |
|
722 |
Sup_set_def, le_def, less_def, option_map_def now with object |
|
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25900
diff
changeset
|
723 |
equality. INCOMPATIBILITY. |
25464
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset
|
724 |
|
25705 | 725 |
* Records. Removed K_record, and replaced it by pure lambda term |
25726
9728f319ffc6
* Metis prover an order of magnitude faster, works with multithreading.
wenzelm
parents:
25712
diff
changeset
|
726 |
%x. c. The simplifier setup is now more robust against eta expansion. |
25705 | 727 |
INCOMPATIBILITY: in cases explicitly referring to K_record. |
25464
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset
|
728 |
|
27067 | 729 |
* Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}. |
730 |
||
731 |
* Library/ListVector: new theory of arithmetic vector operations. |
|
732 |
||
733 |
* Library/Order_Relation: new theory of various orderings as sets of |
|
734 |
pairs. Defines preorders, partial orders, linear orders and |
|
735 |
well-orders on sets and on types. |
|
26877 | 736 |
|
25726
9728f319ffc6
* Metis prover an order of magnitude faster, works with multithreading.
wenzelm
parents:
25712
diff
changeset
|
737 |
|
26197 | 738 |
*** ZF *** |
739 |
||
26874 | 740 |
* Renamed some theories to allow to loading both ZF and HOL in the |
741 |
same session: |
|
742 |
||
743 |
Datatype -> Datatype_ZF |
|
744 |
Inductive -> Inductive_ZF |
|
745 |
Int -> Int_ZF |
|
746 |
IntDiv -> IntDiv_ZF |
|
747 |
Nat -> Nat_ZF |
|
748 |
List -> List_ZF |
|
749 |
Main -> Main_ZF |
|
750 |
||
751 |
INCOMPATIBILITY: ZF theories that import individual theories below |
|
752 |
Main might need to be adapted. Regular theory Main is still |
|
753 |
available, as trivial extension of Main_ZF. |
|
26197 | 754 |
|
755 |
||
25737
84c92fc48e36
``print mode'' is now a thread-local value derived from a global template;
wenzelm
parents:
25726
diff
changeset
|
756 |
*** ML *** |
84c92fc48e36
``print mode'' is now a thread-local value derived from a global template;
wenzelm
parents:
25726
diff
changeset
|
757 |
|
27067 | 758 |
* ML within Isar: antiquotation @{const name} or @{const |
759 |
name(typargs)} produces statically-checked Const term. |
|
760 |
||
26401
e7a94081dce7
Functor NamedThmsFun: data is available to the user as dynamic fact;
wenzelm
parents:
26387
diff
changeset
|
761 |
* Functor NamedThmsFun: data is available to the user as dynamic fact |
26724
ff6ff3a9010e
NamedThmsFun: removed obsolete print command -- facts are accesible via dynamic name;
wenzelm
parents:
26718
diff
changeset
|
762 |
(of the same name). Removed obsolete print command. |
26401
e7a94081dce7
Functor NamedThmsFun: data is available to the user as dynamic fact;
wenzelm
parents:
26387
diff
changeset
|
763 |
|
27067 | 764 |
* Removed obsolete "use_legacy_bindings" function. |
26188 | 765 |
|
25737
84c92fc48e36
``print mode'' is now a thread-local value derived from a global template;
wenzelm
parents:
25726
diff
changeset
|
766 |
* The ``print mode'' is now a thread-local value derived from a global |
84c92fc48e36
``print mode'' is now a thread-local value derived from a global template;
wenzelm
parents:
25726
diff
changeset
|
767 |
template (the former print_mode reference), thus access becomes |
84c92fc48e36
``print mode'' is now a thread-local value derived from a global template;
wenzelm
parents:
25726
diff
changeset
|
768 |
non-critical. The global print_mode reference is for session |
84c92fc48e36
``print mode'' is now a thread-local value derived from a global template;
wenzelm
parents:
25726
diff
changeset
|
769 |
management only; user-code should use print_mode_value, |
84c92fc48e36
``print mode'' is now a thread-local value derived from a global template;
wenzelm
parents:
25726
diff
changeset
|
770 |
print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY. |
84c92fc48e36
``print mode'' is now a thread-local value derived from a global template;
wenzelm
parents:
25726
diff
changeset
|
771 |
|
26874 | 772 |
* Functions system/system_out provide a robust way to invoke external |
27008 | 773 |
shell commands, with propagation of interrupts (requires Poly/ML 5.2). |
26874 | 774 |
Do not use OS.Process.system etc. from the basis library! |
26222
edf6473ac9e9
* system/system_out provides a robust way to invoke external shell
wenzelm
parents:
26218
diff
changeset
|
775 |
|
25737
84c92fc48e36
``print mode'' is now a thread-local value derived from a global template;
wenzelm
parents:
25726
diff
changeset
|
776 |
|
25626
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset
|
777 |
*** System *** |
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset
|
778 |
|
25971 | 779 |
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs --- |
780 |
in accordance with Proof General 3.7, which prefers GNU emacs. |
|
25970
9053fd546501
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs here;
wenzelm
parents:
25961
diff
changeset
|
781 |
|
25626
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset
|
782 |
* isatool tty runs Isabelle process with plain tty interaction; |
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset
|
783 |
optional line editor may be specified via ISABELLE_LINE_EDITOR |
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset
|
784 |
setting, the default settings attempt to locate "ledit" and "rlwrap". |
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset
|
785 |
|
25651 | 786 |
* isatool browser now works with Cygwin as well, using general |
787 |
"javapath" function defined in Isabelle process environment. |
|
788 |
||
27067 | 789 |
* YXML notation provides a simple and efficient alternative to |
790 |
standard XML transfer syntax. See src/Pure/General/yxml.ML and |
|
791 |
isatool yxml as described in the Isabelle system manual. |
|
25651 | 792 |
|
25652 | 793 |
* JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes) |
25651 | 794 |
provides general wrapper for managing an Isabelle process in a robust |
795 |
fashion, with ``cooked'' output from stdin/stderr. |
|
796 |
||
25855 | 797 |
* Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit), |
798 |
based on Isabelle/JVM process wrapper (see Isabelle/lib/classes). |
|
799 |
||
27067 | 800 |
* Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented |
801 |
way of changing the user's settings is via |
|
802 |
ISABELLE_HOME_USER/etc/settings, which is a fully featured bash |
|
803 |
script. |
|
804 |
||
805 |
* Multithreading.max_threads := 0 refers to the number of actual CPU |
|
806 |
cores of the underlying machine, which is a good starting point for |
|
807 |
optimal performance tuning. The corresponding usedir option -M allows |
|
808 |
"max" as an alias for "0". WARNING: does not work on certain versions |
|
809 |
of Mac OS (with Poly/ML 5.1). |
|
810 |
||
811 |
* isabelle-process: non-ML sessions are run with "nice", to reduce the |
|
812 |
adverse effect of Isabelle flooding interactive front-ends (notably |
|
813 |
ProofGeneral / XEmacs). |
|
814 |
||
25626
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset
|
815 |
|
25464
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset
|
816 |
|
25429 | 817 |
New in Isabelle2007 (November 2007) |
818 |
----------------------------------- |
|
17754
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset
|
819 |
|
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset
|
820 |
*** General *** |
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset
|
821 |
|
22826 | 822 |
* More uniform information about legacy features, notably a |
823 |
warning/error of "Legacy feature: ...", depending on the state of the |
|
23367 | 824 |
tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY: |
825 |
legacy features will disappear eventually. |
|
22826 | 826 |
|
17918
93e26302733e
* Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset
|
827 |
* Theory syntax: the header format ``theory A = B + C:'' has been |
93e26302733e
* Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset
|
828 |
discontinued in favour of ``theory A imports B C begin''. Use isatool |
93e26302733e
* Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset
|
829 |
fixheaders to convert existing theory files. INCOMPATIBILITY. |
93e26302733e
* Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset
|
830 |
|
93e26302733e
* Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset
|
831 |
* Theory syntax: the old non-Isar theory file format has been |
93e26302733e
* Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset
|
832 |
discontinued altogether. Note that ML proof scripts may still be used |
93e26302733e
* Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset
|
833 |
with Isar theories; migration is usually quite simple with the ML |
93e26302733e
* Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset
|
834 |
function use_legacy_bindings. INCOMPATIBILITY. |
93e26302733e
* Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset
|
835 |
|
22871 | 836 |
* Theory syntax: some popular names (e.g. 'class', 'declaration', |
837 |
'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double |
|
838 |
quotes. |
|
19814
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset
|
839 |
|
23888
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset
|
840 |
* Theory loader: be more serious about observing the static theory |
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset
|
841 |
header specifications (including optional directories), but not the |
24172
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
842 |
accidental file locations of previously successful loads. The strict |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
843 |
update policy of former update_thy is now already performed by |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
844 |
use_thy, so the former has been removed; use_thys updates several |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
845 |
theories simultaneously, just as 'imports' within a theory header |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
846 |
specification, but without merging the results. Potential |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
847 |
INCOMPATIBILITY: may need to refine theory headers and commands |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
848 |
ROOT.ML which depend on load order. |
23888
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset
|
849 |
|
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset
|
850 |
* Theory loader: optional support for content-based file |
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset
|
851 |
identification, instead of the traditional scheme of full physical |
23889 | 852 |
path plus date stamp; configured by the ISABELLE_FILE_IDENT setting |
23888
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset
|
853 |
(cf. the system manual). The new scheme allows to work with |
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset
|
854 |
non-finished theories in persistent session images, such that source |
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset
|
855 |
files may be moved later on without requiring reloads. |
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset
|
856 |
|
24187
8bdf5ca5871f
* Theory loader: old-style ML proof scripts are considered a legacy feature;
wenzelm
parents:
24172
diff
changeset
|
857 |
* Theory loader: old-style ML proof scripts being *attached* to a thy |
8bdf5ca5871f
* Theory loader: old-style ML proof scripts are considered a legacy feature;
wenzelm
parents:
24172
diff
changeset
|
858 |
file (with the same base name as the theory) are considered a legacy |
24800 | 859 |
feature, which will disappear eventually. Even now, the theory loader |
860 |
no longer maintains dependencies on such files. |
|
861 |
||
862 |
* Syntax: the scope for resolving ambiguities via type-inference is |
|
863 |
now limited to individual terms, instead of whole simultaneous |
|
24234
4714e04fb8e9
* Syntax: scope for resolving ambiguities via type-inference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset
|
864 |
specifications as before. This greatly reduces the complexity of the |
4714e04fb8e9
* Syntax: scope for resolving ambiguities via type-inference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset
|
865 |
syntax module and improves flexibility by separating parsing and |
4714e04fb8e9
* Syntax: scope for resolving ambiguities via type-inference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset
|
866 |
type-checking. INCOMPATIBILITY: additional type-constraints (explicit |
4714e04fb8e9
* Syntax: scope for resolving ambiguities via type-inference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset
|
867 |
'fixes' etc.) are required in rare situations. |
4714e04fb8e9
* Syntax: scope for resolving ambiguities via type-inference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset
|
868 |
|
25034 | 869 |
* Syntax: constants introduced by new-style packages ('definition', |
870 |
'abbreviation' etc.) are passed through the syntax module in |
|
871 |
``authentic mode''. This means that associated mixfix annotations |
|
872 |
really stick to such constants, independently of potential name space |
|
873 |
ambiguities introduced later on. INCOMPATIBILITY: constants in parse |
|
874 |
trees are represented slightly differently, may need to adapt syntax |
|
875 |
translations accordingly. Use CONST marker in 'translations' and |
|
876 |
@{const_syntax} antiquotation in 'parse_translation' etc. |
|
877 |
||
17981
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset
|
878 |
* Legacy goal package: reduced interface to the bare minimum required |
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset
|
879 |
to keep existing proof scripts running. Most other user-level |
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset
|
880 |
functions are now part of the OldGoals structure, which is *not* open |
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset
|
881 |
by default (consider isatool expandshort before open OldGoals). |
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset
|
882 |
Removed top_sg, prin, printyp, pprint_term/typ altogether, because |
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset
|
883 |
these tend to cause confusion about the actual goal (!) context being |
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset
|
884 |
used here, which is not necessarily the same as the_context(). |
17918
93e26302733e
* Theory syntax: discontinued non-Isar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset
|
885 |
|
23379
d0e3f790bd73
updated 'find_theorems' -- moved ProofGeneral specifics to ProofGeneral/CHANGES;
wenzelm
parents:
23377
diff
changeset
|
886 |
* Command 'find_theorems': supports "*" wild-card in "name:" |
d0e3f790bd73
updated 'find_theorems' -- moved ProofGeneral specifics to ProofGeneral/CHANGES;
wenzelm
parents:
23377
diff
changeset
|
887 |
criterion; "with_dups" option. Certain ProofGeneral versions might |
d0e3f790bd73
updated 'find_theorems' -- moved ProofGeneral specifics to ProofGeneral/CHANGES;
wenzelm
parents:
23377
diff
changeset
|
888 |
support a specific search form (see ProofGeneral/CHANGES). |
22965 | 889 |
|
20370 | 890 |
* The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1 |
891 |
by default, which means that "prems" (and also "fixed variables") are |
|
892 |
suppressed from proof state output. Note that the ProofGeneral |
|
893 |
settings mechanism allows to change and save options persistently, but |
|
894 |
older versions of Isabelle will fail to start up if a negative prems |
|
895 |
limit is imposed. |
|
896 |
||
21308
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset
|
897 |
* Local theory targets may be specified by non-nested blocks of |
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset
|
898 |
``context/locale/class ... begin'' followed by ``end''. The body may |
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset
|
899 |
contain definitions, theorems etc., including any derived mechanism |
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset
|
900 |
that has been implemented on top of these primitives. This concept |
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset
|
901 |
generalizes the existing ``theorem (in ...)'' towards more versatility |
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset
|
902 |
and scalability. |
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset
|
903 |
|
21960
0574f192b78a
* Proof General: proper undo of final 'end'; discontinued Isabelle/classic;
wenzelm
parents:
21896
diff
changeset
|
904 |
* Proof General interface: proper undo of final 'end' command; |
0574f192b78a
* Proof General: proper undo of final 'end'; discontinued Isabelle/classic;
wenzelm
parents:
21896
diff
changeset
|
905 |
discontinued Isabelle/classic mode (ML proof scripts). |
0574f192b78a
* Proof General: proper undo of final 'end'; discontinued Isabelle/classic;
wenzelm
parents:
21896
diff
changeset
|
906 |
|
17754
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset
|
907 |
|
17865 | 908 |
*** Document preparation *** |
909 |
||
21717 | 910 |
* Added antiquotation @{theory name} which prints the given name, |
911 |
after checking that it refers to a valid ancestor theory in the |
|
912 |
current context. |
|
21339 | 913 |
|
17869 | 914 |
* Added antiquotations @{ML_type text} and @{ML_struct text} which |
915 |
check the given source text as ML type/structure, printing verbatim. |
|
17865 | 916 |
|
21717 | 917 |
* Added antiquotation @{abbrev "c args"} which prints the abbreviation |
918 |
"c args == rhs" given in the current context. (Any number of |
|
21735 | 919 |
arguments may be given on the LHS.) |
21717 | 920 |
|
921 |
||
17779 | 922 |
*** Pure *** |
923 |
||
24800 | 924 |
* The 'class' package offers a combination of axclass and locale to |
25129 | 925 |
achieve Haskell-like type classes in Isabelle. Definitions and |
926 |
theorems within a class context produce both relative results (with |
|
927 |
implicit parameters according to the locale context), and polymorphic |
|
928 |
constants with qualified polymorphism (according to the class |
|
929 |
context). Within the body context of a 'class' target, a separate |
|
930 |
syntax layer ("user space type system") takes care of converting |
|
931 |
between global polymorphic consts and internal locale representation. |
|
25177 | 932 |
See src/HOL/ex/Classpackage.thy for examples (as well as main HOL). |
25184 | 933 |
"isatool doc classes" provides a tutorial. |
20807 | 934 |
|
25199 | 935 |
* Generic code generator framework allows to generate executable |
24800 | 936 |
code for ML and Haskell (including Isabelle classes). A short usage |
937 |
sketch: |
|
20188
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset
|
938 |
|
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset
|
939 |
internal compilation: |
25199 | 940 |
export_code <list of constants (term syntax)> in SML |
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
941 |
writing SML code to a file: |
25199 | 942 |
export_code <list of constants (term syntax)> in SML <filename> |
22735 | 943 |
writing OCaml code to a file: |
25199 | 944 |
export_code <list of constants (term syntax)> in OCaml <filename> |
20188
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset
|
945 |
writing Haskell code to a bunch of files: |
25199 | 946 |
export_code <list of constants (term syntax)> in Haskell <filename> |
947 |
||
948 |
evaluating closed propositions to True/False using code generation: |
|
25184 | 949 |
method ``eval'' |
950 |
||
951 |
Reasonable default setup of framework in HOL. |
|
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
952 |
|
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
953 |
Theorem attributs for selecting and transforming function equations theorems: |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
954 |
|
22845 | 955 |
[code fun]: select a theorem as function equation for a specific constant |
956 |
[code fun del]: deselect a theorem as function equation for a specific constant |
|
957 |
[code inline]: select an equation theorem for unfolding (inlining) in place |
|
958 |
[code inline del]: deselect an equation theorem for unfolding (inlining) in place |
|
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
959 |
|
22735 | 960 |
User-defined serializations (target in {SML, OCaml, Haskell}): |
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
961 |
|
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
962 |
code_const <and-list of constants (term syntax)> |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
963 |
{(target) <and-list of const target syntax>}+ |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
964 |
|
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
965 |
code_type <and-list of type constructors> |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
966 |
{(target) <and-list of type target syntax>}+ |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
967 |
|
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
968 |
code_instance <and-list of instances> |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
969 |
{(target)}+ |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
970 |
where instance ::= <type constructor> :: <class> |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
971 |
|
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
972 |
code_class <and_list of classes> |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
973 |
{(target) <and-list of class target syntax>}+ |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
974 |
where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}? |
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset
|
975 |
|
25199 | 976 |
code_instance and code_class only are effective to target Haskell. |
22735 | 977 |
|
25177 | 978 |
For example usage see src/HOL/ex/Codegenerator.thy and |
979 |
src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code |
|
24800 | 980 |
generation from Isabelle/HOL theories is available via "isatool doc |
981 |
codegen". |
|
20188
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset
|
982 |
|
25129 | 983 |
* Code generator: consts in 'consts_code' Isar commands are now |
984 |
referred to by usual term syntax (including optional type |
|
985 |
annotations). |
|
986 |
||
19254 | 987 |
* Command 'no_translations' removes translation rules from theory |
988 |
syntax. |
|
989 |
||
19625
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset
|
990 |
* Overloaded definitions are now actually checked for acyclic |
19714 | 991 |
dependencies. The overloading scheme is slightly more general than |
992 |
that of Haskell98, although Isabelle does not demand an exact |
|
993 |
correspondence to type class and instance declarations. |
|
994 |
INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more |
|
995 |
exotic versions of overloading -- at the discretion of the user! |
|
19711 | 996 |
|
997 |
Polymorphic constants are represented via type arguments, i.e. the |
|
998 |
instantiation that matches an instance against the most general |
|
999 |
declaration given in the signature. For example, with the declaration |
|
1000 |
c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented |
|
1001 |
as c(nat). Overloading is essentially simultaneous structural |
|
1002 |
recursion over such type arguments. Incomplete specification patterns |
|
19714 | 1003 |
impose global constraints on all occurrences, e.g. c('a * 'a) on the |
19715 | 1004 |
LHS means that more general c('a * 'b) will be disallowed on any RHS. |
19714 | 1005 |
Command 'print_theory' outputs the normalized system of recursive |
1006 |
equations, see section "definitions". |
|
19625
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset
|
1007 |
|
24086 | 1008 |
* Configuration options are maintained within the theory or proof |
1009 |
context (with name and type bool/int/string), providing a very simple |
|
1010 |
interface to a poor-man's version of general context data. Tools may |
|
24110
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
1011 |
declare options in ML (e.g. using Attrib.config_int) and then refer to |
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
1012 |
these values using Config.get etc. Users may change options via an |
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
1013 |
associated attribute of the same name. This form of context |
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
1014 |
declaration works particularly well with commands 'declare' or |
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
1015 |
'using', for example ``declare [[foo = 42]]''. Thus it has become |
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
1016 |
very easy to avoid global references, which would not observe Isar |
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
1017 |
toplevel undo/redo and fail to work with multithreading. |
24086 | 1018 |
|
24172
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
1019 |
Various global ML references of Pure and HOL have been turned into |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
1020 |
configuration options: |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
1021 |
|
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
1022 |
Unify.search_bound unify_search_bound |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
1023 |
Unify.trace_bound unify_trace_bound |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
1024 |
Unify.trace_simp unify_trace_simp |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
1025 |
Unify.trace_types unify_trace_types |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
1026 |
Simplifier.simp_depth_limit simp_depth_limit |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
1027 |
Blast.depth_limit blast_depth_limit |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
1028 |
DatatypeProp.dtK datatype_distinctness_limit |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
1029 |
fast_arith_neq_limit fast_arith_neq_limit |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
1030 |
fast_arith_split_limit fast_arith_split_limit |
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset
|
1031 |
|
24086 | 1032 |
* Named collections of theorems may be easily installed as context |
24800 | 1033 |
data using the functor NamedThmsFun (see also |
24086 | 1034 |
src/Pure/Tools/named_thms.ML). The user may add or delete facts via |
24110
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
1035 |
attributes; there is also a toplevel print command. This facility is |
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
1036 |
just a common case of general context data, which is the preferred way |
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
1037 |
for anything more complex than just a list of facts in canonical |
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset
|
1038 |
order. |
24086 | 1039 |
|
24032 | 1040 |
* Isar: command 'declaration' augments a local theory by generic |
1041 |
declaration functions written in ML. This enables arbitrary content |
|
1042 |
being added to the context, depending on a morphism that tells the |
|
1043 |
difference of the original declaration context wrt. the application |
|
1044 |
context encountered later on. |
|
1045 |
||
1046 |
* Isar: proper interfaces for simplification procedures. Command |
|
1047 |
'simproc_setup' declares named simprocs (with match patterns, and body |
|
1048 |
text in ML). Attribute "simproc" adds/deletes simprocs in the current |
|
1049 |
context. ML antiquotation @{simproc name} retrieves named simprocs. |
|
1050 |
||
1051 |
* Isar: an extra pair of brackets around attribute declarations |
|
1052 |
abbreviates a theorem reference involving an internal dummy fact, |
|
1053 |
which will be ignored later --- only the effect of the attribute on |
|
1054 |
the background context will persist. This form of in-place |
|
1055 |
declarations is particularly useful with commands like 'declare' and |
|
1056 |
'using', for example ``have A using [[simproc a]] by simp''. |
|
1057 |
||
23369
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
1058 |
* Isar: method "assumption" (and implicit closing of subproofs) now |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
1059 |
takes simple non-atomic goal assumptions into account: after applying |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
1060 |
an assumption as a rule the resulting subgoals are solved by atomic |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
1061 |
assumption steps. This is particularly useful to finish 'obtain' |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
1062 |
goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis", |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
1063 |
without referring to the original premise "!!x. P x ==> thesis" in the |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
1064 |
Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
1065 |
more permissive. |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
1066 |
|
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
1067 |
* Isar: implicit use of prems from the Isar proof context is |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
1068 |
considered a legacy feature. Common applications like ``have A .'' |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
1069 |
may be replaced by ``have A by fact'' or ``note `A`''. In general, |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
1070 |
referencing facts explicitly here improves readability and |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
1071 |
maintainability of proof texts. |
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset
|
1072 |
|
17865 | 1073 |
* Isar: improper proof element 'guess' is like 'obtain', but derives |
1074 |
the obtained context from the course of reasoning! For example: |
|
1075 |
||
1076 |
assume "EX x y. A x & B y" -- "any previous fact" |
|
1077 |
then guess x and y by clarify |
|
1078 |
||
1079 |
This technique is potentially adventurous, depending on the facts and |
|
1080 |
proof tools being involved here. |
|
1081 |
||
18020 | 1082 |
* Isar: known facts from the proof context may be specified as literal |
1083 |
propositions, using ASCII back-quote syntax. This works wherever |
|
1084 |
named facts used to be allowed so far, in proof commands, proof |
|
1085 |
methods, attributes etc. Literal facts are retrieved from the context |
|
1086 |
according to unification of type and term parameters. For example, |
|
1087 |
provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known |
|
1088 |
theorems in the current context, then these are valid literal facts: |
|
1089 |
`A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc. |
|
1090 |
||
1091 |
There is also a proof method "fact" which does the same composition |
|
18044 | 1092 |
for explicit goal states, e.g. the following proof texts coincide with |
1093 |
certain special cases of literal facts: |
|
18020 | 1094 |
|
1095 |
have "A" by fact == note `A` |
|
1096 |
have "A ==> B" by fact == note `A ==> B` |
|
1097 |
have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x` |
|
1098 |
have "P a ==> Q a" by fact == note `P a ==> Q a` |
|
1099 |
||
20118
0c1ec587a5a8
* Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents:
20090
diff
changeset
|
1100 |
* Isar: ":" (colon) is no longer a symbolic identifier character in |
0c1ec587a5a8
* Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents:
20090
diff
changeset
|
1101 |
outer syntax. Thus symbolic identifiers may be used without |
0c1ec587a5a8
* Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents:
20090
diff
changeset
|
1102 |
additional white space in declarations like this: ``assume *: A''. |
0c1ec587a5a8
* Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents:
20090
diff
changeset
|
1103 |
|
20013 | 1104 |
* Isar: 'print_facts' prints all local facts of the current context, |
1105 |
both named and unnamed ones. |
|
1106 |
||
18308 | 1107 |
* Isar: 'def' now admits simultaneous definitions, e.g.: |
1108 |
||
1109 |
def x == "t" and y == "u" |
|
1110 |
||
18540 | 1111 |
* Isar: added command 'unfolding', which is structurally similar to |
1112 |
'using', but affects both the goal state and facts by unfolding given |
|
18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
1113 |
rewrite rules. Thus many occurrences of the 'unfold' method or |
18540 | 1114 |
'unfolded' attribute may be replaced by first-class proof text. |
1115 |
||
18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
1116 |
* Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded', |
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
1117 |
and command 'unfolding' now all support object-level equalities |
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
1118 |
(potentially conditional). The underlying notion of rewrite rule is |
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
1119 |
analogous to the 'rule_format' attribute, but *not* that of the |
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
1120 |
Simplifier (which is usually more generous). |
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
1121 |
|
24238 | 1122 |
* Isar: the new attribute [rotated n] (default n = 1) rotates the |
1123 |
premises of a theorem by n. Useful in conjunction with drule. |
|
1124 |
||
19220 | 1125 |
* Isar: the goal restriction operator [N] (default N = 1) evaluates a |
1126 |
method expression within a sandbox consisting of the first N |
|
19240 | 1127 |
sub-goals, which need to exist. For example, ``simp_all [3]'' |
1128 |
simplifies the first three sub-goals, while (rule foo, simp_all)[] |
|
1129 |
simplifies all new goals that emerge from applying rule foo to the |
|
1130 |
originally first one. |
|
19220 | 1131 |
|
19814
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset
|
1132 |
* Isar: schematic goals are no longer restricted to higher-order |
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset
|
1133 |
patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as |
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset
|
1134 |
expected. |
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset
|
1135 |
|
18901 | 1136 |
* Isar: the conclusion of a long theorem statement is now either |
1137 |
'shows' (a simultaneous conjunction, as before), or 'obtains' |
|
1138 |
(essentially a disjunction of cases with local parameters and |
|
1139 |
assumptions). The latter allows to express general elimination rules |
|
18910 | 1140 |
adequately; in this notation common elimination rules look like this: |
18901 | 1141 |
|
1142 |
lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis" |
|
1143 |
assumes "EX x. P x" |
|
1144 |
obtains x where "P x" |
|
1145 |
||
1146 |
lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis" |
|
1147 |
assumes "A & B" |
|
1148 |
obtains A and B |
|
1149 |
||
1150 |
lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis" |
|
1151 |
assumes "A | B" |
|
1152 |
obtains |
|
1153 |
A |
|
1154 |
| B |
|
1155 |
||
18910 | 1156 |
The subsequent classical rules even refer to the formal "thesis" |
18901 | 1157 |
explicitly: |
1158 |
||
1159 |
lemma classical: -- "(~ thesis ==> thesis) ==> thesis" |
|
1160 |
obtains "~ thesis" |
|
1161 |
||
18910 | 1162 |
lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis" |
1163 |
obtains "thesis ==> something" |
|
18901 | 1164 |
|
1165 |
The actual proof of an 'obtains' statement is analogous to that of the |
|
18910 | 1166 |
Isar proof element 'obtain', only that there may be several cases. |
1167 |
Optional case names may be specified in parentheses; these will be |
|
1168 |
available both in the present proof and as annotations in the |
|
1169 |
resulting rule, for later use with the 'cases' method (cf. attribute |
|
1170 |
case_names). |
|
18901 | 1171 |
|
21447
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset
|
1172 |
* Isar: the assumptions of a long theorem statement are available as |
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset
|
1173 |
"assms" fact in the proof context. This is more appropriate than the |
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset
|
1174 |
(historical) "prems", which refers to all assumptions of the current |
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset
|
1175 |
context, including those from the target locale, proof body etc. |
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset
|
1176 |
|
19263 | 1177 |
* Isar: 'print_statement' prints theorems from the current theory or |
1178 |
proof context in long statement form, according to the syntax of a |
|
1179 |
top-level lemma. |
|
1180 |
||
18901 | 1181 |
* Isar: 'obtain' takes an optional case name for the local context |
1182 |
introduction rule (default "that"). |
|
1183 |
||
19587 | 1184 |
* Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use |
1185 |
explicit (is "_ ==> ?foo") in the rare cases where this still happens |
|
1186 |
to occur. |
|
1187 |
||
19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset
|
1188 |
* Pure: syntax "CONST name" produces a fully internalized constant |
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset
|
1189 |
according to the current context. This is particularly useful for |
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset
|
1190 |
syntax translations that should refer to internal constant |
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset
|
1191 |
representations independently of name spaces. |
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset
|
1192 |
|
21537
45b3a85ee548
* Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents:
21471
diff
changeset
|
1193 |
* Pure: syntax constant for foo (binder "FOO ") is called "foo_binder" |
45b3a85ee548
* Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents:
21471
diff
changeset
|
1194 |
instead of "FOO ". This allows multiple binder declarations to coexist |
45b3a85ee548
* Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents:
21471
diff
changeset
|
1195 |
in the same context. INCOMPATIBILITY. |
45b3a85ee548
* Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents:
21471
diff
changeset
|
1196 |
|
21209
dbb8decc36bc
'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents:
21200
diff
changeset
|
1197 |
* Isar/locales: 'notation' provides a robust interface to the 'syntax' |
dbb8decc36bc
'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents:
21200
diff
changeset
|
1198 |
primitive that also works in a locale context (both for constants and |
24950 | 1199 |
fixed variables). Type declaration and internal syntactic representation |
1200 |
of given constants retrieved from the context. Likewise, the |
|
1201 |
'no_notation' command allows to remove given syntax annotations from the |
|
1202 |
current context. |
|
19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset
|
1203 |
|
19665 | 1204 |
* Isar/locales: new derived specification elements 'axiomatization', |
1205 |
'definition', 'abbreviation', which support type-inference, admit |
|
19083 | 1206 |
object-level specifications (equality, equivalence). See also the |
1207 |
isar-ref manual. Examples: |
|
19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset
|
1208 |
|
19665 | 1209 |
axiomatization |
21595 | 1210 |
eq (infix "===" 50) where |
1211 |
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" |
|
1212 |
||
1213 |
definition "f x y = x + y + 1" |
|
1214 |
definition g where "g x = f x x" |
|
19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset
|
1215 |
|
19363 | 1216 |
abbreviation |
21595 | 1217 |
neq (infix "=!=" 50) where |
19363 | 1218 |
"x =!= y == ~ (x === y)" |
19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset
|
1219 |
|
19083 | 1220 |
These specifications may be also used in a locale context. Then the |
1221 |
constants being introduced depend on certain fixed parameters, and the |
|
1222 |
constant name is qualified by the locale base name. An internal |
|
1223 |
abbreviation takes care for convenient input and output, making the |
|
19088 | 1224 |
parameters implicit and using the original short name. See also |
25177 | 1225 |
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic |
19083 | 1226 |
entities from a monomorphic theory. |
1227 |
||
1228 |
Presently, abbreviations are only available 'in' a target locale, but |
|
19363 | 1229 |
not inherited by general import expressions. Also note that |
1230 |
'abbreviation' may be used as a type-safe replacement for 'syntax' + |
|
24735
3a55ee2cae70
* Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm
parents:
24706
diff
changeset
|
1231 |
'translations' in common applications. The "no_abbrevs" print mode |
3a55ee2cae70
* Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm
parents:
24706
diff
changeset
|
1232 |
prevents folding of abbreviations in term output. |
19084 | 1233 |
|
19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset
|
1234 |
Concrete syntax is attached to specified constants in internal form, |
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset
|
1235 |
independently of name spaces. The parse tree representation is |
21209
dbb8decc36bc
'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents:
21200
diff
changeset
|
1236 |
slightly different -- use 'notation' instead of raw 'syntax', and |
19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset
|
1237 |
'translations' with explicit "CONST" markup to accommodate this. |
19665 | 1238 |
|
24800 | 1239 |
* Pure/Isar: unified syntax for new-style specification mechanisms |
1240 |
(e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits |
|
1241 |
full type inference and dummy patterns ("_"). For example: |
|
24735
3a55ee2cae70
* Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm
parents:
24706
diff
changeset
|
1242 |
|
3a55ee2cae70
* Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm
parents:
24706
diff
changeset
|
1243 |
definition "K x _ = x" |
3a55ee2cae70
* Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm
parents:
24706
diff
changeset
|
1244 |
|
24738 | 1245 |
inductive conj for A B |
1246 |
where "A ==> B ==> conj A B" |
|
1247 |
||
21735 | 1248 |
* Pure: command 'print_abbrevs' prints all constant abbreviations of |
1249 |
the current context. Print mode "no_abbrevs" prevents inversion of |
|
1250 |
abbreviations on output. |
|
1251 |
||
24800 | 1252 |
* Isar/locales: improved parameter handling: use of locales "var" and |
1253 |
"struct" no longer necessary; - parameter renamings are no longer |
|
1254 |
required to be injective. For example, this allows to define |
|
1255 |
endomorphisms as locale endom = homom mult mult h. |
|
19783 | 1256 |
|
19931
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset
|
1257 |
* Isar/locales: changed the way locales with predicates are defined. |
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset
|
1258 |
Instead of accumulating the specification, the imported expression is |
22126 | 1259 |
now an interpretation. INCOMPATIBILITY: different normal form of |
1260 |
locale expressions. In particular, in interpretations of locales with |
|
1261 |
predicates, goals repesenting already interpreted fragments are not |
|
1262 |
removed automatically. Use methods `intro_locales' and |
|
1263 |
`unfold_locales'; see below. |
|
1264 |
||
1265 |
* Isar/locales: new methods `intro_locales' and `unfold_locales' |
|
1266 |
provide backward reasoning on locales predicates. The methods are |
|
1267 |
aware of interpretations and discharge corresponding goals. |
|
1268 |
`intro_locales' is less aggressive then `unfold_locales' and does not |
|
1269 |
unfold predicates to assumptions. |
|
19931
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset
|
1270 |
|
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset
|
1271 |
* Isar/locales: the order in which locale fragments are accumulated |
22126 | 1272 |
has changed. This enables to override declarations from fragments due |
1273 |
to interpretations -- for example, unwanted simp rules. |
|
19931
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset
|
1274 |
|
23920 | 1275 |
* Isar/locales: interpretation in theories and proof contexts has been |
1276 |
extended. One may now specify (and prove) equations, which are |
|
1277 |
unfolded in interpreted theorems. This is useful for replacing |
|
1278 |
defined concepts (constants depending on locale parameters) by |
|
1279 |
concepts already existing in the target context. Example: |
|
1280 |
||
1281 |
interpretation partial_order ["op <= :: [int, int] => bool"] |
|
1282 |
where "partial_order.less (op <=) (x::int) y = (x < y)" |
|
1283 |
||
24800 | 1284 |
Typically, the constant `partial_order.less' is created by a |
1285 |
definition specification element in the context of locale |
|
1286 |
partial_order. |
|
1287 |
||
24859 | 1288 |
* Method "induct": improved internal context management to support |
24800 | 1289 |
local fixes and defines on-the-fly. Thus explicit meta-level |
1290 |
connectives !! and ==> are rarely required anymore in inductive goals |
|
1291 |
(using object-logic connectives for this purpose has been long |
|
1292 |
obsolete anyway). Common proof patterns are explained in |
|
25177 | 1293 |
src/HOL/Induct/Common_Patterns.thy, see also |
1294 |
src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic |
|
1295 |
examples. |
|
24606
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset
|
1296 |
|
24859 | 1297 |
* Method "induct": improved handling of simultaneous goals. Instead of |
24606
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset
|
1298 |
introducing object-level conjunction, the statement is now split into |
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset
|
1299 |
several conclusions, while the corresponding symbolic cases are nested |
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset
|
1300 |
accordingly. INCOMPATIBILITY, proofs need to be structured explicitly, |
25177 | 1301 |
see src/HOL/Induct/Common_Patterns.thy, for example. |
24606
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset
|
1302 |
|
24859 | 1303 |
* Method "induct": mutual induction rules are now specified as a list |
24800 | 1304 |
of rule sharing the same induction cases. HOL packages usually provide |
24606
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset
|
1305 |
foo_bar.inducts for mutually defined items foo and bar (e.g. inductive |
24859 | 1306 |
predicates/sets or datatypes). INCOMPATIBILITY, users need to specify |
1307 |
mutual induction rules differently, i.e. like this: |
|
18506
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset
|
1308 |
|
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset
|
1309 |
(induct rule: foo_bar.inducts) |
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset
|
1310 |
(induct set: foo bar) |
24859 | 1311 |
(induct pred: foo bar) |
18506
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset
|
1312 |
(induct type: foo bar) |
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset
|
1313 |
|
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset
|
1314 |
The ML function ProjectRule.projections turns old-style rules into the |
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset
|
1315 |
new format. |
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset
|
1316 |
|
24859 | 1317 |
* Method "coinduct": dual of induction, see |
18399 | 1318 |
src/HOL/Library/Coinductive_List.thy for various examples. |
1319 |
||
24859 | 1320 |
* Method "cases", "induct", "coinduct": the ``(open)'' option is |
1321 |
considered a legacy feature. |
|
1322 |
||
20919
dab803075c62
attribute "symmetric": standardized schematic variables;
wenzelm
parents:
20857
diff
changeset
|
1323 |
* Attribute "symmetric" produces result with standardized schematic |
dab803075c62
attribute "symmetric": standardized schematic variables;
wenzelm
parents:
20857
diff
changeset
|
1324 |
variables (index 0). Potential INCOMPATIBILITY. |
dab803075c62
attribute "symmetric": standardized schematic variables;
wenzelm
parents:
20857
diff
changeset
|
1325 |
|
22126 | 1326 |
* Simplifier: by default the simplifier trace only shows top level |
1327 |
rewrites now. That is, trace_simp_depth_limit is set to 1 by |
|
1328 |
default. Thus there is less danger of being flooded by the trace. The |
|
1329 |
trace indicates where parts have been suppressed. |
|
18674 | 1330 |
|
18536
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
1331 |
* Provers/classical: removed obsolete classical version of elim_format |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
1332 |
attribute; classical elim/dest rules are now treated uniformly when |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
1333 |
manipulating the claset. |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
1334 |
|
18694 | 1335 |
* Provers/classical: stricter checks to ensure that supplied intro, |
1336 |
dest and elim rules are well-formed; dest and elim rules must have at |
|
1337 |
least one premise. |
|
1338 |
||
1339 |
* Provers/classical: attributes dest/elim/intro take an optional |
|
18695 | 1340 |
weight argument for the rule (just as the Pure versions). Weights are |
18696 | 1341 |
ignored by automated tools, but determine the search order of single |
18694 | 1342 |
rule steps. |
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18549
diff
changeset
|
1343 |
|
18536
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
1344 |
* Syntax: input syntax now supports dummy variable binding "%_. b", |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
1345 |
where the body does not mention the bound variable. Note that dummy |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
1346 |
patterns implicitly depend on their context of bounds, which makes |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
1347 |
"{_. _}" match any set comprehension as expected. Potential |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
1348 |
INCOMPATIBILITY -- parse translations need to cope with syntactic |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
1349 |
constant "_idtdummy" in the binding position. |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
1350 |
|
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
1351 |
* Syntax: removed obsolete syntactic constant "_K" and its associated |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
1352 |
parse translation. INCOMPATIBILITY -- use dummy abstraction instead, |
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset
|
1353 |
for example "A -> B" => "Pi A (%_. B)". |
17779 | 1354 |
|
20582
ebd0e03c6a9b
* Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents:
20503
diff
changeset
|
1355 |
* Pure: 'class_deps' command visualizes the subclass relation, using |
ebd0e03c6a9b
* Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents:
20503
diff
changeset
|
1356 |
the graph browser tool. |
ebd0e03c6a9b
* Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents:
20503
diff
changeset
|
1357 |
|
24800 | 1358 |
* Pure: 'print_theory' now suppresses certain internal declarations by |
1359 |
default; use '!' option for full details. |
|
20620
8b26f58c5646
* Pure: 'print_theory' now suppresses entities with internal name;
wenzelm
parents:
20607
diff
changeset
|
1360 |
|
17865 | 1361 |
|
17806 | 1362 |
*** HOL *** |
1363 |
||
25129 | 1364 |
* Method "metis" proves goals by applying the Metis general-purpose |
1365 |
resolution prover (see also http://gilith.com/software/metis/). |
|
1366 |
Examples are in the directory MetisExamples. WARNING: the |
|
1367 |
Isabelle/HOL-Metis integration does not yet work properly with |
|
1368 |
multi-threading. |
|
1369 |
||
1370 |
* Command 'sledgehammer' invokes external automatic theorem provers as |
|
1371 |
background processes. It generates calls to the "metis" method if |
|
1372 |
successful. These can be pasted into the proof. Users do not have to |
|
1373 |
wait for the automatic provers to return. WARNING: does not really |
|
1374 |
work with multi-threading. |
|
1375 |
||
24804 | 1376 |
* New "auto_quickcheck" feature tests outermost goal statements for |
1377 |
potential counter-examples. Controlled by ML references |
|
1378 |
auto_quickcheck (default true) and auto_quickcheck_time_limit (default |
|
25129 | 1379 |
5000 milliseconds). Fails silently if statements is outside of |
1380 |
executable fragment, or any other codgenerator problem occurs. |
|
24804 | 1381 |
|
25184 | 1382 |
* New constant "undefined" with axiom "undefined x = undefined". |
1383 |
||
1384 |
* Added class "HOL.eq", allowing for code generation with polymorphic |
|
1385 |
equality. |
|
1386 |
||
1387 |
* Some renaming of class constants due to canonical name prefixing in |
|
1388 |
the new 'class' package: |
|
1389 |
||
1390 |
HOL.abs ~> HOL.abs_class.abs |
|
1391 |
HOL.divide ~> HOL.divide_class.divide |
|
1392 |
0 ~> HOL.zero_class.zero |
|
1393 |
1 ~> HOL.one_class.one |
|
1394 |
op + ~> HOL.plus_class.plus |
|
1395 |
op - ~> HOL.minus_class.minus |
|
1396 |
uminus ~> HOL.minus_class.uminus |
|
1397 |
op * ~> HOL.times_class.times |
|
1398 |
op < ~> HOL.ord_class.less |
|
1399 |
op <= > HOL.ord_class.less_eq |
|
1400 |
Nat.power ~> Power.power_class.power |
|
1401 |
Nat.size ~> Nat.size_class.size |
|
1402 |
Numeral.number_of ~> Numeral.number_class.number_of |
|
1403 |
FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf |
|
1404 |
FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup |
|
1405 |
Orderings.min ~> Orderings.ord_class.min |
|
1406 |
Orderings.max ~> Orderings.ord_class.max |
|
1407 |
Divides.op div ~> Divides.div_class.div |
|
1408 |
Divides.op mod ~> Divides.div_class.mod |
|
1409 |
Divides.op dvd ~> Divides.div_class.dvd |
|
1410 |
||
1411 |
INCOMPATIBILITY. Adaptions may be required in the following cases: |
|
1412 |
||
1413 |
a) User-defined constants using any of the names "plus", "minus", |
|
1414 |
"times", "less" or "less_eq". The standard syntax translations for |
|
1415 |
"+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific |
|
1416 |
names. |
|
1417 |
||
1418 |
b) Variables named "plus", "minus", "times", "less", "less_eq" |
|
1419 |
INCOMPATIBILITY: use more specific names. |
|
1420 |
||
1421 |
c) Permutative equations (e.g. "a + b = b + a") |
|
1422 |
Since the change of names also changes the order of terms, permutative |
|
1423 |
rewrite rules may get applied in a different order. Experience shows |
|
1424 |
that this is rarely the case (only two adaptions in the whole Isabelle |
|
1425 |
distribution). INCOMPATIBILITY: rewrite proofs |
|
1426 |
||
1427 |
d) ML code directly refering to constant names |
|
1428 |
This in general only affects hand-written proof tactics, simprocs and |
|
1429 |
so on. INCOMPATIBILITY: grep your sourcecode and replace names. |
|
1430 |
Consider using @{const_name} antiquotation. |
|
1431 |
||
1432 |
* New class "default" with associated constant "default". |
|
1433 |
||
1434 |
* Function "sgn" is now overloaded and available on int, real, complex |
|
1435 |
(and other numeric types), using class "sgn". Two possible defs of |
|
1436 |
sgn are given as equational assumptions in the classes sgn_if and |
|
1437 |
sgn_div_norm; ordered_idom now also inherits from sgn_if. |
|
1438 |
INCOMPATIBILITY. |
|
1439 |
||
1440 |
* Locale "partial_order" now unified with class "order" (cf. theory |
|
1441 |
Orderings), added parameter "less". INCOMPATIBILITY. |
|
1442 |
||
1443 |
* Renamings in classes "order" and "linorder": facts "refl", "trans" and |
|
1444 |
"cases" to "order_refl", "order_trans" and "linorder_cases", to avoid |
|
1445 |
clashes with HOL "refl" and "trans". INCOMPATIBILITY. |
|
1446 |
||
1447 |
* Classes "order" and "linorder": potential INCOMPATIBILITY due to |
|
1448 |
changed order of proof goals in instance proofs. |
|
1449 |
||
1450 |
* The transitivity reasoner for partial and linear orders is set up |
|
1451 |
for classes "order" and "linorder". Instances of the reasoner are available |
|
1452 |
in all contexts importing or interpreting the corresponding locales. |
|
1453 |
Method "order" invokes the reasoner separately; the reasoner |
|
1454 |
is also integrated with the Simplifier as a solver. Diagnostic |
|
1455 |
command 'print_orders' shows the available instances of the reasoner |
|
1456 |
in the current context. |
|
1457 |
||
1458 |
* Localized monotonicity predicate in theory "Orderings"; integrated |
|
1459 |
lemmas max_of_mono and min_of_mono with this predicate. |
|
1460 |
INCOMPATIBILITY. |
|
1461 |
||
1462 |
* Formulation of theorem "dense" changed slightly due to integration |
|
1463 |
with new class dense_linear_order. |
|
1464 |
||
1465 |
* Uniform lattice theory development in HOL. |
|
1466 |
||
1467 |
constants "meet" and "join" now named "inf" and "sup" |
|
1468 |
constant "Meet" now named "Inf" |
|
1469 |
||
1470 |
classes "meet_semilorder" and "join_semilorder" now named |
|
1471 |
"lower_semilattice" and "upper_semilattice" |
|
1472 |
class "lorder" now named "lattice" |
|
1473 |
class "comp_lat" now named "complete_lattice" |
|
1474 |
||
1475 |
Instantiation of lattice classes allows explicit definitions |
|
1476 |
for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices). |
|
1477 |
||
1478 |
INCOMPATIBILITY. Theorem renames: |
|
1479 |
||
1480 |
meet_left_le ~> inf_le1 |
|
1481 |
meet_right_le ~> inf_le2 |
|
1482 |
join_left_le ~> sup_ge1 |
|
1483 |
join_right_le ~> sup_ge2 |
|
1484 |
meet_join_le ~> inf_sup_ord |
|
1485 |
le_meetI ~> le_infI |
|
1486 |
join_leI ~> le_supI |
|
1487 |
le_meet ~> le_inf_iff |
|
1488 |
le_join ~> ge_sup_conv |
|
1489 |
meet_idempotent ~> inf_idem |
|
1490 |
join_idempotent ~> sup_idem |
|
1491 |
meet_comm ~> inf_commute |
|
1492 |
join_comm ~> sup_commute |
|
1493 |
meet_leI1 ~> le_infI1 |
|
1494 |
meet_leI2 ~> le_infI2 |
|
1495 |
le_joinI1 ~> le_supI1 |
|
1496 |
le_joinI2 ~> le_supI2 |
|
1497 |
meet_assoc ~> inf_assoc |
|
1498 |
join_assoc ~> sup_assoc |
|
1499 |
meet_left_comm ~> inf_left_commute |
|
1500 |
meet_left_idempotent ~> inf_left_idem |
|
1501 |
join_left_comm ~> sup_left_commute |
|
1502 |
join_left_idempotent ~> sup_left_idem |
|
1503 |
meet_aci ~> inf_aci |
|
1504 |
join_aci ~> sup_aci |
|
1505 |
le_def_meet ~> le_iff_inf |
|
1506 |
le_def_join ~> le_iff_sup |
|
1507 |
join_absorp2 ~> sup_absorb2 |
|
1508 |
join_absorp1 ~> sup_absorb1 |
|
1509 |
meet_absorp1 ~> inf_absorb1 |
|
1510 |
meet_absorp2 ~> inf_absorb2 |
|
1511 |
meet_join_absorp ~> inf_sup_absorb |
|
1512 |
join_meet_absorp ~> sup_inf_absorb |
|
1513 |
distrib_join_le ~> distrib_sup_le |
|
1514 |
distrib_meet_le ~> distrib_inf_le |
|
1515 |
||
1516 |
add_meet_distrib_left ~> add_inf_distrib_left |
|
1517 |
add_join_distrib_left ~> add_sup_distrib_left |
|
1518 |
is_join_neg_meet ~> is_join_neg_inf |
|
1519 |
is_meet_neg_join ~> is_meet_neg_sup |
|
1520 |
add_meet_distrib_right ~> add_inf_distrib_right |
|
1521 |
add_join_distrib_right ~> add_sup_distrib_right |
|
1522 |
add_meet_join_distribs ~> add_sup_inf_distribs |
|
1523 |
join_eq_neg_meet ~> sup_eq_neg_inf |
|
1524 |
meet_eq_neg_join ~> inf_eq_neg_sup |
|
1525 |
add_eq_meet_join ~> add_eq_inf_sup |
|
1526 |
meet_0_imp_0 ~> inf_0_imp_0 |
|
1527 |
join_0_imp_0 ~> sup_0_imp_0 |
|
1528 |
meet_0_eq_0 ~> inf_0_eq_0 |
|
1529 |
join_0_eq_0 ~> sup_0_eq_0 |
|
1530 |
neg_meet_eq_join ~> neg_inf_eq_sup |
|
1531 |
neg_join_eq_meet ~> neg_sup_eq_inf |
|
1532 |
join_eq_if ~> sup_eq_if |
|
1533 |
||
1534 |
mono_meet ~> mono_inf |
|
1535 |
mono_join ~> mono_sup |
|
1536 |
meet_bool_eq ~> inf_bool_eq |
|
1537 |
join_bool_eq ~> sup_bool_eq |
|
1538 |
meet_fun_eq ~> inf_fun_eq |
|
1539 |
join_fun_eq ~> sup_fun_eq |
|
1540 |
meet_set_eq ~> inf_set_eq |
|
1541 |
join_set_eq ~> sup_set_eq |
|
1542 |
meet1_iff ~> inf1_iff |
|
1543 |
meet2_iff ~> inf2_iff |
|
1544 |
meet1I ~> inf1I |
|
1545 |
meet2I ~> inf2I |
|
1546 |
meet1D1 ~> inf1D1 |
|
1547 |
meet2D1 ~> inf2D1 |
|
1548 |
meet1D2 ~> inf1D2 |
|
1549 |
meet2D2 ~> inf2D2 |
|
1550 |
meet1E ~> inf1E |
|
1551 |
meet2E ~> inf2E |
|
1552 |
join1_iff ~> sup1_iff |
|
1553 |
join2_iff ~> sup2_iff |
|
1554 |
join1I1 ~> sup1I1 |
|
1555 |
join2I1 ~> sup2I1 |
|
1556 |
join1I1 ~> sup1I1 |
|
1557 |
join2I2 ~> sup1I2 |
|
1558 |
join1CI ~> sup1CI |
|
1559 |
join2CI ~> sup2CI |
|
1560 |
join1E ~> sup1E |
|
1561 |
join2E ~> sup2E |
|
1562 |
||
1563 |
is_meet_Meet ~> is_meet_Inf |
|
1564 |
Meet_bool_def ~> Inf_bool_def |
|
1565 |
Meet_fun_def ~> Inf_fun_def |
|
1566 |
Meet_greatest ~> Inf_greatest |
|
1567 |
Meet_lower ~> Inf_lower |
|
1568 |
Meet_set_def ~> Inf_set_def |
|
1569 |
||
1570 |
Sup_def ~> Sup_Inf |
|
1571 |
Sup_bool_eq ~> Sup_bool_def |
|
1572 |
Sup_fun_eq ~> Sup_fun_def |
|
1573 |
Sup_set_eq ~> Sup_set_def |
|
1574 |
||
1575 |
listsp_meetI ~> listsp_infI |
|
1576 |
listsp_meet_eq ~> listsp_inf_eq |
|
1577 |
||
1578 |
meet_min ~> inf_min |
|
1579 |
join_max ~> sup_max |
|
1580 |
||
1581 |
* Added syntactic class "size"; overloaded constant "size" now has |
|
1582 |
type "'a::size ==> bool" |
|
1583 |
||
24800 | 1584 |
* Internal reorganisation of `size' of datatypes: size theorems |
1585 |
"foo.size" are no longer subsumed by "foo.simps" (but are still |
|
1586 |
simplification rules by default!); theorems "prod.size" now named |
|
25184 | 1587 |
"*.size". |
1588 |
||
1589 |
* Class "div" now inherits from class "times" rather than "type". |
|
1590 |
INCOMPATIBILITY. |
|
24800 | 1591 |
|
1592 |
* HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice, |
|
1593 |
Linorder etc. have disappeared; operations defined in terms of |
|
1594 |
fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY. |
|
1595 |
||
25129 | 1596 |
* HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY. |
1597 |
||
24800 | 1598 |
* HOL-Word: New extensive library and type for generic, fixed size |
1599 |
machine words, with arithemtic, bit-wise, shifting and rotating |
|
1600 |
operations, reflection into int, nat, and bool lists, automation for |
|
1601 |
linear arithmetic (by automatic reflection into nat or int), including |
|
1602 |
lemmas on overflow and monotonicity. Instantiated to all appropriate |
|
1603 |
arithmetic type classes, supporting automatic simplification of |
|
1604 |
numerals on all operations. |
|
24333 | 1605 |
|
1606 |
* Library/Boolean_Algebra: locales for abstract boolean algebras. |
|
1607 |
||
1608 |
* Library/Numeral_Type: numbers as types, e.g. TYPE(32). |
|
1609 |
||
23850 | 1610 |
* Code generator library theories: |
24993 | 1611 |
- Code_Integer represents HOL integers by big integer literals in target |
23850 | 1612 |
languages. |
24993 | 1613 |
- Code_Char represents HOL characters by character literals in target |
23850 | 1614 |
languages. |
24993 | 1615 |
- Code_Char_chr like Code_Char, but also offers treatment of character |
1616 |
codes; includes Code_Integer. |
|
24800 | 1617 |
- Executable_Set allows to generate code for finite sets using lists. |
1618 |
- Executable_Rat implements rational numbers as triples (sign, enumerator, |
|
23850 | 1619 |
denominator). |
24800 | 1620 |
- Executable_Real implements a subset of real numbers, namly those |
23850 | 1621 |
representable by rational numbers. |
24800 | 1622 |
- Efficient_Nat implements natural numbers by integers, which in general will |
23850 | 1623 |
result in higher efficency; pattern matching with 0/Suc is eliminated; |
24993 | 1624 |
includes Code_Integer. |
1625 |
- Code_Index provides an additional datatype index which is mapped to |
|
1626 |
target-language built-in integers. |
|
26355 | 1627 |
- Code_Message provides an additional datatype message_string which is isomorphic to |
24993 | 1628 |
strings; messages are mapped to target-language strings. |
23850 | 1629 |
|
23783
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1630 |
* New package for inductive predicates |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1631 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1632 |
An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1633 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1634 |
inductive |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1635 |
p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1636 |
for z_1 :: U_1 and ... and z_n :: U_m |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1637 |
where |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1638 |
rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1639 |
| ... |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1640 |
|
24800 | 1641 |
with full support for type-inference, rather than |
23783
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1642 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1643 |
consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1644 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1645 |
abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1646 |
where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1647 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1648 |
inductive "s z_1 ... z_m" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1649 |
intros |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1650 |
rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1651 |
... |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1652 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1653 |
For backward compatibility, there is a wrapper allowing inductive |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1654 |
sets to be defined with the new package via |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1655 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1656 |
inductive_set |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1657 |
s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1658 |
for z_1 :: U_1 and ... and z_n :: U_m |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1659 |
where |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1660 |
rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1661 |
| ... |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1662 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1663 |
or |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1664 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1665 |
inductive_set |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1666 |
s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1667 |
and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1668 |
for z_1 :: U_1 and ... and z_n :: U_m |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1669 |
where |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1670 |
"p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1671 |
| rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1672 |
| ... |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1673 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1674 |
if the additional syntax "p ..." is required. |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1675 |
|
25177 | 1676 |
Numerous examples can be found in the subdirectories src/HOL/Auth, |
1677 |
src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava. |
|
23783
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1678 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1679 |
INCOMPATIBILITIES: |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1680 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1681 |
- Since declaration and definition of inductive sets or predicates |
24800 | 1682 |
is no longer separated, abbreviations involving the newly |
1683 |
introduced sets or predicates must be specified together with the |
|
1684 |
introduction rules after the 'where' keyword (see above), rather |
|
1685 |
than before the actual inductive definition. |
|
1686 |
||
1687 |
- The variables in induction and elimination rules are now |
|
1688 |
quantified in the order of their occurrence in the introduction |
|
1689 |
rules, rather than in alphabetical order. Since this may break |
|
1690 |
some proofs, these proofs either have to be repaired, e.g. by |
|
1691 |
reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case' |
|
1692 |
statements of the form |
|
23783
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1693 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1694 |
case (rule_i a_i_1 ... a_i_{k_i}) |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1695 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1696 |
or the old order of quantification has to be restored by explicitly adding |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1697 |
meta-level quantifiers in the introduction rules, i.e. |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1698 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1699 |
| rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n" |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1700 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1701 |
- The format of the elimination rules is now |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1702 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1703 |
p z_1 ... z_m x_1 ... x_n ==> |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1704 |
(!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P) |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1705 |
==> ... ==> P |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1706 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1707 |
for predicates and |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1708 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1709 |
(x_1, ..., x_n) : s z_1 ... z_m ==> |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1710 |
(!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P) |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1711 |
==> ... ==> P |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1712 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1713 |
for sets rather than |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1714 |
|
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1715 |
x : s z_1 ... z_m ==> |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1716 |
(!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P) |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1717 |
==> ... ==> P |
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1718 |
|
24800 | 1719 |
This may require terms in goals to be expanded to n-tuples |
1720 |
(e.g. using case_tac or simplification with the split_paired_all |
|
1721 |
rule) before the above elimination rule is applicable. |
|
1722 |
||
1723 |
- The elimination or case analysis rules for (mutually) inductive |
|
1724 |
sets or predicates are now called "p_1.cases" ... "p_k.cases". The |
|
1725 |
list of rules "p_1_..._p_k.elims" is no longer available. |
|
23783
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
|
1726 |
|
25198 | 1727 |
* New package "function"/"fun" for general recursive functions, |
1728 |
supporting mutual and nested recursion, definitions in local contexts, |
|
1729 |
more general pattern matching and partiality. See HOL/ex/Fundefs.thy |
|
1730 |
for small examples, and the separate tutorial on the function |
|
1731 |
package. The old recdef "package" is still available as before, but |
|
1732 |
users are encouraged to use the new package. |
|
1733 |
||
1734 |
* Method "lexicographic_order" automatically synthesizes termination |
|
1735 |
relations as lexicographic combinations of size measures. |
|
1736 |
||
24800 | 1737 |
* Case-expressions allow arbitrary constructor-patterns (including |
1738 |
"_") and take their order into account, like in functional |
|
1739 |
programming. Internally, this is translated into nested |
|
1740 |
case-expressions; missing cases are added and mapped to the predefined |
|
1741 |
constant "undefined". In complicated cases printing may no longer show |
|
1742 |
the original input but the internal form. Lambda-abstractions allow |
|
1743 |
the same form of pattern matching: "% pat1 => e1 | ..." is an |
|
1744 |
abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new |
|
1745 |
variable. |
|
23564 | 1746 |
|
23468 | 1747 |
* IntDef: The constant "int :: nat => int" has been removed; now "int" |
24800 | 1748 |
is an abbreviation for "of_nat :: nat => int". The simplification |
1749 |
rules for "of_nat" have been changed to work like "int" did |
|
1750 |
previously. Potential INCOMPATIBILITY: |
|
23468 | 1751 |
- "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1" |
1752 |
- of_nat_diff and of_nat_mult are no longer default simp rules |
|
23377 | 1753 |
|
23295
86e225406859
Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents:
23251
diff
changeset
|
1754 |
* Method "algebra" solves polynomial equations over (semi)rings using |
24800 | 1755 |
Groebner bases. The (semi)ring structure is defined by locales and the |
1756 |
tool setup depends on that generic context. Installing the method for |
|
1757 |
a specific type involves instantiating the locale and possibly adding |
|
1758 |
declarations for computation on the coefficients. The method is |
|
1759 |
already instantiated for natural numbers and for the axiomatic class |
|
1760 |
of idoms with numerals. See also the paper by Chaieb and Wenzel at |
|
1761 |
CALCULEMUS 2007 for the general principles underlying this |
|
1762 |
architecture of context-aware proof-tools. |
|
1763 |
||
25033 | 1764 |
* Method "ferrack" implements quantifier elimination over |
1765 |
special-purpose dense linear orders using locales (analogous to |
|
1766 |
"algebra"). The method is already installed for class |
|
1767 |
{ordered_field,recpower,number_ring} which subsumes real, hyperreal, |
|
1768 |
rat, etc. |
|
1769 |
||
24800 | 1770 |
* Former constant "List.op @" now named "List.append". Use ML |
1771 |
antiquotations @{const_name List.append} or @{term " ... @ ... "} to |
|
1772 |
circumvent possible incompatibilities when working on ML level. |
|
1773 |
||
24996 | 1774 |
* primrec: missing cases mapped to "undefined" instead of "arbitrary". |
22845 | 1775 |
|
24800 | 1776 |
* New function listsum :: 'a list => 'a for arbitrary monoids. |
1777 |
Special syntax: "SUM x <- xs. f x" (and latex variants) |
|
1778 |
||
1779 |
* New syntax for Haskell-like list comprehension (input only), eg. |
|
25177 | 1780 |
[(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy. |
24800 | 1781 |
|
1782 |
* The special syntax for function "filter" has changed from [x : |
|
1783 |
xs. P] to [x <- xs. P] to avoid an ambiguity caused by list |
|
1784 |
comprehension syntax, and for uniformity. INCOMPATIBILITY. |
|
1785 |
||
1786 |
* [a..b] is now defined for arbitrary linear orders. It used to be |
|
1787 |
defined on nat only, as an abbreviation for [a..<Suc b] |
|
1788 |
INCOMPATIBILITY. |
|
1789 |
||
1790 |
* Renamed lemma "set_take_whileD" to "set_takeWhileD". |
|
1791 |
||
25177 | 1792 |
* New functions "sorted" and "sort" in src/HOL/List.thy. |
24800 | 1793 |
|
1794 |
* New lemma collection field_simps (an extension of ring_simps) for |
|
1795 |
manipulating (in)equations involving division. Multiplies with all |
|
1796 |
denominators that can be proved to be non-zero (in equations) or |
|
1797 |
positive/negative (in inequations). |
|
23480 | 1798 |
|
1799 |
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib |
|
24800 | 1800 |
have been improved and renamed to ring_simps, group_simps and |
1801 |
ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field |
|
1802 |
because they were subsumed by lemmas xyz. INCOMPATIBILITY. |
|
1803 |
||
25177 | 1804 |
* Theory Library/Commutative_Ring: switched from recdef to function |
24800 | 1805 |
package; constants add, mul, pow now curried. Infix syntax for |
1806 |
algebraic operations. |
|
22735 | 1807 |
|
24800 | 1808 |
* Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq. |
22218 | 1809 |
INCOMPATIBILITY. |
1810 |
||
24800 | 1811 |
* Dropped redundant lemma if_def2 in favor of if_bool_eq_conj. |
22218 | 1812 |
INCOMPATIBILITY. |
1813 |
||
22126 | 1814 |
* HOL/records: generalised field-update to take a function on the |
1815 |
field rather than the new value: r(|A := x|) is translated to A_update |
|
1816 |
(K x) r The K-combinator that is internally used is called K_record. |
|
21226
a607ae87ee81
field-update in records is generalised to take a function on the field
schirmer
parents:
21215
diff
changeset
|
1817 |
INCOMPATIBILITY: Usage of the plain update functions has to be |
a607ae87ee81
field-update in records is generalised to take a function on the field
schirmer
parents:
21215
diff
changeset
|
1818 |
adapted. |
a607ae87ee81
field-update in records is generalised to take a function on the field
schirmer
parents:
21215
diff
changeset
|
1819 |
|
24800 | 1820 |
* Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0 |
1821 |
* x = 0, which are required for a semiring. Richer structures do not |
|
1822 |
inherit from semiring_0 anymore, because this property is a theorem |
|
1823 |
there, not an axiom. INCOMPATIBILITY: In instances of semiring_0, |
|
1824 |
there is more to prove, but this is mostly trivial. |
|
1825 |
||
1826 |
* Class "recpower" is generalized to arbitrary monoids, not just |
|
1827 |
commutative semirings. INCOMPATIBILITY: may need to incorporate |
|
25163 | 1828 |
commutativity or semiring properties additionally. |
21215
7c9337a0e30a
made locale partial_order compatible with axclass order
haftmann
parents:
21209
diff
changeset
|
1829 |
|
21099 | 1830 |
* Constant "List.list_all2" in List.thy now uses authentic syntax. |
24800 | 1831 |
INCOMPATIBILITY: translations containing list_all2 may go wrong, |
1832 |
better use 'abbreviation'. |
|
1833 |
||
1834 |
* Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY. |
|
1835 |
||
22126 | 1836 |
* Numeral syntax: type 'bin' which was a mere type copy of 'int' has |
24800 | 1837 |
been abandoned in favour of plain 'int'. INCOMPATIBILITY -- |
22126 | 1838 |
significant changes for setting up numeral syntax for types: |
24800 | 1839 |
- New constants Numeral.pred and Numeral.succ instead |
20485 | 1840 |
of former Numeral.bin_pred and Numeral.bin_succ. |
1841 |
- Use integer operations instead of bin_add, bin_mult and so on. |
|
1842 |
- Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps. |
|
1843 |
- ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. |
|
1844 |
||
25177 | 1845 |
See src/HOL/Integ/IntArith.thy for an example setup. |
1846 |
||
1847 |
* Command 'normal_form' computes the normal form of a term that may |
|
1848 |
contain free variables. For example ``normal_form "rev [a, b, c]"'' |
|
1849 |
produces ``[b, c, a]'' (without proof). This command is suitable for |
|
1850 |
heavy-duty computations because the functions are compiled to ML |
|
1851 |
first. Correspondingly, a method "normalization" is provided. See |
|
1852 |
further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML. |
|
19895 | 1853 |
|
17996 | 1854 |
* Alternative iff syntax "A <-> B" for equality on bool (with priority |
1855 |
25 like -->); output depends on the "iff" print_mode, the default is |
|
1856 |
"A = B" (with priority 50). |
|
1857 |
||
21265 | 1858 |
* Relations less (<) and less_eq (<=) are also available on type bool. |
1859 |
Modified syntax to disallow nesting without explicit parentheses, |
|
24800 | 1860 |
e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential |
1861 |
INCOMPATIBILITY. |
|
21265 | 1862 |
|
18674 | 1863 |
* "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only). |
1864 |
||
20716
a6686a8e1b68
Changed precedence of "op O" (relation composition) from 60 to 75.
krauss
parents:
20712
diff
changeset
|
1865 |
* Relation composition operator "op O" now has precedence 75 and binds |
a6686a8e1b68
Changed precedence of "op O" (relation composition) from 60 to 75.
krauss
parents:
20712
diff
changeset
|
1866 |
stronger than union and intersection. INCOMPATIBILITY. |
a6686a8e1b68
Changed precedence of "op O" (relation composition) from 60 to 75.
krauss
parents:
20712
diff
changeset
|
1867 |
|
22126 | 1868 |
* The old set interval syntax "{m..n(}" (and relatives) has been |
1869 |
removed. Use "{m..<n}" (and relatives) instead. |
|
19377 | 1870 |
|
17865 | 1871 |
* In the context of the assumption "~(s = t)" the Simplifier rewrites |
24800 | 1872 |
"t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using |
1873 |
``declare [[simproc del: neq]]''. |
|
1874 |
||
1875 |
* Simplifier: "m dvd n" where m and n are numbers is evaluated to |
|
1876 |
True/False. |
|
1877 |
||
1878 |
* Theorem Cons_eq_map_conv no longer declared as "simp". |
|
19211 | 1879 |
|
19279 | 1880 |
* Theorem setsum_mult renamed to setsum_right_distrib. |
1881 |
||
19211 | 1882 |
* Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the |
22126 | 1883 |
``rule'' method. |
1884 |
||
24800 | 1885 |
* Reimplemented methods "sat" and "satx", with several improvements: |
1886 |
goals no longer need to be stated as "<prems> ==> False", equivalences |
|
1887 |
(i.e. "=" on type bool) are handled, variable names of the form |
|
1888 |
"lit_<n>" are no longer reserved, significant speedup. |
|
1889 |
||
1890 |
* Methods "sat" and "satx" can now replay MiniSat proof traces. |
|
22126 | 1891 |
zChaff is still supported as well. |
1892 |
||
1893 |
* 'inductive' and 'datatype': provide projections of mutual rules, |
|
1894 |
bundled as foo_bar.inducts; |
|
1895 |
||
1896 |
* Library: moved theories Parity, GCD, Binomial, Infinite_Set to |
|
1897 |
Library. |
|
21256 | 1898 |
|
1899 |
* Library: moved theory Accessible_Part to main HOL. |
|
19572
a4b3176f19dd
* Library: theory Accessible_Part has been move to main HOL.
wenzelm
parents:
19508
diff
changeset
|
1900 |
|
18446 | 1901 |
* Library: added theory Coinductive_List of potentially infinite lists |
1902 |
as greatest fixed-point. |
|
18399 | 1903 |
|
19254 | 1904 |
* Library: added theory AssocList which implements (finite) maps as |
19252 | 1905 |
association lists. |
17809
195045659c06
Tactics sat and satx reimplemented, several improvements
webertj
parents:
17806
diff
changeset
|
1906 |
|
24800 | 1907 |
* Method "evaluation" solves goals (i.e. a boolean expression) |
1908 |
efficiently by compiling it to ML. The goal is "proved" (via an |
|
1909 |
oracle) if it evaluates to True. |
|
20807 | 1910 |
|
1911 |
* Linear arithmetic now splits certain operators (e.g. min, max, abs) |
|
24800 | 1912 |
also when invoked by the simplifier. This results in the Simplifier |
1913 |
being more powerful on arithmetic goals. INCOMPATIBILITY. |
|
1914 |
Configuration option fast_arith_split_limit=0 recovers the old |
|
1915 |
behavior. |
|
20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
20188
diff
changeset
|
1916 |
|
22126 | 1917 |
* Support for hex (0x20) and binary (0b1001) numerals. |
19254 | 1918 |
|
20807 | 1919 |
* New method: reify eqs (t), where eqs are equations for an |
1920 |
interpretation I :: 'a list => 'b => 'c and t::'c is an optional |
|
1921 |
parameter, computes a term s::'b and a list xs::'a list and proves the |
|
1922 |
theorem I xs s = t. This is also known as reification or quoting. The |
|
1923 |
resulting theorem is applied to the subgoal to substitute t with I xs |
|
1924 |
s. If t is omitted, the subgoal itself is reified. |
|
1925 |
||
1926 |
* New method: reflection corr_thm eqs (t). The parameters eqs and (t) |
|
1927 |
are as explained above. corr_thm is a theorem for I vs (f t) = I vs t, |
|
1928 |
where f is supposed to be a computable function (in the sense of code |
|
1929 |
generattion). The method uses reify to compute s and xs as above then |
|
1930 |
applies corr_thm and uses normalization by evaluation to "prove" f s = |
|
1931 |
r and finally gets the theorem t = r, which is again applied to the |
|
25177 | 1932 |
subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy. |
1933 |
||
1934 |
* Reflection: Automatic reification now handels binding, an example is |
|
1935 |
available in src/HOL/ex/ReflectionEx.thy |
|
20807 | 1936 |
|
25397 | 1937 |
* HOL-Statespace: ``State Spaces: The Locale Way'' introduces a |
25409 | 1938 |
command 'statespace' that is similar to 'record', but introduces an |
25397 | 1939 |
abstract specification based on the locale infrastructure instead of |
1940 |
HOL types. This leads to extra flexibility in composing state spaces, |
|
1941 |
in particular multiple inheritance and renaming of components. |
|
1942 |
||
1943 |
||
19653 | 1944 |
*** HOL-Complex *** |
1945 |
||
22971 | 1946 |
* Hyperreal: Functions root and sqrt are now defined on negative real |
1947 |
inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x. |
|
1948 |
Nonnegativity side conditions have been removed from many lemmas, so |
|
1949 |
that more subgoals may now be solved by simplification; potential |
|
1950 |
INCOMPATIBILITY. |
|
1951 |
||
24800 | 1952 |
* Real: new type classes formalize real normed vector spaces and |
21791 | 1953 |
algebras, using new overloaded constants scaleR :: real => 'a => 'a |
1954 |
and norm :: 'a => real. |
|
1955 |
||
24800 | 1956 |
* Real: constant of_real :: real => 'a::real_algebra_1 injects from |
1957 |
reals into other types. The overloaded constant Reals :: 'a set is now |
|
1958 |
defined as range of_real; potential INCOMPATIBILITY. |
|
1959 |
||
1960 |
* Real: proper support for ML code generation, including 'quickcheck'. |
|
23013 | 1961 |
Reals are implemented as arbitrary precision rationals. |
1962 |
||
22126 | 1963 |
* Hyperreal: Several constants that previously worked only for the |
1964 |
reals have been generalized, so they now work over arbitrary vector |
|
1965 |
spaces. Type annotations may need to be added in some cases; potential |
|
1966 |
INCOMPATIBILITY. |
|
21791 | 1967 |
|
22972
3e96b98d37c6
generalized sgn function to work on any real normed vector space
huffman
parents:
22971
diff
changeset
|
1968 |
Infinitesimal :: ('a::real_normed_vector) star set |
3e96b98d37c6
generalized sgn function to work on any real normed vector space
huffman
parents:
22971
diff
changeset
|
1969 |
HFinite :: ('a::real_normed_vector) star set |
3e96b98d37c6
generalized sgn function to work on any real normed vector space
huffman
parents:
22971
diff
changeset
|
1970 |
HInfinite :: ('a::real_normed_vector) star set |
21791 | 1971 |
approx :: ('a::real_normed_vector) star => 'a star => bool |
1972 |
monad :: ('a::real_normed_vector) star => 'a star set |
|
1973 |
galaxy :: ('a::real_normed_vector) star => 'a star set |
|
22972
3e96b98d37c6
generalized sgn function to work on any real normed vector space
huffman
parents:
22971
diff
changeset
|
1974 |
(NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool |
21791 | 1975 |
(NS)convergent :: (nat => 'a::real_normed_vector) => bool |
1976 |
(NS)Bseq :: (nat => 'a::real_normed_vector) => bool |
|
1977 |
(NS)Cauchy :: (nat => 'a::real_normed_vector) => bool |
|
1978 |
(NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool |
|
1979 |
is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool |
|
1980 |
deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool |
|
22972
3e96b98d37c6
generalized sgn function to work on any real normed vector space
huffman
parents:
22971
diff
changeset
|
1981 |
sgn :: 'a::real_normed_vector => 'a |
23116 | 1982 |
exp :: 'a::{recpower,real_normed_field,banach} => 'a |
21791 | 1983 |
|
1984 |
* Complex: Some complex-specific constants are now abbreviations for |
|
22126 | 1985 |
overloaded ones: complex_of_real = of_real, cmod = norm, hcmod = |
1986 |
hnorm. Other constants have been entirely removed in favor of the |
|
1987 |
polymorphic versions (INCOMPATIBILITY): |
|
21791 | 1988 |
|
1989 |
approx <-- capprox |
|
1990 |
HFinite <-- CFinite |
|
1991 |
HInfinite <-- CInfinite |
|
1992 |
Infinitesimal <-- CInfinitesimal |
|
1993 |
monad <-- cmonad |
|
1994 |
galaxy <-- cgalaxy |
|
1995 |
(NS)LIM <-- (NS)CLIM, (NS)CRLIM |
|
1996 |
is(NS)Cont <-- is(NS)Contc, is(NS)contCR |
|
1997 |
(ns)deriv <-- (ns)cderiv |
|
1998 |
||
19653 | 1999 |
|
24801 | 2000 |
*** HOL-Algebra *** |
2001 |
||
2002 |
* Formalisation of ideals and the quotient construction over rings. |
|
2003 |
||
2004 |
* Order and lattice theory no longer based on records. |
|
2005 |
INCOMPATIBILITY. |
|
2006 |
||
2007 |
* Renamed lemmas least_carrier -> least_closed and greatest_carrier -> |
|
2008 |
greatest_closed. INCOMPATIBILITY. |
|
2009 |
||
2010 |
* Method algebra is now set up via an attribute. For examples see |
|
2011 |
Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations |
|
2012 |
of algebraic structures. |
|
2013 |
||
2014 |
* Renamed theory CRing to Ring. |
|
2015 |
||
2016 |
||
2017 |
*** HOL-Nominal *** |
|
2018 |
||
25148 | 2019 |
* Substantial, yet incomplete support for nominal datatypes (binding |
25177 | 2020 |
structures) based on HOL-Nominal logic. See src/HOL/Nominal and |
2021 |
src/HOL/Nominal/Examples. Prospective users should consult |
|
25148 | 2022 |
http://isabelle.in.tum.de/nominal/ |
2023 |
||
24801 | 2024 |
|
17878 | 2025 |
*** ML *** |
2026 |
||
24643 | 2027 |
* ML basics: just one true type int, which coincides with IntInf.int |
2028 |
(even on SML/NJ). |
|
2029 |
||
22138 | 2030 |
* ML within Isar: antiquotations allow to embed statically-checked |
2031 |
formal entities in the source, referring to the context available at |
|
2032 |
compile-time. For example: |
|
2033 |
||
25142 | 2034 |
ML {* @{sort "{zero,one}"} *} |
22138 | 2035 |
ML {* @{typ "'a => 'b"} *} |
2036 |
ML {* @{term "%x. x"} *} |
|
2037 |
ML {* @{prop "x == y"} *} |
|
2038 |
ML {* @{ctyp "'a => 'b"} *} |
|
2039 |
ML {* @{cterm "%x. x"} *} |
|
2040 |
ML {* @{cprop "x == y"} *} |
|
2041 |
ML {* @{thm asm_rl} *} |
|
2042 |
ML {* @{thms asm_rl} *} |
|
24692 | 2043 |
ML {* @{type_name c} *} |
25142 | 2044 |
ML {* @{type_syntax c} *} |
22376 | 2045 |
ML {* @{const_name c} *} |
2046 |
ML {* @{const_syntax c} *} |
|
22138 | 2047 |
ML {* @{context} *} |
2048 |
ML {* @{theory} *} |
|
2049 |
ML {* @{theory Pure} *} |
|
24692 | 2050 |
ML {* @{theory_ref} *} |
2051 |
ML {* @{theory_ref Pure} *} |
|
22138 | 2052 |
ML {* @{simpset} *} |
2053 |
ML {* @{claset} *} |
|
2054 |
ML {* @{clasimpset} *} |
|
2055 |
||
22151 | 2056 |
The same works for sources being ``used'' within an Isar context. |
2057 |
||
22152 | 2058 |
* ML in Isar: improved error reporting; extra verbosity with |
24706
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
2059 |
ML_Context.trace enabled. |
22152 | 2060 |
|
19032 | 2061 |
* Pure/General/table.ML: the join operations now works via exceptions |
24706
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
2062 |
DUP/SAME instead of type option. This is simpler in simple cases, and |
19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset
|
2063 |
admits slightly more efficient complex applications. |
18446 | 2064 |
|
24800 | 2065 |
* Pure: 'advanced' translation functions (parse_translation etc.) now |
2066 |
use Context.generic instead of just theory. |
|
2067 |
||
18642 | 2068 |
* Pure: datatype Context.generic joins theory/Proof.context and |
18644 | 2069 |
provides some facilities for code that works in either kind of |
18642 | 2070 |
context, notably GenericDataFun for uniform theory and proof data. |
2071 |
||
18737 | 2072 |
* Pure: simplified internal attribute type, which is now always |
24706
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
2073 |
Context.generic * thm -> Context.generic * thm. Global (theory) vs. |
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
2074 |
local (Proof.context) attributes have been discontinued, while |
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
2075 |
minimizing code duplication. Thm.rule_attribute and |
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
2076 |
Thm.declaration_attribute build canonical attributes; see also structure |
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
2077 |
Context for further operations on Context.generic, notably |
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
2078 |
GenericDataFun. INCOMPATIBILITY, need to adapt attribute type |
19006
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset
|
2079 |
declarations and definitions. |
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset
|
2080 |
|
24800 | 2081 |
* Context data interfaces (Theory/Proof/GenericDataFun): removed |
2082 |
name/print, uninitialized data defaults to ad-hoc copy of empty value, |
|
2083 |
init only required for impure data. INCOMPATIBILITY: empty really need |
|
2084 |
to be empty (no dependencies on theory content!) |
|
2085 |
||
19508 | 2086 |
* Pure/kernel: consts certification ignores sort constraints given in |
24800 | 2087 |
signature declarations. (This information is not relevant to the |
2088 |
logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE, |
|
2089 |
potential INCOMPATIBILITY. |
|
19508 | 2090 |
|
2091 |
* Pure: axiomatic type classes are now purely definitional, with |
|
2092 |
explicit proofs of class axioms and super class relations performed |
|
24706
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
2093 |
internally. See Pure/axclass.ML for the main internal interfaces -- |
19508 | 2094 |
notably AxClass.define_class supercedes AxClass.add_axclass, and |
24706
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
2095 |
AxClass.axiomatize_class/classrel/arity supersede |
19508 | 2096 |
Sign.add_classes/classrel/arities. |
2097 |
||
19006
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset
|
2098 |
* Pure/Isar: Args/Attrib parsers operate on Context.generic -- |
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset
|
2099 |
global/local versions on theory vs. Proof.context have been |
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset
|
2100 |
discontinued; Attrib.syntax and Method.syntax have been adapted |
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset
|
2101 |
accordingly. INCOMPATIBILITY, need to adapt parser expressions for |
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset
|
2102 |
attributes, methods, etc. |
18642 | 2103 |
|
18446 | 2104 |
* Pure: several functions of signature "... -> theory -> theory * ..." |
2105 |
have been reoriented to "... -> theory -> ... * theory" in order to |
|
2106 |
allow natural usage in combination with the ||>, ||>>, |-> and |
|
2107 |
fold_map combinators. |
|
18051 | 2108 |
|
21647
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset
|
2109 |
* Pure: official theorem names (closed derivations) and additional |
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset
|
2110 |
comments (tags) are now strictly separate. Name hints -- which are |
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset
|
2111 |
maintained as tags -- may be attached any time without affecting the |
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset
|
2112 |
derivation. |
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset
|
2113 |
|
18020 | 2114 |
* Pure: primitive rule lift_rule now takes goal cterm instead of an |
18145 | 2115 |
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to |
18020 | 2116 |
achieve the old behaviour. |
2117 |
||
2118 |
* Pure: the "Goal" constant is now called "prop", supporting a |
|
2119 |
slightly more general idea of ``protecting'' meta-level rule |
|
2120 |
statements. |
|
2121 |
||
20040
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
2122 |
* Pure: Logic.(un)varify only works in a global context, which is now |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
2123 |
enforced instead of silently assumed. INCOMPATIBILITY, may use |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
2124 |
Logic.legacy_(un)varify as temporary workaround. |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
2125 |
|
20090 | 2126 |
* Pure: structure Name provides scalable operations for generating |
2127 |
internal variable names, notably Name.variants etc. This replaces |
|
2128 |
some popular functions from term.ML: |
|
2129 |
||
2130 |
Term.variant -> Name.variant |
|
24800 | 2131 |
Term.variantlist -> Name.variant_list |
20090 | 2132 |
Term.invent_names -> Name.invent_list |
2133 |
||
2134 |
Note that low-level renaming rarely occurs in new code -- operations |
|
2135 |
from structure Variable are used instead (see below). |
|
2136 |
||
20040
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
2137 |
* Pure: structure Variable provides fundamental operations for proper |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
2138 |
treatment of fixed/schematic variables in a context. For example, |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
2139 |
Variable.import introduces fixes for schematics of given facts and |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
2140 |
Variable.export reverses the effect (up to renaming) -- this replaces |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
2141 |
various freeze_thaw operations. |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
2142 |
|
18567 | 2143 |
* Pure: structure Goal provides simple interfaces for |
17981
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset
|
2144 |
init/conclude/finish and tactical prove operations (replacing former |
20040
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
2145 |
Tactic.prove). Goal.prove is the canonical way to prove results |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
2146 |
within a given context; Goal.prove_global is a degraded version for |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
2147 |
theory level goals, including a global Drule.standard. Note that |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
2148 |
OldGoals.prove_goalw_cterm has long been obsolete, since it is |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
2149 |
ill-behaved in a local proof context (e.g. with local fixes/assumes or |
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset
|
2150 |
in a locale context). |
17981
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset
|
2151 |
|
24706
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
2152 |
* Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.) |
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
2153 |
and type checking (Syntax.check_term etc.), with common combinations |
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
2154 |
(Syntax.read_term etc.). These supersede former Sign.read_term etc. |
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
2155 |
which are considered legacy and await removal. |
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
2156 |
|
24920 | 2157 |
* Pure/Syntax: generic interfaces for type unchecking |
2158 |
(Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.), |
|
2159 |
with common combinations (Syntax.pretty_term, Syntax.string_of_term |
|
2160 |
etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still |
|
24924 | 2161 |
available for convenience, but refer to the very same operations using |
2162 |
a mere theory instead of a full context. |
|
24920 | 2163 |
|
18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
2164 |
* Isar: simplified treatment of user-level errors, using exception |
18687 | 2165 |
ERROR of string uniformly. Function error now merely raises ERROR, |
18686
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
2166 |
without any side effect on output channels. The Isar toplevel takes |
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
2167 |
care of proper display of ERROR exceptions. ML code may use plain |
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
2168 |
handle/can/try; cat_error may be used to concatenate errors like this: |
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
2169 |
|
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
2170 |
... handle ERROR msg => cat_error msg "..." |
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
2171 |
|
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
2172 |
Toplevel ML code (run directly or through the Isar toplevel) may be |
18687 | 2173 |
embedded into the Isar toplevel with exception display/debug like |
2174 |
this: |
|
18686
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
2175 |
|
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
2176 |
Isar.toplevel (fn () => ...) |
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
2177 |
|
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
2178 |
INCOMPATIBILITY, removed special transform_error facilities, removed |
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
2179 |
obsolete variants of user-level exceptions (ERROR_MESSAGE, |
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
2180 |
Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL) |
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
2181 |
-- use plain ERROR instead. |
cbbc71acf994
* ML/Isar: simplified treatment of user-level errors;
wenzelm
parents:
18674
diff
changeset
|
2182 |
|
18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
2183 |
* Isar: theory setup now has type (theory -> theory), instead of a |
18722
0888eca0f1be
* ML/Isar: theory setup has type (theory -> theory);
wenzelm
parents:
18696
diff
changeset
|
2184 |
list. INCOMPATIBILITY, may use #> to compose setup functions. |
0888eca0f1be
* ML/Isar: theory setup has type (theory -> theory);
wenzelm
parents:
18696
diff
changeset
|
2185 |
|
24706
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
2186 |
* Isar: ML toplevel pretty printer for type Proof.context, subject to |
c58547ff329b
* Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm
parents:
24699
diff
changeset
|
2187 |
ProofContext.debug/verbose flags. |
18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
2188 |
|
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
2189 |
* Isar: Toplevel.theory_to_proof admits transactions that modify the |
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
2190 |
theory before entering a proof state. Transactions now always see a |
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset
|
2191 |
quasi-functional intermediate checkpoint, both in interactive and |
18590
f6a553aa3d81
Pure/Isar: Toplevel.theory_to_proof admits transactions that modify the theory;
wenzelm
parents:
18568
diff
changeset
|
2192 |
batch mode. |
18567 | 2193 |
|
24867 | 2194 |
* Isar: simplified interfaces for outer syntax. Renamed |
2195 |
OuterSyntax.add_keywords to OuterSyntax.keywords. Removed |
|
2196 |
OuterSyntax.add_parsers -- this functionality is now included in |
|
2197 |
OuterSyntax.command etc. INCOMPATIBILITY. |
|
2198 |
||
17878 | 2199 |
* Simplifier: the simpset of a running simplification process now |
2200 |
contains a proof context (cf. Simplifier.the_context), which is the |
|
2201 |
very context that the initial simpset has been retrieved from (by |
|
17890 | 2202 |
simpset_of/local_simpset_of). Consequently, all plug-in components |
17878 | 2203 |
(solver, looper etc.) may depend on arbitrary proof data. |
2204 |
||
2205 |
* Simplifier.inherit_context inherits the proof context (plus the |
|
2206 |
local bounds) of the current simplification process; any simproc |
|
2207 |
etc. that calls the Simplifier recursively should do this! Removed |
|
2208 |
former Simplifier.inherit_bounds, which is already included here -- |
|
17890 | 2209 |
INCOMPATIBILITY. Tools based on low-level rewriting may even have to |
2210 |
specify an explicit context using Simplifier.context/theory_context. |
|
17878 | 2211 |
|
2212 |
* Simplifier/Classical Reasoner: more abstract interfaces |
|
2213 |
change_simpset/claset for modifying the simpset/claset reference of a |
|
2214 |
theory; raw versions simpset/claset_ref etc. have been discontinued -- |
|
2215 |
INCOMPATIBILITY. |
|
2216 |
||
18540 | 2217 |
* Provers: more generic wrt. syntax of object-logics, avoid hardwired |
2218 |
"Trueprop" etc. |
|
2219 |
||
17878 | 2220 |
|
20988
0887d0dd3210
* isabelle-process: option -S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset
|
2221 |
*** System *** |
0887d0dd3210
* isabelle-process: option -S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset
|
2222 |
|
25433 | 2223 |
* settings: the default heap location within ISABELLE_HOME_USER now |
2224 |
includes ISABELLE_IDENTIFIER. This simplifies use of multiple |
|
2225 |
Isabelle installations. |
|
21471
03a5ef1936c5
* settings: ML_IDENTIFIER includes the Isabelle version identifier;
wenzelm
parents:
21462
diff
changeset
|
2226 |
|
20988
0887d0dd3210
* isabelle-process: option -S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset
|
2227 |
* isabelle-process: option -S (secure mode) disables some critical |
0887d0dd3210
* isabelle-process: option -S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset
|
2228 |
operations, notably runtime compilation and evaluation of ML source |
0887d0dd3210
* isabelle-process: option -S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset
|
2229 |
code. |
0887d0dd3210
* isabelle-process: option -S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset
|
2230 |
|
24891 | 2231 |
* Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/. |
2232 |
||
24801 | 2233 |
* Support for parallel execution, using native multicore support of |
24800 | 2234 |
Poly/ML 5.1. The theory loader exploits parallelism when processing |
2235 |
independent theories, according to the given theory header |
|
2236 |
specifications. The maximum number of worker threads is specified via |
|
2237 |
usedir option -M or the "max-threads" setting in Proof General. A |
|
2238 |
speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up |
|
2239 |
to 6 on a 8-core machine. User-code needs to observe certain |
|
2240 |
guidelines for thread-safe programming, see appendix A in the Isar |
|
2241 |
Implementation manual. |
|
24210
a865059c4fcb
* Experimental support for multithreading, using Poly/ML 5.1;
wenzelm
parents:
24187
diff
changeset
|
2242 |
|
17754
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset
|
2243 |
|
25448 | 2244 |
|
17720 | 2245 |
New in Isabelle2005 (October 2005) |
2246 |
---------------------------------- |
|
14655
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset
|
2247 |
|
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset
|
2248 |
*** General *** |
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset
|
2249 |
|
15130 | 2250 |
* Theory headers: the new header syntax for Isar theories is |
2251 |
||
2252 |
theory <name> |
|
16234 | 2253 |
imports <theory1> ... <theoryN> |
2254 |
uses <file1> ... <fileM> |
|
15130 | 2255 |
begin |
2256 |
||
16234 | 2257 |
where the 'uses' part is optional. The previous syntax |
2258 |
||
2259 |
theory <name> = <theory1> + ... + <theoryN>: |
|
2260 |
||
16717 | 2261 |
will disappear in the next release. Use isatool fixheaders to convert |
2262 |
existing theory files. Note that there is no change in ancient |
|
17371 | 2263 |
non-Isar theories now, but these will disappear soon. |
15130 | 2264 |
|
15475
fdf9434b04ea
- Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset
|
2265 |
* Theory loader: parent theories can now also be referred to via |
16234 | 2266 |
relative and absolute paths. |
2267 |
||
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
2268 |
* Command 'find_theorems' searches for a list of criteria instead of a |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
2269 |
list of constants. Known criteria are: intro, elim, dest, name:string, |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
2270 |
simp:term, and any term. Criteria can be preceded by '-' to select |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
2271 |
theorems that do not match. Intro, elim, dest select theorems that |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
2272 |
match the current goal, name:s selects theorems whose fully qualified |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
2273 |
name contain s, and simp:term selects all simplification rules whose |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
2274 |
lhs match term. Any other term is interpreted as pattern and selects |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
2275 |
all theorems matching the pattern. Available in ProofGeneral under |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
2276 |
'ProofGeneral -> Find Theorems' or C-c C-f. Example: |
16234 | 2277 |
|
17275
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
2278 |
C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL." |
16234 | 2279 |
|
2280 |
prints the last 100 theorems matching the pattern "(_::nat) + _ + _", |
|
2281 |
matching the current goal as introduction rule and not having "HOL." |
|
2282 |
in their name (i.e. not being defined in theory HOL). |
|
16013
3010430d894d
removed find_rewrites (superceded by improved thms_containing);
wenzelm
parents:
16000
diff
changeset
|
2283 |
|
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
2284 |
* Command 'thms_containing' has been discontinued in favour of |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
2285 |
'find_theorems'; INCOMPATIBILITY. |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
2286 |
|
17385 | 2287 |
* Communication with Proof General is now 8bit clean, which means that |
2288 |
Unicode text in UTF-8 encoding may be used within theory texts (both |
|
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
2289 |
formal and informal parts). Cf. option -U of the Isabelle Proof |
17538 | 2290 |
General interface. Here are some simple examples (cf. src/HOL/ex): |
2291 |
||
2292 |
http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html |
|
2293 |
http://isabelle.in.tum.de/library/HOL/ex/Chinese.html |
|
17385 | 2294 |
|
17425 | 2295 |
* Improved efficiency of the Simplifier and, to a lesser degree, the |
2296 |
Classical Reasoner. Typical big applications run around 2 times |
|
2297 |
faster. |
|
2298 |
||
15703 | 2299 |
|
2300 |
*** Document preparation *** |
|
2301 |
||
16234 | 2302 |
* Commands 'display_drafts' and 'print_drafts' perform simple output |
2303 |
of raw sources. Only those symbols that do not require additional |
|
2304 |
LaTeX packages (depending on comments in isabellesym.sty) are |
|
2305 |
displayed properly, everything else is left verbatim. isatool display |
|
2306 |
and isatool print are used as front ends (these are subject to the |
|
2307 |
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). |
|
2308 |
||
17047
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
2309 |
* Command tags control specific markup of certain regions of text, |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
2310 |
notably folding and hiding. Predefined tags include "theory" (for |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
2311 |
theory begin and end), "proof" for proof commands, and "ML" for |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
2312 |
commands involving ML code; the additional tags "visible" and |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
2313 |
"invisible" are unused by default. Users may give explicit tag |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
2314 |
specifications in the text, e.g. ''by %invisible (auto)''. The |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
2315 |
interpretation of tags is determined by the LaTeX job during document |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
2316 |
preparation: see option -V of isatool usedir, or options -n and -t of |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
2317 |
isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag, |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
2318 |
\isadroptag. |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
2319 |
|
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
2320 |
Several document versions may be produced at the same time via isatool |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
2321 |
usedir (the generated index.html will link all of them). Typical |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
2322 |
specifications include ''-V document=theory,proof,ML'' to present |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
2323 |
theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
2324 |
proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
2325 |
these parts without any formal replacement text. The Isabelle site |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
2326 |
default settings produce ''document'' and ''outline'' versions as |
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir -H);
wenzelm
parents:
17016
diff
changeset
|
2327 |
specified above. |
16234 | 2328 |
|
17402 | 2329 |
* Several new antiquotations: |
15979 | 2330 |
|
2331 |
@{term_type term} prints a term with its type annotated; |
|
2332 |
||
2333 |
@{typeof term} prints the type of a term; |
|
2334 |
||
16234 | 2335 |
@{const const} is the same as @{term const}, but checks that the |
2336 |
argument is a known logical constant; |
|
15979 | 2337 |
|
2338 |
@{term_style style term} and @{thm_style style thm} print a term or |
|
16234 | 2339 |
theorem applying a "style" to it |
2340 |
||
17117
e2bed9e82454
* The ML antiquotation prints type-checked ML expressions verbatim.
wenzelm
parents:
17097
diff
changeset
|
2341 |
@{ML text} |
e2bed9e82454
* The ML antiquotation prints type-checked ML expressions verbatim.
wenzelm
parents:
17097
diff
changeset
|
2342 |
|
16234 | 2343 |
Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of |
2344 |
definitions, equations, inequations etc., 'concl' printing only the |
|
17393 | 2345 |
conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19' |
16234 | 2346 |
to print the specified premise. TermStyle.add_style provides an ML |
2347 |
interface for introducing further styles. See also the "LaTeX Sugar" |
|
17117
e2bed9e82454
* The ML antiquotation prints type-checked ML expressions verbatim.
wenzelm
parents:
17097
diff
changeset
|
2348 |
document practical applications. The ML antiquotation prints |
e2bed9e82454
* The ML antiquotation prints type-checked ML expressions verbatim.
wenzelm
parents:
17097
diff
changeset
|
2349 |
type-checked ML expressions verbatim. |
16234 | 2350 |
|
17259
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset
|
2351 |
* Markup commands 'chapter', 'section', 'subsection', 'subsubsection', |
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset
|
2352 |
and 'text' support optional locale specification '(in loc)', which |
17269 | 2353 |
specifies the default context for interpreting antiquotations. For |
2354 |
example: 'text (in lattice) {* @{thm inf_assoc}*}'. |
|
17259
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset
|
2355 |
|
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset
|
2356 |
* Option 'locale=NAME' of antiquotations specifies an alternative |
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset
|
2357 |
context interpreting the subsequent argument. For example: @{thm |
17269 | 2358 |
[locale=lattice] inf_assoc}. |
17259
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset
|
2359 |
|
17097
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset
|
2360 |
* Proper output of proof terms (@{prf ...} and @{full_prf ...}) within |
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset
|
2361 |
a proof context. |
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset
|
2362 |
|
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset
|
2363 |
* Proper output of antiquotations for theory commands involving a |
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset
|
2364 |
proof context (such as 'locale' or 'theorem (in loc) ...'). |
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset
|
2365 |
|
17193
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset
|
2366 |
* Delimiters of outer tokens (string etc.) now produce separate LaTeX |
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset
|
2367 |
macros (\isachardoublequoteopen, isachardoublequoteclose etc.). |
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset
|
2368 |
|
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset
|
2369 |
* isatool usedir: new option -C (default true) controls whether option |
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset
|
2370 |
-D should include a copy of the original document directory; -C false |
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset
|
2371 |
prevents unwanted effects such as copying of administrative CVS data. |
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset
|
2372 |
|
16234 | 2373 |
|
2374 |
*** Pure *** |
|
2375 |
||
2376 |
* Considerably improved version of 'constdefs' command. Now performs |
|
2377 |
automatic type-inference of declared constants; additional support for |
|
2378 |
local structure declarations (cf. locales and HOL records), see also |
|
2379 |
isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly |
|
2380 |
sequential dependencies of definitions within a single 'constdefs' |
|
2381 |
section; moreover, the declared name needs to be an identifier. If |
|
2382 |
all fails, consider to fall back on 'consts' and 'defs' separately. |
|
2383 |
||
2384 |
* Improved indexed syntax and implicit structures. First of all, |
|
2385 |
indexed syntax provides a notational device for subscripted |
|
2386 |
application, using the new syntax \<^bsub>term\<^esub> for arbitrary |
|
2387 |
expressions. Secondly, in a local context with structure |
|
2388 |
declarations, number indexes \<^sub>n or the empty index (default |
|
2389 |
number 1) refer to a certain fixed variable implicitly; option |
|
2390 |
show_structs controls printing of implicit structures. Typical |
|
2391 |
applications of these concepts involve record types and locales. |
|
2392 |
||
2393 |
* New command 'no_syntax' removes grammar declarations (and |
|
2394 |
translations) resulting from the given syntax specification, which is |
|
2395 |
interpreted in the same manner as for the 'syntax' command. |
|
2396 |
||
2397 |
* 'Advanced' translation functions (parse_translation etc.) may depend |
|
2398 |
on the signature of the theory context being presently used for |
|
2399 |
parsing/printing, see also isar-ref manual. |
|
2400 |
||
16856 | 2401 |
* Improved 'oracle' command provides a type-safe interface to turn an |
2402 |
ML expression of type theory -> T -> term into a primitive rule of |
|
2403 |
type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle |
|
2404 |
is already included here); see also FOL/ex/IffExample.thy; |
|
2405 |
INCOMPATIBILITY. |
|
2406 |
||
17275
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
2407 |
* axclass: name space prefix for class "c" is now "c_class" (was "c" |
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
2408 |
before); "cI" is no longer bound, use "c.intro" instead. |
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
2409 |
INCOMPATIBILITY. This change avoids clashes of fact bindings for |
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
2410 |
axclasses vs. locales. |
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
2411 |
|
16234 | 2412 |
* Improved internal renaming of symbolic identifiers -- attach primes |
2413 |
instead of base 26 numbers. |
|
2414 |
||
2415 |
* New flag show_question_marks controls printing of leading question |
|
2416 |
marks in schematic variable names. |
|
2417 |
||
2418 |
* In schematic variable names, *any* symbol following \<^isub> or |
|
2419 |
\<^isup> is now treated as part of the base name. For example, the |
|
2420 |
following works without printing of awkward ".0" indexes: |
|
2421 |
||
2422 |
lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1" |
|
2423 |
by simp |
|
2424 |
||
2425 |
* Inner syntax includes (*(*nested*) comments*). |
|
2426 |
||
17548 | 2427 |
* Pretty printer now supports unbreakable blocks, specified in mixfix |
16234 | 2428 |
annotations as "(00...)". |
2429 |
||
2430 |
* Clear separation of logical types and nonterminals, where the latter |
|
2431 |
may only occur in 'syntax' specifications or type abbreviations. |
|
2432 |
Before that distinction was only partially implemented via type class |
|
2433 |
"logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper |
|
2434 |
use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very |
|
2435 |
exotic syntax specifications may require further adaption |
|
17691 | 2436 |
(e.g. Cube/Cube.thy). |
16234 | 2437 |
|
2438 |
* Removed obsolete type class "logic", use the top sort {} instead. |
|
2439 |
Note that non-logical types should be declared as 'nonterminals' |
|
2440 |
rather than 'types'. INCOMPATIBILITY for new object-logic |
|
2441 |
specifications. |
|
2442 |
||
17095 | 2443 |
* Attributes 'induct' and 'cases': type or set names may now be |
2444 |
locally fixed variables as well. |
|
2445 |
||
16234 | 2446 |
* Simplifier: can now control the depth to which conditional rewriting |
2447 |
is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth |
|
2448 |
Limit. |
|
2449 |
||
2450 |
* Simplifier: simplification procedures may now take the current |
|
2451 |
simpset into account (cf. Simplifier.simproc(_i) / mk_simproc |
|
2452 |
interface), which is very useful for calling the Simplifier |
|
2453 |
recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs |
|
2454 |
is gone -- use prems_of_ss on the simpset instead. Moreover, the |
|
2455 |
low-level mk_simproc no longer applies Logic.varify internally, to |
|
2456 |
allow for use in a context of fixed variables. |
|
2457 |
||
2458 |
* thin_tac now works even if the assumption being deleted contains !! |
|
2459 |
or ==>. More generally, erule now works even if the major premise of |
|
2460 |
the elimination rule contains !! or ==>. |
|
2461 |
||
17597 | 2462 |
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. |
17590 | 2463 |
|
16234 | 2464 |
* Reorganized bootstrapping of the Pure theories; CPure is now derived |
2465 |
from Pure, which contains all common declarations already. Both |
|
2466 |
theories are defined via plain Isabelle/Isar .thy files. |
|
2467 |
INCOMPATIBILITY: elements of CPure (such as the CPure.intro / |
|
2468 |
CPure.elim / CPure.dest attributes) now appear in the Pure name space; |
|
2469 |
use isatool fixcpure to adapt your theory and ML sources. |
|
2470 |
||
2471 |
* New syntax 'name(i-j, i-, i, ...)' for referring to specific |
|
2472 |
selections of theorems in named facts via index ranges. |
|
2473 |
||
17097
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset
|
2474 |
* 'print_theorems': in theory mode, really print the difference |
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset
|
2475 |
wrt. the last state (works for interactive theory development only), |
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset
|
2476 |
in proof mode print all local facts (cf. 'print_facts'); |
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset
|
2477 |
|
17397 | 2478 |
* 'hide': option '(open)' hides only base names. |
2479 |
||
17275
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
2480 |
* More efficient treatment of intermediate checkpoints in interactive |
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
2481 |
theory development. |
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
2482 |
|
17663
28be54ff74f8
Added entries for code_module, code_library, and value.
berghofe
parents:
17641
diff
changeset
|
2483 |
* Code generator is now invoked via code_module (incremental code |
17664 | 2484 |
generation) and code_library (modular code generation, ML structures |
2485 |
for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains' |
|
2486 |
must be quoted when used as identifiers. |
|
2487 |
||
2488 |
* New 'value' command for reading, evaluating and printing terms using |
|
2489 |
the code generator. INCOMPATIBILITY: command keyword 'value' must be |
|
2490 |
quoted when used as identifier. |
|
17663
28be54ff74f8
Added entries for code_module, code_library, and value.
berghofe
parents:
17641
diff
changeset
|
2491 |
|
16234 | 2492 |
|
2493 |
*** Locales *** |
|
17095 | 2494 |
|
17385 | 2495 |
* New commands for the interpretation of locale expressions in |
2496 |
theories (1), locales (2) and proof contexts (3). These generate |
|
2497 |
proof obligations from the expression specification. After the |
|
2498 |
obligations have been discharged, theorems of the expression are added |
|
2499 |
to the theory, target locale or proof context. The synopsis of the |
|
2500 |
commands is a follows: |
|
2501 |
||
17095 | 2502 |
(1) interpretation expr inst |
2503 |
(2) interpretation target < expr |
|
2504 |
(3) interpret expr inst |
|
17385 | 2505 |
|
17095 | 2506 |
Interpretation in theories and proof contexts require a parameter |
2507 |
instantiation of terms from the current context. This is applied to |
|
17385 | 2508 |
specifications and theorems of the interpreted expression. |
2509 |
Interpretation in locales only permits parameter renaming through the |
|
2510 |
locale expression. Interpretation is smart in that interpretations |
|
2511 |
that are active already do not occur in proof obligations, neither are |
|
2512 |
instantiated theorems stored in duplicate. Use 'print_interps' to |
|
2513 |
inspect active interpretations of a particular locale. For details, |
|
17436 | 2514 |
see the Isar Reference manual. Examples can be found in |
2515 |
HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy. |
|
16234 | 2516 |
|
2517 |
INCOMPATIBILITY: former 'instantiate' has been withdrawn, use |
|
2518 |
'interpret' instead. |
|
2519 |
||
17385 | 2520 |
* New context element 'constrains' for adding type constraints to |
2521 |
parameters. |
|
2522 |
||
2523 |
* Context expressions: renaming of parameters with syntax |
|
2524 |
redeclaration. |
|
17095 | 2525 |
|
2526 |
* Locale declaration: 'includes' disallowed. |
|
2527 |
||
16234 | 2528 |
* Proper static binding of attribute syntax -- i.e. types / terms / |
2529 |
facts mentioned as arguments are always those of the locale definition |
|
2530 |
context, independently of the context of later invocations. Moreover, |
|
2531 |
locale operations (renaming and type / term instantiation) are applied |
|
2532 |
to attribute arguments as expected. |
|
2533 |
||
2534 |
INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of |
|
2535 |
actual attributes; rare situations may require Attrib.attribute to |
|
2536 |
embed those attributes into Attrib.src that lack concrete syntax. |
|
2537 |
Attribute implementations need to cooperate properly with the static |
|
2538 |
binding mechanism. Basic parsers Args.XXX_typ/term/prop and |
|
2539 |
Attrib.XXX_thm etc. already do the right thing without further |
|
2540 |
intervention. Only unusual applications -- such as "where" or "of" |
|
2541 |
(cf. src/Pure/Isar/attrib.ML), which process arguments depending both |
|
2542 |
on the context and the facts involved -- may have to assign parsed |
|
2543 |
values to argument tokens explicitly. |
|
2544 |
||
2545 |
* Changed parameter management in theorem generation for long goal |
|
2546 |
statements with 'includes'. INCOMPATIBILITY: produces a different |
|
2547 |
theorem statement in rare situations. |
|
2548 |
||
17228 | 2549 |
* Locale inspection command 'print_locale' omits notes elements. Use |
2550 |
'print_locale!' to have them included in the output. |
|
2551 |
||
16234 | 2552 |
|
2553 |
*** Provers *** |
|
2554 |
||
2555 |
* Provers/hypsubst.ML: improved version of the subst method, for |
|
2556 |
single-step rewriting: it now works in bound variable contexts. New is |
|
2557 |
'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may |
|
2558 |
rewrite a different subterm than the original subst method, which is |
|
2559 |
still available as 'simplesubst'. |
|
2560 |
||
2561 |
* Provers/quasi.ML: new transitivity reasoners for transitivity only |
|
2562 |
and quasi orders. |
|
2563 |
||
2564 |
* Provers/trancl.ML: new transitivity reasoner for transitive and |
|
2565 |
reflexive-transitive closure of relations. |
|
2566 |
||
2567 |
* Provers/blast.ML: new reference depth_limit to make blast's depth |
|
2568 |
limit (previously hard-coded with a value of 20) user-definable. |
|
2569 |
||
2570 |
* Provers/simplifier.ML has been moved to Pure, where Simplifier.setup |
|
2571 |
is peformed already. Object-logics merely need to finish their |
|
2572 |
initial simpset configuration as before. INCOMPATIBILITY. |
|
15703 | 2573 |
|
15475
fdf9434b04ea
- Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset
|
2574 |
|
14700
2f885b7e5ba7
reimplementation of HOL records; only one type is created for
schirmer
parents:
14699
diff
changeset
|
2575 |
*** HOL *** |
2f885b7e5ba7
reimplementation of HOL records; only one type is created for
schirmer
parents:
14699
diff
changeset
|
2576 |
|
16234 | 2577 |
* Symbolic syntax of Hilbert Choice Operator is now as follows: |
14878 | 2578 |
|
2579 |
syntax (epsilon) |
|
2580 |
"_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10) |
|
2581 |
||
16234 | 2582 |
The symbol \<some> is displayed as the alternative epsilon of LaTeX |
2583 |
and x-symbol; use option '-m epsilon' to get it actually printed. |
|
2584 |
Moreover, the mathematically important symbolic identifier \<epsilon> |
|
2585 |
becomes available as variable, constant etc. INCOMPATIBILITY, |
|
2586 |
||
2587 |
* "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x". |
|
2588 |
Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >= |
|
17371 | 2589 |
is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to |
17016
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset
|
2590 |
support corresponding Isar calculations. |
16234 | 2591 |
|
2592 |
* "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>" |
|
2593 |
instead of ":". |
|
2594 |
||
2595 |
* theory SetInterval: changed the syntax for open intervals: |
|
2596 |
||
2597 |
Old New |
|
2598 |
{..n(} {..<n} |
|
2599 |
{)n..} {n<..} |
|
2600 |
{m..n(} {m..<n} |
|
2601 |
{)m..n} {m<..n} |
|
2602 |
{)m..n(} {m<..<n} |
|
2603 |
||
2604 |
The old syntax is still supported but will disappear in the next |
|
2605 |
release. For conversion use the following Emacs search and replace |
|
2606 |
patterns (these are not perfect but work quite well): |
|
15046 | 2607 |
|
2608 |
{)\([^\.]*\)\.\. -> {\1<\.\.} |
|
2609 |
\.\.\([^(}]*\)(} -> \.\.<\1} |
|
2610 |
||
17533 | 2611 |
* Theory Commutative_Ring (in Library): method comm_ring for proving |
2612 |
equalities in commutative rings; method 'algebra' provides a generic |
|
2613 |
interface. |
|
17389
b4743198b939
Method comm_ring for proving equalities in commutative rings.
wenzelm
parents:
17385
diff
changeset
|
2614 |
|
b4743198b939
Method comm_ring for proving equalities in commutative rings.
wenzelm
parents:
17385
diff
changeset
|
2615 |
* Theory Finite_Set: changed the syntax for 'setsum', summation over |
16234 | 2616 |
finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is |
17371 | 2617 |
now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can |
17189 | 2618 |
be a tuple pattern. |
16234 | 2619 |
|
2620 |
Some new syntax forms are available: |
|
2621 |
||
2622 |
"\<Sum>x | P. e" for "setsum (%x. e) {x. P}" |
|
2623 |
"\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}" |
|
2624 |
"\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}" |
|
2625 |
"\<Sum>x < k. e" for "setsum (%x. e) {..<k}" |
|
2626 |
||
2627 |
The latter form "\<Sum>x < k. e" used to be based on a separate |
|
2628 |
function "Summation", which has been discontinued. |
|
2629 |
||
2630 |
* theory Finite_Set: in structured induction proofs, the insert case |
|
2631 |
is now 'case (insert x F)' instead of the old counterintuitive 'case |
|
2632 |
(insert F x)'. |
|
2633 |
||
2634 |
* The 'refute' command has been extended to support a much larger |
|
2635 |
fragment of HOL, including axiomatic type classes, constdefs and |
|
2636 |
typedefs, inductive datatypes and recursion. |
|
2637 |
||
17700 | 2638 |
* New tactics 'sat' and 'satx' to prove propositional tautologies. |
2639 |
Requires zChaff with proof generation to be installed. See |
|
2640 |
HOL/ex/SAT_Examples.thy for examples. |
|
17619 | 2641 |
|
16234 | 2642 |
* Datatype induction via method 'induct' now preserves the name of the |
2643 |
induction variable. For example, when proving P(xs::'a list) by |
|
2644 |
induction on xs, the induction step is now P(xs) ==> P(a#xs) rather |
|
2645 |
than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY |
|
2646 |
in unstructured proof scripts. |
|
2647 |
||
2648 |
* Reworked implementation of records. Improved scalability for |
|
2649 |
records with many fields, avoiding performance problems for type |
|
2650 |
inference. Records are no longer composed of nested field types, but |
|
2651 |
of nested extension types. Therefore the record type only grows linear |
|
2652 |
in the number of extensions and not in the number of fields. The |
|
2653 |
top-level (users) view on records is preserved. Potential |
|
2654 |
INCOMPATIBILITY only in strange cases, where the theory depends on the |
|
2655 |
old record representation. The type generated for a record is called |
|
2656 |
<record_name>_ext_type. |
|
2657 |
||
2658 |
Flag record_quick_and_dirty_sensitive can be enabled to skip the |
|
2659 |
proofs triggered by a record definition or a simproc (if |
|
2660 |
quick_and_dirty is enabled). Definitions of large records can take |
|
2661 |
quite long. |
|
2662 |
||
2663 |
New simproc record_upd_simproc for simplification of multiple record |
|
2664 |
updates enabled by default. Moreover, trivial updates are also |
|
2665 |
removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break |
|
2666 |
occasionally, since simplification is more powerful by default. |
|
2667 |
||
17275
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
2668 |
* typedef: proper support for polymorphic sets, which contain extra |
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
2669 |
type-variables in the term. |
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset
|
2670 |
|
16234 | 2671 |
* Simplifier: automatically reasons about transitivity chains |
2672 |
involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics |
|
2673 |
provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY: |
|
2674 |
old proofs break occasionally as simplification may now solve more |
|
2675 |
goals than previously. |
|
2676 |
||
2677 |
* Simplifier: converts x <= y into x = y if assumption y <= x is |
|
2678 |
present. Works for all partial orders (class "order"), in particular |
|
2679 |
numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y |
|
2680 |
just like y <= x. |
|
2681 |
||
2682 |
* Simplifier: new simproc for "let x = a in f x". If a is a free or |
|
2683 |
bound variable or a constant then the let is unfolded. Otherwise |
|
2684 |
first a is simplified to b, and then f b is simplified to g. If |
|
2685 |
possible we abstract b from g arriving at "let x = b in h x", |
|
2686 |
otherwise we unfold the let and arrive at g. The simproc can be |
|
2687 |
enabled/disabled by the reference use_let_simproc. Potential |
|
2688 |
INCOMPATIBILITY since simplification is more powerful by default. |
|
15776 | 2689 |
|
16563 | 2690 |
* Classical reasoning: the meson method now accepts theorems as arguments. |
2691 |
||
17595 | 2692 |
* Prover support: pre-release of the Isabelle-ATP linkup, which runs background |
2693 |
jobs to provide advice on the provability of subgoals. |
|
2694 |
||
16891 | 2695 |
* Theory OrderedGroup and Ring_and_Field: various additions and |
2696 |
improvements to faciliate calculations involving equalities and |
|
2697 |
inequalities. |
|
2698 |
||
2699 |
The following theorems have been eliminated or modified |
|
2700 |
(INCOMPATIBILITY): |
|
16888 | 2701 |
|
2702 |
abs_eq now named abs_of_nonneg |
|
17371 | 2703 |
abs_of_ge_0 now named abs_of_nonneg |
2704 |
abs_minus_eq now named abs_of_nonpos |
|
16888 | 2705 |
imp_abs_id now named abs_of_nonneg |
2706 |
imp_abs_neg_id now named abs_of_nonpos |
|
2707 |
mult_pos now named mult_pos_pos |
|
2708 |
mult_pos_le now named mult_nonneg_nonneg |
|
2709 |
mult_pos_neg_le now named mult_nonneg_nonpos |
|
2710 |
mult_pos_neg2_le now named mult_nonneg_nonpos2 |
|
2711 |
mult_neg now named mult_neg_neg |
|
2712 |
mult_neg_le now named mult_nonpos_nonpos |
|
2713 |
||
23495
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
2714 |
* The following lemmas in Ring_and_Field have been added to the simplifier: |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
2715 |
|
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
2716 |
zero_le_square |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
2717 |
not_square_less_zero |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
2718 |
|
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
2719 |
The following lemmas have been deleted from Real/RealPow: |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
2720 |
|
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
2721 |
realpow_zero_zero |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
2722 |
realpow_two |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
2723 |
realpow_less |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
2724 |
zero_le_power |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
2725 |
realpow_two_le |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
2726 |
abs_realpow_two |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
2727 |
realpow_two_abs |
e4dd6beeafab
commented changes in HOL/Ring_and_Field.thy, and in HOL/Real/RealPow.thy
obua
parents:
23481
diff
changeset
|
2728 |
|
16891 | 2729 |
* Theory Parity: added rules for simplifying exponents. |
2730 |
||
17092 | 2731 |
* Theory List: |
2732 |
||
2733 |
The following theorems have been eliminated or modified |
|
2734 |
(INCOMPATIBILITY): |
|
2735 |
||
2736 |
list_all_Nil now named list_all.simps(1) |
|
2737 |
list_all_Cons now named list_all.simps(2) |
|
2738 |
list_all_conv now named list_all_iff |
|
2739 |
set_mem_eq now named mem_iff |
|
2740 |
||
16929 | 2741 |
* Theories SetsAndFunctions and BigO (see HOL/Library) support |
2742 |
asymptotic "big O" calculations. See the notes in BigO.thy. |
|
2743 |
||
16888 | 2744 |
|
2745 |
*** HOL-Complex *** |
|
2746 |
||
16891 | 2747 |
* Theory RealDef: better support for embedding natural numbers and |
2748 |
integers in the reals. |
|
2749 |
||
2750 |
The following theorems have been eliminated or modified |
|
2751 |
(INCOMPATIBILITY): |
|
2752 |
||
17016
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset
|
2753 |
exp_ge_add_one_self now requires no hypotheses |
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset
|
2754 |
real_of_int_add reversed direction of equality (use [symmetric]) |
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset
|
2755 |
real_of_int_minus reversed direction of equality (use [symmetric]) |
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset
|
2756 |
real_of_int_diff reversed direction of equality (use [symmetric]) |
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset
|
2757 |
real_of_int_mult reversed direction of equality (use [symmetric]) |
16891 | 2758 |
|
2759 |
* Theory RComplete: expanded support for floor and ceiling functions. |
|
16888 | 2760 |
|
16962 | 2761 |
* Theory Ln is new, with properties of the natural logarithm |
2762 |
||
17423 | 2763 |
* Hyperreal: There is a new type constructor "star" for making |
2764 |
nonstandard types. The old type names are now type synonyms: |
|
2765 |
||
2766 |
hypreal = real star |
|
2767 |
hypnat = nat star |
|
2768 |
hcomplex = complex star |
|
2769 |
||
2770 |
* Hyperreal: Many groups of similarly-defined constants have been |
|
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2771 |
replaced by polymorphic versions (INCOMPATIBILITY): |
17423 | 2772 |
|
2773 |
star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex |
|
2774 |
||
2775 |
starset <-- starsetNat, starsetC |
|
2776 |
*s* <-- *sNat*, *sc* |
|
2777 |
starset_n <-- starsetNat_n, starsetC_n |
|
2778 |
*sn* <-- *sNatn*, *scn* |
|
2779 |
InternalSets <-- InternalNatSets, InternalCSets |
|
2780 |
||
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2781 |
starfun <-- starfun{Nat,Nat2,C,RC,CR} |
17423 | 2782 |
*f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR* |
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2783 |
starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n |
17423 | 2784 |
*fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn* |
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2785 |
InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs |
17423 | 2786 |
|
2787 |
* Hyperreal: Many type-specific theorems have been removed in favor of |
|
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2788 |
theorems specific to various axiomatic type classes (INCOMPATIBILITY): |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2789 |
|
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2790 |
add_commute <-- {hypreal,hypnat,hcomplex}_add_commute |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2791 |
add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2792 |
OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2793 |
OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right |
17423 | 2794 |
right_minus <-- hypreal_add_minus |
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2795 |
left_minus <-- {hypreal,hcomplex}_add_minus_left |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2796 |
mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2797 |
mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2798 |
mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left |
17423 | 2799 |
mult_1_right <-- hcomplex_mult_one_right |
2800 |
mult_zero_left <-- hcomplex_mult_zero_left |
|
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2801 |
left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib |
17423 | 2802 |
right_distrib <-- hypnat_add_mult_distrib2 |
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2803 |
zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one |
17423 | 2804 |
right_inverse <-- hypreal_mult_inverse |
2805 |
left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left |
|
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2806 |
order_refl <-- {hypreal,hypnat}_le_refl |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2807 |
order_trans <-- {hypreal,hypnat}_le_trans |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2808 |
order_antisym <-- {hypreal,hypnat}_le_anti_sym |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2809 |
order_less_le <-- {hypreal,hypnat}_less_le |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2810 |
linorder_linear <-- {hypreal,hypnat}_le_linear |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2811 |
add_left_mono <-- {hypreal,hypnat}_add_left_mono |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2812 |
mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2 |
17423 | 2813 |
add_nonneg_nonneg <-- hypreal_le_add_order |
2814 |
||
2815 |
* Hyperreal: Separate theorems having to do with type-specific |
|
2816 |
versions of constants have been merged into theorems that apply to the |
|
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2817 |
new polymorphic constants (INCOMPATIBILITY): |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2818 |
|
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2819 |
STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2820 |
STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2821 |
STAR_Un <-- {STAR,NatStar,STARC}_Un |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2822 |
STAR_Int <-- {STAR,NatStar,STARC}_Int |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2823 |
STAR_Compl <-- {STAR,NatStar,STARC}_Compl |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2824 |
STAR_subset <-- {STAR,NatStar,STARC}_subset |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2825 |
STAR_mem <-- {STAR,NatStar,STARC}_mem |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2826 |
STAR_mem_Compl <-- {STAR,STARC}_mem_Compl |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2827 |
STAR_diff <-- {STAR,STARC}_diff |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2828 |
STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real, |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2829 |
STARC_hcomplex_of_complex}_image_subset |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2830 |
starset_n_Un <-- starset{Nat,C}_n_Un |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2831 |
starset_n_Int <-- starset{Nat,C}_n_Int |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2832 |
starset_n_Compl <-- starset{Nat,C}_n_Compl |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2833 |
starset_n_diff <-- starset{Nat,C}_n_diff |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2834 |
InternalSets_Un <-- Internal{Nat,C}Sets_Un |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2835 |
InternalSets_Int <-- Internal{Nat,C}Sets_Int |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2836 |
InternalSets_Compl <-- Internal{Nat,C}Sets_Compl |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2837 |
InternalSets_diff <-- Internal{Nat,C}Sets_diff |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2838 |
InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2839 |
InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2840 |
starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2841 |
starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C} |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2842 |
starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR} |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2843 |
starfun <-- starfun{Nat,Nat2,C,RC,CR} |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2844 |
starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2845 |
starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2846 |
starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2847 |
starfun_diff <-- starfun{C,RC,CR}_diff |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2848 |
starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2849 |
starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2 |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2850 |
starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2851 |
starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2852 |
starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2853 |
starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff |
17423 | 2854 |
starfun_Id <-- starfunC_Id |
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2855 |
starfun_approx <-- starfun{Nat,CR}_approx |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2856 |
starfun_capprox <-- starfun{C,RC}_capprox |
17423 | 2857 |
starfun_abs <-- starfunNat_rabs |
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2858 |
starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2859 |
starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2 |
17423 | 2860 |
starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox |
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2861 |
starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2862 |
starfun_add_capprox <-- starfun{C,RC}_add_capprox |
17423 | 2863 |
starfun_add_approx <-- starfunCR_add_approx |
2864 |
starfun_inverse_inverse <-- starfunC_inverse_inverse |
|
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2865 |
starfun_divide <-- starfun{C,CR,RC}_divide |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2866 |
starfun_n <-- starfun{Nat,C}_n |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2867 |
starfun_n_mult <-- starfun{Nat,C}_n_mult |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2868 |
starfun_n_add <-- starfun{Nat,C}_n_add |
17423 | 2869 |
starfun_n_add_minus <-- starfunNat_n_add_minus |
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2870 |
starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2871 |
starfun_n_minus <-- starfun{Nat,C}_n_minus |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2872 |
starfun_n_eq <-- starfun{Nat,C}_n_eq |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2873 |
|
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2874 |
star_n_add <-- {hypreal,hypnat,hcomplex}_add |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2875 |
star_n_minus <-- {hypreal,hcomplex}_minus |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2876 |
star_n_diff <-- {hypreal,hcomplex}_diff |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2877 |
star_n_mult <-- {hypreal,hcomplex}_mult |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2878 |
star_n_inverse <-- {hypreal,hcomplex}_inverse |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2879 |
star_n_le <-- {hypreal,hypnat}_le |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2880 |
star_n_less <-- {hypreal,hypnat}_less |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2881 |
star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2882 |
star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num |
17423 | 2883 |
star_n_abs <-- hypreal_hrabs |
2884 |
star_n_divide <-- hcomplex_divide |
|
2885 |
||
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2886 |
star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2887 |
star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus |
17423 | 2888 |
star_of_diff <-- hypreal_of_real_diff |
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2889 |
star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2890 |
star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2891 |
star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2892 |
star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2893 |
star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2894 |
star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2895 |
star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2896 |
star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2897 |
star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2898 |
star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2899 |
star_of_number_of <-- {hypreal,hcomplex}_number_of |
17423 | 2900 |
star_of_number_less <-- number_of_less_hypreal_of_real_iff |
2901 |
star_of_number_le <-- number_of_le_hypreal_of_real_iff |
|
2902 |
star_of_eq_number <-- hypreal_of_real_eq_number_of_iff |
|
2903 |
star_of_less_number <-- hypreal_of_real_less_number_of_iff |
|
2904 |
star_of_le_number <-- hypreal_of_real_le_number_of_iff |
|
2905 |
star_of_power <-- hypreal_of_real_power |
|
2906 |
star_of_eq_0 <-- hcomplex_of_complex_zero_iff |
|
2907 |
||
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2908 |
* Hyperreal: new method "transfer" that implements the transfer |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2909 |
principle of nonstandard analysis. With a subgoal that mentions |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2910 |
nonstandard types like "'a star", the command "apply transfer" |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2911 |
replaces it with an equivalent one that mentions only standard types. |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2912 |
To be successful, all free variables must have standard types; non- |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2913 |
standard variables must have explicit universal quantifiers. |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2914 |
|
17641 | 2915 |
* Hyperreal: A theory of Taylor series. |
2916 |
||
14655
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset
|
2917 |
|
14682
a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset
|
2918 |
*** HOLCF *** |
a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset
|
2919 |
|
17533 | 2920 |
* Discontinued special version of 'constdefs' (which used to support |
2921 |
continuous functions) in favor of the general Pure one with full |
|
2922 |
type-inference. |
|
2923 |
||
2924 |
* New simplification procedure for solving continuity conditions; it |
|
2925 |
is much faster on terms with many nested lambda abstractions (cubic |
|
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2926 |
instead of exponential time). |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2927 |
|
17533 | 2928 |
* New syntax for domain package: selector names are now optional. |
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2929 |
Parentheses should be omitted unless argument is lazy, for example: |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2930 |
|
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2931 |
domain 'a stream = cons "'a" (lazy "'a stream") |
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2932 |
|
17533 | 2933 |
* New command 'fixrec' for defining recursive functions with pattern |
2934 |
matching; defining multiple functions with mutual recursion is also |
|
2935 |
supported. Patterns may include the constants cpair, spair, up, sinl, |
|
2936 |
sinr, or any data constructor defined by the domain package. The given |
|
2937 |
equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for |
|
2938 |
syntax and examples. |
|
2939 |
||
2940 |
* New commands 'cpodef' and 'pcpodef' for defining predicate subtypes |
|
2941 |
of cpo and pcpo types. Syntax is exactly like the 'typedef' command, |
|
2942 |
but the proof obligation additionally includes an admissibility |
|
2943 |
requirement. The packages generate instances of class cpo or pcpo, |
|
2944 |
with continuity and strictness theorems for Rep and Abs. |
|
17442
c0f0b92c198c
add HOLCF entries for pcpodef, cont_proc, fixrec;
huffman
parents:
17436
diff
changeset
|
2945 |
|
17584 | 2946 |
* HOLCF: Many theorems have been renamed according to a more standard naming |
2947 |
scheme (INCOMPATIBILITY): |
|
2948 |
||
2949 |
foo_inject: "foo$x = foo$y ==> x = y" |
|
2950 |
foo_eq: "(foo$x = foo$y) = (x = y)" |
|
2951 |
foo_less: "(foo$x << foo$y) = (x << y)" |
|
2952 |
foo_strict: "foo$UU = UU" |
|
2953 |
foo_defined: "... ==> foo$x ~= UU" |
|
2954 |
foo_defined_iff: "(foo$x = UU) = (x = UU)" |
|
2955 |
||
14682
a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset
|
2956 |
|
14885 | 2957 |
*** ZF *** |
2958 |
||
16234 | 2959 |
* ZF/ex: theories Group and Ring provide examples in abstract algebra, |
2960 |
including the First Isomorphism Theorem (on quotienting by the kernel |
|
2961 |
of a homomorphism). |
|
15089
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset
|
2962 |
|
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset
|
2963 |
* ZF/Simplifier: install second copy of type solver that actually |
16234 | 2964 |
makes use of TC rules declared to Isar proof contexts (or locales); |
2965 |
the old version is still required for ML proof scripts. |
|
15703 | 2966 |
|
2967 |
||
17445 | 2968 |
*** Cube *** |
2969 |
||
2970 |
* Converted to Isar theory format; use locales instead of axiomatic |
|
2971 |
theories. |
|
2972 |
||
2973 |
||
15703 | 2974 |
*** ML *** |
2975 |
||
21339 | 2976 |
* Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts |
2977 |
for ||>, ||>>, |>>, |
|
2978 |
||
15973 | 2979 |
* Pure/library.ML no longer defines its own option datatype, but uses |
16234 | 2980 |
that of the SML basis, which has constructors NONE and SOME instead of |
2981 |
None and Some, as well as exception Option.Option instead of OPTION. |
|
2982 |
The functions the, if_none, is_some, is_none have been adapted |
|
2983 |
accordingly, while Option.map replaces apsome. |
|
15973 | 2984 |
|
16860
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
2985 |
* Pure/library.ML: the exception LIST has been given up in favour of |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
2986 |
the standard exceptions Empty and Subscript, as well as |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
2987 |
Library.UnequalLengths. Function like Library.hd and Library.tl are |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
2988 |
superceded by the standard hd and tl functions etc. |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
2989 |
|
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
2990 |
A number of basic list functions are no longer exported to the ML |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
2991 |
toplevel, as they are variants of predefined functions. The following |
16234 | 2992 |
suggests how one can translate existing code: |
15973 | 2993 |
|
2994 |
rev_append xs ys = List.revAppend (xs, ys) |
|
2995 |
nth_elem (i, xs) = List.nth (xs, i) |
|
2996 |
last_elem xs = List.last xs |
|
2997 |
flat xss = List.concat xss |
|
16234 | 2998 |
seq fs = List.app fs |
15973 | 2999 |
partition P xs = List.partition P xs |
3000 |
mapfilter f xs = List.mapPartial f xs |
|
3001 |
||
16860
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
3002 |
* Pure/library.ML: several combinators for linear functional |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
3003 |
transformations, notably reverse application and composition: |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
3004 |
|
17371 | 3005 |
x |> f f #> g |
3006 |
(x, y) |-> f f #-> g |
|
16860
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
3007 |
|
17495 | 3008 |
* Pure/library.ML: introduced/changed precedence of infix operators: |
3009 |
||
3010 |
infix 1 |> |-> ||> ||>> |>> |>>> #> #->; |
|
3011 |
infix 2 ?; |
|
3012 |
infix 3 o oo ooo oooo; |
|
3013 |
infix 4 ~~ upto downto; |
|
3014 |
||
3015 |
Maybe INCOMPATIBILITY when any of those is used in conjunction with other |
|
3016 |
infix operators. |
|
3017 |
||
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3018 |
* Pure/library.ML: natural list combinators fold, fold_rev, and |
16869 | 3019 |
fold_map support linear functional transformations and nesting. For |
16860
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
3020 |
example: |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
3021 |
|
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
3022 |
fold f [x1, ..., xN] y = |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
3023 |
y |> f x1 |> ... |> f xN |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
3024 |
|
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
3025 |
(fold o fold) f [xs1, ..., xsN] y = |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
3026 |
y |> fold f xs1 |> ... |> fold f xsN |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
3027 |
|
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
3028 |
fold f [x1, ..., xN] = |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
3029 |
f x1 #> ... #> f xN |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
3030 |
|
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
3031 |
(fold o fold) f [xs1, ..., xsN] = |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
3032 |
fold f xs1 #> ... #> fold f xsN |
43abdba4da5c
* Pure/library.ML: several combinators for linear functional transformations;
wenzelm
parents:
16856
diff
changeset
|
3033 |
|
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3034 |
* Pure/library.ML: the following selectors on type 'a option are |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3035 |
available: |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3036 |
|
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3037 |
the: 'a option -> 'a (*partial*) |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3038 |
these: 'a option -> 'a where 'a = 'b list |
17402 | 3039 |
the_default: 'a -> 'a option -> 'a |
3040 |
the_list: 'a option -> 'a list |
|
3041 |
||
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3042 |
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3043 |
basic operations for association lists, following natural argument |
17564 | 3044 |
order; moreover the explicit equality predicate passed here avoids |
17495 | 3045 |
potentially expensive polymorphic runtime equality checks. |
3046 |
The old functions may be expressed as follows: |
|
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3047 |
|
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3048 |
assoc = uncurry (AList.lookup (op =)) |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3049 |
assocs = these oo AList.lookup (op =) |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3050 |
overwrite = uncurry (AList.update (op =)) o swap |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3051 |
|
17564 | 3052 |
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides |
3053 |
||
3054 |
val make: ('a -> 'b) -> 'a list -> ('a * 'b) list |
|
3055 |
val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list |
|
3056 |
||
3057 |
replacing make_keylist and keyfilter (occassionally used) |
|
3058 |
Naive rewrites: |
|
3059 |
||
3060 |
make_keylist = AList.make |
|
3061 |
keyfilter = AList.find (op =) |
|
3062 |
||
3063 |
* eq_fst and eq_snd now take explicit equality parameter, thus |
|
3064 |
avoiding eqtypes. Naive rewrites: |
|
3065 |
||
3066 |
eq_fst = eq_fst (op =) |
|
3067 |
eq_snd = eq_snd (op =) |
|
3068 |
||
3069 |
* Removed deprecated apl and apr (rarely used). |
|
3070 |
Naive rewrites: |
|
3071 |
||
3072 |
apl (n, op) =>>= curry op n |
|
3073 |
apr (op, m) =>>= fn n => op (n, m) |
|
3074 |
||
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3075 |
* Pure/General: structure OrdList (cf. Pure/General/ord_list.ML) |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3076 |
provides a reasonably efficient light-weight implementation of sets as |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3077 |
lists. |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3078 |
|
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3079 |
* Pure/General: generic tables (cf. Pure/General/table.ML) provide a |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3080 |
few new operations; existing lookup and update are now curried to |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3081 |
follow natural argument order (for use with fold etc.); |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3082 |
INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort. |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3083 |
|
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3084 |
* Pure/General: output via the Isabelle channels of |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3085 |
writeln/warning/error etc. is now passed through Output.output, with a |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3086 |
hook for arbitrary transformations depending on the print_mode |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3087 |
(cf. Output.add_mode -- the first active mode that provides a output |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3088 |
function wins). Already formatted output may be embedded into further |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3089 |
text via Output.raw; the result of Pretty.string_of/str_of and derived |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3090 |
functions (string_of_term/cterm/thm etc.) is already marked raw to |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3091 |
accommodate easy composition of diagnostic messages etc. Programmers |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3092 |
rarely need to care about Output.output or Output.raw at all, with |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3093 |
some notable exceptions: Output.output is required when bypassing the |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3094 |
standard channels (writeln etc.), or in token translations to produce |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3095 |
properly formatted results; Output.raw is required when capturing |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3096 |
already output material that will eventually be presented to the user |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3097 |
a second time. For the default print mode, both Output.output and |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3098 |
Output.raw have no effect. |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3099 |
|
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3100 |
* Pure/General: Output.time_accumulator NAME creates an operator ('a |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3101 |
-> 'b) -> 'a -> 'b to measure runtime and count invocations; the |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3102 |
cumulative results are displayed at the end of a batch session. |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3103 |
|
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3104 |
* Pure/General: File.sysify_path and File.quote_sysify path have been |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3105 |
replaced by File.platform_path and File.shell_path (with appropriate |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3106 |
hooks). This provides a clean interface for unusual systems where the |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3107 |
internal and external process view of file names are different. |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3108 |
|
16689
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset
|
3109 |
* Pure: more efficient orders for basic syntactic entities: added |
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset
|
3110 |
fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord |
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset
|
3111 |
and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is |
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset
|
3112 |
NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast |
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset
|
3113 |
orders now -- potential INCOMPATIBILITY for code that depends on a |
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset
|
3114 |
particular order for Symtab.keys, Symtab.dest, etc. (consider using |
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset
|
3115 |
Library.sort_strings on result). |
05b986733a59
* Pure: structure OrdList (cf. Pure/General/ord_list.ML);
wenzelm
parents:
16662
diff
changeset
|
3116 |
|
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3117 |
* Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types, |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3118 |
fold_types traverse types/terms from left to right, observing natural |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3119 |
argument order. Supercedes previous foldl_XXX versions, add_frees, |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3120 |
add_vars etc. have been adapted as well: INCOMPATIBILITY. |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3121 |
|
16151 | 3122 |
* Pure: name spaces have been refined, with significant changes of the |
16234 | 3123 |
internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table) |
3124 |
to extern(_table). The plain name entry path is superceded by a |
|
3125 |
general 'naming' context, which also includes the 'policy' to produce |
|
3126 |
a fully qualified name and external accesses of a fully qualified |
|
3127 |
name; NameSpace.extend is superceded by context dependent |
|
3128 |
Sign.declare_name. Several theory and proof context operations modify |
|
3129 |
the naming context. Especially note Theory.restore_naming and |
|
3130 |
ProofContext.restore_naming to get back to a sane state; note that |
|
3131 |
Theory.add_path is no longer sufficient to recover from |
|
3132 |
Theory.absolute_path in particular. |
|
3133 |
||
3134 |
* Pure: new flags short_names (default false) and unique_names |
|
3135 |
(default true) for controlling output of qualified names. If |
|
3136 |
short_names is set, names are printed unqualified. If unique_names is |
|
3137 |
reset, the name prefix is reduced to the minimum required to achieve |
|
3138 |
the original result when interning again, even if there is an overlap |
|
3139 |
with earlier declarations. |
|
16151 | 3140 |
|
16456
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3141 |
* Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3142 |
now 'extend', and 'merge' gets an additional Pretty.pp argument |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3143 |
(useful for printing error messages). INCOMPATIBILITY. |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3144 |
|
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3145 |
* Pure: major reorganization of the theory context. Type Sign.sg and |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3146 |
Theory.theory are now identified, referring to the universal |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3147 |
Context.theory (see Pure/context.ML). Actual signature and theory |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3148 |
content is managed as theory data. The old code and interfaces were |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3149 |
spread over many files and structures; the new arrangement introduces |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3150 |
considerable INCOMPATIBILITY to gain more clarity: |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3151 |
|
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3152 |
Context -- theory management operations (name, identity, inclusion, |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3153 |
parents, ancestors, merge, etc.), plus generic theory data; |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3154 |
|
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3155 |
Sign -- logical signature and syntax operations (declaring consts, |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3156 |
types, etc.), plus certify/read for common entities; |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3157 |
|
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3158 |
Theory -- logical theory operations (stating axioms, definitions, |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3159 |
oracles), plus a copy of logical signature operations (consts, |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3160 |
types, etc.); also a few basic management operations (Theory.copy, |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3161 |
Theory.merge, etc.) |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3162 |
|
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3163 |
The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3164 |
etc.) as well as the sign field in Thm.rep_thm etc. have been retained |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3165 |
for convenience -- they merely return the theory. |
451f1c46d4ca
* Pure/TheoryDataFun: change of the argument structure;
wenzelm
parents:
16373
diff
changeset
|
3166 |
|
17193
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset
|
3167 |
* Pure: type Type.tsig is superceded by theory in most interfaces. |
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset
|
3168 |
|
16547
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset
|
3169 |
* Pure: the Isar proof context type is already defined early in Pure |
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset
|
3170 |
as Context.proof (note that ProofContext.context and Proof.context are |
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset
|
3171 |
aliases, where the latter is the preferred name). This enables other |
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset
|
3172 |
Isabelle components to refer to that type even before Isar is present. |
09f7a953d2d6
* Pure: the Isar proof context type is already defined early in Pure
wenzelm
parents:
16506
diff
changeset
|
3173 |
|
16373
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
3174 |
* Pure/sign/theory: discontinued named name spaces (i.e. classK, |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
3175 |
typeK, constK, axiomK, oracleK), but provide explicit operations for |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
3176 |
any of these kinds. For example, Sign.intern typeK is now |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
3177 |
Sign.intern_type, Theory.hide_space Sign.typeK is now |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
3178 |
Theory.hide_types. Also note that former |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
3179 |
Theory.hide_classes/types/consts are now |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
3180 |
Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
3181 |
internalize their arguments! INCOMPATIBILITY. |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
3182 |
|
16506
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset
|
3183 |
* Pure: get_thm interface (of PureThy and ProofContext) expects |
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset
|
3184 |
datatype thmref (with constructors Name and NameSelection) instead of |
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset
|
3185 |
plain string -- INCOMPATIBILITY; |
b2687ce38433
* Pure: get_thm interface expects datatype thmref;
wenzelm
parents:
16456
diff
changeset
|
3186 |
|
16151 | 3187 |
* Pure: cases produced by proof methods specify options, where NONE |
16234 | 3188 |
means to remove case bindings -- INCOMPATIBILITY in |
3189 |
(RAW_)METHOD_CASES. |
|
16151 | 3190 |
|
16373
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
3191 |
* Pure: the following operations retrieve axioms or theorems from a |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
3192 |
theory node or theory hierarchy, respectively: |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
3193 |
|
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
3194 |
Theory.axioms_of: theory -> (string * term) list |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
3195 |
Theory.all_axioms_of: theory -> (string * term) list |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
3196 |
PureThy.thms_of: theory -> (string * thm) list |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
3197 |
PureThy.all_thms_of: theory -> (string * thm) list |
9d020423093b
* Pure/sign/theory: discontinued named name spaces;
wenzelm
parents:
16251
diff
changeset
|
3198 |
|
16718 | 3199 |
* Pure: print_tac now outputs the goal through the trace channel. |
3200 |
||
17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3201 |
* Isar toplevel: improved diagnostics, mostly for Poly/ML only. |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3202 |
Reference Toplevel.debug (default false) controls detailed printing |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3203 |
and tracing of low-level exceptions; Toplevel.profiling (default 0) |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3204 |
controls execution profiling -- set to 1 for time and 2 for space |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3205 |
(both increase the runtime). |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3206 |
|
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3207 |
* Isar session: The initial use of ROOT.ML is now always timed, |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3208 |
i.e. the log will show the actual process times, in contrast to the |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3209 |
elapsed wall-clock time that the outer shell wrapper produces. |
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3210 |
|
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset
|
3211 |
* Simplifier: improved handling of bound variables (nameless |
16997
7dfc99f62dd9
* Pure/Simplifier: improved handling of bound variables;
wenzelm
parents:
16962
diff
changeset
|
3212 |
representation, avoid allocating new strings). Simprocs that invoke |
7dfc99f62dd9
* Pure/Simplifier: improved handling of bound variables;
wenzelm
parents:
16962
diff
changeset
|
3213 |
the Simplifier recursively should use Simplifier.inherit_bounds to |
17720 | 3214 |
avoid local name clashes. Failure to do so produces warnings |
3215 |
"Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds |
|
3216 |
for further details. |
|
16234 | 3217 |
|
17166 | 3218 |
* ML functions legacy_bindings and use_legacy_bindings produce ML fact |
3219 |
bindings for all theorems stored within a given theory; this may help |
|
3220 |
in porting non-Isar theories to Isar ones, while keeping ML proof |
|
3221 |
scripts for the time being. |
|
3222 |
||
17457 | 3223 |
* ML operator HTML.with_charset specifies the charset begin used for |
3224 |
generated HTML files. For example: |
|
3225 |
||
3226 |
HTML.with_charset "utf-8" use_thy "Hebrew"; |
|
17538 | 3227 |
HTML.with_charset "utf-8" use_thy "Chinese"; |
17457 | 3228 |
|
16234 | 3229 |
|
3230 |
*** System *** |
|
3231 |
||
3232 |
* Allow symlinks to all proper Isabelle executables (Isabelle, |
|
3233 |
isabelle, isatool etc.). |
|
3234 |
||
3235 |
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for |
|
3236 |
isatool doc, isatool mkdir, display_drafts etc.). |
|
3237 |
||
3238 |
* isatool usedir: option -f allows specification of the ML file to be |
|
3239 |
used by Isabelle; default is ROOT.ML. |
|
3240 |
||
16251
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset
|
3241 |
* New isatool version outputs the version identifier of the Isabelle |
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset
|
3242 |
distribution being used. |
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset
|
3243 |
|
121dc80d120a
* ML: replaced File.sysify_path/quote_sysify_path by File.platform_path/shell_path;
wenzelm
parents:
16234
diff
changeset
|
3244 |
* HOL: new isatool dimacs2hol converts files in DIMACS CNF format |
16234 | 3245 |
(containing Boolean satisfiability problems) into Isabelle/HOL |
3246 |
theories. |
|
15703 | 3247 |
|
3248 |
||
14655
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset
|
3249 |
|
14606 | 3250 |
New in Isabelle2004 (April 2004) |
3251 |
-------------------------------- |
|
13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
3252 |
|
14171
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset
|
3253 |
*** General *** |
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset
|
3254 |
|
14398
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
3255 |
* Provers/order.ML: new efficient reasoner for partial and linear orders. |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
3256 |
Replaces linorder.ML. |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
3257 |
|
14606 | 3258 |
* Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic |
3259 |
(\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler |
|
14173 | 3260 |
(\<a>...\<z>), are now considered normal letters, and can therefore |
3261 |
be used anywhere where an ASCII letter (a...zA...Z) has until |
|
3262 |
now. COMPATIBILITY: This obviously changes the parsing of some |
|
3263 |
terms, especially where a symbol has been used as a binder, say |
|
3264 |
'\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed |
|
3265 |
as an identifier. Fix it by inserting a space around former |
|
3266 |
symbols. Call 'isatool fixgreek' to try to fix parsing errors in |
|
3267 |
existing theory and ML files. |
|
14171
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset
|
3268 |
|
14237 | 3269 |
* Pure: Macintosh and Windows line-breaks are now allowed in theory files. |
3270 |
||
14731 | 3271 |
* Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now |
3272 |
allowed in identifiers. Similar to Greek letters \<^isub> is now considered |
|
3273 |
a normal (but invisible) letter. For multiple letter subscripts repeat |
|
3274 |
\<^isub> like this: x\<^isub>1\<^isub>2. |
|
14233 | 3275 |
|
14333 | 3276 |
* Pure: There are now sub-/superscripts that can span more than one |
3277 |
character. Text between \<^bsub> and \<^esub> is set in subscript in |
|
14606 | 3278 |
ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in |
3279 |
superscript. The new control characters are not identifier parts. |
|
14333 | 3280 |
|
14561
c53396af770e
* raw control symbols are of the form \<^raw:...> now.
schirmer
parents:
14556
diff
changeset
|
3281 |
* Pure: Control-symbols of the form \<^raw:...> will literally print the |
14606 | 3282 |
content of "..." to the latex file instead of \isacntrl... . The "..." |
3283 |
may consist of any printable characters excluding the end bracket >. |
|
14361
ad2f5da643b4
* Support for raw latex output in control symbols: \<^raw...>
schirmer
parents:
14333
diff
changeset
|
3284 |
|
14237 | 3285 |
* Pure: Using new Isar command "finalconsts" (or the ML functions |
3286 |
Theory.add_finals or Theory.add_finals_i) it is now possible to |
|
3287 |
declare constants "final", which prevents their being given a definition |
|
3288 |
later. It is useful for constants whose behaviour is fixed axiomatically |
|
14224 | 3289 |
rather than definitionally, such as the meta-logic connectives. |
3290 |
||
14606 | 3291 |
* Pure: 'instance' now handles general arities with general sorts |
3292 |
(i.e. intersections of classes), |
|
14503
255ad604e08e
Added check that Theory.ML does not occur in the files section of the theory
skalberg
parents:
14480
diff
changeset
|
3293 |
|
14547 | 3294 |
* Presentation: generated HTML now uses a CSS style sheet to make layout |
14731 | 3295 |
(somewhat) independent of content. It is copied from lib/html/isabelle.css. |
14547 | 3296 |
It can be changed to alter the colors/layout of generated pages. |
3297 |
||
14556
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset
|
3298 |
|
14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
3299 |
*** Isar *** |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
3300 |
|
14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset
|
3301 |
* Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac, |
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset
|
3302 |
cut_tac, subgoal_tac and thin_tac: |
14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
3303 |
- Now understand static (Isar) contexts. As a consequence, users of Isar |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
3304 |
locales are no longer forced to write Isar proof scripts. |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
3305 |
For details see Isar Reference Manual, paragraph 4.3.2: Further tactic |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
3306 |
emulations. |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
3307 |
- INCOMPATIBILITY: names of variables to be instantiated may no |
14211
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
3308 |
longer be enclosed in quotes. Instead, precede variable name with `?'. |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
3309 |
This is consistent with the instantiation attribute "where". |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
3310 |
|
14257
a7ef3f7588c5
Type inference bug in Isar attributes "where" and "of" fixed.
ballarin
parents:
14255
diff
changeset
|
3311 |
* Attributes "where" and "of": |
14285
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset
|
3312 |
- Now take type variables of instantiated theorem into account when reading |
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset
|
3313 |
the instantiation string. This fixes a bug that caused instantiated |
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset
|
3314 |
theorems to have too special types in some circumstances. |
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset
|
3315 |
- "where" permits explicit instantiations of type variables. |
14257
a7ef3f7588c5
Type inference bug in Isar attributes "where" and "of" fixed.
ballarin
parents:
14255
diff
changeset
|
3316 |
|
14556
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset
|
3317 |
* Calculation commands "moreover" and "also" no longer interfere with |
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset
|
3318 |
current facts ("this"), admitting arbitrary combinations with "then" |
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset
|
3319 |
and derived forms. |
14283 | 3320 |
|
14211
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
3321 |
* Locales: |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
3322 |
- Goal statements involving the context element "includes" no longer |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
3323 |
generate theorems with internal delta predicates (those ending on |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
3324 |
"_axioms") in the premise. |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
3325 |
Resolve particular premise with <locale>.intro to obtain old form. |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
3326 |
- Fixed bug in type inference ("unify_frozen") that prevented mix of target |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
3327 |
specification and "includes" elements in goal statement. |
14254
342634f38451
Isar/Locales: <loc>.intro and <loc>.axioms no longer intro? and elim? by
ballarin
parents:
14243
diff
changeset
|
3328 |
- Rule sets <locale>.intro and <locale>.axioms no longer declared as |
342634f38451
Isar/Locales: <loc>.intro and <loc>.axioms no longer intro? and elim? by
ballarin
parents:
14243
diff
changeset
|
3329 |
[intro?] and [elim?] (respectively) by default. |
14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset
|
3330 |
- Experimental command for instantiation of locales in proof contexts: |
14551 | 3331 |
instantiate <label>[<attrs>]: <loc> |
14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset
|
3332 |
Instantiates locale <loc> and adds all its theorems to the current context |
14551 | 3333 |
taking into account their attributes. Label and attrs are optional |
3334 |
modifiers, like in theorem declarations. If present, names of |
|
3335 |
instantiated theorems are qualified with <label>, and the attributes |
|
3336 |
<attrs> are applied after any attributes these theorems might have already. |
|
3337 |
If the locale has assumptions, a chained fact of the form |
|
14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset
|
3338 |
"<loc> t1 ... tn" is expected from which instantiations of the parameters |
14551 | 3339 |
are derived. The command does not support old-style locales declared |
3340 |
with "locale (open)". |
|
3341 |
A few (very simple) examples can be found in FOL/ex/LocaleInst.thy. |
|
14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
3342 |
|
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
3343 |
* HOL: Tactic emulation methods induct_tac and case_tac understand static |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
3344 |
(Isar) contexts. |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
3345 |
|
14556
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset
|
3346 |
|
14136 | 3347 |
*** HOL *** |
3348 |
||
14624 | 3349 |
* Proof import: new image HOL4 contains the imported library from |
3350 |
the HOL4 system with about 2500 theorems. It is imported by |
|
3351 |
replaying proof terms produced by HOL4 in Isabelle. The HOL4 image |
|
3352 |
can be used like any other Isabelle image. See |
|
3353 |
HOL/Import/HOL/README for more information. |
|
3354 |
||
14398
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
3355 |
* Simplifier: |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
3356 |
- Much improved handling of linear and partial orders. |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
3357 |
Reasoners for linear and partial orders are set up for type classes |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
3358 |
"linorder" and "order" respectively, and are added to the default simpset |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
3359 |
as solvers. This means that the simplifier can build transitivity chains |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
3360 |
to solve goals from the assumptions. |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
3361 |
- INCOMPATIBILITY: old proofs break occasionally. Typically, applications |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
3362 |
of blast or auto after simplification become unnecessary because the goal |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
3363 |
is solved by simplification already. |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
3364 |
|
14731 | 3365 |
* Numerics: new theory Ring_and_Field contains over 250 basic numerical laws, |
14389 | 3366 |
all proved in axiomatic type classes for semirings, rings and fields. |
3367 |
||
3368 |
* Numerics: |
|
3369 |
- Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are |
|
14731 | 3370 |
now formalized using the Ring_and_Field theory mentioned above. |
14389 | 3371 |
- INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently |
3372 |
than before, because now they are set up once in a generic manner. |
|
14731 | 3373 |
- INCOMPATIBILITY: many type-specific arithmetic laws have gone. |
14480 | 3374 |
Look for the general versions in Ring_and_Field (and Power if they concern |
3375 |
exponentiation). |
|
14389 | 3376 |
|
14401 | 3377 |
* Type "rat" of the rational numbers is now available in HOL-Complex. |
14389 | 3378 |
|
14255 | 3379 |
* Records: |
3380 |
- Record types are now by default printed with their type abbreviation |
|
3381 |
instead of the list of all field types. This can be configured via |
|
3382 |
the reference "print_record_type_abbr". |
|
14731 | 3383 |
- Simproc "record_upd_simproc" for simplification of multiple updates added |
14255 | 3384 |
(not enabled by default). |
14427 | 3385 |
- Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp. |
3386 |
EX x. x = sel r to True (not enabled by default). |
|
14255 | 3387 |
- Tactic "record_split_simp_tac" to split and simplify records added. |
14731 | 3388 |
|
14136 | 3389 |
* 'specification' command added, allowing for definition by |
14224 | 3390 |
specification. There is also an 'ax_specification' command that |
3391 |
introduces the new constants axiomatically. |
|
14136 | 3392 |
|
14375 | 3393 |
* arith(_tac) is now able to generate counterexamples for reals as well. |
3394 |
||
14399
dc677b35e54f
New lemmas about inversion of restricted functions.
ballarin
parents:
14398
diff
changeset
|
3395 |
* HOL-Algebra: new locale "ring" for non-commutative rings. |
dc677b35e54f
New lemmas about inversion of restricted functions.
ballarin
parents:
14398
diff
changeset
|
3396 |
|
14243 | 3397 |
* HOL-ex: InductiveInvariant_examples illustrates advanced recursive function |
14610 | 3398 |
definitions, thanks to Sava Krsti\'{c} and John Matthews. |
3399 |
||
14731 | 3400 |
* HOL-Matrix: a first theory for matrices in HOL with an application of |
14610 | 3401 |
matrix theory to linear programming. |
14136 | 3402 |
|
14380 | 3403 |
* Unions and Intersections: |
15119 | 3404 |
The latex output syntax of UN and INT has been changed |
3405 |
from "\Union x \in A. B" to "\Union_{x \in A} B" |
|
3406 |
i.e. the index formulae has become a subscript. |
|
3407 |
Similarly for "\Union x. B", and for \Inter instead of \Union. |
|
14380 | 3408 |
|
14418 | 3409 |
* Unions and Intersections over Intervals: |
14731 | 3410 |
There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is |
3411 |
also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A" |
|
14418 | 3412 |
like in normal math, and corresponding versions for < and for intersection. |
3413 |
||
15677 | 3414 |
* HOL/List: Ordering "lexico" is renamed "lenlex" and the standard |
3415 |
lexicographic dictonary ordering has been added as "lexord". |
|
3416 |
||
14401 | 3417 |
* ML: the legacy theory structures Int and List have been removed. They had |
3418 |
conflicted with ML Basis Library structures having the same names. |
|
14380 | 3419 |
|
14464 | 3420 |
* 'refute' command added to search for (finite) countermodels. Only works |
3421 |
for a fragment of HOL. The installation of an external SAT solver is |
|
3422 |
highly recommended. See "HOL/Refute.thy" for details. |
|
3423 |
||
14602 | 3424 |
* 'quickcheck' command: Allows to find counterexamples by evaluating |
3425 |
formulae under an assignment of free variables to random values. |
|
3426 |
In contrast to 'refute', it can deal with inductive datatypes, |
|
3427 |
but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy" |
|
3428 |
for examples. |
|
14464 | 3429 |
|
14606 | 3430 |
|
14536 | 3431 |
*** HOLCF *** |
3432 |
||
3433 |
* Streams now come with concatenation and are part of the HOLCF image |
|
3434 |
||
14572 | 3435 |
|
3436 |
||
14136 | 3437 |
New in Isabelle2003 (May 2003) |
14606 | 3438 |
------------------------------ |
14136 | 3439 |
|
13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
3440 |
*** General *** |
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
3441 |
|
13618 | 3442 |
* Provers/simplifier: |
3443 |
||
13781 | 3444 |
- Completely reimplemented method simp (ML: Asm_full_simp_tac): |
13618 | 3445 |
Assumptions are now subject to complete mutual simplification, |
3446 |
not just from left to right. The simplifier now preserves |
|
3447 |
the order of assumptions. |
|
3448 |
||
3449 |
Potential INCOMPATIBILITY: |
|
3450 |
||
13781 | 3451 |
-- simp sometimes diverges where the old version did |
3452 |
not, e.g. invoking simp on the goal |
|
13618 | 3453 |
|
3454 |
[| P (f x); y = x; f x = f y |] ==> Q |
|
3455 |
||
13781 | 3456 |
now gives rise to the infinite reduction sequence |
3457 |
||
3458 |
P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ... |
|
3459 |
||
3460 |
Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this |
|
3461 |
kind of problem. |
|
3462 |
||
3463 |
-- Tactics combining classical reasoner and simplification (such as auto) |
|
3464 |
are also affected by this change, because many of them rely on |
|
3465 |
simp. They may sometimes diverge as well or yield a different numbers |
|
3466 |
of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto |
|
3467 |
in case of problems. Sometimes subsequent calls to the classical |
|
3468 |
reasoner will fail because a preceeding call to the simplifier too |
|
3469 |
eagerly simplified the goal, e.g. deleted redundant premises. |
|
13618 | 3470 |
|
3471 |
- The simplifier trace now shows the names of the applied rewrite rules |
|
3472 |
||
13829 | 3473 |
- You can limit the number of recursive invocations of the simplifier |
3474 |
during conditional rewriting (where the simplifie tries to solve the |
|
3475 |
conditions before applying the rewrite rule): |
|
3476 |
ML "simp_depth_limit := n" |
|
3477 |
where n is an integer. Thus you can force termination where previously |
|
3478 |
the simplifier would diverge. |
|
3479 |
||
13835
12b2ffbe543a
Change to meta simplifier: congruence rules may now have frees as head of term.
ballarin
parents:
13829
diff
changeset
|
3480 |
- Accepts free variables as head terms in congruence rules. Useful in Isar. |
13829 | 3481 |
|
13938 | 3482 |
- No longer aborts on failed congruence proof. Instead, the |
3483 |
congruence is ignored. |
|
3484 |
||
14008 | 3485 |
* Pure: New generic framework for extracting programs from constructive |
3486 |
proofs. See HOL/Extraction.thy for an example instantiation, as well |
|
3487 |
as HOL/Extraction for some case studies. |
|
3488 |
||
13868 | 3489 |
* Pure: The main goal of the proof state is no longer shown by default, only |
3490 |
the subgoals. This behaviour is controlled by a new flag. |
|
13835
12b2ffbe543a
Change to meta simplifier: congruence rules may now have frees as head of term.
ballarin
parents:
13829
diff
changeset
|
3491 |
PG menu: Isabelle/Isar -> Settings -> Show Main Goal |
13815 | 3492 |
(ML: Proof.show_main_goal). |
3493 |
||
3494 |
* Pure: You can find all matching introduction rules for subgoal 1, i.e. all |
|
3495 |
rules whose conclusion matches subgoal 1: |
|
3496 |
PG menu: Isabelle/Isar -> Show me -> matching rules |
|
3497 |
The rules are ordered by how closely they match the subgoal. |
|
3498 |
In particular, rules that solve a subgoal outright are displayed first |
|
3499 |
(or rather last, the way they are printed). |
|
3500 |
(ML: ProofGeneral.print_intros()) |
|
3501 |
||
3502 |
* Pure: New flag trace_unify_fail causes unification to print |
|
13781 | 3503 |
diagnostic information (PG: in trace buffer) when it fails. This is |
3504 |
useful for figuring out why single step proofs like rule, erule or |
|
3505 |
assumption failed. |
|
3506 |
||
13815 | 3507 |
* Pure: Locale specifications now produce predicate definitions |
13410
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
3508 |
according to the body of text (covering assumptions modulo local |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
3509 |
definitions); predicate "loc_axioms" covers newly introduced text, |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
3510 |
while "loc" is cumulative wrt. all included locale expressions; the |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
3511 |
latter view is presented only on export into the global theory |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
3512 |
context; potential INCOMPATIBILITY, use "(open)" option to fall back |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
3513 |
on the old view without predicates; |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
3514 |
|
13459
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset
|
3515 |
* Pure: predefined locales "var" and "struct" are useful for sharing |
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset
|
3516 |
parameters (as in CASL, for example); just specify something like |
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset
|
3517 |
``var x + var y + struct M'' as import; |
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset
|
3518 |
|
13463
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
3519 |
* Pure: improved thms_containing: proper indexing of facts instead of |
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
3520 |
raw theorems; check validity of results wrt. current name space; |
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
3521 |
include local facts of proof configuration (also covers active |
13541 | 3522 |
locales), cover fixed variables in index; may use "_" in term |
3523 |
specification; an optional limit for the number of printed facts may |
|
3524 |
be given (the default is 40); |
|
3525 |
||
3526 |
* Pure: disallow duplicate fact bindings within new-style theory files |
|
3527 |
(batch-mode only); |
|
13540
aede0306e214
* Pure: disallow duplicate fact bindings within new-style theory files;
wenzelm
parents:
13522
diff
changeset
|
3528 |
|
13463
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
3529 |
* Provers: improved induct method: assumptions introduced by case |
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
3530 |
"foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from |
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
3531 |
the goal statement); "foo" still refers to all facts collectively; |
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
3532 |
|
13550 | 3533 |
* Provers: the function blast.overloaded has been removed: all constants |
3534 |
are regarded as potentially overloaded, which improves robustness in exchange |
|
3535 |
for slight decrease in efficiency; |
|
3536 |
||
13781 | 3537 |
* Provers/linorder: New generic prover for transitivity reasoning over |
3538 |
linear orders. Note: this prover is not efficient! |
|
3539 |
||
13522
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset
|
3540 |
* Isar: preview of problems to finish 'show' now produce an error |
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset
|
3541 |
rather than just a warning (in interactive mode); |
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset
|
3542 |
|
13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
3543 |
|
13158 | 3544 |
*** HOL *** |
3545 |
||
13899 | 3546 |
* arith(_tac) |
3547 |
||
3548 |
- Produces a counter example if it cannot prove a goal. |
|
3549 |
Note that the counter example may be spurious if the goal is not a formula |
|
3550 |
of quantifier-free linear arithmetic. |
|
3551 |
In ProofGeneral the counter example appears in the trace buffer. |
|
3552 |
||
3553 |
- Knows about div k and mod k where k is a numeral of type nat or int. |
|
3554 |
||
3555 |
- Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free |
|
3556 |
linear arithmetic fails. This takes account of quantifiers and divisibility. |
|
14731 | 3557 |
Presburger arithmetic can also be called explicitly via presburger(_tac). |
13899 | 3558 |
|
3559 |
* simp's arithmetic capabilities have been enhanced a bit: it now |
|
3560 |
takes ~= in premises into account (by performing a case split); |
|
3561 |
||
3562 |
* simp reduces "m*(n div m) + n mod m" to n, even if the two summands |
|
3563 |
are distributed over a sum of terms; |
|
3564 |
||
13735 | 3565 |
* New tactic "trans_tac" and method "trans" instantiate |
3566 |
Provers/linorder.ML for axclasses "order" and "linorder" (predicates |
|
14731 | 3567 |
"<=", "<" and "="). |
3568 |
||
3569 |
* function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main |
|
13587 | 3570 |
HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp"; |
3571 |
||
13443 | 3572 |
* 'typedef' command has new option "open" to suppress the set |
3573 |
definition; |
|
3574 |
||
13522
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset
|
3575 |
* functions Min and Max on finite sets have been introduced (theory |
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset
|
3576 |
Finite_Set); |
13492 | 3577 |
|
13443 | 3578 |
* attribute [symmetric] now works for relations as well; it turns |
3579 |
(x,y) : R^-1 into (y,x) : R, and vice versa; |
|
3580 |
||
13613 | 3581 |
* induct over a !!-quantified statement (say !!x1..xn): |
3582 |
each "case" automatically performs "fix x1 .. xn" with exactly those names. |
|
3583 |
||
13899 | 3584 |
* Map: `empty' is no longer a constant but a syntactic abbreviation for |
3585 |
%x. None. Warning: empty_def now refers to the previously hidden definition |
|
3586 |
of the empty set. |
|
3587 |
||
14018 | 3588 |
* Algebra: formalization of classical algebra. Intended as base for |
3589 |
any algebraic development in Isabelle. Currently covers group theory |
|
3590 |
(up to Sylow's theorem) and ring theory (Universal Property of |
|
3591 |
Univariate Polynomials). Contributions welcome; |
|
13960 | 3592 |
|
3593 |
* GroupTheory: deleted, since its material has been moved to Algebra; |
|
3594 |
||
14731 | 3595 |
* Complex: new directory of the complex numbers with numeric constants, |
3596 |
nonstandard complex numbers, and some complex analysis, standard and |
|
13966
2160abf7cfe7
removal of the image HOL-Real and merging of HOL-Real-ex with HOL-Complex-ex
paulson
parents:
13960
diff
changeset
|
3597 |
nonstandard (Jacques Fleuriot); |
2160abf7cfe7
removal of the image HOL-Real and merging of HOL-Real-ex with HOL-Complex-ex
paulson
parents:
13960
diff
changeset
|
3598 |
|
2160abf7cfe7
removal of the image HOL-Real and merging of HOL-Real-ex with HOL-Complex-ex
paulson
parents:
13960
diff
changeset
|
3599 |
* HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal; |
2160abf7cfe7
removal of the image HOL-Real and merging of HOL-Real-ex with HOL-Complex-ex
paulson
parents:
13960
diff
changeset
|
3600 |
|
14731 | 3601 |
* Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques |
13966
2160abf7cfe7
removal of the image HOL-Real and merging of HOL-Real-ex with HOL-Complex-ex
paulson
parents:
13960
diff
changeset
|
3602 |
Fleuriot); |
13960 | 3603 |
|
13549 | 3604 |
* Real/HahnBanach: updated and adapted to locales; |
3605 |
||
13995 | 3606 |
* NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad, |
3607 |
Gray and Kramer); |
|
13872 | 3608 |
|
3609 |
* UNITY: added the Meier-Sanders theory of progress sets; |
|
3610 |
||
14011 | 3611 |
* MicroJava: bytecode verifier and lightweight bytecode verifier |
3612 |
as abstract algorithms, instantiated to the JVM; |
|
3613 |
||
14010 | 3614 |
* Bali: Java source language formalization. Type system, operational |
3615 |
semantics, axiomatic semantics. Supported language features: |
|
3616 |
classes, interfaces, objects,virtual methods, static methods, |
|
3617 |
static/instance fields, arrays, access modifiers, definite |
|
3618 |
assignment, exceptions. |
|
13549 | 3619 |
|
14011 | 3620 |
|
13549 | 3621 |
*** ZF *** |
3622 |
||
15154 | 3623 |
* ZF/Constructible: consistency proof for AC (Gdel's constructible |
13549 | 3624 |
universe, etc.); |
3625 |
||
13872 | 3626 |
* Main ZF: virtually all theories converted to new-style format; |
13518 | 3627 |
|
13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
3628 |
|
13478 | 3629 |
*** ML *** |
3630 |
||
3631 |
* Pure: Tactic.prove provides sane interface for internal proofs; |
|
3632 |
omits the infamous "standard" operation, so this is more appropriate |
|
3633 |
than prove_goalw_cterm in many situations (e.g. in simprocs); |
|
3634 |
||
3635 |
* Pure: improved error reporting of simprocs; |
|
3636 |
||
3637 |
* Provers: Simplifier.simproc(_i) provides sane interface for setting |
|
3638 |
up simprocs; |
|
3639 |
||
3640 |
||
13953 | 3641 |
*** Document preparation *** |
3642 |
||
3643 |
* uses \par instead of \\ for line breaks in theory text. This may |
|
3644 |
shift some page breaks in large documents. To get the old behaviour |
|
3645 |
use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex. |
|
3646 |
||
14731 | 3647 |
* minimized dependencies of isabelle.sty and isabellesym.sty on |
13953 | 3648 |
other packages |
3649 |
||
3650 |
* \<euro> now needs package babel/greek instead of marvosym (which |
|
3651 |
broke \Rightarrow) |
|
3652 |
||
14731 | 3653 |
* normal size for \<zero>...\<nine> (uses \mathbf instead of |
13954 | 3654 |
textcomp package) |
13953 | 3655 |
|
13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
3656 |
|
14572 | 3657 |
|
12984 | 3658 |
New in Isabelle2002 (March 2002) |
3659 |
-------------------------------- |
|
11474 | 3660 |
|
11572 | 3661 |
*** Document preparation *** |
3662 |
||
11842
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
3663 |
* greatly simplified document preparation setup, including more |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
3664 |
graceful interpretation of isatool usedir -i/-d/-D options, and more |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
3665 |
instructive isatool mkdir; users should basically be able to get |
12899
7d5b690253ee
"isatool usedir -D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset
|
3666 |
started with "isatool mkdir HOL Test && isatool make"; alternatively, |
7d5b690253ee
"isatool usedir -D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset
|
3667 |
users may run a separate document processing stage manually like this: |
7d5b690253ee
"isatool usedir -D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset
|
3668 |
"isatool usedir -D output HOL Test && isatool document Test/output"; |
11842
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
3669 |
|
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
3670 |
* theory dependency graph may now be incorporated into documents; |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
3671 |
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
|
3672 |
with \includegraphics of LaTeX; |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
3673 |
|
11864
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset
|
3674 |
* proper spacing of consecutive markup elements, especially text |
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset
|
3675 |
blocks after section headings; |
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset
|
3676 |
|
11572 | 3677 |
* support bold style (for single symbols only), input syntax is like |
3678 |
this: "\<^bold>\<alpha>" or "\<^bold>A"; |
|
3679 |
||
11814 | 3680 |
* \<bullet> is now output as bold \cdot by default, which looks much |
11572 | 3681 |
better in printed text; |
3682 |
||
11712
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset
|
3683 |
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>; |
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset
|
3684 |
note that these symbols are currently unavailable in Proof General / |
12769 | 3685 |
X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>; |
12690 | 3686 |
|
3687 |
* isatool latex no longer depends on changed TEXINPUTS, instead |
|
3688 |
isatool document copies the Isabelle style files to the target |
|
3689 |
location; |
|
11712
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset
|
3690 |
|
11572 | 3691 |
|
11633 | 3692 |
*** Isar *** |
3693 |
||
12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
3694 |
* Pure/Provers: improved proof by cases and induction; |
12280 | 3695 |
- 'case' command admits impromptu naming of parameters (such as |
3696 |
"case (Suc n)"); |
|
3697 |
- 'induct' method divinates rule instantiation from the inductive |
|
3698 |
claim; no longer requires excessive ?P bindings for proper |
|
3699 |
instantiation of cases; |
|
3700 |
- 'induct' method properly enumerates all possibilities of set/type |
|
3701 |
rules; as a consequence facts may be also passed through *type* |
|
3702 |
rules without further ado; |
|
3703 |
- 'induct' method now derives symbolic cases from the *rulified* |
|
3704 |
rule (before it used to rulify cases stemming from the internal |
|
3705 |
atomized version); this means that the context of a non-atomic |
|
3706 |
statement becomes is included in the hypothesis, avoiding the |
|
3707 |
slightly cumbersome show "PROP ?case" form; |
|
3708 |
- 'induct' may now use elim-style induction rules without chaining |
|
3709 |
facts, using ``missing'' premises from the goal state; this allows |
|
3710 |
rules stemming from inductive sets to be applied in unstructured |
|
3711 |
scripts, while still benefitting from proper handling of non-atomic |
|
3712 |
statements; NB: major inductive premises need to be put first, all |
|
3713 |
the rest of the goal is passed through the induction; |
|
3714 |
- 'induct' proper support for mutual induction involving non-atomic |
|
3715 |
rule statements (uses the new concept of simultaneous goals, see |
|
3716 |
below); |
|
12853 | 3717 |
- append all possible rule selections, but only use the first |
3718 |
success (no backtracking); |
|
11995
4a622f5fb164
- 'induct' may now use elim-style induction rules without chaining
wenzelm
parents:
11986
diff
changeset
|
3719 |
- removed obsolete "(simplified)" and "(stripped)" options of methods; |
12754
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset
|
3720 |
- undeclared rule case names default to numbers 1, 2, 3, ...; |
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset
|
3721 |
- added 'print_induct_rules' (covered by help item in recent Proof |
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset
|
3722 |
General versions); |
11995
4a622f5fb164
- 'induct' may now use elim-style induction rules without chaining
wenzelm
parents:
11986
diff
changeset
|
3723 |
- 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
|
3724 |
- 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
|
3725 |
|
12163
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
3726 |
* Pure: support multiple simultaneous goal statements, for example |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
3727 |
"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
|
3728 |
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
|
3729 |
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
|
3730 |
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
|
3731 |
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
|
3732 |
fails: |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
3733 |
|
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
3734 |
assume "A & B" then have A and B .. (*".." fails*) |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
3735 |
|
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
3736 |
better use "obtain" in situations as above; alternative refer to |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
3737 |
multi-step methods like 'auto', 'simp_all', 'blast+' etc.; |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
3738 |
|
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
3739 |
* Pure: proper integration with ``locales''; unlike the original |
15154 | 3740 |
version by Florian Kammller, Isar locales package high-level proof |
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
3741 |
contexts rather than raw logical ones (e.g. we admit to include |
12280 | 3742 |
attributes everywhere); operations on locales include merge and |
12964 | 3743 |
rename; support for implicit arguments (``structures''); simultaneous |
3744 |
type-inference over imports and text; see also HOL/ex/Locales.thy for |
|
3745 |
some examples; |
|
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
3746 |
|
12707
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
3747 |
* Pure: the following commands have been ``localized'', supporting a |
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
3748 |
target locale specification "(in name)": 'lemma', 'theorem', |
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
3749 |
'corollary', 'lemmas', 'theorems', 'declare'; the results will be |
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
3750 |
stored both within the locale and at the theory level (exported and |
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
3751 |
qualified by the locale name); |
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
3752 |
|
12964 | 3753 |
* Pure: theory goals may now be specified in ``long'' form, with |
3754 |
ad-hoc contexts consisting of arbitrary locale elements. for example |
|
3755 |
``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and |
|
3756 |
definitions may be given, too); the result is a meta-level rule with |
|
3757 |
the context elements being discharged in the obvious way; |
|
3758 |
||
3759 |
* Pure: new proof command 'using' allows to augment currently used |
|
3760 |
facts after a goal statement ('using' is syntactically analogous to |
|
3761 |
'apply', but acts on the goal's facts only); this allows chained facts |
|
3762 |
to be separated into parts given before and after a claim, as in |
|
3763 |
``from a and b have C using d and e <proof>''; |
|
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
3764 |
|
11722 | 3765 |
* Pure: renamed "antecedent" case to "rule_context"; |
3766 |
||
12964 | 3767 |
* Pure: new 'judgment' command records explicit information about the |
3768 |
object-logic embedding (used by several tools internally); no longer |
|
3769 |
use hard-wired "Trueprop"; |
|
3770 |
||
11738 | 3771 |
* Pure: added 'corollary' command; |
3772 |
||
11722 | 3773 |
* Pure: fixed 'token_translation' command; |
3774 |
||
11899 | 3775 |
* Pure: removed obsolete 'exported' attribute; |
3776 |
||
11933 | 3777 |
* Pure: dummy pattern "_" in is/let is now automatically lifted over |
3778 |
bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x") |
|
11899 | 3779 |
supersedes more cumbersome ... (is "ALL x. _ x --> ?C x"); |
3780 |
||
11952
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
3781 |
* 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
|
3782 |
statements (atomic meta-level propositions); setup controlled via |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
3783 |
rewrite rules declarations of 'atomize' attribute; example |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
3784 |
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
|
3785 |
proof *scripts*; |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
3786 |
|
12106
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
3787 |
* 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
|
3788 |
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
|
3789 |
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
|
3790 |
especially important for locales); |
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
3791 |
|
12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
3792 |
* Pure: "sorry" no longer requires quick_and_dirty in interactive |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
3793 |
mode; |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
3794 |
|
12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
3795 |
* Pure/obtain: the formal conclusion "thesis", being marked as |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
3796 |
``internal'', may no longer be reference directly in the text; |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
3797 |
potential INCOMPATIBILITY, may need to use "?thesis" in rare |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
3798 |
situations; |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
3799 |
|
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
3800 |
* Pure: generic 'sym' attribute which declares a rule both as pure |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
3801 |
'elim?' and for the 'symmetric' operation; |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
3802 |
|
12877
b9635eb8a448
* Isar/Pure: marginal comments ``--'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset
|
3803 |
* Pure: marginal comments ``--'' may now occur just anywhere in the |
b9635eb8a448
* Isar/Pure: marginal comments ``--'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset
|
3804 |
text; the fixed correlation with particular command syntax has been |
b9635eb8a448
* Isar/Pure: marginal comments ``--'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset
|
3805 |
discontinued; |
b9635eb8a448
* Isar/Pure: marginal comments ``--'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset
|
3806 |
|
13023
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
3807 |
* Pure: new method 'rules' is particularly well-suited for proof |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
3808 |
search in intuitionistic logic; a bit slower than 'blast' or 'fast', |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
3809 |
but often produces more compact proof terms with less detours; |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
3810 |
|
12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
3811 |
* Pure/Provers/classical: simplified integration with pure rule |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
3812 |
attributes and methods; the classical "intro?/elim?/dest?" |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
3813 |
declarations coincide with the pure ones; the "rule" method no longer |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
3814 |
includes classically swapped intros; "intro" and "elim" methods no |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
3815 |
longer pick rules from the context; also got rid of ML declarations |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
3816 |
AddXIs/AddXEs/AddXDs; all of this has some potential for |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
3817 |
INCOMPATIBILITY; |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
3818 |
|
12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
3819 |
* Provers/classical: attribute 'swapped' produces classical inversions |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
3820 |
of introduction rules; |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
3821 |
|
12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
3822 |
* Provers/simplifier: 'simplified' attribute may refer to explicit |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
3823 |
rules instead of full simplifier context; 'iff' attribute handles |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
3824 |
conditional rules; |
11936
fef099613354
* Provers: 'simplified' attribute may refer to explicit rules instead
wenzelm
parents:
11933
diff
changeset
|
3825 |
|
11745
06cd8c3b5487
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm
parents:
11738
diff
changeset
|
3826 |
* 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
|
3827 |
|
11690 | 3828 |
* HOL: 'recdef' now fails on unfinished automated proofs, use |
11633 | 3829 |
"(permissive)" option to recover old behavior; |
3830 |
||
11933 | 3831 |
* HOL: 'inductive' no longer features separate (collective) attributes |
3832 |
for 'intros' (was found too confusing); |
|
3833 |
||
12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
3834 |
* HOL: properly declared induction rules less_induct and |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
3835 |
wf_induct_rule; |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
3836 |
|
11788
60054fee3c16
canonical 'cases'/'induct' rules for n-tuples (n=3..7)
kleing
parents:
11745
diff
changeset
|
3837 |
|
11474 | 3838 |
*** HOL *** |
3839 |
||
11702 | 3840 |
* HOL: moved over to sane numeral syntax; the new policy is as |
3841 |
follows: |
|
3842 |
||
3843 |
- 0 and 1 are polymorphic constants, which are defined on any |
|
3844 |
numeric type (nat, int, real etc.); |
|
3845 |
||
3846 |
- 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based |
|
3847 |
binary representation internally; |
|
3848 |
||
3849 |
- type nat has special constructor Suc, and generally prefers Suc 0 |
|
3850 |
over 1::nat and Suc (Suc 0) over 2::nat; |
|
3851 |
||
12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
3852 |
This change may cause significant problems of INCOMPATIBILITY; here |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
3853 |
are some hints on converting existing sources: |
11702 | 3854 |
|
3855 |
- due to the new "num" token, "-0" and "-1" etc. are now atomic |
|
3856 |
entities, so expressions involving "-" (unary or binary minus) need |
|
3857 |
to be spaced properly; |
|
3858 |
||
3859 |
- existing occurrences of "1" may need to be constraint "1::nat" or |
|
3860 |
even replaced by Suc 0; similar for old "2"; |
|
3861 |
||
3862 |
- replace "#nnn" by "nnn", and "#-nnn" by "-nnn"; |
|
3863 |
||
3864 |
- remove all special provisions on numerals in proofs; |
|
3865 |
||
13042 | 3866 |
* HOL: simp rules nat_number expand numerals on nat to Suc/0 |
12837 | 3867 |
representation (depends on bin_arith_simps in the default context); |
3868 |
||
12736 | 3869 |
* HOL: symbolic syntax for x^2 (numeral 2); |
3870 |
||
12335
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
3871 |
* HOL: the class of all HOL types is now called "type" rather than |
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
3872 |
"term"; INCOMPATIBILITY, need to adapt references to this type class |
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
3873 |
in axclass/classes, instance/arities, and (usually rare) occurrences |
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
3874 |
in typings (of consts etc.); internally the class is called |
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
3875 |
"HOL.type", ML programs should refer to HOLogic.typeS; |
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
3876 |
|
12280 | 3877 |
* HOL/record package improvements: |
3878 |
- new derived operations "fields" to build a partial record section, |
|
3879 |
"extend" to promote a fixed record to a record scheme, and |
|
3880 |
"truncate" for the reverse; cf. theorems "xxx.defs", which are *not* |
|
3881 |
declared as simp by default; |
|
12587
3f3d2ffb5df5
HOL/record: shared operations ("more", "fields", etc.) now need to be
wenzelm
parents:
12564
diff
changeset
|
3882 |
- shared operations ("more", "fields", etc.) now need to be always |
3f3d2ffb5df5
HOL/record: shared operations ("more", "fields", etc.) now need to be
wenzelm
parents:
12564
diff
changeset
|
3883 |
qualified) --- potential INCOMPATIBILITY; |
12280 | 3884 |
- removed "make_scheme" operations (use "make" with "extend") -- |
3885 |
INCOMPATIBILITY; |
|
11937 | 3886 |
- removed "more" class (simply use "term") -- INCOMPATIBILITY; |
12253 | 3887 |
- provides cases/induct rules for use with corresponding Isar |
3888 |
methods (for concrete records, record schemes, concrete more |
|
12280 | 3889 |
parts, and schematic more parts -- in that order); |
11930 | 3890 |
- internal definitions directly based on a light-weight abstract |
3891 |
theory of product types over typedef rather than datatype; |
|
3892 |
||
13023
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
3893 |
* HOL: generic code generator for generating executable ML code from |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
3894 |
specifications; specific support for HOL constructs such as inductive |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
3895 |
datatypes and sets, as well as recursive functions; can be invoked |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
3896 |
via 'generate_code' theory section; |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
3897 |
|
11933 | 3898 |
* HOL: canonical cases/induct rules for n-tuples (n = 3..7); |
3899 |
||
13824 | 3900 |
* HOL: consolidated and renamed several theories. In particular: |
14731 | 3901 |
Ord.thy has been absorbed into HOL.thy |
3902 |
String.thy has been absorbed into List.thy |
|
3903 |
||
11802
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset
|
3904 |
* 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
|
3905 |
(beware of argument permutation!); |
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset
|
3906 |
|
11657 | 3907 |
* HOL: linorder_less_split superseded by linorder_cases; |
3908 |
||
12917 | 3909 |
* HOL/List: "nodups" renamed to "distinct"; |
12889 | 3910 |
|
11633 | 3911 |
* HOL: added "The" definite description operator; move Hilbert's "Eps" |
13824 | 3912 |
to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES: |
3913 |
- Ex_def has changed, now need to use some_eq_ex |
|
11437 | 3914 |
|
11572 | 3915 |
* HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so |
3916 |
in this (rare) case use: |
|
3917 |
||
3918 |
delSWrapper "split_all_tac" |
|
3919 |
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) |
|
3920 |
||
3921 |
* HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS |
|
11474 | 3922 |
MAY FAIL; |
11361 | 3923 |
|
11572 | 3924 |
* HOL: introduced f^n = f o ... o f; warning: due to the limits of |
3925 |
Isabelle's type classes, ^ on functions and relations has too general |
|
3926 |
a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be |
|
3927 |
necessary to attach explicit type constraints; |
|
11307 | 3928 |
|
12917 | 3929 |
* HOL/Relation: the prefix name of the infix "O" has been changed from |
3930 |
"comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been |
|
3931 |
renamed accordingly (eg "compI" -> "rel_compI"). |
|
12489 | 3932 |
|
11487
95071c9e85a3
* HOL: syntax translations now work properly with numerals and records
wenzelm
parents:
11475
diff
changeset
|
3933 |
* 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
|
3934 |
expressions; |
11474 | 3935 |
|
12457
cbfc53e45476
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm
parents:
12405
diff
changeset
|
3936 |
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead |
cbfc53e45476
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm
parents:
12405
diff
changeset
|
3937 |
of "lam" -- INCOMPATIBILITY; |
11474 | 3938 |
|
11933 | 3939 |
* HOL: got rid of some global declarations (potential INCOMPATIBILITY |
3940 |
for ML tools): const "()" renamed "Product_Type.Unity", type "unit" |
|
3941 |
renamed "Product_Type.unit"; |
|
11611 | 3942 |
|
12564 | 3943 |
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl |
3944 |
||
12924 | 3945 |
* HOL: removed obsolete theorem "optionE" (use "option.exhaust", or |
3946 |
the "cases" method); |
|
3947 |
||
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
3948 |
* HOL/GroupTheory: group theory examples including Sylow's theorem (by |
15154 | 3949 |
Florian Kammller); |
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
3950 |
|
12608
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
3951 |
* HOL/IMP: updated and converted to new-style theory format; several |
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
3952 |
parts turned into readable document, with proper Isar proof texts and |
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
3953 |
some explanations (by Gerwin Klein); |
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
3954 |
|
12734 | 3955 |
* HOL-Real: added Complex_Numbers (by Gertrud Bauer); |
3956 |
||
12690 | 3957 |
* HOL-Hyperreal is now a logic image; |
3958 |
||
11611 | 3959 |
|
12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
3960 |
*** HOLCF *** |
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
3961 |
|
12622 | 3962 |
* Isar: consts/constdefs supports mixfix syntax for continuous |
3963 |
operations; |
|
3964 |
||
3965 |
* Isar: domain package adapted to new-style theory format, e.g. see |
|
3966 |
HOLCF/ex/Dnat.thy; |
|
3967 |
||
3968 |
* theory Lift: proper use of rep_datatype lift instead of ML hacks -- |
|
12280 | 3969 |
potential INCOMPATIBILITY; now use plain induct_tac instead of former |
3970 |
lift.induct_tac, always use UU instead of Undef; |
|
12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
3971 |
|
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
3972 |
* HOLCF/IMP: updated and converted to new-style theory; |
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
3973 |
|
12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
3974 |
|
11474 | 3975 |
*** ZF *** |
3976 |
||
12622 | 3977 |
* Isar: proper integration of logic-specific tools and packages, |
3978 |
including theory commands '(co)inductive', '(co)datatype', |
|
3979 |
'rep_datatype', 'inductive_cases', as well as methods 'ind_cases', |
|
3980 |
'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC'); |
|
3981 |
||
3982 |
* theory Main no longer includes AC; for the Axiom of Choice, base |
|
3983 |
your theory on Main_ZFC; |
|
3984 |
||
3985 |
* the integer library now covers quotients and remainders, with many |
|
3986 |
laws relating division to addition, multiplication, etc.; |
|
12563 | 3987 |
|
12280 | 3988 |
* ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a |
3989 |
typeless version of the formalism; |
|
3990 |
||
13025 | 3991 |
* ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory |
3992 |
format; |
|
12608
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
3993 |
|
12280 | 3994 |
* ZF/Induct: new directory for examples of inductive definitions, |
12608
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
3995 |
including theory Multiset for multiset orderings; converted to |
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
3996 |
new-style theory format; |
12177
b1c16d685a99
* ZF: new-style theory commands 'inductive', 'inductive_cases', and
wenzelm
parents:
12163
diff
changeset
|
3997 |
|
13025 | 3998 |
* ZF: many new theorems about lists, ordinals, etc.; |
12850 | 3999 |
|
11474 | 4000 |
|
4001 |
*** General *** |
|
4002 |
||
12280 | 4003 |
* Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference |
4004 |
variable proof controls level of detail: 0 = no proofs (only oracle |
|
4005 |
dependencies), 1 = lemma dependencies, 2 = compact proof terms; see |
|
4006 |
also ref manual for further ML interfaces; |
|
4007 |
||
4008 |
* Pure/axclass: removed obsolete ML interface |
|
4009 |
goal_subclass/goal_arity; |
|
4010 |
||
4011 |
* Pure/syntax: new token syntax "num" for plain numerals (without "#" |
|
4012 |
of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now |
|
4013 |
separate tokens, so expressions involving minus need to be spaced |
|
4014 |
properly; |
|
4015 |
||
12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
4016 |
* Pure/syntax: support non-oriented infixes, using keyword "infix" |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
4017 |
rather than "infixl" or "infixr"; |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
4018 |
|
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
4019 |
* Pure/syntax: concrete syntax for dummy type variables admits genuine |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
4020 |
sort constraint specifications in type inference; e.g. "x::_::foo" |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
4021 |
ensures that the type of "x" is of sort "foo" (but not necessarily a |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
4022 |
type variable); |
12280 | 4023 |
|
4024 |
* Pure/syntax: print modes "type_brackets" and "no_type_brackets" |
|
4025 |
control output of nested => (types); the default behavior is |
|
4026 |
"type_brackets"; |
|
4027 |
||
4028 |
* Pure/syntax: builtin parse translation for "_constify" turns valued |
|
11817 | 4029 |
tokens into AST constants; |
11474 | 4030 |
|
12280 | 4031 |
* Pure/syntax: prefer later declarations of translations and print |
4032 |
translation functions; potential INCOMPATIBILITY: need to reverse |
|
4033 |
multiple declarations for same syntax element constant; |
|
4034 |
||
12832
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset
|
4035 |
* Pure/show_hyps reset by default (in accordance to existing Isar |
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset
|
4036 |
practice); |
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset
|
4037 |
|
12280 | 4038 |
* Provers/classical: renamed addaltern to addafter, addSaltern to |
4039 |
addSafter; |
|
4040 |
||
4041 |
* Provers/clasimp: ``iff'' declarations now handle conditional rules |
|
4042 |
as well; |
|
12253 | 4043 |
|
12538 | 4044 |
* system: tested support for MacOS X; should be able to get Isabelle + |
4045 |
Proof General to work in a plain Terminal after installing Poly/ML |
|
4046 |
(e.g. from the Isabelle distribution area) and GNU bash alone |
|
4047 |
(e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol |
|
4048 |
support requires further installations, e.g. from |
|
4049 |
http://fink.sourceforge.net/); |
|
4050 |
||
12280 | 4051 |
* system: support Poly/ML 4.1.1 (able to manage larger heaps); |
11551 | 4052 |
|
12753
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset
|
4053 |
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead |
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset
|
4054 |
of 40 MB), cf. ML_OPTIONS; |
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset
|
4055 |
|
11633 | 4056 |
* system: Proof General keywords specification is now part of the |
4057 |
Isabelle distribution (see etc/isar-keywords.el); |
|
4058 |
||
12728 | 4059 |
* system: support for persistent Proof General sessions (refrain from |
4060 |
outdating all loaded theories on startup); user may create writable |
|
4061 |
logic images like this: ``isabelle -q HOL Test''; |
|
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
4062 |
|
11551 | 4063 |
* system: smart selection of Isabelle process versus Isabelle |
11572 | 4064 |
interface, accommodates case-insensitive file systems (e.g. HFS+); may |
4065 |
run both "isabelle" and "Isabelle" even if file names are badly |
|
4066 |
damaged (executable inspects the case of the first letter of its own |
|
4067 |
name); added separate "isabelle-process" and "isabelle-interface"; |
|
11551 | 4068 |
|
12472 | 4069 |
* system: refrain from any attempt at filtering input streams; no |
4070 |
longer support ``8bit'' encoding of old isabelle font, instead proper |
|
4071 |
iso-latin characters may now be used; the related isatools |
|
4072 |
"symbolinput" and "nonascii" have disappeared as well; |
|
4073 |
||
4074 |
* system: removed old "xterm" interface (the print modes "xterm" and |
|
4075 |
"xterm_color" are still available for direct use in a suitable |
|
4076 |
terminal); |
|
4077 |
||
11314 | 4078 |
|
11169
98c2f741e32b
made split_all_tac safe introducing safe_full_simp_tac, EXISTING PROOFS MAY FAIL
oheimb
parents:
11130
diff
changeset
|
4079 |
|
11062 | 4080 |
New in Isabelle99-2 (February 2001) |
4081 |
----------------------------------- |
|
4082 |
||
10224 | 4083 |
*** Overview of INCOMPATIBILITIES *** |
4084 |
||
11241 | 4085 |
* HOL: please note that theories in the Library and elsewhere often use the |
4086 |
new-style (Isar) format; to refer to their theorems in an ML script you must |
|
12622 | 4087 |
bind them to ML identifers by e.g. val thm_name = thm "thm_name"; |
11241 | 4088 |
|
11043
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset
|
4089 |
* HOL: inductive package no longer splits induction rule aggressively, |
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset
|
4090 |
but only as far as specified by the introductions given; the old |
11130 | 4091 |
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
|
4092 |
'split_rule (complete)'; |
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset
|
4093 |
|
10998 | 4094 |
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, |
4095 |
gfp_Tarski to gfp_unfold; |
|
10224 | 4096 |
|
10288 | 4097 |
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; |
4098 |
||
10858 | 4099 |
* HOL: infix "dvd" now has priority 50 rather than 70 (because it is a |
4100 |
relation); infix "^^" has been renamed "``"; infix "``" has been |
|
4101 |
renamed "`"; "univalent" has been renamed "single_valued"; |
|
10793 | 4102 |
|
10998 | 4103 |
* HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse" |
4104 |
operation; |
|
4105 |
||
10868 | 4106 |
* HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>; |
10856 | 4107 |
|
10391 | 4108 |
* Isar: 'obtain' no longer declares "that" fact as simp/intro; |
4109 |
||
10401
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
4110 |
* 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
|
4111 |
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
|
4112 |
(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
|
4113 |
|
10976
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset
|
4114 |
* Document preparation: renamed standard symbols \<ll> to \<lless> and |
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset
|
4115 |
\<gg> to \<ggreater>; |
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset
|
4116 |
|
10224 | 4117 |
|
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
4118 |
*** Document preparation *** |
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
4119 |
|
10858 | 4120 |
* \isabellestyle{NAME} selects version of Isabelle output (currently |
4121 |
available: are "it" for near math-mode best-style output, "sl" for |
|
4122 |
slanted text style, and "tt" for plain type-writer; if no |
|
4123 |
\isabellestyle command is given, output is according to slanted |
|
4124 |
type-writer); |
|
4125 |
||
10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset
|
4126 |
* 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
|
4127 |
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
|
4128 |
|
10858 | 4129 |
* some more standard symbols; see Appendix A of the system manual for |
11062 | 4130 |
the complete list of symbols defined in isabellesym.sty; |
10858 | 4131 |
|
10998 | 4132 |
* improved isabelle style files; more abstract symbol implementation |
4133 |
(should now use \isamath{...} and \isatext{...} in custom symbol |
|
4134 |
definitions); |
|
4135 |
||
10634 | 4136 |
* antiquotation @{goals} and @{subgoals} for output of *dynamic* goals |
4137 |
state; Note that presentation of goal states does not conform to |
|
4138 |
actual human-readable proof documents. Please do not include goal |
|
4139 |
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
|
4140 |
|
11062 | 4141 |
* proper indentation of antiquoted output with proportional LaTeX |
4142 |
fonts; |
|
10862 | 4143 |
|
11050
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset
|
4144 |
* no_document ML operator temporarily disables LaTeX document |
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset
|
4145 |
generation; |
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset
|
4146 |
|
11062 | 4147 |
* isatool unsymbolize tunes sources for plain ASCII communication; |
4148 |
||
10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset
|
4149 |
|
10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset
|
4150 |
*** Isar *** |
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset
|
4151 |
|
10547 | 4152 |
* Pure: Isar now suffers initial goal statements to contain unbound |
4153 |
schematic variables (this does not conform to actual readable proof |
|
4154 |
documents, due to unpredictable outcome and non-compositional proof |
|
4155 |
checking); users who know what they are doing may use schematic goals |
|
4156 |
for Prolog-style synthesis of proven results; |
|
4157 |
||
10391 | 4158 |
* Pure: assumption method (an implicit finishing) now handles actual |
4159 |
rules as well; |
|
4160 |
||
4161 |
* Pure: improved 'obtain' --- moved to Pure, insert "that" into |
|
4162 |
initial goal, declare "that" only as Pure intro (only for single |
|
4163 |
steps); the "that" rule assumption may now be involved in implicit |
|
4164 |
finishing, thus ".." becomes a feasible for trivial obtains; |
|
4165 |
||
4166 |
* Pure: default proof step now includes 'intro_classes'; thus trivial |
|
4167 |
instance proofs may be performed by ".."; |
|
4168 |
||
4169 |
* Pure: ?thesis / ?this / "..." now work for pure meta-level |
|
4170 |
statements as well; |
|
10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset
|
4171 |
|
11097 | 4172 |
* Pure: more robust selection of calculational rules; |
4173 |
||
10858 | 4174 |
* Pure: the builtin notion of 'finished' goal now includes the ==-refl |
4175 |
rule (as well as the assumption rule); |
|
4176 |
||
4177 |
* Pure: 'thm_deps' command visualizes dependencies of theorems and |
|
4178 |
lemmas, using the graph browser tool; |
|
4179 |
||
10944 | 4180 |
* Pure: predict failure of "show" in interactive mode; |
4181 |
||
11016
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset
|
4182 |
* Pure: 'thms_containing' now takes actual terms as arguments; |
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset
|
4183 |
|
10401
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
4184 |
* 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
|
4185 |
(potential INCOMPATIBILITY); tuned error handling; |
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
4186 |
|
10557 | 4187 |
* HOL: cases and induct rules now provide explicit hints about the |
10547 | 4188 |
number of facts to be consumed (0 for "type" and 1 for "set" rules); |
4189 |
any remaining facts are inserted into the goal verbatim; |
|
4190 |
||
10858 | 4191 |
* HOL: local contexts (aka cases) may now contain term bindings as |
4192 |
well; the 'cases' and 'induct' methods new provide a ?case binding for |
|
4193 |
the result to be shown in each case; |
|
4194 |
||
10770 | 4195 |
* HOL: added 'recdef_tc' command; |
4196 |
||
11016
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset
|
4197 |
* isatool convert assists in eliminating legacy ML scripts; |
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset
|
4198 |
|
10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset
|
4199 |
|
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
4200 |
*** HOL *** |
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
4201 |
|
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
4202 |
* 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
|
4203 |
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
|
4204 |
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
|
4205 |
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While |
10337 | 4206 |
(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
|
4207 |
|
10966 | 4208 |
* HOL/Unix: "Some aspects of Unix file-system security", a typical |
4209 |
modelling and verification task performed in Isabelle/HOL + |
|
4210 |
Isabelle/Isar + Isabelle document preparation (by Markus Wenzel). |
|
4211 |
||
11094 | 4212 |
* HOL/Algebra: special summation operator SUM no longer exists, it has |
4213 |
been replaced by setsum; infix 'assoc' now has priority 50 (like |
|
4214 |
'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to |
|
4215 |
'domain', this makes the theory consistent with mathematical |
|
4216 |
literature; |
|
4217 |
||
10514 | 4218 |
* HOL basics: added overloaded operations "inverse" and "divide" |
10726 | 4219 |
(infix "/"), syntax for generic "abs" operation, generic summation |
11094 | 4220 |
operator \<Sum>; |
10452
abeefb0a79ae
* added overloaded operations "inverse" and "divide" (infix "/");
wenzelm
parents:
10428
diff
changeset
|
4221 |
|
10391 | 4222 |
* HOL/typedef: simplified package, provide more useful rules (see also |
4223 |
HOL/subset.thy); |
|
4224 |
||
10915
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
4225 |
* HOL/datatype: induction rule for arbitrarily branching datatypes is |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
4226 |
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
|
4227 |
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
|
4228 |
|
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
4229 |
* 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
|
4230 |
to "split_conv" (old name still available for compatibility); |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
4231 |
|
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
4232 |
* 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
|
4233 |
rules with string literals); |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
4234 |
|
12245 | 4235 |
* HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals |
4236 |
and Fleuriot's mechanization of analysis, including the transcendental |
|
4237 |
functions for the reals; |
|
10756 | 4238 |
|
11094 | 4239 |
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; |
10391 | 4240 |
|
10858 | 4241 |
|
10474 | 4242 |
*** CTT *** |
4243 |
||
10547 | 4244 |
* CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that |
4245 |
"lam" is displayed as TWO lambda-symbols |
|
10474 | 4246 |
|
10547 | 4247 |
* CTT: theory Main now available, containing everything (that is, Bool |
4248 |
and Arith); |
|
4249 |
||
10474 | 4250 |
|
10391 | 4251 |
*** General *** |
4252 |
||
10547 | 4253 |
* Pure: the Simplifier has been implemented properly as a derived rule |
4254 |
outside of the actual kernel (at last!); the overall performance |
|
4255 |
penalty in practical applications is about 50%, while reliability of |
|
4256 |
the Isabelle inference kernel has been greatly improved; |
|
4257 |
||
11112 | 4258 |
* print modes "brackets" and "no_brackets" control output of nested => |
4259 |
(types) and ==> (props); the default behaviour is "brackets"; |
|
4260 |
||
10391 | 4261 |
* Provers: fast_tac (and friends) now handle actual object-logic rules |
4262 |
as assumptions as well; |
|
4263 |
||
11124 | 4264 |
* system: support Poly/ML 4.0; |
4265 |
||
4266 |
* system: isatool install handles KDE version 1 or 2; |
|
4267 |
||
10391 | 4268 |
|
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
4269 |
|
10103 | 4270 |
New in Isabelle99-1 (October 2000) |
4271 |
---------------------------------- |
|
8015 | 4272 |
|
10003 | 4273 |
*** Overview of INCOMPATIBILITIES *** |
8014 | 4274 |
|
8848 | 4275 |
* HOL: simplification of natural numbers is much changed; to partly |
4276 |
recover the old behaviour (e.g. to prevent n+n rewriting to #2*n) |
|
4277 |
issue the following ML commands: |
|
4278 |
||
4279 |
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; |
|
4280 |
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; |
|
8788 | 4281 |
|
10129 | 4282 |
* HOL: simplification no longer dives into case-expressions; this is |
4283 |
controlled by "t.weak_case_cong" for each datatype t; |
|
10003 | 4284 |
|
4285 |
* HOL: nat_less_induct renamed to less_induct; |
|
4286 |
||
4287 |
* HOL: systematic renaming of the SOME (Eps) rules, may use isatool |
|
4288 |
fixsome to patch .thy and .ML sources automatically; |
|
8967 | 4289 |
|
10003 | 4290 |
select_equality -> some_equality |
4291 |
select_eq_Ex -> some_eq_ex |
|
4292 |
selectI2EX -> someI2_ex |
|
4293 |
selectI2 -> someI2 |
|
4294 |
selectI -> someI |
|
4295 |
select1_equality -> some1_equality |
|
4296 |
Eps_sym_eq -> some_sym_eq_trivial |
|
4297 |
Eps_eq -> some_eq_trivial |
|
4298 |
||
4299 |
* HOL: exhaust_tac on datatypes superceded by new generic case_tac; |
|
4300 |
||
4301 |
* HOL: removed obsolete theorem binding expand_if (refer to split_if |
|
4302 |
instead); |
|
4303 |
||
4304 |
* HOL: the recursion equations generated by 'recdef' are now called |
|
4305 |
f.simps instead of f.rules; |
|
4306 |
||
4307 |
* HOL: qed_spec_mp now also handles bounded ALL as well; |
|
4308 |
||
4309 |
* HOL: 0 is now overloaded, so the type constraint ":: nat" may |
|
4310 |
sometimes be needed; |
|
4311 |
||
4312 |
* HOL: the constant for "f``x" is now "image" rather than "op ``"; |
|
8014 | 4313 |
|
10065 | 4314 |
* HOL: the constant for "f-``x" is now "vimage" rather than "op -``"; |
4315 |
||
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
4316 |
* 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
|
4317 |
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
|
4318 |
now "<*lex*>" instead of "**"; |
8705 | 4319 |
|
10003 | 4320 |
* HOL: theory Sexp is now in HOL/Induct examples (it used to be part |
4321 |
of main HOL, but was unused); better use HOL's datatype package; |
|
9971 | 4322 |
|
10137
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
4323 |
* HOL: removed "symbols" syntax for constant "override" of theory Map; |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
4324 |
the old syntax may be recovered as follows: |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
4325 |
|
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
4326 |
syntax (symbols) |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
4327 |
override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)" |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
4328 |
(infixl "\\<oplus>" 100) |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
4329 |
|
8848 | 4330 |
* HOL/Real: "rabs" replaced by overloaded "abs" function; |
4331 |
||
8887
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset
|
4332 |
* 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
|
4333 |
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
|
4334 |
internally; |
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset
|
4335 |
|
10003 | 4336 |
* HOL and ZF: syntax for quotienting wrt an equivalence relation |
4337 |
changed from A/r to A//r; |
|
9908 | 4338 |
|
10003 | 4339 |
* ZF: new treatment of arithmetic (nat & int) may break some old |
4340 |
proofs; |
|
8921
7c04c98132c4
* Pure: changed syntax of local blocks from {{ }} to { };
wenzelm
parents:
8887
diff
changeset
|
4341 |
|
10003 | 4342 |
* Isar: renamed some attributes (RS -> THEN, simplify -> simplified, |
4343 |
rulify -> rule_format, elimify -> elim_format, ...); |
|
9542 | 4344 |
|
9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
4345 |
* Isar/Provers: intro/elim/dest attributes changed; renamed |
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
4346 |
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one |
9937 | 4347 |
should have to change intro!! to intro? only); replaced "delrule" by |
4348 |
"rule del"; |
|
9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset
|
4349 |
|
9612 | 4350 |
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; |
4351 |
||
9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset
|
4352 |
* Provers: strengthened force_tac by using new first_best_tac; |
9402 | 4353 |
|
10003 | 4354 |
* LaTeX document preparation: several changes of isabelle.sty (see |
4355 |
lib/texinputs); |
|
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
4356 |
|
8014 | 4357 |
|
8487 | 4358 |
*** Document preparation *** |
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
4359 |
|
9198
0ab3c81e9425
* formal comments (text blocks etc.) in new-style theories may now
wenzelm
parents:
9185
diff
changeset
|
4360 |
* formal comments (text blocks etc.) in new-style theories may now |
9753 | 4361 |
contain antiquotations of thm/prop/term/typ/text to be presented |
4362 |
according to latex print mode; concrete syntax is like this: |
|
4363 |
@{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
|
4364 |
|
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
4365 |
* isatool mkdir provides easy setup of Isabelle session directories, |
8518 | 4366 |
including proper document sources; |
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
4367 |
|
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
4368 |
* generated LaTeX sources are now deleted after successful run |
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
4369 |
(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
|
4370 |
of isatool usedir; |
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
4371 |
|
8566 | 4372 |
* isatool usedir -D now lets isatool latex -o sty update the Isabelle |
10003 | 4373 |
style files, achieving self-contained LaTeX sources and simplifying |
4374 |
LaTeX debugging; |
|
8566 | 4375 |
|
8518 | 4376 |
* 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
|
4377 |
|
9057
af1ca1acf292
* browser info session directories are now self-contained (may be put
wenzelm
parents:
9052
diff
changeset
|
4378 |
* 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
|
4379 |
on WWW server seperately); improved graphs of nested sessions; removed |
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset
|
4380 |
graph for 'all sessions'; |
9057
af1ca1acf292
* browser info session directories are now self-contained (may be put
wenzelm
parents:
9052
diff
changeset
|
4381 |
|
10003 | 4382 |
* several improvements in isabelle style files; \isabellestyle{it} |
4383 |
produces fake math mode output; \isamarkupheader is now \section by |
|
4384 |
default; see lib/texinputs/isabelle.sty etc.; |
|
9489
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
4385 |
|
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
4386 |
|
8184 | 4387 |
*** Isar *** |
4388 |
||
10003 | 4389 |
* Isar/Pure: local results and corresponding term bindings are now |
4390 |
subject to Hindley-Milner polymorphism (similar to ML); this |
|
4391 |
accommodates incremental type-inference very nicely; |
|
8283
0a319c5746eb
* Pure now provides its own version of intro/elim/dest attributes;
wenzelm
parents:
8271
diff
changeset
|
4392 |
|
10003 | 4393 |
* Isar/Pure: new derived language element 'obtain' supports |
4394 |
generalized existence reasoning; |
|
8621
8ba0f90f6f35
* Isar/Pure: local results and corresponding term bindings are now
wenzelm
parents:
8603
diff
changeset
|
4395 |
|
10003 | 4396 |
* Isar/Pure: new calculational elements 'moreover' and 'ultimately' |
4397 |
support accumulation of results, without applying any rules yet; |
|
4398 |
useful to collect intermediate results without explicit name |
|
4399 |
references, and for use with transitivity rules with more than 2 |
|
4400 |
premises; |
|
8184 | 4401 |
|
10003 | 4402 |
* Isar/Pure: scalable support for case-analysis type proofs: new |
4403 |
'case' language element refers to local contexts symbolically, as |
|
4404 |
produced by certain proof methods; internally, case names are attached |
|
4405 |
to theorems as "tags"; |
|
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
4406 |
|
10003 | 4407 |
* Isar/Pure: theory command 'hide' removes declarations from |
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
4408 |
class/type/const name spaces; |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
4409 |
|
10003 | 4410 |
* 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
|
4411 |
indicate potential overloading; |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
4412 |
|
10003 | 4413 |
* 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
|
4414 |
|
10003 | 4415 |
* Isar/Pure: syntax of sorts made 'inner', i.e. have to write |
4416 |
"{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
|
4417 |
|
10003 | 4418 |
* Isar/Pure now provides its own version of intro/elim/dest |
4419 |
attributes; useful for building new logics, but beware of confusion |
|
4420 |
with the version in Provers/classical; |
|
9612 | 4421 |
|
10003 | 4422 |
* Isar/Pure: the local context of (non-atomic) goals is provided via |
4423 |
case name 'antecedent'; |
|
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
4424 |
|
10003 | 4425 |
* Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms |
4426 |
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
|
4427 |
|
10003 | 4428 |
* Isar/Pure: theory command 'method_setup' provides a simple interface |
4429 |
for definining proof methods in ML; |
|
9612 | 4430 |
|
10003 | 4431 |
* 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
|
4432 |
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
|
4433 |
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
|
4434 |
replaced "delrule" by "rule del"; |
8283
0a319c5746eb
* Pure now provides its own version of intro/elim/dest attributes;
wenzelm
parents:
8271
diff
changeset
|
4435 |
|
10003 | 4436 |
* Isar/Provers: new 'hypsubst' method, plain 'subst' method and |
4437 |
'symmetric' attribute (the latter supercedes [RS sym]); |
|
4438 |
||
4439 |
* Isar/Provers: splitter support (via 'split' attribute and 'simp' |
|
4440 |
method modifier); 'simp' method: 'only:' modifier removes loopers as |
|
4441 |
well (including splits); |
|
4442 |
||
4443 |
* Isar/Provers: Simplifier and Classical methods now support all kind |
|
4444 |
of modifiers used in the past, including 'cong', 'iff', etc. |
|
4445 |
||
4446 |
* Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination |
|
4447 |
of Simplifier and Classical reasoner); |
|
4448 |
||
4449 |
* Isar/HOL: new proof method 'cases' and improved version of 'induct' |
|
4450 |
now support named cases; major packages (inductive, datatype, primrec, |
|
4451 |
recdef) support case names and properly name parameters; |
|
9612 | 4452 |
|
10003 | 4453 |
* Isar/HOL: new transitivity rules for substitution in inequalities -- |
4454 |
monotonicity conditions are extracted to be proven at end of |
|
4455 |
calculations; |
|
4456 |
||
4457 |
* Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof |
|
4458 |
method anyway; |
|
4459 |
||
4460 |
* Isar/HOL: removed old expand_if = split_if; theorems if_splits = |
|
4461 |
split_if split_if_asm; datatype package provides theorems foo.splits = |
|
4462 |
foo.split foo.split_asm for each datatype; |
|
4463 |
||
4464 |
* Isar/HOL: tuned inductive package, rename "intrs" to "intros" |
|
4465 |
(potential INCOMPATIBILITY), emulation of mk_cases feature for proof |
|
4466 |
scripts: new 'inductive_cases' command and 'ind_cases' method; (Note: |
|
4467 |
use "(cases (simplified))" method in proper proof texts); |
|
4468 |
||
4469 |
* Isar/HOL: added global 'arith_split' attribute for 'arith' method; |
|
4470 |
||
4471 |
* Isar: names of theorems etc. may be natural numbers as well; |
|
4472 |
||
4473 |
* Isar: 'pr' command: optional arguments for goals_limit and |
|
9724
2030c5d63741
* 'pr' command: optional argument for ProofContext.prems_limit;
wenzelm
parents:
9709
diff
changeset
|
4474 |
ProofContext.prems_limit; no longer prints theory contexts, but only |
2030c5d63741
* 'pr' command: optional argument for ProofContext.prems_limit;
wenzelm
parents:
9709
diff
changeset
|
4475 |
proof states; |
8487 | 4476 |
|
10003 | 4477 |
* Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit |
8518 | 4478 |
additional print modes to be specified; e.g. "pr(latex)" will print |
4479 |
proof state according to the Isabelle LaTeX style; |
|
8487 | 4480 |
|
10003 | 4481 |
* Isar: improved support for emulating tactic scripts, including proof |
9612 | 4482 |
methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac', |
4483 |
'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac' |
|
4484 |
(for HOL datatypes); |
|
8534 | 4485 |
|
10003 | 4486 |
* Isar: simplified (more robust) goal selection of proof methods: 1st |
4487 |
goal, all goals, or explicit goal specifier (tactic emulation); thus |
|
4488 |
'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
|
4489 |
|
10003 | 4490 |
* 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
|
4491 |
|
10003 | 4492 |
* Isar: removed 'help' command, which hasn't been too helpful anyway; |
4493 |
should instead use individual commands for printing items |
|
4494 |
(print_commands, print_methods etc.); |
|
9224
0da360494917
* Isar: removed 'help' command, which hasn't been too helpful anyway;
wenzelm
parents:
9198
diff
changeset
|
4495 |
|
10003 | 4496 |
* Isar: added 'nothing' --- the empty list of theorems; |
9239 | 4497 |
|
8184 | 4498 |
|
8014 | 4499 |
*** HOL *** |
4500 |
||
10080 | 4501 |
* HOL/MicroJava: formalization of a fragment of Java, together with a |
4502 |
corresponding virtual machine and a specification of its bytecode |
|
4503 |
verifier and a lightweight bytecode verifier, including proofs of |
|
4504 |
type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and |
|
4505 |
Cornelia Pusch (see also the homepage of project Bali at |
|
4506 |
http://isabelle.in.tum.de/Bali/); |
|
4507 |
||
8518 | 4508 |
* HOL/Algebra: new theory of rings and univariate polynomials, by |
4509 |
Clemens Ballarin; |
|
8014 | 4510 |
|
10157
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
4511 |
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese |
10003 | 4512 |
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M |
4513 |
Rasmussen; |
|
8570 | 4514 |
|
10157
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
4515 |
* 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
|
4516 |
structures, including duals, properties of bounds versus algebraic |
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
4517 |
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
|
4518 |
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
|
4519 |
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
|
4520 |
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
|
4521 |
|
10003 | 4522 |
* HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David |
4523 |
von Oheimb; |
|
9542 | 4524 |
|
10164
c240747082aa
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm
parents:
10157
diff
changeset
|
4525 |
* 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
|
4526 |
recursive procedures, by David von Oheimb; |
c240747082aa
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm
parents:
10157
diff
changeset
|
4527 |
|
10003 | 4528 |
* HOL/Lambda: converted into new-style theory and document; |
9542 | 4529 |
|
10003 | 4530 |
* HOL/ex/Multiquote: example of multiple nested quotations and |
4531 |
anti-quotations -- basically a generalized version of de-Bruijn |
|
4532 |
representation; very useful in avoiding lifting of operations; |
|
8848 | 4533 |
|
9612 | 4534 |
* HOL/record: added general record equality rule to simpset; fixed |
4535 |
select-update simplification procedure to handle extended records as |
|
4536 |
well; admit "r" as field name; |
|
9542 | 4537 |
|
8967 | 4538 |
* HOL: 0 is now overloaded over the new sort "zero", allowing its use with |
4539 |
other numeric types and also as the identity of groups, rings, etc.; |
|
4540 |
||
4541 |
* HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity. |
|
4542 |
Types nat and int belong to this axclass; |
|
4543 |
||
10003 | 4544 |
* HOL: greatly improved simplification involving numerals of type nat, int, real: |
8788 | 4545 |
(i + #8 + j) = Suc k simplifies to #7 + (i + j) = k |
8832 | 4546 |
i*j + k + j*#3*i simplifies to #4*(i*j) + k |
4547 |
two terms #m*u and #n*u are replaced by #(m+n)*u |
|
4548 |
(where #m, #n and u can implicitly be 1; this is simproc combine_numerals) |
|
4549 |
and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y |
|
4550 |
or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals); |
|
8736 | 4551 |
|
10003 | 4552 |
* HOL: meson_tac is available (previously in ex/meson.ML); it is a |
4553 |
powerful prover for predicate logic but knows nothing of clasets; see |
|
4554 |
ex/mesontest.ML and ex/mesontest2.ML for example applications; |
|
9835 | 4555 |
|
8848 | 4556 |
* 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
|
4557 |
"exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer |
8518 | 4558 |
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
|
4559 |
|
8848 | 4560 |
* HOL: simplification no longer dives into case-expressions: only the |
10129 | 4561 |
selector expression is simplified, but not the remaining arms; to |
4562 |
enable full simplification of case-expressions for datatype t, you may |
|
4563 |
remove t.weak_case_cong from the simpset, either globally (Delcongs |
|
4564 |
[thm"t.weak_case_cong"];) or locally (delcongs [...]). |
|
8603 | 4565 |
|
8848 | 4566 |
* HOL/recdef: the recursion equations generated by 'recdef' for |
4567 |
function 'f' are now called f.simps instead of f.rules; if all |
|
4568 |
termination conditions are proved automatically, these simplification |
|
4569 |
rules are added to the simpset, as in primrec; rules may be named |
|
4570 |
individually as well, resulting in a separate list of theorems for |
|
4571 |
each equation; |
|
4572 |
||
9489
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
4573 |
* 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
|
4574 |
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
|
4575 |
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
|
4576 |
invariant proof rule for while is applied. |
9457 | 4577 |
|
10003 | 4578 |
* HOL: new (overloaded) notation for the set of elements below/above |
4579 |
some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval. |
|
8925 | 4580 |
|
8848 | 4581 |
* HOL: theorems impI, allI, ballI bound as "strip"; |
4582 |
||
10003 | 4583 |
* HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic |
9746 | 4584 |
induct_tac th "x1 ... xn" expects th to have a conclusion of the form |
4585 |
P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th; |
|
4586 |
||
10003 | 4587 |
* HOL/Real: "rabs" replaced by overloaded "abs" function; |
9737 | 4588 |
|
10003 | 4589 |
* HOL: theory Sexp now in HOL/Induct examples (it used to be part of |
4590 |
main HOL, but was unused); |
|
8626 | 4591 |
|
10003 | 4592 |
* HOL: fewer consts declared as global (e.g. have to refer to |
4593 |
"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
|
4594 |
|
10003 | 4595 |
* HOL: tuned AST representation of nested pairs, avoiding bogus output |
4596 |
in case of overlap with user translations (e.g. judgements over |
|
4597 |
tuples); (note that the underlying logical represenation is still |
|
4598 |
bogus); |
|
9349
d43669fb423d
* tuned AST representation of nested pairs, avoiding bogus output in
wenzelm
parents:
9335
diff
changeset
|
4599 |
|
8412 | 4600 |
|
9542 | 4601 |
*** ZF *** |
4602 |
||
10003 | 4603 |
* ZF: simplification automatically cancels common terms in arithmetic |
4604 |
expressions over nat and int; |
|
9542 | 4605 |
|
10003 | 4606 |
* ZF: new treatment of nat to minimize type-checking: all operators |
4607 |
coerce their operands to a natural number using the function natify, |
|
4608 |
making the algebraic laws unconditional; |
|
9542 | 4609 |
|
10003 | 4610 |
* ZF: as above, for int: operators coerce their operands to an integer |
4611 |
using the function intify; |
|
9542 | 4612 |
|
10003 | 4613 |
* ZF: the integer library now contains many of the usual laws for the |
4614 |
orderings, including $<=, and monotonicity laws for $+ and $*; |
|
9542 | 4615 |
|
10003 | 4616 |
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic |
4617 |
simplification; |
|
9388 | 4618 |
|
10003 | 4619 |
* FOL and ZF: AddIffs now available, giving theorems of the form P<->Q |
4620 |
to the simplifier and classical reasoner simultaneously; |
|
9388 | 4621 |
|
4622 |
||
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
4623 |
*** General *** |
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
4624 |
|
10003 | 4625 |
* Provers: blast_tac now handles actual object-logic rules as |
4626 |
assumptions; note that auto_tac uses blast_tac internally as well; |
|
4627 |
||
4628 |
* Provers: new functions rulify/rulify_no_asm: thm -> thm for turning |
|
4629 |
outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm; |
|
4630 |
||
9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
4631 |
* 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
|
4632 |
explicit make_elim); |
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
4633 |
|
10003 | 4634 |
* Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g. |
4635 |
[| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W |
|
4636 |
use instead the strong form, |
|
4637 |
[| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W |
|
4638 |
in HOL, FOL and ZF the function cla_make_elim will create such rules |
|
4639 |
from destruct-rules; |
|
9489
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
4640 |
|
9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
4641 |
* Provers: Simplifier.easy_setup provides a fast path to basic |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
4642 |
Simplifier setup for new object-logics; |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
4643 |
|
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
4644 |
* 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
|
4645 |
|
9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
4646 |
* Pure: improved name spaces: ambiguous output is qualified; support |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
4647 |
for hiding of names; |
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
4648 |
|
10003 | 4649 |
* system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and |
4650 |
XSYMBOL_HOME; no longer need to do manual configuration in most |
|
4651 |
situations; |
|
4652 |
||
9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
4653 |
* 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
|
4654 |
option of isabelle and isatool usedir (currently only observed by |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
4655 |
Poly/ML); |
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
4656 |
|
9981
01a0c4772c18
system: isatool installfonts may handle X-Symbol fonts as well;
wenzelm
parents:
9971
diff
changeset
|
4657 |
* 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
|
4658 |
useful for remote X11); |
01a0c4772c18
system: isatool installfonts may handle X-Symbol fonts as well;
wenzelm
parents:
9971
diff
changeset
|
4659 |
|
9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
4660 |
* system: provide TAGS file for Isabelle sources; |
9052 | 4661 |
|
9288
06a55195741b
infix 'OF' is a version of 'MRS' with more appropriate argument order;
wenzelm
parents:
9239
diff
changeset
|
4662 |
* 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
|
4663 |
order; |
06a55195741b
infix 'OF' is a version of 'MRS' with more appropriate argument order;
wenzelm
parents:
9239
diff
changeset
|
4664 |
|
8994
803533fbb3ec
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
wenzelm
parents:
8991
diff
changeset
|
4665 |
* 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
|
4666 |
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
|
4667 |
|
10003 | 4668 |
* ML: new combinators |>> and |>>> for incremental transformations |
4669 |
with secondary results (e.g. certain theory extensions): |
|
4670 |
||
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
4671 |
* 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
|
4672 |
overloading (usually false); |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
4673 |
|
10003 | 4674 |
* ML: PureThy.add_thms/add_axioms/add_defs now return theorems as |
4675 |
results; |
|
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
4676 |
|
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
4677 |
|
8015 | 4678 |
|
7986 | 4679 |
New in Isabelle99 (October 1999) |
4680 |
-------------------------------- |
|
4649 | 4681 |
|
5931 | 4682 |
*** Overview of INCOMPATIBILITIES (see below for more details) *** |
4683 |
||
6922 | 4684 |
* HOL: The THEN and ELSE parts of conditional expressions (if P then x else y) |
4685 |
are no longer simplified. (This allows the simplifier to unfold recursive |
|
4686 |
functional programs.) To restore the old behaviour, declare |
|
7215 | 4687 |
|
4688 |
Delcongs [if_weak_cong]; |
|
6922 | 4689 |
|
6269 | 4690 |
* HOL: Removed the obsolete syntax "Compl A"; use -A for set |
4691 |
complement; |
|
5931 | 4692 |
|
6269 | 4693 |
* HOL: the predicate "inj" is now defined by translation to "inj_on"; |
6174 | 4694 |
|
7847 | 4695 |
* HOL/datatype: mutual_induct_tac no longer exists -- |
4696 |
use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"] |
|
4697 |
||
6386
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
4698 |
* HOL/typedef: fixed type inference for representing set; type |
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
4699 |
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
|
4700 |
|
6269 | 4701 |
* ZF: The con_defs part of an inductive definition may no longer refer |
4702 |
to constants declared in the same theory; |
|
6057 | 4703 |
|
6269 | 4704 |
* HOL, ZF: the function mk_cases, generated by the inductive |
4705 |
definition package, has lost an argument. To simplify its result, it |
|
4706 |
uses the default simpset instead of a supplied list of theorems. |
|
6141 | 4707 |
|
7215 | 4708 |
* HOL/List: the constructors of type list are now Nil and Cons; |
4709 |
||
7619 | 4710 |
* Simplifier: the type of the infix ML functions |
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
4711 |
setSSolver addSSolver setSolver addSolver |
7619 | 4712 |
is now simpset * solver -> simpset where `solver' is a new abstract type |
4713 |
for packaging solvers. A solver is created via |
|
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
4714 |
mk_solver: string -> (thm list -> int -> tactic) -> solver |
7619 | 4715 |
where the string argument is only a comment. |
6057 | 4716 |
|
7647
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset
|
4717 |
|
6069 | 4718 |
*** Proof tools *** |
4719 |
||
6343 | 4720 |
* Provers/Arith/fast_lin_arith.ML contains a functor for creating a |
4721 |
decision procedure for linear arithmetic. Currently it is used for |
|
7593 | 4722 |
types `nat', `int', and `real' in HOL (see below); it can, should and |
4723 |
will be instantiated for other types and logics as well. |
|
6069 | 4724 |
|
7324 | 4725 |
* The simplifier now accepts rewrite rules with flexible heads, eg |
4726 |
hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y |
|
4727 |
They are applied like any rule with a non-pattern lhs, i.e. by first-order |
|
4728 |
matching. |
|
6069 | 4729 |
|
7593 | 4730 |
|
6014 | 4731 |
*** General *** |
4732 |
||
7986 | 4733 |
* New Isabelle/Isar subsystem provides an alternative to traditional |
7215 | 4734 |
tactical theorem proving; together with the ProofGeneral/isar user |
4735 |
interface it offers an interactive environment for developing human |
|
4736 |
readable proof documents (Isar == Intelligible semi-automated |
|
7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
4737 |
reasoning); for further information see isatool doc isar-ref, |
7986 | 4738 |
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
|
4739 |
|
9612 | 4740 |
* improved and simplified presentation of theories: better HTML markup |
4741 |
(including colors), graph views in several sizes; isatool usedir now |
|
4742 |
provides a proper interface for user theories (via -P option); actual |
|
4743 |
document preparation based on (PDF)LaTeX is available as well (for |
|
4744 |
new-style theories only); see isatool doc system for more information; |
|
7215 | 4745 |
|
7252 | 4746 |
* native support for Proof General, both for classic Isabelle and |
7986 | 4747 |
Isabelle/Isar; |
7215 | 4748 |
|
7791 | 4749 |
* ML function thm_deps visualizes dependencies of theorems and lemmas, |
4750 |
using the graph browser tool; |
|
4751 |
||
6751 | 4752 |
* Isabelle manuals now also available as PDF; |
4753 |
||
6449 | 4754 |
* theory loader rewritten from scratch (may not be fully |
4755 |
bug-compatible); old loadpath variable has been replaced by show_path, |
|
6671 | 4756 |
add_path, del_path, reset_path functions; new operations such as |
7593 | 4757 |
update_thy, touch_thy, remove_thy, use/update_thy_only (see also |
4758 |
isatool doc ref); |
|
6449 | 4759 |
|
7215 | 4760 |
* improved isatool install: option -k creates KDE application icon, |
4761 |
option -p DIR installs standalone binaries; |
|
4762 |
||
4763 |
* added ML_PLATFORM setting (useful for cross-platform installations); |
|
4764 |
more robust handling of platform specific ML images for SML/NJ; |
|
4765 |
||
7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
4766 |
* the settings environment is now statically scoped, i.e. it is never |
7986 | 4767 |
created again in sub-processes invoked from isabelle, isatool, or |
7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
4768 |
Isabelle; |
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
4769 |
|
7215 | 4770 |
* path element specification '~~' refers to '$ISABELLE_HOME'; |
4771 |
||
6343 | 4772 |
* in locales, the "assumes" and "defines" parts may be omitted if |
4773 |
empty; |
|
5973 | 4774 |
|
6269 | 4775 |
* new print_mode "xsymbols" for extended symbol support (e.g. genuine |
4776 |
long arrows); |
|
6259
488bdc1bd11a
path element specification '~~' refers to '$ISABELLE_HOME';
wenzelm
parents:
6174
diff
changeset
|
4777 |
|
6343 | 4778 |
* new print_mode "HTML"; |
4779 |
||
4780 |
* new flag show_tags controls display of tags of theorems (which are |
|
4781 |
basically just comments that may be attached by some tools); |
|
4782 |
||
6461 | 4783 |
* Isamode 2.6 requires patch to accomodate change of Isabelle font |
4784 |
mode and goal output format: |
|
4785 |
||
4786 |
diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el |
|
4787 |
244c244 |
|
4788 |
< (list (isa-getenv "ISABELLE") "-msymbols" logic-name) |
|
4789 |
--- |
|
6533 | 4790 |
> (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name) |
6461 | 4791 |
diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el |
4792 |
181c181 |
|
4793 |
< (defconst proofstate-proofstart-regexp "^Level [0-9]+$" |
|
4794 |
--- |
|
4795 |
> (defconst proofstate-proofstart-regexp "^Level [0-9]+" |
|
4796 |
||
7450 | 4797 |
* function bind_thms stores lists of theorems (cf. bind_thm); |
4798 |
||
7593 | 4799 |
* new shorthand tactics ftac, eatac, datac, fatac; |
4800 |
||
4801 |
* qed (and friends) now accept "" as result name; in that case the |
|
7986 | 4802 |
theorem is not stored, but proper checks and presentation of the |
4803 |
result still apply; |
|
7593 | 4804 |
|
7805
0ae9ddc36fe0
theorem database now also indexes constants "Trueprop", "all",
wenzelm
parents:
7791
diff
changeset
|
4805 |
* theorem database now also indexes constants "Trueprop", "all", |
0ae9ddc36fe0
theorem database now also indexes constants "Trueprop", "all",
wenzelm
parents:
7791
diff
changeset
|
4806 |
"==>", "=="; thus thms_containing, findI etc. may retrieve more rules; |
0ae9ddc36fe0
theorem database now also indexes constants "Trueprop", "all",
wenzelm
parents:
7791
diff
changeset
|
4807 |
|
6028 | 4808 |
|
6057 | 4809 |
*** HOL *** |
4810 |
||
7215 | 4811 |
** HOL arithmetic ** |
4812 |
||
6343 | 4813 |
* There are now decision procedures for linear arithmetic over nat and |
4814 |
int: |
|
6131 | 4815 |
|
6343 | 4816 |
1. arith_tac copes with arbitrary formulae involving `=', `<', `<=', |
4817 |
`+', `-', `Suc', `min', `max' and numerical constants; other subterms |
|
4818 |
are treated as atomic; subformulae not involving type `nat' or `int' |
|
4819 |
are ignored; quantified subformulae are ignored unless they are |
|
4820 |
positive universal or negative existential. The tactic has to be |
|
4821 |
invoked by hand and can be a little bit slow. In particular, the |
|
4822 |
running time is exponential in the number of occurrences of `min' and |
|
4823 |
`max', and `-' on `nat'. |
|
6131 | 4824 |
|
6343 | 4825 |
2. fast_arith_tac is a cut-down version of arith_tac: it only takes |
4826 |
(negated) (in)equalities among the premises and the conclusion into |
|
4827 |
account (i.e. no compound formulae) and does not know about `min' and |
|
4828 |
`max', and `-' on `nat'. It is fast and is used automatically by the |
|
4829 |
simplifier. |
|
6131 | 4830 |
|
6343 | 4831 |
NB: At the moment, these decision procedures do not cope with mixed |
4832 |
nat/int formulae where the two parts interact, such as `m < n ==> |
|
4833 |
int(m) < int(n)'. |
|
6028 | 4834 |
|
7215 | 4835 |
* HOL/Numeral provides a generic theory of numerals (encoded |
7313 | 4836 |
efficiently as bit strings); setup for types nat/int/real is in place; |
7215 | 4837 |
INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than |
4838 |
int, existing theories and proof scripts may require a few additional |
|
4839 |
type constraints; |
|
4840 |
||
4841 |
* integer division and remainder can now be performed on constant |
|
4842 |
arguments; |
|
7157 | 4843 |
|
7215 | 4844 |
* many properties of integer multiplication, division and remainder |
4845 |
are now available; |
|
6922 | 4846 |
|
7287 | 4847 |
* An interface to the Stanford Validity Checker (SVC) is available through the |
4848 |
tactic svc_tac. Propositional tautologies and theorems of linear arithmetic |
|
4849 |
are proved automatically. SVC must be installed separately, and its results |
|
4850 |
must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any |
|
4851 |
invocation of the underlying oracle). For SVC see |
|
7444 | 4852 |
http://verify.stanford.edu/SVC |
6922 | 4853 |
|
7125 | 4854 |
* IsaMakefile: the HOL-Real target now builds an actual image; |
4855 |
||
7215 | 4856 |
|
4857 |
** HOL misc ** |
|
4858 |
||
7595
5f5d575ddac3
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
wenzelm
parents:
7593
diff
changeset
|
4859 |
* 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
|
4860 |
(in Isabelle/Isar) -- by Gertrud Bauer; |
5f5d575ddac3
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
wenzelm
parents:
7593
diff
changeset
|
4861 |
|
7691 | 4862 |
* HOL/BCV: generic model of bytecode verification, i.e. data-flow |
4863 |
analysis for assembly languages with subtypes; |
|
4864 |
||
6278 | 4865 |
* HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization |
4866 |
-- avoids syntactic ambiguities and treats state, transition, and |
|
4867 |
temporal levels more uniformly; introduces INCOMPATIBILITIES due to |
|
4868 |
changed syntax and (many) tactics; |
|
4869 |
||
7791 | 4870 |
* HOL/inductive: Now also handles more general introduction rules such |
4871 |
as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity |
|
4872 |
theorems are now maintained within the theory (maintained via the |
|
4873 |
"mono" attribute); |
|
7780
099742c562aa
Documented changes to HOL/inductive and function thm_deps.
berghofe
parents:
7691
diff
changeset
|
4874 |
|
7238
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
4875 |
* HOL/datatype: Now also handles arbitrarily branching datatypes |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
4876 |
(using function types) such as |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
4877 |
|
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
4878 |
datatype 'a tree = Atom 'a | Branch "nat => 'a tree" |
7047
d103b875ef1d
Datatype package now handles arbitrarily branching datatypes.
berghofe
parents:
6925
diff
changeset
|
4879 |
|
7326 | 4880 |
* HOL/record: record_simproc (part of the default simpset) takes care |
4881 |
of selectors applied to updated records; record_split_tac is no longer |
|
7327 | 4882 |
part of the default claset; update_defs may now be removed from the |
4883 |
simpset in many cases; COMPATIBILITY: old behavior achieved by |
|
7326 | 4884 |
|
4885 |
claset_ref () := claset() addSWrapper record_split_wrapper; |
|
4886 |
Delsimprocs [record_simproc] |
|
4887 |
||
6386
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
4888 |
* HOL/typedef: fixed type inference for representing set; type |
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
4889 |
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
|
4890 |
|
7287 | 4891 |
* HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem |
4892 |
names rather than an ML expression; |
|
4893 |
||
4894 |
* HOL/defer_recdef (TFL): like recdef but the well-founded relation can be |
|
4895 |
supplied later. Program schemes can be defined, such as |
|
4896 |
"While B C s = (if B s then While B C (C s) else s)" |
|
4897 |
where the well-founded relation can be chosen after B and C have been given. |
|
6563 | 4898 |
|
7215 | 4899 |
* HOL/List: the constructors of type list are now Nil and Cons; |
4900 |
INCOMPATIBILITY: while [] and infix # syntax is still there, of |
|
4901 |
course, ML tools referring to List.list.op # etc. have to be adapted; |
|
4902 |
||
7238
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
4903 |
* HOL_quantifiers flag superseded by "HOL" print mode, which is |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
4904 |
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
|
4905 |
the original Gordon/HOL-style output; |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
4906 |
|
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
4907 |
* 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
|
4908 |
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
|
4909 |
|
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
4910 |
* HOL basic syntax simplified (more orthogonal): all variants of |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
4911 |
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
|
4912 |
Eps operator is provided as well: "SOME x. P[x]"; |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
4913 |
|
7320 | 4914 |
* HOL/Sum.thy: sum_case has been moved to HOL/Datatype; |
7261 | 4915 |
|
7280 | 4916 |
* HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made |
4917 |
thus available for user theories; |
|
4918 |
||
7300
8439bf404c28
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with HOL/List;
wenzelm
parents:
7287
diff
changeset
|
4919 |
* 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
|
4920 |
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
|
4921 |
time; |
8439bf404c28
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with HOL/List;
wenzelm
parents:
7287
diff
changeset
|
4922 |
|
7986 | 4923 |
* HOL: new tactic smp_tac: int -> int -> tactic, which applies spec |
4924 |
several times and then mp; |
|
7492 | 4925 |
|
7215 | 4926 |
|
7113 | 4927 |
*** LK *** |
4928 |
||
7215 | 4929 |
* the notation <<...>> is now available as a notation for sequences of |
4930 |
formulas; |
|
7113 | 4931 |
|
4932 |
* the simplifier is now installed |
|
4933 |
||
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
4934 |
* the axiom system has been generalized (thanks to Soren Heilmann) |
7113 | 4935 |
|
4936 |
* the classical reasoner now has a default rule database |
|
4937 |
||
4938 |
||
6064 | 4939 |
*** ZF *** |
4940 |
||
4941 |
* new primrec section allows primitive recursive functions to be given |
|
6269 | 4942 |
directly (as in HOL) over datatypes and the natural numbers; |
6064 | 4943 |
|
6269 | 4944 |
* new tactics induct_tac and exhaust_tac for induction (or case |
4945 |
analysis) over datatypes and the natural numbers; |
|
6064 | 4946 |
|
4947 |
* the datatype declaration of type T now defines the recursor T_rec; |
|
4948 |
||
6141 | 4949 |
* simplification automatically does freeness reasoning for datatype |
6269 | 4950 |
constructors; |
6141 | 4951 |
|
6269 | 4952 |
* automatic type-inference, with AddTCs command to insert new |
4953 |
type-checking rules; |
|
6155 | 4954 |
|
6269 | 4955 |
* datatype introduction rules are now added as Safe Introduction rules |
4956 |
to the claset; |
|
6155 | 4957 |
|
6269 | 4958 |
* the syntax "if P then x else y" is now available in addition to |
4959 |
if(P,x,y); |
|
4960 |
||
6069 | 4961 |
|
6343 | 4962 |
*** Internal programming interfaces *** |
4963 |
||
7919
35c18affc1d8
tuned simplifier trace output; new flag debug_simp
wenzelm
parents:
7886
diff
changeset
|
4964 |
* tuned simplifier trace output; new flag debug_simp; |
35c18affc1d8
tuned simplifier trace output; new flag debug_simp
wenzelm
parents:
7886
diff
changeset
|
4965 |
|
7420
cba45c114f3b
structures Vartab / Termtab (instances of TableFun);
wenzelm
parents:
7327
diff
changeset
|
4966 |
* structures Vartab / Termtab (instances of TableFun) offer efficient |
cba45c114f3b
structures Vartab / Termtab (instances of TableFun);
wenzelm
parents:
7327
diff
changeset
|
4967 |
tables indexed by indexname_ord / term_ord (compatible with aconv); |
cba45c114f3b
structures Vartab / Termtab (instances of TableFun);
wenzelm
parents:
7327
diff
changeset
|
4968 |
|
6386
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
4969 |
* AxClass.axclass_tac lost the theory argument; |
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
4970 |
|
6343 | 4971 |
* tuned current_goals_markers semantics: begin / end goal avoids |
4972 |
printing empty lines; |
|
4973 |
||
4974 |
* removed prs and prs_fn hook, which was broken because it did not |
|
4975 |
include \n in its semantics, forcing writeln to add one |
|
4976 |
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: |
|
4977 |
string -> unit if you really want to output text without newline; |
|
4978 |
||
4979 |
* Symbol.output subject to print mode; INCOMPATIBILITY: defaults to |
|
4980 |
plain output, interface builders may have to enable 'isabelle_font' |
|
4981 |
mode to get Isabelle font glyphs as before; |
|
4982 |
||
4983 |
* refined token_translation interface; INCOMPATIBILITY: output length |
|
4984 |
now of type real instead of int; |
|
4985 |
||
7196 | 4986 |
* theory loader actions may be traced via new ThyInfo.add_hook |
4987 |
interface (see src/Pure/Thy/thy_info.ML); example application: keep |
|
4988 |
your own database of information attached to *whole* theories -- as |
|
4989 |
opposed to intra-theory data slots offered via TheoryDataFun; |
|
4990 |
||
7647
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset
|
4991 |
* proper handling of dangling sort hypotheses (at last!); |
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset
|
4992 |
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
|
4993 |
extra sort hypotheses that can be witnessed from the type signature; |
7986 | 4994 |
the force_strip_shyps flag is gone, any remaining shyps are simply |
4995 |
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
|
4996 |
|
6343 | 4997 |
|
6064 | 4998 |
|
5781 | 4999 |
New in Isabelle98-1 (October 1998) |
5000 |
---------------------------------- |
|
5001 |
||
5127 | 5002 |
*** Overview of INCOMPATIBILITIES (see below for more details) *** |
4842 | 5003 |
|
5726 | 5004 |
* several changes of automated proof tools; |
5373 | 5005 |
|
5726 | 5006 |
* HOL: major changes to the inductive and datatype packages, including |
5007 |
some minor incompatibilities of theory syntax; |
|
5214 | 5008 |
|
5726 | 5009 |
* HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now |
5217 | 5010 |
called `inj_on'; |
5160 | 5011 |
|
5275 | 5012 |
* HOL: removed duplicate thms in Arith: |
5013 |
less_imp_add_less should be replaced by trans_less_add1 |
|
5014 |
le_imp_add_le should be replaced by trans_le_add1 |
|
5160 | 5015 |
|
5726 | 5016 |
* HOL: unary minus is now overloaded (new type constraints may be |
5017 |
required); |
|
5490 | 5018 |
|
5726 | 5019 |
* HOL and ZF: unary minus for integers is now #- instead of #~. In |
5020 |
ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is |
|
5021 |
now taken as an integer constant. |
|
5541 | 5022 |
|
5726 | 5023 |
* Pure: ML function 'theory_of' renamed to 'theory'; |
5397
034ed25535b9
* Pure: ML function 'theory_of' replaced by 'theory';
wenzelm
parents:
5373
diff
changeset
|
5024 |
|
5363 | 5025 |
|
5127 | 5026 |
*** Proof tools *** |
4880 | 5027 |
|
5657
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
5028 |
* Simplifier: |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
5029 |
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
|
5030 |
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
|
5031 |
simplify. |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
5032 |
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
|
5033 |
rotate premises to achieve further simplification. |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
5034 |
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
|
5035 |
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
|
5036 |
2. The simplifier now knows a little bit about nat-arithmetic. |
4880 | 5037 |
|
5127 | 5038 |
* Classical reasoner: wrapper mechanism for the classical reasoner now |
5039 |
allows for selected deletion of wrappers, by introduction of names for |
|
5040 |
wrapper functionals. This implies that addbefore, addSbefore, |
|
5041 |
addaltern, and addSaltern now take a pair (name, tactic) as argument, |
|
5042 |
and that adding two tactics with the same name overwrites the first |
|
5043 |
one (emitting a warning). |
|
4824 | 5044 |
type wrapper = (int -> tactic) -> (int -> tactic) |
4649 | 5045 |
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by |
4824 | 5046 |
addWrapper, addSWrapper: claset * (string * wrapper) -> claset |
5047 |
delWrapper, delSWrapper: claset * string -> claset |
|
4649 | 5048 |
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; |
5049 |
||
5705
56f2030c46c6
tuned (all proofs are INSTABLE by David's definition of instability);
wenzelm
parents:
5671
diff
changeset
|
5050 |
* Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE |
5726 | 5051 |
semantics; addbefore now affects only the unsafe part of step_tac |
5052 |
etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY |
|
5053 |
FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac |
|
5054 |
by Force_tac; |
|
5524 | 5055 |
|
5726 | 5056 |
* Classical reasoner: setwrapper to setWrapper and compwrapper to |
5057 |
compWrapper; added safe wrapper (and access functions for it); |
|
5524 | 5058 |
|
5127 | 5059 |
* HOL/split_all_tac is now much faster and fails if there is nothing |
5726 | 5060 |
to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order |
5061 |
and the names of the automatically generated variables have changed. |
|
5062 |
split_all_tac has moved within claset() from unsafe wrappers to safe |
|
5063 |
wrappers, which means that !!-bound variables are split much more |
|
5064 |
aggressively, and safe_tac and clarify_tac now split such variables. |
|
5065 |
If this splitting is not appropriate, use delSWrapper "split_all_tac". |
|
5066 |
Note: the same holds for record_split_tac, which does the job of |
|
5067 |
split_all_tac for record fields. |
|
5127 | 5068 |
|
5726 | 5069 |
* HOL/Simplifier: Rewrite rules for case distinctions can now be added |
5070 |
permanently to the default simpset using Addsplits just like |
|
5071 |
Addsimps. They can be removed via Delsplits just like |
|
5072 |
Delsimps. Lower-case versions are also available. |
|
5127 | 5073 |
|
5726 | 5074 |
* HOL/Simplifier: The rule split_if is now part of the default |
5075 |
simpset. This means that the simplifier will eliminate all occurrences |
|
5076 |
of if-then-else in the conclusion of a goal. To prevent this, you can |
|
5077 |
either remove split_if completely from the default simpset by |
|
5078 |
`Delsplits [split_if]' or remove it in a specific call of the |
|
5079 |
simplifier using `... delsplits [split_if]'. You can also add/delete |
|
5080 |
other case splitting rules to/from the default simpset: every datatype |
|
5081 |
generates suitable rules `split_t_case' and `split_t_case_asm' (where |
|
5082 |
t is the name of the datatype). |
|
5127 | 5083 |
|
5726 | 5084 |
* Classical reasoner / Simplifier combination: new force_tac (and |
5127 | 5085 |
derivatives Force_tac, force) combines rewriting and classical |
5086 |
reasoning (and whatever other tools) similarly to auto_tac, but is |
|
5726 | 5087 |
aimed to solve the given subgoal completely. |
5127 | 5088 |
|
5089 |
||
5090 |
*** General *** |
|
5091 |
||
5217 | 5092 |
* new top-level commands `Goal' and `Goalw' that improve upon `goal' |
5127 | 5093 |
and `goalw': the theory is no longer needed as an explicit argument - |
5094 |
the current theory context is used; assumptions are no longer returned |
|
5095 |
at the ML-level unless one of them starts with ==> or !!; it is |
|
5217 | 5096 |
recommended to convert to these new commands using isatool fixgoal |
5097 |
(backup your sources first!); |
|
4842 | 5098 |
|
5217 | 5099 |
* new top-level commands 'thm' and 'thms' for retrieving theorems from |
5207 | 5100 |
the current theory context, and 'theory' to lookup stored theories; |
4806 | 5101 |
|
5722 | 5102 |
* new theory section 'locale' for declaring constants, assumptions and |
5103 |
definitions that have local scope; |
|
5104 |
||
5127 | 5105 |
* new theory section 'nonterminals' for purely syntactic types; |
4858 | 5106 |
|
5127 | 5107 |
* new theory section 'setup' for generic ML setup functions |
5108 |
(e.g. package initialization); |
|
4869 | 5109 |
|
5131 | 5110 |
* the distribution now includes Isabelle icons: see |
5111 |
lib/logo/isabelle-{small,tiny}.xpm; |
|
5112 |
||
5363 | 5113 |
* isatool install - install binaries with absolute references to |
5114 |
ISABELLE_HOME/bin; |
|
5115 |
||
5572 | 5116 |
* isatool logo -- create instances of the Isabelle logo (as EPS); |
5117 |
||
5407 | 5118 |
* print mode 'emacs' reserved for Isamode; |
5119 |
||
5726 | 5120 |
* support multiple print (ast) translations per constant name; |
5121 |
||
6925
8d4d45ec6a3d
theorems involving oracles are now printed with a suffixed [!];
wenzelm
parents:
6922
diff
changeset
|
5122 |
* theorems involving oracles are now printed with a suffixed [!]; |
8d4d45ec6a3d
theorems involving oracles are now printed with a suffixed [!];
wenzelm
parents:
6922
diff
changeset
|
5123 |
|
4711 | 5124 |
|
4661 | 5125 |
*** HOL *** |
5126 |
||
5710 | 5127 |
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial'); |
5709 | 5128 |
|
5217 | 5129 |
* HOL/inductive package reorganized and improved: now supports mutual |
5267 | 5130 |
definitions such as |
5217 | 5131 |
|
5132 |
inductive EVEN ODD |
|
5133 |
intrs |
|
5134 |
null "0 : EVEN" |
|
5135 |
oddI "n : EVEN ==> Suc n : ODD" |
|
5136 |
evenI "n : ODD ==> Suc n : EVEN" |
|
5137 |
||
5138 |
new theorem list "elims" contains an elimination rule for each of the |
|
5139 |
recursive sets; inductive definitions now handle disjunctive premises |
|
5140 |
correctly (also ZF); |
|
5214 | 5141 |
|
5217 | 5142 |
INCOMPATIBILITIES: requires Inductive as an ancestor; component |
5143 |
"mutual_induct" no longer exists - the induction rule is always |
|
5144 |
contained in "induct"; |
|
5145 |
||
5146 |
||
5147 |
* HOL/datatype package re-implemented and greatly improved: now |
|
5267 | 5148 |
supports mutually recursive datatypes such as |
5217 | 5149 |
|
5150 |
datatype |
|
5151 |
'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp) |
|
5152 |
| SUM ('a aexp) ('a aexp) |
|
5153 |
| DIFF ('a aexp) ('a aexp) |
|
5154 |
| NUM 'a |
|
5155 |
and |
|
5156 |
'a bexp = LESS ('a aexp) ('a aexp) |
|
5157 |
| AND ('a bexp) ('a bexp) |
|
5158 |
| OR ('a bexp) ('a bexp) |
|
5159 |
||
5267 | 5160 |
as well as indirectly recursive datatypes such as |
5214 | 5161 |
|
5217 | 5162 |
datatype |
5163 |
('a, 'b) term = Var 'a |
|
5164 |
| App 'b ((('a, 'b) term) list) |
|
5214 | 5165 |
|
5217 | 5166 |
The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs |
5167 |
induction on mutually / indirectly recursive datatypes. |
|
5168 |
||
5169 |
Primrec equations are now stored in theory and can be accessed via |
|
5170 |
<function_name>.simps. |
|
5171 |
||
5172 |
INCOMPATIBILITIES: |
|
5214 | 5173 |
|
5217 | 5174 |
- Theories using datatypes must now have theory Datatype as an |
5175 |
ancestor. |
|
5176 |
- The specific <typename>.induct_tac no longer exists - use the |
|
5177 |
generic induct_tac instead. |
|
5226 | 5178 |
- natE has been renamed to nat.exhaust - use exhaust_tac |
5217 | 5179 |
instead of res_inst_tac ... natE. Note that the variable |
5226 | 5180 |
names in nat.exhaust differ from the names in natE, this |
5217 | 5181 |
may cause some "fragile" proofs to fail. |
5182 |
- The theorems split_<typename>_case and split_<typename>_case_asm |
|
5183 |
have been renamed to <typename>.split and <typename>.split_asm. |
|
5184 |
- Since default sorts of type variables are now handled correctly, |
|
5185 |
some datatype definitions may have to be annotated with explicit |
|
5186 |
sort constraints. |
|
5187 |
- Primrec definitions no longer require function name and type |
|
5188 |
of recursive argument. |
|
5214 | 5189 |
|
5217 | 5190 |
Consider using isatool fixdatatype to adapt your theories and proof |
5191 |
scripts to the new package (backup your sources first!). |
|
5192 |
||
5193 |
||
5726 | 5194 |
* HOL/record package: considerably improved implementation; now |
5195 |
includes concrete syntax for record types, terms, updates; theorems |
|
5196 |
for surjective pairing and splitting !!-bound record variables; proof |
|
5197 |
support is as follows: |
|
5198 |
||
5199 |
1) standard conversions (selectors or updates applied to record |
|
5200 |
constructor terms) are part of the standard simpset; |
|
5201 |
||
5202 |
2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are |
|
5203 |
made part of standard simpset and claset via addIffs; |
|
5204 |
||
5205 |
3) a tactic for record field splitting (record_split_tac) is part of |
|
5206 |
the standard claset (addSWrapper); |
|
5207 |
||
5208 |
To get a better idea about these rules you may retrieve them via |
|
5209 |
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is |
|
5210 |
the name of your record type. |
|
5211 |
||
5212 |
The split tactic 3) conceptually simplifies by the following rule: |
|
5213 |
||
5214 |
"(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))" |
|
5215 |
||
5216 |
Thus any record variable that is bound by meta-all will automatically |
|
5217 |
blow up into some record constructor term, consequently the |
|
5218 |
simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall |
|
5219 |
solve record problems automatically. |
|
5220 |
||
5214 | 5221 |
|
5125 | 5222 |
* reorganized the main HOL image: HOL/Integ and String loaded by |
5223 |
default; theory Main includes everything; |
|
5224 |
||
5650 | 5225 |
* automatic simplification of integer sums and comparisons, using cancellation; |
5226 |
||
5526 | 5227 |
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; |
5127 | 5228 |
|
5229 |
* added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset; |
|
5230 |
||
5231 |
* many new identities for unions, intersections, set difference, etc.; |
|
5232 |
||
5233 |
* expand_if, expand_split, expand_sum_case and expand_nat_case are now |
|
5234 |
called split_if, split_split, split_sum_case and split_nat_case (to go |
|
5235 |
with add/delsplits); |
|
5125 | 5236 |
|
5127 | 5237 |
* HOL/Prod introduces simplification procedure unit_eq_proc rewriting |
5238 |
(?x::unit) = (); this is made part of the default simpset, which COULD |
|
5239 |
MAKE EXISTING PROOFS FAIL under rare circumstances (consider |
|
5207 | 5240 |
'Delsimprocs [unit_eq_proc];' as last resort); also note that |
5241 |
unit_abs_eta_conv is added in order to counter the effect of |
|
5242 |
unit_eq_proc on (%u::unit. f u), replacing it by f rather than by |
|
5243 |
%u.f(); |
|
5125 | 5244 |
|
5217 | 5245 |
* HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which |
5246 |
makes more sense); |
|
5109 | 5247 |
|
5475 | 5248 |
* HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule; |
5249 |
It and 'sym RS equals0D' are now in the default claset, giving automatic |
|
5250 |
disjointness reasoning but breaking a few old proofs. |
|
5267 | 5251 |
|
5217 | 5252 |
* HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1 |
5253 |
to 'converse' from 'inverse' (for compatibility with ZF and some |
|
5254 |
literature); |
|
5085
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset
|
5255 |
|
5127 | 5256 |
* HOL/recdef can now declare non-recursive functions, with {} supplied as |
5257 |
the well-founded relation; |
|
4838 | 5258 |
|
5490 | 5259 |
* HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of |
5260 |
Compl A. The "Compl" syntax remains available as input syntax for this |
|
5261 |
release ONLY. |
|
5262 |
||
5127 | 5263 |
* HOL/Update: new theory of function updates: |
5264 |
f(a:=b) == %x. if x=a then b else f x |
|
5265 |
may also be iterated as in f(a:=b,c:=d,...); |
|
5077
71043526295f
* HOL/List: new function list_update written xs[i:=v] that updates the i-th
nipkow
parents:
5075
diff
changeset
|
5266 |
|
5127 | 5267 |
* HOL/Vimage: new theory for inverse image of a function, syntax f-``B; |
4899 | 5268 |
|
5282 | 5269 |
* HOL/List: |
5270 |
- new function list_update written xs[i:=v] that updates the i-th |
|
5271 |
list position. May also be iterated as in xs[i:=a,j:=b,...]. |
|
5428 | 5272 |
- new function `upt' written [i..j(] which generates the list |
5273 |
[i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper |
|
5274 |
bound write [i..j], which is a shorthand for [i..j+1(]. |
|
5282 | 5275 |
- new lexicographic orderings and corresponding wellfoundedness theorems. |
4779 | 5276 |
|
5127 | 5277 |
* HOL/Arith: |
5278 |
- removed 'pred' (predecessor) function; |
|
5279 |
- generalized some theorems about n-1; |
|
5280 |
- many new laws about "div" and "mod"; |
|
5281 |
- new laws about greatest common divisors (see theory ex/Primes); |
|
4766 | 5282 |
|
5127 | 5283 |
* HOL/Relation: renamed the relational operator r^-1 "converse" |
4842 | 5284 |
instead of "inverse"; |
4711 | 5285 |
|
5651 | 5286 |
* HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness |
5287 |
of the multiset ordering; |
|
5288 |
||
5127 | 5289 |
* directory HOL/Real: a construction of the reals using Dedekind cuts |
5651 | 5290 |
(not included by default); |
4835 | 5291 |
|
5127 | 5292 |
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; |
4711 | 5293 |
|
5651 | 5294 |
* directory HOL/Hoare: a new version of Hoare logic which permits many-sorted |
5295 |
programs, i.e. different program variables may have different types. |
|
5296 |
||
5142 | 5297 |
* calling (stac rew i) now fails if "rew" has no effect on the goal |
5298 |
[previously, this check worked only if the rewrite rule was unconditional] |
|
5308 | 5299 |
Now rew can involve either definitions or equalities (either == or =). |
5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset
|
5300 |
|
5363 | 5301 |
|
4879
58656c6a3551
"let" is no longer restricted to FOL terms and allows any logical terms
paulson
parents:
4869
diff
changeset
|
5302 |
*** ZF *** |
58656c6a3551
"let" is no longer restricted to FOL terms and allows any logical terms
paulson
parents:
4869
diff
changeset
|
5303 |
|
5332 | 5304 |
* theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains |
5305 |
only the theorems proved on ZF.ML; |
|
5160 | 5306 |
|
5475 | 5307 |
* ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule; |
5308 |
It and 'sym RS equals0D' are now in the default claset, giving automatic |
|
5309 |
disjointness reasoning but breaking a few old proofs. |
|
5267 | 5310 |
|
5160 | 5311 |
* ZF/Update: new theory of function updates |
5312 |
with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z) |
|
5313 |
may also be iterated as in f(a:=b,c:=d,...); |
|
5314 |
||
4879
58656c6a3551
"let" is no longer restricted to FOL terms and allows any logical terms
paulson
parents:
4869
diff
changeset
|
5315 |
* in let x=t in u(x), neither t nor u(x) has to be an FOL term. |
4649 | 5316 |
|
5142 | 5317 |
* calling (stac rew i) now fails if "rew" has no effect on the goal |
5318 |
[previously, this check worked only if the rewrite rule was unconditional] |
|
5308 | 5319 |
Now rew can involve either definitions or equalities (either == or =). |
5142 | 5320 |
|
5160 | 5321 |
* case_tac provided for compatibility with HOL |
5322 |
(like the old excluded_middle_tac, but with subgoals swapped) |
|
5323 |
||
4842 | 5324 |
|
5127 | 5325 |
*** Internal programming interfaces *** |
5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset
|
5326 |
|
5251 | 5327 |
* Pure: several new basic modules made available for general use, see |
5328 |
also src/Pure/README; |
|
5207 | 5329 |
|
5008 | 5330 |
* improved the theory data mechanism to support encapsulation (data |
5331 |
kind name replaced by private Object.kind, acting as authorization |
|
5373 | 5332 |
key); new type-safe user interface via functor TheoryDataFun; generic |
5333 |
print_data function becomes basically useless; |
|
5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset
|
5334 |
|
5251 | 5335 |
* removed global_names compatibility flag -- all theory declarations |
5336 |
are qualified by default; |
|
5337 |
||
5085
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset
|
5338 |
* module Pure/Syntax now offers quote / antiquote translation |
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset
|
5339 |
functions (useful for Hoare logic etc. with implicit dependencies); |
5373 | 5340 |
see HOL/ex/Antiquote for an example use; |
5085
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset
|
5341 |
|
5127 | 5342 |
* Simplifier now offers conversions (asm_)(full_)rewrite: simpset -> |
5343 |
cterm -> thm; |
|
5344 |
||
5207 | 5345 |
* new tactical CHANGED_GOAL for checking that a tactic modifies a |
5346 |
subgoal; |
|
5142 | 5347 |
|
5251 | 5348 |
* Display.print_goals function moved to Locale.print_goals; |
5349 |
||
5731 | 5350 |
* standard print function for goals supports current_goals_markers |
5351 |
variable for marking begin of proof, end of proof, start of goal; the |
|
5352 |
default is ("", "", ""); setting current_goals_markers := ("<proof>", |
|
5353 |
"</proof>", "<goal>") causes SGML like tagged proof state printing, |
|
5354 |
for example; |
|
5355 |
||
5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset
|
5356 |
|
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset
|
5357 |
|
4410 | 5358 |
New in Isabelle98 (January 1998) |
5359 |
-------------------------------- |
|
5360 |
||
5361 |
*** Overview of INCOMPATIBILITIES (see below for more details) *** |
|
5362 |
||
5363 |
* changed lexical syntax of terms / types: dots made part of long |
|
5364 |
identifiers, e.g. "%x.x" no longer possible, should be "%x. x"; |
|
5365 |
||
5366 |
* simpset (and claset) reference variable replaced by functions |
|
5367 |
simpset / simpset_ref; |
|
5368 |
||
5369 |
* no longer supports theory aliases (via merge) and non-trivial |
|
5370 |
implicit merge of thms' signatures; |
|
5371 |
||
5372 |
* most internal names of constants changed due to qualified names; |
|
5373 |
||
5374 |
* changed Pure/Sequence interface (see Pure/seq.ML); |
|
5375 |
||
3454 | 5376 |
|
3715 | 5377 |
*** General Changes *** |
5378 |
||
4174 | 5379 |
* hierachically structured name spaces (for consts, types, axms, thms |
3943 | 5380 |
etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of |
4108 | 5381 |
old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY: |
5382 |
isatool fixdots ensures space after dots (e.g. "%x. x"); set |
|
4174 | 5383 |
long_names for fully qualified output names; NOTE: ML programs |
5384 |
(special tactics, packages etc.) referring to internal names may have |
|
5385 |
to be adapted to cope with fully qualified names; in case of severe |
|
5386 |
backward campatibility problems try setting 'global_names' at compile |
|
5387 |
time to have enrything declared within a flat name space; one may also |
|
5388 |
fine tune name declarations in theories via the 'global' and 'local' |
|
5389 |
section; |
|
4108 | 5390 |
|
5391 |
* reimplemented the implicit simpset and claset using the new anytype |
|
5392 |
data filed in signatures; references simpset:simpset ref etc. are |
|
5393 |
replaced by functions simpset:unit->simpset and |
|
5394 |
simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp |
|
5395 |
to patch your ML files accordingly; |
|
3856 | 5396 |
|
3857 | 5397 |
* HTML output now includes theory graph data for display with Java |
5398 |
applet or isatool browser; data generated automatically via isatool |
|
3901 | 5399 |
usedir (see -i option, ISABELLE_USEDIR_OPTIONS); |
3857 | 5400 |
|
3856 | 5401 |
* defs may now be conditional; improved rewrite_goals_tac to handle |
5402 |
conditional equations; |
|
5403 |
||
4174 | 5404 |
* defs now admits additional type arguments, using TYPE('a) syntax; |
5405 |
||
3901 | 5406 |
* theory aliases via merge (e.g. M=A+B+C) no longer supported, always |
5407 |
creates a new theory node; implicit merge of thms' signatures is |
|
4112 | 5408 |
restricted to 'trivial' ones; COMPATIBILITY: one may have to use |
3901 | 5409 |
transfer:theory->thm->thm in (rare) cases; |
5410 |
||
3968
ec138de716d9
improved handling of draft signatures / theories; draft thms (and
wenzelm
parents:
3964
diff
changeset
|
5411 |
* improved handling of draft signatures / theories; draft thms (and |
ec138de716d9
improved handling of draft signatures / theories; draft thms (and
wenzelm
parents:
3964
diff
changeset
|
5412 |
ctyps, cterms) are automatically promoted to real ones; |
ec138de716d9
improved handling of draft signatures / theories; draft thms (and
wenzelm
parents:
3964
diff
changeset
|
5413 |
|
3901 | 5414 |
* slightly changed interfaces for oracles: admit many per theory, named |
5415 |
(e.g. oracle foo = mlfun), additional name argument for invoke_oracle; |
|
5416 |
||
5417 |
* print_goals: optional output of const types (set show_consts and |
|
5418 |
show_types); |
|
3851
fe9932a7cd46
print_goals: optional output of const types (set show_consts);
wenzelm
parents:
3846
diff
changeset
|
5419 |
|
4388 | 5420 |
* improved output of warnings (###) and errors (***); |
3697
c5833dfcc2cc
Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
wenzelm
parents:
3671
diff
changeset
|
5421 |
|
4178
e64ff1c1bc70
subgoal_tac displays a warning if the new subgoal has type variables
paulson
parents:
4174
diff
changeset
|
5422 |
* subgoal_tac displays a warning if the new subgoal has type variables; |
e64ff1c1bc70
subgoal_tac displays a warning if the new subgoal has type variables
paulson
parents:
4174
diff
changeset
|
5423 |
|
3715 | 5424 |
* removed old README and Makefiles; |
3697
c5833dfcc2cc
Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
wenzelm
parents:
3671
diff
changeset
|
5425 |
|
3856 | 5426 |
* replaced print_goals_ref hook by print_current_goals_fn and result_error_fn; |
3670
9fea3562f8c7
replaced print_goals_ref hook by print_current_goals_fn and
wenzelm
parents:
3658
diff
changeset
|
5427 |
|
3715 | 5428 |
* removed obsolete init_pps and init_database; |
5429 |
||
5430 |
* deleted the obsolete tactical STATE, which was declared by |
|
5431 |
fun STATE tacfun st = tacfun st st; |
|
5432 |
||
4388 | 5433 |
* cd and use now support path variables, e.g. $ISABELLE_HOME, or ~ |
5434 |
(which abbreviates $HOME); |
|
4269 | 5435 |
|
5436 |
* changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY: |
|
5437 |
use isatool fixseq to adapt your ML programs (this works for fully |
|
5438 |
qualified references to the Sequence structure only!); |
|
5439 |
||
4381 | 5440 |
* use_thy no longer requires writable current directory; it always |
5441 |
reloads .ML *and* .thy file, if either one is out of date; |
|
4269 | 5442 |
|
3715 | 5443 |
|
5444 |
*** Classical Reasoner *** |
|
5445 |
||
3744 | 5446 |
* Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new |
5447 |
tactics that use classical reasoning to simplify a subgoal without |
|
5448 |
splitting it into several subgoals; |
|
3715 | 5449 |
|
3719 | 5450 |
* Safe_tac: like safe_tac but uses the default claset; |
5451 |
||
3715 | 5452 |
|
5453 |
*** Simplifier *** |
|
5454 |
||
5455 |
* added simplification meta rules: |
|
5456 |
(asm_)(full_)simplify: simpset -> thm -> thm; |
|
5457 |
||
5458 |
* simplifier.ML no longer part of Pure -- has to be loaded by object |
|
5459 |
logics (again); |
|
5460 |
||
5461 |
* added prems argument to simplification procedures; |
|
5462 |
||
4325 | 5463 |
* HOL, FOL, ZF: added infix function `addsplits': |
5464 |
instead of `<simpset> setloop (split_tac <thms>)' |
|
5465 |
you can simply write `<simpset> addsplits <thms>' |
|
5466 |
||
3715 | 5467 |
|
5468 |
*** Syntax *** |
|
5469 |
||
4174 | 5470 |
* TYPE('a) syntax for type reflection terms; |
5471 |
||
3985 | 5472 |
* no longer handles consts with name "" -- declare as 'syntax' instead; |
3856 | 5473 |
|
5474 |
* pretty printer: changed order of mixfix annotation preference (again!); |
|
3846 | 5475 |
|
3715 | 5476 |
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; |
5477 |
||
5478 |
||
5479 |
*** HOL *** |
|
5480 |
||
5726 | 5481 |
* HOL: there is a new splitter `split_asm_tac' that can be used e.g. |
4189 | 5482 |
with `addloop' of the simplifier to faciliate case splitting in premises. |
5483 |
||
4035 | 5484 |
* HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions; |
3985 | 5485 |
|
5486 |
* HOL/Auth: new protocol proofs including some for the Internet |
|
4035 | 5487 |
protocol TLS; |
3985 | 5488 |
|
4125 | 5489 |
* HOL/Map: new theory of `maps' a la VDM; |
3982 | 5490 |
|
4335 | 5491 |
* HOL/simplifier: simplification procedures nat_cancel_sums for |
5492 |
cancelling out common nat summands from =, <, <= (in)equalities, or |
|
5493 |
differences; simplification procedures nat_cancel_factor for |
|
5494 |
cancelling common factor from =, <, <= (in)equalities over natural |
|
4373 | 5495 |
sums; nat_cancel contains both kinds of procedures, it is installed by |
5496 |
default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL; |
|
4335 | 5497 |
|
3580 | 5498 |
* HOL/simplifier: terms of the form |
4325 | 5499 |
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x) |
3580 | 5500 |
are rewritten to |
4035 | 5501 |
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)', |
5502 |
and those of the form |
|
4325 | 5503 |
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x) |
4035 | 5504 |
are rewritten to |
5505 |
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)', |
|
5506 |
||
5507 |
* HOL/datatype |
|
5508 |
Each datatype `t' now comes with a theorem `split_t_case' of the form |
|
3580 | 5509 |
|
4035 | 5510 |
P(t_case f1 ... fn x) = |
5511 |
( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) & |
|
5512 |
... |
|
4189 | 5513 |
(!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn)) |
4035 | 5514 |
) |
5515 |
||
4930
89271bc4e7ed
extended addsplits and delsplits to handle also split rules for assumptions
oheimb
parents:
4915
diff
changeset
|
5516 |
and a theorem `split_t_case_asm' of the form |
4189 | 5517 |
|
5518 |
P(t_case f1 ... fn x) = |
|
5519 |
~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) | |
|
5520 |
... |
|
5521 |
(? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn)) |
|
5522 |
) |
|
4930
89271bc4e7ed
extended addsplits and delsplits to handle also split rules for assumptions
oheimb
parents:
4915
diff
changeset
|
5523 |
which can be added to a simpset via `addsplits'. The existing theorems |
89271bc4e7ed
extended addsplits and delsplits to handle also split rules for assumptions
oheimb
parents:
4915
diff
changeset
|
5524 |
expand_list_case and expand_option_case have been renamed to |
89271bc4e7ed
extended addsplits and delsplits to handle also split rules for assumptions
oheimb
parents:
4915
diff
changeset
|
5525 |
split_list_case and split_option_case. |
4189 | 5526 |
|
4361 | 5527 |
* HOL/Arithmetic: |
5528 |
- `pred n' is automatically converted to `n-1'. |
|
5529 |
Users are strongly encouraged not to use `pred' any longer, |
|
5530 |
because it will disappear altogether at some point. |
|
5531 |
- Users are strongly encouraged to write "0 < n" rather than |
|
5532 |
"n ~= 0". Theorems and proof tools have been modified towards this |
|
5533 |
`standard'. |
|
4357 | 5534 |
|
4502 | 5535 |
* HOL/Lists: |
5536 |
the function "set_of_list" has been renamed "set" (and its theorems too); |
|
5537 |
the function "nth" now takes its arguments in the reverse order and |
|
5538 |
has acquired the infix notation "!" as in "xs!n". |
|
3570 | 5539 |
|
4154 | 5540 |
* HOL/Set: UNIV is now a constant and is no longer translated to Compl{}; |
5541 |
||
5542 |
* HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its |
|
5543 |
specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x); |
|
5544 |
||
4575 | 5545 |
* HOL/record: extensible records with schematic structural subtyping |
5546 |
(single inheritance); EXPERIMENTAL version demonstrating the encoding, |
|
5547 |
still lacks various theorems and concrete record syntax; |
|
5548 |
||
4125 | 5549 |
|
3715 | 5550 |
*** HOLCF *** |
3535 | 5551 |
|
4125 | 5552 |
* removed "axioms" and "generated by" sections; |
5553 |
||
4123 | 5554 |
* replaced "ops" section by extended "consts" section, which is capable of |
4125 | 5555 |
handling the continuous function space "->" directly; |
5556 |
||
5557 |
* domain package: |
|
5558 |
. proves theorems immediately and stores them in the theory, |
|
5559 |
. creates hierachical name space, |
|
5560 |
. now uses normal mixfix annotations (instead of cinfix...), |
|
5561 |
. minor changes to some names and values (for consistency), |
|
5562 |
. e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas, |
|
5563 |
. separator between mutual domain defs: changed "," to "and", |
|
5564 |
. improved handling of sort constraints; now they have to |
|
5565 |
appear on the left-hand side of the equations only; |
|
4123 | 5566 |
|
5567 |
* fixed LAM <x,y,zs>.b syntax; |
|
3567 | 5568 |
|
3744 | 5569 |
* added extended adm_tac to simplifier in HOLCF -- can now discharge |
5570 |
adm (%x. P (t x)), where P is chainfinite and t continuous; |
|
3579 | 5571 |
|
5572 |
||
3719 | 5573 |
*** FOL and ZF *** |
5574 |
||
5726 | 5575 |
* FOL: there is a new splitter `split_asm_tac' that can be used e.g. |
4189 | 5576 |
with `addloop' of the simplifier to faciliate case splitting in premises. |
5577 |
||
3744 | 5578 |
* qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as |
5579 |
in HOL, they strip ALL and --> from proved theorems; |
|
5580 |
||
3719 | 5581 |
|
3579 | 5582 |
|
3006 | 5583 |
New in Isabelle94-8 (May 1997) |
5584 |
------------------------------ |
|
2654 | 5585 |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5586 |
*** General Changes *** |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5587 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5588 |
* new utilities to build / run / maintain Isabelle etc. (in parts |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5589 |
still somewhat experimental); old Makefiles etc. still functional; |
2971 | 5590 |
|
3205 | 5591 |
* new 'Isabelle System Manual'; |
5592 |
||
2825 | 5593 |
* INSTALL text, together with ./configure and ./build scripts; |
2773 | 5594 |
|
3006 | 5595 |
* reimplemented type inference for greater efficiency, better error |
5596 |
messages and clean internal interface; |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5597 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5598 |
* prlim command for dealing with lots of subgoals (an easier way of |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5599 |
setting goals_limit); |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5600 |
|
3006 | 5601 |
|
5602 |
*** Syntax *** |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5603 |
|
3116 | 5604 |
* supports alternative (named) syntax tables (parser and pretty |
5605 |
printer); internal interface is provided by add_modesyntax(_i); |
|
5606 |
||
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5607 |
* Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5608 |
be used in conjunction with the Isabelle symbol font; uses the |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5609 |
"symbols" syntax table; |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5610 |
|
2705 | 5611 |
* added token_translation interface (may translate name tokens in |
2756 | 5612 |
arbitrary ways, dependent on their type (free, bound, tfree, ...) and |
3116 | 5613 |
the current print_mode); IMPORTANT: user print translation functions |
5614 |
are responsible for marking newly introduced bounds |
|
5615 |
(Syntax.mark_boundT); |
|
2705 | 5616 |
|
2730 | 5617 |
* token translations for modes "xterm" and "xterm_color" that display |
3006 | 5618 |
names in bold, underline etc. or colors (which requires a color |
5619 |
version of xterm); |
|
2730 | 5620 |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5621 |
* infixes may now be declared with names independent of their syntax; |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5622 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5623 |
* added typed_print_translation (like print_translation, but may |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5624 |
access type of constant); |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5625 |
|
3006 | 5626 |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5627 |
*** Classical Reasoner *** |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5628 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5629 |
Blast_tac: a new tactic! It is often more powerful than fast_tac, but has |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5630 |
some limitations. Blast_tac... |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5631 |
+ ignores addss, addbefore, addafter; this restriction is intrinsic |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5632 |
+ ignores elimination rules that don't have the correct format |
5726 | 5633 |
(the conclusion MUST be a formula variable) |
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5634 |
+ ignores types, which can make HOL proofs fail |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5635 |
+ rules must not require higher-order unification, e.g. apply_type in ZF |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5636 |
[message "Function Var's argument not a bound variable" relates to this] |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5637 |
+ its proof strategy is more general but can actually be slower |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5638 |
|
3107 | 5639 |
* substitution with equality assumptions no longer permutes other |
5640 |
assumptions; |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5641 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5642 |
* minor changes in semantics of addafter (now called addaltern); renamed |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5643 |
setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper |
3107 | 5644 |
(and access functions for it); |
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5645 |
|
5726 | 5646 |
* improved combination of classical reasoner and simplifier: |
3317 | 5647 |
+ functions for handling clasimpsets |
5648 |
+ improvement of addss: now the simplifier is called _after_ the |
|
5649 |
safe steps. |
|
5650 |
+ safe variant of addss called addSss: uses safe simplifications |
|
5726 | 5651 |
_during_ the safe steps. It is more complete as it allows multiple |
3317 | 5652 |
instantiations of unknowns (e.g. with slow_tac). |
3006 | 5653 |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5654 |
*** Simplifier *** |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5655 |
|
3006 | 5656 |
* added interface for simplification procedures (functions that |
5657 |
produce *proven* rewrite rules on the fly, depending on current |
|
5658 |
redex); |
|
5659 |
||
5660 |
* ordering on terms as parameter (used for ordered rewriting); |
|
5661 |
||
3107 | 5662 |
* new functions delcongs, deleqcongs, and Delcongs. richer rep_ss; |
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5663 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5664 |
* the solver is now split into a safe and an unsafe part. |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5665 |
This should be invisible for the normal user, except that the |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5666 |
functions setsolver and addsolver have been renamed to setSolver and |
3107 | 5667 |
addSolver; added safe_asm_full_simp_tac; |
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5668 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5669 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5670 |
*** HOL *** |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5671 |
|
3042 | 5672 |
* a generic induction tactic `induct_tac' which works for all datatypes and |
3107 | 5673 |
also for type `nat'; |
3042 | 5674 |
|
3316 | 5675 |
* a generic case distinction tactic `exhaust_tac' which works for all |
5676 |
datatypes and also for type `nat'; |
|
5677 |
||
5678 |
* each datatype comes with a function `size'; |
|
5679 |
||
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5680 |
* patterns in case expressions allow tuple patterns as arguments to |
3107 | 5681 |
constructors, for example `case x of [] => ... | (x,y,z)#ps => ...'; |
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5682 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5683 |
* primrec now also works with type nat; |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5684 |
|
3338 | 5685 |
* recdef: a new declaration form, allows general recursive functions to be |
5686 |
defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify. |
|
5687 |
||
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5688 |
* the constant for negation has been renamed from "not" to "Not" to |
3107 | 5689 |
harmonize with FOL, ZF, LK, etc.; |
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5690 |
|
3107 | 5691 |
* HOL/ex/LFilter theory of a corecursive "filter" functional for |
5692 |
infinite lists; |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5693 |
|
3227 | 5694 |
* HOL/Modelcheck demonstrates invocation of model checker oracle; |
5695 |
||
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5696 |
* HOL/ex/Ring.thy declares cring_simp, which solves equational |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5697 |
problems in commutative rings, using axiomatic type classes for + and *; |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5698 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5699 |
* more examples in HOL/MiniML and HOL/Auth; |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5700 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5701 |
* more default rewrite rules for quantifiers, union/intersection; |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5702 |
|
3321 | 5703 |
* a new constant `arbitrary == @x.False'; |
5704 |
||
3107 | 5705 |
* HOLCF/IOA replaces old HOL/IOA; |
5706 |
||
5726 | 5707 |
* HOLCF changes: derived all rules and arities |
5708 |
+ axiomatic type classes instead of classes |
|
2653
f1a6997cdc06
described changes for HOLCF-Version without rules and arities
slotosch
parents:
2649
diff
changeset
|
5709 |
+ typedef instead of faking type definitions |
2747 | 5710 |
+ eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc. |
2730 | 5711 |
+ new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po |
2653
f1a6997cdc06
described changes for HOLCF-Version without rules and arities
slotosch
parents:
2649
diff
changeset
|
5712 |
+ eliminated the types void, one, tr |
f1a6997cdc06
described changes for HOLCF-Version without rules and arities
slotosch
parents:
2649
diff
changeset
|
5713 |
+ use unit lift and bool lift (with translations) instead of one and tr |
f1a6997cdc06
described changes for HOLCF-Version without rules and arities
slotosch
parents:
2649
diff
changeset
|
5714 |
+ eliminated blift from Lift3.thy (use Def instead of blift) |
3107 | 5715 |
all eliminated rules are derived as theorems --> no visible changes ; |
2649 | 5716 |
|
3006 | 5717 |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
5718 |
*** ZF *** |
2553 | 5719 |
|
2865 | 5720 |
* ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default |
5721 |
rewrite rule; this may affect some proofs. eq_cs is gone but can be put back |
|
5722 |
as ZF_cs addSIs [equalityI]; |
|
2553 | 5723 |
|
2554 | 5724 |
|
2732 | 5725 |
|
2553 | 5726 |
New in Isabelle94-7 (November 96) |
5727 |
--------------------------------- |
|
5728 |
||
5729 |
* allowing negative levels (as offsets) in prlev and choplev; |
|
5730 |
||
2554 | 5731 |
* super-linear speedup for large simplifications; |
5732 |
||
5733 |
* FOL, ZF and HOL now use miniscoping: rewriting pushes |
|
5734 |
quantifications in as far as possible (COULD MAKE EXISTING PROOFS |
|
5735 |
FAIL); can suppress it using the command Delsimps (ex_simps @ |
|
5736 |
all_simps); De Morgan laws are also now included, by default; |
|
5737 |
||
5738 |
* improved printing of ==> : ~: |
|
5739 |
||
5740 |
* new object-logic "Sequents" adds linear logic, while replacing LK |
|
5741 |
and Modal (thanks to Sara Kalvala); |
|
5742 |
||
5743 |
* HOL/Auth: correctness proofs for authentication protocols; |
|
5744 |
||
5745 |
* HOL: new auto_tac combines rewriting and classical reasoning (many |
|
5746 |
examples on HOL/Auth); |
|
5747 |
||
5748 |
* HOL: new command AddIffs for declaring theorems of the form P=Q to |
|
5749 |
the rewriter and classical reasoner simultaneously; |
|
5750 |
||
5751 |
* function uresult no longer returns theorems in "standard" format; |
|
5752 |
regain previous version by: val uresult = standard o uresult; |
|
5753 |
||
5754 |
||
5755 |
||
5756 |
New in Isabelle94-6 |
|
5757 |
------------------- |
|
5758 |
||
5759 |
* oracles -- these establish an interface between Isabelle and trusted |
|
5760 |
external reasoners, which may deliver results as theorems; |
|
5761 |
||
5762 |
* proof objects (in particular record all uses of oracles); |
|
5763 |
||
5764 |
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset; |
|
5765 |
||
5766 |
* "constdefs" section in theory files; |
|
5767 |
||
5768 |
* "primrec" section (HOL) no longer requires names; |
|
5769 |
||
5770 |
* internal type "tactic" now simply "thm -> thm Sequence.seq"; |
|
5771 |
||
5772 |
||
5773 |
||
5774 |
New in Isabelle94-5 |
|
5775 |
------------------- |
|
5776 |
||
5777 |
* reduced space requirements; |
|
5778 |
||
5779 |
* automatic HTML generation from theories; |
|
5780 |
||
5781 |
* theory files no longer require "..." (quotes) around most types; |
|
5782 |
||
5783 |
* new examples, including two proofs of the Church-Rosser theorem; |
|
5784 |
||
5785 |
* non-curried (1994) version of HOL is no longer distributed; |
|
5786 |
||
2553 | 5787 |
|
2557 | 5788 |
|
5789 |
New in Isabelle94-4 |
|
5790 |
------------------- |
|
5791 |
||
2747 | 5792 |
* greatly reduced space requirements; |
2557 | 5793 |
|
5794 |
* theory files (.thy) no longer require \...\ escapes at line breaks; |
|
5795 |
||
5726 | 5796 |
* searchable theorem database (see the section "Retrieving theorems" on |
2557 | 5797 |
page 8 of the Reference Manual); |
5798 |
||
5799 |
* new examples, including Grabczewski's monumental case study of the |
|
5800 |
Axiom of Choice; |
|
5801 |
||
5802 |
* The previous version of HOL renamed to Old_HOL; |
|
5803 |
||
5726 | 5804 |
* The new version of HOL (previously called CHOL) uses a curried syntax |
2557 | 5805 |
for functions. Application looks like f a b instead of f(a,b); |
5806 |
||
5807 |
* Mutually recursive inductive definitions finally work in HOL; |
|
5808 |
||
5809 |
* In ZF, pattern-matching on tuples is now available in all abstractions and |
|
5810 |
translates to the operator "split"; |
|
5811 |
||
5812 |
||
5813 |
||
5814 |
New in Isabelle94-3 |
|
5815 |
------------------- |
|
5816 |
||
5726 | 5817 |
* new infix operator, addss, allowing the classical reasoner to |
2557 | 5818 |
perform simplification at each step of its search. Example: |
5726 | 5819 |
fast_tac (cs addss ss) |
2557 | 5820 |
|
5726 | 5821 |
* a new logic, CHOL, the same as HOL, but with a curried syntax |
5822 |
for functions. Application looks like f a b instead of f(a,b). Also pairs |
|
2557 | 5823 |
look like (a,b) instead of <a,b>; |
5824 |
||
5825 |
* PLEASE NOTE: CHOL will eventually replace HOL! |
|
5826 |
||
5827 |
* In CHOL, pattern-matching on tuples is now available in all abstractions. |
|
5828 |
It translates to the operator "split". A new theory of integers is available; |
|
5829 |
||
5830 |
* In ZF, integer numerals now denote two's-complement binary integers. |
|
5831 |
Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML; |
|
5832 |
||
5726 | 5833 |
* Many new examples: I/O automata, Church-Rosser theorem, equivalents |
2557 | 5834 |
of the Axiom of Choice; |
5835 |
||
5836 |
||
5837 |
||
5838 |
New in Isabelle94-2 |
|
5839 |
------------------- |
|
5840 |
||
5726 | 5841 |
* Significantly faster resolution; |
2557 | 5842 |
|
5843 |
* the different sections in a .thy file can now be mixed and repeated |
|
5844 |
freely; |
|
5845 |
||
5846 |
* Database of theorems for FOL, HOL and ZF. New |
|
5847 |
commands including qed, qed_goal and bind_thm store theorems in the database. |
|
5848 |
||
5849 |
* Simple database queries: return a named theorem (get_thm) or all theorems of |
|
5850 |
a given theory (thms_of), or find out what theory a theorem was proved in |
|
5851 |
(theory_of_thm); |
|
5852 |
||
5853 |
* Bugs fixed in the inductive definition and datatype packages; |
|
5854 |
||
5855 |
* The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs |
|
5856 |
and HOL_dup_cs obsolete; |
|
5857 |
||
5858 |
* Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1 |
|
5859 |
have been removed; |
|
5860 |
||
5861 |
* Simpler definition of function space in ZF; |
|
5862 |
||
5863 |
* new results about cardinal and ordinal arithmetic in ZF; |
|
5864 |
||
5865 |
* 'subtype' facility in HOL for introducing new types as subsets of existing |
|
5866 |
types; |
|
5867 |
||
24213 | 5868 |
:mode=text:wrap=hard:maxLineLen=72: |
26231 | 5869 |
|
27823 | 5870 |
|
2553 | 5871 |
$Id$ |