author | wenzelm |
Wed, 13 Apr 2005 18:46:12 +0200 | |
changeset 15709 | f04c3d668c65 |
parent 15703 | 727ef1b8b3ee |
child 15724 | 1b89c781a7ec |
permissions | -rw-r--r-- |
5363 | 1 |
Isabelle NEWS -- history user-relevant changes |
2 |
============================================== |
|
2553 | 3 |
|
14655
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset
|
4 |
New in this Isabelle release |
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset
|
5 |
---------------------------- |
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset
|
6 |
|
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset
|
7 |
*** General *** |
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset
|
8 |
|
15703 | 9 |
* ML: The type Library.option is no more, along with the exception |
15531 | 10 |
Library.OPTION: Isabelle now uses the standard option type. The |
11 |
functions the, is_some, is_none, etc. are still in Library, but |
|
12 |
the constructors are now SOME and NONE instead of Some and None. |
|
15703 | 13 |
They raise the exception Option. |
14 |
||
15 |
* ML: The exception LIST is no more, the standard exceptions Empty and |
|
15570 | 16 |
Subscript, as well as Library.UnequalLengths are used instead. This |
17 |
means that function like Library.hd and Library.tl are gone, as the |
|
18 |
standard hd and tl functions suffice. |
|
19 |
||
20 |
A number of functions, specifically those in the LIBRARY_CLOSED |
|
21 |
signature, are now no longer exported to the top ML level, as they |
|
22 |
are variants of standard functions. The following suggests how |
|
23 |
one can translate existing code: |
|
24 |
||
25 |
the x = valOf x |
|
26 |
if_none x y = getOpt(x,y) |
|
27 |
is_some x = isSome x |
|
28 |
apsome f x = Option.map f x |
|
29 |
rev_append xs ys = List.revAppend(xs,ys) |
|
30 |
nth_elem(i,xs) = List.nth(xs,i) |
|
31 |
last_elem xs = List.last xs |
|
32 |
flat xss = List.concat xss |
|
33 |
seq fs = app fs |
|
34 |
partition P xs = List.partition P xs |
|
35 |
filter P xs = List.filter P xs |
|
36 |
mapfilter f xs = List.mapPartial f xs |
|
37 |
||
38 |
The final four functions, take, drop, foldl, and foldr, are somewhat |
|
39 |
more complicated (especially the semantics of take and drop differ |
|
40 |
from the standard). |
|
41 |
||
42 |
A simple solution to broken code is to include "open Library" at the |
|
43 |
beginning of a structure. Everything after that will be as before. |
|
15531 | 44 |
|
15130 | 45 |
* Theory headers: the new header syntax for Isar theories is |
46 |
||
47 |
theory <name> |
|
15148 | 48 |
imports <theory1> ... <theoryn> |
15130 | 49 |
begin |
50 |
||
15148 | 51 |
optionally also with a "files" section. The syntax |
15130 | 52 |
|
53 |
theory <name> = <theory1> + ... + <theoryn>: |
|
54 |
||
55 |
will still be supported for some time but will eventually disappear. |
|
56 |
The syntax of old-style theories has not changed. |
|
57 |
||
15475
fdf9434b04ea
- Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset
|
58 |
* Theory loader: parent theories can now also be referred to via |
fdf9434b04ea
- Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset
|
59 |
relative and absolute paths. |
fdf9434b04ea
- Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset
|
60 |
|
15103
79846e8792eb
New transitivity reasoners for transitivity only and quasi orders.
ballarin
parents:
15089
diff
changeset
|
61 |
* Provers/quasi.ML: new transitivity reasoners for transitivity only |
79846e8792eb
New transitivity reasoners for transitivity only and quasi orders.
ballarin
parents:
15089
diff
changeset
|
62 |
and quasi orders. |
79846e8792eb
New transitivity reasoners for transitivity only and quasi orders.
ballarin
parents:
15089
diff
changeset
|
63 |
|
15076
4b3d280ef06a
New prover for transitive and reflexive-transitive closure of relations.
ballarin
parents:
15073
diff
changeset
|
64 |
* Provers/trancl.ML: new transitivity reasoner for transitive and |
4b3d280ef06a
New prover for transitive and reflexive-transitive closure of relations.
ballarin
parents:
15073
diff
changeset
|
65 |
reflexive-transitive closure of relations. |
4b3d280ef06a
New prover for transitive and reflexive-transitive closure of relations.
ballarin
parents:
15073
diff
changeset
|
66 |
|
15163 | 67 |
* Provers/blast.ML: new reference depth_limit to make blast's depth |
68 |
limit (previously hard-coded with a value of 20) user-definable. |
|
69 |
||
15481 | 70 |
* Provers: new version of the subst method, for single-step rewriting: it now |
71 |
works in bound variable contexts. New is subst (asm), for rewriting an |
|
72 |
assumption. Thanks to Lucas Dixon! INCOMPATIBILITY: may rewrite a different |
|
73 |
subterm than the original subst method, which is still available under the |
|
74 |
name simplesubst. |
|
75 |
||
15454 | 76 |
* Pure: thin_tac now works even if the assumption being deleted contains !! or ==>. |
77 |
More generally, erule now works even if the major premise of the elimination rule |
|
78 |
contains !! or ==>. |
|
79 |
||
14655
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset
|
80 |
* Pure: considerably improved version of 'constdefs' command. Now |
14731 | 81 |
performs automatic type-inference of declared constants; additional |
82 |
support for local structure declarations (cf. locales and HOL |
|
83 |
records), see also isar-ref manual. Potential INCOMPATIBILITY: need |
|
84 |
to observe strictly sequential dependencies of definitions within a |
|
85 |
single 'constdefs' section; moreover, the declared name needs to be |
|
86 |
an identifier. If all fails, consider to fall back on 'consts' and |
|
87 |
'defs' separately. |
|
14655
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset
|
88 |
|
14698
7e4dec3fd515
improvd indexed syntax and implicit structures; tuned renaming of symbolic identifiers
wenzelm
parents:
14682
diff
changeset
|
89 |
* Pure: improved indexed syntax and implicit structures. First of |
14731 | 90 |
all, indexed syntax provides a notational device for subscripted |
91 |
application, using the new syntax \<^bsub>term\<^esub> for arbitrary |
|
92 |
expressions. Secondly, in a local context with structure |
|
93 |
declarations, number indexes \<^sub>n or the empty index (default |
|
94 |
number 1) refer to a certain fixed variable implicitly; option |
|
95 |
show_structs controls printing of implicit structures. Typical |
|
96 |
applications of these concepts involve record types and locales. |
|
97 |
||
14795
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset
|
98 |
* Pure: clear separation of logical types and nonterminals, where the |
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset
|
99 |
latter may only occur in 'syntax' specifications or type |
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset
|
100 |
abbreviations. Before that distinction was only partially |
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset
|
101 |
implemented via type class "logic" vs. "{}". Potential |
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset
|
102 |
INCOMPATIBILITY in rare cases of improper use of 'types'/'consts' |
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset
|
103 |
instead of 'nonterminals'/'syntax'. Some very exotic syntax |
14816
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset
|
104 |
specifications may require further adaption (e.g. Cube/Base.thy). |
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset
|
105 |
|
14854 | 106 |
* Pure: removed obsolete type class "logic", use the top sort {} |
107 |
instead. Note that non-logical types should be declared as |
|
108 |
'nonterminals' rather than 'types'. INCOMPATIBILITY for new |
|
109 |
object-logic specifications. |
|
110 |
||
15022 | 111 |
* Pure: print_tac now outputs the goal through the trace channel. |
112 |
||
113 |
* Pure: reference Namespace.unique_names included. If true the |
|
114 |
(shortest) namespace-prefix is printed to disambiguate conflicts (as |
|
115 |
yet). If false the first entry wins (as during parsing). Default |
|
116 |
value is true. |
|
15018 | 117 |
|
15033
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plug-ins;
wenzelm
parents:
15022
diff
changeset
|
118 |
* Pure: tuned internal renaming of symbolic identifiers -- attach |
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plug-ins;
wenzelm
parents:
15022
diff
changeset
|
119 |
primes instead of base 26 numbers. |
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plug-ins;
wenzelm
parents:
15022
diff
changeset
|
120 |
|
15475
fdf9434b04ea
- Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset
|
121 |
* Pure: new flag show_var_qmarks to control printing of leading |
fdf9434b04ea
- Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset
|
122 |
question marks of variable names. |
fdf9434b04ea
- Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset
|
123 |
|
14816
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset
|
124 |
* Pure/Syntax: inner syntax includes (*(*nested*) comments*). |
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset
|
125 |
|
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset
|
126 |
* Pure/Syntax: pretty pinter now supports unbreakable blocks, |
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset
|
127 |
specified in mixfix annotations as "(00...)". |
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset
|
128 |
|
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset
|
129 |
* Pure/Syntax: 'advanced' translation functions (parse_translation |
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset
|
130 |
etc.) may depend on the signature of the theory context being |
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset
|
131 |
presently used for parsing/printing, see also isar-ref manual. |
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset
|
132 |
|
15033
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plug-ins;
wenzelm
parents:
15022
diff
changeset
|
133 |
* Pure/Simplifier: simplification procedures may now take the current |
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plug-ins;
wenzelm
parents:
15022
diff
changeset
|
134 |
simpset into account (cf. Simplifier.simproc(_i) / mk_simproc |
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plug-ins;
wenzelm
parents:
15022
diff
changeset
|
135 |
interface), which is very useful for calling the Simplifier |
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plug-ins;
wenzelm
parents:
15022
diff
changeset
|
136 |
recursively. Minor INCOMPATIBILITY: the 'prems' argument of |
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plug-ins;
wenzelm
parents:
15022
diff
changeset
|
137 |
simprocs is gone -- use prems_of_ss on the simpset instead. |
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plug-ins;
wenzelm
parents:
15022
diff
changeset
|
138 |
Moreover, the low-level mk_simproc no longer applies Logic.varify |
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plug-ins;
wenzelm
parents:
15022
diff
changeset
|
139 |
internally, to allow for use in a context of fixed variables. |
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plug-ins;
wenzelm
parents:
15022
diff
changeset
|
140 |
|
15406 | 141 |
* Pure/Simplifier: Command "find_rewrites" takes a string and lists all |
15703 | 142 |
equality theorems (not just those declared as simp!) whose left-hand |
15406 | 143 |
side matches the term given via the string. In PG the command can be |
144 |
activated via Isabelle -> Show me -> matching rewrites. |
|
145 |
||
15703 | 146 |
* Isar debugging: new reference Toplevel.debug; default false. |
15528
1b12557f720d
New reference Toplevel.debug for verbose printing of exns.
ballarin
parents:
15481
diff
changeset
|
147 |
Set to make printing of exceptions THM, TERM, TYPE and THEORY more verbose. |
1b12557f720d
New reference Toplevel.debug for verbose printing of exns.
ballarin
parents:
15481
diff
changeset
|
148 |
|
15127 | 149 |
* Locales: |
150 |
- "includes" disallowed in declaration of named locales (command "locale"). |
|
15206
09d78ec709c7
Modified locales: improved implementation of "includes".
ballarin
parents:
15200
diff
changeset
|
151 |
- Fixed parameter management in theorem generation for goals with "includes". |
09d78ec709c7
Modified locales: improved implementation of "includes".
ballarin
parents:
15200
diff
changeset
|
152 |
INCOMPATIBILITY: rarely, the generated theorem statement is different. |
15475
fdf9434b04ea
- Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset
|
153 |
|
15696 | 154 |
* Locales: new commands for the interpretation of locale expressions |
155 |
in theories (interpretation) and proof contexts (interpret). These take an |
|
156 |
instantiation of the locale parameters and compute proof obligations from |
|
157 |
the instantiated specification. After the obligations have been discharged, |
|
158 |
the instantiated theorems of the locale are added to the theory or proof |
|
159 |
context. Interpretation is smart in that already active interpretations |
|
160 |
do not occur in proof obligations, neither are instantiated theorems stored |
|
161 |
in duplicate. |
|
162 |
Use print_interps to inspect active interpretations of a particular locale. |
|
163 |
||
15703 | 164 |
* Isar: new syntax 'name(i-j, i-, i, ...)' for referring to specific |
165 |
selections of theorems in named facts via indices. |
|
166 |
||
167 |
||
168 |
*** Document preparation *** |
|
169 |
||
170 |
* New antiquotations @{lhs thm} and @{rhs thm} printing the lhs/rhs of |
|
171 |
definitions, equations, inequations etc. |
|
172 |
||
173 |
* Antiquotations now provide the option 'locale=NAME' to specify an |
|
174 |
alternative context used for evaluating and printing the subsequent |
|
175 |
argument, as in @{thm [locale=LC] fold_commute}, for example. |
|
176 |
||
177 |
* Commands 'display_drafts' and 'print_drafts' perform simple output |
|
178 |
of raw sources. Only those symbols that do not require additional |
|
179 |
LaTeX packages (depending on comments in isabellesym.sty) are |
|
180 |
displayed properly, everything else is left verbatim. We use |
|
181 |
isatool display and isatool print as front ends; these are subject |
|
182 |
to the DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively. |
|
183 |
||
184 |
* Proof scripts as well as some other commands such as ML or |
|
185 |
parse/print_translation can now be hidden in the document. Hiding |
|
186 |
is enabled by default, and can be disabled either via the option '-H |
|
187 |
false' of isatool usedir or by resetting the reference variable |
|
188 |
IsarOutput.hide_commands. Additional commands to be hidden may be |
|
189 |
declared using IsarOutput.add_hidden_commands. |
|
190 |
||
15475
fdf9434b04ea
- Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset
|
191 |
|
14700
2f885b7e5ba7
reimplementation of HOL records; only one type is created for
schirmer
parents:
14699
diff
changeset
|
192 |
*** HOL *** |
2f885b7e5ba7
reimplementation of HOL records; only one type is created for
schirmer
parents:
14699
diff
changeset
|
193 |
|
15242 | 194 |
* Datatype induction via method `induct' now preserves the name of the |
195 |
induction variable. For example, when proving P(xs::'a list) by induction |
|
196 |
on xs, the induction step is now P(xs) ==> P(a#xs) rather than |
|
197 |
P(list) ==> P(a#list) as previously. |
|
198 |
||
14731 | 199 |
* HOL/record: reimplementation of records. Improved scalability for |
200 |
records with many fields, avoiding performance problems for type |
|
201 |
inference. Records are no longer composed of nested field types, but |
|
202 |
of nested extension types. Therefore the record type only grows |
|
203 |
linear in the number of extensions and not in the number of fields. |
|
204 |
The top-level (users) view on records is preserved. Potential |
|
205 |
INCOMPATIBILITY only in strange cases, where the theory depends on |
|
206 |
the old record representation. The type generated for a record is |
|
207 |
called <record_name>_ext_type. |
|
208 |
||
15022 | 209 |
* HOL/record: Reference record_quick_and_dirty_sensitive can be |
210 |
enabled to skip the proofs triggered by a record definition or a |
|
211 |
simproc (if quick_and_dirty is enabled). Definitions of large |
|
212 |
records can take quite long. |
|
213 |
||
214 |
* HOL/record: "record_upd_simproc" for simplification of multiple |
|
215 |
record updates enabled by default. Moreover, trivial updates are |
|
216 |
also removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break |
|
217 |
occasionally, since simplification is more powerful by default. |
|
15012
28fa57b57209
Added reference record_definition_quick_and_dirty_sensitive, to
schirmer
parents:
15011
diff
changeset
|
218 |
|
14878 | 219 |
* HOL: symbolic syntax of Hilbert Choice Operator is now as follows: |
220 |
||
221 |
syntax (epsilon) |
|
222 |
"_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10) |
|
223 |
||
224 |
The symbol \<some> is displayed as the alternative epsilon of LaTeX |
|
225 |
and x-symbol; use option '-m epsilon' to get it actually printed. |
|
226 |
Moreover, the mathematically important symbolic identifier |
|
227 |
\<epsilon> becomes available as variable, constant etc. |
|
228 |
||
15361 | 229 |
* HOL: "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x". |
230 |
Similarly for all quantifiers: "ALL x > y" etc. |
|
231 |
The x-symbol for >= is \<ge>. |
|
15356 | 232 |
|
15534 | 233 |
* HOL/Set: "{x:A. P}" abbreviates "{x. x:A & P}" |
234 |
(and similarly for "\<in>" instead of ":") |
|
235 |
||
15046 | 236 |
* HOL/SetInterval: The syntax for open intervals has changed: |
237 |
||
238 |
Old New |
|
239 |
{..n(} -> {..<n} |
|
240 |
{)n..} -> {n<..} |
|
241 |
{m..n(} -> {m..<n} |
|
242 |
{)m..n} -> {m<..n} |
|
243 |
{)m..n(} -> {m<..<n} |
|
244 |
||
245 |
The old syntax is still supported but will disappear in the future. |
|
246 |
For conversion use the following emacs search and replace patterns: |
|
247 |
||
248 |
{)\([^\.]*\)\.\. -> {\1<\.\.} |
|
249 |
\.\.\([^(}]*\)(} -> \.\.<\1} |
|
250 |
||
251 |
They are not perfect but work quite well. |
|
252 |
||
15073 | 253 |
* HOL: The syntax for 'setsum', summation over finite sets, has changed: |
254 |
||
255 |
The syntax for 'setsum (%x. e) A' used to be '\<Sum>x:A. e' |
|
256 |
and is now either 'SUM x:A. e' or '\<Sum>x\<in>A. e'. |
|
257 |
||
258 |
There is new syntax for summation over finite sets: |
|
15046 | 259 |
|
15050 | 260 |
'\<Sum>x | P. e' is the same as 'setsum (%x. e) {x. P}' |
261 |
'\<Sum>x=a..b. e' is the same as 'setsum (%x. e) {a..b}' |
|
262 |
'\<Sum>x=a..<b. e' is the same as 'setsum (%x. e) {a..<b}' |
|
263 |
'\<Sum>x<k. e' is the same as 'setsum (%x. e) {..<k}' |
|
15046 | 264 |
|
265 |
Function 'Summation' over nat is gone, its syntax '\<Sum>i<k. e' |
|
266 |
now translates into 'setsum' as above. |
|
267 |
||
15319 | 268 |
* HOL: Finite set induction: In Isar proofs, the insert case is now |
269 |
"case (insert x F)" instead of the old counterintuitive "case (insert F x)". |
|
270 |
||
15200 | 271 |
* HOL/Simplifier: |
272 |
||
273 |
- Is now set up to reason about transitivity chains involving "trancl" |
|
274 |
(r^+) and "rtrancl" (r^*) by setting up tactics provided by |
|
275 |
Provers/trancl.ML as additional solvers. INCOMPATIBILITY: old proofs break |
|
276 |
occasionally as simplification may now solve more goals than previously. |
|
277 |
||
278 |
- Converts x <= y into x = y if assumption y <= x is present. Works for |
|
279 |
all partial orders (class "order"), in particular numbers and sets. For |
|
280 |
linear orders (e.g. numbers) it treats ~ x < y just like y <= x. |
|
15089
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset
|
281 |
|
15423 | 282 |
- Simproc for "let x = a in f x" |
283 |
If a is a free or bound variable or a constant then the let is unfolded. |
|
284 |
Otherwise first a is simplified to a', and then f a' is simplified to |
|
285 |
g. If possible we abstract a' from g arriving at "let x = a' in g' x", |
|
286 |
otherwise we unfold the let and arrive at g. The simproc can be |
|
287 |
enabled/disabled by the reference use_let_simproc. Potential |
|
288 |
INCOMPATIBILITY since simplification is more powerful by default. |
|
289 |
||
14655
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset
|
290 |
|
14682
a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset
|
291 |
*** HOLCF *** |
a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset
|
292 |
|
a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset
|
293 |
* HOLCF: discontinued special version of 'constdefs' (which used to |
14731 | 294 |
support continuous functions) in favor of the general Pure one with |
295 |
full type-inference. |
|
14682
a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset
|
296 |
|
a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset
|
297 |
|
14885 | 298 |
*** ZF *** |
299 |
||
15089
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset
|
300 |
* ZF/ex/{Group,Ring}: examples in abstract algebra, including the |
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset
|
301 |
First Isomorphism Theorem (on quotienting by the kernel of a |
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset
|
302 |
homomorphism). |
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset
|
303 |
|
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset
|
304 |
* ZF/Simplifier: install second copy of type solver that actually |
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset
|
305 |
makes use of TC rules declared to Isar proof contexts (or locales); |
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset
|
306 |
the old version is still required for ML proof scripts. |
14885 | 307 |
|
308 |
||
15703 | 309 |
*** System *** |
310 |
||
311 |
* HOL: isatool dimacs2hol converts files in DIMACS CNF format |
|
312 |
(containing Boolean satisfiability problems) into Isabelle/HOL |
|
313 |
theories. |
|
314 |
||
315 |
* isatool usedir: option -f allows specification of the ML file to be |
|
316 |
used by Isabelle; default is ROOT.ML. |
|
317 |
||
318 |
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for |
|
319 |
isatool doc, isatool mkdir, display_drafts etc.). |
|
320 |
||
321 |
||
322 |
*** ML *** |
|
323 |
||
324 |
* Pure: output via the Isabelle channels of writeln/warning/error |
|
325 |
etc. is now passed through Output.output, with a hook for arbitrary |
|
326 |
transformations depending on the print_mode (cf. Output.add_mode -- |
|
327 |
the first active mode that provides a output function wins). |
|
328 |
Already formatted output may be embedded into further text via |
|
329 |
Output.raw; the result of Pretty.string_of/str_of and derived |
|
330 |
functions (string_of_term/cterm/thm etc.) is already marked raw to |
|
331 |
accommodate easy composition of diagnostic messages etc. |
|
332 |
Programmers rarely need to care about Output.output or Output.raw at |
|
333 |
all, with some notable exceptions: Output.output is required when |
|
334 |
bypassing the standard channels (writeln etc.), or in token |
|
335 |
translations to produce properly formatted results; Output.raw is |
|
336 |
required when capturing already output material that will eventually |
|
337 |
be presented to the user a second time. For the default print mode, |
|
338 |
both Output.output and Output.raw have no effect. |
|
339 |
||
340 |
* Provers: Simplifier and Classical Reasoner now support proof context |
|
341 |
dependent plug-ins (simprocs, solvers, wrappers etc.). These extra |
|
342 |
components are stored in the theory and patched into the |
|
343 |
simpset/claset when used in an Isar proof context. Context |
|
344 |
dependent components are maintained by the following theory |
|
345 |
operations: |
|
346 |
||
347 |
Simplifier.add_context_simprocs |
|
348 |
Simplifier.del_context_simprocs |
|
349 |
Simplifier.set_context_subgoaler |
|
350 |
Simplifier.reset_context_subgoaler |
|
351 |
Simplifier.add_context_looper |
|
352 |
Simplifier.del_context_looper |
|
353 |
Simplifier.add_context_unsafe_solver |
|
354 |
Simplifier.add_context_safe_solver |
|
355 |
||
356 |
Classical.add_context_safe_wrapper |
|
357 |
Classical.del_context_safe_wrapper |
|
358 |
Classical.add_context_unsafe_wrapper |
|
359 |
Classical.del_context_unsafe_wrapper |
|
360 |
||
361 |
IMPORTANT NOTE: proof tools (methods etc.) need to use |
|
362 |
local_simpset_of and local_claset_of to instead of the primitive |
|
363 |
Simplifier.get_local_simpset and Classical.get_local_claset, |
|
364 |
respectively, in order to see the context dependent fields! |
|
365 |
||
366 |
||
14655
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset
|
367 |
|
14606 | 368 |
New in Isabelle2004 (April 2004) |
369 |
-------------------------------- |
|
13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
370 |
|
14171
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset
|
371 |
*** General *** |
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset
|
372 |
|
14398
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
373 |
* Provers/order.ML: new efficient reasoner for partial and linear orders. |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
374 |
Replaces linorder.ML. |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
375 |
|
14606 | 376 |
* Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic |
377 |
(\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler |
|
14173 | 378 |
(\<a>...\<z>), are now considered normal letters, and can therefore |
379 |
be used anywhere where an ASCII letter (a...zA...Z) has until |
|
380 |
now. COMPATIBILITY: This obviously changes the parsing of some |
|
381 |
terms, especially where a symbol has been used as a binder, say |
|
382 |
'\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed |
|
383 |
as an identifier. Fix it by inserting a space around former |
|
384 |
symbols. Call 'isatool fixgreek' to try to fix parsing errors in |
|
385 |
existing theory and ML files. |
|
14171
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset
|
386 |
|
14237 | 387 |
* Pure: Macintosh and Windows line-breaks are now allowed in theory files. |
388 |
||
14731 | 389 |
* Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now |
390 |
allowed in identifiers. Similar to Greek letters \<^isub> is now considered |
|
391 |
a normal (but invisible) letter. For multiple letter subscripts repeat |
|
392 |
\<^isub> like this: x\<^isub>1\<^isub>2. |
|
14233 | 393 |
|
14333 | 394 |
* Pure: There are now sub-/superscripts that can span more than one |
395 |
character. Text between \<^bsub> and \<^esub> is set in subscript in |
|
14606 | 396 |
ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in |
397 |
superscript. The new control characters are not identifier parts. |
|
14333 | 398 |
|
14561
c53396af770e
* raw control symbols are of the form \<^raw:...> now.
schirmer
parents:
14556
diff
changeset
|
399 |
* Pure: Control-symbols of the form \<^raw:...> will literally print the |
14606 | 400 |
content of "..." to the latex file instead of \isacntrl... . The "..." |
401 |
may consist of any printable characters excluding the end bracket >. |
|
14361
ad2f5da643b4
* Support for raw latex output in control symbols: \<^raw...>
schirmer
parents:
14333
diff
changeset
|
402 |
|
14237 | 403 |
* Pure: Using new Isar command "finalconsts" (or the ML functions |
404 |
Theory.add_finals or Theory.add_finals_i) it is now possible to |
|
405 |
declare constants "final", which prevents their being given a definition |
|
406 |
later. It is useful for constants whose behaviour is fixed axiomatically |
|
14224 | 407 |
rather than definitionally, such as the meta-logic connectives. |
408 |
||
14606 | 409 |
* Pure: 'instance' now handles general arities with general sorts |
410 |
(i.e. intersections of classes), |
|
14503
255ad604e08e
Added check that Theory.ML does not occur in the files section of the theory
skalberg
parents:
14480
diff
changeset
|
411 |
|
14547 | 412 |
* Presentation: generated HTML now uses a CSS style sheet to make layout |
14731 | 413 |
(somewhat) independent of content. It is copied from lib/html/isabelle.css. |
14547 | 414 |
It can be changed to alter the colors/layout of generated pages. |
415 |
||
14556
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset
|
416 |
|
14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
417 |
*** Isar *** |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
418 |
|
14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset
|
419 |
* Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac, |
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset
|
420 |
cut_tac, subgoal_tac and thin_tac: |
14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
421 |
- Now understand static (Isar) contexts. As a consequence, users of Isar |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
422 |
locales are no longer forced to write Isar proof scripts. |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
423 |
For details see Isar Reference Manual, paragraph 4.3.2: Further tactic |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
424 |
emulations. |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
425 |
- INCOMPATIBILITY: names of variables to be instantiated may no |
14211
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
426 |
longer be enclosed in quotes. Instead, precede variable name with `?'. |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
427 |
This is consistent with the instantiation attribute "where". |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
428 |
|
14257
a7ef3f7588c5
Type inference bug in Isar attributes "where" and "of" fixed.
ballarin
parents:
14255
diff
changeset
|
429 |
* Attributes "where" and "of": |
14285
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset
|
430 |
- Now take type variables of instantiated theorem into account when reading |
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset
|
431 |
the instantiation string. This fixes a bug that caused instantiated |
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset
|
432 |
theorems to have too special types in some circumstances. |
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset
|
433 |
- "where" permits explicit instantiations of type variables. |
14257
a7ef3f7588c5
Type inference bug in Isar attributes "where" and "of" fixed.
ballarin
parents:
14255
diff
changeset
|
434 |
|
14556
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset
|
435 |
* Calculation commands "moreover" and "also" no longer interfere with |
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset
|
436 |
current facts ("this"), admitting arbitrary combinations with "then" |
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset
|
437 |
and derived forms. |
14283 | 438 |
|
14211
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
439 |
* Locales: |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
440 |
- Goal statements involving the context element "includes" no longer |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
441 |
generate theorems with internal delta predicates (those ending on |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
442 |
"_axioms") in the premise. |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
443 |
Resolve particular premise with <locale>.intro to obtain old form. |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
444 |
- Fixed bug in type inference ("unify_frozen") that prevented mix of target |
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset
|
445 |
specification and "includes" elements in goal statement. |
14254
342634f38451
Isar/Locales: <loc>.intro and <loc>.axioms no longer intro? and elim? by
ballarin
parents:
14243
diff
changeset
|
446 |
- Rule sets <locale>.intro and <locale>.axioms no longer declared as |
342634f38451
Isar/Locales: <loc>.intro and <loc>.axioms no longer intro? and elim? by
ballarin
parents:
14243
diff
changeset
|
447 |
[intro?] and [elim?] (respectively) by default. |
14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset
|
448 |
- Experimental command for instantiation of locales in proof contexts: |
14551 | 449 |
instantiate <label>[<attrs>]: <loc> |
14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset
|
450 |
Instantiates locale <loc> and adds all its theorems to the current context |
14551 | 451 |
taking into account their attributes. Label and attrs are optional |
452 |
modifiers, like in theorem declarations. If present, names of |
|
453 |
instantiated theorems are qualified with <label>, and the attributes |
|
454 |
<attrs> are applied after any attributes these theorems might have already. |
|
455 |
If the locale has assumptions, a chained fact of the form |
|
14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset
|
456 |
"<loc> t1 ... tn" is expected from which instantiations of the parameters |
14551 | 457 |
are derived. The command does not support old-style locales declared |
458 |
with "locale (open)". |
|
459 |
A few (very simple) examples can be found in FOL/ex/LocaleInst.thy. |
|
14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
460 |
|
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
461 |
* HOL: Tactic emulation methods induct_tac and case_tac understand static |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
462 |
(Isar) contexts. |
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset
|
463 |
|
14556
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset
|
464 |
|
14136 | 465 |
*** HOL *** |
466 |
||
14624 | 467 |
* Proof import: new image HOL4 contains the imported library from |
468 |
the HOL4 system with about 2500 theorems. It is imported by |
|
469 |
replaying proof terms produced by HOL4 in Isabelle. The HOL4 image |
|
470 |
can be used like any other Isabelle image. See |
|
471 |
HOL/Import/HOL/README for more information. |
|
472 |
||
14398
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
473 |
* Simplifier: |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
474 |
- Much improved handling of linear and partial orders. |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
475 |
Reasoners for linear and partial orders are set up for type classes |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
476 |
"linorder" and "order" respectively, and are added to the default simpset |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
477 |
as solvers. This means that the simplifier can build transitivity chains |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
478 |
to solve goals from the assumptions. |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
479 |
- INCOMPATIBILITY: old proofs break occasionally. Typically, applications |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
480 |
of blast or auto after simplification become unnecessary because the goal |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
481 |
is solved by simplification already. |
c5c47703f763
Efficient, graph-based reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset
|
482 |
|
14731 | 483 |
* Numerics: new theory Ring_and_Field contains over 250 basic numerical laws, |
14389 | 484 |
all proved in axiomatic type classes for semirings, rings and fields. |
485 |
||
486 |
* Numerics: |
|
487 |
- Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are |
|
14731 | 488 |
now formalized using the Ring_and_Field theory mentioned above. |
14389 | 489 |
- INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently |
490 |
than before, because now they are set up once in a generic manner. |
|
14731 | 491 |
- INCOMPATIBILITY: many type-specific arithmetic laws have gone. |
14480 | 492 |
Look for the general versions in Ring_and_Field (and Power if they concern |
493 |
exponentiation). |
|
14389 | 494 |
|
14401 | 495 |
* Type "rat" of the rational numbers is now available in HOL-Complex. |
14389 | 496 |
|
14255 | 497 |
* Records: |
498 |
- Record types are now by default printed with their type abbreviation |
|
499 |
instead of the list of all field types. This can be configured via |
|
500 |
the reference "print_record_type_abbr". |
|
14731 | 501 |
- Simproc "record_upd_simproc" for simplification of multiple updates added |
14255 | 502 |
(not enabled by default). |
14427 | 503 |
- Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp. |
504 |
EX x. x = sel r to True (not enabled by default). |
|
14255 | 505 |
- Tactic "record_split_simp_tac" to split and simplify records added. |
14731 | 506 |
|
14136 | 507 |
* 'specification' command added, allowing for definition by |
14224 | 508 |
specification. There is also an 'ax_specification' command that |
509 |
introduces the new constants axiomatically. |
|
14136 | 510 |
|
14375 | 511 |
* arith(_tac) is now able to generate counterexamples for reals as well. |
512 |
||
14399
dc677b35e54f
New lemmas about inversion of restricted functions.
ballarin
parents:
14398
diff
changeset
|
513 |
* HOL-Algebra: new locale "ring" for non-commutative rings. |
dc677b35e54f
New lemmas about inversion of restricted functions.
ballarin
parents:
14398
diff
changeset
|
514 |
|
14243 | 515 |
* HOL-ex: InductiveInvariant_examples illustrates advanced recursive function |
14610 | 516 |
definitions, thanks to Sava Krsti\'{c} and John Matthews. |
517 |
||
14731 | 518 |
* HOL-Matrix: a first theory for matrices in HOL with an application of |
14610 | 519 |
matrix theory to linear programming. |
14136 | 520 |
|
14380 | 521 |
* Unions and Intersections: |
15119 | 522 |
The latex output syntax of UN and INT has been changed |
523 |
from "\Union x \in A. B" to "\Union_{x \in A} B" |
|
524 |
i.e. the index formulae has become a subscript. |
|
525 |
Similarly for "\Union x. B", and for \Inter instead of \Union. |
|
14380 | 526 |
|
14418 | 527 |
* Unions and Intersections over Intervals: |
14731 | 528 |
There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is |
529 |
also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A" |
|
14418 | 530 |
like in normal math, and corresponding versions for < and for intersection. |
531 |
||
15677 | 532 |
* HOL/List: Ordering "lexico" is renamed "lenlex" and the standard |
533 |
lexicographic dictonary ordering has been added as "lexord". |
|
534 |
||
14401 | 535 |
* ML: the legacy theory structures Int and List have been removed. They had |
536 |
conflicted with ML Basis Library structures having the same names. |
|
14380 | 537 |
|
14464 | 538 |
* 'refute' command added to search for (finite) countermodels. Only works |
539 |
for a fragment of HOL. The installation of an external SAT solver is |
|
540 |
highly recommended. See "HOL/Refute.thy" for details. |
|
541 |
||
14602 | 542 |
* 'quickcheck' command: Allows to find counterexamples by evaluating |
543 |
formulae under an assignment of free variables to random values. |
|
544 |
In contrast to 'refute', it can deal with inductive datatypes, |
|
545 |
but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy" |
|
546 |
for examples. |
|
14464 | 547 |
|
14606 | 548 |
|
14536 | 549 |
*** HOLCF *** |
550 |
||
551 |
* Streams now come with concatenation and are part of the HOLCF image |
|
552 |
||
14572 | 553 |
|
554 |
||
14136 | 555 |
New in Isabelle2003 (May 2003) |
14606 | 556 |
------------------------------ |
14136 | 557 |
|
13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
558 |
*** General *** |
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
559 |
|
13618 | 560 |
* Provers/simplifier: |
561 |
||
13781 | 562 |
- Completely reimplemented method simp (ML: Asm_full_simp_tac): |
13618 | 563 |
Assumptions are now subject to complete mutual simplification, |
564 |
not just from left to right. The simplifier now preserves |
|
565 |
the order of assumptions. |
|
566 |
||
567 |
Potential INCOMPATIBILITY: |
|
568 |
||
13781 | 569 |
-- simp sometimes diverges where the old version did |
570 |
not, e.g. invoking simp on the goal |
|
13618 | 571 |
|
572 |
[| P (f x); y = x; f x = f y |] ==> Q |
|
573 |
||
13781 | 574 |
now gives rise to the infinite reduction sequence |
575 |
||
576 |
P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ... |
|
577 |
||
578 |
Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this |
|
579 |
kind of problem. |
|
580 |
||
581 |
-- Tactics combining classical reasoner and simplification (such as auto) |
|
582 |
are also affected by this change, because many of them rely on |
|
583 |
simp. They may sometimes diverge as well or yield a different numbers |
|
584 |
of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto |
|
585 |
in case of problems. Sometimes subsequent calls to the classical |
|
586 |
reasoner will fail because a preceeding call to the simplifier too |
|
587 |
eagerly simplified the goal, e.g. deleted redundant premises. |
|
13618 | 588 |
|
589 |
- The simplifier trace now shows the names of the applied rewrite rules |
|
590 |
||
13829 | 591 |
- You can limit the number of recursive invocations of the simplifier |
592 |
during conditional rewriting (where the simplifie tries to solve the |
|
593 |
conditions before applying the rewrite rule): |
|
594 |
ML "simp_depth_limit := n" |
|
595 |
where n is an integer. Thus you can force termination where previously |
|
596 |
the simplifier would diverge. |
|
597 |
||
13835
12b2ffbe543a
Change to meta simplifier: congruence rules may now have frees as head of term.
ballarin
parents:
13829
diff
changeset
|
598 |
- Accepts free variables as head terms in congruence rules. Useful in Isar. |
13829 | 599 |
|
13938 | 600 |
- No longer aborts on failed congruence proof. Instead, the |
601 |
congruence is ignored. |
|
602 |
||
14008 | 603 |
* Pure: New generic framework for extracting programs from constructive |
604 |
proofs. See HOL/Extraction.thy for an example instantiation, as well |
|
605 |
as HOL/Extraction for some case studies. |
|
606 |
||
13868 | 607 |
* Pure: The main goal of the proof state is no longer shown by default, only |
608 |
the subgoals. This behaviour is controlled by a new flag. |
|
13835
12b2ffbe543a
Change to meta simplifier: congruence rules may now have frees as head of term.
ballarin
parents:
13829
diff
changeset
|
609 |
PG menu: Isabelle/Isar -> Settings -> Show Main Goal |
13815 | 610 |
(ML: Proof.show_main_goal). |
611 |
||
612 |
* Pure: You can find all matching introduction rules for subgoal 1, i.e. all |
|
613 |
rules whose conclusion matches subgoal 1: |
|
614 |
PG menu: Isabelle/Isar -> Show me -> matching rules |
|
615 |
The rules are ordered by how closely they match the subgoal. |
|
616 |
In particular, rules that solve a subgoal outright are displayed first |
|
617 |
(or rather last, the way they are printed). |
|
618 |
(ML: ProofGeneral.print_intros()) |
|
619 |
||
620 |
* Pure: New flag trace_unify_fail causes unification to print |
|
13781 | 621 |
diagnostic information (PG: in trace buffer) when it fails. This is |
622 |
useful for figuring out why single step proofs like rule, erule or |
|
623 |
assumption failed. |
|
624 |
||
13815 | 625 |
* Pure: Locale specifications now produce predicate definitions |
13410
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
626 |
according to the body of text (covering assumptions modulo local |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
627 |
definitions); predicate "loc_axioms" covers newly introduced text, |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
628 |
while "loc" is cumulative wrt. all included locale expressions; the |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
629 |
latter view is presented only on export into the global theory |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
630 |
context; potential INCOMPATIBILITY, use "(open)" option to fall back |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
631 |
on the old view without predicates; |
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset
|
632 |
|
13459
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset
|
633 |
* Pure: predefined locales "var" and "struct" are useful for sharing |
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset
|
634 |
parameters (as in CASL, for example); just specify something like |
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset
|
635 |
``var x + var y + struct M'' as import; |
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset
|
636 |
|
13463
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
637 |
* Pure: improved thms_containing: proper indexing of facts instead of |
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
638 |
raw theorems; check validity of results wrt. current name space; |
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
639 |
include local facts of proof configuration (also covers active |
13541 | 640 |
locales), cover fixed variables in index; may use "_" in term |
641 |
specification; an optional limit for the number of printed facts may |
|
642 |
be given (the default is 40); |
|
643 |
||
644 |
* Pure: disallow duplicate fact bindings within new-style theory files |
|
645 |
(batch-mode only); |
|
13540
aede0306e214
* Pure: disallow duplicate fact bindings within new-style theory files;
wenzelm
parents:
13522
diff
changeset
|
646 |
|
13463
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
647 |
* Provers: improved induct method: assumptions introduced by case |
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
648 |
"foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from |
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
649 |
the goal statement); "foo" still refers to all facts collectively; |
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset
|
650 |
|
13550 | 651 |
* Provers: the function blast.overloaded has been removed: all constants |
652 |
are regarded as potentially overloaded, which improves robustness in exchange |
|
653 |
for slight decrease in efficiency; |
|
654 |
||
13781 | 655 |
* Provers/linorder: New generic prover for transitivity reasoning over |
656 |
linear orders. Note: this prover is not efficient! |
|
657 |
||
13522
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset
|
658 |
* Isar: preview of problems to finish 'show' now produce an error |
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset
|
659 |
rather than just a warning (in interactive mode); |
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset
|
660 |
|
13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
661 |
|
13158 | 662 |
*** HOL *** |
663 |
||
13899 | 664 |
* arith(_tac) |
665 |
||
666 |
- Produces a counter example if it cannot prove a goal. |
|
667 |
Note that the counter example may be spurious if the goal is not a formula |
|
668 |
of quantifier-free linear arithmetic. |
|
669 |
In ProofGeneral the counter example appears in the trace buffer. |
|
670 |
||
671 |
- Knows about div k and mod k where k is a numeral of type nat or int. |
|
672 |
||
673 |
- Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free |
|
674 |
linear arithmetic fails. This takes account of quantifiers and divisibility. |
|
14731 | 675 |
Presburger arithmetic can also be called explicitly via presburger(_tac). |
13899 | 676 |
|
677 |
* simp's arithmetic capabilities have been enhanced a bit: it now |
|
678 |
takes ~= in premises into account (by performing a case split); |
|
679 |
||
680 |
* simp reduces "m*(n div m) + n mod m" to n, even if the two summands |
|
681 |
are distributed over a sum of terms; |
|
682 |
||
13735 | 683 |
* New tactic "trans_tac" and method "trans" instantiate |
684 |
Provers/linorder.ML for axclasses "order" and "linorder" (predicates |
|
14731 | 685 |
"<=", "<" and "="). |
686 |
||
687 |
* function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main |
|
13587 | 688 |
HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp"; |
689 |
||
13443 | 690 |
* 'typedef' command has new option "open" to suppress the set |
691 |
definition; |
|
692 |
||
13522
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset
|
693 |
* functions Min and Max on finite sets have been introduced (theory |
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset
|
694 |
Finite_Set); |
13492 | 695 |
|
13443 | 696 |
* attribute [symmetric] now works for relations as well; it turns |
697 |
(x,y) : R^-1 into (y,x) : R, and vice versa; |
|
698 |
||
13613 | 699 |
* induct over a !!-quantified statement (say !!x1..xn): |
700 |
each "case" automatically performs "fix x1 .. xn" with exactly those names. |
|
701 |
||
13899 | 702 |
* Map: `empty' is no longer a constant but a syntactic abbreviation for |
703 |
%x. None. Warning: empty_def now refers to the previously hidden definition |
|
704 |
of the empty set. |
|
705 |
||
14018 | 706 |
* Algebra: formalization of classical algebra. Intended as base for |
707 |
any algebraic development in Isabelle. Currently covers group theory |
|
708 |
(up to Sylow's theorem) and ring theory (Universal Property of |
|
709 |
Univariate Polynomials). Contributions welcome; |
|
13960 | 710 |
|
711 |
* GroupTheory: deleted, since its material has been moved to Algebra; |
|
712 |
||
14731 | 713 |
* Complex: new directory of the complex numbers with numeric constants, |
714 |
nonstandard complex numbers, and some complex analysis, standard and |
|
13966
2160abf7cfe7
removal of the image HOL-Real and merging of HOL-Real-ex with HOL-Complex-ex
paulson
parents:
13960
diff
changeset
|
715 |
nonstandard (Jacques Fleuriot); |
2160abf7cfe7
removal of the image HOL-Real and merging of HOL-Real-ex with HOL-Complex-ex
paulson
parents:
13960
diff
changeset
|
716 |
|
2160abf7cfe7
removal of the image HOL-Real and merging of HOL-Real-ex with HOL-Complex-ex
paulson
parents:
13960
diff
changeset
|
717 |
* HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal; |
2160abf7cfe7
removal of the image HOL-Real and merging of HOL-Real-ex with HOL-Complex-ex
paulson
parents:
13960
diff
changeset
|
718 |
|
14731 | 719 |
* Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques |
13966
2160abf7cfe7
removal of the image HOL-Real and merging of HOL-Real-ex with HOL-Complex-ex
paulson
parents:
13960
diff
changeset
|
720 |
Fleuriot); |
13960 | 721 |
|
13549 | 722 |
* Real/HahnBanach: updated and adapted to locales; |
723 |
||
13995 | 724 |
* NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad, |
725 |
Gray and Kramer); |
|
13872 | 726 |
|
727 |
* UNITY: added the Meier-Sanders theory of progress sets; |
|
728 |
||
14011 | 729 |
* MicroJava: bytecode verifier and lightweight bytecode verifier |
730 |
as abstract algorithms, instantiated to the JVM; |
|
731 |
||
14010 | 732 |
* Bali: Java source language formalization. Type system, operational |
733 |
semantics, axiomatic semantics. Supported language features: |
|
734 |
classes, interfaces, objects,virtual methods, static methods, |
|
735 |
static/instance fields, arrays, access modifiers, definite |
|
736 |
assignment, exceptions. |
|
13549 | 737 |
|
14011 | 738 |
|
13549 | 739 |
*** ZF *** |
740 |
||
15154 | 741 |
* ZF/Constructible: consistency proof for AC (Gdel's constructible |
13549 | 742 |
universe, etc.); |
743 |
||
13872 | 744 |
* Main ZF: virtually all theories converted to new-style format; |
13518 | 745 |
|
13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
746 |
|
13478 | 747 |
*** ML *** |
748 |
||
749 |
* Pure: Tactic.prove provides sane interface for internal proofs; |
|
750 |
omits the infamous "standard" operation, so this is more appropriate |
|
751 |
than prove_goalw_cterm in many situations (e.g. in simprocs); |
|
752 |
||
753 |
* Pure: improved error reporting of simprocs; |
|
754 |
||
755 |
* Provers: Simplifier.simproc(_i) provides sane interface for setting |
|
756 |
up simprocs; |
|
757 |
||
758 |
||
13953 | 759 |
*** Document preparation *** |
760 |
||
761 |
* uses \par instead of \\ for line breaks in theory text. This may |
|
762 |
shift some page breaks in large documents. To get the old behaviour |
|
763 |
use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex. |
|
764 |
||
14731 | 765 |
* minimized dependencies of isabelle.sty and isabellesym.sty on |
13953 | 766 |
other packages |
767 |
||
768 |
* \<euro> now needs package babel/greek instead of marvosym (which |
|
769 |
broke \Rightarrow) |
|
770 |
||
14731 | 771 |
* normal size for \<zero>...\<nine> (uses \mathbf instead of |
13954 | 772 |
textcomp package) |
13953 | 773 |
|
13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset
|
774 |
|
14572 | 775 |
|
12984 | 776 |
New in Isabelle2002 (March 2002) |
777 |
-------------------------------- |
|
11474 | 778 |
|
11572 | 779 |
*** Document preparation *** |
780 |
||
11842
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
781 |
* greatly simplified document preparation setup, including more |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
782 |
graceful interpretation of isatool usedir -i/-d/-D options, and more |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
783 |
instructive isatool mkdir; users should basically be able to get |
12899
7d5b690253ee
"isatool usedir -D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset
|
784 |
started with "isatool mkdir HOL Test && isatool make"; alternatively, |
7d5b690253ee
"isatool usedir -D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset
|
785 |
users may run a separate document processing stage manually like this: |
7d5b690253ee
"isatool usedir -D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset
|
786 |
"isatool usedir -D output HOL Test && isatool document Test/output"; |
11842
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
787 |
|
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
788 |
* theory dependency graph may now be incorporated into documents; |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
789 |
isatool usedir -g true will produce session_graph.eps/.pdf for use |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
790 |
with \includegraphics of LaTeX; |
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset
|
791 |
|
11864
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset
|
792 |
* proper spacing of consecutive markup elements, especially text |
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset
|
793 |
blocks after section headings; |
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset
|
794 |
|
11572 | 795 |
* support bold style (for single symbols only), input syntax is like |
796 |
this: "\<^bold>\<alpha>" or "\<^bold>A"; |
|
797 |
||
11814 | 798 |
* \<bullet> is now output as bold \cdot by default, which looks much |
11572 | 799 |
better in printed text; |
800 |
||
11712
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset
|
801 |
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>; |
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset
|
802 |
note that these symbols are currently unavailable in Proof General / |
12769 | 803 |
X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>; |
12690 | 804 |
|
805 |
* isatool latex no longer depends on changed TEXINPUTS, instead |
|
806 |
isatool document copies the Isabelle style files to the target |
|
807 |
location; |
|
11712
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset
|
808 |
|
11572 | 809 |
|
11633 | 810 |
*** Isar *** |
811 |
||
12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
812 |
* Pure/Provers: improved proof by cases and induction; |
12280 | 813 |
- 'case' command admits impromptu naming of parameters (such as |
814 |
"case (Suc n)"); |
|
815 |
- 'induct' method divinates rule instantiation from the inductive |
|
816 |
claim; no longer requires excessive ?P bindings for proper |
|
817 |
instantiation of cases; |
|
818 |
- 'induct' method properly enumerates all possibilities of set/type |
|
819 |
rules; as a consequence facts may be also passed through *type* |
|
820 |
rules without further ado; |
|
821 |
- 'induct' method now derives symbolic cases from the *rulified* |
|
822 |
rule (before it used to rulify cases stemming from the internal |
|
823 |
atomized version); this means that the context of a non-atomic |
|
824 |
statement becomes is included in the hypothesis, avoiding the |
|
825 |
slightly cumbersome show "PROP ?case" form; |
|
826 |
- 'induct' may now use elim-style induction rules without chaining |
|
827 |
facts, using ``missing'' premises from the goal state; this allows |
|
828 |
rules stemming from inductive sets to be applied in unstructured |
|
829 |
scripts, while still benefitting from proper handling of non-atomic |
|
830 |
statements; NB: major inductive premises need to be put first, all |
|
831 |
the rest of the goal is passed through the induction; |
|
832 |
- 'induct' proper support for mutual induction involving non-atomic |
|
833 |
rule statements (uses the new concept of simultaneous goals, see |
|
834 |
below); |
|
12853 | 835 |
- append all possible rule selections, but only use the first |
836 |
success (no backtracking); |
|
11995
4a622f5fb164
- 'induct' may now use elim-style induction rules without chaining
wenzelm
parents:
11986
diff
changeset
|
837 |
- removed obsolete "(simplified)" and "(stripped)" options of methods; |
12754
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset
|
838 |
- undeclared rule case names default to numbers 1, 2, 3, ...; |
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset
|
839 |
- added 'print_induct_rules' (covered by help item in recent Proof |
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset
|
840 |
General versions); |
11995
4a622f5fb164
- 'induct' may now use elim-style induction rules without chaining
wenzelm
parents:
11986
diff
changeset
|
841 |
- moved induct/cases attributes to Pure, methods to Provers; |
4a622f5fb164
- 'induct' may now use elim-style induction rules without chaining
wenzelm
parents:
11986
diff
changeset
|
842 |
- generic method setup instantiated for FOL and HOL; |
11986
26b95a6f3f79
- 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset
|
843 |
|
12163
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
844 |
* Pure: support multiple simultaneous goal statements, for example |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
845 |
"have a: A and b: B" (same for 'theorem' etc.); being a pure |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
846 |
meta-level mechanism, this acts as if several individual goals had |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
847 |
been stated separately; in particular common proof methods need to be |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
848 |
repeated in order to cover all claims; note that a single elimination |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
849 |
step is *not* sufficient to establish the two conjunctions, so this |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
850 |
fails: |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
851 |
|
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
852 |
assume "A & B" then have A and B .. (*".." fails*) |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
853 |
|
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
854 |
better use "obtain" in situations as above; alternative refer to |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
855 |
multi-step methods like 'auto', 'simp_all', 'blast+' etc.; |
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset
|
856 |
|
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
857 |
* Pure: proper integration with ``locales''; unlike the original |
15154 | 858 |
version by Florian Kammller, Isar locales package high-level proof |
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
859 |
contexts rather than raw logical ones (e.g. we admit to include |
12280 | 860 |
attributes everywhere); operations on locales include merge and |
12964 | 861 |
rename; support for implicit arguments (``structures''); simultaneous |
862 |
type-inference over imports and text; see also HOL/ex/Locales.thy for |
|
863 |
some examples; |
|
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
864 |
|
12707
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
865 |
* Pure: the following commands have been ``localized'', supporting a |
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
866 |
target locale specification "(in name)": 'lemma', 'theorem', |
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
867 |
'corollary', 'lemmas', 'theorems', 'declare'; the results will be |
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
868 |
stored both within the locale and at the theory level (exported and |
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
869 |
qualified by the locale name); |
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset
|
870 |
|
12964 | 871 |
* Pure: theory goals may now be specified in ``long'' form, with |
872 |
ad-hoc contexts consisting of arbitrary locale elements. for example |
|
873 |
``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and |
|
874 |
definitions may be given, too); the result is a meta-level rule with |
|
875 |
the context elements being discharged in the obvious way; |
|
876 |
||
877 |
* Pure: new proof command 'using' allows to augment currently used |
|
878 |
facts after a goal statement ('using' is syntactically analogous to |
|
879 |
'apply', but acts on the goal's facts only); this allows chained facts |
|
880 |
to be separated into parts given before and after a claim, as in |
|
881 |
``from a and b have C using d and e <proof>''; |
|
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset
|
882 |
|
11722 | 883 |
* Pure: renamed "antecedent" case to "rule_context"; |
884 |
||
12964 | 885 |
* Pure: new 'judgment' command records explicit information about the |
886 |
object-logic embedding (used by several tools internally); no longer |
|
887 |
use hard-wired "Trueprop"; |
|
888 |
||
11738 | 889 |
* Pure: added 'corollary' command; |
890 |
||
11722 | 891 |
* Pure: fixed 'token_translation' command; |
892 |
||
11899 | 893 |
* Pure: removed obsolete 'exported' attribute; |
894 |
||
11933 | 895 |
* Pure: dummy pattern "_" in is/let is now automatically lifted over |
896 |
bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x") |
|
11899 | 897 |
supersedes more cumbersome ... (is "ALL x. _ x --> ?C x"); |
898 |
||
11952
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
899 |
* Pure: method 'atomize' presents local goal premises as object-level |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
900 |
statements (atomic meta-level propositions); setup controlled via |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
901 |
rewrite rules declarations of 'atomize' attribute; example |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
902 |
application: 'induct' method with proper rule statements in improper |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
903 |
proof *scripts*; |
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm
parents:
11937
diff
changeset
|
904 |
|
12106
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
905 |
* Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.) |
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
906 |
now consider the syntactic context of assumptions, giving a better |
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
907 |
chance to get type-inference of the arguments right (this is |
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
908 |
especially important for locales); |
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset
|
909 |
|
12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
910 |
* Pure: "sorry" no longer requires quick_and_dirty in interactive |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
911 |
mode; |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
912 |
|
12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
913 |
* Pure/obtain: the formal conclusion "thesis", being marked as |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
914 |
``internal'', may no longer be reference directly in the text; |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
915 |
potential INCOMPATIBILITY, may need to use "?thesis" in rare |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
916 |
situations; |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
917 |
|
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
918 |
* Pure: generic 'sym' attribute which declares a rule both as pure |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
919 |
'elim?' and for the 'symmetric' operation; |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
920 |
|
12877
b9635eb8a448
* Isar/Pure: marginal comments ``--'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset
|
921 |
* Pure: marginal comments ``--'' may now occur just anywhere in the |
b9635eb8a448
* Isar/Pure: marginal comments ``--'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset
|
922 |
text; the fixed correlation with particular command syntax has been |
b9635eb8a448
* Isar/Pure: marginal comments ``--'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset
|
923 |
discontinued; |
b9635eb8a448
* Isar/Pure: marginal comments ``--'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset
|
924 |
|
13023
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
925 |
* Pure: new method 'rules' is particularly well-suited for proof |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
926 |
search in intuitionistic logic; a bit slower than 'blast' or 'fast', |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
927 |
but often produces more compact proof terms with less detours; |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
928 |
|
12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
929 |
* Pure/Provers/classical: simplified integration with pure rule |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
930 |
attributes and methods; the classical "intro?/elim?/dest?" |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
931 |
declarations coincide with the pure ones; the "rule" method no longer |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
932 |
includes classically swapped intros; "intro" and "elim" methods no |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
933 |
longer pick rules from the context; also got rid of ML declarations |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
934 |
AddXIs/AddXEs/AddXDs; all of this has some potential for |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
935 |
INCOMPATIBILITY; |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
936 |
|
12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
937 |
* Provers/classical: attribute 'swapped' produces classical inversions |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
938 |
of introduction rules; |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
939 |
|
12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
940 |
* Provers/simplifier: 'simplified' attribute may refer to explicit |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
941 |
rules instead of full simplifier context; 'iff' attribute handles |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
942 |
conditional rules; |
11936
fef099613354
* Provers: 'simplified' attribute may refer to explicit rules instead
wenzelm
parents:
11933
diff
changeset
|
943 |
|
11745
06cd8c3b5487
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm
parents:
11738
diff
changeset
|
944 |
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms; |
06cd8c3b5487
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm
parents:
11738
diff
changeset
|
945 |
|
11690 | 946 |
* HOL: 'recdef' now fails on unfinished automated proofs, use |
11633 | 947 |
"(permissive)" option to recover old behavior; |
948 |
||
11933 | 949 |
* HOL: 'inductive' no longer features separate (collective) attributes |
950 |
for 'intros' (was found too confusing); |
|
951 |
||
12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
952 |
* HOL: properly declared induction rules less_induct and |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
953 |
wf_induct_rule; |
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset
|
954 |
|
11788
60054fee3c16
canonical 'cases'/'induct' rules for n-tuples (n=3..7)
kleing
parents:
11745
diff
changeset
|
955 |
|
11474 | 956 |
*** HOL *** |
957 |
||
11702 | 958 |
* HOL: moved over to sane numeral syntax; the new policy is as |
959 |
follows: |
|
960 |
||
961 |
- 0 and 1 are polymorphic constants, which are defined on any |
|
962 |
numeric type (nat, int, real etc.); |
|
963 |
||
964 |
- 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based |
|
965 |
binary representation internally; |
|
966 |
||
967 |
- type nat has special constructor Suc, and generally prefers Suc 0 |
|
968 |
over 1::nat and Suc (Suc 0) over 2::nat; |
|
969 |
||
12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
970 |
This change may cause significant problems of INCOMPATIBILITY; here |
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset
|
971 |
are some hints on converting existing sources: |
11702 | 972 |
|
973 |
- due to the new "num" token, "-0" and "-1" etc. are now atomic |
|
974 |
entities, so expressions involving "-" (unary or binary minus) need |
|
975 |
to be spaced properly; |
|
976 |
||
977 |
- existing occurrences of "1" may need to be constraint "1::nat" or |
|
978 |
even replaced by Suc 0; similar for old "2"; |
|
979 |
||
980 |
- replace "#nnn" by "nnn", and "#-nnn" by "-nnn"; |
|
981 |
||
982 |
- remove all special provisions on numerals in proofs; |
|
983 |
||
13042 | 984 |
* HOL: simp rules nat_number expand numerals on nat to Suc/0 |
12837 | 985 |
representation (depends on bin_arith_simps in the default context); |
986 |
||
12736 | 987 |
* HOL: symbolic syntax for x^2 (numeral 2); |
988 |
||
12335
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
989 |
* HOL: the class of all HOL types is now called "type" rather than |
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
990 |
"term"; INCOMPATIBILITY, need to adapt references to this type class |
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
991 |
in axclass/classes, instance/arities, and (usually rare) occurrences |
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
992 |
in typings (of consts etc.); internally the class is called |
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
993 |
"HOL.type", ML programs should refer to HOLogic.typeS; |
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset
|
994 |
|
12280 | 995 |
* HOL/record package improvements: |
996 |
- new derived operations "fields" to build a partial record section, |
|
997 |
"extend" to promote a fixed record to a record scheme, and |
|
998 |
"truncate" for the reverse; cf. theorems "xxx.defs", which are *not* |
|
999 |
declared as simp by default; |
|
12587
3f3d2ffb5df5
HOL/record: shared operations ("more", "fields", etc.) now need to be
wenzelm
parents:
12564
diff
changeset
|
1000 |
- shared operations ("more", "fields", etc.) now need to be always |
3f3d2ffb5df5
HOL/record: shared operations ("more", "fields", etc.) now need to be
wenzelm
parents:
12564
diff
changeset
|
1001 |
qualified) --- potential INCOMPATIBILITY; |
12280 | 1002 |
- removed "make_scheme" operations (use "make" with "extend") -- |
1003 |
INCOMPATIBILITY; |
|
11937 | 1004 |
- removed "more" class (simply use "term") -- INCOMPATIBILITY; |
12253 | 1005 |
- provides cases/induct rules for use with corresponding Isar |
1006 |
methods (for concrete records, record schemes, concrete more |
|
12280 | 1007 |
parts, and schematic more parts -- in that order); |
11930 | 1008 |
- internal definitions directly based on a light-weight abstract |
1009 |
theory of product types over typedef rather than datatype; |
|
1010 |
||
13023
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
1011 |
* HOL: generic code generator for generating executable ML code from |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
1012 |
specifications; specific support for HOL constructs such as inductive |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
1013 |
datatypes and sets, as well as recursive functions; can be invoked |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
1014 |
via 'generate_code' theory section; |
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset
|
1015 |
|
11933 | 1016 |
* HOL: canonical cases/induct rules for n-tuples (n = 3..7); |
1017 |
||
13824 | 1018 |
* HOL: consolidated and renamed several theories. In particular: |
14731 | 1019 |
Ord.thy has been absorbed into HOL.thy |
1020 |
String.thy has been absorbed into List.thy |
|
1021 |
||
11802
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset
|
1022 |
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A" |
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset
|
1023 |
(beware of argument permutation!); |
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset
|
1024 |
|
11657 | 1025 |
* HOL: linorder_less_split superseded by linorder_cases; |
1026 |
||
12917 | 1027 |
* HOL/List: "nodups" renamed to "distinct"; |
12889 | 1028 |
|
11633 | 1029 |
* HOL: added "The" definite description operator; move Hilbert's "Eps" |
13824 | 1030 |
to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES: |
1031 |
- Ex_def has changed, now need to use some_eq_ex |
|
11437 | 1032 |
|
11572 | 1033 |
* HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so |
1034 |
in this (rare) case use: |
|
1035 |
||
1036 |
delSWrapper "split_all_tac" |
|
1037 |
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) |
|
1038 |
||
1039 |
* HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS |
|
11474 | 1040 |
MAY FAIL; |
11361 | 1041 |
|
11572 | 1042 |
* HOL: introduced f^n = f o ... o f; warning: due to the limits of |
1043 |
Isabelle's type classes, ^ on functions and relations has too general |
|
1044 |
a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be |
|
1045 |
necessary to attach explicit type constraints; |
|
11307 | 1046 |
|
12917 | 1047 |
* HOL/Relation: the prefix name of the infix "O" has been changed from |
1048 |
"comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been |
|
1049 |
renamed accordingly (eg "compI" -> "rel_compI"). |
|
12489 | 1050 |
|
11487
95071c9e85a3
* HOL: syntax translations now work properly with numerals and records
wenzelm
parents:
11475
diff
changeset
|
1051 |
* HOL: syntax translations now work properly with numerals and records |
95071c9e85a3
* HOL: syntax translations now work properly with numerals and records
wenzelm
parents:
11475
diff
changeset
|
1052 |
expressions; |
11474 | 1053 |
|
12457
cbfc53e45476
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm
parents:
12405
diff
changeset
|
1054 |
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead |
cbfc53e45476
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm
parents:
12405
diff
changeset
|
1055 |
of "lam" -- INCOMPATIBILITY; |
11474 | 1056 |
|
11933 | 1057 |
* HOL: got rid of some global declarations (potential INCOMPATIBILITY |
1058 |
for ML tools): const "()" renamed "Product_Type.Unity", type "unit" |
|
1059 |
renamed "Product_Type.unit"; |
|
11611 | 1060 |
|
12564 | 1061 |
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl |
1062 |
||
12924 | 1063 |
* HOL: removed obsolete theorem "optionE" (use "option.exhaust", or |
1064 |
the "cases" method); |
|
1065 |
||
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
1066 |
* HOL/GroupTheory: group theory examples including Sylow's theorem (by |
15154 | 1067 |
Florian Kammller); |
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
1068 |
|
12608
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
1069 |
* HOL/IMP: updated and converted to new-style theory format; several |
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
1070 |
parts turned into readable document, with proper Isar proof texts and |
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
1071 |
some explanations (by Gerwin Klein); |
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
1072 |
|
12734 | 1073 |
* HOL-Real: added Complex_Numbers (by Gertrud Bauer); |
1074 |
||
12690 | 1075 |
* HOL-Hyperreal is now a logic image; |
1076 |
||
11611 | 1077 |
|
12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
1078 |
*** HOLCF *** |
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
1079 |
|
12622 | 1080 |
* Isar: consts/constdefs supports mixfix syntax for continuous |
1081 |
operations; |
|
1082 |
||
1083 |
* Isar: domain package adapted to new-style theory format, e.g. see |
|
1084 |
HOLCF/ex/Dnat.thy; |
|
1085 |
||
1086 |
* theory Lift: proper use of rep_datatype lift instead of ML hacks -- |
|
12280 | 1087 |
potential INCOMPATIBILITY; now use plain induct_tac instead of former |
1088 |
lift.induct_tac, always use UU instead of Undef; |
|
12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
1089 |
|
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
1090 |
* HOLCF/IMP: updated and converted to new-style theory; |
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
1091 |
|
12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset
|
1092 |
|
11474 | 1093 |
*** ZF *** |
1094 |
||
12622 | 1095 |
* Isar: proper integration of logic-specific tools and packages, |
1096 |
including theory commands '(co)inductive', '(co)datatype', |
|
1097 |
'rep_datatype', 'inductive_cases', as well as methods 'ind_cases', |
|
1098 |
'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC'); |
|
1099 |
||
1100 |
* theory Main no longer includes AC; for the Axiom of Choice, base |
|
1101 |
your theory on Main_ZFC; |
|
1102 |
||
1103 |
* the integer library now covers quotients and remainders, with many |
|
1104 |
laws relating division to addition, multiplication, etc.; |
|
12563 | 1105 |
|
12280 | 1106 |
* ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a |
1107 |
typeless version of the formalism; |
|
1108 |
||
13025 | 1109 |
* ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory |
1110 |
format; |
|
12608
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
1111 |
|
12280 | 1112 |
* ZF/Induct: new directory for examples of inductive definitions, |
12608
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
1113 |
including theory Multiset for multiset orderings; converted to |
2df381faa787
* ZF/IMP: updated and converted to new-style theory format;
wenzelm
parents:
12597
diff
changeset
|
1114 |
new-style theory format; |
12177
b1c16d685a99
* ZF: new-style theory commands 'inductive', 'inductive_cases', and
wenzelm
parents:
12163
diff
changeset
|
1115 |
|
13025 | 1116 |
* ZF: many new theorems about lists, ordinals, etc.; |
12850 | 1117 |
|
11474 | 1118 |
|
1119 |
*** General *** |
|
1120 |
||
12280 | 1121 |
* Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference |
1122 |
variable proof controls level of detail: 0 = no proofs (only oracle |
|
1123 |
dependencies), 1 = lemma dependencies, 2 = compact proof terms; see |
|
1124 |
also ref manual for further ML interfaces; |
|
1125 |
||
1126 |
* Pure/axclass: removed obsolete ML interface |
|
1127 |
goal_subclass/goal_arity; |
|
1128 |
||
1129 |
* Pure/syntax: new token syntax "num" for plain numerals (without "#" |
|
1130 |
of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now |
|
1131 |
separate tokens, so expressions involving minus need to be spaced |
|
1132 |
properly; |
|
1133 |
||
12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
1134 |
* Pure/syntax: support non-oriented infixes, using keyword "infix" |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
1135 |
rather than "infixl" or "infixr"; |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
1136 |
|
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
1137 |
* Pure/syntax: concrete syntax for dummy type variables admits genuine |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
1138 |
sort constraint specifications in type inference; e.g. "x::_::foo" |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
1139 |
ensures that the type of "x" is of sort "foo" (but not necessarily a |
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset
|
1140 |
type variable); |
12280 | 1141 |
|
1142 |
* Pure/syntax: print modes "type_brackets" and "no_type_brackets" |
|
1143 |
control output of nested => (types); the default behavior is |
|
1144 |
"type_brackets"; |
|
1145 |
||
1146 |
* Pure/syntax: builtin parse translation for "_constify" turns valued |
|
11817 | 1147 |
tokens into AST constants; |
11474 | 1148 |
|
12280 | 1149 |
* Pure/syntax: prefer later declarations of translations and print |
1150 |
translation functions; potential INCOMPATIBILITY: need to reverse |
|
1151 |
multiple declarations for same syntax element constant; |
|
1152 |
||
12832
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset
|
1153 |
* Pure/show_hyps reset by default (in accordance to existing Isar |
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset
|
1154 |
practice); |
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset
|
1155 |
|
12280 | 1156 |
* Provers/classical: renamed addaltern to addafter, addSaltern to |
1157 |
addSafter; |
|
1158 |
||
1159 |
* Provers/clasimp: ``iff'' declarations now handle conditional rules |
|
1160 |
as well; |
|
12253 | 1161 |
|
12538 | 1162 |
* system: tested support for MacOS X; should be able to get Isabelle + |
1163 |
Proof General to work in a plain Terminal after installing Poly/ML |
|
1164 |
(e.g. from the Isabelle distribution area) and GNU bash alone |
|
1165 |
(e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol |
|
1166 |
support requires further installations, e.g. from |
|
1167 |
http://fink.sourceforge.net/); |
|
1168 |
||
12280 | 1169 |
* system: support Poly/ML 4.1.1 (able to manage larger heaps); |
11551 | 1170 |
|
12753
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset
|
1171 |
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead |
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset
|
1172 |
of 40 MB), cf. ML_OPTIONS; |
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset
|
1173 |
|
11633 | 1174 |
* system: Proof General keywords specification is now part of the |
1175 |
Isabelle distribution (see etc/isar-keywords.el); |
|
1176 |
||
12728 | 1177 |
* system: support for persistent Proof General sessions (refrain from |
1178 |
outdating all loaded theories on startup); user may create writable |
|
1179 |
logic images like this: ``isabelle -q HOL Test''; |
|
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset
|
1180 |
|
11551 | 1181 |
* system: smart selection of Isabelle process versus Isabelle |
11572 | 1182 |
interface, accommodates case-insensitive file systems (e.g. HFS+); may |
1183 |
run both "isabelle" and "Isabelle" even if file names are badly |
|
1184 |
damaged (executable inspects the case of the first letter of its own |
|
1185 |
name); added separate "isabelle-process" and "isabelle-interface"; |
|
11551 | 1186 |
|
12472 | 1187 |
* system: refrain from any attempt at filtering input streams; no |
1188 |
longer support ``8bit'' encoding of old isabelle font, instead proper |
|
1189 |
iso-latin characters may now be used; the related isatools |
|
1190 |
"symbolinput" and "nonascii" have disappeared as well; |
|
1191 |
||
1192 |
* system: removed old "xterm" interface (the print modes "xterm" and |
|
1193 |
"xterm_color" are still available for direct use in a suitable |
|
1194 |
terminal); |
|
1195 |
||
11314 | 1196 |
|
11169
98c2f741e32b
made split_all_tac safe introducing safe_full_simp_tac, EXISTING PROOFS MAY FAIL
oheimb
parents:
11130
diff
changeset
|
1197 |
|
11062 | 1198 |
New in Isabelle99-2 (February 2001) |
1199 |
----------------------------------- |
|
1200 |
||
10224 | 1201 |
*** Overview of INCOMPATIBILITIES *** |
1202 |
||
11241 | 1203 |
* HOL: please note that theories in the Library and elsewhere often use the |
1204 |
new-style (Isar) format; to refer to their theorems in an ML script you must |
|
12622 | 1205 |
bind them to ML identifers by e.g. val thm_name = thm "thm_name"; |
11241 | 1206 |
|
11043
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset
|
1207 |
* HOL: inductive package no longer splits induction rule aggressively, |
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset
|
1208 |
but only as far as specified by the introductions given; the old |
11130 | 1209 |
format may be recovered via ML function complete_split_rule or attribute |
11043
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset
|
1210 |
'split_rule (complete)'; |
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset
|
1211 |
|
10998 | 1212 |
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, |
1213 |
gfp_Tarski to gfp_unfold; |
|
10224 | 1214 |
|
10288 | 1215 |
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; |
1216 |
||
10858 | 1217 |
* HOL: infix "dvd" now has priority 50 rather than 70 (because it is a |
1218 |
relation); infix "^^" has been renamed "``"; infix "``" has been |
|
1219 |
renamed "`"; "univalent" has been renamed "single_valued"; |
|
10793 | 1220 |
|
10998 | 1221 |
* HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse" |
1222 |
operation; |
|
1223 |
||
10868 | 1224 |
* HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>; |
10856 | 1225 |
|
10391 | 1226 |
* Isar: 'obtain' no longer declares "that" fact as simp/intro; |
1227 |
||
10401
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
1228 |
* Isar/HOL: method 'induct' now handles non-atomic goals; as a |
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
1229 |
consequence, it is no longer monotonic wrt. the local goal context |
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
1230 |
(which is now passed through the inductive cases); |
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
1231 |
|
10976
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset
|
1232 |
* Document preparation: renamed standard symbols \<ll> to \<lless> and |
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset
|
1233 |
\<gg> to \<ggreater>; |
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset
|
1234 |
|
10224 | 1235 |
|
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
1236 |
*** Document preparation *** |
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
1237 |
|
10858 | 1238 |
* \isabellestyle{NAME} selects version of Isabelle output (currently |
1239 |
available: are "it" for near math-mode best-style output, "sl" for |
|
1240 |
slanted text style, and "tt" for plain type-writer; if no |
|
1241 |
\isabellestyle command is given, output is according to slanted |
|
1242 |
type-writer); |
|
1243 |
||
10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset
|
1244 |
* support sub/super scripts (for single symbols only), input syntax is |
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset
|
1245 |
like this: "A\<^sup>*" or "A\<^sup>\<star>"; |
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset
|
1246 |
|
10858 | 1247 |
* some more standard symbols; see Appendix A of the system manual for |
11062 | 1248 |
the complete list of symbols defined in isabellesym.sty; |
10858 | 1249 |
|
10998 | 1250 |
* improved isabelle style files; more abstract symbol implementation |
1251 |
(should now use \isamath{...} and \isatext{...} in custom symbol |
|
1252 |
definitions); |
|
1253 |
||
10634 | 1254 |
* antiquotation @{goals} and @{subgoals} for output of *dynamic* goals |
1255 |
state; Note that presentation of goal states does not conform to |
|
1256 |
actual human-readable proof documents. Please do not include goal |
|
1257 |
states into document output unless you really know what you are doing! |
|
10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset
|
1258 |
|
11062 | 1259 |
* proper indentation of antiquoted output with proportional LaTeX |
1260 |
fonts; |
|
10862 | 1261 |
|
11050
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset
|
1262 |
* no_document ML operator temporarily disables LaTeX document |
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset
|
1263 |
generation; |
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset
|
1264 |
|
11062 | 1265 |
* isatool unsymbolize tunes sources for plain ASCII communication; |
1266 |
||
10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset
|
1267 |
|
10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset
|
1268 |
*** Isar *** |
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset
|
1269 |
|
10547 | 1270 |
* Pure: Isar now suffers initial goal statements to contain unbound |
1271 |
schematic variables (this does not conform to actual readable proof |
|
1272 |
documents, due to unpredictable outcome and non-compositional proof |
|
1273 |
checking); users who know what they are doing may use schematic goals |
|
1274 |
for Prolog-style synthesis of proven results; |
|
1275 |
||
10391 | 1276 |
* Pure: assumption method (an implicit finishing) now handles actual |
1277 |
rules as well; |
|
1278 |
||
1279 |
* Pure: improved 'obtain' --- moved to Pure, insert "that" into |
|
1280 |
initial goal, declare "that" only as Pure intro (only for single |
|
1281 |
steps); the "that" rule assumption may now be involved in implicit |
|
1282 |
finishing, thus ".." becomes a feasible for trivial obtains; |
|
1283 |
||
1284 |
* Pure: default proof step now includes 'intro_classes'; thus trivial |
|
1285 |
instance proofs may be performed by ".."; |
|
1286 |
||
1287 |
* Pure: ?thesis / ?this / "..." now work for pure meta-level |
|
1288 |
statements as well; |
|
10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset
|
1289 |
|
11097 | 1290 |
* Pure: more robust selection of calculational rules; |
1291 |
||
10858 | 1292 |
* Pure: the builtin notion of 'finished' goal now includes the ==-refl |
1293 |
rule (as well as the assumption rule); |
|
1294 |
||
1295 |
* Pure: 'thm_deps' command visualizes dependencies of theorems and |
|
1296 |
lemmas, using the graph browser tool; |
|
1297 |
||
10944 | 1298 |
* Pure: predict failure of "show" in interactive mode; |
1299 |
||
11016
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset
|
1300 |
* Pure: 'thms_containing' now takes actual terms as arguments; |
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset
|
1301 |
|
10401
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
1302 |
* HOL: improved method 'induct' --- now handles non-atomic goals |
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
1303 |
(potential INCOMPATIBILITY); tuned error handling; |
58bb50f69497
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm
parents:
10391
diff
changeset
|
1304 |
|
10557 | 1305 |
* HOL: cases and induct rules now provide explicit hints about the |
10547 | 1306 |
number of facts to be consumed (0 for "type" and 1 for "set" rules); |
1307 |
any remaining facts are inserted into the goal verbatim; |
|
1308 |
||
10858 | 1309 |
* HOL: local contexts (aka cases) may now contain term bindings as |
1310 |
well; the 'cases' and 'induct' methods new provide a ?case binding for |
|
1311 |
the result to be shown in each case; |
|
1312 |
||
10770 | 1313 |
* HOL: added 'recdef_tc' command; |
1314 |
||
11016
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset
|
1315 |
* isatool convert assists in eliminating legacy ML scripts; |
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset
|
1316 |
|
10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset
|
1317 |
|
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
1318 |
*** HOL *** |
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
1319 |
|
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
1320 |
* HOL/Library: a collection of generic theories to be used together |
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
1321 |
with main HOL; the theory loader path already includes this directory |
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
1322 |
by default; the following existing theories have been moved here: |
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
1323 |
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While |
10337 | 1324 |
(as While_Combinator), HOL/Lex/Prefix (as List_Prefix); |
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
1325 |
|
10966 | 1326 |
* HOL/Unix: "Some aspects of Unix file-system security", a typical |
1327 |
modelling and verification task performed in Isabelle/HOL + |
|
1328 |
Isabelle/Isar + Isabelle document preparation (by Markus Wenzel). |
|
1329 |
||
11094 | 1330 |
* HOL/Algebra: special summation operator SUM no longer exists, it has |
1331 |
been replaced by setsum; infix 'assoc' now has priority 50 (like |
|
1332 |
'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to |
|
1333 |
'domain', this makes the theory consistent with mathematical |
|
1334 |
literature; |
|
1335 |
||
10514 | 1336 |
* HOL basics: added overloaded operations "inverse" and "divide" |
10726 | 1337 |
(infix "/"), syntax for generic "abs" operation, generic summation |
11094 | 1338 |
operator \<Sum>; |
10452
abeefb0a79ae
* added overloaded operations "inverse" and "divide" (infix "/");
wenzelm
parents:
10428
diff
changeset
|
1339 |
|
10391 | 1340 |
* HOL/typedef: simplified package, provide more useful rules (see also |
1341 |
HOL/subset.thy); |
|
1342 |
||
10915
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
1343 |
* HOL/datatype: induction rule for arbitrarily branching datatypes is |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
1344 |
now expressed as a proper nested rule (old-style tactic scripts may |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
1345 |
require atomize_strip_tac to cope with non-atomic premises); |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
1346 |
|
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
1347 |
* HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
1348 |
to "split_conv" (old name still available for compatibility); |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
1349 |
|
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
1350 |
* HOL: improved concrete syntax for strings (e.g. allows translation |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
1351 |
rules with string literals); |
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset
|
1352 |
|
12245 | 1353 |
* HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals |
1354 |
and Fleuriot's mechanization of analysis, including the transcendental |
|
1355 |
functions for the reals; |
|
10756 | 1356 |
|
11094 | 1357 |
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification; |
10391 | 1358 |
|
10858 | 1359 |
|
10474 | 1360 |
*** CTT *** |
1361 |
||
10547 | 1362 |
* CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that |
1363 |
"lam" is displayed as TWO lambda-symbols |
|
10474 | 1364 |
|
10547 | 1365 |
* CTT: theory Main now available, containing everything (that is, Bool |
1366 |
and Arith); |
|
1367 |
||
10474 | 1368 |
|
10391 | 1369 |
*** General *** |
1370 |
||
10547 | 1371 |
* Pure: the Simplifier has been implemented properly as a derived rule |
1372 |
outside of the actual kernel (at last!); the overall performance |
|
1373 |
penalty in practical applications is about 50%, while reliability of |
|
1374 |
the Isabelle inference kernel has been greatly improved; |
|
1375 |
||
11112 | 1376 |
* print modes "brackets" and "no_brackets" control output of nested => |
1377 |
(types) and ==> (props); the default behaviour is "brackets"; |
|
1378 |
||
10391 | 1379 |
* Provers: fast_tac (and friends) now handle actual object-logic rules |
1380 |
as assumptions as well; |
|
1381 |
||
11124 | 1382 |
* system: support Poly/ML 4.0; |
1383 |
||
1384 |
* system: isatool install handles KDE version 1 or 2; |
|
1385 |
||
10391 | 1386 |
|
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset
|
1387 |
|
10103 | 1388 |
New in Isabelle99-1 (October 2000) |
1389 |
---------------------------------- |
|
8015 | 1390 |
|
10003 | 1391 |
*** Overview of INCOMPATIBILITIES *** |
8014 | 1392 |
|
8848 | 1393 |
* HOL: simplification of natural numbers is much changed; to partly |
1394 |
recover the old behaviour (e.g. to prevent n+n rewriting to #2*n) |
|
1395 |
issue the following ML commands: |
|
1396 |
||
1397 |
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals; |
|
1398 |
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals]; |
|
8788 | 1399 |
|
10129 | 1400 |
* HOL: simplification no longer dives into case-expressions; this is |
1401 |
controlled by "t.weak_case_cong" for each datatype t; |
|
10003 | 1402 |
|
1403 |
* HOL: nat_less_induct renamed to less_induct; |
|
1404 |
||
1405 |
* HOL: systematic renaming of the SOME (Eps) rules, may use isatool |
|
1406 |
fixsome to patch .thy and .ML sources automatically; |
|
8967 | 1407 |
|
10003 | 1408 |
select_equality -> some_equality |
1409 |
select_eq_Ex -> some_eq_ex |
|
1410 |
selectI2EX -> someI2_ex |
|
1411 |
selectI2 -> someI2 |
|
1412 |
selectI -> someI |
|
1413 |
select1_equality -> some1_equality |
|
1414 |
Eps_sym_eq -> some_sym_eq_trivial |
|
1415 |
Eps_eq -> some_eq_trivial |
|
1416 |
||
1417 |
* HOL: exhaust_tac on datatypes superceded by new generic case_tac; |
|
1418 |
||
1419 |
* HOL: removed obsolete theorem binding expand_if (refer to split_if |
|
1420 |
instead); |
|
1421 |
||
1422 |
* HOL: the recursion equations generated by 'recdef' are now called |
|
1423 |
f.simps instead of f.rules; |
|
1424 |
||
1425 |
* HOL: qed_spec_mp now also handles bounded ALL as well; |
|
1426 |
||
1427 |
* HOL: 0 is now overloaded, so the type constraint ":: nat" may |
|
1428 |
sometimes be needed; |
|
1429 |
||
1430 |
* HOL: the constant for "f``x" is now "image" rather than "op ``"; |
|
8014 | 1431 |
|
10065 | 1432 |
* HOL: the constant for "f-``x" is now "vimage" rather than "op -``"; |
1433 |
||
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
1434 |
* HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
1435 |
product is now "<*>" instead of "Times"; the lexicographic product is |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
1436 |
now "<*lex*>" instead of "**"; |
8705 | 1437 |
|
10003 | 1438 |
* HOL: theory Sexp is now in HOL/Induct examples (it used to be part |
1439 |
of main HOL, but was unused); better use HOL's datatype package; |
|
9971 | 1440 |
|
10137
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
1441 |
* HOL: removed "symbols" syntax for constant "override" of theory Map; |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
1442 |
the old syntax may be recovered as follows: |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
1443 |
|
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
1444 |
syntax (symbols) |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
1445 |
override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)" |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
1446 |
(infixl "\\<oplus>" 100) |
d1c2bef01e2f
removed "symbols" syntax for constant "override";
wenzelm
parents:
10129
diff
changeset
|
1447 |
|
8848 | 1448 |
* HOL/Real: "rabs" replaced by overloaded "abs" function; |
1449 |
||
8887
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset
|
1450 |
* HOL/ML: even fewer consts are declared as global (see theories Ord, |
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset
|
1451 |
Lfp, Gfp, WF); this only affects ML packages that refer to const names |
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset
|
1452 |
internally; |
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset
|
1453 |
|
10003 | 1454 |
* HOL and ZF: syntax for quotienting wrt an equivalence relation |
1455 |
changed from A/r to A//r; |
|
9908 | 1456 |
|
10003 | 1457 |
* ZF: new treatment of arithmetic (nat & int) may break some old |
1458 |
proofs; |
|
8921
7c04c98132c4
* Pure: changed syntax of local blocks from {{ }} to { };
wenzelm
parents:
8887
diff
changeset
|
1459 |
|
10003 | 1460 |
* Isar: renamed some attributes (RS -> THEN, simplify -> simplified, |
1461 |
rulify -> rule_format, elimify -> elim_format, ...); |
|
9542 | 1462 |
|
9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
1463 |
* Isar/Provers: intro/elim/dest attributes changed; renamed |
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
1464 |
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one |
9937 | 1465 |
should have to change intro!! to intro? only); replaced "delrule" by |
1466 |
"rule del"; |
|
9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset
|
1467 |
|
9612 | 1468 |
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions; |
1469 |
||
9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset
|
1470 |
* Provers: strengthened force_tac by using new first_best_tac; |
9402 | 1471 |
|
10003 | 1472 |
* LaTeX document preparation: several changes of isabelle.sty (see |
1473 |
lib/texinputs); |
|
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
1474 |
|
8014 | 1475 |
|
8487 | 1476 |
*** Document preparation *** |
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
1477 |
|
9198
0ab3c81e9425
* formal comments (text blocks etc.) in new-style theories may now
wenzelm
parents:
9185
diff
changeset
|
1478 |
* formal comments (text blocks etc.) in new-style theories may now |
9753 | 1479 |
contain antiquotations of thm/prop/term/typ/text to be presented |
1480 |
according to latex print mode; concrete syntax is like this: |
|
1481 |
@{term[show_types] "f(x) = a + x"}; |
|
9198
0ab3c81e9425
* formal comments (text blocks etc.) in new-style theories may now
wenzelm
parents:
9185
diff
changeset
|
1482 |
|
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
1483 |
* isatool mkdir provides easy setup of Isabelle session directories, |
8518 | 1484 |
including proper document sources; |
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
1485 |
|
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
1486 |
* generated LaTeX sources are now deleted after successful run |
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
1487 |
(isatool document -c); may retain a copy somewhere else via -D option |
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
1488 |
of isatool usedir; |
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
1489 |
|
8566 | 1490 |
* isatool usedir -D now lets isatool latex -o sty update the Isabelle |
10003 | 1491 |
style files, achieving self-contained LaTeX sources and simplifying |
1492 |
LaTeX debugging; |
|
8566 | 1493 |
|
8518 | 1494 |
* old-style theories now produce (crude) LaTeX output as well; |
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
1495 |
|
9057
af1ca1acf292
* browser info session directories are now self-contained (may be put
wenzelm
parents:
9052
diff
changeset
|
1496 |
* browser info session directories are now self-contained (may be put |
9437
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset
|
1497 |
on WWW server seperately); improved graphs of nested sessions; removed |
93e91040c286
* Isar/Provers: intro/elim/dest attributes: changed
wenzelm
parents:
9402
diff
changeset
|
1498 |
graph for 'all sessions'; |
9057
af1ca1acf292
* browser info session directories are now self-contained (may be put
wenzelm
parents:
9052
diff
changeset
|
1499 |
|
10003 | 1500 |
* several improvements in isabelle style files; \isabellestyle{it} |
1501 |
produces fake math mode output; \isamarkupheader is now \section by |
|
1502 |
default; see lib/texinputs/isabelle.sty etc.; |
|
9489
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
1503 |
|
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
1504 |
|
8184 | 1505 |
*** Isar *** |
1506 |
||
10003 | 1507 |
* Isar/Pure: local results and corresponding term bindings are now |
1508 |
subject to Hindley-Milner polymorphism (similar to ML); this |
|
1509 |
accommodates incremental type-inference very nicely; |
|
8283
0a319c5746eb
* Pure now provides its own version of intro/elim/dest attributes;
wenzelm
parents:
8271
diff
changeset
|
1510 |
|
10003 | 1511 |
* Isar/Pure: new derived language element 'obtain' supports |
1512 |
generalized existence reasoning; |
|
8621
8ba0f90f6f35
* Isar/Pure: local results and corresponding term bindings are now
wenzelm
parents:
8603
diff
changeset
|
1513 |
|
10003 | 1514 |
* Isar/Pure: new calculational elements 'moreover' and 'ultimately' |
1515 |
support accumulation of results, without applying any rules yet; |
|
1516 |
useful to collect intermediate results without explicit name |
|
1517 |
references, and for use with transitivity rules with more than 2 |
|
1518 |
premises; |
|
8184 | 1519 |
|
10003 | 1520 |
* Isar/Pure: scalable support for case-analysis type proofs: new |
1521 |
'case' language element refers to local contexts symbolically, as |
|
1522 |
produced by certain proof methods; internally, case names are attached |
|
1523 |
to theorems as "tags"; |
|
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
1524 |
|
10003 | 1525 |
* Isar/Pure: theory command 'hide' removes declarations from |
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
1526 |
class/type/const name spaces; |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
1527 |
|
10003 | 1528 |
* Isar/Pure: theory command 'defs' supports option "(overloaded)" to |
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
1529 |
indicate potential overloading; |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
1530 |
|
10003 | 1531 |
* Isar/Pure: changed syntax of local blocks from {{ }} to { }; |
8621
8ba0f90f6f35
* Isar/Pure: local results and corresponding term bindings are now
wenzelm
parents:
8603
diff
changeset
|
1532 |
|
10003 | 1533 |
* Isar/Pure: syntax of sorts made 'inner', i.e. have to write |
1534 |
"{a,b,c}" instead of {a,b,c}; |
|
9011
0cfc347f8d19
Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms to
wenzelm
parents:
8994
diff
changeset
|
1535 |
|
10003 | 1536 |
* Isar/Pure now provides its own version of intro/elim/dest |
1537 |
attributes; useful for building new logics, but beware of confusion |
|
1538 |
with the version in Provers/classical; |
|
9612 | 1539 |
|
10003 | 1540 |
* Isar/Pure: the local context of (non-atomic) goals is provided via |
1541 |
case name 'antecedent'; |
|
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
1542 |
|
10003 | 1543 |
* Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms |
1544 |
to the current context is now done automatically); |
|
9383
c21fa1c48de0
* HOL: removed obsolete expand_if = split_if; theorems if_splits =
wenzelm
parents:
9349
diff
changeset
|
1545 |
|
10003 | 1546 |
* Isar/Pure: theory command 'method_setup' provides a simple interface |
1547 |
for definining proof methods in ML; |
|
9612 | 1548 |
|
10003 | 1549 |
* Isar/Provers: intro/elim/dest attributes changed; renamed |
9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
1550 |
intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in |
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
1551 |
most cases, one should have to change intro!! to intro? only); |
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
1552 |
replaced "delrule" by "rule del"; |
8283
0a319c5746eb
* Pure now provides its own version of intro/elim/dest attributes;
wenzelm
parents:
8271
diff
changeset
|
1553 |
|
10003 | 1554 |
* Isar/Provers: new 'hypsubst' method, plain 'subst' method and |
1555 |
'symmetric' attribute (the latter supercedes [RS sym]); |
|
1556 |
||
1557 |
* Isar/Provers: splitter support (via 'split' attribute and 'simp' |
|
1558 |
method modifier); 'simp' method: 'only:' modifier removes loopers as |
|
1559 |
well (including splits); |
|
1560 |
||
1561 |
* Isar/Provers: Simplifier and Classical methods now support all kind |
|
1562 |
of modifiers used in the past, including 'cong', 'iff', etc. |
|
1563 |
||
1564 |
* Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination |
|
1565 |
of Simplifier and Classical reasoner); |
|
1566 |
||
1567 |
* Isar/HOL: new proof method 'cases' and improved version of 'induct' |
|
1568 |
now support named cases; major packages (inductive, datatype, primrec, |
|
1569 |
recdef) support case names and properly name parameters; |
|
9612 | 1570 |
|
10003 | 1571 |
* Isar/HOL: new transitivity rules for substitution in inequalities -- |
1572 |
monotonicity conditions are extracted to be proven at end of |
|
1573 |
calculations; |
|
1574 |
||
1575 |
* Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof |
|
1576 |
method anyway; |
|
1577 |
||
1578 |
* Isar/HOL: removed old expand_if = split_if; theorems if_splits = |
|
1579 |
split_if split_if_asm; datatype package provides theorems foo.splits = |
|
1580 |
foo.split foo.split_asm for each datatype; |
|
1581 |
||
1582 |
* Isar/HOL: tuned inductive package, rename "intrs" to "intros" |
|
1583 |
(potential INCOMPATIBILITY), emulation of mk_cases feature for proof |
|
1584 |
scripts: new 'inductive_cases' command and 'ind_cases' method; (Note: |
|
1585 |
use "(cases (simplified))" method in proper proof texts); |
|
1586 |
||
1587 |
* Isar/HOL: added global 'arith_split' attribute for 'arith' method; |
|
1588 |
||
1589 |
* Isar: names of theorems etc. may be natural numbers as well; |
|
1590 |
||
1591 |
* Isar: 'pr' command: optional arguments for goals_limit and |
|
9724
2030c5d63741
* 'pr' command: optional argument for ProofContext.prems_limit;
wenzelm
parents:
9709
diff
changeset
|
1592 |
ProofContext.prems_limit; no longer prints theory contexts, but only |
2030c5d63741
* 'pr' command: optional argument for ProofContext.prems_limit;
wenzelm
parents:
9709
diff
changeset
|
1593 |
proof states; |
8487 | 1594 |
|
10003 | 1595 |
* Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit |
8518 | 1596 |
additional print modes to be specified; e.g. "pr(latex)" will print |
1597 |
proof state according to the Isabelle LaTeX style; |
|
8487 | 1598 |
|
10003 | 1599 |
* Isar: improved support for emulating tactic scripts, including proof |
9612 | 1600 |
methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac', |
1601 |
'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac' |
|
1602 |
(for HOL datatypes); |
|
8534 | 1603 |
|
10003 | 1604 |
* Isar: simplified (more robust) goal selection of proof methods: 1st |
1605 |
goal, all goals, or explicit goal specifier (tactic emulation); thus |
|
1606 |
'proof method scripts' have to be in depth-first order; |
|
8673
987ea1a559d0
Isar: simplified (more robust) goal selection of proof methods;
wenzelm
parents:
8655
diff
changeset
|
1607 |
|
10003 | 1608 |
* Isar: tuned 'let' syntax: replaced 'as' keyword by 'and'; |
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
1609 |
|
10003 | 1610 |
* Isar: removed 'help' command, which hasn't been too helpful anyway; |
1611 |
should instead use individual commands for printing items |
|
1612 |
(print_commands, print_methods etc.); |
|
9224
0da360494917
* Isar: removed 'help' command, which hasn't been too helpful anyway;
wenzelm
parents:
9198
diff
changeset
|
1613 |
|
10003 | 1614 |
* Isar: added 'nothing' --- the empty list of theorems; |
9239 | 1615 |
|
8184 | 1616 |
|
8014 | 1617 |
*** HOL *** |
1618 |
||
10080 | 1619 |
* HOL/MicroJava: formalization of a fragment of Java, together with a |
1620 |
corresponding virtual machine and a specification of its bytecode |
|
1621 |
verifier and a lightweight bytecode verifier, including proofs of |
|
1622 |
type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and |
|
1623 |
Cornelia Pusch (see also the homepage of project Bali at |
|
1624 |
http://isabelle.in.tum.de/Bali/); |
|
1625 |
||
8518 | 1626 |
* HOL/Algebra: new theory of rings and univariate polynomials, by |
1627 |
Clemens Ballarin; |
|
8014 | 1628 |
|
10157
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
1629 |
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese |
10003 | 1630 |
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M |
1631 |
Rasmussen; |
|
8570 | 1632 |
|
10157
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
1633 |
* HOL/Lattice: fundamental concepts of lattice theory and order |
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
1634 |
structures, including duals, properties of bounds versus algebraic |
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
1635 |
laws, lattice operations versus set-theoretic ones, the Knaster-Tarski |
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
1636 |
Theorem for complete lattices etc.; may also serve as a demonstration |
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
1637 |
for abstract algebraic reasoning using axiomatic type classes, and |
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
1638 |
mathematics-style proof in Isabelle/Isar; by Markus Wenzel; |
6d3987f3aad9
* HOL/Lattice: fundamental concepts of lattice theory and order structures;
wenzelm
parents:
10137
diff
changeset
|
1639 |
|
10003 | 1640 |
* HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David |
1641 |
von Oheimb; |
|
9542 | 1642 |
|
10164
c240747082aa
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm
parents:
10157
diff
changeset
|
1643 |
* HOL/IMPP: extension of IMP with local variables and mutually |
c240747082aa
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm
parents:
10157
diff
changeset
|
1644 |
recursive procedures, by David von Oheimb; |
c240747082aa
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm
parents:
10157
diff
changeset
|
1645 |
|
10003 | 1646 |
* HOL/Lambda: converted into new-style theory and document; |
9542 | 1647 |
|
10003 | 1648 |
* HOL/ex/Multiquote: example of multiple nested quotations and |
1649 |
anti-quotations -- basically a generalized version of de-Bruijn |
|
1650 |
representation; very useful in avoiding lifting of operations; |
|
8848 | 1651 |
|
9612 | 1652 |
* HOL/record: added general record equality rule to simpset; fixed |
1653 |
select-update simplification procedure to handle extended records as |
|
1654 |
well; admit "r" as field name; |
|
9542 | 1655 |
|
8967 | 1656 |
* HOL: 0 is now overloaded over the new sort "zero", allowing its use with |
1657 |
other numeric types and also as the identity of groups, rings, etc.; |
|
1658 |
||
1659 |
* HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity. |
|
1660 |
Types nat and int belong to this axclass; |
|
1661 |
||
10003 | 1662 |
* HOL: greatly improved simplification involving numerals of type nat, int, real: |
8788 | 1663 |
(i + #8 + j) = Suc k simplifies to #7 + (i + j) = k |
8832 | 1664 |
i*j + k + j*#3*i simplifies to #4*(i*j) + k |
1665 |
two terms #m*u and #n*u are replaced by #(m+n)*u |
|
1666 |
(where #m, #n and u can implicitly be 1; this is simproc combine_numerals) |
|
1667 |
and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y |
|
1668 |
or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals); |
|
8736 | 1669 |
|
10003 | 1670 |
* HOL: meson_tac is available (previously in ex/meson.ML); it is a |
1671 |
powerful prover for predicate logic but knows nothing of clasets; see |
|
1672 |
ex/mesontest.ML and ex/mesontest2.ML for example applications; |
|
9835 | 1673 |
|
8848 | 1674 |
* HOL: new version of "case_tac" subsumes both boolean case split and |
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
1675 |
"exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer |
8518 | 1676 |
exists, may define val exhaust_tac = case_tac for ad-hoc portability; |
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
1677 |
|
8848 | 1678 |
* HOL: simplification no longer dives into case-expressions: only the |
10129 | 1679 |
selector expression is simplified, but not the remaining arms; to |
1680 |
enable full simplification of case-expressions for datatype t, you may |
|
1681 |
remove t.weak_case_cong from the simpset, either globally (Delcongs |
|
1682 |
[thm"t.weak_case_cong"];) or locally (delcongs [...]). |
|
8603 | 1683 |
|
8848 | 1684 |
* HOL/recdef: the recursion equations generated by 'recdef' for |
1685 |
function 'f' are now called f.simps instead of f.rules; if all |
|
1686 |
termination conditions are proved automatically, these simplification |
|
1687 |
rules are added to the simpset, as in primrec; rules may be named |
|
1688 |
individually as well, resulting in a separate list of theorems for |
|
1689 |
each equation; |
|
1690 |
||
9489
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
1691 |
* HOL/While is a new theory that provides a while-combinator. It |
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
1692 |
permits the definition of tail-recursive functions without the |
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
1693 |
provision of a termination measure. The latter is necessary once the |
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
1694 |
invariant proof rule for while is applied. |
9457 | 1695 |
|
10003 | 1696 |
* HOL: new (overloaded) notation for the set of elements below/above |
1697 |
some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval. |
|
8925 | 1698 |
|
8848 | 1699 |
* HOL: theorems impI, allI, ballI bound as "strip"; |
1700 |
||
10003 | 1701 |
* HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic |
9746 | 1702 |
induct_tac th "x1 ... xn" expects th to have a conclusion of the form |
1703 |
P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th; |
|
1704 |
||
10003 | 1705 |
* HOL/Real: "rabs" replaced by overloaded "abs" function; |
9737 | 1706 |
|
10003 | 1707 |
* HOL: theory Sexp now in HOL/Induct examples (it used to be part of |
1708 |
main HOL, but was unused); |
|
8626 | 1709 |
|
10003 | 1710 |
* HOL: fewer consts declared as global (e.g. have to refer to |
1711 |
"Lfp.lfp" instead of "lfp" internally; affects ML packages only); |
|
8887
c0c583ce0b0b
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm
parents:
8848
diff
changeset
|
1712 |
|
10003 | 1713 |
* HOL: tuned AST representation of nested pairs, avoiding bogus output |
1714 |
in case of overlap with user translations (e.g. judgements over |
|
1715 |
tuples); (note that the underlying logical represenation is still |
|
1716 |
bogus); |
|
9349
d43669fb423d
* tuned AST representation of nested pairs, avoiding bogus output in
wenzelm
parents:
9335
diff
changeset
|
1717 |
|
8412 | 1718 |
|
9542 | 1719 |
*** ZF *** |
1720 |
||
10003 | 1721 |
* ZF: simplification automatically cancels common terms in arithmetic |
1722 |
expressions over nat and int; |
|
9542 | 1723 |
|
10003 | 1724 |
* ZF: new treatment of nat to minimize type-checking: all operators |
1725 |
coerce their operands to a natural number using the function natify, |
|
1726 |
making the algebraic laws unconditional; |
|
9542 | 1727 |
|
10003 | 1728 |
* ZF: as above, for int: operators coerce their operands to an integer |
1729 |
using the function intify; |
|
9542 | 1730 |
|
10003 | 1731 |
* ZF: the integer library now contains many of the usual laws for the |
1732 |
orderings, including $<=, and monotonicity laws for $+ and $*; |
|
9542 | 1733 |
|
10003 | 1734 |
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic |
1735 |
simplification; |
|
9388 | 1736 |
|
10003 | 1737 |
* FOL and ZF: AddIffs now available, giving theorems of the form P<->Q |
1738 |
to the simplifier and classical reasoner simultaneously; |
|
9388 | 1739 |
|
1740 |
||
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
1741 |
*** General *** |
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
1742 |
|
10003 | 1743 |
* Provers: blast_tac now handles actual object-logic rules as |
1744 |
assumptions; note that auto_tac uses blast_tac internally as well; |
|
1745 |
||
1746 |
* Provers: new functions rulify/rulify_no_asm: thm -> thm for turning |
|
1747 |
outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm; |
|
1748 |
||
9941
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
1749 |
* Provers: delrules now handles destruct rules as well (no longer need |
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
1750 |
explicit make_elim); |
fe05af7ec816
renamed atts: rulify to rule_format, elimify to elim_format;
wenzelm
parents:
9937
diff
changeset
|
1751 |
|
10003 | 1752 |
* Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g. |
1753 |
[| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W |
|
1754 |
use instead the strong form, |
|
1755 |
[| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W |
|
1756 |
in HOL, FOL and ZF the function cla_make_elim will create such rules |
|
1757 |
from destruct-rules; |
|
9489
aa757b35b129
* blast(_tac) now handles actual object-logic rules as assumptions;
wenzelm
parents:
9457
diff
changeset
|
1758 |
|
9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
1759 |
* Provers: Simplifier.easy_setup provides a fast path to basic |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
1760 |
Simplifier setup for new object-logics; |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
1761 |
|
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
1762 |
* Pure: AST translation rules no longer require constant head on LHS; |
9349
d43669fb423d
* tuned AST representation of nested pairs, avoiding bogus output in
wenzelm
parents:
9335
diff
changeset
|
1763 |
|
9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
1764 |
* Pure: improved name spaces: ambiguous output is qualified; support |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
1765 |
for hiding of names; |
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
1766 |
|
10003 | 1767 |
* system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and |
1768 |
XSYMBOL_HOME; no longer need to do manual configuration in most |
|
1769 |
situations; |
|
1770 |
||
9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
1771 |
* system: compression of ML heaps images may now be controlled via -c |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
1772 |
option of isabelle and isatool usedir (currently only observed by |
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
1773 |
Poly/ML); |
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
1774 |
|
9981
01a0c4772c18
system: isatool installfonts may handle X-Symbol fonts as well;
wenzelm
parents:
9971
diff
changeset
|
1775 |
* system: isatool installfonts may handle X-Symbol fonts as well (very |
01a0c4772c18
system: isatool installfonts may handle X-Symbol fonts as well;
wenzelm
parents:
9971
diff
changeset
|
1776 |
useful for remote X11); |
01a0c4772c18
system: isatool installfonts may handle X-Symbol fonts as well;
wenzelm
parents:
9971
diff
changeset
|
1777 |
|
9709
2d0ee9612ef1
* Isar/Provers: 'simp' method now supports 'cong' modifiers;
wenzelm
parents:
9701
diff
changeset
|
1778 |
* system: provide TAGS file for Isabelle sources; |
9052 | 1779 |
|
9288
06a55195741b
infix 'OF' is a version of 'MRS' with more appropriate argument order;
wenzelm
parents:
9239
diff
changeset
|
1780 |
* ML: infix 'OF' is a version of 'MRS' with more appropriate argument |
06a55195741b
infix 'OF' is a version of 'MRS' with more appropriate argument order;
wenzelm
parents:
9239
diff
changeset
|
1781 |
order; |
06a55195741b
infix 'OF' is a version of 'MRS' with more appropriate argument order;
wenzelm
parents:
9239
diff
changeset
|
1782 |
|
8994
803533fbb3ec
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
wenzelm
parents:
8991
diff
changeset
|
1783 |
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global |
803533fbb3ec
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
wenzelm
parents:
8991
diff
changeset
|
1784 |
timing flag supersedes proof_timing and Toplevel.trace; |
803533fbb3ec
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
wenzelm
parents:
8991
diff
changeset
|
1785 |
|
10003 | 1786 |
* ML: new combinators |>> and |>>> for incremental transformations |
1787 |
with secondary results (e.g. certain theory extensions): |
|
1788 |
||
9330
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
1789 |
* ML: PureThy.add_defs gets additional argument to indicate potential |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
1790 |
overloading (usually false); |
6861e3b00155
HOL: the disjoint sum is now "<+>" instead of "Plus";
wenzelm
parents:
9288
diff
changeset
|
1791 |
|
10003 | 1792 |
* ML: PureThy.add_thms/add_axioms/add_defs now return theorems as |
1793 |
results; |
|
8440
d66f0f14b1ca
* HOL: exhaust_tac on datatypes superceded by new case_tac;
wenzelm
parents:
8425
diff
changeset
|
1794 |
|
8358
a57d72b5d272
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm
parents:
8283
diff
changeset
|
1795 |
|
8015 | 1796 |
|
7986 | 1797 |
New in Isabelle99 (October 1999) |
1798 |
-------------------------------- |
|
4649 | 1799 |
|
5931 | 1800 |
*** Overview of INCOMPATIBILITIES (see below for more details) *** |
1801 |
||
6922 | 1802 |
* HOL: The THEN and ELSE parts of conditional expressions (if P then x else y) |
1803 |
are no longer simplified. (This allows the simplifier to unfold recursive |
|
1804 |
functional programs.) To restore the old behaviour, declare |
|
7215 | 1805 |
|
1806 |
Delcongs [if_weak_cong]; |
|
6922 | 1807 |
|
6269 | 1808 |
* HOL: Removed the obsolete syntax "Compl A"; use -A for set |
1809 |
complement; |
|
5931 | 1810 |
|
6269 | 1811 |
* HOL: the predicate "inj" is now defined by translation to "inj_on"; |
6174 | 1812 |
|
7847 | 1813 |
* HOL/datatype: mutual_induct_tac no longer exists -- |
1814 |
use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"] |
|
1815 |
||
6386
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
1816 |
* HOL/typedef: fixed type inference for representing set; type |
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
1817 |
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
|
1818 |
|
6269 | 1819 |
* ZF: The con_defs part of an inductive definition may no longer refer |
1820 |
to constants declared in the same theory; |
|
6057 | 1821 |
|
6269 | 1822 |
* HOL, ZF: the function mk_cases, generated by the inductive |
1823 |
definition package, has lost an argument. To simplify its result, it |
|
1824 |
uses the default simpset instead of a supplied list of theorems. |
|
6141 | 1825 |
|
7215 | 1826 |
* HOL/List: the constructors of type list are now Nil and Cons; |
1827 |
||
7619 | 1828 |
* Simplifier: the type of the infix ML functions |
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
1829 |
setSSolver addSSolver setSolver addSolver |
7619 | 1830 |
is now simpset * solver -> simpset where `solver' is a new abstract type |
1831 |
for packaging solvers. A solver is created via |
|
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
1832 |
mk_solver: string -> (thm list -> int -> tactic) -> solver |
7619 | 1833 |
where the string argument is only a comment. |
6057 | 1834 |
|
7647
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset
|
1835 |
|
6069 | 1836 |
*** Proof tools *** |
1837 |
||
6343 | 1838 |
* Provers/Arith/fast_lin_arith.ML contains a functor for creating a |
1839 |
decision procedure for linear arithmetic. Currently it is used for |
|
7593 | 1840 |
types `nat', `int', and `real' in HOL (see below); it can, should and |
1841 |
will be instantiated for other types and logics as well. |
|
6069 | 1842 |
|
7324 | 1843 |
* The simplifier now accepts rewrite rules with flexible heads, eg |
1844 |
hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y |
|
1845 |
They are applied like any rule with a non-pattern lhs, i.e. by first-order |
|
1846 |
matching. |
|
6069 | 1847 |
|
7593 | 1848 |
|
6014 | 1849 |
*** General *** |
1850 |
||
7986 | 1851 |
* New Isabelle/Isar subsystem provides an alternative to traditional |
7215 | 1852 |
tactical theorem proving; together with the ProofGeneral/isar user |
1853 |
interface it offers an interactive environment for developing human |
|
1854 |
readable proof documents (Isar == Intelligible semi-automated |
|
7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
1855 |
reasoning); for further information see isatool doc isar-ref, |
7986 | 1856 |
src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/ |
7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
1857 |
|
9612 | 1858 |
* improved and simplified presentation of theories: better HTML markup |
1859 |
(including colors), graph views in several sizes; isatool usedir now |
|
1860 |
provides a proper interface for user theories (via -P option); actual |
|
1861 |
document preparation based on (PDF)LaTeX is available as well (for |
|
1862 |
new-style theories only); see isatool doc system for more information; |
|
7215 | 1863 |
|
7252 | 1864 |
* native support for Proof General, both for classic Isabelle and |
7986 | 1865 |
Isabelle/Isar; |
7215 | 1866 |
|
7791 | 1867 |
* ML function thm_deps visualizes dependencies of theorems and lemmas, |
1868 |
using the graph browser tool; |
|
1869 |
||
6751 | 1870 |
* Isabelle manuals now also available as PDF; |
1871 |
||
6449 | 1872 |
* theory loader rewritten from scratch (may not be fully |
1873 |
bug-compatible); old loadpath variable has been replaced by show_path, |
|
6671 | 1874 |
add_path, del_path, reset_path functions; new operations such as |
7593 | 1875 |
update_thy, touch_thy, remove_thy, use/update_thy_only (see also |
1876 |
isatool doc ref); |
|
6449 | 1877 |
|
7215 | 1878 |
* improved isatool install: option -k creates KDE application icon, |
1879 |
option -p DIR installs standalone binaries; |
|
1880 |
||
1881 |
* added ML_PLATFORM setting (useful for cross-platform installations); |
|
1882 |
more robust handling of platform specific ML images for SML/NJ; |
|
1883 |
||
7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
1884 |
* the settings environment is now statically scoped, i.e. it is never |
7986 | 1885 |
created again in sub-processes invoked from isabelle, isatool, or |
7886
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
1886 |
Isabelle; |
8fa551e22e52
the settings environment is now statically scoped;
wenzelm
parents:
7863
diff
changeset
|
1887 |
|
7215 | 1888 |
* path element specification '~~' refers to '$ISABELLE_HOME'; |
1889 |
||
6343 | 1890 |
* in locales, the "assumes" and "defines" parts may be omitted if |
1891 |
empty; |
|
5973 | 1892 |
|
6269 | 1893 |
* new print_mode "xsymbols" for extended symbol support (e.g. genuine |
1894 |
long arrows); |
|
6259
488bdc1bd11a
path element specification '~~' refers to '$ISABELLE_HOME';
wenzelm
parents:
6174
diff
changeset
|
1895 |
|
6343 | 1896 |
* new print_mode "HTML"; |
1897 |
||
1898 |
* new flag show_tags controls display of tags of theorems (which are |
|
1899 |
basically just comments that may be attached by some tools); |
|
1900 |
||
6461 | 1901 |
* Isamode 2.6 requires patch to accomodate change of Isabelle font |
1902 |
mode and goal output format: |
|
1903 |
||
1904 |
diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el |
|
1905 |
244c244 |
|
1906 |
< (list (isa-getenv "ISABELLE") "-msymbols" logic-name) |
|
1907 |
--- |
|
6533 | 1908 |
> (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name) |
6461 | 1909 |
diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el |
1910 |
181c181 |
|
1911 |
< (defconst proofstate-proofstart-regexp "^Level [0-9]+$" |
|
1912 |
--- |
|
1913 |
> (defconst proofstate-proofstart-regexp "^Level [0-9]+" |
|
1914 |
||
7450 | 1915 |
* function bind_thms stores lists of theorems (cf. bind_thm); |
1916 |
||
7593 | 1917 |
* new shorthand tactics ftac, eatac, datac, fatac; |
1918 |
||
1919 |
* qed (and friends) now accept "" as result name; in that case the |
|
7986 | 1920 |
theorem is not stored, but proper checks and presentation of the |
1921 |
result still apply; |
|
7593 | 1922 |
|
7805
0ae9ddc36fe0
theorem database now also indexes constants "Trueprop", "all",
wenzelm
parents:
7791
diff
changeset
|
1923 |
* theorem database now also indexes constants "Trueprop", "all", |
0ae9ddc36fe0
theorem database now also indexes constants "Trueprop", "all",
wenzelm
parents:
7791
diff
changeset
|
1924 |
"==>", "=="; thus thms_containing, findI etc. may retrieve more rules; |
0ae9ddc36fe0
theorem database now also indexes constants "Trueprop", "all",
wenzelm
parents:
7791
diff
changeset
|
1925 |
|
6028 | 1926 |
|
6057 | 1927 |
*** HOL *** |
1928 |
||
7215 | 1929 |
** HOL arithmetic ** |
1930 |
||
6343 | 1931 |
* There are now decision procedures for linear arithmetic over nat and |
1932 |
int: |
|
6131 | 1933 |
|
6343 | 1934 |
1. arith_tac copes with arbitrary formulae involving `=', `<', `<=', |
1935 |
`+', `-', `Suc', `min', `max' and numerical constants; other subterms |
|
1936 |
are treated as atomic; subformulae not involving type `nat' or `int' |
|
1937 |
are ignored; quantified subformulae are ignored unless they are |
|
1938 |
positive universal or negative existential. The tactic has to be |
|
1939 |
invoked by hand and can be a little bit slow. In particular, the |
|
1940 |
running time is exponential in the number of occurrences of `min' and |
|
1941 |
`max', and `-' on `nat'. |
|
6131 | 1942 |
|
6343 | 1943 |
2. fast_arith_tac is a cut-down version of arith_tac: it only takes |
1944 |
(negated) (in)equalities among the premises and the conclusion into |
|
1945 |
account (i.e. no compound formulae) and does not know about `min' and |
|
1946 |
`max', and `-' on `nat'. It is fast and is used automatically by the |
|
1947 |
simplifier. |
|
6131 | 1948 |
|
6343 | 1949 |
NB: At the moment, these decision procedures do not cope with mixed |
1950 |
nat/int formulae where the two parts interact, such as `m < n ==> |
|
1951 |
int(m) < int(n)'. |
|
6028 | 1952 |
|
7215 | 1953 |
* HOL/Numeral provides a generic theory of numerals (encoded |
7313 | 1954 |
efficiently as bit strings); setup for types nat/int/real is in place; |
7215 | 1955 |
INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than |
1956 |
int, existing theories and proof scripts may require a few additional |
|
1957 |
type constraints; |
|
1958 |
||
1959 |
* integer division and remainder can now be performed on constant |
|
1960 |
arguments; |
|
7157 | 1961 |
|
7215 | 1962 |
* many properties of integer multiplication, division and remainder |
1963 |
are now available; |
|
6922 | 1964 |
|
7287 | 1965 |
* An interface to the Stanford Validity Checker (SVC) is available through the |
1966 |
tactic svc_tac. Propositional tautologies and theorems of linear arithmetic |
|
1967 |
are proved automatically. SVC must be installed separately, and its results |
|
1968 |
must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any |
|
1969 |
invocation of the underlying oracle). For SVC see |
|
7444 | 1970 |
http://verify.stanford.edu/SVC |
6922 | 1971 |
|
7125 | 1972 |
* IsaMakefile: the HOL-Real target now builds an actual image; |
1973 |
||
7215 | 1974 |
|
1975 |
** HOL misc ** |
|
1976 |
||
7595
5f5d575ddac3
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
wenzelm
parents:
7593
diff
changeset
|
1977 |
* 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
|
1978 |
(in Isabelle/Isar) -- by Gertrud Bauer; |
5f5d575ddac3
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
wenzelm
parents:
7593
diff
changeset
|
1979 |
|
7691 | 1980 |
* HOL/BCV: generic model of bytecode verification, i.e. data-flow |
1981 |
analysis for assembly languages with subtypes; |
|
1982 |
||
6278 | 1983 |
* HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization |
1984 |
-- avoids syntactic ambiguities and treats state, transition, and |
|
1985 |
temporal levels more uniformly; introduces INCOMPATIBILITIES due to |
|
1986 |
changed syntax and (many) tactics; |
|
1987 |
||
7791 | 1988 |
* HOL/inductive: Now also handles more general introduction rules such |
1989 |
as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity |
|
1990 |
theorems are now maintained within the theory (maintained via the |
|
1991 |
"mono" attribute); |
|
7780
099742c562aa
Documented changes to HOL/inductive and function thm_deps.
berghofe
parents:
7691
diff
changeset
|
1992 |
|
7238
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1993 |
* HOL/datatype: Now also handles arbitrarily branching datatypes |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1994 |
(using function types) such as |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1995 |
|
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
1996 |
datatype 'a tree = Atom 'a | Branch "nat => 'a tree" |
7047
d103b875ef1d
Datatype package now handles arbitrarily branching datatypes.
berghofe
parents:
6925
diff
changeset
|
1997 |
|
7326 | 1998 |
* HOL/record: record_simproc (part of the default simpset) takes care |
1999 |
of selectors applied to updated records; record_split_tac is no longer |
|
7327 | 2000 |
part of the default claset; update_defs may now be removed from the |
2001 |
simpset in many cases; COMPATIBILITY: old behavior achieved by |
|
7326 | 2002 |
|
2003 |
claset_ref () := claset() addSWrapper record_split_wrapper; |
|
2004 |
Delsimprocs [record_simproc] |
|
2005 |
||
6386
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
2006 |
* HOL/typedef: fixed type inference for representing set; type |
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
2007 |
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
|
2008 |
|
7287 | 2009 |
* HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem |
2010 |
names rather than an ML expression; |
|
2011 |
||
2012 |
* HOL/defer_recdef (TFL): like recdef but the well-founded relation can be |
|
2013 |
supplied later. Program schemes can be defined, such as |
|
2014 |
"While B C s = (if B s then While B C (C s) else s)" |
|
2015 |
where the well-founded relation can be chosen after B and C have been given. |
|
6563 | 2016 |
|
7215 | 2017 |
* HOL/List: the constructors of type list are now Nil and Cons; |
2018 |
INCOMPATIBILITY: while [] and infix # syntax is still there, of |
|
2019 |
course, ML tools referring to List.list.op # etc. have to be adapted; |
|
2020 |
||
7238
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
2021 |
* HOL_quantifiers flag superseded by "HOL" print mode, which is |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
2022 |
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
|
2023 |
the original Gordon/HOL-style output; |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
2024 |
|
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
2025 |
* 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
|
2026 |
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
|
2027 |
|
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
2028 |
* HOL basic syntax simplified (more orthogonal): all variants of |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
2029 |
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
|
2030 |
Eps operator is provided as well: "SOME x. P[x]"; |
36e58620ffc8
replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents:
7216
diff
changeset
|
2031 |
|
7320 | 2032 |
* HOL/Sum.thy: sum_case has been moved to HOL/Datatype; |
7261 | 2033 |
|
7280 | 2034 |
* HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made |
2035 |
thus available for user theories; |
|
2036 |
||
7300
8439bf404c28
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with HOL/List;
wenzelm
parents:
7287
diff
changeset
|
2037 |
* 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
|
2038 |
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
|
2039 |
time; |
8439bf404c28
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with HOL/List;
wenzelm
parents:
7287
diff
changeset
|
2040 |
|
7986 | 2041 |
* HOL: new tactic smp_tac: int -> int -> tactic, which applies spec |
2042 |
several times and then mp; |
|
7492 | 2043 |
|
7215 | 2044 |
|
7113 | 2045 |
*** LK *** |
2046 |
||
7215 | 2047 |
* the notation <<...>> is now available as a notation for sequences of |
2048 |
formulas; |
|
7113 | 2049 |
|
2050 |
* the simplifier is now installed |
|
2051 |
||
8729
094dbd0fad0c
* improved name spaces: ambiguous output is qualified; support for
wenzelm
parents:
8705
diff
changeset
|
2052 |
* the axiom system has been generalized (thanks to Soren Heilmann) |
7113 | 2053 |
|
2054 |
* the classical reasoner now has a default rule database |
|
2055 |
||
2056 |
||
6064 | 2057 |
*** ZF *** |
2058 |
||
2059 |
* new primrec section allows primitive recursive functions to be given |
|
6269 | 2060 |
directly (as in HOL) over datatypes and the natural numbers; |
6064 | 2061 |
|
6269 | 2062 |
* new tactics induct_tac and exhaust_tac for induction (or case |
2063 |
analysis) over datatypes and the natural numbers; |
|
6064 | 2064 |
|
2065 |
* the datatype declaration of type T now defines the recursor T_rec; |
|
2066 |
||
6141 | 2067 |
* simplification automatically does freeness reasoning for datatype |
6269 | 2068 |
constructors; |
6141 | 2069 |
|
6269 | 2070 |
* automatic type-inference, with AddTCs command to insert new |
2071 |
type-checking rules; |
|
6155 | 2072 |
|
6269 | 2073 |
* datatype introduction rules are now added as Safe Introduction rules |
2074 |
to the claset; |
|
6155 | 2075 |
|
6269 | 2076 |
* the syntax "if P then x else y" is now available in addition to |
2077 |
if(P,x,y); |
|
2078 |
||
6069 | 2079 |
|
6343 | 2080 |
*** Internal programming interfaces *** |
2081 |
||
7919
35c18affc1d8
tuned simplifier trace output; new flag debug_simp
wenzelm
parents:
7886
diff
changeset
|
2082 |
* tuned simplifier trace output; new flag debug_simp; |
35c18affc1d8
tuned simplifier trace output; new flag debug_simp
wenzelm
parents:
7886
diff
changeset
|
2083 |
|
7420
cba45c114f3b
structures Vartab / Termtab (instances of TableFun);
wenzelm
parents:
7327
diff
changeset
|
2084 |
* structures Vartab / Termtab (instances of TableFun) offer efficient |
cba45c114f3b
structures Vartab / Termtab (instances of TableFun);
wenzelm
parents:
7327
diff
changeset
|
2085 |
tables indexed by indexname_ord / term_ord (compatible with aconv); |
cba45c114f3b
structures Vartab / Termtab (instances of TableFun);
wenzelm
parents:
7327
diff
changeset
|
2086 |
|
6386
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
2087 |
* AxClass.axclass_tac lost the theory argument; |
e9e8af97f48f
HOL/typedef: fixed type inference for representing set;
wenzelm
parents:
6343
diff
changeset
|
2088 |
|
6343 | 2089 |
* tuned current_goals_markers semantics: begin / end goal avoids |
2090 |
printing empty lines; |
|
2091 |
||
2092 |
* removed prs and prs_fn hook, which was broken because it did not |
|
2093 |
include \n in its semantics, forcing writeln to add one |
|
2094 |
uncoditionally; replaced prs_fn by writeln_fn; consider std_output: |
|
2095 |
string -> unit if you really want to output text without newline; |
|
2096 |
||
2097 |
* Symbol.output subject to print mode; INCOMPATIBILITY: defaults to |
|
2098 |
plain output, interface builders may have to enable 'isabelle_font' |
|
2099 |
mode to get Isabelle font glyphs as before; |
|
2100 |
||
2101 |
* refined token_translation interface; INCOMPATIBILITY: output length |
|
2102 |
now of type real instead of int; |
|
2103 |
||
7196 | 2104 |
* theory loader actions may be traced via new ThyInfo.add_hook |
2105 |
interface (see src/Pure/Thy/thy_info.ML); example application: keep |
|
2106 |
your own database of information attached to *whole* theories -- as |
|
2107 |
opposed to intra-theory data slots offered via TheoryDataFun; |
|
2108 |
||
7647
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset
|
2109 |
* proper handling of dangling sort hypotheses (at last!); |
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset
|
2110 |
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
|
2111 |
extra sort hypotheses that can be witnessed from the type signature; |
7986 | 2112 |
the force_strip_shyps flag is gone, any remaining shyps are simply |
2113 |
left in the theorem (with a warning issued by strip_shyps_warning); |
|
7647
2ceddd91cd0a
proper handling of dangling sort hypotheses (at last!);
wenzelm
parents:
7619
diff
changeset
|
2114 |
|
6343 | 2115 |
|
6064 | 2116 |
|
5781 | 2117 |
New in Isabelle98-1 (October 1998) |
2118 |
---------------------------------- |
|
2119 |
||
5127 | 2120 |
*** Overview of INCOMPATIBILITIES (see below for more details) *** |
4842 | 2121 |
|
5726 | 2122 |
* several changes of automated proof tools; |
5373 | 2123 |
|
5726 | 2124 |
* HOL: major changes to the inductive and datatype packages, including |
2125 |
some minor incompatibilities of theory syntax; |
|
5214 | 2126 |
|
5726 | 2127 |
* HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now |
5217 | 2128 |
called `inj_on'; |
5160 | 2129 |
|
5275 | 2130 |
* HOL: removed duplicate thms in Arith: |
2131 |
less_imp_add_less should be replaced by trans_less_add1 |
|
2132 |
le_imp_add_le should be replaced by trans_le_add1 |
|
5160 | 2133 |
|
5726 | 2134 |
* HOL: unary minus is now overloaded (new type constraints may be |
2135 |
required); |
|
5490 | 2136 |
|
5726 | 2137 |
* HOL and ZF: unary minus for integers is now #- instead of #~. In |
2138 |
ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is |
|
2139 |
now taken as an integer constant. |
|
5541 | 2140 |
|
5726 | 2141 |
* Pure: ML function 'theory_of' renamed to 'theory'; |
5397
034ed25535b9
* Pure: ML function 'theory_of' replaced by 'theory';
wenzelm
parents:
5373
diff
changeset
|
2142 |
|
5363 | 2143 |
|
5127 | 2144 |
*** Proof tools *** |
4880 | 2145 |
|
5657
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
2146 |
* Simplifier: |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
2147 |
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
|
2148 |
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
|
2149 |
simplify. |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
2150 |
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
|
2151 |
rotate premises to achieve further simplification. |
1a6c9c6a3f8e
2. The simplifier now knows a little bit about nat-arithmetic.
nipkow
parents:
5651
diff
changeset
|
2152 |
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
|
2153 |
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
|
2154 |
2. The simplifier now knows a little bit about nat-arithmetic. |
4880 | 2155 |
|
5127 | 2156 |
* Classical reasoner: wrapper mechanism for the classical reasoner now |
2157 |
allows for selected deletion of wrappers, by introduction of names for |
|
2158 |
wrapper functionals. This implies that addbefore, addSbefore, |
|
2159 |
addaltern, and addSaltern now take a pair (name, tactic) as argument, |
|
2160 |
and that adding two tactics with the same name overwrites the first |
|
2161 |
one (emitting a warning). |
|
4824 | 2162 |
type wrapper = (int -> tactic) -> (int -> tactic) |
4649 | 2163 |
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by |
4824 | 2164 |
addWrapper, addSWrapper: claset * (string * wrapper) -> claset |
2165 |
delWrapper, delSWrapper: claset * string -> claset |
|
4649 | 2166 |
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers; |
2167 |
||
5705
56f2030c46c6
tuned (all proofs are INSTABLE by David's definition of instability);
wenzelm
parents:
5671
diff
changeset
|
2168 |
* Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE |
5726 | 2169 |
semantics; addbefore now affects only the unsafe part of step_tac |
2170 |
etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY |
|
2171 |
FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac |
|
2172 |
by Force_tac; |
|
5524 | 2173 |
|
5726 | 2174 |
* Classical reasoner: setwrapper to setWrapper and compwrapper to |
2175 |
compWrapper; added safe wrapper (and access functions for it); |
|
5524 | 2176 |
|
5127 | 2177 |
* HOL/split_all_tac is now much faster and fails if there is nothing |
5726 | 2178 |
to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order |
2179 |
and the names of the automatically generated variables have changed. |
|
2180 |
split_all_tac has moved within claset() from unsafe wrappers to safe |
|
2181 |
wrappers, which means that !!-bound variables are split much more |
|
2182 |
aggressively, and safe_tac and clarify_tac now split such variables. |
|
2183 |
If this splitting is not appropriate, use delSWrapper "split_all_tac". |
|
2184 |
Note: the same holds for record_split_tac, which does the job of |
|
2185 |
split_all_tac for record fields. |
|
5127 | 2186 |
|
5726 | 2187 |
* HOL/Simplifier: Rewrite rules for case distinctions can now be added |
2188 |
permanently to the default simpset using Addsplits just like |
|
2189 |
Addsimps. They can be removed via Delsplits just like |
|
2190 |
Delsimps. Lower-case versions are also available. |
|
5127 | 2191 |
|
5726 | 2192 |
* HOL/Simplifier: The rule split_if is now part of the default |
2193 |
simpset. This means that the simplifier will eliminate all occurrences |
|
2194 |
of if-then-else in the conclusion of a goal. To prevent this, you can |
|
2195 |
either remove split_if completely from the default simpset by |
|
2196 |
`Delsplits [split_if]' or remove it in a specific call of the |
|
2197 |
simplifier using `... delsplits [split_if]'. You can also add/delete |
|
2198 |
other case splitting rules to/from the default simpset: every datatype |
|
2199 |
generates suitable rules `split_t_case' and `split_t_case_asm' (where |
|
2200 |
t is the name of the datatype). |
|
5127 | 2201 |
|
5726 | 2202 |
* Classical reasoner / Simplifier combination: new force_tac (and |
5127 | 2203 |
derivatives Force_tac, force) combines rewriting and classical |
2204 |
reasoning (and whatever other tools) similarly to auto_tac, but is |
|
5726 | 2205 |
aimed to solve the given subgoal completely. |
5127 | 2206 |
|
2207 |
||
2208 |
*** General *** |
|
2209 |
||
5217 | 2210 |
* new top-level commands `Goal' and `Goalw' that improve upon `goal' |
5127 | 2211 |
and `goalw': the theory is no longer needed as an explicit argument - |
2212 |
the current theory context is used; assumptions are no longer returned |
|
2213 |
at the ML-level unless one of them starts with ==> or !!; it is |
|
5217 | 2214 |
recommended to convert to these new commands using isatool fixgoal |
2215 |
(backup your sources first!); |
|
4842 | 2216 |
|
5217 | 2217 |
* new top-level commands 'thm' and 'thms' for retrieving theorems from |
5207 | 2218 |
the current theory context, and 'theory' to lookup stored theories; |
4806 | 2219 |
|
5722 | 2220 |
* new theory section 'locale' for declaring constants, assumptions and |
2221 |
definitions that have local scope; |
|
2222 |
||
5127 | 2223 |
* new theory section 'nonterminals' for purely syntactic types; |
4858 | 2224 |
|
5127 | 2225 |
* new theory section 'setup' for generic ML setup functions |
2226 |
(e.g. package initialization); |
|
4869 | 2227 |
|
5131 | 2228 |
* the distribution now includes Isabelle icons: see |
2229 |
lib/logo/isabelle-{small,tiny}.xpm; |
|
2230 |
||
5363 | 2231 |
* isatool install - install binaries with absolute references to |
2232 |
ISABELLE_HOME/bin; |
|
2233 |
||
5572 | 2234 |
* isatool logo -- create instances of the Isabelle logo (as EPS); |
2235 |
||
5407 | 2236 |
* print mode 'emacs' reserved for Isamode; |
2237 |
||
5726 | 2238 |
* support multiple print (ast) translations per constant name; |
2239 |
||
6925
8d4d45ec6a3d
theorems involving oracles are now printed with a suffixed [!];
wenzelm
parents:
6922
diff
changeset
|
2240 |
* theorems involving oracles are now printed with a suffixed [!]; |
8d4d45ec6a3d
theorems involving oracles are now printed with a suffixed [!];
wenzelm
parents:
6922
diff
changeset
|
2241 |
|
4711 | 2242 |
|
4661 | 2243 |
*** HOL *** |
2244 |
||
5710 | 2245 |
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial'); |
5709 | 2246 |
|
5217 | 2247 |
* HOL/inductive package reorganized and improved: now supports mutual |
5267 | 2248 |
definitions such as |
5217 | 2249 |
|
2250 |
inductive EVEN ODD |
|
2251 |
intrs |
|
2252 |
null "0 : EVEN" |
|
2253 |
oddI "n : EVEN ==> Suc n : ODD" |
|
2254 |
evenI "n : ODD ==> Suc n : EVEN" |
|
2255 |
||
2256 |
new theorem list "elims" contains an elimination rule for each of the |
|
2257 |
recursive sets; inductive definitions now handle disjunctive premises |
|
2258 |
correctly (also ZF); |
|
5214 | 2259 |
|
5217 | 2260 |
INCOMPATIBILITIES: requires Inductive as an ancestor; component |
2261 |
"mutual_induct" no longer exists - the induction rule is always |
|
2262 |
contained in "induct"; |
|
2263 |
||
2264 |
||
2265 |
* HOL/datatype package re-implemented and greatly improved: now |
|
5267 | 2266 |
supports mutually recursive datatypes such as |
5217 | 2267 |
|
2268 |
datatype |
|
2269 |
'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp) |
|
2270 |
| SUM ('a aexp) ('a aexp) |
|
2271 |
| DIFF ('a aexp) ('a aexp) |
|
2272 |
| NUM 'a |
|
2273 |
and |
|
2274 |
'a bexp = LESS ('a aexp) ('a aexp) |
|
2275 |
| AND ('a bexp) ('a bexp) |
|
2276 |
| OR ('a bexp) ('a bexp) |
|
2277 |
||
5267 | 2278 |
as well as indirectly recursive datatypes such as |
5214 | 2279 |
|
5217 | 2280 |
datatype |
2281 |
('a, 'b) term = Var 'a |
|
2282 |
| App 'b ((('a, 'b) term) list) |
|
5214 | 2283 |
|
5217 | 2284 |
The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs |
2285 |
induction on mutually / indirectly recursive datatypes. |
|
2286 |
||
2287 |
Primrec equations are now stored in theory and can be accessed via |
|
2288 |
<function_name>.simps. |
|
2289 |
||
2290 |
INCOMPATIBILITIES: |
|
5214 | 2291 |
|
5217 | 2292 |
- Theories using datatypes must now have theory Datatype as an |
2293 |
ancestor. |
|
2294 |
- The specific <typename>.induct_tac no longer exists - use the |
|
2295 |
generic induct_tac instead. |
|
5226 | 2296 |
- natE has been renamed to nat.exhaust - use exhaust_tac |
5217 | 2297 |
instead of res_inst_tac ... natE. Note that the variable |
5226 | 2298 |
names in nat.exhaust differ from the names in natE, this |
5217 | 2299 |
may cause some "fragile" proofs to fail. |
2300 |
- The theorems split_<typename>_case and split_<typename>_case_asm |
|
2301 |
have been renamed to <typename>.split and <typename>.split_asm. |
|
2302 |
- Since default sorts of type variables are now handled correctly, |
|
2303 |
some datatype definitions may have to be annotated with explicit |
|
2304 |
sort constraints. |
|
2305 |
- Primrec definitions no longer require function name and type |
|
2306 |
of recursive argument. |
|
5214 | 2307 |
|
5217 | 2308 |
Consider using isatool fixdatatype to adapt your theories and proof |
2309 |
scripts to the new package (backup your sources first!). |
|
2310 |
||
2311 |
||
5726 | 2312 |
* HOL/record package: considerably improved implementation; now |
2313 |
includes concrete syntax for record types, terms, updates; theorems |
|
2314 |
for surjective pairing and splitting !!-bound record variables; proof |
|
2315 |
support is as follows: |
|
2316 |
||
2317 |
1) standard conversions (selectors or updates applied to record |
|
2318 |
constructor terms) are part of the standard simpset; |
|
2319 |
||
2320 |
2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are |
|
2321 |
made part of standard simpset and claset via addIffs; |
|
2322 |
||
2323 |
3) a tactic for record field splitting (record_split_tac) is part of |
|
2324 |
the standard claset (addSWrapper); |
|
2325 |
||
2326 |
To get a better idea about these rules you may retrieve them via |
|
2327 |
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is |
|
2328 |
the name of your record type. |
|
2329 |
||
2330 |
The split tactic 3) conceptually simplifies by the following rule: |
|
2331 |
||
2332 |
"(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))" |
|
2333 |
||
2334 |
Thus any record variable that is bound by meta-all will automatically |
|
2335 |
blow up into some record constructor term, consequently the |
|
2336 |
simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall |
|
2337 |
solve record problems automatically. |
|
2338 |
||
5214 | 2339 |
|
5125 | 2340 |
* reorganized the main HOL image: HOL/Integ and String loaded by |
2341 |
default; theory Main includes everything; |
|
2342 |
||
5650 | 2343 |
* automatic simplification of integer sums and comparisons, using cancellation; |
2344 |
||
5526 | 2345 |
* added option_map_eq_Some and not_Some_eq to the default simpset and claset; |
5127 | 2346 |
|
2347 |
* added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset; |
|
2348 |
||
2349 |
* many new identities for unions, intersections, set difference, etc.; |
|
2350 |
||
2351 |
* expand_if, expand_split, expand_sum_case and expand_nat_case are now |
|
2352 |
called split_if, split_split, split_sum_case and split_nat_case (to go |
|
2353 |
with add/delsplits); |
|
5125 | 2354 |
|
5127 | 2355 |
* HOL/Prod introduces simplification procedure unit_eq_proc rewriting |
2356 |
(?x::unit) = (); this is made part of the default simpset, which COULD |
|
2357 |
MAKE EXISTING PROOFS FAIL under rare circumstances (consider |
|
5207 | 2358 |
'Delsimprocs [unit_eq_proc];' as last resort); also note that |
2359 |
unit_abs_eta_conv is added in order to counter the effect of |
|
2360 |
unit_eq_proc on (%u::unit. f u), replacing it by f rather than by |
|
2361 |
%u.f(); |
|
5125 | 2362 |
|
5217 | 2363 |
* HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which |
2364 |
makes more sense); |
|
5109 | 2365 |
|
5475 | 2366 |
* HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule; |
2367 |
It and 'sym RS equals0D' are now in the default claset, giving automatic |
|
2368 |
disjointness reasoning but breaking a few old proofs. |
|
5267 | 2369 |
|
5217 | 2370 |
* HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1 |
2371 |
to 'converse' from 'inverse' (for compatibility with ZF and some |
|
2372 |
literature); |
|
5085
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset
|
2373 |
|
5127 | 2374 |
* HOL/recdef can now declare non-recursive functions, with {} supplied as |
2375 |
the well-founded relation; |
|
4838 | 2376 |
|
5490 | 2377 |
* HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of |
2378 |
Compl A. The "Compl" syntax remains available as input syntax for this |
|
2379 |
release ONLY. |
|
2380 |
||
5127 | 2381 |
* HOL/Update: new theory of function updates: |
2382 |
f(a:=b) == %x. if x=a then b else f x |
|
2383 |
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
|
2384 |
|
5127 | 2385 |
* HOL/Vimage: new theory for inverse image of a function, syntax f-``B; |
4899 | 2386 |
|
5282 | 2387 |
* HOL/List: |
2388 |
- new function list_update written xs[i:=v] that updates the i-th |
|
2389 |
list position. May also be iterated as in xs[i:=a,j:=b,...]. |
|
5428 | 2390 |
- new function `upt' written [i..j(] which generates the list |
2391 |
[i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper |
|
2392 |
bound write [i..j], which is a shorthand for [i..j+1(]. |
|
5282 | 2393 |
- new lexicographic orderings and corresponding wellfoundedness theorems. |
4779 | 2394 |
|
5127 | 2395 |
* HOL/Arith: |
2396 |
- removed 'pred' (predecessor) function; |
|
2397 |
- generalized some theorems about n-1; |
|
2398 |
- many new laws about "div" and "mod"; |
|
2399 |
- new laws about greatest common divisors (see theory ex/Primes); |
|
4766 | 2400 |
|
5127 | 2401 |
* HOL/Relation: renamed the relational operator r^-1 "converse" |
4842 | 2402 |
instead of "inverse"; |
4711 | 2403 |
|
5651 | 2404 |
* HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness |
2405 |
of the multiset ordering; |
|
2406 |
||
5127 | 2407 |
* directory HOL/Real: a construction of the reals using Dedekind cuts |
5651 | 2408 |
(not included by default); |
4835 | 2409 |
|
5127 | 2410 |
* directory HOL/UNITY: Chandy and Misra's UNITY formalism; |
4711 | 2411 |
|
5651 | 2412 |
* directory HOL/Hoare: a new version of Hoare logic which permits many-sorted |
2413 |
programs, i.e. different program variables may have different types. |
|
2414 |
||
5142 | 2415 |
* calling (stac rew i) now fails if "rew" has no effect on the goal |
2416 |
[previously, this check worked only if the rewrite rule was unconditional] |
|
5308 | 2417 |
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
|
2418 |
|
5363 | 2419 |
|
4879
58656c6a3551
"let" is no longer restricted to FOL terms and allows any logical terms
paulson
parents:
4869
diff
changeset
|
2420 |
*** ZF *** |
58656c6a3551
"let" is no longer restricted to FOL terms and allows any logical terms
paulson
parents:
4869
diff
changeset
|
2421 |
|
5332 | 2422 |
* theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains |
2423 |
only the theorems proved on ZF.ML; |
|
5160 | 2424 |
|
5475 | 2425 |
* ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule; |
2426 |
It and 'sym RS equals0D' are now in the default claset, giving automatic |
|
2427 |
disjointness reasoning but breaking a few old proofs. |
|
5267 | 2428 |
|
5160 | 2429 |
* ZF/Update: new theory of function updates |
2430 |
with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z) |
|
2431 |
may also be iterated as in f(a:=b,c:=d,...); |
|
2432 |
||
4879
58656c6a3551
"let" is no longer restricted to FOL terms and allows any logical terms
paulson
parents:
4869
diff
changeset
|
2433 |
* in let x=t in u(x), neither t nor u(x) has to be an FOL term. |
4649 | 2434 |
|
5142 | 2435 |
* calling (stac rew i) now fails if "rew" has no effect on the goal |
2436 |
[previously, this check worked only if the rewrite rule was unconditional] |
|
5308 | 2437 |
Now rew can involve either definitions or equalities (either == or =). |
5142 | 2438 |
|
5160 | 2439 |
* case_tac provided for compatibility with HOL |
2440 |
(like the old excluded_middle_tac, but with subgoals swapped) |
|
2441 |
||
4842 | 2442 |
|
5127 | 2443 |
*** Internal programming interfaces *** |
5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset
|
2444 |
|
5251 | 2445 |
* Pure: several new basic modules made available for general use, see |
2446 |
also src/Pure/README; |
|
5207 | 2447 |
|
5008 | 2448 |
* improved the theory data mechanism to support encapsulation (data |
2449 |
kind name replaced by private Object.kind, acting as authorization |
|
5373 | 2450 |
key); new type-safe user interface via functor TheoryDataFun; generic |
2451 |
print_data function becomes basically useless; |
|
5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset
|
2452 |
|
5251 | 2453 |
* removed global_names compatibility flag -- all theory declarations |
2454 |
are qualified by default; |
|
2455 |
||
5085
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset
|
2456 |
* module Pure/Syntax now offers quote / antiquote translation |
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset
|
2457 |
functions (useful for Hoare logic etc. with implicit dependencies); |
5373 | 2458 |
see HOL/ex/Antiquote for an example use; |
5085
8e5a7942fdea
simplification procedure unit_eq_proc rewrites (?x::unit) = ();
wenzelm
parents:
5077
diff
changeset
|
2459 |
|
5127 | 2460 |
* Simplifier now offers conversions (asm_)(full_)rewrite: simpset -> |
2461 |
cterm -> thm; |
|
2462 |
||
5207 | 2463 |
* new tactical CHANGED_GOAL for checking that a tactic modifies a |
2464 |
subgoal; |
|
5142 | 2465 |
|
5251 | 2466 |
* Display.print_goals function moved to Locale.print_goals; |
2467 |
||
5731 | 2468 |
* standard print function for goals supports current_goals_markers |
2469 |
variable for marking begin of proof, end of proof, start of goal; the |
|
2470 |
default is ("", "", ""); setting current_goals_markers := ("<proof>", |
|
2471 |
"</proof>", "<goal>") causes SGML like tagged proof state printing, |
|
2472 |
for example; |
|
2473 |
||
5002
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset
|
2474 |
|
7b4c2a153738
* improved the theory data mechanism to support real encapsulation;
wenzelm
parents:
4981
diff
changeset
|
2475 |
|
4410 | 2476 |
New in Isabelle98 (January 1998) |
2477 |
-------------------------------- |
|
2478 |
||
2479 |
*** Overview of INCOMPATIBILITIES (see below for more details) *** |
|
2480 |
||
2481 |
* changed lexical syntax of terms / types: dots made part of long |
|
2482 |
identifiers, e.g. "%x.x" no longer possible, should be "%x. x"; |
|
2483 |
||
2484 |
* simpset (and claset) reference variable replaced by functions |
|
2485 |
simpset / simpset_ref; |
|
2486 |
||
2487 |
* no longer supports theory aliases (via merge) and non-trivial |
|
2488 |
implicit merge of thms' signatures; |
|
2489 |
||
2490 |
* most internal names of constants changed due to qualified names; |
|
2491 |
||
2492 |
* changed Pure/Sequence interface (see Pure/seq.ML); |
|
2493 |
||
3454 | 2494 |
|
3715 | 2495 |
*** General Changes *** |
2496 |
||
4174 | 2497 |
* hierachically structured name spaces (for consts, types, axms, thms |
3943 | 2498 |
etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of |
4108 | 2499 |
old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY: |
2500 |
isatool fixdots ensures space after dots (e.g. "%x. x"); set |
|
4174 | 2501 |
long_names for fully qualified output names; NOTE: ML programs |
2502 |
(special tactics, packages etc.) referring to internal names may have |
|
2503 |
to be adapted to cope with fully qualified names; in case of severe |
|
2504 |
backward campatibility problems try setting 'global_names' at compile |
|
2505 |
time to have enrything declared within a flat name space; one may also |
|
2506 |
fine tune name declarations in theories via the 'global' and 'local' |
|
2507 |
section; |
|
4108 | 2508 |
|
2509 |
* reimplemented the implicit simpset and claset using the new anytype |
|
2510 |
data filed in signatures; references simpset:simpset ref etc. are |
|
2511 |
replaced by functions simpset:unit->simpset and |
|
2512 |
simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp |
|
2513 |
to patch your ML files accordingly; |
|
3856 | 2514 |
|
3857 | 2515 |
* HTML output now includes theory graph data for display with Java |
2516 |
applet or isatool browser; data generated automatically via isatool |
|
3901 | 2517 |
usedir (see -i option, ISABELLE_USEDIR_OPTIONS); |
3857 | 2518 |
|
3856 | 2519 |
* defs may now be conditional; improved rewrite_goals_tac to handle |
2520 |
conditional equations; |
|
2521 |
||
4174 | 2522 |
* defs now admits additional type arguments, using TYPE('a) syntax; |
2523 |
||
3901 | 2524 |
* theory aliases via merge (e.g. M=A+B+C) no longer supported, always |
2525 |
creates a new theory node; implicit merge of thms' signatures is |
|
4112 | 2526 |
restricted to 'trivial' ones; COMPATIBILITY: one may have to use |
3901 | 2527 |
transfer:theory->thm->thm in (rare) cases; |
2528 |
||
3968
ec138de716d9
improved handling of draft signatures / theories; draft thms (and
wenzelm
parents:
3964
diff
changeset
|
2529 |
* improved handling of draft signatures / theories; draft thms (and |
ec138de716d9
improved handling of draft signatures / theories; draft thms (and
wenzelm
parents:
3964
diff
changeset
|
2530 |
ctyps, cterms) are automatically promoted to real ones; |
ec138de716d9
improved handling of draft signatures / theories; draft thms (and
wenzelm
parents:
3964
diff
changeset
|
2531 |
|
3901 | 2532 |
* slightly changed interfaces for oracles: admit many per theory, named |
2533 |
(e.g. oracle foo = mlfun), additional name argument for invoke_oracle; |
|
2534 |
||
2535 |
* print_goals: optional output of const types (set show_consts and |
|
2536 |
show_types); |
|
3851
fe9932a7cd46
print_goals: optional output of const types (set show_consts);
wenzelm
parents:
3846
diff
changeset
|
2537 |
|
4388 | 2538 |
* improved output of warnings (###) and errors (***); |
3697
c5833dfcc2cc
Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
wenzelm
parents:
3671
diff
changeset
|
2539 |
|
4178
e64ff1c1bc70
subgoal_tac displays a warning if the new subgoal has type variables
paulson
parents:
4174
diff
changeset
|
2540 |
* 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
|
2541 |
|
3715 | 2542 |
* removed old README and Makefiles; |
3697
c5833dfcc2cc
Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
wenzelm
parents:
3671
diff
changeset
|
2543 |
|
3856 | 2544 |
* 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
|
2545 |
|
3715 | 2546 |
* removed obsolete init_pps and init_database; |
2547 |
||
2548 |
* deleted the obsolete tactical STATE, which was declared by |
|
2549 |
fun STATE tacfun st = tacfun st st; |
|
2550 |
||
4388 | 2551 |
* cd and use now support path variables, e.g. $ISABELLE_HOME, or ~ |
2552 |
(which abbreviates $HOME); |
|
4269 | 2553 |
|
2554 |
* changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY: |
|
2555 |
use isatool fixseq to adapt your ML programs (this works for fully |
|
2556 |
qualified references to the Sequence structure only!); |
|
2557 |
||
4381 | 2558 |
* use_thy no longer requires writable current directory; it always |
2559 |
reloads .ML *and* .thy file, if either one is out of date; |
|
4269 | 2560 |
|
3715 | 2561 |
|
2562 |
*** Classical Reasoner *** |
|
2563 |
||
3744 | 2564 |
* Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new |
2565 |
tactics that use classical reasoning to simplify a subgoal without |
|
2566 |
splitting it into several subgoals; |
|
3715 | 2567 |
|
3719 | 2568 |
* Safe_tac: like safe_tac but uses the default claset; |
2569 |
||
3715 | 2570 |
|
2571 |
*** Simplifier *** |
|
2572 |
||
2573 |
* added simplification meta rules: |
|
2574 |
(asm_)(full_)simplify: simpset -> thm -> thm; |
|
2575 |
||
2576 |
* simplifier.ML no longer part of Pure -- has to be loaded by object |
|
2577 |
logics (again); |
|
2578 |
||
2579 |
* added prems argument to simplification procedures; |
|
2580 |
||
4325 | 2581 |
* HOL, FOL, ZF: added infix function `addsplits': |
2582 |
instead of `<simpset> setloop (split_tac <thms>)' |
|
2583 |
you can simply write `<simpset> addsplits <thms>' |
|
2584 |
||
3715 | 2585 |
|
2586 |
*** Syntax *** |
|
2587 |
||
4174 | 2588 |
* TYPE('a) syntax for type reflection terms; |
2589 |
||
3985 | 2590 |
* no longer handles consts with name "" -- declare as 'syntax' instead; |
3856 | 2591 |
|
2592 |
* pretty printer: changed order of mixfix annotation preference (again!); |
|
3846 | 2593 |
|
3715 | 2594 |
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories; |
2595 |
||
2596 |
||
2597 |
*** HOL *** |
|
2598 |
||
5726 | 2599 |
* HOL: there is a new splitter `split_asm_tac' that can be used e.g. |
4189 | 2600 |
with `addloop' of the simplifier to faciliate case splitting in premises. |
2601 |
||
4035 | 2602 |
* HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions; |
3985 | 2603 |
|
2604 |
* HOL/Auth: new protocol proofs including some for the Internet |
|
4035 | 2605 |
protocol TLS; |
3985 | 2606 |
|
4125 | 2607 |
* HOL/Map: new theory of `maps' a la VDM; |
3982 | 2608 |
|
4335 | 2609 |
* HOL/simplifier: simplification procedures nat_cancel_sums for |
2610 |
cancelling out common nat summands from =, <, <= (in)equalities, or |
|
2611 |
differences; simplification procedures nat_cancel_factor for |
|
2612 |
cancelling common factor from =, <, <= (in)equalities over natural |
|
4373 | 2613 |
sums; nat_cancel contains both kinds of procedures, it is installed by |
2614 |
default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL; |
|
4335 | 2615 |
|
3580 | 2616 |
* HOL/simplifier: terms of the form |
4325 | 2617 |
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x) |
3580 | 2618 |
are rewritten to |
4035 | 2619 |
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)', |
2620 |
and those of the form |
|
4325 | 2621 |
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x) |
4035 | 2622 |
are rewritten to |
2623 |
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)', |
|
2624 |
||
2625 |
* HOL/datatype |
|
2626 |
Each datatype `t' now comes with a theorem `split_t_case' of the form |
|
3580 | 2627 |
|
4035 | 2628 |
P(t_case f1 ... fn x) = |
2629 |
( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) & |
|
2630 |
... |
|
4189 | 2631 |
(!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn)) |
4035 | 2632 |
) |
2633 |
||
4930
89271bc4e7ed
extended addsplits and delsplits to handle also split rules for assumptions
oheimb
parents:
4915
diff
changeset
|
2634 |
and a theorem `split_t_case_asm' of the form |
4189 | 2635 |
|
2636 |
P(t_case f1 ... fn x) = |
|
2637 |
~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) | |
|
2638 |
... |
|
2639 |
(? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn)) |
|
2640 |
) |
|
4930
89271bc4e7ed
extended addsplits and delsplits to handle also split rules for assumptions
oheimb
parents:
4915
diff
changeset
|
2641 |
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
|
2642 |
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
|
2643 |
split_list_case and split_option_case. |
4189 | 2644 |
|
4361 | 2645 |
* HOL/Arithmetic: |
2646 |
- `pred n' is automatically converted to `n-1'. |
|
2647 |
Users are strongly encouraged not to use `pred' any longer, |
|
2648 |
because it will disappear altogether at some point. |
|
2649 |
- Users are strongly encouraged to write "0 < n" rather than |
|
2650 |
"n ~= 0". Theorems and proof tools have been modified towards this |
|
2651 |
`standard'. |
|
4357 | 2652 |
|
4502 | 2653 |
* HOL/Lists: |
2654 |
the function "set_of_list" has been renamed "set" (and its theorems too); |
|
2655 |
the function "nth" now takes its arguments in the reverse order and |
|
2656 |
has acquired the infix notation "!" as in "xs!n". |
|
3570 | 2657 |
|
4154 | 2658 |
* HOL/Set: UNIV is now a constant and is no longer translated to Compl{}; |
2659 |
||
2660 |
* HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its |
|
2661 |
specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x); |
|
2662 |
||
4575 | 2663 |
* HOL/record: extensible records with schematic structural subtyping |
2664 |
(single inheritance); EXPERIMENTAL version demonstrating the encoding, |
|
2665 |
still lacks various theorems and concrete record syntax; |
|
2666 |
||
4125 | 2667 |
|
3715 | 2668 |
*** HOLCF *** |
3535 | 2669 |
|
4125 | 2670 |
* removed "axioms" and "generated by" sections; |
2671 |
||
4123 | 2672 |
* replaced "ops" section by extended "consts" section, which is capable of |
4125 | 2673 |
handling the continuous function space "->" directly; |
2674 |
||
2675 |
* domain package: |
|
2676 |
. proves theorems immediately and stores them in the theory, |
|
2677 |
. creates hierachical name space, |
|
2678 |
. now uses normal mixfix annotations (instead of cinfix...), |
|
2679 |
. minor changes to some names and values (for consistency), |
|
2680 |
. e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas, |
|
2681 |
. separator between mutual domain defs: changed "," to "and", |
|
2682 |
. improved handling of sort constraints; now they have to |
|
2683 |
appear on the left-hand side of the equations only; |
|
4123 | 2684 |
|
2685 |
* fixed LAM <x,y,zs>.b syntax; |
|
3567 | 2686 |
|
3744 | 2687 |
* added extended adm_tac to simplifier in HOLCF -- can now discharge |
2688 |
adm (%x. P (t x)), where P is chainfinite and t continuous; |
|
3579 | 2689 |
|
2690 |
||
3719 | 2691 |
*** FOL and ZF *** |
2692 |
||
5726 | 2693 |
* FOL: there is a new splitter `split_asm_tac' that can be used e.g. |
4189 | 2694 |
with `addloop' of the simplifier to faciliate case splitting in premises. |
2695 |
||
3744 | 2696 |
* qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as |
2697 |
in HOL, they strip ALL and --> from proved theorems; |
|
2698 |
||
3719 | 2699 |
|
3579 | 2700 |
|
3006 | 2701 |
New in Isabelle94-8 (May 1997) |
2702 |
------------------------------ |
|
2654 | 2703 |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2704 |
*** General Changes *** |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2705 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2706 |
* 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
|
2707 |
still somewhat experimental); old Makefiles etc. still functional; |
2971 | 2708 |
|
3205 | 2709 |
* new 'Isabelle System Manual'; |
2710 |
||
2825 | 2711 |
* INSTALL text, together with ./configure and ./build scripts; |
2773 | 2712 |
|
3006 | 2713 |
* reimplemented type inference for greater efficiency, better error |
2714 |
messages and clean internal interface; |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2715 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2716 |
* 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
|
2717 |
setting goals_limit); |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2718 |
|
3006 | 2719 |
|
2720 |
*** Syntax *** |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2721 |
|
3116 | 2722 |
* supports alternative (named) syntax tables (parser and pretty |
2723 |
printer); internal interface is provided by add_modesyntax(_i); |
|
2724 |
||
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2725 |
* 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
|
2726 |
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
|
2727 |
"symbols" syntax table; |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2728 |
|
2705 | 2729 |
* added token_translation interface (may translate name tokens in |
2756 | 2730 |
arbitrary ways, dependent on their type (free, bound, tfree, ...) and |
3116 | 2731 |
the current print_mode); IMPORTANT: user print translation functions |
2732 |
are responsible for marking newly introduced bounds |
|
2733 |
(Syntax.mark_boundT); |
|
2705 | 2734 |
|
2730 | 2735 |
* token translations for modes "xterm" and "xterm_color" that display |
3006 | 2736 |
names in bold, underline etc. or colors (which requires a color |
2737 |
version of xterm); |
|
2730 | 2738 |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2739 |
* 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
|
2740 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2741 |
* added typed_print_translation (like print_translation, but may |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2742 |
access type of constant); |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2743 |
|
3006 | 2744 |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2745 |
*** Classical Reasoner *** |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2746 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2747 |
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
|
2748 |
some limitations. Blast_tac... |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2749 |
+ ignores addss, addbefore, addafter; this restriction is intrinsic |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2750 |
+ ignores elimination rules that don't have the correct format |
5726 | 2751 |
(the conclusion MUST be a formula variable) |
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2752 |
+ ignores types, which can make HOL proofs fail |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2753 |
+ 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
|
2754 |
[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
|
2755 |
+ 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
|
2756 |
|
3107 | 2757 |
* substitution with equality assumptions no longer permutes other |
2758 |
assumptions; |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2759 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2760 |
* 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
|
2761 |
setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper |
3107 | 2762 |
(and access functions for it); |
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2763 |
|
5726 | 2764 |
* improved combination of classical reasoner and simplifier: |
3317 | 2765 |
+ functions for handling clasimpsets |
2766 |
+ improvement of addss: now the simplifier is called _after_ the |
|
2767 |
safe steps. |
|
2768 |
+ safe variant of addss called addSss: uses safe simplifications |
|
5726 | 2769 |
_during_ the safe steps. It is more complete as it allows multiple |
3317 | 2770 |
instantiations of unknowns (e.g. with slow_tac). |
3006 | 2771 |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2772 |
*** Simplifier *** |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2773 |
|
3006 | 2774 |
* added interface for simplification procedures (functions that |
2775 |
produce *proven* rewrite rules on the fly, depending on current |
|
2776 |
redex); |
|
2777 |
||
2778 |
* ordering on terms as parameter (used for ordered rewriting); |
|
2779 |
||
3107 | 2780 |
* 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
|
2781 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2782 |
* 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
|
2783 |
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
|
2784 |
functions setsolver and addsolver have been renamed to setSolver and |
3107 | 2785 |
addSolver; added safe_asm_full_simp_tac; |
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2786 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2787 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2788 |
*** HOL *** |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2789 |
|
3042 | 2790 |
* a generic induction tactic `induct_tac' which works for all datatypes and |
3107 | 2791 |
also for type `nat'; |
3042 | 2792 |
|
3316 | 2793 |
* a generic case distinction tactic `exhaust_tac' which works for all |
2794 |
datatypes and also for type `nat'; |
|
2795 |
||
2796 |
* each datatype comes with a function `size'; |
|
2797 |
||
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2798 |
* patterns in case expressions allow tuple patterns as arguments to |
3107 | 2799 |
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
|
2800 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2801 |
* primrec now also works with type nat; |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2802 |
|
3338 | 2803 |
* recdef: a new declaration form, allows general recursive functions to be |
2804 |
defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify. |
|
2805 |
||
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2806 |
* the constant for negation has been renamed from "not" to "Not" to |
3107 | 2807 |
harmonize with FOL, ZF, LK, etc.; |
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2808 |
|
3107 | 2809 |
* HOL/ex/LFilter theory of a corecursive "filter" functional for |
2810 |
infinite lists; |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2811 |
|
3227 | 2812 |
* HOL/Modelcheck demonstrates invocation of model checker oracle; |
2813 |
||
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2814 |
* 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
|
2815 |
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
|
2816 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2817 |
* more examples in HOL/MiniML and HOL/Auth; |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2818 |
|
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2819 |
* more default rewrite rules for quantifiers, union/intersection; |
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2820 |
|
3321 | 2821 |
* a new constant `arbitrary == @x.False'; |
2822 |
||
3107 | 2823 |
* HOLCF/IOA replaces old HOL/IOA; |
2824 |
||
5726 | 2825 |
* HOLCF changes: derived all rules and arities |
2826 |
+ axiomatic type classes instead of classes |
|
2653
f1a6997cdc06
described changes for HOLCF-Version without rules and arities
slotosch
parents:
2649
diff
changeset
|
2827 |
+ typedef instead of faking type definitions |
2747 | 2828 |
+ eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc. |
2730 | 2829 |
+ 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
|
2830 |
+ eliminated the types void, one, tr |
f1a6997cdc06
described changes for HOLCF-Version without rules and arities
slotosch
parents:
2649
diff
changeset
|
2831 |
+ 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
|
2832 |
+ eliminated blift from Lift3.thy (use Def instead of blift) |
3107 | 2833 |
all eliminated rules are derived as theorems --> no visible changes ; |
2649 | 2834 |
|
3006 | 2835 |
|
3002
223e5d65faaa
Reorganized under headings. Also documented Blast_tac and LFilter
paulson
parents:
2993
diff
changeset
|
2836 |
*** ZF *** |
2553 | 2837 |
|
2865 | 2838 |
* ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default |
2839 |
rewrite rule; this may affect some proofs. eq_cs is gone but can be put back |
|
2840 |
as ZF_cs addSIs [equalityI]; |
|
2553 | 2841 |
|
2554 | 2842 |
|
2732 | 2843 |
|
2553 | 2844 |
New in Isabelle94-7 (November 96) |
2845 |
--------------------------------- |
|
2846 |
||
2847 |
* allowing negative levels (as offsets) in prlev and choplev; |
|
2848 |
||
2554 | 2849 |
* super-linear speedup for large simplifications; |
2850 |
||
2851 |
* FOL, ZF and HOL now use miniscoping: rewriting pushes |
|
2852 |
quantifications in as far as possible (COULD MAKE EXISTING PROOFS |
|
2853 |
FAIL); can suppress it using the command Delsimps (ex_simps @ |
|
2854 |
all_simps); De Morgan laws are also now included, by default; |
|
2855 |
||
2856 |
* improved printing of ==> : ~: |
|
2857 |
||
2858 |
* new object-logic "Sequents" adds linear logic, while replacing LK |
|
2859 |
and Modal (thanks to Sara Kalvala); |
|
2860 |
||
2861 |
* HOL/Auth: correctness proofs for authentication protocols; |
|
2862 |
||
2863 |
* HOL: new auto_tac combines rewriting and classical reasoning (many |
|
2864 |
examples on HOL/Auth); |
|
2865 |
||
2866 |
* HOL: new command AddIffs for declaring theorems of the form P=Q to |
|
2867 |
the rewriter and classical reasoner simultaneously; |
|
2868 |
||
2869 |
* function uresult no longer returns theorems in "standard" format; |
|
2870 |
regain previous version by: val uresult = standard o uresult; |
|
2871 |
||
2872 |
||
2873 |
||
2874 |
New in Isabelle94-6 |
|
2875 |
------------------- |
|
2876 |
||
2877 |
* oracles -- these establish an interface between Isabelle and trusted |
|
2878 |
external reasoners, which may deliver results as theorems; |
|
2879 |
||
2880 |
* proof objects (in particular record all uses of oracles); |
|
2881 |
||
2882 |
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset; |
|
2883 |
||
2884 |
* "constdefs" section in theory files; |
|
2885 |
||
2886 |
* "primrec" section (HOL) no longer requires names; |
|
2887 |
||
2888 |
* internal type "tactic" now simply "thm -> thm Sequence.seq"; |
|
2889 |
||
2890 |
||
2891 |
||
2892 |
New in Isabelle94-5 |
|
2893 |
------------------- |
|
2894 |
||
2895 |
* reduced space requirements; |
|
2896 |
||
2897 |
* automatic HTML generation from theories; |
|
2898 |
||
2899 |
* theory files no longer require "..." (quotes) around most types; |
|
2900 |
||
2901 |
* new examples, including two proofs of the Church-Rosser theorem; |
|
2902 |
||
2903 |
* non-curried (1994) version of HOL is no longer distributed; |
|
2904 |
||
2553 | 2905 |
|
2557 | 2906 |
|
2907 |
New in Isabelle94-4 |
|
2908 |
------------------- |
|
2909 |
||
2747 | 2910 |
* greatly reduced space requirements; |
2557 | 2911 |
|
2912 |
* theory files (.thy) no longer require \...\ escapes at line breaks; |
|
2913 |
||
5726 | 2914 |
* searchable theorem database (see the section "Retrieving theorems" on |
2557 | 2915 |
page 8 of the Reference Manual); |
2916 |
||
2917 |
* new examples, including Grabczewski's monumental case study of the |
|
2918 |
Axiom of Choice; |
|
2919 |
||
2920 |
* The previous version of HOL renamed to Old_HOL; |
|
2921 |
||
5726 | 2922 |
* The new version of HOL (previously called CHOL) uses a curried syntax |
2557 | 2923 |
for functions. Application looks like f a b instead of f(a,b); |
2924 |
||
2925 |
* Mutually recursive inductive definitions finally work in HOL; |
|
2926 |
||
2927 |
* In ZF, pattern-matching on tuples is now available in all abstractions and |
|
2928 |
translates to the operator "split"; |
|
2929 |
||
2930 |
||
2931 |
||
2932 |
New in Isabelle94-3 |
|
2933 |
------------------- |
|
2934 |
||
5726 | 2935 |
* new infix operator, addss, allowing the classical reasoner to |
2557 | 2936 |
perform simplification at each step of its search. Example: |
5726 | 2937 |
fast_tac (cs addss ss) |
2557 | 2938 |
|
5726 | 2939 |
* a new logic, CHOL, the same as HOL, but with a curried syntax |
2940 |
for functions. Application looks like f a b instead of f(a,b). Also pairs |
|
2557 | 2941 |
look like (a,b) instead of <a,b>; |
2942 |
||
2943 |
* PLEASE NOTE: CHOL will eventually replace HOL! |
|
2944 |
||
2945 |
* In CHOL, pattern-matching on tuples is now available in all abstractions. |
|
2946 |
It translates to the operator "split". A new theory of integers is available; |
|
2947 |
||
2948 |
* In ZF, integer numerals now denote two's-complement binary integers. |
|
2949 |
Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML; |
|
2950 |
||
5726 | 2951 |
* Many new examples: I/O automata, Church-Rosser theorem, equivalents |
2557 | 2952 |
of the Axiom of Choice; |
2953 |
||
2954 |
||
2955 |
||
2956 |
New in Isabelle94-2 |
|
2957 |
------------------- |
|
2958 |
||
5726 | 2959 |
* Significantly faster resolution; |
2557 | 2960 |
|
2961 |
* the different sections in a .thy file can now be mixed and repeated |
|
2962 |
freely; |
|
2963 |
||
2964 |
* Database of theorems for FOL, HOL and ZF. New |
|
2965 |
commands including qed, qed_goal and bind_thm store theorems in the database. |
|
2966 |
||
2967 |
* Simple database queries: return a named theorem (get_thm) or all theorems of |
|
2968 |
a given theory (thms_of), or find out what theory a theorem was proved in |
|
2969 |
(theory_of_thm); |
|
2970 |
||
2971 |
* Bugs fixed in the inductive definition and datatype packages; |
|
2972 |
||
2973 |
* The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs |
|
2974 |
and HOL_dup_cs obsolete; |
|
2975 |
||
2976 |
* Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1 |
|
2977 |
have been removed; |
|
2978 |
||
2979 |
* Simpler definition of function space in ZF; |
|
2980 |
||
2981 |
* new results about cardinal and ordinal arithmetic in ZF; |
|
2982 |
||
2983 |
* 'subtype' facility in HOL for introducing new types as subsets of existing |
|
2984 |
types; |
|
2985 |
||
2986 |
||
2553 | 2987 |
$Id$ |