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