wenzelm@2553
|
1 |
|
wenzelm@2553
|
2 |
Isabelle NEWS -- history of user-visible changes
|
wenzelm@2553
|
3 |
================================================
|
wenzelm@2553
|
4 |
|
wenzelm@3006
|
5 |
New in Isabelle94-8 (May 1997)
|
wenzelm@3006
|
6 |
------------------------------
|
wenzelm@2654
|
7 |
|
paulson@3002
|
8 |
*** General Changes ***
|
paulson@3002
|
9 |
|
paulson@3002
|
10 |
* new utilities to build / run / maintain Isabelle etc. (in parts
|
paulson@3002
|
11 |
still somewhat experimental); old Makefiles etc. still functional;
|
wenzelm@2971
|
12 |
|
wenzelm@3205
|
13 |
* new 'Isabelle System Manual';
|
wenzelm@3205
|
14 |
|
wenzelm@2825
|
15 |
* INSTALL text, together with ./configure and ./build scripts;
|
wenzelm@2773
|
16 |
|
wenzelm@3006
|
17 |
* reimplemented type inference for greater efficiency, better error
|
wenzelm@3006
|
18 |
messages and clean internal interface;
|
paulson@3002
|
19 |
|
paulson@3002
|
20 |
* prlim command for dealing with lots of subgoals (an easier way of
|
paulson@3002
|
21 |
setting goals_limit);
|
paulson@3002
|
22 |
|
wenzelm@3006
|
23 |
|
wenzelm@3006
|
24 |
*** Syntax ***
|
paulson@3002
|
25 |
|
wenzelm@3116
|
26 |
* supports alternative (named) syntax tables (parser and pretty
|
wenzelm@3116
|
27 |
printer); internal interface is provided by add_modesyntax(_i);
|
wenzelm@3116
|
28 |
|
paulson@3002
|
29 |
* Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
|
paulson@3002
|
30 |
be used in conjunction with the Isabelle symbol font; uses the
|
paulson@3002
|
31 |
"symbols" syntax table;
|
paulson@3002
|
32 |
|
wenzelm@2705
|
33 |
* added token_translation interface (may translate name tokens in
|
wenzelm@2756
|
34 |
arbitrary ways, dependent on their type (free, bound, tfree, ...) and
|
wenzelm@3116
|
35 |
the current print_mode); IMPORTANT: user print translation functions
|
wenzelm@3116
|
36 |
are responsible for marking newly introduced bounds
|
wenzelm@3116
|
37 |
(Syntax.mark_boundT);
|
wenzelm@2705
|
38 |
|
wenzelm@2730
|
39 |
* token translations for modes "xterm" and "xterm_color" that display
|
wenzelm@3006
|
40 |
names in bold, underline etc. or colors (which requires a color
|
wenzelm@3006
|
41 |
version of xterm);
|
wenzelm@2730
|
42 |
|
paulson@3002
|
43 |
* infixes may now be declared with names independent of their syntax;
|
paulson@3002
|
44 |
|
paulson@3002
|
45 |
* added typed_print_translation (like print_translation, but may
|
paulson@3002
|
46 |
access type of constant);
|
paulson@3002
|
47 |
|
wenzelm@3006
|
48 |
|
paulson@3002
|
49 |
*** Classical Reasoner ***
|
paulson@3002
|
50 |
|
paulson@3002
|
51 |
Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
|
paulson@3002
|
52 |
some limitations. Blast_tac...
|
paulson@3002
|
53 |
+ ignores addss, addbefore, addafter; this restriction is intrinsic
|
paulson@3002
|
54 |
+ ignores elimination rules that don't have the correct format
|
paulson@3002
|
55 |
(the conclusion MUST be a formula variable)
|
paulson@3002
|
56 |
+ ignores types, which can make HOL proofs fail
|
paulson@3002
|
57 |
+ rules must not require higher-order unification, e.g. apply_type in ZF
|
paulson@3002
|
58 |
[message "Function Var's argument not a bound variable" relates to this]
|
paulson@3002
|
59 |
+ its proof strategy is more general but can actually be slower
|
paulson@3002
|
60 |
|
wenzelm@3107
|
61 |
* substitution with equality assumptions no longer permutes other
|
wenzelm@3107
|
62 |
assumptions;
|
paulson@3002
|
63 |
|
paulson@3002
|
64 |
* minor changes in semantics of addafter (now called addaltern); renamed
|
paulson@3002
|
65 |
setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
|
wenzelm@3107
|
66 |
(and access functions for it);
|
paulson@3002
|
67 |
|
oheimb@3317
|
68 |
* improved combination of classical reasoner and simplifier:
|
oheimb@3317
|
69 |
+ functions for handling clasimpsets
|
oheimb@3317
|
70 |
+ improvement of addss: now the simplifier is called _after_ the
|
oheimb@3317
|
71 |
safe steps.
|
oheimb@3317
|
72 |
+ safe variant of addss called addSss: uses safe simplifications
|
oheimb@3317
|
73 |
_during_ the safe steps. It is more complete as it allows multiple
|
oheimb@3317
|
74 |
instantiations of unknowns (e.g. with slow_tac).
|
wenzelm@3006
|
75 |
|
paulson@3002
|
76 |
*** Simplifier ***
|
paulson@3002
|
77 |
|
wenzelm@3006
|
78 |
* added interface for simplification procedures (functions that
|
wenzelm@3006
|
79 |
produce *proven* rewrite rules on the fly, depending on current
|
wenzelm@3006
|
80 |
redex);
|
wenzelm@3006
|
81 |
|
wenzelm@3006
|
82 |
* ordering on terms as parameter (used for ordered rewriting);
|
wenzelm@3006
|
83 |
|
wenzelm@3107
|
84 |
* new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
|
paulson@3002
|
85 |
|
paulson@3002
|
86 |
* the solver is now split into a safe and an unsafe part.
|
paulson@3002
|
87 |
This should be invisible for the normal user, except that the
|
paulson@3002
|
88 |
functions setsolver and addsolver have been renamed to setSolver and
|
wenzelm@3107
|
89 |
addSolver; added safe_asm_full_simp_tac;
|
paulson@3002
|
90 |
|
paulson@3002
|
91 |
|
paulson@3002
|
92 |
*** HOL ***
|
paulson@3002
|
93 |
|
nipkow@3042
|
94 |
* a generic induction tactic `induct_tac' which works for all datatypes and
|
wenzelm@3107
|
95 |
also for type `nat';
|
nipkow@3042
|
96 |
|
nipkow@3316
|
97 |
* a generic case distinction tactic `exhaust_tac' which works for all
|
nipkow@3316
|
98 |
datatypes and also for type `nat';
|
nipkow@3316
|
99 |
|
nipkow@3316
|
100 |
* each datatype comes with a function `size';
|
nipkow@3316
|
101 |
|
paulson@3002
|
102 |
* patterns in case expressions allow tuple patterns as arguments to
|
wenzelm@3107
|
103 |
constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
|
paulson@3002
|
104 |
|
paulson@3002
|
105 |
* primrec now also works with type nat;
|
paulson@3002
|
106 |
|
paulson@3002
|
107 |
* the constant for negation has been renamed from "not" to "Not" to
|
wenzelm@3107
|
108 |
harmonize with FOL, ZF, LK, etc.;
|
paulson@3002
|
109 |
|
wenzelm@3107
|
110 |
* HOL/ex/LFilter theory of a corecursive "filter" functional for
|
wenzelm@3107
|
111 |
infinite lists;
|
paulson@3002
|
112 |
|
wenzelm@3227
|
113 |
* HOL/Modelcheck demonstrates invocation of model checker oracle;
|
wenzelm@3227
|
114 |
|
paulson@3002
|
115 |
* HOL/ex/Ring.thy declares cring_simp, which solves equational
|
paulson@3002
|
116 |
problems in commutative rings, using axiomatic type classes for + and *;
|
paulson@3002
|
117 |
|
paulson@3002
|
118 |
* more examples in HOL/MiniML and HOL/Auth;
|
paulson@3002
|
119 |
|
paulson@3002
|
120 |
* more default rewrite rules for quantifiers, union/intersection;
|
paulson@3002
|
121 |
|
nipkow@3321
|
122 |
* a new constant `arbitrary == @x.False';
|
nipkow@3321
|
123 |
|
wenzelm@3107
|
124 |
* HOLCF/IOA replaces old HOL/IOA;
|
wenzelm@3107
|
125 |
|
slotosch@2653
|
126 |
* HOLCF changes: derived all rules and arities
|
slotosch@2653
|
127 |
+ axiomatic type classes instead of classes
|
slotosch@2653
|
128 |
+ typedef instead of faking type definitions
|
paulson@2747
|
129 |
+ eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
|
wenzelm@2730
|
130 |
+ new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
|
slotosch@2653
|
131 |
+ eliminated the types void, one, tr
|
slotosch@2653
|
132 |
+ use unit lift and bool lift (with translations) instead of one and tr
|
slotosch@2653
|
133 |
+ eliminated blift from Lift3.thy (use Def instead of blift)
|
wenzelm@3107
|
134 |
all eliminated rules are derived as theorems --> no visible changes ;
|
oheimb@2649
|
135 |
|
wenzelm@3006
|
136 |
|
paulson@3002
|
137 |
*** ZF ***
|
wenzelm@2553
|
138 |
|
paulson@2865
|
139 |
* ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
|
paulson@2865
|
140 |
rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
|
paulson@2865
|
141 |
as ZF_cs addSIs [equalityI];
|
wenzelm@2553
|
142 |
|
wenzelm@2554
|
143 |
|
wenzelm@2732
|
144 |
|
wenzelm@2553
|
145 |
New in Isabelle94-7 (November 96)
|
wenzelm@2553
|
146 |
---------------------------------
|
wenzelm@2553
|
147 |
|
wenzelm@2553
|
148 |
* allowing negative levels (as offsets) in prlev and choplev;
|
wenzelm@2553
|
149 |
|
wenzelm@2554
|
150 |
* super-linear speedup for large simplifications;
|
wenzelm@2554
|
151 |
|
wenzelm@2554
|
152 |
* FOL, ZF and HOL now use miniscoping: rewriting pushes
|
wenzelm@2554
|
153 |
quantifications in as far as possible (COULD MAKE EXISTING PROOFS
|
wenzelm@2554
|
154 |
FAIL); can suppress it using the command Delsimps (ex_simps @
|
wenzelm@2554
|
155 |
all_simps); De Morgan laws are also now included, by default;
|
wenzelm@2554
|
156 |
|
wenzelm@2554
|
157 |
* improved printing of ==> : ~:
|
wenzelm@2554
|
158 |
|
wenzelm@2554
|
159 |
* new object-logic "Sequents" adds linear logic, while replacing LK
|
wenzelm@2554
|
160 |
and Modal (thanks to Sara Kalvala);
|
wenzelm@2554
|
161 |
|
wenzelm@2554
|
162 |
* HOL/Auth: correctness proofs for authentication protocols;
|
wenzelm@2554
|
163 |
|
wenzelm@2554
|
164 |
* HOL: new auto_tac combines rewriting and classical reasoning (many
|
wenzelm@2554
|
165 |
examples on HOL/Auth);
|
wenzelm@2554
|
166 |
|
wenzelm@2554
|
167 |
* HOL: new command AddIffs for declaring theorems of the form P=Q to
|
wenzelm@2554
|
168 |
the rewriter and classical reasoner simultaneously;
|
wenzelm@2554
|
169 |
|
wenzelm@2554
|
170 |
* function uresult no longer returns theorems in "standard" format;
|
wenzelm@2554
|
171 |
regain previous version by: val uresult = standard o uresult;
|
wenzelm@2554
|
172 |
|
wenzelm@2554
|
173 |
|
wenzelm@2554
|
174 |
|
wenzelm@2554
|
175 |
New in Isabelle94-6
|
wenzelm@2554
|
176 |
-------------------
|
wenzelm@2554
|
177 |
|
wenzelm@2554
|
178 |
* oracles -- these establish an interface between Isabelle and trusted
|
wenzelm@2554
|
179 |
external reasoners, which may deliver results as theorems;
|
wenzelm@2554
|
180 |
|
wenzelm@2554
|
181 |
* proof objects (in particular record all uses of oracles);
|
wenzelm@2554
|
182 |
|
wenzelm@2554
|
183 |
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
|
wenzelm@2554
|
184 |
|
wenzelm@2554
|
185 |
* "constdefs" section in theory files;
|
wenzelm@2554
|
186 |
|
wenzelm@2554
|
187 |
* "primrec" section (HOL) no longer requires names;
|
wenzelm@2554
|
188 |
|
wenzelm@2554
|
189 |
* internal type "tactic" now simply "thm -> thm Sequence.seq";
|
wenzelm@2554
|
190 |
|
wenzelm@2554
|
191 |
|
wenzelm@2554
|
192 |
|
wenzelm@2554
|
193 |
New in Isabelle94-5
|
wenzelm@2554
|
194 |
-------------------
|
wenzelm@2554
|
195 |
|
wenzelm@2554
|
196 |
* reduced space requirements;
|
wenzelm@2554
|
197 |
|
wenzelm@2554
|
198 |
* automatic HTML generation from theories;
|
wenzelm@2554
|
199 |
|
wenzelm@2554
|
200 |
* theory files no longer require "..." (quotes) around most types;
|
wenzelm@2554
|
201 |
|
wenzelm@2554
|
202 |
* new examples, including two proofs of the Church-Rosser theorem;
|
wenzelm@2554
|
203 |
|
wenzelm@2554
|
204 |
* non-curried (1994) version of HOL is no longer distributed;
|
wenzelm@2554
|
205 |
|
wenzelm@2553
|
206 |
|
paulson@2557
|
207 |
|
paulson@2557
|
208 |
New in Isabelle94-4
|
paulson@2557
|
209 |
-------------------
|
paulson@2557
|
210 |
|
paulson@2747
|
211 |
* greatly reduced space requirements;
|
paulson@2557
|
212 |
|
paulson@2557
|
213 |
* theory files (.thy) no longer require \...\ escapes at line breaks;
|
paulson@2557
|
214 |
|
paulson@2557
|
215 |
* searchable theorem database (see the section "Retrieving theorems" on
|
paulson@2557
|
216 |
page 8 of the Reference Manual);
|
paulson@2557
|
217 |
|
paulson@2557
|
218 |
* new examples, including Grabczewski's monumental case study of the
|
paulson@2557
|
219 |
Axiom of Choice;
|
paulson@2557
|
220 |
|
paulson@2557
|
221 |
* The previous version of HOL renamed to Old_HOL;
|
paulson@2557
|
222 |
|
paulson@2557
|
223 |
* The new version of HOL (previously called CHOL) uses a curried syntax
|
paulson@2557
|
224 |
for functions. Application looks like f a b instead of f(a,b);
|
paulson@2557
|
225 |
|
paulson@2557
|
226 |
* Mutually recursive inductive definitions finally work in HOL;
|
paulson@2557
|
227 |
|
paulson@2557
|
228 |
* In ZF, pattern-matching on tuples is now available in all abstractions and
|
paulson@2557
|
229 |
translates to the operator "split";
|
paulson@2557
|
230 |
|
paulson@2557
|
231 |
|
paulson@2557
|
232 |
|
paulson@2557
|
233 |
New in Isabelle94-3
|
paulson@2557
|
234 |
-------------------
|
paulson@2557
|
235 |
|
paulson@2557
|
236 |
* new infix operator, addss, allowing the classical reasoner to
|
paulson@2557
|
237 |
perform simplification at each step of its search. Example:
|
paulson@2557
|
238 |
fast_tac (cs addss ss)
|
paulson@2557
|
239 |
|
paulson@2557
|
240 |
* a new logic, CHOL, the same as HOL, but with a curried syntax
|
paulson@2557
|
241 |
for functions. Application looks like f a b instead of f(a,b). Also pairs
|
paulson@2557
|
242 |
look like (a,b) instead of <a,b>;
|
paulson@2557
|
243 |
|
paulson@2557
|
244 |
* PLEASE NOTE: CHOL will eventually replace HOL!
|
paulson@2557
|
245 |
|
paulson@2557
|
246 |
* In CHOL, pattern-matching on tuples is now available in all abstractions.
|
paulson@2557
|
247 |
It translates to the operator "split". A new theory of integers is available;
|
paulson@2557
|
248 |
|
paulson@2557
|
249 |
* In ZF, integer numerals now denote two's-complement binary integers.
|
paulson@2557
|
250 |
Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
|
paulson@2557
|
251 |
|
paulson@2557
|
252 |
* Many new examples: I/O automata, Church-Rosser theorem, equivalents
|
paulson@2557
|
253 |
of the Axiom of Choice;
|
paulson@2557
|
254 |
|
paulson@2557
|
255 |
|
paulson@2557
|
256 |
|
paulson@2557
|
257 |
New in Isabelle94-2
|
paulson@2557
|
258 |
-------------------
|
paulson@2557
|
259 |
|
paulson@2557
|
260 |
* Significantly faster resolution;
|
paulson@2557
|
261 |
|
paulson@2557
|
262 |
* the different sections in a .thy file can now be mixed and repeated
|
paulson@2557
|
263 |
freely;
|
paulson@2557
|
264 |
|
paulson@2557
|
265 |
* Database of theorems for FOL, HOL and ZF. New
|
paulson@2557
|
266 |
commands including qed, qed_goal and bind_thm store theorems in the database.
|
paulson@2557
|
267 |
|
paulson@2557
|
268 |
* Simple database queries: return a named theorem (get_thm) or all theorems of
|
paulson@2557
|
269 |
a given theory (thms_of), or find out what theory a theorem was proved in
|
paulson@2557
|
270 |
(theory_of_thm);
|
paulson@2557
|
271 |
|
paulson@2557
|
272 |
* Bugs fixed in the inductive definition and datatype packages;
|
paulson@2557
|
273 |
|
paulson@2557
|
274 |
* The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
|
paulson@2557
|
275 |
and HOL_dup_cs obsolete;
|
paulson@2557
|
276 |
|
paulson@2557
|
277 |
* Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
|
paulson@2557
|
278 |
have been removed;
|
paulson@2557
|
279 |
|
paulson@2557
|
280 |
* Simpler definition of function space in ZF;
|
paulson@2557
|
281 |
|
paulson@2557
|
282 |
* new results about cardinal and ordinal arithmetic in ZF;
|
paulson@2557
|
283 |
|
paulson@2557
|
284 |
* 'subtype' facility in HOL for introducing new types as subsets of existing
|
paulson@2557
|
285 |
types;
|
paulson@2557
|
286 |
|
paulson@2557
|
287 |
|
wenzelm@2553
|
288 |
$Id$
|