wenzelm@6420
|
1 |
|
wenzelm@5363
|
2 |
Isabelle NEWS -- history user-relevant changes
|
wenzelm@5363
|
3 |
==============================================
|
wenzelm@2553
|
4 |
|
wenzelm@4981
|
5 |
New in this Isabelle version
|
wenzelm@4981
|
6 |
----------------------------
|
oheimb@4649
|
7 |
|
paulson@5931
|
8 |
*** Overview of INCOMPATIBILITIES (see below for more details) ***
|
paulson@5931
|
9 |
|
paulson@6922
|
10 |
* HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
|
paulson@6922
|
11 |
are no longer simplified. (This allows the simplifier to unfold recursive
|
paulson@6922
|
12 |
functional programs.) To restore the old behaviour, declare
|
paulson@6922
|
13 |
Delcongs [if_weak_cong];
|
paulson@6922
|
14 |
|
wenzelm@6269
|
15 |
* HOL: Removed the obsolete syntax "Compl A"; use -A for set
|
wenzelm@6269
|
16 |
complement;
|
paulson@5931
|
17 |
|
wenzelm@6269
|
18 |
* HOL: the predicate "inj" is now defined by translation to "inj_on";
|
paulson@6174
|
19 |
|
wenzelm@6386
|
20 |
* HOL/typedef: fixed type inference for representing set; type
|
wenzelm@6386
|
21 |
arguments now have to occur explicitly on the rhs as type constraints;
|
wenzelm@6386
|
22 |
|
wenzelm@6269
|
23 |
* ZF: The con_defs part of an inductive definition may no longer refer
|
wenzelm@6269
|
24 |
to constants declared in the same theory;
|
nipkow@6057
|
25 |
|
wenzelm@6269
|
26 |
* HOL, ZF: the function mk_cases, generated by the inductive
|
wenzelm@6269
|
27 |
definition package, has lost an argument. To simplify its result, it
|
wenzelm@6269
|
28 |
uses the default simpset instead of a supplied list of theorems.
|
paulson@6141
|
29 |
|
nipkow@6057
|
30 |
|
paulson@6069
|
31 |
*** Proof tools ***
|
paulson@6069
|
32 |
|
wenzelm@6343
|
33 |
* Provers/Arith/fast_lin_arith.ML contains a functor for creating a
|
wenzelm@6343
|
34 |
decision procedure for linear arithmetic. Currently it is used for
|
wenzelm@6343
|
35 |
types `nat' and `int' in HOL (see below) but can, should and will be
|
wenzelm@6343
|
36 |
instantiated for other types and logics as well.
|
paulson@6069
|
37 |
|
paulson@6069
|
38 |
|
paulson@6014
|
39 |
*** General ***
|
paulson@6014
|
40 |
|
wenzelm@6751
|
41 |
* Isabelle manuals now also available as PDF;
|
wenzelm@6751
|
42 |
|
wenzelm@6671
|
43 |
* improved browser info generation: better HTML markup (including
|
wenzelm@6671
|
44 |
colors), graph views in several sizes; isatool usedir now provides a
|
wenzelm@6671
|
45 |
proper interface for user theories (via -P option);
|
wenzelm@6671
|
46 |
|
wenzelm@6449
|
47 |
* theory loader rewritten from scratch (may not be fully
|
wenzelm@6449
|
48 |
bug-compatible); old loadpath variable has been replaced by show_path,
|
wenzelm@6671
|
49 |
add_path, del_path, reset_path functions; new operations such as
|
wenzelm@6671
|
50 |
update_thy, touch_thy, remove_thy (see also isatool doc ref);
|
wenzelm@6449
|
51 |
|
wenzelm@6343
|
52 |
* in locales, the "assumes" and "defines" parts may be omitted if
|
wenzelm@6343
|
53 |
empty;
|
wenzelm@5973
|
54 |
|
wenzelm@6269
|
55 |
* new print_mode "xsymbols" for extended symbol support (e.g. genuine
|
wenzelm@6269
|
56 |
long arrows);
|
wenzelm@6259
|
57 |
|
wenzelm@6343
|
58 |
* new print_mode "HTML";
|
wenzelm@6343
|
59 |
|
wenzelm@6259
|
60 |
* path element specification '~~' refers to '$ISABELLE_HOME';
|
wenzelm@6259
|
61 |
|
wenzelm@6343
|
62 |
* new flag show_tags controls display of tags of theorems (which are
|
wenzelm@6343
|
63 |
basically just comments that may be attached by some tools);
|
wenzelm@6343
|
64 |
|
wenzelm@6420
|
65 |
* improved isatool install: option -k creates KDE application icon,
|
wenzelm@6420
|
66 |
option -p DIR installs standalone binaries;
|
wenzelm@6415
|
67 |
|
wenzelm@6413
|
68 |
* added ML_PLATFORM setting (useful for cross-platform installations);
|
wenzelm@6671
|
69 |
more robust handling of platform specific ML images for SML/NJ;
|
wenzelm@6413
|
70 |
|
wenzelm@6461
|
71 |
* Isamode 2.6 requires patch to accomodate change of Isabelle font
|
wenzelm@6461
|
72 |
mode and goal output format:
|
wenzelm@6461
|
73 |
|
wenzelm@6461
|
74 |
diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
|
wenzelm@6461
|
75 |
244c244
|
wenzelm@6461
|
76 |
< (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
|
wenzelm@6461
|
77 |
---
|
wenzelm@6533
|
78 |
> (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
|
wenzelm@6461
|
79 |
diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
|
wenzelm@6461
|
80 |
181c181
|
wenzelm@6461
|
81 |
< (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
|
wenzelm@6461
|
82 |
---
|
wenzelm@6461
|
83 |
> (defconst proofstate-proofstart-regexp "^Level [0-9]+"
|
wenzelm@6461
|
84 |
|
oheimb@6028
|
85 |
|
nipkow@6057
|
86 |
*** HOL ***
|
nipkow@6057
|
87 |
|
wenzelm@6343
|
88 |
* There are now decision procedures for linear arithmetic over nat and
|
wenzelm@6343
|
89 |
int:
|
nipkow@6131
|
90 |
|
wenzelm@6343
|
91 |
1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
|
wenzelm@6343
|
92 |
`+', `-', `Suc', `min', `max' and numerical constants; other subterms
|
wenzelm@6343
|
93 |
are treated as atomic; subformulae not involving type `nat' or `int'
|
wenzelm@6343
|
94 |
are ignored; quantified subformulae are ignored unless they are
|
wenzelm@6343
|
95 |
positive universal or negative existential. The tactic has to be
|
wenzelm@6343
|
96 |
invoked by hand and can be a little bit slow. In particular, the
|
wenzelm@6343
|
97 |
running time is exponential in the number of occurrences of `min' and
|
wenzelm@6343
|
98 |
`max', and `-' on `nat'.
|
nipkow@6131
|
99 |
|
wenzelm@6343
|
100 |
2. fast_arith_tac is a cut-down version of arith_tac: it only takes
|
wenzelm@6343
|
101 |
(negated) (in)equalities among the premises and the conclusion into
|
wenzelm@6343
|
102 |
account (i.e. no compound formulae) and does not know about `min' and
|
wenzelm@6343
|
103 |
`max', and `-' on `nat'. It is fast and is used automatically by the
|
wenzelm@6343
|
104 |
simplifier.
|
nipkow@6131
|
105 |
|
wenzelm@6343
|
106 |
NB: At the moment, these decision procedures do not cope with mixed
|
wenzelm@6343
|
107 |
nat/int formulae where the two parts interact, such as `m < n ==>
|
wenzelm@6343
|
108 |
int(m) < int(n)'.
|
oheimb@6028
|
109 |
|
paulson@7157
|
110 |
* An interface to the Stanford Validity Checker (SVC) is available through
|
paulson@7157
|
111 |
the tactic svc_tac. Propositional tautologies and theorems of linear
|
paulson@7157
|
112 |
arithmetic are proved automatically. Numeric variables may have types nat,
|
paulson@7157
|
113 |
int or real. SVC must be installed separately, and
|
paulson@7157
|
114 |
its results must be TAKEN ON TRUST (Isabelle does not check the proofs).
|
paulson@7157
|
115 |
|
paulson@6922
|
116 |
* Integer division and remainder can now be performed on constant arguments.
|
paulson@6922
|
117 |
|
paulson@6922
|
118 |
* Many properties of integer multiplication, division and remainder are now
|
paulson@6922
|
119 |
available.
|
paulson@6922
|
120 |
|
wenzelm@7125
|
121 |
* IsaMakefile: the HOL-Real target now builds an actual image;
|
wenzelm@7125
|
122 |
|
nipkow@6403
|
123 |
* New bounded quantifier syntax (input only):
|
nipkow@6403
|
124 |
! x < y. P, ! x <= y. P, ? x < y. P, ? x <= y. P
|
nipkow@6403
|
125 |
|
wenzelm@6278
|
126 |
* HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
|
wenzelm@6278
|
127 |
-- avoids syntactic ambiguities and treats state, transition, and
|
wenzelm@6278
|
128 |
temporal levels more uniformly; introduces INCOMPATIBILITIES due to
|
wenzelm@6278
|
129 |
changed syntax and (many) tactics;
|
wenzelm@6278
|
130 |
|
berghofe@7047
|
131 |
* HOL/datatype: Now also handles arbitrarily branching datatypes
|
berghofe@7047
|
132 |
(using function types) such as
|
berghofe@7047
|
133 |
|
berghofe@7047
|
134 |
datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
|
berghofe@7047
|
135 |
|
wenzelm@6386
|
136 |
* HOL/typedef: fixed type inference for representing set; type
|
wenzelm@6386
|
137 |
arguments now have to occur explicitly on the rhs as type constraints;
|
wenzelm@6386
|
138 |
|
wenzelm@6671
|
139 |
* HOL/recdef (TFL): requires theory Recdef; 'congs' syntax now expects
|
wenzelm@6671
|
140 |
comma separated list of theorem names rather than an ML expression;
|
wenzelm@6563
|
141 |
|
wenzelm@6795
|
142 |
* reset HOL_quantifiers by default, i.e. quantifiers are printed as
|
wenzelm@6795
|
143 |
ALL/EX rather than !/?;
|
wenzelm@6795
|
144 |
|
wenzelm@6269
|
145 |
|
paulson@7113
|
146 |
*** LK ***
|
paulson@7113
|
147 |
|
paulson@7113
|
148 |
* the notation <<...>> is now available as a notation for sequences of formulas
|
paulson@7113
|
149 |
|
paulson@7113
|
150 |
* the simplifier is now installed
|
paulson@7113
|
151 |
|
paulson@7113
|
152 |
* the axiom system has been generalized (thanks to Soren Heilmann)
|
paulson@7113
|
153 |
|
paulson@7113
|
154 |
* the classical reasoner now has a default rule database
|
paulson@7113
|
155 |
|
paulson@7113
|
156 |
|
paulson@6064
|
157 |
*** ZF ***
|
paulson@6064
|
158 |
|
paulson@6064
|
159 |
* new primrec section allows primitive recursive functions to be given
|
wenzelm@6269
|
160 |
directly (as in HOL) over datatypes and the natural numbers;
|
paulson@6064
|
161 |
|
wenzelm@6269
|
162 |
* new tactics induct_tac and exhaust_tac for induction (or case
|
wenzelm@6269
|
163 |
analysis) over datatypes and the natural numbers;
|
paulson@6064
|
164 |
|
paulson@6064
|
165 |
* the datatype declaration of type T now defines the recursor T_rec;
|
paulson@6064
|
166 |
|
paulson@6141
|
167 |
* simplification automatically does freeness reasoning for datatype
|
wenzelm@6269
|
168 |
constructors;
|
paulson@6141
|
169 |
|
wenzelm@6269
|
170 |
* automatic type-inference, with AddTCs command to insert new
|
wenzelm@6269
|
171 |
type-checking rules;
|
paulson@6155
|
172 |
|
wenzelm@6269
|
173 |
* datatype introduction rules are now added as Safe Introduction rules
|
wenzelm@6269
|
174 |
to the claset;
|
paulson@6155
|
175 |
|
wenzelm@6269
|
176 |
* the syntax "if P then x else y" is now available in addition to
|
wenzelm@6269
|
177 |
if(P,x,y);
|
wenzelm@6269
|
178 |
|
paulson@6069
|
179 |
|
wenzelm@6343
|
180 |
*** Internal programming interfaces ***
|
wenzelm@6343
|
181 |
|
wenzelm@6386
|
182 |
* AxClass.axclass_tac lost the theory argument;
|
wenzelm@6386
|
183 |
|
wenzelm@6343
|
184 |
* tuned current_goals_markers semantics: begin / end goal avoids
|
wenzelm@6343
|
185 |
printing empty lines;
|
wenzelm@6343
|
186 |
|
wenzelm@6343
|
187 |
* removed prs and prs_fn hook, which was broken because it did not
|
wenzelm@6343
|
188 |
include \n in its semantics, forcing writeln to add one
|
wenzelm@6343
|
189 |
uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
|
wenzelm@6343
|
190 |
string -> unit if you really want to output text without newline;
|
wenzelm@6343
|
191 |
|
wenzelm@6343
|
192 |
* Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
|
wenzelm@6343
|
193 |
plain output, interface builders may have to enable 'isabelle_font'
|
wenzelm@6343
|
194 |
mode to get Isabelle font glyphs as before;
|
wenzelm@6343
|
195 |
|
wenzelm@6343
|
196 |
* refined token_translation interface; INCOMPATIBILITY: output length
|
wenzelm@6343
|
197 |
now of type real instead of int;
|
wenzelm@6343
|
198 |
|
wenzelm@7196
|
199 |
* theory loader actions may be traced via new ThyInfo.add_hook
|
wenzelm@7196
|
200 |
interface (see src/Pure/Thy/thy_info.ML); example application: keep
|
wenzelm@7196
|
201 |
your own database of information attached to *whole* theories -- as
|
wenzelm@7196
|
202 |
opposed to intra-theory data slots offered via TheoryDataFun;
|
wenzelm@7196
|
203 |
|
wenzelm@6343
|
204 |
|
paulson@6064
|
205 |
|
wenzelm@5781
|
206 |
New in Isabelle98-1 (October 1998)
|
wenzelm@5781
|
207 |
----------------------------------
|
wenzelm@5781
|
208 |
|
wenzelm@5127
|
209 |
*** Overview of INCOMPATIBILITIES (see below for more details) ***
|
wenzelm@4842
|
210 |
|
wenzelm@5726
|
211 |
* several changes of automated proof tools;
|
wenzelm@5207
|
212 |
|
wenzelm@5726
|
213 |
* HOL: major changes to the inductive and datatype packages, including
|
wenzelm@5726
|
214 |
some minor incompatibilities of theory syntax;
|
wenzelm@5373
|
215 |
|
wenzelm@5726
|
216 |
* HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
|
wenzelm@5217
|
217 |
called `inj_on';
|
paulson@5160
|
218 |
|
nipkow@5275
|
219 |
* HOL: removed duplicate thms in Arith:
|
nipkow@5275
|
220 |
less_imp_add_less should be replaced by trans_less_add1
|
nipkow@5275
|
221 |
le_imp_add_le should be replaced by trans_le_add1
|
paulson@5160
|
222 |
|
wenzelm@5726
|
223 |
* HOL: unary minus is now overloaded (new type constraints may be
|
wenzelm@5726
|
224 |
required);
|
paulson@5490
|
225 |
|
wenzelm@5726
|
226 |
* HOL and ZF: unary minus for integers is now #- instead of #~. In
|
wenzelm@5726
|
227 |
ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
|
wenzelm@5726
|
228 |
now taken as an integer constant.
|
paulson@5541
|
229 |
|
wenzelm@5726
|
230 |
* Pure: ML function 'theory_of' renamed to 'theory';
|
wenzelm@5397
|
231 |
|
wenzelm@5363
|
232 |
|
wenzelm@5127
|
233 |
*** Proof tools ***
|
nipkow@4880
|
234 |
|
nipkow@5657
|
235 |
* Simplifier:
|
nipkow@5657
|
236 |
1. Asm_full_simp_tac is now more aggressive.
|
nipkow@5657
|
237 |
1. It will sometimes reorient premises if that increases their power to
|
nipkow@5657
|
238 |
simplify.
|
nipkow@5657
|
239 |
2. It does no longer proceed strictly from left to right but may also
|
nipkow@5657
|
240 |
rotate premises to achieve further simplification.
|
nipkow@5657
|
241 |
For compatibility reasons there is now Asm_lr_simp_tac which is like the
|
nipkow@5657
|
242 |
old Asm_full_simp_tac in that it does not rotate premises.
|
nipkow@5657
|
243 |
2. The simplifier now knows a little bit about nat-arithmetic.
|
nipkow@4880
|
244 |
|
wenzelm@5127
|
245 |
* Classical reasoner: wrapper mechanism for the classical reasoner now
|
wenzelm@5127
|
246 |
allows for selected deletion of wrappers, by introduction of names for
|
wenzelm@5127
|
247 |
wrapper functionals. This implies that addbefore, addSbefore,
|
wenzelm@5127
|
248 |
addaltern, and addSaltern now take a pair (name, tactic) as argument,
|
wenzelm@5127
|
249 |
and that adding two tactics with the same name overwrites the first
|
wenzelm@5127
|
250 |
one (emitting a warning).
|
oheimb@4824
|
251 |
type wrapper = (int -> tactic) -> (int -> tactic)
|
oheimb@4649
|
252 |
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
|
oheimb@4824
|
253 |
addWrapper, addSWrapper: claset * (string * wrapper) -> claset
|
oheimb@4824
|
254 |
delWrapper, delSWrapper: claset * string -> claset
|
oheimb@4649
|
255 |
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
|
oheimb@4649
|
256 |
|
wenzelm@5705
|
257 |
* Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
|
wenzelm@5726
|
258 |
semantics; addbefore now affects only the unsafe part of step_tac
|
wenzelm@5726
|
259 |
etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
|
wenzelm@5726
|
260 |
FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
|
wenzelm@5726
|
261 |
by Force_tac;
|
oheimb@5524
|
262 |
|
wenzelm@5726
|
263 |
* Classical reasoner: setwrapper to setWrapper and compwrapper to
|
wenzelm@5726
|
264 |
compWrapper; added safe wrapper (and access functions for it);
|
oheimb@5524
|
265 |
|
wenzelm@5127
|
266 |
* HOL/split_all_tac is now much faster and fails if there is nothing
|
wenzelm@5726
|
267 |
to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
|
wenzelm@5726
|
268 |
and the names of the automatically generated variables have changed.
|
wenzelm@5726
|
269 |
split_all_tac has moved within claset() from unsafe wrappers to safe
|
wenzelm@5726
|
270 |
wrappers, which means that !!-bound variables are split much more
|
wenzelm@5726
|
271 |
aggressively, and safe_tac and clarify_tac now split such variables.
|
wenzelm@5726
|
272 |
If this splitting is not appropriate, use delSWrapper "split_all_tac".
|
wenzelm@5726
|
273 |
Note: the same holds for record_split_tac, which does the job of
|
wenzelm@5726
|
274 |
split_all_tac for record fields.
|
wenzelm@5127
|
275 |
|
wenzelm@5726
|
276 |
* HOL/Simplifier: Rewrite rules for case distinctions can now be added
|
wenzelm@5726
|
277 |
permanently to the default simpset using Addsplits just like
|
wenzelm@5726
|
278 |
Addsimps. They can be removed via Delsplits just like
|
wenzelm@5726
|
279 |
Delsimps. Lower-case versions are also available.
|
wenzelm@5127
|
280 |
|
wenzelm@5726
|
281 |
* HOL/Simplifier: The rule split_if is now part of the default
|
wenzelm@5726
|
282 |
simpset. This means that the simplifier will eliminate all occurrences
|
wenzelm@5726
|
283 |
of if-then-else in the conclusion of a goal. To prevent this, you can
|
wenzelm@5726
|
284 |
either remove split_if completely from the default simpset by
|
wenzelm@5726
|
285 |
`Delsplits [split_if]' or remove it in a specific call of the
|
wenzelm@5726
|
286 |
simplifier using `... delsplits [split_if]'. You can also add/delete
|
wenzelm@5726
|
287 |
other case splitting rules to/from the default simpset: every datatype
|
wenzelm@5726
|
288 |
generates suitable rules `split_t_case' and `split_t_case_asm' (where
|
wenzelm@5726
|
289 |
t is the name of the datatype).
|
wenzelm@5127
|
290 |
|
wenzelm@5726
|
291 |
* Classical reasoner / Simplifier combination: new force_tac (and
|
wenzelm@5127
|
292 |
derivatives Force_tac, force) combines rewriting and classical
|
wenzelm@5127
|
293 |
reasoning (and whatever other tools) similarly to auto_tac, but is
|
wenzelm@5726
|
294 |
aimed to solve the given subgoal completely.
|
wenzelm@5127
|
295 |
|
wenzelm@5127
|
296 |
|
wenzelm@5127
|
297 |
*** General ***
|
wenzelm@5127
|
298 |
|
wenzelm@5217
|
299 |
* new top-level commands `Goal' and `Goalw' that improve upon `goal'
|
wenzelm@5127
|
300 |
and `goalw': the theory is no longer needed as an explicit argument -
|
wenzelm@5127
|
301 |
the current theory context is used; assumptions are no longer returned
|
wenzelm@5127
|
302 |
at the ML-level unless one of them starts with ==> or !!; it is
|
wenzelm@5217
|
303 |
recommended to convert to these new commands using isatool fixgoal
|
wenzelm@5217
|
304 |
(backup your sources first!);
|
wenzelm@4842
|
305 |
|
wenzelm@5217
|
306 |
* new top-level commands 'thm' and 'thms' for retrieving theorems from
|
wenzelm@5207
|
307 |
the current theory context, and 'theory' to lookup stored theories;
|
paulson@4806
|
308 |
|
paulson@5722
|
309 |
* new theory section 'locale' for declaring constants, assumptions and
|
paulson@5722
|
310 |
definitions that have local scope;
|
paulson@5722
|
311 |
|
wenzelm@5127
|
312 |
* new theory section 'nonterminals' for purely syntactic types;
|
wenzelm@4858
|
313 |
|
wenzelm@5127
|
314 |
* new theory section 'setup' for generic ML setup functions
|
wenzelm@5127
|
315 |
(e.g. package initialization);
|
wenzelm@4869
|
316 |
|
wenzelm@5131
|
317 |
* the distribution now includes Isabelle icons: see
|
wenzelm@5131
|
318 |
lib/logo/isabelle-{small,tiny}.xpm;
|
wenzelm@5131
|
319 |
|
wenzelm@5363
|
320 |
* isatool install - install binaries with absolute references to
|
wenzelm@5363
|
321 |
ISABELLE_HOME/bin;
|
wenzelm@5363
|
322 |
|
wenzelm@5572
|
323 |
* isatool logo -- create instances of the Isabelle logo (as EPS);
|
wenzelm@5572
|
324 |
|
wenzelm@5407
|
325 |
* print mode 'emacs' reserved for Isamode;
|
wenzelm@5407
|
326 |
|
wenzelm@5726
|
327 |
* support multiple print (ast) translations per constant name;
|
wenzelm@5726
|
328 |
|
wenzelm@6925
|
329 |
* theorems involving oracles are now printed with a suffixed [!];
|
wenzelm@6925
|
330 |
|
wenzelm@4711
|
331 |
|
paulson@4661
|
332 |
*** HOL ***
|
paulson@4661
|
333 |
|
wenzelm@5710
|
334 |
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
|
nipkow@5709
|
335 |
|
wenzelm@5217
|
336 |
* HOL/inductive package reorganized and improved: now supports mutual
|
paulson@5267
|
337 |
definitions such as
|
berghofe@5214
|
338 |
|
wenzelm@5217
|
339 |
inductive EVEN ODD
|
wenzelm@5217
|
340 |
intrs
|
wenzelm@5217
|
341 |
null "0 : EVEN"
|
wenzelm@5217
|
342 |
oddI "n : EVEN ==> Suc n : ODD"
|
wenzelm@5217
|
343 |
evenI "n : ODD ==> Suc n : EVEN"
|
berghofe@5214
|
344 |
|
wenzelm@5217
|
345 |
new theorem list "elims" contains an elimination rule for each of the
|
wenzelm@5217
|
346 |
recursive sets; inductive definitions now handle disjunctive premises
|
wenzelm@5217
|
347 |
correctly (also ZF);
|
berghofe@5214
|
348 |
|
wenzelm@5217
|
349 |
INCOMPATIBILITIES: requires Inductive as an ancestor; component
|
wenzelm@5217
|
350 |
"mutual_induct" no longer exists - the induction rule is always
|
wenzelm@5217
|
351 |
contained in "induct";
|
berghofe@5214
|
352 |
|
berghofe@5214
|
353 |
|
wenzelm@5217
|
354 |
* HOL/datatype package re-implemented and greatly improved: now
|
paulson@5267
|
355 |
supports mutually recursive datatypes such as
|
berghofe@5214
|
356 |
|
wenzelm@5217
|
357 |
datatype
|
wenzelm@5217
|
358 |
'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
|
wenzelm@5217
|
359 |
| SUM ('a aexp) ('a aexp)
|
wenzelm@5217
|
360 |
| DIFF ('a aexp) ('a aexp)
|
wenzelm@5217
|
361 |
| NUM 'a
|
wenzelm@5217
|
362 |
and
|
wenzelm@5217
|
363 |
'a bexp = LESS ('a aexp) ('a aexp)
|
wenzelm@5217
|
364 |
| AND ('a bexp) ('a bexp)
|
wenzelm@5217
|
365 |
| OR ('a bexp) ('a bexp)
|
wenzelm@5217
|
366 |
|
paulson@5267
|
367 |
as well as indirectly recursive datatypes such as
|
wenzelm@5217
|
368 |
|
wenzelm@5217
|
369 |
datatype
|
wenzelm@5217
|
370 |
('a, 'b) term = Var 'a
|
wenzelm@5217
|
371 |
| App 'b ((('a, 'b) term) list)
|
wenzelm@5217
|
372 |
|
wenzelm@5217
|
373 |
The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
|
wenzelm@5217
|
374 |
induction on mutually / indirectly recursive datatypes.
|
wenzelm@5217
|
375 |
|
wenzelm@5217
|
376 |
Primrec equations are now stored in theory and can be accessed via
|
wenzelm@5217
|
377 |
<function_name>.simps.
|
wenzelm@5217
|
378 |
|
wenzelm@5217
|
379 |
INCOMPATIBILITIES:
|
wenzelm@5217
|
380 |
|
wenzelm@5217
|
381 |
- Theories using datatypes must now have theory Datatype as an
|
wenzelm@5217
|
382 |
ancestor.
|
wenzelm@5217
|
383 |
- The specific <typename>.induct_tac no longer exists - use the
|
wenzelm@5217
|
384 |
generic induct_tac instead.
|
berghofe@5226
|
385 |
- natE has been renamed to nat.exhaust - use exhaust_tac
|
wenzelm@5217
|
386 |
instead of res_inst_tac ... natE. Note that the variable
|
berghofe@5226
|
387 |
names in nat.exhaust differ from the names in natE, this
|
wenzelm@5217
|
388 |
may cause some "fragile" proofs to fail.
|
wenzelm@5217
|
389 |
- The theorems split_<typename>_case and split_<typename>_case_asm
|
wenzelm@5217
|
390 |
have been renamed to <typename>.split and <typename>.split_asm.
|
wenzelm@5217
|
391 |
- Since default sorts of type variables are now handled correctly,
|
wenzelm@5217
|
392 |
some datatype definitions may have to be annotated with explicit
|
wenzelm@5217
|
393 |
sort constraints.
|
wenzelm@5217
|
394 |
- Primrec definitions no longer require function name and type
|
wenzelm@5217
|
395 |
of recursive argument.
|
wenzelm@5217
|
396 |
|
wenzelm@5217
|
397 |
Consider using isatool fixdatatype to adapt your theories and proof
|
wenzelm@5217
|
398 |
scripts to the new package (backup your sources first!).
|
wenzelm@5217
|
399 |
|
wenzelm@5217
|
400 |
|
wenzelm@5726
|
401 |
* HOL/record package: considerably improved implementation; now
|
wenzelm@5726
|
402 |
includes concrete syntax for record types, terms, updates; theorems
|
wenzelm@5726
|
403 |
for surjective pairing and splitting !!-bound record variables; proof
|
wenzelm@5726
|
404 |
support is as follows:
|
wenzelm@5726
|
405 |
|
wenzelm@5726
|
406 |
1) standard conversions (selectors or updates applied to record
|
wenzelm@5726
|
407 |
constructor terms) are part of the standard simpset;
|
wenzelm@5726
|
408 |
|
wenzelm@5726
|
409 |
2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
|
wenzelm@5726
|
410 |
made part of standard simpset and claset via addIffs;
|
wenzelm@5726
|
411 |
|
wenzelm@5726
|
412 |
3) a tactic for record field splitting (record_split_tac) is part of
|
wenzelm@5726
|
413 |
the standard claset (addSWrapper);
|
wenzelm@5726
|
414 |
|
wenzelm@5726
|
415 |
To get a better idea about these rules you may retrieve them via
|
wenzelm@5726
|
416 |
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
|
wenzelm@5726
|
417 |
the name of your record type.
|
wenzelm@5726
|
418 |
|
wenzelm@5726
|
419 |
The split tactic 3) conceptually simplifies by the following rule:
|
wenzelm@5726
|
420 |
|
wenzelm@5726
|
421 |
"(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
|
wenzelm@5726
|
422 |
|
wenzelm@5726
|
423 |
Thus any record variable that is bound by meta-all will automatically
|
wenzelm@5726
|
424 |
blow up into some record constructor term, consequently the
|
wenzelm@5726
|
425 |
simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
|
wenzelm@5726
|
426 |
solve record problems automatically.
|
wenzelm@5726
|
427 |
|
berghofe@5214
|
428 |
|
wenzelm@5125
|
429 |
* reorganized the main HOL image: HOL/Integ and String loaded by
|
wenzelm@5125
|
430 |
default; theory Main includes everything;
|
wenzelm@5125
|
431 |
|
paulson@5650
|
432 |
* automatic simplification of integer sums and comparisons, using cancellation;
|
paulson@5650
|
433 |
|
oheimb@5526
|
434 |
* added option_map_eq_Some and not_Some_eq to the default simpset and claset;
|
wenzelm@5125
|
435 |
|
wenzelm@5127
|
436 |
* added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
|
wenzelm@5125
|
437 |
|
wenzelm@5127
|
438 |
* many new identities for unions, intersections, set difference, etc.;
|
wenzelm@5127
|
439 |
|
wenzelm@5127
|
440 |
* expand_if, expand_split, expand_sum_case and expand_nat_case are now
|
wenzelm@5127
|
441 |
called split_if, split_split, split_sum_case and split_nat_case (to go
|
wenzelm@5127
|
442 |
with add/delsplits);
|
wenzelm@5127
|
443 |
|
wenzelm@5127
|
444 |
* HOL/Prod introduces simplification procedure unit_eq_proc rewriting
|
wenzelm@5127
|
445 |
(?x::unit) = (); this is made part of the default simpset, which COULD
|
wenzelm@5127
|
446 |
MAKE EXISTING PROOFS FAIL under rare circumstances (consider
|
wenzelm@5207
|
447 |
'Delsimprocs [unit_eq_proc];' as last resort); also note that
|
wenzelm@5207
|
448 |
unit_abs_eta_conv is added in order to counter the effect of
|
wenzelm@5207
|
449 |
unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
|
wenzelm@5207
|
450 |
%u.f();
|
wenzelm@5127
|
451 |
|
wenzelm@5217
|
452 |
* HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
|
wenzelm@5217
|
453 |
makes more sense);
|
wenzelm@5127
|
454 |
|
paulson@5475
|
455 |
* HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
|
paulson@5475
|
456 |
It and 'sym RS equals0D' are now in the default claset, giving automatic
|
paulson@5475
|
457 |
disjointness reasoning but breaking a few old proofs.
|
paulson@5267
|
458 |
|
wenzelm@5217
|
459 |
* HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
|
wenzelm@5217
|
460 |
to 'converse' from 'inverse' (for compatibility with ZF and some
|
wenzelm@5217
|
461 |
literature);
|
berghofe@5109
|
462 |
|
wenzelm@5127
|
463 |
* HOL/recdef can now declare non-recursive functions, with {} supplied as
|
wenzelm@5127
|
464 |
the well-founded relation;
|
wenzelm@5085
|
465 |
|
paulson@5490
|
466 |
* HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
|
paulson@5490
|
467 |
Compl A. The "Compl" syntax remains available as input syntax for this
|
paulson@5490
|
468 |
release ONLY.
|
paulson@5490
|
469 |
|
wenzelm@5127
|
470 |
* HOL/Update: new theory of function updates:
|
wenzelm@5127
|
471 |
f(a:=b) == %x. if x=a then b else f x
|
wenzelm@5127
|
472 |
may also be iterated as in f(a:=b,c:=d,...);
|
oheimb@4824
|
473 |
|
wenzelm@5127
|
474 |
* HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
|
paulson@4899
|
475 |
|
nipkow@5282
|
476 |
* HOL/List:
|
nipkow@5282
|
477 |
- new function list_update written xs[i:=v] that updates the i-th
|
nipkow@5282
|
478 |
list position. May also be iterated as in xs[i:=a,j:=b,...].
|
nipkow@5428
|
479 |
- new function `upt' written [i..j(] which generates the list
|
nipkow@5428
|
480 |
[i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
|
nipkow@5428
|
481 |
bound write [i..j], which is a shorthand for [i..j+1(].
|
nipkow@5282
|
482 |
- new lexicographic orderings and corresponding wellfoundedness theorems.
|
paulson@4779
|
483 |
|
wenzelm@5127
|
484 |
* HOL/Arith:
|
wenzelm@5127
|
485 |
- removed 'pred' (predecessor) function;
|
wenzelm@5127
|
486 |
- generalized some theorems about n-1;
|
wenzelm@5127
|
487 |
- many new laws about "div" and "mod";
|
wenzelm@5127
|
488 |
- new laws about greatest common divisors (see theory ex/Primes);
|
oheimb@4766
|
489 |
|
wenzelm@5127
|
490 |
* HOL/Relation: renamed the relational operator r^-1 "converse"
|
wenzelm@4842
|
491 |
instead of "inverse";
|
wenzelm@4711
|
492 |
|
nipkow@5651
|
493 |
* HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
|
nipkow@5651
|
494 |
of the multiset ordering;
|
nipkow@5651
|
495 |
|
wenzelm@5127
|
496 |
* directory HOL/Real: a construction of the reals using Dedekind cuts
|
nipkow@5651
|
497 |
(not included by default);
|
paulson@4806
|
498 |
|
wenzelm@5127
|
499 |
* directory HOL/UNITY: Chandy and Misra's UNITY formalism;
|
wenzelm@4711
|
500 |
|
nipkow@5651
|
501 |
* directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
|
nipkow@5651
|
502 |
programs, i.e. different program variables may have different types.
|
nipkow@5651
|
503 |
|
paulson@5142
|
504 |
* calling (stac rew i) now fails if "rew" has no effect on the goal
|
paulson@5142
|
505 |
[previously, this check worked only if the rewrite rule was unconditional]
|
paulson@5308
|
506 |
Now rew can involve either definitions or equalities (either == or =).
|
wenzelm@5002
|
507 |
|
wenzelm@5363
|
508 |
|
paulson@4879
|
509 |
*** ZF ***
|
paulson@4879
|
510 |
|
paulson@5332
|
511 |
* theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
|
paulson@5332
|
512 |
only the theorems proved on ZF.ML;
|
paulson@5160
|
513 |
|
paulson@5475
|
514 |
* ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
|
paulson@5475
|
515 |
It and 'sym RS equals0D' are now in the default claset, giving automatic
|
paulson@5475
|
516 |
disjointness reasoning but breaking a few old proofs.
|
paulson@5267
|
517 |
|
paulson@5160
|
518 |
* ZF/Update: new theory of function updates
|
paulson@5160
|
519 |
with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
|
paulson@5160
|
520 |
may also be iterated as in f(a:=b,c:=d,...);
|
paulson@5160
|
521 |
|
paulson@4879
|
522 |
* in let x=t in u(x), neither t nor u(x) has to be an FOL term.
|
oheimb@4649
|
523 |
|
paulson@5142
|
524 |
* calling (stac rew i) now fails if "rew" has no effect on the goal
|
paulson@5142
|
525 |
[previously, this check worked only if the rewrite rule was unconditional]
|
paulson@5308
|
526 |
Now rew can involve either definitions or equalities (either == or =).
|
paulson@5142
|
527 |
|
paulson@5160
|
528 |
* case_tac provided for compatibility with HOL
|
paulson@5160
|
529 |
(like the old excluded_middle_tac, but with subgoals swapped)
|
paulson@5160
|
530 |
|
wenzelm@4842
|
531 |
|
wenzelm@5127
|
532 |
*** Internal programming interfaces ***
|
wenzelm@5002
|
533 |
|
wenzelm@5251
|
534 |
* Pure: several new basic modules made available for general use, see
|
wenzelm@5251
|
535 |
also src/Pure/README;
|
wenzelm@5207
|
536 |
|
wenzelm@5008
|
537 |
* improved the theory data mechanism to support encapsulation (data
|
wenzelm@5008
|
538 |
kind name replaced by private Object.kind, acting as authorization
|
wenzelm@5373
|
539 |
key); new type-safe user interface via functor TheoryDataFun; generic
|
wenzelm@5373
|
540 |
print_data function becomes basically useless;
|
wenzelm@5002
|
541 |
|
wenzelm@5251
|
542 |
* removed global_names compatibility flag -- all theory declarations
|
wenzelm@5251
|
543 |
are qualified by default;
|
wenzelm@5251
|
544 |
|
wenzelm@5085
|
545 |
* module Pure/Syntax now offers quote / antiquote translation
|
wenzelm@5085
|
546 |
functions (useful for Hoare logic etc. with implicit dependencies);
|
wenzelm@5373
|
547 |
see HOL/ex/Antiquote for an example use;
|
wenzelm@5085
|
548 |
|
wenzelm@5127
|
549 |
* Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
|
wenzelm@5127
|
550 |
cterm -> thm;
|
wenzelm@5127
|
551 |
|
wenzelm@5207
|
552 |
* new tactical CHANGED_GOAL for checking that a tactic modifies a
|
wenzelm@5207
|
553 |
subgoal;
|
paulson@5142
|
554 |
|
wenzelm@5251
|
555 |
* Display.print_goals function moved to Locale.print_goals;
|
wenzelm@5251
|
556 |
|
wenzelm@5731
|
557 |
* standard print function for goals supports current_goals_markers
|
wenzelm@5731
|
558 |
variable for marking begin of proof, end of proof, start of goal; the
|
wenzelm@5731
|
559 |
default is ("", "", ""); setting current_goals_markers := ("<proof>",
|
wenzelm@5731
|
560 |
"</proof>", "<goal>") causes SGML like tagged proof state printing,
|
wenzelm@5731
|
561 |
for example;
|
wenzelm@5731
|
562 |
|
wenzelm@5002
|
563 |
|
wenzelm@5002
|
564 |
|
wenzelm@4410
|
565 |
New in Isabelle98 (January 1998)
|
wenzelm@4410
|
566 |
--------------------------------
|
wenzelm@4410
|
567 |
|
wenzelm@4410
|
568 |
*** Overview of INCOMPATIBILITIES (see below for more details) ***
|
wenzelm@4410
|
569 |
|
wenzelm@4410
|
570 |
* changed lexical syntax of terms / types: dots made part of long
|
wenzelm@4410
|
571 |
identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
|
wenzelm@4410
|
572 |
|
wenzelm@4410
|
573 |
* simpset (and claset) reference variable replaced by functions
|
wenzelm@4410
|
574 |
simpset / simpset_ref;
|
wenzelm@4410
|
575 |
|
wenzelm@4410
|
576 |
* no longer supports theory aliases (via merge) and non-trivial
|
wenzelm@4410
|
577 |
implicit merge of thms' signatures;
|
wenzelm@4410
|
578 |
|
wenzelm@4410
|
579 |
* most internal names of constants changed due to qualified names;
|
wenzelm@4410
|
580 |
|
wenzelm@4410
|
581 |
* changed Pure/Sequence interface (see Pure/seq.ML);
|
wenzelm@4410
|
582 |
|
wenzelm@3454
|
583 |
|
paulson@3715
|
584 |
*** General Changes ***
|
wenzelm@3697
|
585 |
|
wenzelm@4174
|
586 |
* hierachically structured name spaces (for consts, types, axms, thms
|
wenzelm@3943
|
587 |
etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
|
wenzelm@4108
|
588 |
old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
|
wenzelm@4108
|
589 |
isatool fixdots ensures space after dots (e.g. "%x. x"); set
|
wenzelm@4174
|
590 |
long_names for fully qualified output names; NOTE: ML programs
|
wenzelm@4174
|
591 |
(special tactics, packages etc.) referring to internal names may have
|
wenzelm@4174
|
592 |
to be adapted to cope with fully qualified names; in case of severe
|
wenzelm@4174
|
593 |
backward campatibility problems try setting 'global_names' at compile
|
wenzelm@4174
|
594 |
time to have enrything declared within a flat name space; one may also
|
wenzelm@4174
|
595 |
fine tune name declarations in theories via the 'global' and 'local'
|
wenzelm@4174
|
596 |
section;
|
wenzelm@4108
|
597 |
|
wenzelm@4108
|
598 |
* reimplemented the implicit simpset and claset using the new anytype
|
wenzelm@4108
|
599 |
data filed in signatures; references simpset:simpset ref etc. are
|
wenzelm@4108
|
600 |
replaced by functions simpset:unit->simpset and
|
wenzelm@4108
|
601 |
simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
|
wenzelm@4108
|
602 |
to patch your ML files accordingly;
|
paulson@3856
|
603 |
|
wenzelm@3857
|
604 |
* HTML output now includes theory graph data for display with Java
|
wenzelm@3857
|
605 |
applet or isatool browser; data generated automatically via isatool
|
wenzelm@3901
|
606 |
usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
|
wenzelm@3857
|
607 |
|
paulson@3856
|
608 |
* defs may now be conditional; improved rewrite_goals_tac to handle
|
paulson@3856
|
609 |
conditional equations;
|
paulson@3856
|
610 |
|
wenzelm@4174
|
611 |
* defs now admits additional type arguments, using TYPE('a) syntax;
|
wenzelm@4174
|
612 |
|
wenzelm@3901
|
613 |
* theory aliases via merge (e.g. M=A+B+C) no longer supported, always
|
wenzelm@3901
|
614 |
creates a new theory node; implicit merge of thms' signatures is
|
wenzelm@4112
|
615 |
restricted to 'trivial' ones; COMPATIBILITY: one may have to use
|
wenzelm@3901
|
616 |
transfer:theory->thm->thm in (rare) cases;
|
wenzelm@3901
|
617 |
|
wenzelm@3968
|
618 |
* improved handling of draft signatures / theories; draft thms (and
|
wenzelm@3968
|
619 |
ctyps, cterms) are automatically promoted to real ones;
|
wenzelm@3968
|
620 |
|
wenzelm@3901
|
621 |
* slightly changed interfaces for oracles: admit many per theory, named
|
wenzelm@3901
|
622 |
(e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
|
wenzelm@3901
|
623 |
|
wenzelm@3901
|
624 |
* print_goals: optional output of const types (set show_consts and
|
wenzelm@3901
|
625 |
show_types);
|
wenzelm@3851
|
626 |
|
wenzelm@4388
|
627 |
* improved output of warnings (###) and errors (***);
|
wenzelm@3697
|
628 |
|
paulson@4178
|
629 |
* subgoal_tac displays a warning if the new subgoal has type variables;
|
paulson@4178
|
630 |
|
paulson@3715
|
631 |
* removed old README and Makefiles;
|
paulson@3715
|
632 |
|
paulson@3856
|
633 |
* replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
|
wenzelm@3670
|
634 |
|
paulson@3715
|
635 |
* removed obsolete init_pps and init_database;
|
paulson@3715
|
636 |
|
paulson@3715
|
637 |
* deleted the obsolete tactical STATE, which was declared by
|
paulson@3715
|
638 |
fun STATE tacfun st = tacfun st st;
|
paulson@3715
|
639 |
|
wenzelm@4388
|
640 |
* cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
|
wenzelm@4388
|
641 |
(which abbreviates $HOME);
|
wenzelm@4269
|
642 |
|
wenzelm@4269
|
643 |
* changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
|
wenzelm@4269
|
644 |
use isatool fixseq to adapt your ML programs (this works for fully
|
wenzelm@4269
|
645 |
qualified references to the Sequence structure only!);
|
wenzelm@4269
|
646 |
|
wenzelm@4381
|
647 |
* use_thy no longer requires writable current directory; it always
|
wenzelm@4381
|
648 |
reloads .ML *and* .thy file, if either one is out of date;
|
wenzelm@4269
|
649 |
|
paulson@3715
|
650 |
|
paulson@3715
|
651 |
*** Classical Reasoner ***
|
paulson@3715
|
652 |
|
wenzelm@3744
|
653 |
* Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
|
wenzelm@3744
|
654 |
tactics that use classical reasoning to simplify a subgoal without
|
wenzelm@3744
|
655 |
splitting it into several subgoals;
|
paulson@3715
|
656 |
|
paulson@3719
|
657 |
* Safe_tac: like safe_tac but uses the default claset;
|
paulson@3719
|
658 |
|
paulson@3715
|
659 |
|
paulson@3715
|
660 |
*** Simplifier ***
|
paulson@3715
|
661 |
|
paulson@3715
|
662 |
* added simplification meta rules:
|
paulson@3715
|
663 |
(asm_)(full_)simplify: simpset -> thm -> thm;
|
paulson@3715
|
664 |
|
paulson@3715
|
665 |
* simplifier.ML no longer part of Pure -- has to be loaded by object
|
paulson@3715
|
666 |
logics (again);
|
paulson@3715
|
667 |
|
paulson@3715
|
668 |
* added prems argument to simplification procedures;
|
paulson@3715
|
669 |
|
paulson@4325
|
670 |
* HOL, FOL, ZF: added infix function `addsplits':
|
paulson@4325
|
671 |
instead of `<simpset> setloop (split_tac <thms>)'
|
paulson@4325
|
672 |
you can simply write `<simpset> addsplits <thms>'
|
paulson@4325
|
673 |
|
paulson@3715
|
674 |
|
paulson@3715
|
675 |
*** Syntax ***
|
paulson@3715
|
676 |
|
wenzelm@4174
|
677 |
* TYPE('a) syntax for type reflection terms;
|
wenzelm@4174
|
678 |
|
wenzelm@3985
|
679 |
* no longer handles consts with name "" -- declare as 'syntax' instead;
|
paulson@3856
|
680 |
|
paulson@3856
|
681 |
* pretty printer: changed order of mixfix annotation preference (again!);
|
wenzelm@3846
|
682 |
|
paulson@3715
|
683 |
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
|
paulson@3715
|
684 |
|
paulson@3715
|
685 |
|
paulson@3715
|
686 |
*** HOL ***
|
paulson@3715
|
687 |
|
wenzelm@5726
|
688 |
* HOL: there is a new splitter `split_asm_tac' that can be used e.g.
|
oheimb@4189
|
689 |
with `addloop' of the simplifier to faciliate case splitting in premises.
|
oheimb@4189
|
690 |
|
nipkow@4035
|
691 |
* HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
|
wenzelm@3985
|
692 |
|
wenzelm@3985
|
693 |
* HOL/Auth: new protocol proofs including some for the Internet
|
nipkow@4035
|
694 |
protocol TLS;
|
wenzelm@3985
|
695 |
|
wenzelm@4125
|
696 |
* HOL/Map: new theory of `maps' a la VDM;
|
nipkow@3982
|
697 |
|
wenzelm@4335
|
698 |
* HOL/simplifier: simplification procedures nat_cancel_sums for
|
wenzelm@4335
|
699 |
cancelling out common nat summands from =, <, <= (in)equalities, or
|
wenzelm@4335
|
700 |
differences; simplification procedures nat_cancel_factor for
|
wenzelm@4335
|
701 |
cancelling common factor from =, <, <= (in)equalities over natural
|
wenzelm@4373
|
702 |
sums; nat_cancel contains both kinds of procedures, it is installed by
|
wenzelm@4373
|
703 |
default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
|
wenzelm@4335
|
704 |
|
nipkow@3580
|
705 |
* HOL/simplifier: terms of the form
|
paulson@4325
|
706 |
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
|
nipkow@3580
|
707 |
are rewritten to
|
nipkow@4035
|
708 |
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
|
nipkow@4035
|
709 |
and those of the form
|
paulson@4325
|
710 |
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
|
nipkow@4035
|
711 |
are rewritten to
|
nipkow@4035
|
712 |
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
|
nipkow@3580
|
713 |
|
nipkow@4035
|
714 |
* HOL/datatype
|
nipkow@4035
|
715 |
Each datatype `t' now comes with a theorem `split_t_case' of the form
|
nipkow@4035
|
716 |
|
nipkow@4035
|
717 |
P(t_case f1 ... fn x) =
|
nipkow@4035
|
718 |
( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
|
nipkow@4035
|
719 |
...
|
oheimb@4189
|
720 |
(!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
|
nipkow@4035
|
721 |
)
|
nipkow@4035
|
722 |
|
oheimb@4930
|
723 |
and a theorem `split_t_case_asm' of the form
|
oheimb@4189
|
724 |
|
oheimb@4189
|
725 |
P(t_case f1 ... fn x) =
|
oheimb@4189
|
726 |
~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
|
oheimb@4189
|
727 |
...
|
oheimb@4189
|
728 |
(? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
|
oheimb@4189
|
729 |
)
|
oheimb@4930
|
730 |
which can be added to a simpset via `addsplits'. The existing theorems
|
oheimb@4930
|
731 |
expand_list_case and expand_option_case have been renamed to
|
oheimb@4930
|
732 |
split_list_case and split_option_case.
|
oheimb@4189
|
733 |
|
nipkow@4361
|
734 |
* HOL/Arithmetic:
|
nipkow@4361
|
735 |
- `pred n' is automatically converted to `n-1'.
|
nipkow@4361
|
736 |
Users are strongly encouraged not to use `pred' any longer,
|
nipkow@4361
|
737 |
because it will disappear altogether at some point.
|
nipkow@4361
|
738 |
- Users are strongly encouraged to write "0 < n" rather than
|
nipkow@4361
|
739 |
"n ~= 0". Theorems and proof tools have been modified towards this
|
nipkow@4361
|
740 |
`standard'.
|
nipkow@4357
|
741 |
|
nipkow@4502
|
742 |
* HOL/Lists:
|
nipkow@4502
|
743 |
the function "set_of_list" has been renamed "set" (and its theorems too);
|
nipkow@4502
|
744 |
the function "nth" now takes its arguments in the reverse order and
|
nipkow@4502
|
745 |
has acquired the infix notation "!" as in "xs!n".
|
paulson@3570
|
746 |
|
paulson@4154
|
747 |
* HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
|
paulson@4154
|
748 |
|
paulson@4154
|
749 |
* HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
|
paulson@4154
|
750 |
specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
|
paulson@4154
|
751 |
|
wenzelm@4575
|
752 |
* HOL/record: extensible records with schematic structural subtyping
|
wenzelm@4575
|
753 |
(single inheritance); EXPERIMENTAL version demonstrating the encoding,
|
wenzelm@4575
|
754 |
still lacks various theorems and concrete record syntax;
|
wenzelm@4575
|
755 |
|
wenzelm@4125
|
756 |
|
paulson@3715
|
757 |
*** HOLCF ***
|
wenzelm@3511
|
758 |
|
wenzelm@4125
|
759 |
* removed "axioms" and "generated by" sections;
|
wenzelm@4125
|
760 |
|
oheimb@4123
|
761 |
* replaced "ops" section by extended "consts" section, which is capable of
|
wenzelm@4125
|
762 |
handling the continuous function space "->" directly;
|
wenzelm@4125
|
763 |
|
wenzelm@4125
|
764 |
* domain package:
|
wenzelm@4125
|
765 |
. proves theorems immediately and stores them in the theory,
|
wenzelm@4125
|
766 |
. creates hierachical name space,
|
wenzelm@4125
|
767 |
. now uses normal mixfix annotations (instead of cinfix...),
|
wenzelm@4125
|
768 |
. minor changes to some names and values (for consistency),
|
wenzelm@4125
|
769 |
. e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
|
wenzelm@4125
|
770 |
. separator between mutual domain defs: changed "," to "and",
|
wenzelm@4125
|
771 |
. improved handling of sort constraints; now they have to
|
wenzelm@4125
|
772 |
appear on the left-hand side of the equations only;
|
oheimb@4123
|
773 |
|
oheimb@4123
|
774 |
* fixed LAM <x,y,zs>.b syntax;
|
wenzelm@3535
|
775 |
|
wenzelm@3744
|
776 |
* added extended adm_tac to simplifier in HOLCF -- can now discharge
|
wenzelm@3744
|
777 |
adm (%x. P (t x)), where P is chainfinite and t continuous;
|
wenzelm@3579
|
778 |
|
wenzelm@3579
|
779 |
|
paulson@3719
|
780 |
*** FOL and ZF ***
|
paulson@3719
|
781 |
|
wenzelm@5726
|
782 |
* FOL: there is a new splitter `split_asm_tac' that can be used e.g.
|
oheimb@4189
|
783 |
with `addloop' of the simplifier to faciliate case splitting in premises.
|
oheimb@4189
|
784 |
|
wenzelm@3744
|
785 |
* qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
|
wenzelm@3744
|
786 |
in HOL, they strip ALL and --> from proved theorems;
|
wenzelm@3744
|
787 |
|
paulson@3719
|
788 |
|
wenzelm@3579
|
789 |
|
wenzelm@3006
|
790 |
New in Isabelle94-8 (May 1997)
|
wenzelm@3006
|
791 |
------------------------------
|
wenzelm@2654
|
792 |
|
paulson@3002
|
793 |
*** General Changes ***
|
paulson@3002
|
794 |
|
paulson@3002
|
795 |
* new utilities to build / run / maintain Isabelle etc. (in parts
|
paulson@3002
|
796 |
still somewhat experimental); old Makefiles etc. still functional;
|
wenzelm@2971
|
797 |
|
wenzelm@3205
|
798 |
* new 'Isabelle System Manual';
|
wenzelm@3205
|
799 |
|
wenzelm@2825
|
800 |
* INSTALL text, together with ./configure and ./build scripts;
|
wenzelm@2773
|
801 |
|
wenzelm@3006
|
802 |
* reimplemented type inference for greater efficiency, better error
|
wenzelm@3006
|
803 |
messages and clean internal interface;
|
paulson@3002
|
804 |
|
paulson@3002
|
805 |
* prlim command for dealing with lots of subgoals (an easier way of
|
paulson@3002
|
806 |
setting goals_limit);
|
paulson@3002
|
807 |
|
wenzelm@3006
|
808 |
|
wenzelm@3006
|
809 |
*** Syntax ***
|
paulson@3002
|
810 |
|
wenzelm@3116
|
811 |
* supports alternative (named) syntax tables (parser and pretty
|
wenzelm@3116
|
812 |
printer); internal interface is provided by add_modesyntax(_i);
|
wenzelm@3116
|
813 |
|
paulson@3002
|
814 |
* Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
|
paulson@3002
|
815 |
be used in conjunction with the Isabelle symbol font; uses the
|
paulson@3002
|
816 |
"symbols" syntax table;
|
paulson@3002
|
817 |
|
wenzelm@2705
|
818 |
* added token_translation interface (may translate name tokens in
|
wenzelm@2756
|
819 |
arbitrary ways, dependent on their type (free, bound, tfree, ...) and
|
wenzelm@3116
|
820 |
the current print_mode); IMPORTANT: user print translation functions
|
wenzelm@3116
|
821 |
are responsible for marking newly introduced bounds
|
wenzelm@3116
|
822 |
(Syntax.mark_boundT);
|
wenzelm@2705
|
823 |
|
wenzelm@2730
|
824 |
* token translations for modes "xterm" and "xterm_color" that display
|
wenzelm@3006
|
825 |
names in bold, underline etc. or colors (which requires a color
|
wenzelm@3006
|
826 |
version of xterm);
|
wenzelm@2730
|
827 |
|
paulson@3002
|
828 |
* infixes may now be declared with names independent of their syntax;
|
paulson@3002
|
829 |
|
paulson@3002
|
830 |
* added typed_print_translation (like print_translation, but may
|
paulson@3002
|
831 |
access type of constant);
|
paulson@3002
|
832 |
|
wenzelm@3006
|
833 |
|
paulson@3002
|
834 |
*** Classical Reasoner ***
|
paulson@3002
|
835 |
|
paulson@3002
|
836 |
Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
|
paulson@3002
|
837 |
some limitations. Blast_tac...
|
paulson@3002
|
838 |
+ ignores addss, addbefore, addafter; this restriction is intrinsic
|
paulson@3002
|
839 |
+ ignores elimination rules that don't have the correct format
|
wenzelm@5726
|
840 |
(the conclusion MUST be a formula variable)
|
paulson@3002
|
841 |
+ ignores types, which can make HOL proofs fail
|
paulson@3002
|
842 |
+ rules must not require higher-order unification, e.g. apply_type in ZF
|
paulson@3002
|
843 |
[message "Function Var's argument not a bound variable" relates to this]
|
paulson@3002
|
844 |
+ its proof strategy is more general but can actually be slower
|
paulson@3002
|
845 |
|
wenzelm@3107
|
846 |
* substitution with equality assumptions no longer permutes other
|
wenzelm@3107
|
847 |
assumptions;
|
paulson@3002
|
848 |
|
paulson@3002
|
849 |
* minor changes in semantics of addafter (now called addaltern); renamed
|
paulson@3002
|
850 |
setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
|
wenzelm@3107
|
851 |
(and access functions for it);
|
paulson@3002
|
852 |
|
wenzelm@5726
|
853 |
* improved combination of classical reasoner and simplifier:
|
oheimb@3317
|
854 |
+ functions for handling clasimpsets
|
oheimb@3317
|
855 |
+ improvement of addss: now the simplifier is called _after_ the
|
oheimb@3317
|
856 |
safe steps.
|
oheimb@3317
|
857 |
+ safe variant of addss called addSss: uses safe simplifications
|
wenzelm@5726
|
858 |
_during_ the safe steps. It is more complete as it allows multiple
|
oheimb@3317
|
859 |
instantiations of unknowns (e.g. with slow_tac).
|
wenzelm@3006
|
860 |
|
paulson@3002
|
861 |
*** Simplifier ***
|
paulson@3002
|
862 |
|
wenzelm@3006
|
863 |
* added interface for simplification procedures (functions that
|
wenzelm@3006
|
864 |
produce *proven* rewrite rules on the fly, depending on current
|
wenzelm@3006
|
865 |
redex);
|
wenzelm@3006
|
866 |
|
wenzelm@3006
|
867 |
* ordering on terms as parameter (used for ordered rewriting);
|
wenzelm@3006
|
868 |
|
wenzelm@3107
|
869 |
* new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
|
paulson@3002
|
870 |
|
paulson@3002
|
871 |
* the solver is now split into a safe and an unsafe part.
|
paulson@3002
|
872 |
This should be invisible for the normal user, except that the
|
paulson@3002
|
873 |
functions setsolver and addsolver have been renamed to setSolver and
|
wenzelm@3107
|
874 |
addSolver; added safe_asm_full_simp_tac;
|
paulson@3002
|
875 |
|
paulson@3002
|
876 |
|
paulson@3002
|
877 |
*** HOL ***
|
paulson@3002
|
878 |
|
nipkow@3042
|
879 |
* a generic induction tactic `induct_tac' which works for all datatypes and
|
wenzelm@3107
|
880 |
also for type `nat';
|
nipkow@3042
|
881 |
|
nipkow@3316
|
882 |
* a generic case distinction tactic `exhaust_tac' which works for all
|
nipkow@3316
|
883 |
datatypes and also for type `nat';
|
nipkow@3316
|
884 |
|
nipkow@3316
|
885 |
* each datatype comes with a function `size';
|
nipkow@3316
|
886 |
|
paulson@3002
|
887 |
* patterns in case expressions allow tuple patterns as arguments to
|
wenzelm@3107
|
888 |
constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
|
paulson@3002
|
889 |
|
paulson@3002
|
890 |
* primrec now also works with type nat;
|
paulson@3002
|
891 |
|
paulson@3338
|
892 |
* recdef: a new declaration form, allows general recursive functions to be
|
paulson@3338
|
893 |
defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
|
paulson@3338
|
894 |
|
paulson@3002
|
895 |
* the constant for negation has been renamed from "not" to "Not" to
|
wenzelm@3107
|
896 |
harmonize with FOL, ZF, LK, etc.;
|
paulson@3002
|
897 |
|
wenzelm@3107
|
898 |
* HOL/ex/LFilter theory of a corecursive "filter" functional for
|
wenzelm@3107
|
899 |
infinite lists;
|
paulson@3002
|
900 |
|
wenzelm@3227
|
901 |
* HOL/Modelcheck demonstrates invocation of model checker oracle;
|
wenzelm@3227
|
902 |
|
paulson@3002
|
903 |
* HOL/ex/Ring.thy declares cring_simp, which solves equational
|
paulson@3002
|
904 |
problems in commutative rings, using axiomatic type classes for + and *;
|
paulson@3002
|
905 |
|
paulson@3002
|
906 |
* more examples in HOL/MiniML and HOL/Auth;
|
paulson@3002
|
907 |
|
paulson@3002
|
908 |
* more default rewrite rules for quantifiers, union/intersection;
|
paulson@3002
|
909 |
|
nipkow@3321
|
910 |
* a new constant `arbitrary == @x.False';
|
nipkow@3321
|
911 |
|
wenzelm@3107
|
912 |
* HOLCF/IOA replaces old HOL/IOA;
|
wenzelm@3107
|
913 |
|
wenzelm@5726
|
914 |
* HOLCF changes: derived all rules and arities
|
wenzelm@5726
|
915 |
+ axiomatic type classes instead of classes
|
slotosch@2653
|
916 |
+ typedef instead of faking type definitions
|
paulson@2747
|
917 |
+ eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
|
wenzelm@2730
|
918 |
+ new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
|
slotosch@2653
|
919 |
+ eliminated the types void, one, tr
|
slotosch@2653
|
920 |
+ use unit lift and bool lift (with translations) instead of one and tr
|
slotosch@2653
|
921 |
+ eliminated blift from Lift3.thy (use Def instead of blift)
|
wenzelm@3107
|
922 |
all eliminated rules are derived as theorems --> no visible changes ;
|
oheimb@2649
|
923 |
|
wenzelm@3006
|
924 |
|
paulson@3002
|
925 |
*** ZF ***
|
wenzelm@2553
|
926 |
|
paulson@2865
|
927 |
* ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
|
paulson@2865
|
928 |
rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
|
paulson@2865
|
929 |
as ZF_cs addSIs [equalityI];
|
wenzelm@2553
|
930 |
|
wenzelm@2554
|
931 |
|
wenzelm@2732
|
932 |
|
wenzelm@2553
|
933 |
New in Isabelle94-7 (November 96)
|
wenzelm@2553
|
934 |
---------------------------------
|
wenzelm@2553
|
935 |
|
wenzelm@2553
|
936 |
* allowing negative levels (as offsets) in prlev and choplev;
|
wenzelm@2553
|
937 |
|
wenzelm@2554
|
938 |
* super-linear speedup for large simplifications;
|
wenzelm@2554
|
939 |
|
wenzelm@2554
|
940 |
* FOL, ZF and HOL now use miniscoping: rewriting pushes
|
wenzelm@2554
|
941 |
quantifications in as far as possible (COULD MAKE EXISTING PROOFS
|
wenzelm@2554
|
942 |
FAIL); can suppress it using the command Delsimps (ex_simps @
|
wenzelm@2554
|
943 |
all_simps); De Morgan laws are also now included, by default;
|
wenzelm@2554
|
944 |
|
wenzelm@2554
|
945 |
* improved printing of ==> : ~:
|
wenzelm@2554
|
946 |
|
wenzelm@2554
|
947 |
* new object-logic "Sequents" adds linear logic, while replacing LK
|
wenzelm@2554
|
948 |
and Modal (thanks to Sara Kalvala);
|
wenzelm@2554
|
949 |
|
wenzelm@2554
|
950 |
* HOL/Auth: correctness proofs for authentication protocols;
|
wenzelm@2554
|
951 |
|
wenzelm@2554
|
952 |
* HOL: new auto_tac combines rewriting and classical reasoning (many
|
wenzelm@2554
|
953 |
examples on HOL/Auth);
|
wenzelm@2554
|
954 |
|
wenzelm@2554
|
955 |
* HOL: new command AddIffs for declaring theorems of the form P=Q to
|
wenzelm@2554
|
956 |
the rewriter and classical reasoner simultaneously;
|
wenzelm@2554
|
957 |
|
wenzelm@2554
|
958 |
* function uresult no longer returns theorems in "standard" format;
|
wenzelm@2554
|
959 |
regain previous version by: val uresult = standard o uresult;
|
wenzelm@2554
|
960 |
|
wenzelm@2554
|
961 |
|
wenzelm@2554
|
962 |
|
wenzelm@2554
|
963 |
New in Isabelle94-6
|
wenzelm@2554
|
964 |
-------------------
|
wenzelm@2554
|
965 |
|
wenzelm@2554
|
966 |
* oracles -- these establish an interface between Isabelle and trusted
|
wenzelm@2554
|
967 |
external reasoners, which may deliver results as theorems;
|
wenzelm@2554
|
968 |
|
wenzelm@2554
|
969 |
* proof objects (in particular record all uses of oracles);
|
wenzelm@2554
|
970 |
|
wenzelm@2554
|
971 |
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
|
wenzelm@2554
|
972 |
|
wenzelm@2554
|
973 |
* "constdefs" section in theory files;
|
wenzelm@2554
|
974 |
|
wenzelm@2554
|
975 |
* "primrec" section (HOL) no longer requires names;
|
wenzelm@2554
|
976 |
|
wenzelm@2554
|
977 |
* internal type "tactic" now simply "thm -> thm Sequence.seq";
|
wenzelm@2554
|
978 |
|
wenzelm@2554
|
979 |
|
wenzelm@2554
|
980 |
|
wenzelm@2554
|
981 |
New in Isabelle94-5
|
wenzelm@2554
|
982 |
-------------------
|
wenzelm@2554
|
983 |
|
wenzelm@2554
|
984 |
* reduced space requirements;
|
wenzelm@2554
|
985 |
|
wenzelm@2554
|
986 |
* automatic HTML generation from theories;
|
wenzelm@2554
|
987 |
|
wenzelm@2554
|
988 |
* theory files no longer require "..." (quotes) around most types;
|
wenzelm@2554
|
989 |
|
wenzelm@2554
|
990 |
* new examples, including two proofs of the Church-Rosser theorem;
|
wenzelm@2554
|
991 |
|
wenzelm@2554
|
992 |
* non-curried (1994) version of HOL is no longer distributed;
|
wenzelm@2554
|
993 |
|
wenzelm@2553
|
994 |
|
paulson@2557
|
995 |
|
paulson@2557
|
996 |
New in Isabelle94-4
|
paulson@2557
|
997 |
-------------------
|
paulson@2557
|
998 |
|
paulson@2747
|
999 |
* greatly reduced space requirements;
|
paulson@2557
|
1000 |
|
paulson@2557
|
1001 |
* theory files (.thy) no longer require \...\ escapes at line breaks;
|
paulson@2557
|
1002 |
|
wenzelm@5726
|
1003 |
* searchable theorem database (see the section "Retrieving theorems" on
|
paulson@2557
|
1004 |
page 8 of the Reference Manual);
|
paulson@2557
|
1005 |
|
paulson@2557
|
1006 |
* new examples, including Grabczewski's monumental case study of the
|
paulson@2557
|
1007 |
Axiom of Choice;
|
paulson@2557
|
1008 |
|
paulson@2557
|
1009 |
* The previous version of HOL renamed to Old_HOL;
|
paulson@2557
|
1010 |
|
wenzelm@5726
|
1011 |
* The new version of HOL (previously called CHOL) uses a curried syntax
|
paulson@2557
|
1012 |
for functions. Application looks like f a b instead of f(a,b);
|
paulson@2557
|
1013 |
|
paulson@2557
|
1014 |
* Mutually recursive inductive definitions finally work in HOL;
|
paulson@2557
|
1015 |
|
paulson@2557
|
1016 |
* In ZF, pattern-matching on tuples is now available in all abstractions and
|
paulson@2557
|
1017 |
translates to the operator "split";
|
paulson@2557
|
1018 |
|
paulson@2557
|
1019 |
|
paulson@2557
|
1020 |
|
paulson@2557
|
1021 |
New in Isabelle94-3
|
paulson@2557
|
1022 |
-------------------
|
paulson@2557
|
1023 |
|
wenzelm@5726
|
1024 |
* new infix operator, addss, allowing the classical reasoner to
|
paulson@2557
|
1025 |
perform simplification at each step of its search. Example:
|
wenzelm@5726
|
1026 |
fast_tac (cs addss ss)
|
paulson@2557
|
1027 |
|
wenzelm@5726
|
1028 |
* a new logic, CHOL, the same as HOL, but with a curried syntax
|
wenzelm@5726
|
1029 |
for functions. Application looks like f a b instead of f(a,b). Also pairs
|
paulson@2557
|
1030 |
look like (a,b) instead of <a,b>;
|
paulson@2557
|
1031 |
|
paulson@2557
|
1032 |
* PLEASE NOTE: CHOL will eventually replace HOL!
|
paulson@2557
|
1033 |
|
paulson@2557
|
1034 |
* In CHOL, pattern-matching on tuples is now available in all abstractions.
|
paulson@2557
|
1035 |
It translates to the operator "split". A new theory of integers is available;
|
paulson@2557
|
1036 |
|
paulson@2557
|
1037 |
* In ZF, integer numerals now denote two's-complement binary integers.
|
paulson@2557
|
1038 |
Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
|
paulson@2557
|
1039 |
|
wenzelm@5726
|
1040 |
* Many new examples: I/O automata, Church-Rosser theorem, equivalents
|
paulson@2557
|
1041 |
of the Axiom of Choice;
|
paulson@2557
|
1042 |
|
paulson@2557
|
1043 |
|
paulson@2557
|
1044 |
|
paulson@2557
|
1045 |
New in Isabelle94-2
|
paulson@2557
|
1046 |
-------------------
|
paulson@2557
|
1047 |
|
wenzelm@5726
|
1048 |
* Significantly faster resolution;
|
paulson@2557
|
1049 |
|
paulson@2557
|
1050 |
* the different sections in a .thy file can now be mixed and repeated
|
paulson@2557
|
1051 |
freely;
|
paulson@2557
|
1052 |
|
paulson@2557
|
1053 |
* Database of theorems for FOL, HOL and ZF. New
|
paulson@2557
|
1054 |
commands including qed, qed_goal and bind_thm store theorems in the database.
|
paulson@2557
|
1055 |
|
paulson@2557
|
1056 |
* Simple database queries: return a named theorem (get_thm) or all theorems of
|
paulson@2557
|
1057 |
a given theory (thms_of), or find out what theory a theorem was proved in
|
paulson@2557
|
1058 |
(theory_of_thm);
|
paulson@2557
|
1059 |
|
paulson@2557
|
1060 |
* Bugs fixed in the inductive definition and datatype packages;
|
paulson@2557
|
1061 |
|
paulson@2557
|
1062 |
* The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
|
paulson@2557
|
1063 |
and HOL_dup_cs obsolete;
|
paulson@2557
|
1064 |
|
paulson@2557
|
1065 |
* Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
|
paulson@2557
|
1066 |
have been removed;
|
paulson@2557
|
1067 |
|
paulson@2557
|
1068 |
* Simpler definition of function space in ZF;
|
paulson@2557
|
1069 |
|
paulson@2557
|
1070 |
* new results about cardinal and ordinal arithmetic in ZF;
|
paulson@2557
|
1071 |
|
paulson@2557
|
1072 |
* 'subtype' facility in HOL for introducing new types as subsets of existing
|
paulson@2557
|
1073 |
types;
|
paulson@2557
|
1074 |
|
paulson@2557
|
1075 |
|
wenzelm@2553
|
1076 |
$Id$
|