wenzelm@5363
|
1 |
Isabelle NEWS -- history user-relevant changes
|
wenzelm@5363
|
2 |
==============================================
|
wenzelm@2553
|
3 |
|
wenzelm@48902
|
4 |
New in this Isabelle version
|
wenzelm@48902
|
5 |
----------------------------
|
wenzelm@48902
|
6 |
|
wenzelm@48982
|
7 |
*** General ***
|
wenzelm@48982
|
8 |
|
wenzelm@48982
|
9 |
* Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
|
wenzelm@48982
|
10 |
is called fastforce / fast_force_tac already since Isabelle2011-1.
|
wenzelm@48982
|
11 |
|
wenzelm@49135
|
12 |
* Updated and extended "isar-ref" manual, reduced remaining material
|
wenzelm@49135
|
13 |
in old "ref" manual.
|
wenzelm@49135
|
14 |
|
wenzelm@48982
|
15 |
|
wenzelm@49220
|
16 |
*** Pure ***
|
wenzelm@49220
|
17 |
|
haftmann@49386
|
18 |
* Command "export_code": relative file names are interpreted
|
haftmann@49386
|
19 |
relatively to master directory of current theory rather than
|
haftmann@49386
|
20 |
the rather arbitrary current working directory.
|
haftmann@49386
|
21 |
INCOMPATIBILITY.
|
haftmann@49386
|
22 |
|
wenzelm@49220
|
23 |
* Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
|
wenzelm@49220
|
24 |
use regular rule composition via "OF" / "THEN", or explicit proof
|
wenzelm@49220
|
25 |
structure instead. Note that Isabelle/ML provides a variety of
|
wenzelm@49220
|
26 |
operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
|
wenzelm@49220
|
27 |
with some care where this is really required.
|
wenzelm@49220
|
28 |
|
wenzelm@49220
|
29 |
|
bulwahn@49028
|
30 |
*** HOL ***
|
bulwahn@49028
|
31 |
|
wenzelm@49221
|
32 |
* Simproc "finite_Collect" rewrites set comprehensions into pointfree
|
wenzelm@49221
|
33 |
expressions.
|
bulwahn@49126
|
34 |
|
bulwahn@49028
|
35 |
* Quickcheck:
|
bulwahn@49028
|
36 |
|
bulwahn@49028
|
37 |
- added an optimisation for equality premises.
|
bulwahn@49028
|
38 |
It is switched on by default, and can be switched off by setting
|
bulwahn@49028
|
39 |
the configuration quickcheck_optimise_equality to false.
|
wenzelm@48902
|
40 |
|
boehmes@49084
|
41 |
* The SMT solver Z3 has now by default a restricted set of directly
|
boehmes@49084
|
42 |
supported features. For the full set of features (div/mod, nonlinear
|
boehmes@49084
|
43 |
arithmetic, datatypes/records) with potential proof reconstruction
|
boehmes@49084
|
44 |
failures, enable the configuration option "z3_with_extensions".
|
boehmes@49084
|
45 |
Minor INCOMPATIBILITY.
|
boehmes@49084
|
46 |
|
blanchet@49109
|
47 |
* Sledgehammer:
|
blanchet@49109
|
48 |
|
blanchet@49417
|
49 |
- Added MaSh relevance filter based on machine-learning; see the
|
blanchet@49417
|
50 |
Sledgehammer manual for details.
|
blanchet@49109
|
51 |
- Rationalized type encodings ("type_enc" option).
|
blanchet@49309
|
52 |
- Renamed options:
|
blanchet@49309
|
53 |
max_relevant ~> max_facts
|
blanchet@49309
|
54 |
relevance_thresholds ~> fact_thresholds
|
blanchet@49109
|
55 |
|
wenzelm@49135
|
56 |
|
wenzelm@49221
|
57 |
*** Document preparation ***
|
wenzelm@49221
|
58 |
|
wenzelm@49221
|
59 |
* Default for \<euro> is now based on eurosym package, instead of
|
wenzelm@49221
|
60 |
slightly exotic babel/greek.
|
wenzelm@49221
|
61 |
|
wenzelm@49221
|
62 |
|
wenzelm@49221
|
63 |
*** System ***
|
wenzelm@49221
|
64 |
|
wenzelm@49221
|
65 |
* Discontinued support for Poly/ML 5.2.1, which was the last version
|
wenzelm@49221
|
66 |
without exception positions and advanced ML compiler/toplevel
|
wenzelm@49221
|
67 |
configuration.
|
wenzelm@49221
|
68 |
|
wenzelm@49221
|
69 |
|
wenzelm@49135
|
70 |
|
wenzelm@48333
|
71 |
New in Isabelle2012 (May 2012)
|
wenzelm@48333
|
72 |
------------------------------
|
wenzelm@45961
|
73 |
|
wenzelm@46464
|
74 |
*** General ***
|
wenzelm@46464
|
75 |
|
wenzelm@46485
|
76 |
* Prover IDE (PIDE) improvements:
|
wenzelm@46485
|
77 |
|
wenzelm@48481
|
78 |
- more robust Sledgehammer integration (as before the sledgehammer
|
wenzelm@48677
|
79 |
command-line needs to be typed into the source buffer)
|
wenzelm@46485
|
80 |
- markup for bound variables
|
wenzelm@48677
|
81 |
- markup for types of term variables (displayed as tooltips)
|
wenzelm@47827
|
82 |
- support for user-defined Isar commands within the running session
|
wenzelm@48029
|
83 |
- improved support for Unicode outside original 16bit range
|
wenzelm@48029
|
84 |
e.g. glyph for \<A> (thanks to jEdit 4.5.1)
|
wenzelm@46485
|
85 |
|
wenzelm@48677
|
86 |
* Forward declaration of outer syntax keywords within the theory
|
wenzelm@48677
|
87 |
header -- minor INCOMPATIBILITY for user-defined commands. Allow new
|
wenzelm@48677
|
88 |
commands to be used in the same theory where defined.
|
wenzelm@47356
|
89 |
|
wenzelm@48700
|
90 |
* Auxiliary contexts indicate block structure for specifications with
|
wenzelm@48700
|
91 |
additional parameters and assumptions. Such unnamed contexts may be
|
wenzelm@48700
|
92 |
nested within other targets, like 'theory', 'locale', 'class',
|
wenzelm@48700
|
93 |
'instantiation' etc. Results from the local context are generalized
|
wenzelm@48700
|
94 |
accordingly and applied to the enclosing target context. Example:
|
wenzelm@48700
|
95 |
|
wenzelm@48700
|
96 |
context
|
wenzelm@48700
|
97 |
fixes x y z :: 'a
|
wenzelm@48700
|
98 |
assumes xy: "x = y" and yz: "y = z"
|
wenzelm@48700
|
99 |
begin
|
wenzelm@48700
|
100 |
|
wenzelm@48700
|
101 |
lemma my_trans: "x = z" using xy yz by simp
|
wenzelm@48700
|
102 |
|
wenzelm@48700
|
103 |
end
|
wenzelm@48700
|
104 |
|
wenzelm@48700
|
105 |
thm my_trans
|
wenzelm@48700
|
106 |
|
wenzelm@48700
|
107 |
The most basic application is to factor-out context elements of
|
wenzelm@48700
|
108 |
several fixes/assumes/shows theorem statements, e.g. see
|
wenzelm@48700
|
109 |
~~/src/HOL/Isar_Examples/Group_Context.thy
|
wenzelm@48700
|
110 |
|
wenzelm@48700
|
111 |
Any other local theory specification element works within the "context
|
wenzelm@48700
|
112 |
... begin ... end" block as well.
|
wenzelm@48700
|
113 |
|
wenzelm@48700
|
114 |
* Bundled declarations associate attributed fact expressions with a
|
wenzelm@48700
|
115 |
given name in the context. These may be later included in other
|
wenzelm@48700
|
116 |
contexts. This allows to manage context extensions casually, without
|
wenzelm@48726
|
117 |
the logical dependencies of locales and locale interpretation. See
|
wenzelm@48726
|
118 |
commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
|
wenzelm@48700
|
119 |
|
wenzelm@48700
|
120 |
* Commands 'lemmas' and 'theorems' allow local variables using 'for'
|
wenzelm@48700
|
121 |
declaration, and results are standardized before being stored. Thus
|
wenzelm@48700
|
122 |
old-style "standard" after instantiation or composition of facts
|
wenzelm@48700
|
123 |
becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
|
wenzelm@48700
|
124 |
indices of schematic variables.
|
wenzelm@48700
|
125 |
|
wenzelm@46464
|
126 |
* Rule attributes in local theory declarations (e.g. locale or class)
|
wenzelm@46464
|
127 |
are now statically evaluated: the resulting theorem is stored instead
|
wenzelm@46464
|
128 |
of the original expression. INCOMPATIBILITY in rare situations, where
|
wenzelm@46464
|
129 |
the historic accident of dynamic re-evaluation in interpretations
|
wenzelm@46464
|
130 |
etc. was exploited.
|
wenzelm@46464
|
131 |
|
wenzelm@48677
|
132 |
* New tutorial "Programming and Proving in Isabelle/HOL"
|
wenzelm@48677
|
133 |
("prog-prove"). It completely supersedes "A Tutorial Introduction to
|
wenzelm@48677
|
134 |
Structured Isar Proofs" ("isar-overview"), which has been removed. It
|
wenzelm@48677
|
135 |
also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
|
wenzelm@48677
|
136 |
Logic" as the recommended beginners tutorial, but does not cover all
|
wenzelm@48677
|
137 |
of the material of that old tutorial.
|
huffman@47978
|
138 |
|
wenzelm@48700
|
139 |
* Updated and extended reference manuals: "isar-ref",
|
wenzelm@48700
|
140 |
"implementation", "system"; reduced remaining material in old "ref"
|
wenzelm@48700
|
141 |
manual.
|
wenzelm@48700
|
142 |
|
wenzelm@48700
|
143 |
|
wenzelm@48700
|
144 |
*** Pure ***
|
wenzelm@48700
|
145 |
|
wenzelm@48727
|
146 |
* Command 'definition' no longer exports the foundational "raw_def"
|
wenzelm@48727
|
147 |
into the user context. Minor INCOMPATIBILITY, may use the regular
|
wenzelm@48727
|
148 |
"def" result with attribute "abs_def" to imitate the old version.
|
wenzelm@48727
|
149 |
|
wenzelm@48727
|
150 |
* Attribute "abs_def" turns an equation of the form "f x y == t" into
|
wenzelm@48727
|
151 |
"f == %x y. t", which ensures that "simp" or "unfold" steps always
|
wenzelm@48727
|
152 |
expand it. This also works for object-logic equality. (Formerly
|
wenzelm@48727
|
153 |
undocumented feature.)
|
wenzelm@48727
|
154 |
|
wenzelm@48727
|
155 |
* Sort constraints are now propagated in simultaneous statements, just
|
wenzelm@48727
|
156 |
like type constraints. INCOMPATIBILITY in rare situations, where
|
wenzelm@48727
|
157 |
distinct sorts used to be assigned accidentally. For example:
|
wenzelm@48727
|
158 |
|
wenzelm@48727
|
159 |
lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
|
wenzelm@48727
|
160 |
|
wenzelm@48727
|
161 |
lemma "P (x::'a)" and "Q (y::'a::bar)"
|
wenzelm@48727
|
162 |
-- "now uniform 'a::bar instead of default sort for first occurrence (!)"
|
wenzelm@48700
|
163 |
|
wenzelm@48700
|
164 |
* Rule composition via attribute "OF" (or ML functions OF/MRS) is more
|
wenzelm@48700
|
165 |
tolerant against multiple unifiers, as long as the final result is
|
wenzelm@48700
|
166 |
unique. (As before, rules are composed in canonical right-to-left
|
wenzelm@48700
|
167 |
order to accommodate newly introduced premises.)
|
wenzelm@48700
|
168 |
|
wenzelm@48726
|
169 |
* Renamed some inner syntax categories:
|
wenzelm@48726
|
170 |
|
wenzelm@48726
|
171 |
num ~> num_token
|
wenzelm@48726
|
172 |
xnum ~> xnum_token
|
wenzelm@48726
|
173 |
xstr ~> str_token
|
wenzelm@48726
|
174 |
|
wenzelm@48726
|
175 |
Minor INCOMPATIBILITY. Note that in practice "num_const" or
|
wenzelm@48726
|
176 |
"num_position" etc. are mainly used instead (which also include
|
wenzelm@48726
|
177 |
position information via constraints).
|
wenzelm@48726
|
178 |
|
wenzelm@48726
|
179 |
* Simplified configuration options for syntax ambiguity: see
|
wenzelm@48726
|
180 |
"syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
|
wenzelm@48726
|
181 |
manual. Minor INCOMPATIBILITY.
|
wenzelm@48726
|
182 |
|
wenzelm@48727
|
183 |
* Discontinued configuration option "syntax_positions": atomic terms
|
wenzelm@48727
|
184 |
in parse trees are always annotated by position constraints.
|
wenzelm@48700
|
185 |
|
wenzelm@48700
|
186 |
* Old code generator for SML and its commands 'code_module',
|
wenzelm@48700
|
187 |
'code_library', 'consts_code', 'types_code' have been discontinued.
|
wenzelm@48700
|
188 |
Use commands of the generic code generator instead. INCOMPATIBILITY.
|
wenzelm@48700
|
189 |
|
wenzelm@48700
|
190 |
* Redundant attribute "code_inline" has been discontinued. Use
|
wenzelm@48700
|
191 |
"code_unfold" instead. INCOMPATIBILITY.
|
wenzelm@48700
|
192 |
|
wenzelm@48700
|
193 |
* Dropped attribute "code_unfold_post" in favor of the its dual
|
wenzelm@48700
|
194 |
"code_abbrev", which yields a common pattern in definitions like
|
wenzelm@48700
|
195 |
|
wenzelm@48700
|
196 |
definition [code_abbrev]: "f = t"
|
wenzelm@48700
|
197 |
|
wenzelm@48700
|
198 |
INCOMPATIBILITY.
|
wenzelm@48700
|
199 |
|
wenzelm@48727
|
200 |
* Obsolete 'types' command has been discontinued. Use 'type_synonym'
|
wenzelm@48727
|
201 |
instead. INCOMPATIBILITY.
|
wenzelm@48727
|
202 |
|
wenzelm@48727
|
203 |
* Discontinued old "prems" fact, which used to refer to the accidental
|
wenzelm@48727
|
204 |
collection of foundational premises in the context (already marked as
|
wenzelm@48727
|
205 |
legacy since Isabelle2011).
|
wenzelm@48726
|
206 |
|
wenzelm@48700
|
207 |
|
wenzelm@48700
|
208 |
*** HOL ***
|
wenzelm@48700
|
209 |
|
wenzelm@47031
|
210 |
* Type 'a set is now a proper type constructor (just as before
|
wenzelm@47031
|
211 |
Isabelle2008). Definitions mem_def and Collect_def have disappeared.
|
wenzelm@47031
|
212 |
Non-trivial INCOMPATIBILITY. For developments keeping predicates and
|
wenzelm@48726
|
213 |
sets separate, it is often sufficient to rephrase some set S that has
|
wenzelm@48726
|
214 |
been accidentally used as predicates by "%x. x : S", and some
|
wenzelm@48726
|
215 |
predicate P that has been accidentally used as set by "{x. P x}".
|
wenzelm@48726
|
216 |
Corresponding proofs in a first step should be pruned from any
|
wenzelm@48726
|
217 |
tinkering with former theorems mem_def and Collect_def as far as
|
wenzelm@48726
|
218 |
possible.
|
wenzelm@48726
|
219 |
|
wenzelm@48726
|
220 |
For developments which deliberately mix predicates and sets, a
|
wenzelm@48335
|
221 |
planning step is necessary to determine what should become a predicate
|
wenzelm@48335
|
222 |
and what a set. It can be helpful to carry out that step in
|
wenzelm@47031
|
223 |
Isabelle2011-1 before jumping right into the current release.
|
wenzelm@47031
|
224 |
|
wenzelm@48726
|
225 |
* Code generation by default implements sets as container type rather
|
wenzelm@48726
|
226 |
than predicates. INCOMPATIBILITY.
|
wenzelm@48726
|
227 |
|
wenzelm@48726
|
228 |
* New type synonym 'a rel = ('a * 'a) set
|
wenzelm@48726
|
229 |
|
wenzelm@48335
|
230 |
* The representation of numerals has changed. Datatype "num"
|
wenzelm@48335
|
231 |
represents strictly positive binary numerals, along with functions
|
wenzelm@48335
|
232 |
"numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
|
wenzelm@48726
|
233 |
positive and negated numeric literals, respectively. See also
|
wenzelm@48726
|
234 |
definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
|
wenzelm@48726
|
235 |
user theories may require adaptations as follows:
|
wenzelm@48335
|
236 |
|
wenzelm@48335
|
237 |
- Theorems with number_ring or number_semiring constraints: These
|
wenzelm@48335
|
238 |
classes are gone; use comm_ring_1 or comm_semiring_1 instead.
|
wenzelm@48335
|
239 |
|
wenzelm@48335
|
240 |
- Theories defining numeric types: Remove number, number_semiring,
|
wenzelm@48335
|
241 |
and number_ring instances. Defer all theorems about numerals until
|
wenzelm@48335
|
242 |
after classes one and semigroup_add have been instantiated.
|
wenzelm@48335
|
243 |
|
wenzelm@48335
|
244 |
- Numeral-only simp rules: Replace each rule having a "number_of v"
|
wenzelm@48335
|
245 |
pattern with two copies, one for numeral and one for neg_numeral.
|
wenzelm@48335
|
246 |
|
wenzelm@48335
|
247 |
- Theorems about subclasses of semiring_1 or ring_1: These classes
|
wenzelm@48335
|
248 |
automatically support numerals now, so more simp rules and
|
wenzelm@48335
|
249 |
simprocs may now apply within the proof.
|
wenzelm@48335
|
250 |
|
wenzelm@48335
|
251 |
- Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
|
wenzelm@48335
|
252 |
Redefine using other integer operations.
|
wenzelm@48335
|
253 |
|
wenzelm@48726
|
254 |
* Transfer: New package intended to generalize the existing
|
wenzelm@48726
|
255 |
"descending" method and related theorem attributes from the Quotient
|
wenzelm@48726
|
256 |
package. (Not all functionality is implemented yet, but future
|
wenzelm@48726
|
257 |
development will focus on Transfer as an eventual replacement for the
|
wenzelm@48726
|
258 |
corresponding parts of the Quotient package.)
|
wenzelm@48680
|
259 |
|
wenzelm@48680
|
260 |
- transfer_rule attribute: Maintains a collection of transfer rules,
|
wenzelm@48680
|
261 |
which relate constants at two different types. Transfer rules may
|
wenzelm@48680
|
262 |
relate different type instances of the same polymorphic constant,
|
wenzelm@48680
|
263 |
or they may relate an operation on a raw type to a corresponding
|
wenzelm@48680
|
264 |
operation on an abstract type (quotient or subtype). For example:
|
wenzelm@48680
|
265 |
|
wenzelm@48680
|
266 |
((A ===> B) ===> list_all2 A ===> list_all2 B) map map
|
wenzelm@48680
|
267 |
(cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
|
wenzelm@48680
|
268 |
|
wenzelm@48680
|
269 |
- transfer method: Replaces a subgoal on abstract types with an
|
wenzelm@48680
|
270 |
equivalent subgoal on the corresponding raw types. Constants are
|
wenzelm@48680
|
271 |
replaced with corresponding ones according to the transfer rules.
|
wenzelm@48680
|
272 |
Goals are generalized over all free variables by default; this is
|
huffman@48722
|
273 |
necessary for variables whose types change, but can be overridden
|
wenzelm@48726
|
274 |
for specific variables with e.g. "transfer fixing: x y z". The
|
wenzelm@48680
|
275 |
variant transfer' method allows replacing a subgoal with one that
|
wenzelm@48680
|
276 |
is logically stronger (rather than equivalent).
|
wenzelm@48680
|
277 |
|
wenzelm@48680
|
278 |
- relator_eq attribute: Collects identity laws for relators of
|
wenzelm@48680
|
279 |
various type constructors, e.g. "list_all2 (op =) = (op =)". The
|
wenzelm@48680
|
280 |
transfer method uses these lemmas to infer transfer rules for
|
wenzelm@48680
|
281 |
non-polymorphic constants on the fly.
|
wenzelm@48680
|
282 |
|
wenzelm@48680
|
283 |
- transfer_prover method: Assists with proving a transfer rule for a
|
wenzelm@48680
|
284 |
new constant, provided the constant is defined in terms of other
|
wenzelm@48680
|
285 |
constants that already have transfer rules. It should be applied
|
wenzelm@48680
|
286 |
after unfolding the constant definitions.
|
wenzelm@48680
|
287 |
|
wenzelm@48680
|
288 |
- HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
|
wenzelm@48680
|
289 |
from type nat to type int.
|
wenzelm@48680
|
290 |
|
huffman@48722
|
291 |
* Lifting: New package intended to generalize the quotient_definition
|
huffman@48722
|
292 |
facility of the Quotient package; designed to work with Transfer.
|
wenzelm@48680
|
293 |
|
wenzelm@48680
|
294 |
- lift_definition command: Defines operations on an abstract type in
|
wenzelm@48680
|
295 |
terms of a corresponding operation on a representation
|
wenzelm@48680
|
296 |
type. Example syntax:
|
wenzelm@48680
|
297 |
|
wenzelm@48680
|
298 |
lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
|
wenzelm@48680
|
299 |
is List.insert
|
wenzelm@48680
|
300 |
|
wenzelm@48680
|
301 |
Users must discharge a respectfulness proof obligation when each
|
wenzelm@48680
|
302 |
constant is defined. (For a type copy, i.e. a typedef with UNIV,
|
wenzelm@48680
|
303 |
the proof is discharged automatically.) The obligation is
|
wenzelm@48680
|
304 |
presented in a user-friendly, readable form; a respectfulness
|
wenzelm@48680
|
305 |
theorem in the standard format and a transfer rule are generated
|
wenzelm@48680
|
306 |
by the package.
|
wenzelm@48680
|
307 |
|
wenzelm@48680
|
308 |
- Integration with code_abstype: For typedefs (e.g. subtypes
|
wenzelm@48680
|
309 |
corresponding to a datatype invariant, such as dlist),
|
wenzelm@48680
|
310 |
lift_definition generates a code certificate theorem and sets up
|
wenzelm@48680
|
311 |
code generation for each constant.
|
wenzelm@48680
|
312 |
|
wenzelm@48680
|
313 |
- setup_lifting command: Sets up the Lifting package to work with a
|
wenzelm@48680
|
314 |
user-defined type. The user must provide either a quotient theorem
|
wenzelm@48680
|
315 |
or a type_definition theorem. The package configures transfer
|
wenzelm@48680
|
316 |
rules for equality and quantifiers on the type, and sets up the
|
wenzelm@48680
|
317 |
lift_definition command to work with the type.
|
wenzelm@48680
|
318 |
|
wenzelm@48680
|
319 |
- Usage examples: See Quotient_Examples/Lift_DList.thy,
|
huffman@48722
|
320 |
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
|
huffman@48722
|
321 |
Word/Word.thy and Library/Float.thy.
|
wenzelm@48680
|
322 |
|
wenzelm@48680
|
323 |
* Quotient package:
|
wenzelm@48680
|
324 |
|
wenzelm@48680
|
325 |
- The 'quotient_type' command now supports a 'morphisms' option with
|
wenzelm@48680
|
326 |
rep and abs functions, similar to typedef.
|
wenzelm@48680
|
327 |
|
wenzelm@48680
|
328 |
- 'quotient_type' sets up new types to work with the Lifting and
|
wenzelm@48680
|
329 |
Transfer packages, as with 'setup_lifting'.
|
wenzelm@48680
|
330 |
|
wenzelm@48680
|
331 |
- The 'quotient_definition' command now requires the user to prove a
|
wenzelm@48680
|
332 |
respectfulness property at the point where the constant is
|
wenzelm@48680
|
333 |
defined, similar to lift_definition; INCOMPATIBILITY.
|
wenzelm@48680
|
334 |
|
wenzelm@48680
|
335 |
- Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
|
wenzelm@48680
|
336 |
accordingly, INCOMPATIBILITY.
|
wenzelm@48680
|
337 |
|
wenzelm@48680
|
338 |
* New diagnostic command 'find_unused_assms' to find potentially
|
wenzelm@48680
|
339 |
superfluous assumptions in theorems using Quickcheck.
|
wenzelm@48680
|
340 |
|
wenzelm@48680
|
341 |
* Quickcheck:
|
wenzelm@48680
|
342 |
|
wenzelm@48680
|
343 |
- Quickcheck returns variable assignments as counterexamples, which
|
wenzelm@48680
|
344 |
allows to reveal the underspecification of functions under test.
|
wenzelm@48680
|
345 |
For example, refuting "hd xs = x", it presents the variable
|
wenzelm@48680
|
346 |
assignment xs = [] and x = a1 as a counterexample, assuming that
|
wenzelm@48680
|
347 |
any property is false whenever "hd []" occurs in it.
|
wenzelm@48680
|
348 |
|
wenzelm@48680
|
349 |
These counterexample are marked as potentially spurious, as
|
wenzelm@48680
|
350 |
Quickcheck also returns "xs = []" as a counterexample to the
|
wenzelm@48680
|
351 |
obvious theorem "hd xs = hd xs".
|
wenzelm@48680
|
352 |
|
wenzelm@48680
|
353 |
After finding a potentially spurious counterexample, Quickcheck
|
wenzelm@48680
|
354 |
continues searching for genuine ones.
|
wenzelm@48680
|
355 |
|
wenzelm@48680
|
356 |
By default, Quickcheck shows potentially spurious and genuine
|
wenzelm@48680
|
357 |
counterexamples. The option "genuine_only" sets quickcheck to only
|
wenzelm@48680
|
358 |
show genuine counterexamples.
|
wenzelm@48680
|
359 |
|
wenzelm@48680
|
360 |
- The command 'quickcheck_generator' creates random and exhaustive
|
wenzelm@48680
|
361 |
value generators for a given type and operations.
|
wenzelm@48680
|
362 |
|
wenzelm@48680
|
363 |
It generates values by using the operations as if they were
|
wenzelm@48680
|
364 |
constructors of that type.
|
wenzelm@48680
|
365 |
|
wenzelm@48680
|
366 |
- Support for multisets.
|
wenzelm@48680
|
367 |
|
wenzelm@48680
|
368 |
- Added "use_subtype" options.
|
wenzelm@48680
|
369 |
|
wenzelm@48680
|
370 |
- Added "quickcheck_locale" configuration to specify how to process
|
wenzelm@48680
|
371 |
conjectures in a locale context.
|
wenzelm@48680
|
372 |
|
wenzelm@48726
|
373 |
* Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
|
wenzelm@48726
|
374 |
and affecting 'rat' and 'real'.
|
wenzelm@48680
|
375 |
|
wenzelm@48680
|
376 |
* Sledgehammer:
|
wenzelm@48680
|
377 |
- Integrated more tightly with SPASS, as described in the ITP 2012
|
wenzelm@48680
|
378 |
paper "More SPASS with Isabelle".
|
wenzelm@48680
|
379 |
- Made it try "smt" as a fallback if "metis" fails or times out.
|
wenzelm@48680
|
380 |
- Added support for the following provers: Alt-Ergo (via Why3 and
|
wenzelm@48680
|
381 |
TFF1), iProver, iProver-Eq.
|
wenzelm@48680
|
382 |
- Sped up the minimizer.
|
wenzelm@48680
|
383 |
- Added "lam_trans", "uncurry_aliases", and "minimize" options.
|
wenzelm@48680
|
384 |
- Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
|
wenzelm@48680
|
385 |
- Renamed "sound" option to "strict".
|
wenzelm@48680
|
386 |
|
wenzelm@48726
|
387 |
* Metis: Added possibility to specify lambda translations scheme as a
|
wenzelm@48726
|
388 |
parenthesized argument (e.g., "by (metis (lifting) ...)").
|
wenzelm@48726
|
389 |
|
wenzelm@48726
|
390 |
* SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
|
wenzelm@48726
|
391 |
|
wenzelm@48726
|
392 |
* Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
|
wenzelm@48680
|
393 |
|
wenzelm@48727
|
394 |
* New "case_product" attribute to generate a case rule doing multiple
|
wenzelm@48727
|
395 |
case distinctions at the same time. E.g.
|
wenzelm@48727
|
396 |
|
wenzelm@48727
|
397 |
list.exhaust [case_product nat.exhaust]
|
wenzelm@48727
|
398 |
|
wenzelm@48727
|
399 |
produces a rule which can be used to perform case distinction on both
|
wenzelm@48727
|
400 |
a list and a nat.
|
wenzelm@48727
|
401 |
|
wenzelm@48680
|
402 |
* New "eventually_elim" method as a generalized variant of the
|
wenzelm@48726
|
403 |
eventually_elim* rules. Supports structured proofs.
|
wenzelm@48726
|
404 |
|
wenzelm@48576
|
405 |
* Typedef with implicit set definition is considered legacy. Use
|
wenzelm@48576
|
406 |
"typedef (open)" form instead, which will eventually become the
|
wenzelm@48576
|
407 |
default.
|
wenzelm@48576
|
408 |
|
wenzelm@48727
|
409 |
* Record: code generation can be switched off manually with
|
wenzelm@48727
|
410 |
|
wenzelm@48727
|
411 |
declare [[record_coden = false]] -- "default true"
|
wenzelm@48727
|
412 |
|
wenzelm@48727
|
413 |
* Datatype: type parameters allow explicit sort constraints.
|
wenzelm@48727
|
414 |
|
wenzelm@48726
|
415 |
* Concrete syntax for case expressions includes constraints for source
|
wenzelm@48726
|
416 |
positions, and thus produces Prover IDE markup for its bindings.
|
wenzelm@48726
|
417 |
INCOMPATIBILITY for old-style syntax translations that augment the
|
wenzelm@48726
|
418 |
pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
|
wenzelm@48726
|
419 |
one_case.
|
wenzelm@48726
|
420 |
|
wenzelm@48726
|
421 |
* Clarified attribute "mono_set": pure declaration without modifying
|
wenzelm@48726
|
422 |
the result of the fact expression.
|
wenzelm@48726
|
423 |
|
haftmann@47620
|
424 |
* More default pred/set conversions on a couple of relation operations
|
wenzelm@48335
|
425 |
and predicates. Added powers of predicate relations. Consolidation
|
wenzelm@48335
|
426 |
of some relation theorems:
|
haftmann@47620
|
427 |
|
haftmann@47620
|
428 |
converse_def ~> converse_unfold
|
haftmann@48415
|
429 |
rel_comp_def ~> relcomp_unfold
|
haftmann@48691
|
430 |
symp_def ~> (modified, use symp_def and sym_def instead)
|
haftmann@47620
|
431 |
transp_def ~> transp_trans
|
haftmann@47620
|
432 |
Domain_def ~> Domain_unfold
|
haftmann@47620
|
433 |
Range_def ~> Domain_converse [symmetric]
|
haftmann@47620
|
434 |
|
haftmann@47847
|
435 |
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
|
haftmann@47847
|
436 |
|
wenzelm@48335
|
437 |
See theory "Relation" for examples for making use of pred/set
|
wenzelm@48335
|
438 |
conversions by means of attributes "to_set" and "to_pred".
|
haftmann@47952
|
439 |
|
haftmann@47620
|
440 |
INCOMPATIBILITY.
|
haftmann@47620
|
441 |
|
bulwahn@47191
|
442 |
* Renamed facts about the power operation on relations, i.e., relpow
|
wenzelm@48335
|
443 |
to match the constant's name:
|
wenzelm@48334
|
444 |
|
wenzelm@47334
|
445 |
rel_pow_1 ~> relpow_1
|
bulwahn@47191
|
446 |
rel_pow_0_I ~> relpow_0_I
|
bulwahn@47191
|
447 |
rel_pow_Suc_I ~> relpow_Suc_I
|
bulwahn@47191
|
448 |
rel_pow_Suc_I2 ~> relpow_Suc_I2
|
bulwahn@47191
|
449 |
rel_pow_0_E ~> relpow_0_E
|
bulwahn@47191
|
450 |
rel_pow_Suc_E ~> relpow_Suc_E
|
bulwahn@47191
|
451 |
rel_pow_E ~> relpow_E
|
wenzelm@47334
|
452 |
rel_pow_Suc_D2 ~> relpow_Suc_D2
|
wenzelm@48334
|
453 |
rel_pow_Suc_E2 ~> relpow_Suc_E2
|
bulwahn@47191
|
454 |
rel_pow_Suc_D2' ~> relpow_Suc_D2'
|
bulwahn@47191
|
455 |
rel_pow_E2 ~> relpow_E2
|
bulwahn@47191
|
456 |
rel_pow_add ~> relpow_add
|
bulwahn@47191
|
457 |
rel_pow_commute ~> relpow
|
bulwahn@47191
|
458 |
rel_pow_empty ~> relpow_empty:
|
bulwahn@47191
|
459 |
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
|
bulwahn@47191
|
460 |
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
|
bulwahn@47191
|
461 |
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
|
bulwahn@47191
|
462 |
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
|
bulwahn@47191
|
463 |
rel_pow_fun_conv ~> relpow_fun_conv
|
bulwahn@47191
|
464 |
rel_pow_finite_bounded1 ~> relpow_finite_bounded1
|
bulwahn@47191
|
465 |
rel_pow_finite_bounded ~> relpow_finite_bounded
|
bulwahn@47191
|
466 |
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
|
bulwahn@47191
|
467 |
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
|
bulwahn@47191
|
468 |
single_valued_rel_pow ~> single_valued_relpow
|
wenzelm@48334
|
469 |
|
bulwahn@47191
|
470 |
INCOMPATIBILITY.
|
bulwahn@47191
|
471 |
|
bulwahn@48319
|
472 |
* Theory Relation: Consolidated constant name for relation composition
|
wenzelm@48335
|
473 |
and corresponding theorem names:
|
wenzelm@48335
|
474 |
|
haftmann@48415
|
475 |
- Renamed constant rel_comp to relcomp.
|
wenzelm@48335
|
476 |
|
bulwahn@48319
|
477 |
- Dropped abbreviation pred_comp. Use relcompp instead.
|
wenzelm@48335
|
478 |
|
bulwahn@48319
|
479 |
- Renamed theorems:
|
wenzelm@48335
|
480 |
|
bulwahn@48319
|
481 |
rel_compI ~> relcompI
|
bulwahn@48319
|
482 |
rel_compEpair ~> relcompEpair
|
bulwahn@48319
|
483 |
rel_compE ~> relcompE
|
bulwahn@48319
|
484 |
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
|
bulwahn@48319
|
485 |
rel_comp_empty1 ~> relcomp_empty1
|
bulwahn@48319
|
486 |
rel_comp_mono ~> relcomp_mono
|
bulwahn@48319
|
487 |
rel_comp_subset_Sigma ~> relcomp_subset_Sigma
|
bulwahn@48319
|
488 |
rel_comp_distrib ~> relcomp_distrib
|
bulwahn@48319
|
489 |
rel_comp_distrib2 ~> relcomp_distrib2
|
bulwahn@48319
|
490 |
rel_comp_UNION_distrib ~> relcomp_UNION_distrib
|
bulwahn@48319
|
491 |
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
|
bulwahn@48319
|
492 |
single_valued_rel_comp ~> single_valued_relcomp
|
haftmann@48415
|
493 |
rel_comp_def ~> relcomp_unfold
|
bulwahn@48319
|
494 |
converse_rel_comp ~> converse_relcomp
|
bulwahn@48319
|
495 |
pred_compI ~> relcomppI
|
bulwahn@48319
|
496 |
pred_compE ~> relcomppE
|
bulwahn@48319
|
497 |
pred_comp_bot1 ~> relcompp_bot1
|
bulwahn@48319
|
498 |
pred_comp_bot2 ~> relcompp_bot2
|
bulwahn@48319
|
499 |
transp_pred_comp_less_eq ~> transp_relcompp_less_eq
|
bulwahn@48319
|
500 |
pred_comp_mono ~> relcompp_mono
|
bulwahn@48319
|
501 |
pred_comp_distrib ~> relcompp_distrib
|
bulwahn@48319
|
502 |
pred_comp_distrib2 ~> relcompp_distrib2
|
bulwahn@48319
|
503 |
converse_pred_comp ~> converse_relcompp
|
wenzelm@48335
|
504 |
|
bulwahn@48319
|
505 |
finite_rel_comp ~> finite_relcomp
|
wenzelm@48335
|
506 |
|
bulwahn@48319
|
507 |
set_rel_comp ~> set_relcomp
|
bulwahn@48319
|
508 |
|
bulwahn@48319
|
509 |
INCOMPATIBILITY.
|
bulwahn@48319
|
510 |
|
haftmann@48416
|
511 |
* Theory Divides: Discontinued redundant theorems about div and mod.
|
haftmann@48416
|
512 |
INCOMPATIBILITY, use the corresponding generic theorems instead.
|
haftmann@48416
|
513 |
|
haftmann@48416
|
514 |
DIVISION_BY_ZERO ~> div_by_0, mod_by_0
|
haftmann@48416
|
515 |
zdiv_self ~> div_self
|
haftmann@48416
|
516 |
zmod_self ~> mod_self
|
haftmann@48416
|
517 |
zdiv_zero ~> div_0
|
haftmann@48416
|
518 |
zmod_zero ~> mod_0
|
haftmann@48416
|
519 |
zdiv_zmod_equality ~> div_mod_equality2
|
haftmann@48416
|
520 |
zdiv_zmod_equality2 ~> div_mod_equality
|
haftmann@48416
|
521 |
zmod_zdiv_trivial ~> mod_div_trivial
|
haftmann@48416
|
522 |
zdiv_zminus_zminus ~> div_minus_minus
|
haftmann@48416
|
523 |
zmod_zminus_zminus ~> mod_minus_minus
|
haftmann@48416
|
524 |
zdiv_zminus2 ~> div_minus_right
|
haftmann@48416
|
525 |
zmod_zminus2 ~> mod_minus_right
|
haftmann@48416
|
526 |
zdiv_minus1_right ~> div_minus1_right
|
haftmann@48416
|
527 |
zmod_minus1_right ~> mod_minus1_right
|
haftmann@48416
|
528 |
zdvd_mult_div_cancel ~> dvd_mult_div_cancel
|
haftmann@48416
|
529 |
zmod_zmult1_eq ~> mod_mult_right_eq
|
haftmann@48416
|
530 |
zpower_zmod ~> power_mod
|
haftmann@48416
|
531 |
zdvd_zmod ~> dvd_mod
|
haftmann@48416
|
532 |
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
|
haftmann@48416
|
533 |
mod_mult_distrib ~> mult_mod_left
|
haftmann@48416
|
534 |
mod_mult_distrib2 ~> mult_mod_right
|
haftmann@48416
|
535 |
|
haftmann@48416
|
536 |
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
|
haftmann@48416
|
537 |
generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
|
haftmann@48416
|
538 |
|
haftmann@48417
|
539 |
* Finite_Set.fold now qualified. INCOMPATIBILITY.
|
haftmann@48417
|
540 |
|
haftmann@48418
|
541 |
* Consolidated theorem names concerning fold combinators:
|
haftmann@48416
|
542 |
|
haftmann@48416
|
543 |
inf_INFI_fold_inf ~> inf_INF_fold_inf
|
haftmann@48416
|
544 |
sup_SUPR_fold_sup ~> sup_SUP_fold_sup
|
haftmann@48416
|
545 |
INFI_fold_inf ~> INF_fold_inf
|
haftmann@48416
|
546 |
SUPR_fold_sup ~> SUP_fold_sup
|
haftmann@48416
|
547 |
union_set ~> union_set_fold
|
haftmann@48416
|
548 |
minus_set ~> minus_set_fold
|
haftmann@48416
|
549 |
INFI_set_fold ~> INF_set_fold
|
haftmann@48416
|
550 |
SUPR_set_fold ~> SUP_set_fold
|
haftmann@48416
|
551 |
INF_code ~> INF_set_foldr
|
haftmann@48416
|
552 |
SUP_code ~> SUP_set_foldr
|
haftmann@48416
|
553 |
foldr.simps ~> foldr.simps (in point-free formulation)
|
haftmann@48416
|
554 |
foldr_fold_rev ~> foldr_conv_fold
|
haftmann@48416
|
555 |
foldl_fold ~> foldl_conv_fold
|
haftmann@48416
|
556 |
foldr_foldr ~> foldr_conv_foldl
|
haftmann@48416
|
557 |
foldl_foldr ~> foldl_conv_foldr
|
haftmann@48418
|
558 |
fold_set_remdups ~> fold_set_fold_remdups
|
haftmann@48418
|
559 |
fold_set ~> fold_set_fold
|
haftmann@48418
|
560 |
fold1_set ~> fold1_set_fold
|
haftmann@48416
|
561 |
|
haftmann@48416
|
562 |
INCOMPATIBILITY.
|
haftmann@48416
|
563 |
|
haftmann@48416
|
564 |
* Dropped rarely useful theorems concerning fold combinators:
|
haftmann@48416
|
565 |
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
|
haftmann@48416
|
566 |
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
|
haftmann@48416
|
567 |
concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
|
haftmann@48416
|
568 |
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
|
haftmann@48416
|
569 |
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
|
haftmann@48416
|
570 |
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
|
haftmann@48416
|
571 |
INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
|
haftmann@48416
|
572 |
and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
|
haftmann@48416
|
573 |
useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
|
haftmann@48416
|
574 |
unfolding "foldr_conv_fold" and "foldl_conv_fold".
|
haftmann@48416
|
575 |
|
haftmann@48416
|
576 |
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
|
haftmann@48416
|
577 |
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
|
haftmann@48416
|
578 |
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
|
haftmann@48416
|
579 |
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
|
haftmann@48416
|
580 |
lemmas over fold rather than foldr, or make use of lemmas
|
haftmann@48416
|
581 |
fold_conv_foldr and fold_rev.
|
haftmann@48416
|
582 |
|
haftmann@48416
|
583 |
* Congruence rules Option.map_cong and Option.bind_cong for recursion
|
haftmann@48416
|
584 |
through option types.
|
haftmann@48416
|
585 |
|
wenzelm@48727
|
586 |
* "Transitive_Closure.ntrancl": bounded transitive closure on
|
wenzelm@48727
|
587 |
relations.
|
wenzelm@48727
|
588 |
|
wenzelm@48727
|
589 |
* Constant "Set.not_member" now qualified. INCOMPATIBILITY.
|
wenzelm@48727
|
590 |
|
wenzelm@48727
|
591 |
* Theory Int: Discontinued many legacy theorems specific to type int.
|
wenzelm@48727
|
592 |
INCOMPATIBILITY, use the corresponding generic theorems instead.
|
wenzelm@48727
|
593 |
|
wenzelm@48727
|
594 |
zminus_zminus ~> minus_minus
|
wenzelm@48727
|
595 |
zminus_0 ~> minus_zero
|
wenzelm@48727
|
596 |
zminus_zadd_distrib ~> minus_add_distrib
|
wenzelm@48727
|
597 |
zadd_commute ~> add_commute
|
wenzelm@48727
|
598 |
zadd_assoc ~> add_assoc
|
wenzelm@48727
|
599 |
zadd_left_commute ~> add_left_commute
|
wenzelm@48727
|
600 |
zadd_ac ~> add_ac
|
wenzelm@48727
|
601 |
zmult_ac ~> mult_ac
|
wenzelm@48727
|
602 |
zadd_0 ~> add_0_left
|
wenzelm@48727
|
603 |
zadd_0_right ~> add_0_right
|
wenzelm@48727
|
604 |
zadd_zminus_inverse2 ~> left_minus
|
wenzelm@48727
|
605 |
zmult_zminus ~> mult_minus_left
|
wenzelm@48727
|
606 |
zmult_commute ~> mult_commute
|
wenzelm@48727
|
607 |
zmult_assoc ~> mult_assoc
|
wenzelm@48727
|
608 |
zadd_zmult_distrib ~> left_distrib
|
wenzelm@48727
|
609 |
zadd_zmult_distrib2 ~> right_distrib
|
wenzelm@48727
|
610 |
zdiff_zmult_distrib ~> left_diff_distrib
|
wenzelm@48727
|
611 |
zdiff_zmult_distrib2 ~> right_diff_distrib
|
wenzelm@48727
|
612 |
zmult_1 ~> mult_1_left
|
wenzelm@48727
|
613 |
zmult_1_right ~> mult_1_right
|
wenzelm@48727
|
614 |
zle_refl ~> order_refl
|
wenzelm@48727
|
615 |
zle_trans ~> order_trans
|
wenzelm@48727
|
616 |
zle_antisym ~> order_antisym
|
wenzelm@48727
|
617 |
zle_linear ~> linorder_linear
|
wenzelm@48727
|
618 |
zless_linear ~> linorder_less_linear
|
wenzelm@48727
|
619 |
zadd_left_mono ~> add_left_mono
|
wenzelm@48727
|
620 |
zadd_strict_right_mono ~> add_strict_right_mono
|
wenzelm@48727
|
621 |
zadd_zless_mono ~> add_less_le_mono
|
wenzelm@48727
|
622 |
int_0_less_1 ~> zero_less_one
|
wenzelm@48727
|
623 |
int_0_neq_1 ~> zero_neq_one
|
wenzelm@48727
|
624 |
zless_le ~> less_le
|
wenzelm@48727
|
625 |
zpower_zadd_distrib ~> power_add
|
wenzelm@48727
|
626 |
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
|
wenzelm@48727
|
627 |
zero_le_zpower_abs ~> zero_le_power_abs
|
wenzelm@48727
|
628 |
|
wenzelm@48727
|
629 |
* Theory Deriv: Renamed
|
wenzelm@48727
|
630 |
|
wenzelm@48727
|
631 |
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
|
wenzelm@48727
|
632 |
|
wenzelm@48727
|
633 |
* Theory Library/Multiset: Improved code generation of multisets.
|
wenzelm@48727
|
634 |
|
wenzelm@48726
|
635 |
* Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
|
krauss@48572
|
636 |
are expressed via type classes again. The special syntax
|
krauss@48572
|
637 |
\<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
|
krauss@48572
|
638 |
setsum_set, which is now subsumed by Big_Operators.setsum.
|
krauss@48572
|
639 |
INCOMPATIBILITY.
|
krauss@48572
|
640 |
|
wenzelm@47031
|
641 |
* Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
|
wenzelm@47031
|
642 |
use theory HOL/Library/Nat_Bijection instead.
|
wenzelm@47031
|
643 |
|
wenzelm@48335
|
644 |
* Theory HOL/Library/RBT_Impl: Backing implementation of red-black
|
wenzelm@48335
|
645 |
trees is now inside a type class context. Names of affected
|
wenzelm@48335
|
646 |
operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
|
wenzelm@48335
|
647 |
theories working directly with raw red-black trees, adapt the names as
|
wenzelm@48335
|
648 |
follows:
|
Andreas@48323
|
649 |
|
Andreas@48323
|
650 |
Operations:
|
Andreas@48323
|
651 |
bulkload -> rbt_bulkload
|
Andreas@48323
|
652 |
del_from_left -> rbt_del_from_left
|
Andreas@48323
|
653 |
del_from_right -> rbt_del_from_right
|
Andreas@48323
|
654 |
del -> rbt_del
|
Andreas@48323
|
655 |
delete -> rbt_delete
|
Andreas@48323
|
656 |
ins -> rbt_ins
|
Andreas@48323
|
657 |
insert -> rbt_insert
|
Andreas@48323
|
658 |
insertw -> rbt_insert_with
|
Andreas@48323
|
659 |
insert_with_key -> rbt_insert_with_key
|
Andreas@48323
|
660 |
map_entry -> rbt_map_entry
|
Andreas@48323
|
661 |
lookup -> rbt_lookup
|
Andreas@48323
|
662 |
sorted -> rbt_sorted
|
Andreas@48323
|
663 |
tree_greater -> rbt_greater
|
Andreas@48323
|
664 |
tree_less -> rbt_less
|
Andreas@48323
|
665 |
tree_less_symbol -> rbt_less_symbol
|
Andreas@48323
|
666 |
union -> rbt_union
|
Andreas@48323
|
667 |
union_with -> rbt_union_with
|
Andreas@48323
|
668 |
union_with_key -> rbt_union_with_key
|
Andreas@48323
|
669 |
|
Andreas@48323
|
670 |
Lemmas:
|
Andreas@48323
|
671 |
balance_left_sorted -> balance_left_rbt_sorted
|
Andreas@48323
|
672 |
balance_left_tree_greater -> balance_left_rbt_greater
|
Andreas@48323
|
673 |
balance_left_tree_less -> balance_left_rbt_less
|
Andreas@48323
|
674 |
balance_right_sorted -> balance_right_rbt_sorted
|
Andreas@48323
|
675 |
balance_right_tree_greater -> balance_right_rbt_greater
|
Andreas@48323
|
676 |
balance_right_tree_less -> balance_right_rbt_less
|
Andreas@48323
|
677 |
balance_sorted -> balance_rbt_sorted
|
Andreas@48323
|
678 |
balance_tree_greater -> balance_rbt_greater
|
Andreas@48323
|
679 |
balance_tree_less -> balance_rbt_less
|
Andreas@48323
|
680 |
bulkload_is_rbt -> rbt_bulkload_is_rbt
|
Andreas@48323
|
681 |
combine_sorted -> combine_rbt_sorted
|
Andreas@48323
|
682 |
combine_tree_greater -> combine_rbt_greater
|
Andreas@48323
|
683 |
combine_tree_less -> combine_rbt_less
|
Andreas@48323
|
684 |
delete_in_tree -> rbt_delete_in_tree
|
Andreas@48323
|
685 |
delete_is_rbt -> rbt_delete_is_rbt
|
Andreas@48323
|
686 |
del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
|
Andreas@48323
|
687 |
del_from_left_tree_less -> rbt_del_from_left_rbt_less
|
Andreas@48323
|
688 |
del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
|
Andreas@48323
|
689 |
del_from_right_tree_less -> rbt_del_from_right_rbt_less
|
Andreas@48323
|
690 |
del_in_tree -> rbt_del_in_tree
|
Andreas@48323
|
691 |
del_inv1_inv2 -> rbt_del_inv1_inv2
|
Andreas@48323
|
692 |
del_sorted -> rbt_del_rbt_sorted
|
Andreas@48323
|
693 |
del_tree_greater -> rbt_del_rbt_greater
|
Andreas@48323
|
694 |
del_tree_less -> rbt_del_rbt_less
|
Andreas@48323
|
695 |
dom_lookup_Branch -> dom_rbt_lookup_Branch
|
Andreas@48323
|
696 |
entries_lookup -> entries_rbt_lookup
|
Andreas@48323
|
697 |
finite_dom_lookup -> finite_dom_rbt_lookup
|
Andreas@48323
|
698 |
insert_sorted -> rbt_insert_rbt_sorted
|
Andreas@48323
|
699 |
insertw_is_rbt -> rbt_insertw_is_rbt
|
Andreas@48323
|
700 |
insertwk_is_rbt -> rbt_insertwk_is_rbt
|
Andreas@48323
|
701 |
insertwk_sorted -> rbt_insertwk_rbt_sorted
|
Andreas@48323
|
702 |
insertw_sorted -> rbt_insertw_rbt_sorted
|
Andreas@48323
|
703 |
ins_sorted -> ins_rbt_sorted
|
Andreas@48323
|
704 |
ins_tree_greater -> ins_rbt_greater
|
Andreas@48323
|
705 |
ins_tree_less -> ins_rbt_less
|
Andreas@48323
|
706 |
is_rbt_sorted -> is_rbt_rbt_sorted
|
Andreas@48323
|
707 |
lookup_balance -> rbt_lookup_balance
|
Andreas@48323
|
708 |
lookup_bulkload -> rbt_lookup_rbt_bulkload
|
Andreas@48323
|
709 |
lookup_delete -> rbt_lookup_rbt_delete
|
Andreas@48323
|
710 |
lookup_Empty -> rbt_lookup_Empty
|
Andreas@48323
|
711 |
lookup_from_in_tree -> rbt_lookup_from_in_tree
|
Andreas@48323
|
712 |
lookup_in_tree -> rbt_lookup_in_tree
|
Andreas@48323
|
713 |
lookup_ins -> rbt_lookup_ins
|
Andreas@48323
|
714 |
lookup_insert -> rbt_lookup_rbt_insert
|
Andreas@48323
|
715 |
lookup_insertw -> rbt_lookup_rbt_insertw
|
Andreas@48323
|
716 |
lookup_insertwk -> rbt_lookup_rbt_insertwk
|
Andreas@48323
|
717 |
lookup_keys -> rbt_lookup_keys
|
Andreas@48323
|
718 |
lookup_map -> rbt_lookup_map
|
Andreas@48323
|
719 |
lookup_map_entry -> rbt_lookup_rbt_map_entry
|
Andreas@48323
|
720 |
lookup_tree_greater -> rbt_lookup_rbt_greater
|
Andreas@48323
|
721 |
lookup_tree_less -> rbt_lookup_rbt_less
|
Andreas@48323
|
722 |
lookup_union -> rbt_lookup_rbt_union
|
Andreas@48323
|
723 |
map_entry_color_of -> rbt_map_entry_color_of
|
Andreas@48323
|
724 |
map_entry_inv1 -> rbt_map_entry_inv1
|
Andreas@48323
|
725 |
map_entry_inv2 -> rbt_map_entry_inv2
|
Andreas@48323
|
726 |
map_entry_is_rbt -> rbt_map_entry_is_rbt
|
Andreas@48323
|
727 |
map_entry_sorted -> rbt_map_entry_rbt_sorted
|
Andreas@48323
|
728 |
map_entry_tree_greater -> rbt_map_entry_rbt_greater
|
Andreas@48323
|
729 |
map_entry_tree_less -> rbt_map_entry_rbt_less
|
Andreas@48323
|
730 |
map_tree_greater -> map_rbt_greater
|
Andreas@48323
|
731 |
map_tree_less -> map_rbt_less
|
Andreas@48323
|
732 |
map_sorted -> map_rbt_sorted
|
Andreas@48323
|
733 |
paint_sorted -> paint_rbt_sorted
|
Andreas@48323
|
734 |
paint_lookup -> paint_rbt_lookup
|
Andreas@48323
|
735 |
paint_tree_greater -> paint_rbt_greater
|
Andreas@48323
|
736 |
paint_tree_less -> paint_rbt_less
|
Andreas@48323
|
737 |
sorted_entries -> rbt_sorted_entries
|
Andreas@48323
|
738 |
tree_greater_eq_trans -> rbt_greater_eq_trans
|
Andreas@48323
|
739 |
tree_greater_nit -> rbt_greater_nit
|
Andreas@48323
|
740 |
tree_greater_prop -> rbt_greater_prop
|
Andreas@48323
|
741 |
tree_greater_simps -> rbt_greater_simps
|
Andreas@48323
|
742 |
tree_greater_trans -> rbt_greater_trans
|
Andreas@48323
|
743 |
tree_less_eq_trans -> rbt_less_eq_trans
|
Andreas@48323
|
744 |
tree_less_nit -> rbt_less_nit
|
Andreas@48323
|
745 |
tree_less_prop -> rbt_less_prop
|
Andreas@48323
|
746 |
tree_less_simps -> rbt_less_simps
|
Andreas@48323
|
747 |
tree_less_trans -> rbt_less_trans
|
Andreas@48323
|
748 |
tree_ord_props -> rbt_ord_props
|
Andreas@48323
|
749 |
union_Branch -> rbt_union_Branch
|
Andreas@48323
|
750 |
union_is_rbt -> rbt_union_is_rbt
|
Andreas@48323
|
751 |
unionw_is_rbt -> rbt_unionw_is_rbt
|
Andreas@48323
|
752 |
unionwk_is_rbt -> rbt_unionwk_is_rbt
|
Andreas@48323
|
753 |
unionwk_sorted -> rbt_unionwk_rbt_sorted
|
Andreas@48323
|
754 |
|
wenzelm@48678
|
755 |
* Theory HOL/Library/Float: Floating point numbers are now defined as
|
wenzelm@48678
|
756 |
a subset of the real numbers. All operations are defined using the
|
wenzelm@48678
|
757 |
lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
|
hoelzl@48479
|
758 |
|
hoelzl@48479
|
759 |
Changed Operations:
|
hoelzl@48493
|
760 |
float_abs -> abs
|
hoelzl@48493
|
761 |
float_nprt -> nprt
|
hoelzl@48493
|
762 |
float_pprt -> pprt
|
hoelzl@48493
|
763 |
pow2 -> use powr
|
hoelzl@48493
|
764 |
round_down -> float_round_down
|
hoelzl@48493
|
765 |
round_up -> float_round_up
|
hoelzl@48493
|
766 |
scale -> exponent
|
hoelzl@48493
|
767 |
|
hoelzl@48493
|
768 |
Removed Operations:
|
hoelzl@48493
|
769 |
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
|
hoelzl@48493
|
770 |
|
hoelzl@48493
|
771 |
Renamed Lemmas:
|
hoelzl@48493
|
772 |
abs_float_def -> Float.compute_float_abs
|
hoelzl@48493
|
773 |
bitlen_ge0 -> bitlen_nonneg
|
hoelzl@48493
|
774 |
bitlen.simps -> Float.compute_bitlen
|
hoelzl@48493
|
775 |
float_components -> Float_mantissa_exponent
|
hoelzl@48493
|
776 |
float_divl.simps -> Float.compute_float_divl
|
hoelzl@48493
|
777 |
float_divr.simps -> Float.compute_float_divr
|
hoelzl@48493
|
778 |
float_eq_odd -> mult_powr_eq_mult_powr_iff
|
hoelzl@48493
|
779 |
float_power -> real_of_float_power
|
hoelzl@48493
|
780 |
lapprox_posrat_def -> Float.compute_lapprox_posrat
|
hoelzl@48493
|
781 |
lapprox_rat.simps -> Float.compute_lapprox_rat
|
hoelzl@48493
|
782 |
le_float_def' -> Float.compute_float_le
|
hoelzl@48493
|
783 |
le_float_def -> less_eq_float.rep_eq
|
hoelzl@48493
|
784 |
less_float_def' -> Float.compute_float_less
|
hoelzl@48493
|
785 |
less_float_def -> less_float.rep_eq
|
hoelzl@48493
|
786 |
normfloat_def -> Float.compute_normfloat
|
hoelzl@48493
|
787 |
normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
|
hoelzl@48493
|
788 |
normfloat -> normfloat_def
|
hoelzl@48493
|
789 |
normfloat_unique -> use normfloat_def
|
hoelzl@48493
|
790 |
number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
|
hoelzl@48493
|
791 |
one_float_def -> Float.compute_float_one
|
hoelzl@48493
|
792 |
plus_float_def -> Float.compute_float_plus
|
hoelzl@48493
|
793 |
rapprox_posrat_def -> Float.compute_rapprox_posrat
|
hoelzl@48493
|
794 |
rapprox_rat.simps -> Float.compute_rapprox_rat
|
hoelzl@48493
|
795 |
real_of_float_0 -> zero_float.rep_eq
|
hoelzl@48493
|
796 |
real_of_float_1 -> one_float.rep_eq
|
hoelzl@48493
|
797 |
real_of_float_abs -> abs_float.rep_eq
|
hoelzl@48493
|
798 |
real_of_float_add -> plus_float.rep_eq
|
hoelzl@48493
|
799 |
real_of_float_minus -> uminus_float.rep_eq
|
hoelzl@48493
|
800 |
real_of_float_mult -> times_float.rep_eq
|
hoelzl@48493
|
801 |
real_of_float_simp -> Float.rep_eq
|
hoelzl@48493
|
802 |
real_of_float_sub -> minus_float.rep_eq
|
hoelzl@48493
|
803 |
round_down.simps -> Float.compute_float_round_down
|
hoelzl@48493
|
804 |
round_up.simps -> Float.compute_float_round_up
|
hoelzl@48493
|
805 |
times_float_def -> Float.compute_float_times
|
hoelzl@48493
|
806 |
uminus_float_def -> Float.compute_float_uminus
|
hoelzl@48493
|
807 |
zero_float_def -> Float.compute_float_zero
|
hoelzl@48493
|
808 |
|
hoelzl@48493
|
809 |
Lemmas not necessary anymore, use the transfer method:
|
hoelzl@48493
|
810 |
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
|
hoelzl@48493
|
811 |
float_divr, float_le_simp, float_less1_mantissa_bound,
|
hoelzl@48493
|
812 |
float_less_simp, float_less_zero, float_le_zero,
|
hoelzl@48493
|
813 |
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
|
hoelzl@48493
|
814 |
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
|
hoelzl@48493
|
815 |
lapprox_rat_bottom, normalized_float, rapprox_posrat,
|
hoelzl@48493
|
816 |
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
|
hoelzl@48493
|
817 |
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
|
hoelzl@48493
|
818 |
round_up, zero_le_float, zero_less_float
|
hoelzl@48479
|
819 |
|
wenzelm@48727
|
820 |
* New theory HOL/Library/DAList provides an abstract type for
|
wenzelm@48727
|
821 |
association lists with distinct keys.
|
wenzelm@48726
|
822 |
|
wenzelm@48737
|
823 |
* Session HOL/IMP: Added new theory of abstract interpretation of
|
wenzelm@48737
|
824 |
annotated commands.
|
wenzelm@48737
|
825 |
|
wenzelm@48726
|
826 |
* Session HOL-Import: Re-implementation from scratch is faster,
|
wenzelm@48726
|
827 |
simpler, and more scalable. Requires a proof bundle, which is
|
wenzelm@48726
|
828 |
available as an external component. Discontinued old (and mostly
|
wenzelm@48726
|
829 |
dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
|
wenzelm@48726
|
830 |
|
wenzelm@47031
|
831 |
* Session HOL-Word: Discontinued many redundant theorems specific to
|
wenzelm@47031
|
832 |
type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
|
wenzelm@47031
|
833 |
instead.
|
huffman@46417
|
834 |
|
huffman@46417
|
835 |
word_sub_alt ~> word_sub_wi
|
huffman@46417
|
836 |
word_add_alt ~> word_add_def
|
huffman@46417
|
837 |
word_mult_alt ~> word_mult_def
|
huffman@46417
|
838 |
word_minus_alt ~> word_minus_def
|
huffman@46417
|
839 |
word_0_alt ~> word_0_wi
|
huffman@46417
|
840 |
word_1_alt ~> word_1_wi
|
huffman@46417
|
841 |
word_add_0 ~> add_0_left
|
huffman@46417
|
842 |
word_add_0_right ~> add_0_right
|
huffman@46417
|
843 |
word_mult_1 ~> mult_1_left
|
huffman@46417
|
844 |
word_mult_1_right ~> mult_1_right
|
huffman@46417
|
845 |
word_add_commute ~> add_commute
|
huffman@46417
|
846 |
word_add_assoc ~> add_assoc
|
huffman@46417
|
847 |
word_add_left_commute ~> add_left_commute
|
huffman@46417
|
848 |
word_mult_commute ~> mult_commute
|
huffman@46417
|
849 |
word_mult_assoc ~> mult_assoc
|
huffman@46417
|
850 |
word_mult_left_commute ~> mult_left_commute
|
huffman@46417
|
851 |
word_left_distrib ~> left_distrib
|
huffman@46417
|
852 |
word_right_distrib ~> right_distrib
|
huffman@46417
|
853 |
word_left_minus ~> left_minus
|
huffman@46417
|
854 |
word_diff_0_right ~> diff_0_right
|
huffman@46417
|
855 |
word_diff_self ~> diff_self
|
huffman@46828
|
856 |
word_sub_def ~> diff_minus
|
huffman@46675
|
857 |
word_diff_minus ~> diff_minus
|
huffman@46417
|
858 |
word_add_ac ~> add_ac
|
huffman@46417
|
859 |
word_mult_ac ~> mult_ac
|
huffman@46417
|
860 |
word_plus_ac0 ~> add_0_left add_0_right add_ac
|
huffman@46417
|
861 |
word_times_ac1 ~> mult_1_left mult_1_right mult_ac
|
huffman@46418
|
862 |
word_order_trans ~> order_trans
|
huffman@46418
|
863 |
word_order_refl ~> order_refl
|
huffman@46418
|
864 |
word_order_antisym ~> order_antisym
|
huffman@46418
|
865 |
word_order_linear ~> linorder_linear
|
huffman@46681
|
866 |
lenw1_zero_neq_one ~> zero_neq_one
|
huffman@46681
|
867 |
word_number_of_eq ~> number_of_eq
|
huffman@46883
|
868 |
word_of_int_add_hom ~> wi_hom_add
|
huffman@46883
|
869 |
word_of_int_sub_hom ~> wi_hom_sub
|
huffman@46883
|
870 |
word_of_int_mult_hom ~> wi_hom_mult
|
huffman@46883
|
871 |
word_of_int_minus_hom ~> wi_hom_neg
|
huffman@46883
|
872 |
word_of_int_succ_hom ~> wi_hom_succ
|
huffman@46883
|
873 |
word_of_int_pred_hom ~> wi_hom_pred
|
huffman@46883
|
874 |
word_of_int_0_hom ~> word_0_wi
|
huffman@46883
|
875 |
word_of_int_1_hom ~> word_1_wi
|
huffman@46417
|
876 |
|
wenzelm@48680
|
877 |
* Session HOL-Word: New proof method "word_bitwise" for splitting
|
wenzelm@48680
|
878 |
machine word equalities and inequalities into logical circuits,
|
wenzelm@48680
|
879 |
defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
|
wenzelm@48680
|
880 |
multiplication, shifting by constants, bitwise operators and numeric
|
wenzelm@48680
|
881 |
constants. Requires fixed-length word types, not 'a word. Solves
|
wenzelm@48725
|
882 |
many standard word identities outright and converts more into first
|
wenzelm@48680
|
883 |
order problems amenable to blast or similar. See also examples in
|
wenzelm@48680
|
884 |
HOL/Word/Examples/WordExamples.thy.
|
wenzelm@48680
|
885 |
|
wenzelm@48678
|
886 |
* Session HOL-Probability: Introduced the type "'a measure" to
|
wenzelm@48678
|
887 |
represent measures, this replaces the records 'a algebra and 'a
|
wenzelm@48678
|
888 |
measure_space. The locales based on subset_class now have two
|
wenzelm@48727
|
889 |
locale-parameters the space \<Omega> and the set of measurable sets M.
|
wenzelm@48727
|
890 |
The product of probability spaces uses now the same constant as the
|
wenzelm@48727
|
891 |
finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
|
wenzelm@48678
|
892 |
measure". Most constants are defined now outside of locales and gain
|
wenzelm@48678
|
893 |
an additional parameter, like null_sets, almost_eventually or \<mu>'.
|
wenzelm@48678
|
894 |
Measure space constructions for distributions and densities now got
|
wenzelm@48678
|
895 |
their own constants distr and density. Instead of using locales to
|
wenzelm@48678
|
896 |
describe measure spaces with a finite space, the measure count_space
|
wenzelm@48678
|
897 |
and point_measure is introduced. INCOMPATIBILITY.
|
hoelzl@48565
|
898 |
|
hoelzl@48565
|
899 |
Renamed constants:
|
hoelzl@48565
|
900 |
measure -> emeasure
|
hoelzl@48565
|
901 |
finite_measure.\<mu>' -> measure
|
hoelzl@48565
|
902 |
product_algebra_generator -> prod_algebra
|
hoelzl@48565
|
903 |
product_prob_space.emb -> prod_emb
|
hoelzl@48565
|
904 |
product_prob_space.infprod_algebra -> PiM
|
hoelzl@48565
|
905 |
|
hoelzl@48565
|
906 |
Removed locales:
|
hoelzl@48565
|
907 |
completeable_measure_space
|
hoelzl@48565
|
908 |
finite_measure_space
|
hoelzl@48565
|
909 |
finite_prob_space
|
hoelzl@48565
|
910 |
finite_product_finite_prob_space
|
hoelzl@48565
|
911 |
finite_product_sigma_algebra
|
hoelzl@48565
|
912 |
finite_sigma_algebra
|
hoelzl@48565
|
913 |
measure_space
|
hoelzl@48565
|
914 |
pair_finite_prob_space
|
hoelzl@48565
|
915 |
pair_finite_sigma_algebra
|
hoelzl@48565
|
916 |
pair_finite_space
|
hoelzl@48565
|
917 |
pair_sigma_algebra
|
hoelzl@48565
|
918 |
product_sigma_algebra
|
hoelzl@48565
|
919 |
|
hoelzl@48565
|
920 |
Removed constants:
|
hoelzl@48615
|
921 |
conditional_space
|
hoelzl@48565
|
922 |
distribution -> use distr measure, or distributed predicate
|
hoelzl@48615
|
923 |
image_space
|
hoelzl@48565
|
924 |
joint_distribution -> use distr measure, or distributed predicate
|
hoelzl@48615
|
925 |
pair_measure_generator
|
hoelzl@48565
|
926 |
product_prob_space.infprod_algebra -> use PiM
|
hoelzl@48565
|
927 |
subvimage
|
hoelzl@48565
|
928 |
|
hoelzl@48565
|
929 |
Replacement theorems:
|
hoelzl@48615
|
930 |
finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
|
hoelzl@48615
|
931 |
finite_measure.empty_measure -> measure_empty
|
hoelzl@48615
|
932 |
finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
|
hoelzl@48615
|
933 |
finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
|
hoelzl@48615
|
934 |
finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
|
hoelzl@48615
|
935 |
finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
|
hoelzl@48615
|
936 |
finite_measure.finite_measure -> finite_measure.emeasure_finite
|
hoelzl@48615
|
937 |
finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
|
hoelzl@48615
|
938 |
finite_measure.positive_measure' -> measure_nonneg
|
hoelzl@48615
|
939 |
finite_measure.real_measure -> finite_measure.emeasure_real
|
hoelzl@48615
|
940 |
finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
|
hoelzl@48615
|
941 |
finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
|
hoelzl@48615
|
942 |
finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
|
hoelzl@48615
|
943 |
information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
|
hoelzl@48615
|
944 |
information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
|
hoelzl@48615
|
945 |
information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
|
hoelzl@48615
|
946 |
information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
|
hoelzl@48615
|
947 |
information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
|
hoelzl@48615
|
948 |
information_space.entropy_commute -> information_space.entropy_commute_simple
|
hoelzl@48615
|
949 |
information_space.entropy_eq -> information_space.entropy_simple_distributed
|
hoelzl@48615
|
950 |
information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
|
hoelzl@48615
|
951 |
information_space.entropy_positive -> information_space.entropy_nonneg_simple
|
hoelzl@48615
|
952 |
information_space.entropy_uniform_max -> information_space.entropy_uniform
|
hoelzl@48615
|
953 |
information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
|
hoelzl@48615
|
954 |
information_space.KL_eq_0 -> information_space.KL_same_eq_0
|
hoelzl@48615
|
955 |
information_space.KL_ge_0 -> information_space.KL_nonneg
|
hoelzl@48615
|
956 |
information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
|
hoelzl@48615
|
957 |
information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
|
hoelzl@48615
|
958 |
Int_stable_cuboids -> Int_stable_atLeastAtMost
|
hoelzl@48615
|
959 |
Int_stable_product_algebra_generator -> positive_integral
|
hoelzl@48615
|
960 |
measure_preserving -> equality "distr M N f = N" "f : measurable M N"
|
hoelzl@48565
|
961 |
measure_space.additive -> emeasure_additive
|
hoelzl@48615
|
962 |
measure_space.AE_iff_null_set -> AE_iff_null
|
hoelzl@48615
|
963 |
measure_space.almost_everywhere_def -> eventually_ae_filter
|
hoelzl@48615
|
964 |
measure_space.almost_everywhere_vimage -> AE_distrD
|
hoelzl@48615
|
965 |
measure_space.continuity_from_above -> INF_emeasure_decseq
|
hoelzl@48615
|
966 |
measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
|
hoelzl@48615
|
967 |
measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
|
hoelzl@48615
|
968 |
measure_space.continuity_from_below -> SUP_emeasure_incseq
|
hoelzl@48615
|
969 |
measure_space_density -> emeasure_density
|
hoelzl@48615
|
970 |
measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
|
hoelzl@48615
|
971 |
measure_space.integrable_vimage -> integrable_distr
|
hoelzl@48615
|
972 |
measure_space.integral_translated_density -> integral_density
|
hoelzl@48615
|
973 |
measure_space.integral_vimage -> integral_distr
|
hoelzl@48565
|
974 |
measure_space.measure_additive -> plus_emeasure
|
hoelzl@48565
|
975 |
measure_space.measure_compl -> emeasure_compl
|
hoelzl@48615
|
976 |
measure_space.measure_countable_increasing -> emeasure_countable_increasing
|
hoelzl@48615
|
977 |
measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
|
hoelzl@48615
|
978 |
measure_space.measure_decseq -> decseq_emeasure
|
hoelzl@48565
|
979 |
measure_space.measure_Diff -> emeasure_Diff
|
hoelzl@48615
|
980 |
measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
|
hoelzl@48565
|
981 |
measure_space.measure_eq_0 -> emeasure_eq_0
|
hoelzl@48565
|
982 |
measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
|
hoelzl@48615
|
983 |
measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
|
hoelzl@48615
|
984 |
measure_space.measure_incseq -> incseq_emeasure
|
hoelzl@48615
|
985 |
measure_space.measure_insert -> emeasure_insert
|
hoelzl@48615
|
986 |
measure_space.measure_mono -> emeasure_mono
|
hoelzl@48615
|
987 |
measure_space.measure_not_negative -> emeasure_not_MInf
|
hoelzl@48615
|
988 |
measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
|
hoelzl@48615
|
989 |
measure_space.measure_setsum -> setsum_emeasure
|
hoelzl@48615
|
990 |
measure_space.measure_setsum_split -> setsum_emeasure_cover
|
hoelzl@48615
|
991 |
measure_space.measure_space_vimage -> emeasure_distr
|
hoelzl@48615
|
992 |
measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
|
hoelzl@48615
|
993 |
measure_space.measure_subadditive -> subadditive
|
hoelzl@48615
|
994 |
measure_space.measure_top -> emeasure_space
|
hoelzl@48565
|
995 |
measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
|
hoelzl@48565
|
996 |
measure_space.measure_Un_null_set -> emeasure_Un_null_set
|
hoelzl@48615
|
997 |
measure_space.positive_integral_translated_density -> positive_integral_density
|
hoelzl@48615
|
998 |
measure_space.positive_integral_vimage -> positive_integral_distr
|
hoelzl@48615
|
999 |
measure_space.real_continuity_from_above -> Lim_measure_decseq
|
hoelzl@48615
|
1000 |
measure_space.real_continuity_from_below -> Lim_measure_incseq
|
hoelzl@48615
|
1001 |
measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
|
hoelzl@48615
|
1002 |
measure_space.real_measure_Diff -> measure_Diff
|
hoelzl@48615
|
1003 |
measure_space.real_measure_finite_Union -> measure_finite_Union
|
hoelzl@48615
|
1004 |
measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
|
hoelzl@48615
|
1005 |
measure_space.real_measure_subadditive -> measure_subadditive
|
hoelzl@48565
|
1006 |
measure_space.real_measure_Union -> measure_Union
|
hoelzl@48565
|
1007 |
measure_space.real_measure_UNION -> measure_UNION
|
hoelzl@48565
|
1008 |
measure_space.simple_function_vimage -> simple_function_comp
|
hoelzl@48565
|
1009 |
measure_space.simple_integral_vimage -> simple_integral_distr
|
hoelzl@48615
|
1010 |
measure_space.simple_integral_vimage -> simple_integral_distr
|
hoelzl@48615
|
1011 |
measure_unique_Int_stable -> measure_eqI_generator_eq
|
hoelzl@48615
|
1012 |
measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
|
hoelzl@48565
|
1013 |
pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
|
hoelzl@48565
|
1014 |
pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
|
hoelzl@48565
|
1015 |
pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
|
hoelzl@48565
|
1016 |
pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
|
hoelzl@48565
|
1017 |
pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
|
hoelzl@48565
|
1018 |
pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
|
hoelzl@48565
|
1019 |
pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
|
hoelzl@48565
|
1020 |
pair_sigma_algebra.sets_swap -> sets_pair_swap
|
hoelzl@48615
|
1021 |
pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
|
hoelzl@48615
|
1022 |
pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
|
hoelzl@48615
|
1023 |
pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
|
hoelzl@48615
|
1024 |
pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
|
hoelzl@48615
|
1025 |
pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
|
hoelzl@48615
|
1026 |
pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
|
hoelzl@48615
|
1027 |
prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
|
hoelzl@48615
|
1028 |
prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
|
hoelzl@48565
|
1029 |
prob_space.measure_space_1 -> prob_space.emeasure_space_1
|
hoelzl@48565
|
1030 |
prob_space.prob_space_vimage -> prob_space_distr
|
hoelzl@48565
|
1031 |
prob_space.random_variable_restrict -> measurable_restrict
|
hoelzl@48615
|
1032 |
prob_space_unique_Int_stable -> measure_eqI_prob_space
|
hoelzl@48615
|
1033 |
product_algebraE -> prod_algebraE_all
|
hoelzl@48615
|
1034 |
product_algebra_generator_der -> prod_algebra_eq_finite
|
hoelzl@48615
|
1035 |
product_algebra_generator_into_space -> prod_algebra_sets_into_space
|
hoelzl@48615
|
1036 |
product_algebraI -> sets_PiM_I_finite
|
hoelzl@48615
|
1037 |
product_measure_exists -> product_sigma_finite.sigma_finite
|
hoelzl@48565
|
1038 |
product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
|
hoelzl@48565
|
1039 |
product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
|
hoelzl@48565
|
1040 |
product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
|
hoelzl@48565
|
1041 |
product_prob_space.measurable_component -> measurable_component_singleton
|
hoelzl@48565
|
1042 |
product_prob_space.measurable_emb -> measurable_prod_emb
|
hoelzl@48565
|
1043 |
product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
|
hoelzl@48565
|
1044 |
product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
|
hoelzl@48565
|
1045 |
product_prob_space.measure_emb -> emeasure_prod_emb
|
hoelzl@48615
|
1046 |
product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
|
hoelzl@48615
|
1047 |
product_sigma_algebra.product_algebra_into_space -> space_closed
|
hoelzl@48615
|
1048 |
product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
|
hoelzl@48615
|
1049 |
product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
|
hoelzl@48615
|
1050 |
product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
|
hoelzl@48565
|
1051 |
sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
|
hoelzl@48615
|
1052 |
sets_product_algebra -> sets_PiM
|
hoelzl@48615
|
1053 |
sigma_algebra.measurable_sigma -> measurable_measure_of
|
hoelzl@48615
|
1054 |
sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
|
hoelzl@48615
|
1055 |
sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
|
hoelzl@48615
|
1056 |
sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
|
hoelzl@48615
|
1057 |
space_product_algebra -> space_PiM
|
hoelzl@48565
|
1058 |
|
wenzelm@48726
|
1059 |
* Session HOL-TPTP: support to parse and import TPTP problems (all
|
wenzelm@48726
|
1060 |
languages) into Isabelle/HOL.
|
wenzelm@48284
|
1061 |
|
blanchet@46266
|
1062 |
|
noschinl@46030
|
1063 |
*** FOL ***
|
noschinl@46030
|
1064 |
|
wenzelm@46256
|
1065 |
* New "case_product" attribute (see HOL).
|
noschinl@46030
|
1066 |
|
wenzelm@45961
|
1067 |
|
wenzelm@48334
|
1068 |
*** ZF ***
|
wenzelm@48334
|
1069 |
|
wenzelm@48334
|
1070 |
* Greater support for structured proofs involving induction or case
|
wenzelm@48334
|
1071 |
analysis.
|
wenzelm@48334
|
1072 |
|
wenzelm@48334
|
1073 |
* Much greater use of mathematical symbols.
|
wenzelm@48334
|
1074 |
|
wenzelm@48334
|
1075 |
* Removal of many ML theorem bindings. INCOMPATIBILITY.
|
wenzelm@48334
|
1076 |
|
wenzelm@48334
|
1077 |
|
wenzelm@45999
|
1078 |
*** ML ***
|
wenzelm@45999
|
1079 |
|
wenzelm@47822
|
1080 |
* Antiquotation @{keyword "name"} produces a parser for outer syntax
|
wenzelm@47822
|
1081 |
from a minor keyword introduced via theory header declaration.
|
wenzelm@47822
|
1082 |
|
wenzelm@47836
|
1083 |
* Antiquotation @{command_spec "name"} produces the
|
wenzelm@47836
|
1084 |
Outer_Syntax.command_spec from a major keyword introduced via theory
|
wenzelm@47836
|
1085 |
header declaration; it can be passed to Outer_Syntax.command etc.
|
wenzelm@47836
|
1086 |
|
wenzelm@47798
|
1087 |
* Local_Theory.define no longer hard-wires default theorem name
|
wenzelm@47865
|
1088 |
"foo_def", but retains the binding as given. If that is Binding.empty
|
wenzelm@47865
|
1089 |
/ Attrib.empty_binding, the result is not registered as user-level
|
wenzelm@47865
|
1090 |
fact. The Local_Theory.define_internal variant allows to specify a
|
wenzelm@47865
|
1091 |
non-empty name (used for the foundation in the background theory),
|
wenzelm@47865
|
1092 |
while omitting the fact binding in the user-context. Potential
|
wenzelm@47865
|
1093 |
INCOMPATIBILITY for derived definitional packages: need to specify
|
wenzelm@47865
|
1094 |
naming policy for primitive definitions more explicitly.
|
wenzelm@47798
|
1095 |
|
wenzelm@47368
|
1096 |
* Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
|
wenzelm@47368
|
1097 |
conformance with similar operations in structure Term and Logic.
|
wenzelm@47368
|
1098 |
|
wenzelm@46463
|
1099 |
* Antiquotation @{attributes [...]} embeds attribute source
|
wenzelm@46463
|
1100 |
representation into the ML text, which is particularly useful with
|
wenzelm@46463
|
1101 |
declarations like Local_Theory.note.
|
wenzelm@46463
|
1102 |
|
wenzelm@45999
|
1103 |
* Structure Proof_Context follows standard naming scheme. Old
|
wenzelm@45999
|
1104 |
ProofContext has been discontinued. INCOMPATIBILITY.
|
wenzelm@45999
|
1105 |
|
wenzelm@46164
|
1106 |
* Refined Local_Theory.declaration {syntax, pervasive}, with subtle
|
wenzelm@46169
|
1107 |
change of semantics: update is applied to auxiliary local theory
|
wenzelm@46164
|
1108 |
context as well.
|
wenzelm@46164
|
1109 |
|
wenzelm@46491
|
1110 |
* Modernized some old-style infix operations:
|
wenzelm@46491
|
1111 |
|
wenzelm@46491
|
1112 |
addeqcongs ~> Simplifier.add_eqcong
|
wenzelm@46491
|
1113 |
deleqcongs ~> Simplifier.del_eqcong
|
wenzelm@46491
|
1114 |
addcongs ~> Simplifier.add_cong
|
wenzelm@46491
|
1115 |
delcongs ~> Simplifier.del_cong
|
wenzelm@46496
|
1116 |
setmksimps ~> Simplifier.set_mksimps
|
wenzelm@46496
|
1117 |
setmkcong ~> Simplifier.set_mkcong
|
wenzelm@46496
|
1118 |
setmksym ~> Simplifier.set_mksym
|
wenzelm@46496
|
1119 |
setmkeqTrue ~> Simplifier.set_mkeqTrue
|
wenzelm@46496
|
1120 |
settermless ~> Simplifier.set_termless
|
wenzelm@46496
|
1121 |
setsubgoaler ~> Simplifier.set_subgoaler
|
wenzelm@46491
|
1122 |
addsplits ~> Splitter.add_split
|
wenzelm@46491
|
1123 |
delsplits ~> Splitter.del_split
|
wenzelm@46491
|
1124 |
|
wenzelm@45999
|
1125 |
|
wenzelm@48332
|
1126 |
*** System ***
|
wenzelm@48332
|
1127 |
|
wenzelm@48538
|
1128 |
* USER_HOME settings variable points to cross-platform user home
|
wenzelm@48538
|
1129 |
directory, which coincides with HOME on POSIX systems only. Likewise,
|
wenzelm@48538
|
1130 |
the Isabelle path specification "~" now expands to $USER_HOME, instead
|
wenzelm@48538
|
1131 |
of former $HOME. A different default for USER_HOME may be set
|
wenzelm@48538
|
1132 |
explicitly in shell environment, before Isabelle settings are
|
wenzelm@48538
|
1133 |
evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
|
wenzelm@48538
|
1134 |
the generic user home was intended.
|
wenzelm@48538
|
1135 |
|
wenzelm@48678
|
1136 |
* ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
|
wenzelm@48678
|
1137 |
notation, which is useful for the jEdit file browser, for example.
|
wenzelm@48678
|
1138 |
|
wenzelm@48335
|
1139 |
* ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
|
wenzelm@48335
|
1140 |
(not just JRE).
|
wenzelm@48335
|
1141 |
|
wenzelm@48332
|
1142 |
|
wenzelm@45961
|
1143 |
|
wenzelm@45682
|
1144 |
New in Isabelle2011-1 (October 2011)
|
wenzelm@45682
|
1145 |
------------------------------------
|
wenzelm@42520
|
1146 |
|
wenzelm@42577
|
1147 |
*** General ***
|
wenzelm@42577
|
1148 |
|
wenzelm@45631
|
1149 |
* Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
|
wenzelm@45839
|
1150 |
"isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
|
wenzelm@45631
|
1151 |
|
wenzelm@45648
|
1152 |
- Management of multiple theory files directly from the editor
|
wenzelm@45631
|
1153 |
buffer store -- bypassing the file-system (no requirement to save
|
wenzelm@45631
|
1154 |
files for checking).
|
wenzelm@45631
|
1155 |
|
wenzelm@45648
|
1156 |
- Markup of formal entities within the text buffer, with semantic
|
wenzelm@45631
|
1157 |
highlighting, tooltips and hyperlinks to jump to defining source
|
wenzelm@45631
|
1158 |
positions.
|
wenzelm@45631
|
1159 |
|
wenzelm@45648
|
1160 |
- Improved text rendering, with sub/superscripts in the source
|
wenzelm@45648
|
1161 |
buffer (including support for copy/paste wrt. output panel, HTML
|
wenzelm@45648
|
1162 |
theory output and other non-Isabelle text boxes).
|
wenzelm@45648
|
1163 |
|
wenzelm@45648
|
1164 |
- Refined scheduling of proof checking and printing of results,
|
wenzelm@45631
|
1165 |
based on interactive editor view. (Note: jEdit folding and
|
wenzelm@45631
|
1166 |
narrowing allows to restrict buffer perspectives explicitly.)
|
wenzelm@45631
|
1167 |
|
wenzelm@45648
|
1168 |
- Reduced CPU performance requirements, usable on machines with few
|
wenzelm@45631
|
1169 |
cores.
|
wenzelm@45631
|
1170 |
|
wenzelm@45648
|
1171 |
- Reduced memory requirements due to pruning of unused document
|
wenzelm@45631
|
1172 |
versions (garbage collection).
|
wenzelm@45631
|
1173 |
|
wenzelm@45631
|
1174 |
See also ~~/src/Tools/jEdit/README.html for further information,
|
wenzelm@45631
|
1175 |
including some remaining limitations.
|
wenzelm@45631
|
1176 |
|
wenzelm@42759
|
1177 |
* Theory loader: source files are exclusively located via the master
|
wenzelm@42759
|
1178 |
directory of each theory node (where the .thy file itself resides).
|
ballarin@44390
|
1179 |
The global load path (such as src/HOL/Library) has been discontinued.
|
ballarin@44390
|
1180 |
Note that the path element ~~ may be used to reference theories in the
|
ballarin@44390
|
1181 |
Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
|
ballarin@44390
|
1182 |
INCOMPATIBILITY.
|
wenzelm@42759
|
1183 |
|
wenzelm@45671
|
1184 |
* Theory loader: source files are identified by content via SHA1
|
wenzelm@45671
|
1185 |
digests. Discontinued former path/modtime identification and optional
|
wenzelm@45671
|
1186 |
ISABELLE_FILE_IDENT plugin scripts.
|
wenzelm@45671
|
1187 |
|
wenzelm@45671
|
1188 |
* Parallelization of nested Isar proofs is subject to
|
wenzelm@45671
|
1189 |
Goal.parallel_proofs_threshold (default 100). See also isabelle
|
wenzelm@45671
|
1190 |
usedir option -Q.
|
wenzelm@45671
|
1191 |
|
wenzelm@43542
|
1192 |
* Name space: former unsynchronized references are now proper
|
wenzelm@43542
|
1193 |
configuration options, with more conventional names:
|
wenzelm@43542
|
1194 |
|
wenzelm@43542
|
1195 |
long_names ~> names_long
|
wenzelm@43542
|
1196 |
short_names ~> names_short
|
wenzelm@43542
|
1197 |
unique_names ~> names_unique
|
wenzelm@43542
|
1198 |
|
wenzelm@43542
|
1199 |
Minor INCOMPATIBILITY, need to declare options in context like this:
|
wenzelm@43542
|
1200 |
|
wenzelm@43542
|
1201 |
declare [[names_unique = false]]
|
wenzelm@43229
|
1202 |
|
wenzelm@43373
|
1203 |
* Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
|
wenzelm@43373
|
1204 |
that the result needs to be unique, which means fact specifications
|
wenzelm@43373
|
1205 |
may have to be refined after enriching a proof context.
|
wenzelm@43373
|
1206 |
|
wenzelm@45671
|
1207 |
* Attribute "case_names" has been refined: the assumptions in each case
|
wenzelm@45671
|
1208 |
can be named now by following the case name with [name1 name2 ...].
|
wenzelm@45671
|
1209 |
|
wenzelm@45839
|
1210 |
* Isabelle/Isar reference manual has been updated and extended:
|
wenzelm@45839
|
1211 |
- "Synopsis" provides a catalog of main Isar language concepts.
|
wenzelm@45839
|
1212 |
- Formal references in syntax diagrams, via @{rail} antiquotation.
|
wenzelm@45839
|
1213 |
- Updated material from classic "ref" manual, notably about
|
wenzelm@45839
|
1214 |
"Classical Reasoner".
|
wenzelm@43504
|
1215 |
|
wenzelm@42577
|
1216 |
|
blanchet@42591
|
1217 |
*** HOL ***
|
blanchet@42591
|
1218 |
|
wenzelm@45839
|
1219 |
* Class bot and top require underlying partial order rather than
|
wenzelm@45671
|
1220 |
preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
|
haftmann@44679
|
1221 |
|
haftmann@44811
|
1222 |
* Class complete_lattice: generalized a couple of lemmas from sets;
|
wenzelm@45671
|
1223 |
generalized theorems INF_cong and SUP_cong. New type classes for
|
wenzelm@45671
|
1224 |
complete boolean algebras and complete linear orders. Lemmas
|
wenzelm@45671
|
1225 |
Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
|
wenzelm@45671
|
1226 |
class complete_linorder.
|
wenzelm@45671
|
1227 |
|
wenzelm@45671
|
1228 |
Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
|
wenzelm@45671
|
1229 |
Sup_fun_def, Inf_apply, Sup_apply.
|
wenzelm@45671
|
1230 |
|
wenzelm@45959
|
1231 |
Removed redundant lemmas (the right hand side gives hints how to
|
wenzelm@45959
|
1232 |
replace them for (metis ...), or (simp only: ...) proofs):
|
hoelzl@45906
|
1233 |
|
hoelzl@45906
|
1234 |
Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
|
hoelzl@45906
|
1235 |
Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
|
hoelzl@45906
|
1236 |
Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
|
hoelzl@45906
|
1237 |
Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
|
hoelzl@45906
|
1238 |
Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
|
hoelzl@45906
|
1239 |
Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
|
hoelzl@45906
|
1240 |
Inter_def ~> INF_def, image_def
|
hoelzl@45906
|
1241 |
Union_def ~> SUP_def, image_def
|
hoelzl@45906
|
1242 |
INT_eq ~> INF_def, and image_def
|
hoelzl@45906
|
1243 |
UN_eq ~> SUP_def, and image_def
|
hoelzl@45906
|
1244 |
INF_subset ~> INF_superset_mono [OF _ order_refl]
|
wenzelm@45671
|
1245 |
|
wenzelm@45671
|
1246 |
More consistent and comprehensive names:
|
wenzelm@45671
|
1247 |
|
hoelzl@45906
|
1248 |
INTER_eq_Inter_image ~> INF_def
|
hoelzl@45906
|
1249 |
UNION_eq_Union_image ~> SUP_def
|
haftmann@44743
|
1250 |
INFI_def ~> INF_def
|
haftmann@44743
|
1251 |
SUPR_def ~> SUP_def
|
haftmann@44972
|
1252 |
INF_leI ~> INF_lower
|
haftmann@44972
|
1253 |
INF_leI2 ~> INF_lower2
|
haftmann@44972
|
1254 |
le_INFI ~> INF_greatest
|
haftmann@44972
|
1255 |
le_SUPI ~> SUP_upper
|
haftmann@44972
|
1256 |
le_SUPI2 ~> SUP_upper2
|
haftmann@44972
|
1257 |
SUP_leI ~> SUP_least
|
haftmann@44744
|
1258 |
INFI_bool_eq ~> INF_bool_eq
|
haftmann@44744
|
1259 |
SUPR_bool_eq ~> SUP_bool_eq
|
haftmann@44744
|
1260 |
INFI_apply ~> INF_apply
|
haftmann@44744
|
1261 |
SUPR_apply ~> SUP_apply
|
haftmann@44972
|
1262 |
INTER_def ~> INTER_eq
|
haftmann@44972
|
1263 |
UNION_def ~> UNION_eq
|
haftmann@44972
|
1264 |
|
haftmann@44736
|
1265 |
INCOMPATIBILITY.
|
haftmann@44736
|
1266 |
|
wenzelm@45844
|
1267 |
* Renamed theory Complete_Lattice to Complete_Lattices.
|
wenzelm@45844
|
1268 |
INCOMPATIBILITY.
|
wenzelm@45844
|
1269 |
|
wenzelm@45844
|
1270 |
* Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
|
wenzelm@45844
|
1271 |
INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
|
wenzelm@45844
|
1272 |
Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
|
wenzelm@45844
|
1273 |
Sup_insert are now declared as [simp]. INCOMPATIBILITY.
|
wenzelm@45844
|
1274 |
|
wenzelm@45844
|
1275 |
* Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
|
wenzelm@45844
|
1276 |
compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
|
wenzelm@45844
|
1277 |
sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
|
wenzelm@45844
|
1278 |
INCOMPATIBILITY.
|
wenzelm@45844
|
1279 |
|
krauss@45716
|
1280 |
* Added syntactic classes "inf" and "sup" for the respective
|
krauss@45716
|
1281 |
constants. INCOMPATIBILITY: Changes in the argument order of the
|
krauss@45716
|
1282 |
(mostly internal) locale predicates for some derived classes.
|
krauss@45716
|
1283 |
|
wenzelm@45671
|
1284 |
* Theorem collections ball_simps and bex_simps do not contain theorems
|
wenzelm@45671
|
1285 |
referring to UNION any longer; these have been moved to collection
|
wenzelm@45671
|
1286 |
UN_ball_bex_simps. INCOMPATIBILITY.
|
wenzelm@45671
|
1287 |
|
wenzelm@45671
|
1288 |
* Theory Archimedean_Field: floor now is defined as parameter of a
|
wenzelm@45671
|
1289 |
separate type class floor_ceiling.
|
wenzelm@45671
|
1290 |
|
wenzelm@45671
|
1291 |
* Theory Finite_Set: more coherent development of fold_set locales:
|
haftmann@43743
|
1292 |
|
haftmann@43743
|
1293 |
locale fun_left_comm ~> locale comp_fun_commute
|
haftmann@43743
|
1294 |
locale fun_left_comm_idem ~> locale comp_fun_idem
|
wenzelm@45671
|
1295 |
|
wenzelm@45671
|
1296 |
Both use point-free characterization; interpretation proofs may need
|
wenzelm@45671
|
1297 |
adjustment. INCOMPATIBILITY.
|
haftmann@43743
|
1298 |
|
wenzelm@45671
|
1299 |
* Theory Limits: Type "'a net" has been renamed to "'a filter", in
|
huffman@44952
|
1300 |
accordance with standard mathematical terminology. INCOMPATIBILITY.
|
huffman@44952
|
1301 |
|
wenzelm@45671
|
1302 |
* Theory Complex_Main: The locale interpretations for the
|
wenzelm@45671
|
1303 |
bounded_linear and bounded_bilinear locales have been removed, in
|
wenzelm@45671
|
1304 |
order to reduce the number of duplicate lemmas. Users must use the
|
wenzelm@45671
|
1305 |
original names for distributivity theorems, potential INCOMPATIBILITY.
|
huffman@45145
|
1306 |
|
huffman@45145
|
1307 |
divide.add ~> add_divide_distrib
|
huffman@45145
|
1308 |
divide.diff ~> diff_divide_distrib
|
huffman@45145
|
1309 |
divide.setsum ~> setsum_divide_distrib
|
huffman@45145
|
1310 |
mult.add_right ~> right_distrib
|
huffman@45145
|
1311 |
mult.diff_right ~> right_diff_distrib
|
huffman@45145
|
1312 |
mult_right.setsum ~> setsum_right_distrib
|
huffman@45145
|
1313 |
mult_left.diff ~> left_diff_distrib
|
huffman@45145
|
1314 |
|
wenzelm@45671
|
1315 |
* Theory Complex_Main: Several redundant theorems have been removed or
|
huffman@45439
|
1316 |
replaced by more general versions. INCOMPATIBILITY.
|
huffman@45377
|
1317 |
|
huffman@45916
|
1318 |
real_diff_def ~> minus_real_def
|
huffman@45916
|
1319 |
real_divide_def ~> divide_real_def
|
huffman@45916
|
1320 |
real_less_def ~> less_le
|
huffman@45916
|
1321 |
real_abs_def ~> abs_real_def
|
huffman@45916
|
1322 |
real_sgn_def ~> sgn_real_def
|
huffman@45916
|
1323 |
real_mult_commute ~> mult_commute
|
huffman@45916
|
1324 |
real_mult_assoc ~> mult_assoc
|
huffman@45916
|
1325 |
real_mult_1 ~> mult_1_left
|
huffman@45916
|
1326 |
real_add_mult_distrib ~> left_distrib
|
huffman@45916
|
1327 |
real_zero_not_eq_one ~> zero_neq_one
|
huffman@45916
|
1328 |
real_mult_inverse_left ~> left_inverse
|
huffman@45916
|
1329 |
INVERSE_ZERO ~> inverse_zero
|
huffman@45916
|
1330 |
real_le_refl ~> order_refl
|
huffman@45916
|
1331 |
real_le_antisym ~> order_antisym
|
huffman@45916
|
1332 |
real_le_trans ~> order_trans
|
huffman@45916
|
1333 |
real_le_linear ~> linear
|
huffman@45916
|
1334 |
real_le_eq_diff ~> le_iff_diff_le_0
|
huffman@45916
|
1335 |
real_add_left_mono ~> add_left_mono
|
huffman@45916
|
1336 |
real_mult_order ~> mult_pos_pos
|
huffman@45916
|
1337 |
real_mult_less_mono2 ~> mult_strict_left_mono
|
huffman@45693
|
1338 |
real_of_int_real_of_nat ~> real_of_int_of_nat_eq
|
huffman@45377
|
1339 |
real_0_le_divide_iff ~> zero_le_divide_iff
|
huffman@45377
|
1340 |
realpow_two_disj ~> power2_eq_iff
|
huffman@45377
|
1341 |
real_squared_diff_one_factored ~> square_diff_one_factored
|
huffman@45377
|
1342 |
realpow_two_diff ~> square_diff_square_factored
|
huffman@45540
|
1343 |
reals_complete2 ~> complete_real
|
huffman@45613
|
1344 |
real_sum_squared_expand ~> power2_sum
|
huffman@45377
|
1345 |
exp_ln_eq ~> ln_unique
|
huffman@45573
|
1346 |
expi_add ~> exp_add
|
huffman@45573
|
1347 |
expi_zero ~> exp_zero
|
huffman@45377
|
1348 |
lemma_DERIV_subst ~> DERIV_cong
|
huffman@45439
|
1349 |
LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
|
huffman@45439
|
1350 |
LIMSEQ_const ~> tendsto_const
|
huffman@45439
|
1351 |
LIMSEQ_norm ~> tendsto_norm
|
huffman@45439
|
1352 |
LIMSEQ_add ~> tendsto_add
|
huffman@45439
|
1353 |
LIMSEQ_minus ~> tendsto_minus
|
huffman@45439
|
1354 |
LIMSEQ_minus_cancel ~> tendsto_minus_cancel
|
huffman@45439
|
1355 |
LIMSEQ_diff ~> tendsto_diff
|
huffman@45439
|
1356 |
bounded_linear.LIMSEQ ~> bounded_linear.tendsto
|
huffman@45439
|
1357 |
bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
|
huffman@45439
|
1358 |
LIMSEQ_mult ~> tendsto_mult
|
huffman@45439
|
1359 |
LIMSEQ_inverse ~> tendsto_inverse
|
huffman@45439
|
1360 |
LIMSEQ_divide ~> tendsto_divide
|
huffman@45439
|
1361 |
LIMSEQ_pow ~> tendsto_power
|
huffman@45439
|
1362 |
LIMSEQ_setsum ~> tendsto_setsum
|
huffman@45439
|
1363 |
LIMSEQ_setprod ~> tendsto_setprod
|
huffman@45439
|
1364 |
LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
|
huffman@45439
|
1365 |
LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
|
huffman@45439
|
1366 |
LIMSEQ_imp_rabs ~> tendsto_rabs
|
huffman@45572
|
1367 |
LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
|
huffman@45572
|
1368 |
LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
|
huffman@45572
|
1369 |
LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
|
huffman@45612
|
1370 |
LIMSEQ_Complex ~> tendsto_Complex
|
huffman@45439
|
1371 |
LIM_ident ~> tendsto_ident_at
|
huffman@45439
|
1372 |
LIM_const ~> tendsto_const
|
huffman@45439
|
1373 |
LIM_add ~> tendsto_add
|
huffman@45439
|
1374 |
LIM_add_zero ~> tendsto_add_zero
|
huffman@45439
|
1375 |
LIM_minus ~> tendsto_minus
|
huffman@45439
|
1376 |
LIM_diff ~> tendsto_diff
|
huffman@45439
|
1377 |
LIM_norm ~> tendsto_norm
|
huffman@45439
|
1378 |
LIM_norm_zero ~> tendsto_norm_zero
|
huffman@45439
|
1379 |
LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
|
huffman@45439
|
1380 |
LIM_norm_zero_iff ~> tendsto_norm_zero_iff
|
huffman@45439
|
1381 |
LIM_rabs ~> tendsto_rabs
|
huffman@45439
|
1382 |
LIM_rabs_zero ~> tendsto_rabs_zero
|
huffman@45439
|
1383 |
LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
|
huffman@45439
|
1384 |
LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
|
huffman@45439
|
1385 |
LIM_compose ~> tendsto_compose
|
huffman@45439
|
1386 |
LIM_mult ~> tendsto_mult
|
huffman@45439
|
1387 |
LIM_scaleR ~> tendsto_scaleR
|
huffman@45439
|
1388 |
LIM_of_real ~> tendsto_of_real
|
huffman@45439
|
1389 |
LIM_power ~> tendsto_power
|
huffman@45439
|
1390 |
LIM_inverse ~> tendsto_inverse
|
huffman@45439
|
1391 |
LIM_sgn ~> tendsto_sgn
|
huffman@45439
|
1392 |
isCont_LIM_compose ~> isCont_tendsto_compose
|
huffman@45439
|
1393 |
bounded_linear.LIM ~> bounded_linear.tendsto
|
huffman@45439
|
1394 |
bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
|
huffman@45439
|
1395 |
bounded_bilinear.LIM ~> bounded_bilinear.tendsto
|
huffman@45439
|
1396 |
bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
|
huffman@45439
|
1397 |
bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
|
huffman@45439
|
1398 |
bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
|
huffman@45439
|
1399 |
LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
|
huffman@45377
|
1400 |
|
wenzelm@45838
|
1401 |
* Theory Complex_Main: The definition of infinite series was
|
wenzelm@45838
|
1402 |
generalized. Now it is defined on the type class {topological_space,
|
wenzelm@45838
|
1403 |
comm_monoid_add}. Hence it is useable also for extended real numbers.
|
wenzelm@43355
|
1404 |
|
huffman@45779
|
1405 |
* Theory Complex_Main: The complex exponential function "expi" is now
|
huffman@45779
|
1406 |
a type-constrained abbreviation for "exp :: complex => complex"; thus
|
huffman@45779
|
1407 |
several polymorphic lemmas about "exp" are now applicable to "expi".
|
huffman@45779
|
1408 |
|
wenzelm@45839
|
1409 |
* Code generation:
|
wenzelm@45839
|
1410 |
|
wenzelm@45839
|
1411 |
- Theory Library/Code_Char_ord provides native ordering of
|
wenzelm@45839
|
1412 |
characters in the target language.
|
wenzelm@45839
|
1413 |
|
wenzelm@45839
|
1414 |
- Commands code_module and code_library are legacy, use export_code
|
wenzelm@45839
|
1415 |
instead.
|
wenzelm@45839
|
1416 |
|
wenzelm@45839
|
1417 |
- Method "evaluation" is legacy, use method "eval" instead.
|
wenzelm@45839
|
1418 |
|
wenzelm@45839
|
1419 |
- Legacy evaluator "SML" is deactivated by default. May be
|
wenzelm@45839
|
1420 |
reactivated by the following theory command:
|
wenzelm@45839
|
1421 |
|
wenzelm@45839
|
1422 |
setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
|
wenzelm@45839
|
1423 |
|
wenzelm@45839
|
1424 |
* Declare ext [intro] by default. Rare INCOMPATIBILITY.
|
wenzelm@45839
|
1425 |
|
wenzelm@45959
|
1426 |
* New proof method "induction" that gives induction hypotheses the
|
wenzelm@45959
|
1427 |
name "IH", thus distinguishing them from further hypotheses that come
|
wenzelm@45959
|
1428 |
from rule induction. The latter are still called "hyps". Method
|
wenzelm@45959
|
1429 |
"induction" is a thin wrapper around "induct" and follows the same
|
wenzelm@45959
|
1430 |
syntax.
|
wenzelm@45959
|
1431 |
|
wenzelm@45839
|
1432 |
* Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
|
wenzelm@45839
|
1433 |
still available as a legacy feature for some time.
|
wenzelm@45839
|
1434 |
|
wenzelm@45839
|
1435 |
* Nitpick:
|
wenzelm@45839
|
1436 |
- Added "need" and "total_consts" options.
|
wenzelm@45839
|
1437 |
- Reintroduced "show_skolems" option by popular demand.
|
wenzelm@45839
|
1438 |
- Renamed attribute: nitpick_def ~> nitpick_unfold.
|
wenzelm@45839
|
1439 |
INCOMPATIBILITY.
|
wenzelm@45839
|
1440 |
|
wenzelm@45839
|
1441 |
* Sledgehammer:
|
wenzelm@45839
|
1442 |
- Use quasi-sound (and efficient) translations by default.
|
wenzelm@45839
|
1443 |
- Added support for the following provers: E-ToFoF, LEO-II,
|
wenzelm@45839
|
1444 |
Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
|
wenzelm@45839
|
1445 |
- Automatically preplay and minimize proofs before showing them if
|
wenzelm@45839
|
1446 |
this can be done within reasonable time.
|
wenzelm@45839
|
1447 |
- sledgehammer available_provers ~> sledgehammer supported_provers.
|
wenzelm@45839
|
1448 |
INCOMPATIBILITY.
|
wenzelm@45839
|
1449 |
- Added "preplay_timeout", "slicing", "type_enc", "sound",
|
wenzelm@45839
|
1450 |
"max_mono_iters", and "max_new_mono_instances" options.
|
wenzelm@45839
|
1451 |
- Removed "explicit_apply" and "full_types" options as well as "Full
|
wenzelm@45839
|
1452 |
Types" Proof General menu item. INCOMPATIBILITY.
|
wenzelm@45839
|
1453 |
|
wenzelm@45839
|
1454 |
* Metis:
|
wenzelm@45839
|
1455 |
- Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
|
wenzelm@45839
|
1456 |
- Obsoleted "metisFT" -- use "metis (full_types)" instead.
|
wenzelm@45839
|
1457 |
INCOMPATIBILITY.
|
wenzelm@45839
|
1458 |
|
wenzelm@45839
|
1459 |
* Command 'try':
|
wenzelm@45839
|
1460 |
- Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
|
wenzelm@45839
|
1461 |
"elim:" options. INCOMPATIBILITY.
|
wenzelm@45839
|
1462 |
- Introduced 'try' that not only runs 'try_methods' but also
|
wenzelm@45839
|
1463 |
'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
|
wenzelm@45839
|
1464 |
|
wenzelm@45839
|
1465 |
* Quickcheck:
|
wenzelm@45839
|
1466 |
- Added "eval" option to evaluate terms for the found counterexample
|
wenzelm@45839
|
1467 |
(currently only supported by the default (exhaustive) tester).
|
wenzelm@45839
|
1468 |
- Added post-processing of terms to obtain readable counterexamples
|
wenzelm@45839
|
1469 |
(currently only supported by the default (exhaustive) tester).
|
wenzelm@45839
|
1470 |
- New counterexample generator quickcheck[narrowing] enables
|
wenzelm@45839
|
1471 |
narrowing-based testing. Requires the Glasgow Haskell compiler
|
wenzelm@45839
|
1472 |
with its installation location defined in the Isabelle settings
|
wenzelm@45839
|
1473 |
environment as ISABELLE_GHC.
|
wenzelm@45839
|
1474 |
- Removed quickcheck tester "SML" based on the SML code generator
|
wenzelm@45839
|
1475 |
(formly in HOL/Library).
|
wenzelm@45839
|
1476 |
|
wenzelm@45839
|
1477 |
* Function package: discontinued option "tailrec". INCOMPATIBILITY,
|
wenzelm@45839
|
1478 |
use 'partial_function' instead.
|
wenzelm@45839
|
1479 |
|
wenzelm@45839
|
1480 |
* Theory Library/Extended_Reals replaces now the positive extended
|
wenzelm@45839
|
1481 |
reals found in probability theory. This file is extended by
|
wenzelm@45839
|
1482 |
Multivariate_Analysis/Extended_Real_Limits.
|
wenzelm@45839
|
1483 |
|
wenzelm@45845
|
1484 |
* Theory Library/Old_Recdef: old 'recdef' package has been moved here,
|
wenzelm@45845
|
1485 |
from where it must be imported explicitly if it is really required.
|
wenzelm@45845
|
1486 |
INCOMPATIBILITY.
|
wenzelm@45839
|
1487 |
|
wenzelm@45839
|
1488 |
* Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
|
wenzelm@45839
|
1489 |
been moved here. INCOMPATIBILITY.
|
wenzelm@45839
|
1490 |
|
wenzelm@45839
|
1491 |
* Theory Library/Saturated provides type of numbers with saturated
|
wenzelm@45839
|
1492 |
arithmetic.
|
wenzelm@45839
|
1493 |
|
wenzelm@45839
|
1494 |
* Theory Library/Product_Lattice defines a pointwise ordering for the
|
wenzelm@45839
|
1495 |
product type 'a * 'b, and provides instance proofs for various order
|
wenzelm@45839
|
1496 |
and lattice type classes.
|
wenzelm@45839
|
1497 |
|
wenzelm@45839
|
1498 |
* Theory Library/Countable now provides the "countable_datatype" proof
|
wenzelm@45839
|
1499 |
method for proving "countable" class instances for datatypes.
|
wenzelm@45839
|
1500 |
|
wenzelm@45839
|
1501 |
* Theory Library/Cset_Monad allows do notation for computable sets
|
wenzelm@45839
|
1502 |
(cset) via the generic monad ad-hoc overloading facility.
|
wenzelm@45839
|
1503 |
|
wenzelm@45839
|
1504 |
* Library: Theories of common data structures are split into theories
|
wenzelm@45839
|
1505 |
for implementation, an invariant-ensuring type, and connection to an
|
wenzelm@45839
|
1506 |
abstract type. INCOMPATIBILITY.
|
wenzelm@45839
|
1507 |
|
wenzelm@45839
|
1508 |
- RBT is split into RBT and RBT_Mapping.
|
wenzelm@45839
|
1509 |
- AssocList is split and renamed into AList and AList_Mapping.
|
wenzelm@45839
|
1510 |
- DList is split into DList_Impl, DList, and DList_Cset.
|
wenzelm@45839
|
1511 |
- Cset is split into Cset and List_Cset.
|
wenzelm@45839
|
1512 |
|
wenzelm@45839
|
1513 |
* Theory Library/Nat_Infinity has been renamed to
|
wenzelm@45839
|
1514 |
Library/Extended_Nat, with name changes of the following types and
|
wenzelm@45839
|
1515 |
constants:
|
wenzelm@45839
|
1516 |
|
wenzelm@45839
|
1517 |
type inat ~> type enat
|
wenzelm@45839
|
1518 |
Fin ~> enat
|
wenzelm@45839
|
1519 |
Infty ~> infinity (overloaded)
|
wenzelm@45839
|
1520 |
iSuc ~> eSuc
|
wenzelm@45839
|
1521 |
the_Fin ~> the_enat
|
wenzelm@45839
|
1522 |
|
wenzelm@45839
|
1523 |
Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
|
wenzelm@45839
|
1524 |
been renamed accordingly. INCOMPATIBILITY.
|
wenzelm@45839
|
1525 |
|
wenzelm@45839
|
1526 |
* Session Multivariate_Analysis: The euclidean_space type class now
|
wenzelm@45839
|
1527 |
fixes a constant "Basis :: 'a set" consisting of the standard
|
wenzelm@45839
|
1528 |
orthonormal basis for the type. Users now have the option of
|
wenzelm@45839
|
1529 |
quantifying over this set instead of using the "basis" function, e.g.
|
wenzelm@45839
|
1530 |
"ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
|
wenzelm@45839
|
1531 |
|
wenzelm@45839
|
1532 |
* Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
|
wenzelm@45839
|
1533 |
to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
|
wenzelm@45839
|
1534 |
"Cart_nth" and "Cart_lambda" have been respectively renamed to
|
wenzelm@45839
|
1535 |
"vec_nth" and "vec_lambda"; theorems mentioning those names have
|
wenzelm@45839
|
1536 |
changed to match. Definition theorems for overloaded constants now use
|
wenzelm@45839
|
1537 |
the standard "foo_vec_def" naming scheme. A few other theorems have
|
wenzelm@45839
|
1538 |
been renamed as follows (INCOMPATIBILITY):
|
wenzelm@45839
|
1539 |
|
wenzelm@45839
|
1540 |
Cart_eq ~> vec_eq_iff
|
wenzelm@45839
|
1541 |
dist_nth_le_cart ~> dist_vec_nth_le
|
wenzelm@45839
|
1542 |
tendsto_vector ~> vec_tendstoI
|
wenzelm@45839
|
1543 |
Cauchy_vector ~> vec_CauchyI
|
wenzelm@45839
|
1544 |
|
wenzelm@45839
|
1545 |
* Session Multivariate_Analysis: Several duplicate theorems have been
|
wenzelm@45839
|
1546 |
removed, and other theorems have been renamed or replaced with more
|
wenzelm@45839
|
1547 |
general versions. INCOMPATIBILITY.
|
wenzelm@45839
|
1548 |
|
wenzelm@45839
|
1549 |
finite_choice ~> finite_set_choice
|
wenzelm@45839
|
1550 |
eventually_conjI ~> eventually_conj
|
wenzelm@45839
|
1551 |
eventually_and ~> eventually_conj_iff
|
wenzelm@45839
|
1552 |
eventually_false ~> eventually_False
|
wenzelm@45839
|
1553 |
setsum_norm ~> norm_setsum
|
wenzelm@45839
|
1554 |
Lim_sequentially ~> LIMSEQ_def
|
wenzelm@45839
|
1555 |
Lim_ident_at ~> LIM_ident
|
wenzelm@45839
|
1556 |
Lim_const ~> tendsto_const
|
wenzelm@45839
|
1557 |
Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
|
wenzelm@45839
|
1558 |
Lim_neg ~> tendsto_minus
|
wenzelm@45839
|
1559 |
Lim_add ~> tendsto_add
|
wenzelm@45839
|
1560 |
Lim_sub ~> tendsto_diff
|
wenzelm@45839
|
1561 |
Lim_mul ~> tendsto_scaleR
|
wenzelm@45839
|
1562 |
Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
|
wenzelm@45839
|
1563 |
Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
|
wenzelm@45839
|
1564 |
Lim_linear ~> bounded_linear.tendsto
|
wenzelm@45839
|
1565 |
Lim_component ~> tendsto_euclidean_component
|
wenzelm@45839
|
1566 |
Lim_component_cart ~> tendsto_vec_nth
|
wenzelm@45839
|
1567 |
Lim_inner ~> tendsto_inner [OF tendsto_const]
|
wenzelm@45839
|
1568 |
dot_lsum ~> inner_setsum_left
|
wenzelm@45839
|
1569 |
dot_rsum ~> inner_setsum_right
|
wenzelm@45839
|
1570 |
continuous_cmul ~> continuous_scaleR [OF continuous_const]
|
wenzelm@45839
|
1571 |
continuous_neg ~> continuous_minus
|
wenzelm@45839
|
1572 |
continuous_sub ~> continuous_diff
|
wenzelm@45839
|
1573 |
continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
|
wenzelm@45839
|
1574 |
continuous_mul ~> continuous_scaleR
|
wenzelm@45839
|
1575 |
continuous_inv ~> continuous_inverse
|
wenzelm@45839
|
1576 |
continuous_at_within_inv ~> continuous_at_within_inverse
|
wenzelm@45839
|
1577 |
continuous_at_inv ~> continuous_at_inverse
|
wenzelm@45839
|
1578 |
continuous_at_norm ~> continuous_norm [OF continuous_at_id]
|
wenzelm@45839
|
1579 |
continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
|
wenzelm@45839
|
1580 |
continuous_at_component ~> continuous_component [OF continuous_at_id]
|
wenzelm@45839
|
1581 |
continuous_on_neg ~> continuous_on_minus
|
wenzelm@45839
|
1582 |
continuous_on_sub ~> continuous_on_diff
|
wenzelm@45839
|
1583 |
continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
|
wenzelm@45839
|
1584 |
continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
|
wenzelm@45839
|
1585 |
continuous_on_mul ~> continuous_on_scaleR
|
wenzelm@45839
|
1586 |
continuous_on_mul_real ~> continuous_on_mult
|
wenzelm@45839
|
1587 |
continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
|
wenzelm@45839
|
1588 |
continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
|
wenzelm@45839
|
1589 |
continuous_on_inverse ~> continuous_on_inv
|
wenzelm@45839
|
1590 |
uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
|
wenzelm@45839
|
1591 |
uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
|
wenzelm@45839
|
1592 |
subset_interior ~> interior_mono
|
wenzelm@45839
|
1593 |
subset_closure ~> closure_mono
|
wenzelm@45839
|
1594 |
closure_univ ~> closure_UNIV
|
wenzelm@45839
|
1595 |
real_arch_lt ~> reals_Archimedean2
|
wenzelm@45839
|
1596 |
real_arch ~> reals_Archimedean3
|
wenzelm@45839
|
1597 |
real_abs_norm ~> abs_norm_cancel
|
wenzelm@45839
|
1598 |
real_abs_sub_norm ~> norm_triangle_ineq3
|
wenzelm@45839
|
1599 |
norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
|
wenzelm@45839
|
1600 |
|
wenzelm@45839
|
1601 |
* Session HOL-Probability:
|
wenzelm@45839
|
1602 |
- Caratheodory's extension lemma is now proved for ring_of_sets.
|
wenzelm@45839
|
1603 |
- Infinite products of probability measures are now available.
|
wenzelm@45839
|
1604 |
- Sigma closure is independent, if the generator is independent
|
wenzelm@45839
|
1605 |
- Use extended reals instead of positive extended
|
wenzelm@45839
|
1606 |
reals. INCOMPATIBILITY.
|
wenzelm@45839
|
1607 |
|
huffman@45914
|
1608 |
* Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
|
huffman@45914
|
1609 |
|
huffman@45914
|
1610 |
expand_fun_below ~> fun_below_iff
|
huffman@45914
|
1611 |
below_fun_ext ~> fun_belowI
|
huffman@45914
|
1612 |
expand_cfun_eq ~> cfun_eq_iff
|
huffman@45914
|
1613 |
ext_cfun ~> cfun_eqI
|
huffman@45914
|
1614 |
expand_cfun_below ~> cfun_below_iff
|
huffman@45914
|
1615 |
below_cfun_ext ~> cfun_belowI
|
huffman@45914
|
1616 |
monofun_fun_fun ~> fun_belowD
|
huffman@45914
|
1617 |
monofun_fun_arg ~> monofunE
|
huffman@45914
|
1618 |
monofun_lub_fun ~> adm_monofun [THEN admD]
|
huffman@45914
|
1619 |
cont_lub_fun ~> adm_cont [THEN admD]
|
huffman@45914
|
1620 |
cont2cont_Rep_CFun ~> cont2cont_APP
|
huffman@45914
|
1621 |
cont_Rep_CFun_app ~> cont_APP_app
|
huffman@45914
|
1622 |
cont_Rep_CFun_app_app ~> cont_APP_app_app
|
huffman@45914
|
1623 |
cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
|
huffman@45914
|
1624 |
cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
|
huffman@45914
|
1625 |
contlub_cfun ~> lub_APP [symmetric]
|
huffman@45914
|
1626 |
contlub_LAM ~> lub_LAM [symmetric]
|
huffman@45914
|
1627 |
thelubI ~> lub_eqI
|
huffman@45914
|
1628 |
UU_I ~> bottomI
|
huffman@45914
|
1629 |
lift_distinct1 ~> lift.distinct(1)
|
huffman@45914
|
1630 |
lift_distinct2 ~> lift.distinct(2)
|
huffman@45914
|
1631 |
Def_not_UU ~> lift.distinct(2)
|
huffman@45914
|
1632 |
Def_inject ~> lift.inject
|
huffman@45914
|
1633 |
below_UU_iff ~> below_bottom_iff
|
huffman@45914
|
1634 |
eq_UU_iff ~> eq_bottom_iff
|
huffman@45914
|
1635 |
|
huffman@45774
|
1636 |
|
krauss@42549
|
1637 |
*** Document preparation ***
|
krauss@42549
|
1638 |
|
wenzelm@45671
|
1639 |
* Antiquotation @{rail} layouts railroad syntax diagrams, see also
|
wenzelm@45671
|
1640 |
isar-ref manual, both for description and actual application of the
|
wenzelm@45671
|
1641 |
same.
|
wenzelm@45671
|
1642 |
|
wenzelm@45671
|
1643 |
* Antiquotation @{value} evaluates the given term and presents its
|
wenzelm@45671
|
1644 |
result.
|
wenzelm@45671
|
1645 |
|
wenzelm@45671
|
1646 |
* Antiquotations: term style "isub" provides ad-hoc conversion of
|
wenzelm@45671
|
1647 |
variables x1, y23 into subscripted form x\<^isub>1,
|
wenzelm@45671
|
1648 |
y\<^isub>2\<^isub>3.
|
wenzelm@42520
|
1649 |
|
wenzelm@43355
|
1650 |
* Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
|
wenzelm@43355
|
1651 |
(e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
|
wenzelm@43355
|
1652 |
|
wenzelm@45838
|
1653 |
* Localized \isabellestyle switch can be used within blocks or groups
|
wenzelm@45838
|
1654 |
like this:
|
wenzelm@45838
|
1655 |
|
wenzelm@45838
|
1656 |
\isabellestyle{it} %preferred default
|
wenzelm@45838
|
1657 |
{\isabellestylett @{text "typewriter stuff"}}
|
wenzelm@45838
|
1658 |
|
wenzelm@45838
|
1659 |
* Discontinued special treatment of hard tabulators. Implicit
|
wenzelm@45838
|
1660 |
tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
|
wenzelm@45838
|
1661 |
layouts.
|
wenzelm@45671
|
1662 |
|
wenzelm@42520
|
1663 |
|
wenzelm@42815
|
1664 |
*** ML ***
|
wenzelm@42815
|
1665 |
|
wenzelm@44613
|
1666 |
* The inner syntax of sort/type/term/prop supports inlined YXML
|
wenzelm@44613
|
1667 |
representations within quoted string tokens. By encoding logical
|
wenzelm@44613
|
1668 |
entities via Term_XML (in ML or Scala) concrete syntax can be
|
wenzelm@44613
|
1669 |
bypassed, which is particularly useful for producing bits of text
|
wenzelm@44613
|
1670 |
under external program control.
|
wenzelm@44613
|
1671 |
|
wenzelm@44451
|
1672 |
* Antiquotations for ML and document preparation are managed as theory
|
wenzelm@44451
|
1673 |
data, which requires explicit setup.
|
wenzelm@44451
|
1674 |
|
wenzelm@43772
|
1675 |
* Isabelle_Process.is_active allows tools to check if the official
|
wenzelm@43772
|
1676 |
process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
|
wenzelm@43772
|
1677 |
(better known as Proof General).
|
wenzelm@43772
|
1678 |
|
wenzelm@43231
|
1679 |
* Structure Proof_Context follows standard naming scheme. Old
|
wenzelm@43231
|
1680 |
ProofContext is still available for some time as legacy alias.
|
wenzelm@43231
|
1681 |
|
wenzelm@42886
|
1682 |
* Structure Timing provides various operations for timing; supersedes
|
wenzelm@42886
|
1683 |
former start_timing/end_timing etc.
|
wenzelm@42886
|
1684 |
|
wenzelm@42815
|
1685 |
* Path.print is the official way to show file-system paths to users
|
wenzelm@42815
|
1686 |
(including quotes etc.).
|
wenzelm@42815
|
1687 |
|
wenzelm@42937
|
1688 |
* Inner syntax: identifiers in parse trees of generic categories
|
wenzelm@42937
|
1689 |
"logic", "aprop", "idt" etc. carry position information (disguised as
|
wenzelm@42937
|
1690 |
type constraints). Occasional INCOMPATIBILITY with non-compliant
|
wenzelm@42938
|
1691 |
translations that choke on unexpected type constraints. Positions can
|
wenzelm@42938
|
1692 |
be stripped in ML translations via Syntax.strip_positions /
|
wenzelm@42938
|
1693 |
Syntax.strip_positions_ast, or via the syntax constant
|
wenzelm@42938
|
1694 |
"_strip_positions" within parse trees. As last resort, positions can
|
wenzelm@42938
|
1695 |
be disabled via the configuration option Syntax.positions, which is
|
wenzelm@42938
|
1696 |
called "syntax_positions" in Isar attribute syntax.
|
wenzelm@42937
|
1697 |
|
wenzelm@43162
|
1698 |
* Discontinued special status of various ML structures that contribute
|
wenzelm@43162
|
1699 |
to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
|
wenzelm@43162
|
1700 |
pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
|
wenzelm@43162
|
1701 |
refer directly to Ast.Constant, Lexicon.is_identifier,
|
wenzelm@43162
|
1702 |
Syntax_Trans.mk_binder_tr etc.
|
wenzelm@43107
|
1703 |
|
wenzelm@43122
|
1704 |
* Typed print translation: discontinued show_sorts argument, which is
|
wenzelm@43122
|
1705 |
already available via context of "advanced" translation.
|
wenzelm@43122
|
1706 |
|
wenzelm@43241
|
1707 |
* Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
|
wenzelm@43241
|
1708 |
goal states; body tactic needs to address all subgoals uniformly.
|
wenzelm@43241
|
1709 |
|
wenzelm@43284
|
1710 |
* Slightly more special eq_list/eq_set, with shortcut involving
|
wenzelm@43284
|
1711 |
pointer equality (assumes that eq relation is reflexive).
|
wenzelm@43284
|
1712 |
|
wenzelm@43665
|
1713 |
* Classical tactics use proper Proof.context instead of historic types
|
wenzelm@43665
|
1714 |
claset/clasimpset. Old-style declarations like addIs, addEs, addDs
|
wenzelm@43665
|
1715 |
operate directly on Proof.context. Raw type claset retains its use as
|
wenzelm@43665
|
1716 |
snapshot of the classical context, which can be recovered via
|
wenzelm@43665
|
1717 |
(put_claset HOL_cs) etc. Type clasimpset has been discontinued.
|
wenzelm@43665
|
1718 |
INCOMPATIBILITY, classical tactics and derived proof methods require
|
wenzelm@43665
|
1719 |
proper Proof.context.
|
wenzelm@43665
|
1720 |
|
wenzelm@45684
|
1721 |
|
wenzelm@45684
|
1722 |
*** System ***
|
wenzelm@45684
|
1723 |
|
wenzelm@45839
|
1724 |
* Discontinued support for Poly/ML 5.2, which was the last version
|
wenzelm@45839
|
1725 |
without proper multithreading and TimeLimit implementation.
|
wenzelm@45839
|
1726 |
|
wenzelm@45839
|
1727 |
* Discontinued old lib/scripts/polyml-platform, which has been
|
wenzelm@45839
|
1728 |
obsolete since Isabelle2009-2.
|
wenzelm@45839
|
1729 |
|
wenzelm@45838
|
1730 |
* Various optional external tools are referenced more robustly and
|
wenzelm@45838
|
1731 |
uniformly by explicit Isabelle settings as follows:
|
wenzelm@45838
|
1732 |
|
wenzelm@45838
|
1733 |
ISABELLE_CSDP (formerly CSDP_EXE)
|
wenzelm@45838
|
1734 |
ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
|
wenzelm@45838
|
1735 |
ISABELLE_OCAML (formerly EXEC_OCAML)
|
wenzelm@45838
|
1736 |
ISABELLE_SWIPL (formerly EXEC_SWIPL)
|
wenzelm@45838
|
1737 |
ISABELLE_YAP (formerly EXEC_YAP)
|
wenzelm@45838
|
1738 |
|
wenzelm@45838
|
1739 |
Note that automated detection from the file-system or search path has
|
wenzelm@45838
|
1740 |
been discontinued. INCOMPATIBILITY.
|
wenzelm@45838
|
1741 |
|
wenzelm@44628
|
1742 |
* Scala layer provides JVM method invocation service for static
|
wenzelm@45671
|
1743 |
methods of type (String)String, see Invoke_Scala.method in ML. For
|
wenzelm@45671
|
1744 |
example:
|
wenzelm@44628
|
1745 |
|
wenzelm@44628
|
1746 |
Invoke_Scala.method "java.lang.System.getProperty" "java.home"
|
wenzelm@44628
|
1747 |
|
wenzelm@45838
|
1748 |
Together with YXML.string_of_body/parse_body and XML.Encode/Decode
|
wenzelm@45838
|
1749 |
this allows to pass structured values between ML and Scala.
|
wenzelm@45671
|
1750 |
|
wenzelm@45684
|
1751 |
* The IsabelleText fonts includes some further glyphs to support the
|
wenzelm@45684
|
1752 |
Prover IDE. Potential INCOMPATIBILITY: users who happen to have
|
wenzelm@45684
|
1753 |
installed a local copy (which is normally *not* required) need to
|
wenzelm@45684
|
1754 |
delete or update it from ~~/lib/fonts/.
|
wenzelm@42815
|
1755 |
|
wenzelm@42577
|
1756 |
|
wenzelm@45960
|
1757 |
|
wenzelm@41760
|
1758 |
New in Isabelle2011 (January 2011)
|
wenzelm@41760
|
1759 |
----------------------------------
|
wenzelm@37358
|
1760 |
|
wenzelm@37553
|
1761 |
*** General ***
|
wenzelm@37553
|
1762 |
|
wenzelm@41821
|
1763 |
* Experimental Prover IDE based on Isabelle/Scala and jEdit (see
|
wenzelm@41859
|
1764 |
src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
|
wenzelm@41859
|
1765 |
useful tooltips and hyperlinks produced from its static analysis. The
|
wenzelm@41859
|
1766 |
bundled component provides an executable Isabelle tool that can be run
|
wenzelm@41859
|
1767 |
like this:
|
wenzelm@41859
|
1768 |
|
wenzelm@41859
|
1769 |
Isabelle2011/bin/isabelle jedit
|
wenzelm@41821
|
1770 |
|
wenzelm@41196
|
1771 |
* Significantly improved Isabelle/Isar implementation manual.
|
wenzelm@41196
|
1772 |
|
wenzelm@41842
|
1773 |
* System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
|
wenzelm@41843
|
1774 |
(and thus refers to something like $HOME/.isabelle/Isabelle2011),
|
wenzelm@41842
|
1775 |
while the default heap location within that directory lacks that extra
|
wenzelm@41842
|
1776 |
suffix. This isolates multiple Isabelle installations from each
|
wenzelm@41842
|
1777 |
other, avoiding problems with old settings in new versions.
|
wenzelm@41842
|
1778 |
INCOMPATIBILITY, need to copy/upgrade old user settings manually.
|
wenzelm@41842
|
1779 |
|
wenzelm@41195
|
1780 |
* Source files are always encoded as UTF-8, instead of old-fashioned
|
wenzelm@41195
|
1781 |
ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
|
wenzelm@41196
|
1782 |
the following package declarations:
|
wenzelm@41195
|
1783 |
|
wenzelm@41195
|
1784 |
\usepackage[utf8]{inputenc}
|
wenzelm@41195
|
1785 |
\usepackage{textcomp}
|
wenzelm@41195
|
1786 |
|
krauss@41688
|
1787 |
* Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
|
wenzelm@37553
|
1788 |
a Unicode character is treated as a single symbol, not a sequence of
|
wenzelm@37553
|
1789 |
non-ASCII bytes as before. Since Isabelle/ML string literals may
|
wenzelm@37553
|
1790 |
contain symbols without further backslash escapes, Unicode can now be
|
wenzelm@37553
|
1791 |
used here as well. Recall that Symbol.explode in ML provides a
|
wenzelm@37553
|
1792 |
consistent view on symbols, while raw explode (or String.explode)
|
wenzelm@37553
|
1793 |
merely give a byte-oriented representation.
|
wenzelm@37553
|
1794 |
|
wenzelm@41842
|
1795 |
* Theory loader: source files are primarily located via the master
|
wenzelm@41842
|
1796 |
directory of each theory node (where the .thy file itself resides).
|
wenzelm@41842
|
1797 |
The global load path is still partially available as legacy feature.
|
wenzelm@41842
|
1798 |
Minor INCOMPATIBILITY due to subtle change in file lookup: use
|
wenzelm@41842
|
1799 |
explicit paths, relatively to the theory.
|
wenzelm@38381
|
1800 |
|
wenzelm@38188
|
1801 |
* Special treatment of ML file names has been discontinued.
|
wenzelm@38188
|
1802 |
Historically, optional extensions .ML or .sml were added on demand --
|
wenzelm@38188
|
1803 |
at the cost of clarity of file dependencies. Recall that Isabelle/ML
|
wenzelm@38188
|
1804 |
files exclusively use the .ML extension. Minor INCOMPATIBILTY.
|
wenzelm@38188
|
1805 |
|
wenzelm@39285
|
1806 |
* Various options that affect pretty printing etc. are now properly
|
wenzelm@39042
|
1807 |
handled within the context via configuration options, instead of
|
wenzelm@41137
|
1808 |
unsynchronized references or print modes. There are both ML Config.T
|
wenzelm@41137
|
1809 |
entities and Isar declaration attributes to access these.
|
wenzelm@39042
|
1810 |
|
wenzelm@39371
|
1811 |
ML (Config.T) Isar (attribute)
|
wenzelm@39371
|
1812 |
|
wenzelm@39374
|
1813 |
eta_contract eta_contract
|
wenzelm@39396
|
1814 |
show_brackets show_brackets
|
wenzelm@39393
|
1815 |
show_sorts show_sorts
|
wenzelm@39393
|
1816 |
show_types show_types
|
wenzelm@39372
|
1817 |
show_question_marks show_question_marks
|
wenzelm@39372
|
1818 |
show_consts show_consts
|
wenzelm@41137
|
1819 |
show_abbrevs show_abbrevs
|
wenzelm@39372
|
1820 |
|
wenzelm@41628
|
1821 |
Syntax.ast_trace syntax_ast_trace
|
wenzelm@41628
|
1822 |
Syntax.ast_stat syntax_ast_stat
|
wenzelm@39372
|
1823 |
Syntax.ambiguity_level syntax_ambiguity_level
|
wenzelm@39372
|
1824 |
|
wenzelm@39372
|
1825 |
Goal_Display.goals_limit goals_limit
|
wenzelm@39372
|
1826 |
Goal_Display.show_main_goal show_main_goal
|
wenzelm@39372
|
1827 |
|
wenzelm@41628
|
1828 |
Method.rule_trace rule_trace
|
wenzelm@41628
|
1829 |
|
wenzelm@39371
|
1830 |
Thy_Output.display thy_output_display
|
wenzelm@39371
|
1831 |
Thy_Output.quotes thy_output_quotes
|
wenzelm@39371
|
1832 |
Thy_Output.indent thy_output_indent
|
wenzelm@39371
|
1833 |
Thy_Output.source thy_output_source
|
wenzelm@39371
|
1834 |
Thy_Output.break thy_output_break
|
wenzelm@39371
|
1835 |
|
krauss@41688
|
1836 |
Note that corresponding "..._default" references in ML may only be
|
wenzelm@39042
|
1837 |
changed globally at the ROOT session setup, but *not* within a theory.
|
wenzelm@41137
|
1838 |
The option "show_abbrevs" supersedes the former print mode
|
wenzelm@41137
|
1839 |
"no_abbrevs" with inverted meaning.
|
wenzelm@39042
|
1840 |
|
wenzelm@41136
|
1841 |
* More systematic naming of some configuration options.
|
huffman@41542
|
1842 |
INCOMPATIBILITY.
|
wenzelm@41136
|
1843 |
|
wenzelm@41136
|
1844 |
trace_simp ~> simp_trace
|
wenzelm@41136
|
1845 |
debug_simp ~> simp_debug
|
wenzelm@41136
|
1846 |
|
wenzelm@40537
|
1847 |
* Support for real valued configuration options, using simplistic
|
wenzelm@40537
|
1848 |
floating-point notation that coincides with the inner syntax for
|
wenzelm@40537
|
1849 |
float_token.
|
wenzelm@40537
|
1850 |
|
wenzelm@41842
|
1851 |
* Support for real valued preferences (with approximative PGIP type):
|
wenzelm@41842
|
1852 |
front-ends need to accept "pgint" values in float notation.
|
wenzelm@41842
|
1853 |
INCOMPATIBILITY.
|
wenzelm@41821
|
1854 |
|
wenzelm@41821
|
1855 |
* The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
|
wenzelm@41821
|
1856 |
DejaVu Sans.
|
wenzelm@41821
|
1857 |
|
wenzelm@41842
|
1858 |
* Discontinued support for Poly/ML 5.0 and 5.1 versions.
|
wenzelm@41842
|
1859 |
|
wenzelm@41196
|
1860 |
|
wenzelm@41196
|
1861 |
*** Pure ***
|
wenzelm@41196
|
1862 |
|
wenzelm@41497
|
1863 |
* Command 'type_synonym' (with single argument) replaces somewhat
|
wenzelm@41497
|
1864 |
outdated 'types', which is still available as legacy feature for some
|
wenzelm@41497
|
1865 |
time.
|
wenzelm@41497
|
1866 |
|
wenzelm@41497
|
1867 |
* Command 'nonterminal' (with 'and' separated list of arguments)
|
wenzelm@41497
|
1868 |
replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
|
wenzelm@41495
|
1869 |
|
wenzelm@41213
|
1870 |
* Command 'notepad' replaces former 'example_proof' for
|
wenzelm@41268
|
1871 |
experimentation in Isar without any result. INCOMPATIBILITY.
|
wenzelm@41213
|
1872 |
|
ballarin@41683
|
1873 |
* Locale interpretation commands 'interpret' and 'sublocale' accept
|
ballarin@41683
|
1874 |
lists of equations to map definitions in a locale to appropriate
|
ballarin@41683
|
1875 |
entities in the context of the interpretation. The 'interpretation'
|
ballarin@41683
|
1876 |
command already provided this functionality.
|
ballarin@41683
|
1877 |
|
wenzelm@41842
|
1878 |
* Diagnostic command 'print_dependencies' prints the locale instances
|
wenzelm@41842
|
1879 |
that would be activated if the specified expression was interpreted in
|
wenzelm@41842
|
1880 |
the current context. Variant "print_dependencies!" assumes a context
|
wenzelm@41842
|
1881 |
without interpretations.
|
ballarin@38356
|
1882 |
|
ballarin@38356
|
1883 |
* Diagnostic command 'print_interps' prints interpretations in proofs
|
ballarin@38356
|
1884 |
in addition to interpretations in theories.
|
ballarin@38356
|
1885 |
|
wenzelm@38956
|
1886 |
* Discontinued obsolete 'global' and 'local' commands to manipulate
|
wenzelm@38956
|
1887 |
the theory name space. Rare INCOMPATIBILITY. The ML functions
|
wenzelm@38956
|
1888 |
Sign.root_path and Sign.local_path may be applied directly where this
|
wenzelm@38956
|
1889 |
feature is still required for historical reasons.
|
wenzelm@38956
|
1890 |
|
wenzelm@41196
|
1891 |
* Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
|
haftmann@39445
|
1892 |
'definition' instead.
|
haftmann@39445
|
1893 |
|
wenzelm@41822
|
1894 |
* The "prems" fact, which refers to the accidental collection of
|
wenzelm@41822
|
1895 |
foundational premises in the context, is now explicitly marked as
|
wenzelm@41842
|
1896 |
legacy feature and will be discontinued soon. Consider using "assms"
|
wenzelm@41842
|
1897 |
of the head statement or reference facts by explicit names.
|
wenzelm@41822
|
1898 |
|
wenzelm@41051
|
1899 |
* Document antiquotations @{class} and @{type} print classes and type
|
wenzelm@41051
|
1900 |
constructors.
|
wenzelm@41051
|
1901 |
|
wenzelm@41051
|
1902 |
* Document antiquotation @{file} checks file/directory entries within
|
wenzelm@41051
|
1903 |
the local file system.
|
haftmann@39551
|
1904 |
|
ballarin@38356
|
1905 |
|
haftmann@37362
|
1906 |
*** HOL ***
|
haftmann@37362
|
1907 |
|
wenzelm@41842
|
1908 |
* Coercive subtyping: functions can be declared as coercions and type
|
wenzelm@41842
|
1909 |
inference will add them as necessary upon input of a term. Theory
|
wenzelm@41842
|
1910 |
Complex_Main declares real :: nat => real and real :: int => real as
|
wenzelm@41842
|
1911 |
coercions. A coercion function f is declared like this:
|
wenzelm@41187
|
1912 |
|
wenzelm@41187
|
1913 |
declare [[coercion f]]
|
nipkow@41109
|
1914 |
|
wenzelm@41819
|
1915 |
To lift coercions through type constructors (e.g. from nat => real to
|
nipkow@41109
|
1916 |
nat list => real list), map functions can be declared, e.g.
|
nipkow@41109
|
1917 |
|
wenzelm@41187
|
1918 |
declare [[coercion_map map]]
|
wenzelm@41187
|
1919 |
|
wenzelm@41187
|
1920 |
Currently coercion inference is activated only in theories including
|
wenzelm@41187
|
1921 |
real numbers, i.e. descendants of Complex_Main. This is controlled by
|
wenzelm@41268
|
1922 |
the configuration option "coercion_enabled", e.g. it can be enabled in
|
wenzelm@41187
|
1923 |
other theories like this:
|
wenzelm@41187
|
1924 |
|
wenzelm@41187
|
1925 |
declare [[coercion_enabled]]
|
nipkow@41109
|
1926 |
|
wenzelm@41819
|
1927 |
* Command 'partial_function' provides basic support for recursive
|
wenzelm@41819
|
1928 |
function definitions over complete partial orders. Concrete instances
|
krauss@40424
|
1929 |
are provided for i) the option type, ii) tail recursion on arbitrary
|
wenzelm@41819
|
1930 |
types, and iii) the heap monad of Imperative_HOL. See
|
wenzelm@41819
|
1931 |
src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
|
wenzelm@41819
|
1932 |
for examples.
|
krauss@40424
|
1933 |
|
wenzelm@41842
|
1934 |
* Function package: f.psimps rules are no longer implicitly declared
|
wenzelm@41842
|
1935 |
as [simp]. INCOMPATIBILITY.
|
wenzelm@41842
|
1936 |
|
wenzelm@41842
|
1937 |
* Datatype package: theorems generated for executable equality (class
|
wenzelm@41842
|
1938 |
"eq") carry proper names and are treated as default code equations.
|
haftmann@41646
|
1939 |
|
wenzelm@41819
|
1940 |
* Inductive package: now offers command 'inductive_simps' to
|
haftmann@41646
|
1941 |
automatically derive instantiated and simplified equations for
|
haftmann@41646
|
1942 |
inductive predicates, similar to 'inductive_cases'.
|
haftmann@41646
|
1943 |
|
wenzelm@41819
|
1944 |
* Command 'enriched_type' allows to register properties of the
|
wenzelm@41819
|
1945 |
functorial structure of types.
|
haftmann@40004
|
1946 |
|
haftmann@39868
|
1947 |
* Improved infrastructure for term evaluation using code generator
|
haftmann@39868
|
1948 |
techniques, in particular static evaluation conversions.
|
haftmann@39868
|
1949 |
|
wenzelm@41842
|
1950 |
* Code generator: Scala (2.8 or higher) has been added to the target
|
wenzelm@41842
|
1951 |
languages.
|
wenzelm@41842
|
1952 |
|
haftmann@41646
|
1953 |
* Code generator: globbing constant expressions "*" and "Theory.*"
|
haftmann@41646
|
1954 |
have been replaced by the more idiomatic "_" and "Theory._".
|
haftmann@41646
|
1955 |
INCOMPATIBILITY.
|
haftmann@41646
|
1956 |
|
haftmann@41646
|
1957 |
* Code generator: export_code without explicit file declaration prints
|
haftmann@41646
|
1958 |
to standard output. INCOMPATIBILITY.
|
haftmann@41646
|
1959 |
|
haftmann@41646
|
1960 |
* Code generator: do not print function definitions for case
|
haftmann@41646
|
1961 |
combinators any longer.
|
haftmann@41646
|
1962 |
|
wenzelm@41842
|
1963 |
* Code generator: simplification with rules determined with
|
wenzelm@41819
|
1964 |
src/Tools/Code/code_simp.ML and method "code_simp".
|
wenzelm@41819
|
1965 |
|
wenzelm@41842
|
1966 |
* Code generator for records: more idiomatic representation of record
|
wenzelm@41842
|
1967 |
types. Warning: records are not covered by ancient SML code
|
wenzelm@41842
|
1968 |
generation any longer. INCOMPATIBILITY. In cases of need, a suitable
|
wenzelm@41842
|
1969 |
rep_datatype declaration helps to succeed then:
|
wenzelm@41842
|
1970 |
|
wenzelm@41842
|
1971 |
record 'a foo = ...
|
wenzelm@41842
|
1972 |
...
|
wenzelm@41842
|
1973 |
rep_datatype foo_ext ...
|
wenzelm@41842
|
1974 |
|
wenzelm@41819
|
1975 |
* Records: logical foundation type for records does not carry a
|
wenzelm@41819
|
1976 |
'_type' suffix any longer (obsolete due to authentic syntax).
|
wenzelm@41819
|
1977 |
INCOMPATIBILITY.
|
wenzelm@41196
|
1978 |
|
haftmann@41646
|
1979 |
* Quickcheck now by default uses exhaustive testing instead of random
|
wenzelm@41819
|
1980 |
testing. Random testing can be invoked by "quickcheck [random]",
|
wenzelm@41819
|
1981 |
exhaustive testing by "quickcheck [exhaustive]".
|
haftmann@41646
|
1982 |
|
haftmann@41646
|
1983 |
* Quickcheck instantiates polymorphic types with small finite
|
haftmann@41646
|
1984 |
datatypes by default. This enables a simple execution mechanism to
|
haftmann@41646
|
1985 |
handle quantifiers and function equality over the finite datatypes.
|
haftmann@41646
|
1986 |
|
wenzelm@41819
|
1987 |
* Quickcheck random generator has been renamed from "code" to
|
wenzelm@41819
|
1988 |
"random". INCOMPATIBILITY.
|
haftmann@41646
|
1989 |
|
haftmann@41646
|
1990 |
* Quickcheck now has a configurable time limit which is set to 30
|
haftmann@41646
|
1991 |
seconds by default. This can be changed by adding [timeout = n] to the
|
haftmann@41646
|
1992 |
quickcheck command. The time limit for Auto Quickcheck is still set
|
haftmann@41646
|
1993 |
independently.
|
haftmann@38705
|
1994 |
|
haftmann@38705
|
1995 |
* Quickcheck in locales considers interpretations of that locale for
|
haftmann@38705
|
1996 |
counter example search.
|
haftmann@38705
|
1997 |
|
blanchet@40240
|
1998 |
* Sledgehammer:
|
wenzelm@41819
|
1999 |
- Added "smt" and "remote_smt" provers based on the "smt" proof
|
wenzelm@41819
|
2000 |
method. See the Sledgehammer manual for details ("isabelle doc
|
wenzelm@41819
|
2001 |
sledgehammer").
|
blanchet@40240
|
2002 |
- Renamed commands:
|
blanchet@40240
|
2003 |
sledgehammer atp_info ~> sledgehammer running_provers
|
blanchet@40240
|
2004 |
sledgehammer atp_kill ~> sledgehammer kill_provers
|
blanchet@40240
|
2005 |
sledgehammer available_atps ~> sledgehammer available_provers
|
blanchet@40240
|
2006 |
INCOMPATIBILITY.
|
blanchet@40240
|
2007 |
- Renamed options:
|
blanchet@40240
|
2008 |
sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
|
blanchet@40243
|
2009 |
sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
|
blanchet@40582
|
2010 |
sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
|
blanchet@40582
|
2011 |
(and "ms" and "min" are no longer supported)
|
blanchet@40582
|
2012 |
INCOMPATIBILITY.
|
blanchet@40582
|
2013 |
|
blanchet@40582
|
2014 |
* Nitpick:
|
blanchet@40582
|
2015 |
- Renamed options:
|
blanchet@40582
|
2016 |
nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
|
blanchet@40582
|
2017 |
nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
|
blanchet@40240
|
2018 |
INCOMPATIBILITY.
|
blanchet@40968
|
2019 |
- Added support for partial quotient types.
|
blanchet@40968
|
2020 |
- Added local versions of the "Nitpick.register_xxx" functions.
|
blanchet@40968
|
2021 |
- Added "whack" option.
|
blanchet@40968
|
2022 |
- Allow registration of quotient types as codatatypes.
|
blanchet@40968
|
2023 |
- Improved "merge_type_vars" option to merge more types.
|
blanchet@40968
|
2024 |
- Removed unsound "fast_descrs" option.
|
blanchet@40968
|
2025 |
- Added custom symmetry breaking for datatypes, making it possible to reach
|
blanchet@40968
|
2026 |
higher cardinalities.
|
blanchet@40968
|
2027 |
- Prevent the expansion of too large definitions.
|
blanchet@40138
|
2028 |
|
wenzelm@41819
|
2029 |
* Proof methods "metis" and "meson" now have configuration options
|
wenzelm@41819
|
2030 |
"meson_trace", "metis_trace", and "metis_verbose" that can be enabled
|
wenzelm@41819
|
2031 |
to diagnose these tools. E.g.
|
wenzelm@41819
|
2032 |
|
wenzelm@41819
|
2033 |
using [[metis_trace = true]]
|
wenzelm@41819
|
2034 |
|
haftmann@41646
|
2035 |
* Auto Solve: Renamed "Auto Solve Direct". The tool is now available
|
haftmann@41646
|
2036 |
manually as command 'solve_direct'.
|
haftmann@41646
|
2037 |
|
boehmes@41846
|
2038 |
* The default SMT solver Z3 must be enabled explicitly (due to
|
boehmes@41846
|
2039 |
licensing issues) by setting the environment variable
|
wenzelm@41851
|
2040 |
Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
|
wenzelm@41851
|
2041 |
commercial applications, the SMT solver CVC3 is provided as fall-back;
|
wenzelm@41851
|
2042 |
changing the SMT solver is done via the configuration option
|
wenzelm@41851
|
2043 |
"smt_solver".
|
boehmes@41680
|
2044 |
|
boehmes@41680
|
2045 |
* Remote SMT solvers need to be referred to by the "remote_" prefix,
|
wenzelm@41819
|
2046 |
i.e. "remote_cvc3" and "remote_z3".
|
wenzelm@41819
|
2047 |
|
wenzelm@41819
|
2048 |
* Added basic SMT support for datatypes, records, and typedefs using
|
wenzelm@41819
|
2049 |
the oracle mode (no proofs). Direct support of pairs has been dropped
|
wenzelm@41819
|
2050 |
in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
|
wenzelm@41819
|
2051 |
support for a similar behavior). Minor INCOMPATIBILITY.
|
boehmes@41680
|
2052 |
|
boehmes@40403
|
2053 |
* Changed SMT configuration options:
|
boehmes@40403
|
2054 |
- Renamed:
|
boehmes@41680
|
2055 |
z3_proofs ~> smt_oracle (with inverted meaning)
|
boehmes@40403
|
2056 |
z3_trace_assms ~> smt_trace_used_facts
|
boehmes@40403
|
2057 |
INCOMPATIBILITY.
|
boehmes@40403
|
2058 |
- Added:
|
boehmes@40651
|
2059 |
smt_verbose
|
boehmes@41680
|
2060 |
smt_random_seed
|
boehmes@40651
|
2061 |
smt_datatypes
|
boehmes@41680
|
2062 |
smt_infer_triggers
|
boehmes@41680
|
2063 |
smt_monomorph_limit
|
boehmes@40403
|
2064 |
cvc3_options
|
boehmes@41680
|
2065 |
remote_cvc3_options
|
boehmes@41680
|
2066 |
remote_z3_options
|
boehmes@40403
|
2067 |
yices_options
|
blanchet@40138
|
2068 |
|
wenzelm@41196
|
2069 |
* Boogie output files (.b2i files) need to be declared in the theory
|
wenzelm@41196
|
2070 |
header.
|
boehmes@40818
|
2071 |
|
wenzelm@41842
|
2072 |
* Simplification procedure "list_to_set_comprehension" rewrites list
|
wenzelm@41842
|
2073 |
comprehensions applied to List.set to set comprehensions. Occasional
|
wenzelm@41842
|
2074 |
INCOMPATIBILITY, may be deactivated like this:
|
wenzelm@41842
|
2075 |
|
wenzelm@41842
|
2076 |
declare [[simproc del: list_to_set_comprehension]]
|
wenzelm@41842
|
2077 |
|
wenzelm@41821
|
2078 |
* Removed old version of primrec package. INCOMPATIBILITY.
|
haftmann@41646
|
2079 |
|
haftmann@41646
|
2080 |
* Removed simplifier congruence rule of "prod_case", as has for long
|
haftmann@41646
|
2081 |
been the case with "split". INCOMPATIBILITY.
|
haftmann@41646
|
2082 |
|
haftmann@41646
|
2083 |
* String.literal is a type, but not a datatype. INCOMPATIBILITY.
|
haftmann@41646
|
2084 |
|
krauss@40634
|
2085 |
* Removed [split_format ... and ... and ...] version of
|
krauss@40634
|
2086 |
[split_format]. Potential INCOMPATIBILITY.
|
krauss@40634
|
2087 |
|
wenzelm@41819
|
2088 |
* Predicate "sorted" now defined inductively, with nice induction
|
wenzelm@41819
|
2089 |
rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
|
haftmann@41646
|
2090 |
|
haftmann@41646
|
2091 |
* Constant "contents" renamed to "the_elem", to free the generic name
|
haftmann@41646
|
2092 |
contents for other uses. INCOMPATIBILITY.
|
haftmann@41646
|
2093 |
|
haftmann@41646
|
2094 |
* Renamed class eq and constant eq (for code generation) to class
|
haftmann@41646
|
2095 |
equal and constant equal, plus renaming of related facts and various
|
haftmann@41646
|
2096 |
tuning. INCOMPATIBILITY.
|
haftmann@41646
|
2097 |
|
haftmann@41646
|
2098 |
* Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
|
haftmann@41646
|
2099 |
|
wenzelm@41819
|
2100 |
* Removed output syntax "'a ~=> 'b" for "'a => 'b option".
|
wenzelm@41819
|
2101 |
INCOMPATIBILITY.
|
haftmann@41646
|
2102 |
|
haftmann@41646
|
2103 |
* Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
|
haftmann@41646
|
2104 |
avoid confusion with finite sets. INCOMPATIBILITY.
|
haftmann@41646
|
2105 |
|
haftmann@41646
|
2106 |
* Abandoned locales equiv, congruent and congruent2 for equivalence
|
haftmann@41646
|
2107 |
relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
|
haftmann@41646
|
2108 |
for congruent(2)).
|
haftmann@41646
|
2109 |
|
haftmann@41646
|
2110 |
* Some previously unqualified names have been qualified:
|
haftmann@41646
|
2111 |
|
haftmann@41646
|
2112 |
types
|
haftmann@41646
|
2113 |
bool ~> HOL.bool
|
haftmann@41646
|
2114 |
nat ~> Nat.nat
|
haftmann@41646
|
2115 |
|
haftmann@41646
|
2116 |
constants
|
haftmann@41646
|
2117 |
Trueprop ~> HOL.Trueprop
|
haftmann@41646
|
2118 |
True ~> HOL.True
|
haftmann@41646
|
2119 |
False ~> HOL.False
|
haftmann@41646
|
2120 |
op & ~> HOL.conj
|
haftmann@41646
|
2121 |
op | ~> HOL.disj
|
haftmann@41646
|
2122 |
op --> ~> HOL.implies
|
haftmann@41646
|
2123 |
op = ~> HOL.eq
|
haftmann@41646
|
2124 |
Not ~> HOL.Not
|
haftmann@41646
|
2125 |
The ~> HOL.The
|
haftmann@41646
|
2126 |
All ~> HOL.All
|
haftmann@41646
|
2127 |
Ex ~> HOL.Ex
|
haftmann@41646
|
2128 |
Ex1 ~> HOL.Ex1
|
haftmann@41646
|
2129 |
Let ~> HOL.Let
|
haftmann@41646
|
2130 |
If ~> HOL.If
|
haftmann@41646
|
2131 |
Ball ~> Set.Ball
|
haftmann@41646
|
2132 |
Bex ~> Set.Bex
|
haftmann@41646
|
2133 |
Suc ~> Nat.Suc
|
haftmann@41646
|
2134 |
Pair ~> Product_Type.Pair
|
haftmann@41646
|
2135 |
fst ~> Product_Type.fst
|
haftmann@41646
|
2136 |
snd ~> Product_Type.snd
|
haftmann@41646
|
2137 |
curry ~> Product_Type.curry
|
haftmann@41646
|
2138 |
op : ~> Set.member
|
haftmann@41646
|
2139 |
Collect ~> Set.Collect
|
haftmann@41646
|
2140 |
|
haftmann@41646
|
2141 |
INCOMPATIBILITY.
|
haftmann@41646
|
2142 |
|
haftmann@41646
|
2143 |
* More canonical naming convention for some fundamental definitions:
|
haftmann@41646
|
2144 |
|
haftmann@41646
|
2145 |
bot_bool_eq ~> bot_bool_def
|
haftmann@41646
|
2146 |
top_bool_eq ~> top_bool_def
|
haftmann@41646
|
2147 |
inf_bool_eq ~> inf_bool_def
|
haftmann@41646
|
2148 |
sup_bool_eq ~> sup_bool_def
|
haftmann@41646
|
2149 |
bot_fun_eq ~> bot_fun_def
|
haftmann@41646
|
2150 |
top_fun_eq ~> top_fun_def
|
haftmann@41646
|
2151 |
inf_fun_eq ~> inf_fun_def
|
haftmann@41646
|
2152 |
sup_fun_eq ~> sup_fun_def
|
haftmann@41646
|
2153 |
|
haftmann@41646
|
2154 |
INCOMPATIBILITY.
|
haftmann@41646
|
2155 |
|
haftmann@41646
|
2156 |
* More stylized fact names:
|
haftmann@41646
|
2157 |
|
haftmann@41646
|
2158 |
expand_fun_eq ~> fun_eq_iff
|
haftmann@41646
|
2159 |
expand_set_eq ~> set_eq_iff
|
haftmann@41646
|
2160 |
set_ext ~> set_eqI
|
haftmann@41646
|
2161 |
nat_number ~> eval_nat_numeral
|
haftmann@41646
|
2162 |
|
haftmann@41646
|
2163 |
INCOMPATIBILITY.
|
haftmann@41646
|
2164 |
|
wenzelm@41819
|
2165 |
* Refactoring of code-generation specific operations in theory List:
|
haftmann@41646
|
2166 |
|
haftmann@41646
|
2167 |
constants
|
haftmann@41646
|
2168 |
null ~> List.null
|
haftmann@41646
|
2169 |
|
haftmann@41646
|
2170 |
facts
|
haftmann@41646
|
2171 |
mem_iff ~> member_def
|
haftmann@41646
|
2172 |
null_empty ~> null_def
|
haftmann@41646
|
2173 |
|
haftmann@41646
|
2174 |
INCOMPATIBILITY. Note that these were not supposed to be used
|
haftmann@41646
|
2175 |
regularly unless for striking reasons; their main purpose was code
|
haftmann@41646
|
2176 |
generation.
|
haftmann@41646
|
2177 |
|
haftmann@41646
|
2178 |
Various operations from the Haskell prelude are used for generating
|
haftmann@41646
|
2179 |
Haskell code.
|
haftmann@41646
|
2180 |
|
wenzelm@41819
|
2181 |
* Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
|
wenzelm@41819
|
2182 |
"surj f" is now an abbreviation of "range f = UNIV". The theorems
|
wenzelm@41819
|
2183 |
bij_def and surj_def are unchanged. INCOMPATIBILITY.
|
haftmann@41646
|
2184 |
|
haftmann@41646
|
2185 |
* Abolished some non-alphabetic type names: "prod" and "sum" replace
|
haftmann@41646
|
2186 |
"*" and "+" respectively. INCOMPATIBILITY.
|
haftmann@41646
|
2187 |
|
haftmann@41646
|
2188 |
* Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
|
wenzelm@41819
|
2189 |
"Sum_Type.Plus" instead.
|
haftmann@41646
|
2190 |
|
haftmann@41646
|
2191 |
* Constant "split" has been merged with constant "prod_case"; names of
|
haftmann@41646
|
2192 |
ML functions, facts etc. involving split have been retained so far,
|
haftmann@41646
|
2193 |
though. INCOMPATIBILITY.
|
haftmann@41646
|
2194 |
|
haftmann@41646
|
2195 |
* Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
|
haftmann@41646
|
2196 |
instead. INCOMPATIBILITY.
|
haftmann@41646
|
2197 |
|
wenzelm@41819
|
2198 |
* Removed lemma "Option.is_none_none" which duplicates "is_none_def".
|
haftmann@41646
|
2199 |
INCOMPATIBILITY.
|
haftmann@41646
|
2200 |
|
wenzelm@41842
|
2201 |
* Former theory Library/Enum is now part of the HOL-Main image.
|
wenzelm@41842
|
2202 |
INCOMPATIBILITY: all constants of the Enum theory now have to be
|
wenzelm@41842
|
2203 |
referred to by its qualified name.
|
wenzelm@41842
|
2204 |
|
wenzelm@41842
|
2205 |
enum ~> Enum.enum
|
wenzelm@41842
|
2206 |
nlists ~> Enum.nlists
|
wenzelm@41842
|
2207 |
product ~> Enum.product
|
wenzelm@41842
|
2208 |
|
wenzelm@41842
|
2209 |
* Theory Library/Monad_Syntax provides do-syntax for monad types.
|
wenzelm@41842
|
2210 |
Syntax in Library/State_Monad has been changed to avoid ambiguities.
|
wenzelm@41842
|
2211 |
INCOMPATIBILITY.
|
wenzelm@41842
|
2212 |
|
wenzelm@41842
|
2213 |
* Theory Library/SetsAndFunctions has been split into
|
wenzelm@41842
|
2214 |
Library/Function_Algebras and Library/Set_Algebras; canonical names
|
wenzelm@41842
|
2215 |
for instance definitions for functions; various improvements.
|
wenzelm@41842
|
2216 |
INCOMPATIBILITY.
|
wenzelm@41842
|
2217 |
|
wenzelm@41842
|
2218 |
* Theory Library/Multiset provides stable quicksort implementation of
|
wenzelm@41842
|
2219 |
sort_key.
|
wenzelm@41842
|
2220 |
|
wenzelm@41842
|
2221 |
* Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
|
wenzelm@41842
|
2222 |
INCOMPATIBILITY.
|
wenzelm@41842
|
2223 |
|
wenzelm@41842
|
2224 |
* Session Multivariate_Analysis: introduced a type class for euclidean
|
wenzelm@41842
|
2225 |
space. Most theorems are now stated in terms of euclidean spaces
|
wenzelm@41842
|
2226 |
instead of finite cartesian products.
|
wenzelm@41842
|
2227 |
|
wenzelm@41842
|
2228 |
types
|
wenzelm@41842
|
2229 |
real ^ 'n ~> 'a::real_vector
|
wenzelm@41842
|
2230 |
~> 'a::euclidean_space
|
wenzelm@41842
|
2231 |
~> 'a::ordered_euclidean_space
|
wenzelm@41842
|
2232 |
(depends on your needs)
|
wenzelm@41842
|
2233 |
|
wenzelm@41842
|
2234 |
constants
|
wenzelm@41842
|
2235 |
_ $ _ ~> _ $$ _
|
wenzelm@41842
|
2236 |
\<chi> x. _ ~> \<chi>\<chi> x. _
|
wenzelm@41842
|
2237 |
CARD('n) ~> DIM('a)
|
wenzelm@41842
|
2238 |
|
wenzelm@41842
|
2239 |
Also note that the indices are now natural numbers and not from some
|
wenzelm@41842
|
2240 |
finite type. Finite cartesian products of euclidean spaces, products
|
wenzelm@41842
|
2241 |
of euclidean spaces the real and complex numbers are instantiated to
|
wenzelm@41842
|
2242 |
be euclidean_spaces. INCOMPATIBILITY.
|
wenzelm@41842
|
2243 |
|
wenzelm@41842
|
2244 |
* Session Probability: introduced pextreal as positive extended real
|
wenzelm@41842
|
2245 |
numbers. Use pextreal as value for measures. Introduce the
|
wenzelm@41842
|
2246 |
Radon-Nikodym derivative, product spaces and Fubini's theorem for
|
wenzelm@41842
|
2247 |
arbitrary sigma finite measures. Introduces Lebesgue measure based on
|
wenzelm@41842
|
2248 |
the integral in Multivariate Analysis. INCOMPATIBILITY.
|
wenzelm@41842
|
2249 |
|
wenzelm@41842
|
2250 |
* Session Imperative_HOL: revamped, corrected dozens of inadequacies.
|
wenzelm@41842
|
2251 |
INCOMPATIBILITY.
|
wenzelm@41842
|
2252 |
|
wenzelm@41842
|
2253 |
* Session SPARK (with image HOL-SPARK) provides commands to load and
|
wenzelm@41842
|
2254 |
prove verification conditions generated by the SPARK Ada program
|
wenzelm@41842
|
2255 |
verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
|
berghofe@41815
|
2256 |
|
huffman@40869
|
2257 |
|
ballarin@41681
|
2258 |
*** HOL-Algebra ***
|
ballarin@41681
|
2259 |
|
ballarin@41681
|
2260 |
* Theorems for additive ring operations (locale abelian_monoid and
|
ballarin@41681
|
2261 |
descendants) are generated by interpretation from their multiplicative
|
ballarin@41682
|
2262 |
counterparts. Names (in particular theorem names) have the mandatory
|
ballarin@41682
|
2263 |
qualifier 'add'. Previous theorem names are redeclared for
|
ballarin@41682
|
2264 |
compatibility.
|
ballarin@41682
|
2265 |
|
wenzelm@41819
|
2266 |
* Structure "int_ring" is now an abbreviation (previously a
|
ballarin@41682
|
2267 |
definition). This fits more natural with advanced interpretations.
|
ballarin@41681
|
2268 |
|
ballarin@41681
|
2269 |
|
huffman@40869
|
2270 |
*** HOLCF ***
|
huffman@40869
|
2271 |
|
huffman@40869
|
2272 |
* The domain package now runs in definitional mode by default: The
|
wenzelm@41819
|
2273 |
former command 'new_domain' is now called 'domain'. To use the domain
|
huffman@40869
|
2274 |
package in its original axiomatic mode, use 'domain (unsafe)'.
|
huffman@40869
|
2275 |
INCOMPATIBILITY.
|
huffman@40869
|
2276 |
|
wenzelm@41819
|
2277 |
* The new class "domain" is now the default sort. Class "predomain"
|
wenzelm@41819
|
2278 |
is an unpointed version of "domain". Theories can be updated by
|
wenzelm@41819
|
2279 |
replacing sort annotations as shown below. INCOMPATIBILITY.
|
huffman@40869
|
2280 |
|
huffman@40869
|
2281 |
'a::type ~> 'a::countable
|
huffman@40869
|
2282 |
'a::cpo ~> 'a::predomain
|
huffman@40869
|
2283 |
'a::pcpo ~> 'a::domain
|
huffman@40869
|
2284 |
|
wenzelm@41819
|
2285 |
* The old type class "rep" has been superseded by class "domain".
|
huffman@40869
|
2286 |
Accordingly, users of the definitional package must remove any
|
wenzelm@41819
|
2287 |
"default_sort rep" declarations. INCOMPATIBILITY.
|
huffman@40869
|
2288 |
|
huffman@41649
|
2289 |
* The domain package (definitional mode) now supports unpointed
|
huffman@41649
|
2290 |
predomain argument types, as long as they are marked 'lazy'. (Strict
|
wenzelm@41819
|
2291 |
arguments must be in class "domain".) For example, the following
|
huffman@41649
|
2292 |
domain definition now works:
|
huffman@41649
|
2293 |
|
huffman@41649
|
2294 |
domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
|
huffman@41649
|
2295 |
|
huffman@41649
|
2296 |
* Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
|
wenzelm@41819
|
2297 |
instances for types from main HOL: bool, nat, int, char, 'a + 'b,
|
wenzelm@41819
|
2298 |
'a option, and 'a list. Additionally, it configures fixrec and the
|
wenzelm@41819
|
2299 |
domain package to work with these types. For example:
|
huffman@41649
|
2300 |
|
huffman@41649
|
2301 |
fixrec isInl :: "('a + 'b) u -> tr"
|
huffman@41649
|
2302 |
where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
|
huffman@41649
|
2303 |
|
huffman@41649
|
2304 |
domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
|
huffman@41649
|
2305 |
|
wenzelm@41819
|
2306 |
* The "(permissive)" option of fixrec has been replaced with a
|
wenzelm@41819
|
2307 |
per-equation "(unchecked)" option. See
|
wenzelm@41819
|
2308 |
src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
|
wenzelm@41819
|
2309 |
|
wenzelm@41819
|
2310 |
* The "bifinite" class no longer fixes a constant "approx"; the class
|
wenzelm@41819
|
2311 |
now just asserts that such a function exists. INCOMPATIBILITY.
|
wenzelm@41819
|
2312 |
|
wenzelm@41819
|
2313 |
* Former type "alg_defl" has been renamed to "defl". HOLCF no longer
|
huffman@41535
|
2314 |
defines an embedding of type 'a defl into udom by default; instances
|
wenzelm@41819
|
2315 |
of "bifinite" and "domain" classes are available in
|
wenzelm@41819
|
2316 |
src/HOL/HOLCF/Library/Defl_Bifinite.thy.
|
wenzelm@41819
|
2317 |
|
wenzelm@41819
|
2318 |
* The syntax "REP('a)" has been replaced with "DEFL('a)".
|
wenzelm@41819
|
2319 |
|
wenzelm@41819
|
2320 |
* The predicate "directed" has been removed. INCOMPATIBILITY.
|
wenzelm@41819
|
2321 |
|
wenzelm@41819
|
2322 |
* The type class "finite_po" has been removed. INCOMPATIBILITY.
|
wenzelm@41819
|
2323 |
|
wenzelm@41819
|
2324 |
* The function "cprod_map" has been renamed to "prod_map".
|
huffman@41649
|
2325 |
INCOMPATIBILITY.
|
huffman@41649
|
2326 |
|
huffman@41649
|
2327 |
* The monadic bind operator on each powerdomain has new binder syntax
|
wenzelm@41819
|
2328 |
similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
|
wenzelm@41819
|
2329 |
"upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
|
huffman@41649
|
2330 |
|
huffman@41649
|
2331 |
* The infix syntax for binary union on each powerdomain has changed
|
wenzelm@41819
|
2332 |
from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
|
wenzelm@41819
|
2333 |
syntax. INCOMPATIBILITY.
|
wenzelm@41819
|
2334 |
|
wenzelm@41819
|
2335 |
* The constant "UU" has been renamed to "bottom". The syntax "UU" is
|
huffman@41677
|
2336 |
still supported as an input translation.
|
huffman@41677
|
2337 |
|
huffman@40869
|
2338 |
* Renamed some theorems (the original names are also still available).
|
wenzelm@41819
|
2339 |
|
huffman@40869
|
2340 |
expand_fun_below ~> fun_below_iff
|
huffman@40869
|
2341 |
below_fun_ext ~> fun_belowI
|
huffman@40869
|
2342 |
expand_cfun_eq ~> cfun_eq_iff
|
huffman@40869
|
2343 |
ext_cfun ~> cfun_eqI
|
huffman@40869
|
2344 |
expand_cfun_below ~> cfun_below_iff
|
huffman@40869
|
2345 |
below_cfun_ext ~> cfun_belowI
|
huffman@40869
|
2346 |
cont2cont_Rep_CFun ~> cont2cont_APP
|
huffman@40869
|
2347 |
|
huffman@40869
|
2348 |
* The Abs and Rep functions for various types have changed names.
|
wenzelm@41196
|
2349 |
Related theorem names have also changed to match. INCOMPATIBILITY.
|
wenzelm@41819
|
2350 |
|
huffman@40869
|
2351 |
Rep_CFun ~> Rep_cfun
|
huffman@40869
|
2352 |
Abs_CFun ~> Abs_cfun
|
huffman@40869
|
2353 |
Rep_Sprod ~> Rep_sprod
|
huffman@40869
|
2354 |
Abs_Sprod ~> Abs_sprod
|
huffman@40869
|
2355 |
Rep_Ssum ~> Rep_ssum
|
huffman@40869
|
2356 |
Abs_Ssum ~> Abs_ssum
|
huffman@40869
|
2357 |
|
huffman@40869
|
2358 |
* Lemmas with names of the form *_defined_iff or *_strict_iff have
|
wenzelm@41819
|
2359 |
been renamed to *_bottom_iff. INCOMPATIBILITY.
|
huffman@40869
|
2360 |
|
huffman@40869
|
2361 |
* Various changes to bisimulation/coinduction with domain package:
|
wenzelm@41819
|
2362 |
|
wenzelm@41819
|
2363 |
- Definitions of "bisim" constants no longer mention definedness.
|
wenzelm@41819
|
2364 |
- With mutual recursion, "bisim" predicate is now curried.
|
huffman@40869
|
2365 |
- With mutual recursion, each type gets a separate coind theorem.
|
huffman@40869
|
2366 |
- Variable names in bisim_def and coinduct rules have changed.
|
wenzelm@41819
|
2367 |
|
huffman@40869
|
2368 |
INCOMPATIBILITY.
|
huffman@40869
|
2369 |
|
wenzelm@41819
|
2370 |
* Case combinators generated by the domain package for type "foo" are
|
wenzelm@41819
|
2371 |
now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
|
huffman@40869
|
2372 |
|
huffman@41019
|
2373 |
* Several theorems have been renamed to more accurately reflect the
|
wenzelm@41819
|
2374 |
names of constants and types involved. INCOMPATIBILITY.
|
wenzelm@41819
|
2375 |
|
huffman@41019
|
2376 |
thelub_const ~> lub_const
|
huffman@41019
|
2377 |
lub_const ~> is_lub_const
|
huffman@41019
|
2378 |
thelubI ~> lub_eqI
|
huffman@41019
|
2379 |
is_lub_lub ~> is_lubD2
|
huffman@41019
|
2380 |
lubI ~> is_lub_lub
|
huffman@41019
|
2381 |
unique_lub ~> is_lub_unique
|
huffman@41019
|
2382 |
is_ub_lub ~> is_lub_rangeD1
|
huffman@41019
|
2383 |
lub_bin_chain ~> is_lub_bin_chain
|
huffman@41278
|
2384 |
lub_fun ~> is_lub_fun
|
huffman@41278
|
2385 |
thelub_fun ~> lub_fun
|
huffman@41279
|
2386 |
thelub_cfun ~> lub_cfun
|
huffman@41019
|
2387 |
thelub_Pair ~> lub_Pair
|
huffman@41019
|
2388 |
lub_cprod ~> is_lub_prod
|
huffman@41019
|
2389 |
thelub_cprod ~> lub_prod
|
huffman@41019
|
2390 |
minimal_cprod ~> minimal_prod
|
huffman@41019
|
2391 |
inst_cprod_pcpo ~> inst_prod_pcpo
|
huffman@41678
|
2392 |
UU_I ~> bottomI
|
huffman@41678
|
2393 |
compact_UU ~> compact_bottom
|
huffman@41678
|
2394 |
deflation_UU ~> deflation_bottom
|
huffman@41678
|
2395 |
finite_deflation_UU ~> finite_deflation_bottom
|
huffman@41019
|
2396 |
|
wenzelm@41819
|
2397 |
* Many legacy theorem names have been discontinued. INCOMPATIBILITY.
|
wenzelm@41819
|
2398 |
|
huffman@40869
|
2399 |
sq_ord_less_eq_trans ~> below_eq_trans
|
huffman@40869
|
2400 |
sq_ord_eq_less_trans ~> eq_below_trans
|
huffman@40869
|
2401 |
refl_less ~> below_refl
|
huffman@40869
|
2402 |
trans_less ~> below_trans
|
huffman@40869
|
2403 |
antisym_less ~> below_antisym
|
huffman@40869
|
2404 |
antisym_less_inverse ~> po_eq_conv [THEN iffD1]
|
huffman@40869
|
2405 |
box_less ~> box_below
|
huffman@40869
|
2406 |
rev_trans_less ~> rev_below_trans
|
huffman@40869
|
2407 |
not_less2not_eq ~> not_below2not_eq
|
huffman@40869
|
2408 |
less_UU_iff ~> below_UU_iff
|
huffman@40869
|
2409 |
flat_less_iff ~> flat_below_iff
|
huffman@40869
|
2410 |
adm_less ~> adm_below
|
huffman@40869
|
2411 |
adm_not_less ~> adm_not_below
|
huffman@40869
|
2412 |
adm_compact_not_less ~> adm_compact_not_below
|
huffman@40869
|
2413 |
less_fun_def ~> below_fun_def
|
huffman@40869
|
2414 |
expand_fun_less ~> fun_below_iff
|
huffman@40869
|
2415 |
less_fun_ext ~> fun_belowI
|
huffman@40869
|
2416 |
less_discr_def ~> below_discr_def
|
huffman@40869
|
2417 |
discr_less_eq ~> discr_below_eq
|
huffman@40869
|
2418 |
less_unit_def ~> below_unit_def
|
huffman@40869
|
2419 |
less_cprod_def ~> below_prod_def
|
huffman@40869
|
2420 |
prod_lessI ~> prod_belowI
|
huffman@40869
|
2421 |
Pair_less_iff ~> Pair_below_iff
|
huffman@40869
|
2422 |
fst_less_iff ~> fst_below_iff
|
huffman@40869
|
2423 |
snd_less_iff ~> snd_below_iff
|
huffman@40869
|
2424 |
expand_cfun_less ~> cfun_below_iff
|
huffman@40869
|
2425 |
less_cfun_ext ~> cfun_belowI
|
huffman@40869
|
2426 |
injection_less ~> injection_below
|
huffman@40869
|
2427 |
less_up_def ~> below_up_def
|
huffman@40869
|
2428 |
not_Iup_less ~> not_Iup_below
|
huffman@40869
|
2429 |
Iup_less ~> Iup_below
|
huffman@40869
|
2430 |
up_less ~> up_below
|
huffman@40869
|
2431 |
Def_inject_less_eq ~> Def_below_Def
|
huffman@40869
|
2432 |
Def_less_is_eq ~> Def_below_iff
|
huffman@40869
|
2433 |
spair_less_iff ~> spair_below_iff
|
huffman@40869
|
2434 |
less_sprod ~> below_sprod
|
huffman@40869
|
2435 |
spair_less ~> spair_below
|
huffman@40869
|
2436 |
sfst_less_iff ~> sfst_below_iff
|
huffman@40869
|
2437 |
ssnd_less_iff ~> ssnd_below_iff
|
huffman@40869
|
2438 |
fix_least_less ~> fix_least_below
|
huffman@40869
|
2439 |
dist_less_one ~> dist_below_one
|
huffman@40869
|
2440 |
less_ONE ~> below_ONE
|
huffman@40869
|
2441 |
ONE_less_iff ~> ONE_below_iff
|
huffman@40869
|
2442 |
less_sinlD ~> below_sinlD
|
huffman@40869
|
2443 |
less_sinrD ~> below_sinrD
|
huffman@40869
|
2444 |
|
huffman@40869
|
2445 |
|
wenzelm@41196
|
2446 |
*** FOL and ZF ***
|
haftmann@38747
|
2447 |
|
wenzelm@41558
|
2448 |
* All constant names are now qualified internally and use proper
|
wenzelm@41558
|
2449 |
identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
|
wenzelm@41558
|
2450 |
|
haftmann@38747
|
2451 |
|
wenzelm@38136
|
2452 |
*** ML ***
|
wenzelm@38136
|
2453 |
|
wenzelm@41842
|
2454 |
* Antiquotation @{assert} inlines a function bool -> unit that raises
|
wenzelm@41842
|
2455 |
Fail if the argument is false. Due to inlining the source position of
|
wenzelm@41842
|
2456 |
failed assertions is included in the error output.
|
wenzelm@41842
|
2457 |
|
wenzelm@41842
|
2458 |
* Discontinued antiquotation @{theory_ref}, which is obsolete since ML
|
wenzelm@41842
|
2459 |
text is in practice always evaluated with a stable theory checkpoint.
|
wenzelm@41842
|
2460 |
Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
|
wenzelm@41842
|
2461 |
|
wenzelm@41842
|
2462 |
* Antiquotation @{theory A} refers to theory A from the ancestry of
|
wenzelm@41842
|
2463 |
the current context, not any accidental theory loader state as before.
|
wenzelm@41842
|
2464 |
Potential INCOMPATIBILITY, subtle change in semantics.
|
wenzelm@41842
|
2465 |
|
wenzelm@41842
|
2466 |
* Syntax.pretty_priority (default 0) configures the required priority
|
wenzelm@41842
|
2467 |
of pretty-printed output and thus affects insertion of parentheses.
|
wenzelm@41842
|
2468 |
|
wenzelm@41842
|
2469 |
* Syntax.default_root (default "any") configures the inner syntax
|
wenzelm@41842
|
2470 |
category (nonterminal symbol) for parsing of terms.
|
wenzelm@41842
|
2471 |
|
wenzelm@41842
|
2472 |
* Former exception Library.UnequalLengths now coincides with
|
wenzelm@41842
|
2473 |
ListPair.UnequalLengths.
|
wenzelm@41842
|
2474 |
|
wenzelm@41494
|
2475 |
* Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
|
wenzelm@41494
|
2476 |
main functionality is provided by structure Simplifier.
|
wenzelm@41494
|
2477 |
|
wenzelm@40875
|
2478 |
* Renamed raw "explode" function to "raw_explode" to emphasize its
|
wenzelm@40875
|
2479 |
meaning. Note that internally to Isabelle, Symbol.explode is used in
|
wenzelm@40875
|
2480 |
almost all situations.
|
wenzelm@40875
|
2481 |
|
wenzelm@40575
|
2482 |
* Discontinued obsolete function sys_error and exception SYS_ERROR.
|
wenzelm@40575
|
2483 |
See implementation manual for further details on exceptions in
|
wenzelm@40575
|
2484 |
Isabelle/ML.
|
wenzelm@40575
|
2485 |
|
wenzelm@39862
|
2486 |
* Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
|
wenzelm@39862
|
2487 |
meaning.
|
wenzelm@39862
|
2488 |
|
wenzelm@39814
|
2489 |
* Renamed structure PureThy to Pure_Thy and moved most of its
|
wenzelm@39814
|
2490 |
operations to structure Global_Theory, to emphasize that this is
|
wenzelm@39814
|
2491 |
rarely-used global-only stuff.
|
wenzelm@39814
|
2492 |
|
wenzelm@39782
|
2493 |
* Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
|
wenzelm@39782
|
2494 |
instead (or tracing for high-volume output).
|
wenzelm@39782
|
2495 |
|
wenzelm@39285
|
2496 |
* Configuration option show_question_marks only affects regular pretty
|
wenzelm@39285
|
2497 |
printing of types and terms, not raw Term.string_of_vname.
|
wenzelm@39285
|
2498 |
|
wenzelm@39410
|
2499 |
* ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
|
wenzelm@39410
|
2500 |
INCOMPATIBILITY, superseded by static antiquotations @{thm} and
|
wenzelm@39410
|
2501 |
@{thms} for most purposes.
|
wenzelm@39410
|
2502 |
|
wenzelm@41842
|
2503 |
* ML structure Unsynchronized is never opened, not even in Isar
|
wenzelm@39285
|
2504 |
interaction mode as before. Old Unsynchronized.set etc. have been
|
wenzelm@39285
|
2505 |
discontinued -- use plain := instead. This should be *rare* anyway,
|
wenzelm@39285
|
2506 |
since modern tools always work via official context data, notably
|
wenzelm@39285
|
2507 |
configuration options.
|
wenzelm@39285
|
2508 |
|
wenzelm@39516
|
2509 |
* Parallel and asynchronous execution requires special care concerning
|
wenzelm@39516
|
2510 |
interrupts. Structure Exn provides some convenience functions that
|
wenzelm@39516
|
2511 |
avoid working directly with raw Interrupt. User code must not absorb
|
wenzelm@39516
|
2512 |
interrupts -- intermediate handling (for cleanup etc.) needs to be
|
wenzelm@39516
|
2513 |
followed by re-raising of the original exception. Another common
|
wenzelm@39516
|
2514 |
source of mistakes are "handle _" patterns, which make the meaning of
|
wenzelm@39516
|
2515 |
the program subject to physical effects of the environment.
|
wenzelm@39516
|
2516 |
|
wenzelm@38136
|
2517 |
|
wenzelm@38136
|
2518 |
|
wenzelm@37144
|
2519 |
New in Isabelle2009-2 (June 2010)
|
wenzelm@37144
|
2520 |
---------------------------------
|
haftmann@33990
|
2521 |
|
wenzelm@35260
|
2522 |
*** General ***
|
wenzelm@35260
|
2523 |
|
wenzelm@35546
|
2524 |
* Authentic syntax for *all* logical entities (type classes, type
|
wenzelm@35546
|
2525 |
constructors, term constants): provides simple and robust
|
wenzelm@35546
|
2526 |
correspondence between formal entities and concrete syntax. Within
|
wenzelm@35546
|
2527 |
the parse tree / AST representations, "constants" are decorated by
|
wenzelm@35546
|
2528 |
their category (class, type, const) and spelled out explicitly with
|
wenzelm@35546
|
2529 |
their full internal name.
|
wenzelm@35546
|
2530 |
|
wenzelm@35546
|
2531 |
Substantial INCOMPATIBILITY concerning low-level syntax declarations
|
wenzelm@35546
|
2532 |
and translations (translation rules and translation functions in ML).
|
wenzelm@35546
|
2533 |
Some hints on upgrading:
|
wenzelm@35260
|
2534 |
|
wenzelm@35260
|
2535 |
- Many existing uses of 'syntax' and 'translations' can be replaced
|
wenzelm@35546
|
2536 |
by more modern 'type_notation', 'notation' and 'abbreviation',
|
wenzelm@35546
|
2537 |
which are independent of this issue.
|
wenzelm@35260
|
2538 |
|
wenzelm@35260
|
2539 |
- 'translations' require markup within the AST; the term syntax
|
wenzelm@35260
|
2540 |
provides the following special forms:
|
wenzelm@35260
|
2541 |
|
wenzelm@35260
|
2542 |
CONST c -- produces syntax version of constant c from context
|
wenzelm@35261
|
2543 |
XCONST c -- literally c, checked as constant from context
|
wenzelm@35261
|
2544 |
c -- literally c, if declared by 'syntax'
|
wenzelm@35261
|
2545 |
|
wenzelm@35261
|
2546 |
Plain identifiers are treated as AST variables -- occasionally the
|
wenzelm@35261
|
2547 |
system indicates accidental variables via the error "rhs contains
|
wenzelm@35261
|
2548 |
extra variables".
|
wenzelm@35260
|
2549 |
|
wenzelm@35546
|
2550 |
Type classes and type constructors are marked according to their
|
wenzelm@35546
|
2551 |
concrete syntax. Some old translations rules need to be written
|
wenzelm@35546
|
2552 |
for the "type" category, using type constructor application
|
wenzelm@35546
|
2553 |
instead of pseudo-term application of the default category
|
wenzelm@35546
|
2554 |
"logic".
|
wenzelm@35546
|
2555 |
|
wenzelm@35260
|
2556 |
- 'parse_translation' etc. in ML may use the following
|
wenzelm@35260
|
2557 |
antiquotations:
|
wenzelm@35260
|
2558 |
|
wenzelm@35546
|
2559 |
@{class_syntax c} -- type class c within parse tree / AST
|
wenzelm@35546
|
2560 |
@{term_syntax c} -- type constructor c within parse tree / AST
|
wenzelm@35260
|
2561 |
@{const_syntax c} -- ML version of "CONST c" above
|
wenzelm@35260
|
2562 |
@{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
|
wenzelm@35260
|
2563 |
|
wenzelm@35546
|
2564 |
- Literal types within 'typed_print_translations', i.e. those *not*
|
wenzelm@35546
|
2565 |
represented as pseudo-terms are represented verbatim. Use @{class
|
wenzelm@35546
|
2566 |
c} or @{type_name c} here instead of the above syntax
|
wenzelm@35546
|
2567 |
antiquotations.
|
wenzelm@35546
|
2568 |
|
wenzelm@35260
|
2569 |
Note that old non-authentic syntax was based on unqualified base
|
wenzelm@35546
|
2570 |
names, so all of the above "constant" names would coincide. Recall
|
wenzelm@35546
|
2571 |
that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
|
wenzelm@35546
|
2572 |
diagnose syntax problems.
|
wenzelm@35260
|
2573 |
|
wenzelm@35352
|
2574 |
* Type constructors admit general mixfix syntax, not just infix.
|
wenzelm@35352
|
2575 |
|
wenzelm@36524
|
2576 |
* Concrete syntax may be attached to local entities without a proof
|
wenzelm@36524
|
2577 |
body, too. This works via regular mixfix annotations for 'fix',
|
wenzelm@36524
|
2578 |
'def', 'obtain' etc. or via the explicit 'write' command, which is
|
wenzelm@36524
|
2579 |
similar to the 'notation' command in theory specifications.
|
wenzelm@36524
|
2580 |
|
wenzelm@35129
|
2581 |
* Discontinued unnamed infix syntax (legacy feature for many years) --
|
wenzelm@35130
|
2582 |
need to specify constant name and syntax separately. Internal ML
|
wenzelm@35130
|
2583 |
datatype constructors have been renamed from InfixName to Infix etc.
|
wenzelm@35130
|
2584 |
Minor INCOMPATIBILITY.
|
wenzelm@35129
|
2585 |
|
wenzelm@37351
|
2586 |
* Schematic theorem statements need to be explicitly markup as such,
|
wenzelm@37351
|
2587 |
via commands 'schematic_lemma', 'schematic_theorem',
|
wenzelm@37351
|
2588 |
'schematic_corollary'. Thus the relevance of the proof is made
|
wenzelm@37351
|
2589 |
syntactically clear, which impacts performance in a parallel or
|
wenzelm@37351
|
2590 |
asynchronous interactive environment. Minor INCOMPATIBILITY.
|
wenzelm@37351
|
2591 |
|
wenzelm@37351
|
2592 |
* Use of cumulative prems via "!" in some proof methods has been
|
wenzelm@37351
|
2593 |
discontinued (old legacy feature).
|
wenzelm@37351
|
2594 |
|
wenzelm@37351
|
2595 |
* References 'trace_simp' and 'debug_simp' have been replaced by
|
wenzelm@37351
|
2596 |
configuration options stored in the context. Enabling tracing (the
|
wenzelm@37351
|
2597 |
case of debugging is similar) in proofs works via
|
wenzelm@37351
|
2598 |
|
wenzelm@37351
|
2599 |
using [[trace_simp = true]]
|
wenzelm@37351
|
2600 |
|
wenzelm@37351
|
2601 |
Tracing is then active for all invocations of the simplifier in
|
wenzelm@37351
|
2602 |
subsequent goal refinement steps. Tracing may also still be enabled or
|
wenzelm@41028
|
2603 |
disabled via the ProofGeneral settings menu.
|
wenzelm@37351
|
2604 |
|
wenzelm@37351
|
2605 |
* Separate commands 'hide_class', 'hide_type', 'hide_const',
|
wenzelm@37351
|
2606 |
'hide_fact' replace the former 'hide' KIND command. Minor
|
wenzelm@37351
|
2607 |
INCOMPATIBILITY.
|
wenzelm@37351
|
2608 |
|
wenzelm@37351
|
2609 |
* Improved parallelism of proof term normalization: usedir -p2 -q0 is
|
wenzelm@37351
|
2610 |
more efficient than combinations with -q1 or -q2.
|
wenzelm@37351
|
2611 |
|
wenzelm@37351
|
2612 |
|
wenzelm@37351
|
2613 |
*** Pure ***
|
wenzelm@37351
|
2614 |
|
wenzelm@37351
|
2615 |
* Proofterms record type-class reasoning explicitly, using the
|
wenzelm@37351
|
2616 |
"unconstrain" operation internally. This eliminates all sort
|
wenzelm@37351
|
2617 |
constraints from a theorem and proof, introducing explicit
|
wenzelm@37351
|
2618 |
OFCLASS-premises. On the proof term level, this operation is
|
wenzelm@37351
|
2619 |
automatically applied at theorem boundaries, such that closed proofs
|
wenzelm@37351
|
2620 |
are always free of sort constraints. INCOMPATIBILITY for tools that
|
wenzelm@37351
|
2621 |
inspect proof terms.
|
wenzelm@37351
|
2622 |
|
wenzelm@37351
|
2623 |
* Local theory specifications may depend on extra type variables that
|
wenzelm@37351
|
2624 |
are not present in the result type -- arguments TYPE('a) :: 'a itself
|
wenzelm@37351
|
2625 |
are added internally. For example:
|
wenzelm@37351
|
2626 |
|
wenzelm@37351
|
2627 |
definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
|
wenzelm@37351
|
2628 |
|
wenzelm@37351
|
2629 |
* Predicates of locales introduced by classes carry a mandatory
|
wenzelm@37351
|
2630 |
"class" prefix. INCOMPATIBILITY.
|
wenzelm@37351
|
2631 |
|
wenzelm@37351
|
2632 |
* Vacuous class specifications observe default sort. INCOMPATIBILITY.
|
wenzelm@37351
|
2633 |
|
wenzelm@37351
|
2634 |
* Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
|
wenzelm@37351
|
2635 |
'class' instead.
|
wenzelm@37351
|
2636 |
|
wenzelm@37351
|
2637 |
* Command 'code_reflect' allows to incorporate generated ML code into
|
wenzelm@37351
|
2638 |
runtime environment; replaces immature code_datatype antiquotation.
|
wenzelm@37351
|
2639 |
INCOMPATIBILITY.
|
wenzelm@37351
|
2640 |
|
wenzelm@37351
|
2641 |
* Code generator: simple concept for abstract datatypes obeying
|
wenzelm@37351
|
2642 |
invariants.
|
wenzelm@37351
|
2643 |
|
wenzelm@37351
|
2644 |
* Code generator: details of internal data cache have no impact on the
|
wenzelm@37351
|
2645 |
user space functionality any longer.
|
wenzelm@37351
|
2646 |
|
wenzelm@37351
|
2647 |
* Methods "unfold_locales" and "intro_locales" ignore non-locale
|
wenzelm@37351
|
2648 |
subgoals. This is more appropriate for interpretations with 'where'.
|
wenzelm@37351
|
2649 |
INCOMPATIBILITY.
|
wenzelm@37351
|
2650 |
|
wenzelm@36366
|
2651 |
* Command 'example_proof' opens an empty proof body. This allows to
|
wenzelm@36366
|
2652 |
experiment with Isar, without producing any persistent result.
|
wenzelm@36366
|
2653 |
|
wenzelm@35418
|
2654 |
* Commands 'type_notation' and 'no_type_notation' declare type syntax
|
wenzelm@35418
|
2655 |
within a local theory context, with explicit checking of the
|
wenzelm@35418
|
2656 |
constructors involved (in contrast to the raw 'syntax' versions).
|
wenzelm@35418
|
2657 |
|
wenzelm@36178
|
2658 |
* Commands 'types' and 'typedecl' now work within a local theory
|
wenzelm@36178
|
2659 |
context -- without introducing dependencies on parameters or
|
wenzelm@36178
|
2660 |
assumptions, which is not possible in Isabelle/Pure.
|
wenzelm@35681
|
2661 |
|
wenzelm@36857
|
2662 |
* Command 'defaultsort' has been renamed to 'default_sort', it works
|
wenzelm@36857
|
2663 |
within a local theory context. Minor INCOMPATIBILITY.
|
wenzelm@36454
|
2664 |
|
haftmann@34157
|
2665 |
|
haftmann@33990
|
2666 |
*** HOL ***
|
haftmann@33990
|
2667 |
|
wenzelm@37351
|
2668 |
* Command 'typedef' now works within a local theory context -- without
|
wenzelm@37351
|
2669 |
introducing dependencies on parameters or assumptions, which is not
|
wenzelm@37351
|
2670 |
possible in Isabelle/Pure/HOL. Note that the logical environment may
|
wenzelm@37351
|
2671 |
contain multiple interpretations of local typedefs (with different
|
wenzelm@37351
|
2672 |
non-emptiness proofs), even in a global theory context.
|
wenzelm@37351
|
2673 |
|
wenzelm@37351
|
2674 |
* New package for quotient types. Commands 'quotient_type' and
|
wenzelm@37351
|
2675 |
'quotient_definition' may be used for defining types and constants by
|
wenzelm@37351
|
2676 |
quotient constructions. An example is the type of integers created by
|
wenzelm@37351
|
2677 |
quotienting pairs of natural numbers:
|
wenzelm@37481
|
2678 |
|
wenzelm@37351
|
2679 |
fun
|
wenzelm@37481
|
2680 |
intrel :: "(nat * nat) => (nat * nat) => bool"
|
wenzelm@37351
|
2681 |
where
|
wenzelm@37351
|
2682 |
"intrel (x, y) (u, v) = (x + v = u + y)"
|
wenzelm@37351
|
2683 |
|
wenzelm@37481
|
2684 |
quotient_type int = "nat * nat" / intrel
|
wenzelm@37351
|
2685 |
by (auto simp add: equivp_def expand_fun_eq)
|
wenzelm@37481
|
2686 |
|
wenzelm@37351
|
2687 |
quotient_definition
|
wenzelm@37351
|
2688 |
"0::int" is "(0::nat, 0::nat)"
|
wenzelm@37351
|
2689 |
|
wenzelm@37351
|
2690 |
The method "lifting" can be used to lift of theorems from the
|
wenzelm@37351
|
2691 |
underlying "raw" type to the quotient type. The example
|
wenzelm@37351
|
2692 |
src/HOL/Quotient_Examples/FSet.thy includes such a quotient
|
wenzelm@37351
|
2693 |
construction and provides a reasoning infrastructure for finite sets.
|
wenzelm@37351
|
2694 |
|
wenzelm@37351
|
2695 |
* Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
|
wenzelm@37351
|
2696 |
clash with new theory Quotient in Main HOL.
|
wenzelm@37351
|
2697 |
|
wenzelm@37351
|
2698 |
* Moved the SMT binding into the main HOL session, eliminating
|
wenzelm@37351
|
2699 |
separate HOL-SMT session.
|
wenzelm@37351
|
2700 |
|
haftmann@37012
|
2701 |
* List membership infix mem operation is only an input abbreviation.
|
haftmann@37012
|
2702 |
INCOMPATIBILITY.
|
haftmann@37012
|
2703 |
|
wenzelm@37144
|
2704 |
* Theory Library/Word.thy has been removed. Use library Word/Word.thy
|
wenzelm@37144
|
2705 |
for future developements; former Library/Word.thy is still present in
|
wenzelm@37144
|
2706 |
the AFP entry RSAPPS.
|
haftmann@36956
|
2707 |
|
wenzelm@36857
|
2708 |
* Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
|
wenzelm@36857
|
2709 |
longer shadowed. INCOMPATIBILITY.
|
haftmann@36802
|
2710 |
|
huffman@36831
|
2711 |
* Dropped theorem duplicate comp_arith; use semiring_norm instead.
|
huffman@36831
|
2712 |
INCOMPATIBILITY.
|
huffman@36831
|
2713 |
|
huffman@36831
|
2714 |
* Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
|
huffman@36831
|
2715 |
INCOMPATIBILITY.
|
haftmann@36699
|
2716 |
|
wenzelm@36857
|
2717 |
* Dropped normalizing_semiring etc; use the facts in semiring classes
|
wenzelm@36857
|
2718 |
instead. INCOMPATIBILITY.
|
wenzelm@36857
|
2719 |
|
huffman@36979
|
2720 |
* Dropped several real-specific versions of lemmas about floor and
|
wenzelm@37351
|
2721 |
ceiling; use the generic lemmas from theory "Archimedean_Field"
|
wenzelm@37351
|
2722 |
instead. INCOMPATIBILITY.
|
huffman@36979
|
2723 |
|
huffman@36979
|
2724 |
floor_number_of_eq ~> floor_number_of
|
huffman@36979
|
2725 |
le_floor_eq_number_of ~> number_of_le_floor
|
huffman@36979
|
2726 |
le_floor_eq_zero ~> zero_le_floor
|
huffman@36979
|
2727 |
le_floor_eq_one ~> one_le_floor
|
huffman@36979
|
2728 |
floor_less_eq_number_of ~> floor_less_number_of
|
huffman@36979
|
2729 |
floor_less_eq_zero ~> floor_less_zero
|
huffman@36979
|
2730 |
floor_less_eq_one ~> floor_less_one
|
huffman@36979
|
2731 |
less_floor_eq_number_of ~> number_of_less_floor
|
huffman@36979
|
2732 |
less_floor_eq_zero ~> zero_less_floor
|
huffman@36979
|
2733 |
less_floor_eq_one ~> one_less_floor
|
huffman@36979
|
2734 |
floor_le_eq_number_of ~> floor_le_number_of
|
huffman@36979
|
2735 |
floor_le_eq_zero ~> floor_le_zero
|
huffman@36979
|
2736 |
floor_le_eq_one ~> floor_le_one
|
huffman@36979
|
2737 |
floor_subtract_number_of ~> floor_diff_number_of
|
huffman@36979
|
2738 |
floor_subtract_one ~> floor_diff_one
|
huffman@36979
|
2739 |
ceiling_number_of_eq ~> ceiling_number_of
|
huffman@36979
|
2740 |
ceiling_le_eq_number_of ~> ceiling_le_number_of
|
huffman@36979
|
2741 |
ceiling_le_zero_eq ~> ceiling_le_zero
|
huffman@36979
|
2742 |
ceiling_le_eq_one ~> ceiling_le_one
|
huffman@36979
|
2743 |
less_ceiling_eq_number_of ~> number_of_less_ceiling
|
huffman@36979
|
2744 |
less_ceiling_eq_zero ~> zero_less_ceiling
|
huffman@36979
|
2745 |
less_ceiling_eq_one ~> one_less_ceiling
|
huffman@36979
|
2746 |
ceiling_less_eq_number_of ~> ceiling_less_number_of
|
huffman@36979
|
2747 |
ceiling_less_eq_zero ~> ceiling_less_zero
|
huffman@36979
|
2748 |
ceiling_less_eq_one ~> ceiling_less_one
|
huffman@36979
|
2749 |
le_ceiling_eq_number_of ~> number_of_le_ceiling
|
huffman@36979
|
2750 |
le_ceiling_eq_zero ~> zero_le_ceiling
|
huffman@36979
|
2751 |
le_ceiling_eq_one ~> one_le_ceiling
|
huffman@36979
|
2752 |
ceiling_subtract_number_of ~> ceiling_diff_number_of
|
huffman@36979
|
2753 |
ceiling_subtract_one ~> ceiling_diff_one
|
huffman@36979
|
2754 |
|
wenzelm@37144
|
2755 |
* Theory "Finite_Set": various folding_XXX locales facilitate the
|
wenzelm@36857
|
2756 |
application of the various fold combinators on finite sets.
|
wenzelm@36857
|
2757 |
|
wenzelm@36857
|
2758 |
* Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
|
wenzelm@36857
|
2759 |
provides abstract red-black tree type which is backed by "RBT_Impl" as
|
wenzelm@36857
|
2760 |
implementation. INCOMPATIBILTY.
|
haftmann@36147
|
2761 |
|
huffman@36825
|
2762 |
* Theory Library/Coinductive_List has been removed -- superseded by
|
wenzelm@35763
|
2763 |
AFP/thys/Coinductive.
|
wenzelm@35763
|
2764 |
|
huffman@36824
|
2765 |
* Theory PReal, including the type "preal" and related operations, has
|
huffman@36824
|
2766 |
been removed. INCOMPATIBILITY.
|
huffman@36824
|
2767 |
|
wenzelm@37481
|
2768 |
* Real: new development using Cauchy Sequences.
|
wenzelm@37481
|
2769 |
|
wenzelm@37351
|
2770 |
* Split off theory "Big_Operators" containing setsum, setprod,
|
wenzelm@37351
|
2771 |
Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
|
wenzelm@36857
|
2772 |
|
wenzelm@36857
|
2773 |
* Theory "Rational" renamed to "Rat", for consistency with "Nat",
|
wenzelm@36857
|
2774 |
"Int" etc. INCOMPATIBILITY.
|
wenzelm@36857
|
2775 |
|
wenzelm@37351
|
2776 |
* Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
|
wenzelm@37143
|
2777 |
|
wenzelm@36857
|
2778 |
* New set of rules "ac_simps" provides combined assoc / commute
|
wenzelm@36857
|
2779 |
rewrites for all interpretations of the appropriate generic locales.
|
wenzelm@36857
|
2780 |
|
wenzelm@36857
|
2781 |
* Renamed theory "OrderedGroup" to "Groups" and split theory
|
wenzelm@36857
|
2782 |
"Ring_and_Field" into theories "Rings" and "Fields"; for more
|
wenzelm@36857
|
2783 |
appropriate and more consistent names suitable for name prefixes
|
wenzelm@36857
|
2784 |
within the HOL theories. INCOMPATIBILITY.
|
wenzelm@36857
|
2785 |
|
wenzelm@36857
|
2786 |
* Some generic constants have been put to appropriate theories:
|
wenzelm@36857
|
2787 |
- less_eq, less: Orderings
|
wenzelm@36857
|
2788 |
- zero, one, plus, minus, uminus, times, abs, sgn: Groups
|
wenzelm@36857
|
2789 |
- inverse, divide: Rings
|
haftmann@35372
|
2790 |
INCOMPATIBILITY.
|
haftmann@35372
|
2791 |
|
wenzelm@36857
|
2792 |
* More consistent naming of type classes involving orderings (and
|
wenzelm@36857
|
2793 |
lattices):
|
haftmann@35027
|
2794 |
|
haftmann@35027
|
2795 |
lower_semilattice ~> semilattice_inf
|
haftmann@35027
|
2796 |
upper_semilattice ~> semilattice_sup
|
haftmann@35027
|
2797 |
|
haftmann@35027
|
2798 |
dense_linear_order ~> dense_linorder
|
haftmann@35027
|
2799 |
|
haftmann@35027
|
2800 |
pordered_ab_group_add ~> ordered_ab_group_add
|
haftmann@35027
|
2801 |
pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
|
haftmann@35027
|
2802 |
pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
|
haftmann@35027
|
2803 |
pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
|
haftmann@35027
|
2804 |
pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
|
haftmann@35027
|
2805 |
pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
|
haftmann@35027
|
2806 |
pordered_cancel_semiring ~> ordered_cancel_semiring
|
haftmann@35027
|
2807 |
pordered_comm_monoid_add ~> ordered_comm_monoid_add
|
haftmann@35027
|
2808 |
pordered_comm_ring ~> ordered_comm_ring
|
haftmann@35027
|
2809 |
pordered_comm_semiring ~> ordered_comm_semiring
|
haftmann@35027
|
2810 |
pordered_ring ~> ordered_ring
|
haftmann@35027
|
2811 |
pordered_ring_abs ~> ordered_ring_abs
|
haftmann@35027
|
2812 |
pordered_semiring ~> ordered_semiring
|
haftmann@35027
|
2813 |
|
haftmann@35027
|
2814 |
ordered_ab_group_add ~> linordered_ab_group_add
|
haftmann@35027
|
2815 |
ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
|
haftmann@35027
|
2816 |
ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
|
haftmann@35027
|
2817 |
ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
|
haftmann@35027
|
2818 |
ordered_field ~> linordered_field
|
haftmann@35027
|
2819 |
ordered_field_no_lb ~> linordered_field_no_lb
|
haftmann@35027
|
2820 |
ordered_field_no_ub ~> linordered_field_no_ub
|
haftmann@35027
|
2821 |
ordered_field_dense_linear_order ~> dense_linordered_field
|
haftmann@35027
|
2822 |
ordered_idom ~> linordered_idom
|
haftmann@35027
|
2823 |
ordered_ring ~> linordered_ring
|
haftmann@35027
|
2824 |
ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
|
haftmann@35027
|
2825 |
ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
|
haftmann@35027
|
2826 |
ordered_ring_strict ~> linordered_ring_strict
|
haftmann@35027
|
2827 |
ordered_semidom ~> linordered_semidom
|
haftmann@35027
|
2828 |
ordered_semiring ~> linordered_semiring
|
haftmann@35027
|
2829 |
ordered_semiring_1 ~> linordered_semiring_1
|
haftmann@35027
|
2830 |
ordered_semiring_1_strict ~> linordered_semiring_1_strict
|
haftmann@35027
|
2831 |
ordered_semiring_strict ~> linordered_semiring_strict
|
haftmann@35027
|
2832 |
|
wenzelm@36857
|
2833 |
The following slightly odd type classes have been moved to a
|
wenzelm@37351
|
2834 |
separate theory Library/Lattice_Algebras:
|
haftmann@35032
|
2835 |
|
haftmann@35032
|
2836 |
lordered_ab_group_add ~> lattice_ab_group_add
|
haftmann@35032
|
2837 |
lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
|
haftmann@35032
|
2838 |
lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
|
haftmann@35032
|
2839 |
lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
|
haftmann@35032
|
2840 |
lordered_ring ~> lattice_ring
|
haftmann@35032
|
2841 |
|
haftmann@35027
|
2842 |
INCOMPATIBILITY.
|
haftmann@35027
|
2843 |
|
haftmann@36416
|
2844 |
* Refined field classes:
|
wenzelm@36857
|
2845 |
- classes division_ring_inverse_zero, field_inverse_zero,
|
wenzelm@36857
|
2846 |
linordered_field_inverse_zero include rule inverse 0 = 0 --
|
wenzelm@36857
|
2847 |
subsumes former division_by_zero class;
|
wenzelm@36857
|
2848 |
- numerous lemmas have been ported from field to division_ring.
|
wenzelm@36857
|
2849 |
INCOMPATIBILITY.
|
haftmann@36416
|
2850 |
|
haftmann@36416
|
2851 |
* Refined algebra theorem collections:
|
wenzelm@36857
|
2852 |
- dropped theorem group group_simps, use algebra_simps instead;
|
wenzelm@36857
|
2853 |
- dropped theorem group ring_simps, use field_simps instead;
|
wenzelm@36857
|
2854 |
- proper theorem collection field_simps subsumes former theorem
|
wenzelm@36857
|
2855 |
groups field_eq_simps and field_simps;
|
wenzelm@36857
|
2856 |
- dropped lemma eq_minus_self_iff which is a duplicate for
|
wenzelm@36857
|
2857 |
equal_neg_zero.
|
wenzelm@36857
|
2858 |
INCOMPATIBILITY.
|
wenzelm@35009
|
2859 |
|
wenzelm@35009
|
2860 |
* Theory Finite_Set and List: some lemmas have been generalized from
|
wenzelm@34076
|
2861 |
sets to lattices:
|
wenzelm@34076
|
2862 |
|
haftmann@33998
|
2863 |
fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
|
haftmann@33998
|
2864 |
fun_left_comm_idem_union ~> fun_left_comm_idem_sup
|
haftmann@33998
|
2865 |
inter_Inter_fold_inter ~> inf_Inf_fold_inf
|
haftmann@33998
|
2866 |
union_Union_fold_union ~> sup_Sup_fold_sup
|
haftmann@33998
|
2867 |
Inter_fold_inter ~> Inf_fold_inf
|
haftmann@33998
|
2868 |
Union_fold_union ~> Sup_fold_sup
|
haftmann@33998
|
2869 |
inter_INTER_fold_inter ~> inf_INFI_fold_inf
|
haftmann@33998
|
2870 |
union_UNION_fold_union ~> sup_SUPR_fold_sup
|
haftmann@33998
|
2871 |
INTER_fold_inter ~> INFI_fold_inf
|
haftmann@33998
|
2872 |
UNION_fold_union ~> SUPR_fold_sup
|
haftmann@33998
|
2873 |
|
wenzelm@45844
|
2874 |
* Theory "Complete_Lattice": lemmas top_def and bot_def have been
|
wenzelm@45844
|
2875 |
replaced by the more convenient lemmas Inf_empty and Sup_empty.
|
wenzelm@45844
|
2876 |
Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
|
wenzelm@45844
|
2877 |
by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
|
wenzelm@45844
|
2878 |
former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
|
wenzelm@45844
|
2879 |
subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
|
haftmann@36416
|
2880 |
|
wenzelm@36857
|
2881 |
* Reorganized theory Multiset: swapped notation of pointwise and
|
wenzelm@36857
|
2882 |
multiset order:
|
wenzelm@37351
|
2883 |
|
wenzelm@36857
|
2884 |
- pointwise ordering is instance of class order with standard syntax
|
wenzelm@36857
|
2885 |
<= and <;
|
wenzelm@36857
|
2886 |
- multiset ordering has syntax <=# and <#; partial order properties
|
wenzelm@36857
|
2887 |
are provided by means of interpretation with prefix
|
wenzelm@36857
|
2888 |
multiset_order;
|
wenzelm@36857
|
2889 |
- less duplication, less historical organization of sections,
|
wenzelm@36857
|
2890 |
conversion from associations lists to multisets, rudimentary code
|
wenzelm@36857
|
2891 |
generation;
|
wenzelm@36857
|
2892 |
- use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
|
wenzelm@36857
|
2893 |
if needed.
|
wenzelm@37351
|
2894 |
|
nipkow@36895
|
2895 |
Renamed:
|
wenzelm@37351
|
2896 |
|
wenzelm@37351
|
2897 |
multiset_eq_conv_count_eq ~> multiset_ext_iff
|
wenzelm@37351
|
2898 |
multi_count_ext ~> multiset_ext
|
wenzelm@37351
|
2899 |
diff_union_inverse2 ~> diff_union_cancelR
|
wenzelm@37351
|
2900 |
|
wenzelm@36857
|
2901 |
INCOMPATIBILITY.
|
haftmann@36416
|
2902 |
|
nipkow@36895
|
2903 |
* Theory Permutation: replaced local "remove" by List.remove1.
|
nipkow@36895
|
2904 |
|
haftmann@36416
|
2905 |
* Code generation: ML and OCaml code is decorated with signatures.
|
haftmann@36416
|
2906 |
|
wenzelm@35009
|
2907 |
* Theory List: added transpose.
|
wenzelm@35009
|
2908 |
|
huffman@35810
|
2909 |
* Library/Nat_Bijection.thy is a collection of bijective functions
|
huffman@35810
|
2910 |
between nat and other types, which supersedes the older libraries
|
huffman@35810
|
2911 |
Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
|
huffman@35810
|
2912 |
|
huffman@35810
|
2913 |
Constants:
|
huffman@35810
|
2914 |
Nat_Int_Bij.nat2_to_nat ~> prod_encode
|
huffman@35810
|
2915 |
Nat_Int_Bij.nat_to_nat2 ~> prod_decode
|
huffman@35810
|
2916 |
Nat_Int_Bij.int_to_nat_bij ~> int_encode
|
huffman@35810
|
2917 |
Nat_Int_Bij.nat_to_int_bij ~> int_decode
|
huffman@35810
|
2918 |
Countable.pair_encode ~> prod_encode
|
huffman@35810
|
2919 |
NatIso.prod2nat ~> prod_encode
|
huffman@35810
|
2920 |
NatIso.nat2prod ~> prod_decode
|
huffman@35810
|
2921 |
NatIso.sum2nat ~> sum_encode
|
huffman@35810
|
2922 |
NatIso.nat2sum ~> sum_decode
|
huffman@35810
|
2923 |
NatIso.list2nat ~> list_encode
|
huffman@35810
|
2924 |
NatIso.nat2list ~> list_decode
|
huffman@35810
|
2925 |
NatIso.set2nat ~> set_encode
|
huffman@35810
|
2926 |
NatIso.nat2set ~> set_decode
|
huffman@35810
|
2927 |
|
huffman@35810
|
2928 |
Lemmas:
|
huffman@35810
|
2929 |
Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
|
huffman@35810
|
2930 |
Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
|
huffman@35810
|
2931 |
Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
|
huffman@35810
|
2932 |
Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
|
huffman@35810
|
2933 |
Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
|
huffman@35810
|
2934 |
Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
|
huffman@35810
|
2935 |
Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
|
huffman@35810
|
2936 |
Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
|
huffman@35810
|
2937 |
Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
|
huffman@35810
|
2938 |
Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
|
huffman@35810
|
2939 |
Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
|
huffman@35810
|
2940 |
Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
|
huffman@35810
|
2941 |
Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
|
huffman@35810
|
2942 |
|
blanchet@36921
|
2943 |
* Sledgehammer:
|
blanchet@36921
|
2944 |
- Renamed ATP commands:
|
blanchet@36921
|
2945 |
atp_info ~> sledgehammer running_atps
|
blanchet@36921
|
2946 |
atp_kill ~> sledgehammer kill_atps
|
blanchet@36921
|
2947 |
atp_messages ~> sledgehammer messages
|
blanchet@36921
|
2948 |
atp_minimize ~> sledgehammer minimize
|
blanchet@36921
|
2949 |
print_atps ~> sledgehammer available_atps
|
blanchet@36921
|
2950 |
INCOMPATIBILITY.
|
blanchet@36921
|
2951 |
- Added user's manual ("isabelle doc sledgehammer").
|
blanchet@36921
|
2952 |
- Added option syntax and "sledgehammer_params" to customize
|
blanchet@36921
|
2953 |
Sledgehammer's behavior. See the manual for details.
|
blanchet@36921
|
2954 |
- Modified the Isar proof reconstruction code so that it produces
|
blanchet@36921
|
2955 |
direct proofs rather than proofs by contradiction. (This feature
|
blanchet@36921
|
2956 |
is still experimental.)
|
blanchet@36921
|
2957 |
- Made Isar proof reconstruction work for SPASS, remote ATPs, and in
|
blanchet@36921
|
2958 |
full-typed mode.
|
blanchet@36921
|
2959 |
- Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
|
blanchet@36921
|
2960 |
|
blanchet@36920
|
2961 |
* Nitpick:
|
blanchet@36920
|
2962 |
- Added and implemented "binary_ints" and "bits" options.
|
blanchet@36920
|
2963 |
- Added "std" option and implemented support for nonstandard models.
|
blanchet@36920
|
2964 |
- Added and implemented "finitize" option to improve the precision
|
blanchet@36920
|
2965 |
of infinite datatypes based on a monotonicity analysis.
|
blanchet@36920
|
2966 |
- Added support for quotient types.
|
blanchet@36920
|
2967 |
- Added support for "specification" and "ax_specification"
|
blanchet@36920
|
2968 |
constructs.
|
blanchet@36920
|
2969 |
- Added support for local definitions (for "function" and
|
blanchet@36920
|
2970 |
"termination" proofs).
|
blanchet@36920
|
2971 |
- Added support for term postprocessors.
|
blanchet@36920
|
2972 |
- Optimized "Multiset.multiset" and "FinFun.finfun".
|
blanchet@36920
|
2973 |
- Improved efficiency of "destroy_constrs" optimization.
|
blanchet@36920
|
2974 |
- Fixed soundness bugs related to "destroy_constrs" optimization and
|
blanchet@36920
|
2975 |
record getters.
|
blanchet@37271
|
2976 |
- Fixed soundness bug related to higher-order constructors.
|
blanchet@37271
|
2977 |
- Fixed soundness bug when "full_descrs" is enabled.
|
blanchet@36920
|
2978 |
- Improved precision of set constructs.
|
blanchet@37259
|
2979 |
- Added "atoms" option.
|
blanchet@36920
|
2980 |
- Added cache to speed up repeated Kodkod invocations on the same
|
blanchet@36920
|
2981 |
problems.
|
blanchet@36920
|
2982 |
- Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
|
blanchet@36920
|
2983 |
"SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
|
blanchet@36920
|
2984 |
"SAT4J_Light". INCOMPATIBILITY.
|
blanchet@36920
|
2985 |
- Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
|
blanchet@36920
|
2986 |
"sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
|
blanchet@37263
|
2987 |
- Removed "nitpick_intro" attribute. INCOMPATIBILITY.
|
blanchet@36920
|
2988 |
|
berghofe@37462
|
2989 |
* Method "induct" now takes instantiations of the form t, where t is not
|
berghofe@37462
|
2990 |
a variable, as a shorthand for "x == t", where x is a fresh variable.
|
berghofe@37462
|
2991 |
If this is not intended, t has to be enclosed in parentheses.
|
berghofe@37462
|
2992 |
By default, the equalities generated by definitional instantiations
|
berghofe@37462
|
2993 |
are pre-simplified, which may cause parameters of inductive cases
|
berghofe@37462
|
2994 |
to disappear, or may even delete some of the inductive cases.
|
berghofe@37462
|
2995 |
Use "induct (no_simp)" instead of "induct" to restore the old
|
berghofe@37462
|
2996 |
behaviour. The (no_simp) option is also understood by the "cases"
|
berghofe@37462
|
2997 |
and "nominal_induct" methods, which now perform pre-simplification, too.
|
berghofe@37462
|
2998 |
INCOMPATIBILITY.
|
berghofe@37462
|
2999 |
|
haftmann@33990
|
3000 |
|
huffman@36823
|
3001 |
*** HOLCF ***
|
huffman@36823
|
3002 |
|
huffman@36823
|
3003 |
* Variable names in lemmas generated by the domain package have
|
huffman@36823
|
3004 |
changed; the naming scheme is now consistent with the HOL datatype
|
huffman@36823
|
3005 |
package. Some proof scripts may be affected, INCOMPATIBILITY.
|
huffman@36823
|
3006 |
|
huffman@36823
|
3007 |
* The domain package no longer defines the function "foo_copy" for
|
huffman@36823
|
3008 |
recursive domain "foo". The reach lemma is now stated directly in
|
huffman@36823
|
3009 |
terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
|
huffman@36823
|
3010 |
be reformulated in terms of "foo_take", INCOMPATIBILITY.
|
huffman@36823
|
3011 |
|
huffman@36823
|
3012 |
* Most definedness lemmas generated by the domain package (previously
|
huffman@36823
|
3013 |
of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
|
huffman@36823
|
3014 |
like "foo$x = UU <-> x = UU", which works better as a simp rule.
|
wenzelm@37351
|
3015 |
Proofs that used definedness lemmas as intro rules may break,
|
huffman@36823
|
3016 |
potential INCOMPATIBILITY.
|
huffman@36823
|
3017 |
|
huffman@36823
|
3018 |
* Induction and casedist rules generated by the domain package now
|
huffman@36823
|
3019 |
declare proper case_names (one called "bottom", and one named for each
|
huffman@36823
|
3020 |
constructor). INCOMPATIBILITY.
|
huffman@36823
|
3021 |
|
huffman@36823
|
3022 |
* For mutually-recursive domains, separate "reach" and "take_lemma"
|
huffman@36823
|
3023 |
rules are generated for each domain, INCOMPATIBILITY.
|
huffman@36823
|
3024 |
|
huffman@36823
|
3025 |
foo_bar.reach ~> foo.reach bar.reach
|
huffman@36823
|
3026 |
foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
|
huffman@36823
|
3027 |
|
huffman@36823
|
3028 |
* Some lemmas generated by the domain package have been renamed for
|
huffman@36823
|
3029 |
consistency with the datatype package, INCOMPATIBILITY.
|
huffman@36823
|
3030 |
|
huffman@36823
|
3031 |
foo.ind ~> foo.induct
|
huffman@36823
|
3032 |
foo.finite_ind ~> foo.finite_induct
|
huffman@36823
|
3033 |
foo.coind ~> foo.coinduct
|
huffman@36823
|
3034 |
foo.casedist ~> foo.exhaust
|
huffman@36823
|
3035 |
foo.exhaust ~> foo.nchotomy
|
huffman@36823
|
3036 |
|
huffman@36823
|
3037 |
* For consistency with other definition packages, the fixrec package
|
huffman@36823
|
3038 |
now generates qualified theorem names, INCOMPATIBILITY.
|
huffman@36823
|
3039 |
|
huffman@36823
|
3040 |
foo_simps ~> foo.simps
|
huffman@36823
|
3041 |
foo_unfold ~> foo.unfold
|
huffman@36823
|
3042 |
foo_induct ~> foo.induct
|
huffman@36823
|
3043 |
|
huffman@37071
|
3044 |
* The "fixrec_simp" attribute has been removed. The "fixrec_simp"
|
huffman@37071
|
3045 |
method and internal fixrec proofs now use the default simpset instead.
|
huffman@37071
|
3046 |
INCOMPATIBILITY.
|
huffman@37071
|
3047 |
|
huffman@36823
|
3048 |
* The "contlub" predicate has been removed. Proof scripts should use
|
huffman@36823
|
3049 |
lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
|
huffman@36823
|
3050 |
|
huffman@36823
|
3051 |
* The "admw" predicate has been removed, INCOMPATIBILITY.
|
huffman@36823
|
3052 |
|
huffman@36823
|
3053 |
* The constants cpair, cfst, and csnd have been removed in favor of
|
huffman@36823
|
3054 |
Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
|
huffman@36823
|
3055 |
|
huffman@36823
|
3056 |
|
haftmann@33990
|
3057 |
*** ML ***
|
haftmann@33990
|
3058 |
|
wenzelm@37351
|
3059 |
* Antiquotations for basic formal entities:
|
wenzelm@37351
|
3060 |
|
wenzelm@37351
|
3061 |
@{class NAME} -- type class
|
wenzelm@37351
|
3062 |
@{class_syntax NAME} -- syntax representation of the above
|
wenzelm@37351
|
3063 |
|
wenzelm@37351
|
3064 |
@{type_name NAME} -- logical type
|
wenzelm@37351
|
3065 |
@{type_abbrev NAME} -- type abbreviation
|
wenzelm@37351
|
3066 |
@{nonterminal NAME} -- type of concrete syntactic category
|
wenzelm@37351
|
3067 |
@{type_syntax NAME} -- syntax representation of any of the above
|
wenzelm@37351
|
3068 |
|
wenzelm@37351
|
3069 |
@{const_name NAME} -- logical constant (INCOMPATIBILITY)
|
wenzelm@37351
|
3070 |
@{const_abbrev NAME} -- abbreviated constant
|
wenzelm@37351
|
3071 |
@{const_syntax NAME} -- syntax representation of any of the above
|
wenzelm@37351
|
3072 |
|
wenzelm@37351
|
3073 |
* Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
|
wenzelm@37351
|
3074 |
syntax constant (cf. 'syntax' command).
|
wenzelm@37351
|
3075 |
|
wenzelm@37351
|
3076 |
* Antiquotation @{make_string} inlines a function to print arbitrary
|
wenzelm@37351
|
3077 |
values similar to the ML toplevel. The result is compiler dependent
|
wenzelm@37351
|
3078 |
and may fall back on "?" in certain situations.
|
wenzelm@37351
|
3079 |
|
wenzelm@37351
|
3080 |
* Diagnostic commands 'ML_val' and 'ML_command' may refer to
|
wenzelm@37351
|
3081 |
antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
|
wenzelm@37351
|
3082 |
Isar.state() and Isar.goal(), which belong to the old TTY loop and do
|
wenzelm@37351
|
3083 |
not work with the asynchronous Isar document model.
|
wenzelm@37351
|
3084 |
|
wenzelm@37351
|
3085 |
* Configuration options now admit dynamic default values, depending on
|
wenzelm@37351
|
3086 |
the context or even global references.
|
wenzelm@37351
|
3087 |
|
wenzelm@37351
|
3088 |
* SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
|
wenzelm@37351
|
3089 |
uses an efficient external library if available (for Poly/ML).
|
wenzelm@37351
|
3090 |
|
wenzelm@37144
|
3091 |
* Renamed some important ML structures, while keeping the old names
|
wenzelm@37144
|
3092 |
for some time as aliases within the structure Legacy:
|
wenzelm@37144
|
3093 |
|
wenzelm@37144
|
3094 |
OuterKeyword ~> Keyword
|
wenzelm@37144
|
3095 |
OuterLex ~> Token
|
wenzelm@37144
|
3096 |
OuterParse ~> Parse
|
wenzelm@37144
|
3097 |
OuterSyntax ~> Outer_Syntax
|
wenzelm@37216
|
3098 |
PrintMode ~> Print_Mode
|
wenzelm@37144
|
3099 |
SpecParse ~> Parse_Spec
|
wenzelm@37216
|
3100 |
ThyInfo ~> Thy_Info
|
wenzelm@37216
|
3101 |
ThyLoad ~> Thy_Load
|
wenzelm@37216
|
3102 |
ThyOutput ~> Thy_Output
|
wenzelm@37153
|
3103 |
TypeInfer ~> Type_Infer
|
wenzelm@37144
|
3104 |
|
wenzelm@37144
|
3105 |
Note that "open Legacy" simplifies porting of sources, but forgetting
|
wenzelm@37144
|
3106 |
to remove it again will complicate porting again in the future.
|
wenzelm@37144
|
3107 |
|
wenzelm@37144
|
3108 |
* Most operations that refer to a global context are named
|
wenzelm@37144
|
3109 |
accordingly, e.g. Simplifier.global_context or
|
wenzelm@37144
|
3110 |
ProofContext.init_global. There are some situations where a global
|
wenzelm@37144
|
3111 |
context actually works, but under normal circumstances one needs to
|
wenzelm@37144
|
3112 |
pass the proper local context through the code!
|
wenzelm@37144
|
3113 |
|
wenzelm@37144
|
3114 |
* Discontinued old TheoryDataFun with its copy/init operation -- data
|
wenzelm@37144
|
3115 |
needs to be pure. Functor Theory_Data_PP retains the traditional
|
wenzelm@37144
|
3116 |
Pretty.pp argument to merge, which is absent in the standard
|
wenzelm@37144
|
3117 |
Theory_Data version.
|
wenzelm@37144
|
3118 |
|
wenzelm@36443
|
3119 |
* Sorts.certify_sort and derived "cert" operations for types and terms
|
wenzelm@36443
|
3120 |
no longer minimize sorts. Thus certification at the boundary of the
|
wenzelm@36443
|
3121 |
inference kernel becomes invariant under addition of class relations,
|
wenzelm@36443
|
3122 |
which is an important monotonicity principle. Sorts are now minimized
|
wenzelm@36443
|
3123 |
in the syntax layer only, at the boundary between the end-user and the
|
wenzelm@36443
|
3124 |
system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
|
wenzelm@36443
|
3125 |
explicitly in rare situations.
|
wenzelm@36443
|
3126 |
|
wenzelm@35021
|
3127 |
* Renamed old-style Drule.standard to Drule.export_without_context, to
|
wenzelm@35021
|
3128 |
emphasize that this is in no way a standard operation.
|
wenzelm@35021
|
3129 |
INCOMPATIBILITY.
|
wenzelm@35021
|
3130 |
|
wenzelm@34076
|
3131 |
* Subgoal.FOCUS (and variants): resulting goal state is normalized as
|
wenzelm@34076
|
3132 |
usual for resolution. Rare INCOMPATIBILITY.
|
wenzelm@34076
|
3133 |
|
wenzelm@35845
|
3134 |
* Renamed varify/unvarify operations to varify_global/unvarify_global
|
wenzelm@35845
|
3135 |
to emphasize that these only work in a global situation (which is
|
wenzelm@35845
|
3136 |
quite rare).
|
wenzelm@35845
|
3137 |
|
wenzelm@37144
|
3138 |
* Curried take and drop in library.ML; negative length is interpreted
|
wenzelm@37144
|
3139 |
as infinity (as in chop). Subtle INCOMPATIBILITY.
|
wenzelm@36971
|
3140 |
|
wenzelm@37351
|
3141 |
* Proof terms: type substitutions on proof constants now use canonical
|
wenzelm@37351
|
3142 |
order of type variables. INCOMPATIBILITY for tools working with proof
|
wenzelm@37351
|
3143 |
terms.
|
wenzelm@37351
|
3144 |
|
wenzelm@37351
|
3145 |
* Raw axioms/defs may no longer carry sort constraints, and raw defs
|
wenzelm@37351
|
3146 |
may no longer carry premises. User-level specifications are
|
wenzelm@37351
|
3147 |
transformed accordingly by Thm.add_axiom/add_def.
|
wenzelm@37351
|
3148 |
|
haftmann@33990
|
3149 |
|
wenzelm@34238
|
3150 |
*** System ***
|
wenzelm@34238
|
3151 |
|
wenzelm@34238
|
3152 |
* Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
|
wenzelm@34238
|
3153 |
ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
|
wenzelm@34238
|
3154 |
proof terms are enabled unconditionally in the new HOL-Proofs image.
|
wenzelm@34238
|
3155 |
|
wenzelm@34255
|
3156 |
* Discontinued old ISABELLE and ISATOOL environment settings (legacy
|
wenzelm@34255
|
3157 |
feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
|
wenzelm@34255
|
3158 |
respectively.
|
wenzelm@34255
|
3159 |
|
wenzelm@36201
|
3160 |
* Old lib/scripts/polyml-platform is superseded by the
|
wenzelm@36201
|
3161 |
ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
|
wenzelm@36201
|
3162 |
variant, even on a 64 bit machine. The following example setting
|
wenzelm@36201
|
3163 |
prefers 64 bit if available:
|
wenzelm@36201
|
3164 |
|
wenzelm@36201
|
3165 |
ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
|
wenzelm@36201
|
3166 |
|
wenzelm@37218
|
3167 |
* The preliminary Isabelle/jEdit application demonstrates the emerging
|
wenzelm@37218
|
3168 |
Isabelle/Scala layer for advanced prover interaction and integration.
|
wenzelm@37218
|
3169 |
See src/Tools/jEdit or "isabelle jedit" provided by the properly built
|
wenzelm@37218
|
3170 |
component.
|
wenzelm@37218
|
3171 |
|
wenzelm@37473
|
3172 |
* "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
|
wenzelm@37473
|
3173 |
and Bluesky TeX fonts. It provides the usual Isabelle symbols,
|
wenzelm@37473
|
3174 |
similar to the default assignment of the document preparation system
|
wenzelm@37473
|
3175 |
(cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
|
wenzelm@37473
|
3176 |
provides some operations for direct access to the font without asking
|
wenzelm@37473
|
3177 |
the user for manual installation.
|
wenzelm@37473
|
3178 |
|
wenzelm@34238
|
3179 |
|
haftmann@33990
|
3180 |
|
wenzelm@33842
|
3181 |
New in Isabelle2009-1 (December 2009)
|
wenzelm@33842
|
3182 |
-------------------------------------
|
wenzelm@30904
|
3183 |
|
wenzelm@31550
|
3184 |
*** General ***
|
wenzelm@31550
|
3185 |
|
wenzelm@31550
|
3186 |
* Discontinued old form of "escaped symbols" such as \\<forall>. Only
|
wenzelm@31550
|
3187 |
one backslash should be used, even in ML sources.
|
wenzelm@31550
|
3188 |
|
wenzelm@31550
|
3189 |
|
haftmann@30951
|
3190 |
*** Pure ***
|
haftmann@30951
|
3191 |
|
ballarin@32841
|
3192 |
* Locale interpretation propagates mixins along the locale hierarchy.
|
ballarin@32841
|
3193 |
The currently only available mixins are the equations used to map
|
ballarin@32841
|
3194 |
local definitions to terms of the target domain of an interpretation.
|
ballarin@32841
|
3195 |
|
wenzelm@33842
|
3196 |
* Reactivated diagnostic command 'print_interps'. Use "print_interps
|
wenzelm@33842
|
3197 |
loc" to print all interpretations of locale "loc" in the theory.
|
wenzelm@33842
|
3198 |
Interpretations in proofs are not shown.
|
ballarin@32841
|
3199 |
|
ballarin@32983
|
3200 |
* Thoroughly revised locales tutorial. New section on conditional
|
ballarin@32983
|
3201 |
interpretation.
|
ballarin@32983
|
3202 |
|
wenzelm@33843
|
3203 |
* On instantiation of classes, remaining undefined class parameters
|
wenzelm@33843
|
3204 |
are formally declared. INCOMPATIBILITY.
|
wenzelm@33843
|
3205 |
|
haftmann@30951
|
3206 |
|
wenzelm@33842
|
3207 |
*** Document preparation ***
|
wenzelm@33842
|
3208 |
|
wenzelm@33842
|
3209 |
* New generalized style concept for printing terms: @{foo (style) ...}
|
wenzelm@33842
|
3210 |
instead of @{foo_style style ...} (old form is still retained for
|
wenzelm@33842
|
3211 |
backward compatibility). Styles can be also applied for
|
wenzelm@33842
|
3212 |
antiquotations prop, term_type and typeof.
|
haftmann@32891
|
3213 |
|
haftmann@32891
|
3214 |
|
haftmann@30930
|
3215 |
*** HOL ***
|
haftmann@30930
|
3216 |
|
wenzelm@33842
|
3217 |
* New proof method "smt" for a combination of first-order logic with
|
wenzelm@33842
|
3218 |
equality, linear and nonlinear (natural/integer/real) arithmetic, and
|
wenzelm@33842
|
3219 |
fixed-size bitvectors; there is also basic support for higher-order
|
wenzelm@33842
|
3220 |
features (esp. lambda abstractions). It is an incomplete decision
|
wenzelm@33842
|
3221 |
procedure based on external SMT solvers using the oracle mechanism;
|
wenzelm@33842
|
3222 |
for the SMT solver Z3, this method is proof-producing. Certificates
|
wenzelm@33842
|
3223 |
are provided to avoid calling the external solvers solely for
|
wenzelm@33842
|
3224 |
re-checking proofs. Due to a remote SMT service there is no need for
|
wenzelm@33842
|
3225 |
installing SMT solvers locally. See src/HOL/SMT.
|
wenzelm@33842
|
3226 |
|
wenzelm@33842
|
3227 |
* New commands to load and prove verification conditions generated by
|
wenzelm@33842
|
3228 |
the Boogie program verifier or derived systems (e.g. the Verifying C
|
wenzelm@33842
|
3229 |
Compiler (VCC) or Spec#). See src/HOL/Boogie.
|
wenzelm@33842
|
3230 |
|
wenzelm@33842
|
3231 |
* New counterexample generator tool 'nitpick' based on the Kodkod
|
wenzelm@33842
|
3232 |
relational model finder. See src/HOL/Tools/Nitpick and
|
wenzelm@33842
|
3233 |
src/HOL/Nitpick_Examples.
|
wenzelm@33842
|
3234 |
|
haftmann@33860
|
3235 |
* New commands 'code_pred' and 'values' to invoke the predicate
|
haftmann@33860
|
3236 |
compiler and to enumerate values of inductive predicates.
|
haftmann@33860
|
3237 |
|
haftmann@33860
|
3238 |
* A tabled implementation of the reflexive transitive closure.
|
haftmann@33860
|
3239 |
|
haftmann@33860
|
3240 |
* New implementation of quickcheck uses generic code generator;
|
haftmann@33860
|
3241 |
default generators are provided for all suitable HOL types, records
|
haftmann@33860
|
3242 |
and datatypes. Old quickcheck can be re-activated importing theory
|
haftmann@33860
|
3243 |
Library/SML_Quickcheck.
|
haftmann@33860
|
3244 |
|
wenzelm@33843
|
3245 |
* New testing tool Mirabelle for automated proof tools. Applies
|
wenzelm@32427
|
3246 |
several tools and tactics like sledgehammer, metis, or quickcheck, to
|
wenzelm@33842
|
3247 |
every proof step in a theory. To be used in batch mode via the
|
wenzelm@32427
|
3248 |
"mirabelle" utility.
|
wenzelm@32427
|
3249 |
|
wenzelm@32427
|
3250 |
* New proof method "sos" (sum of squares) for nonlinear real
|
wenzelm@33842
|
3251 |
arithmetic (originally due to John Harison). It requires theory
|
wenzelm@32427
|
3252 |
Library/Sum_Of_Squares. It is not a complete decision procedure but
|
wenzelm@32427
|
3253 |
works well in practice on quantifier-free real arithmetic with +, -,
|
wenzelm@32427
|
3254 |
*, ^, =, <= and <, i.e. boolean combinations of equalities and
|
wenzelm@33842
|
3255 |
inequalities between polynomials. It makes use of external
|
wenzelm@33842
|
3256 |
semidefinite programming solvers. Method "sos" generates a
|
wenzelm@33842
|
3257 |
certificate that can be pasted into the proof thus avoiding the need
|
wenzelm@33842
|
3258 |
to call an external tool every time the proof is checked. See
|
wenzelm@33842
|
3259 |
src/HOL/Library/Sum_Of_Squares.
|
wenzelm@32427
|
3260 |
|
wenzelm@33843
|
3261 |
* New method "linarith" invokes existing linear arithmetic decision
|
wenzelm@33843
|
3262 |
procedure only.
|
wenzelm@33843
|
3263 |
|
wenzelm@33843
|
3264 |
* New command 'atp_minimal' reduces result produced by Sledgehammer.
|
wenzelm@33843
|
3265 |
|
wenzelm@33843
|
3266 |
* New Sledgehammer option "Full Types" in Proof General settings menu.
|
wenzelm@33843
|
3267 |
Causes full type information to be output to the ATPs. This slows
|
wenzelm@33843
|
3268 |
ATPs down considerably but eliminates a source of unsound "proofs"
|
wenzelm@33843
|
3269 |
that fail later.
|
wenzelm@33843
|
3270 |
|
wenzelm@33843
|
3271 |
* New method "metisFT": A version of metis that uses full type
|
wenzelm@33843
|
3272 |
information in order to avoid failures of proof reconstruction.
|
wenzelm@33843
|
3273 |
|
wenzelm@33843
|
3274 |
* New evaluator "approximate" approximates an real valued term using
|
wenzelm@33843
|
3275 |
the same method as the approximation method.
|
wenzelm@33843
|
3276 |
|
wenzelm@33843
|
3277 |
* Method "approximate" now supports arithmetic expressions as
|
wenzelm@33843
|
3278 |
boundaries of intervals and implements interval splitting and Taylor
|
wenzelm@33843
|
3279 |
series expansion.
|
wenzelm@33843
|
3280 |
|
wenzelm@33843
|
3281 |
* ML antiquotation @{code_datatype} inserts definition of a datatype
|
wenzelm@33843
|
3282 |
generated by the code generator; e.g. see src/HOL/Predicate.thy.
|
wenzelm@33843
|
3283 |
|
haftmann@33860
|
3284 |
* New theory SupInf of the supremum and infimum operators for sets of
|
haftmann@33860
|
3285 |
reals.
|
haftmann@33860
|
3286 |
|
haftmann@33860
|
3287 |
* New theory Probability, which contains a development of measure
|
haftmann@33860
|
3288 |
theory, eventually leading to Lebesgue integration and probability.
|
haftmann@33860
|
3289 |
|
haftmann@33860
|
3290 |
* Extended Multivariate Analysis to include derivation and Brouwer's
|
haftmann@33860
|
3291 |
fixpoint theorem.
|
wenzelm@33843
|
3292 |
|
wenzelm@33843
|
3293 |
* Reorganization of number theory, INCOMPATIBILITY:
|
wenzelm@33873
|
3294 |
- new number theory development for nat and int, in theories Divides
|
wenzelm@33873
|
3295 |
and GCD as well as in new session Number_Theory
|
wenzelm@33873
|
3296 |
- some constants and facts now suffixed with _nat and _int
|
wenzelm@33873
|
3297 |
accordingly
|
wenzelm@33873
|
3298 |
- former session NumberTheory now named Old_Number_Theory, including
|
wenzelm@33873
|
3299 |
theories Legacy_GCD and Primes (prefer Number_Theory if possible)
|
wenzelm@33843
|
3300 |
- moved theory Pocklington from src/HOL/Library to
|
wenzelm@33843
|
3301 |
src/HOL/Old_Number_Theory
|
wenzelm@33843
|
3302 |
|
wenzelm@33873
|
3303 |
* Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
|
wenzelm@33873
|
3304 |
lcm of finite and infinite sets. It is shown that they form a complete
|
wenzelm@33843
|
3305 |
lattice.
|
wenzelm@33843
|
3306 |
|
wenzelm@33843
|
3307 |
* Class semiring_div requires superclass no_zero_divisors and proof of
|
wenzelm@33843
|
3308 |
div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
|
wenzelm@33843
|
3309 |
div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
|
wenzelm@33843
|
3310 |
generalized to class semiring_div, subsuming former theorems
|
wenzelm@33843
|
3311 |
zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
|
wenzelm@33843
|
3312 |
zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
|
wenzelm@33843
|
3313 |
INCOMPATIBILITY.
|
wenzelm@33843
|
3314 |
|
haftmann@32588
|
3315 |
* Refinements to lattice classes and sets:
|
haftmann@32056
|
3316 |
- less default intro/elim rules in locale variant, more default
|
haftmann@32056
|
3317 |
intro/elim rules in class variant: more uniformity
|
wenzelm@33842
|
3318 |
- lemma ge_sup_conv renamed to le_sup_iff, in accordance with
|
wenzelm@33842
|
3319 |
le_inf_iff
|
wenzelm@33842
|
3320 |
- dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
|
wenzelm@33842
|
3321 |
sup_aci)
|
haftmann@32056
|
3322 |
- renamed ACI to inf_sup_aci
|
haftmann@32600
|
3323 |
- new class "boolean_algebra"
|
wenzelm@33842
|
3324 |
- class "complete_lattice" moved to separate theory
|
haftmann@33860
|
3325 |
"Complete_Lattice"; corresponding constants (and abbreviations)
|
wenzelm@33842
|
3326 |
renamed and with authentic syntax:
|
haftmann@33860
|
3327 |
Set.Inf ~> Complete_Lattice.Inf
|
haftmann@33860
|
3328 |
Set.Sup ~> Complete_Lattice.Sup
|
haftmann@33860
|
3329 |
Set.INFI ~> Complete_Lattice.INFI
|
haftmann@33860
|
3330 |
Set.SUPR ~> Complete_Lattice.SUPR
|
haftmann@33860
|
3331 |
Set.Inter ~> Complete_Lattice.Inter
|
haftmann@33860
|
3332 |
Set.Union ~> Complete_Lattice.Union
|
haftmann@33860
|
3333 |
Set.INTER ~> Complete_Lattice.INTER
|
haftmann@33860
|
3334 |
Set.UNION ~> Complete_Lattice.UNION
|
haftmann@32600
|
3335 |
- authentic syntax for
|
haftmann@32600
|
3336 |
Set.Pow
|
haftmann@32600
|
3337 |
Set.image
|
haftmann@32588
|
3338 |
- mere abbreviations:
|
haftmann@32588
|
3339 |
Set.empty (for bot)
|
haftmann@32588
|
3340 |
Set.UNIV (for top)
|
haftmann@33860
|
3341 |
Set.inter (for inf, formerly Set.Int)
|
haftmann@33860
|
3342 |
Set.union (for sup, formerly Set.Un)
|
haftmann@32588
|
3343 |
Complete_Lattice.Inter (for Inf)
|
haftmann@32588
|
3344 |
Complete_Lattice.Union (for Sup)
|
haftmann@32606
|
3345 |
Complete_Lattice.INTER (for INFI)
|
haftmann@32606
|
3346 |
Complete_Lattice.UNION (for SUPR)
|
haftmann@32600
|
3347 |
- object-logic definitions as far as appropriate
|
haftmann@32217
|
3348 |
|
haftmann@32691
|
3349 |
INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
|
wenzelm@33842
|
3350 |
Un_subset_iff are explicitly deleted as default simp rules; then also
|
wenzelm@33842
|
3351 |
their lattice counterparts le_inf_iff and le_sup_iff have to be
|
haftmann@32691
|
3352 |
deleted to achieve the desired effect.
|
haftmann@32056
|
3353 |
|
wenzelm@33842
|
3354 |
* Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
|
wenzelm@33842
|
3355 |
rules by default any longer; the same applies to min_max.inf_absorb1
|
wenzelm@33842
|
3356 |
etc. INCOMPATIBILITY.
|
wenzelm@33842
|
3357 |
|
wenzelm@33842
|
3358 |
* Rules sup_Int_eq and sup_Un_eq are no longer declared as
|
wenzelm@33842
|
3359 |
pred_set_conv by default. INCOMPATIBILITY.
|
wenzelm@33842
|
3360 |
|
wenzelm@33842
|
3361 |
* Power operations on relations and functions are now one dedicated
|
haftmann@32706
|
3362 |
constant "compow" with infix syntax "^^". Power operation on
|
wenzelm@31550
|
3363 |
multiplicative monoids retains syntax "^" and is now defined generic
|
wenzelm@31550
|
3364 |
in class power. INCOMPATIBILITY.
|
wenzelm@31550
|
3365 |
|
wenzelm@33842
|
3366 |
* Relation composition "R O S" now has a more standard argument order:
|
wenzelm@33842
|
3367 |
"R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
|
wenzelm@33842
|
3368 |
rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
|
wenzelm@33842
|
3369 |
break, since the O_assoc rule was not rewritten like this. Fix using
|
wenzelm@33842
|
3370 |
O_assoc[symmetric]. The same applies to the curried version "R OO S".
|
wenzelm@32427
|
3371 |
|
nipkow@33057
|
3372 |
* Function "Inv" is renamed to "inv_into" and function "inv" is now an
|
wenzelm@33842
|
3373 |
abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
|
nipkow@32988
|
3374 |
INCOMPATIBILITY.
|
nipkow@32988
|
3375 |
|
haftmann@33860
|
3376 |
* Most rules produced by inductive and datatype package have mandatory
|
haftmann@33860
|
3377 |
prefixes. INCOMPATIBILITY.
|
nipkow@31790
|
3378 |
|
wenzelm@33842
|
3379 |
* Changed "DERIV_intros" to a dynamic fact, which can be augmented by
|
wenzelm@33842
|
3380 |
the attribute of the same name. Each of the theorems in the list
|
wenzelm@33842
|
3381 |
DERIV_intros assumes composition with an additional function and
|
wenzelm@33842
|
3382 |
matches a variable to the derivative, which has to be solved by the
|
wenzelm@33842
|
3383 |
Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
|
wenzelm@33873
|
3384 |
of most elementary terms. Former Maclauren.DERIV_tac and
|
wenzelm@33873
|
3385 |
Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
|
wenzelm@33873
|
3386 |
INCOMPATIBILITY.
|
haftmann@33860
|
3387 |
|
haftmann@33860
|
3388 |
* Code generator attributes follow the usual underscore convention:
|
haftmann@33860
|
3389 |
code_unfold replaces code unfold
|
haftmann@33860
|
3390 |
code_post replaces code post
|
haftmann@33860
|
3391 |
etc.
|
haftmann@33860
|
3392 |
INCOMPATIBILITY.
|
wenzelm@31911
|
3393 |
|
krauss@33471
|
3394 |
* Renamed methods:
|
krauss@33471
|
3395 |
sizechange -> size_change
|
krauss@33471
|
3396 |
induct_scheme -> induction_schema
|
haftmann@33860
|
3397 |
INCOMPATIBILITY.
|
nipkow@33669
|
3398 |
|
wenzelm@33843
|
3399 |
* Discontinued abbreviation "arbitrary" of constant "undefined".
|
wenzelm@33843
|
3400 |
INCOMPATIBILITY, use "undefined" directly.
|
wenzelm@33843
|
3401 |
|
haftmann@33860
|
3402 |
* Renamed theorems:
|
haftmann@33860
|
3403 |
Suc_eq_add_numeral_1 -> Suc_eq_plus1
|
haftmann@33860
|
3404 |
Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
|
haftmann@33860
|
3405 |
Suc_plus1 -> Suc_eq_plus1
|
haftmann@33860
|
3406 |
*anti_sym -> *antisym*
|
haftmann@33860
|
3407 |
vector_less_eq_def -> vector_le_def
|
haftmann@33860
|
3408 |
INCOMPATIBILITY.
|
haftmann@33860
|
3409 |
|
haftmann@33860
|
3410 |
* Added theorem List.map_map as [simp]. Removed List.map_compose.
|
haftmann@33860
|
3411 |
INCOMPATIBILITY.
|
haftmann@33860
|
3412 |
|
haftmann@33860
|
3413 |
* Removed predicate "M hassize n" (<--> card M = n & finite M).
|
haftmann@33860
|
3414 |
INCOMPATIBILITY.
|
haftmann@33860
|
3415 |
|
hoelzl@31812
|
3416 |
|
huffman@33825
|
3417 |
*** HOLCF ***
|
huffman@33825
|
3418 |
|
wenzelm@33842
|
3419 |
* Theory Representable defines a class "rep" of domains that are
|
wenzelm@33842
|
3420 |
representable (via an ep-pair) in the universal domain type "udom".
|
huffman@33825
|
3421 |
Instances are provided for all type constructors defined in HOLCF.
|
huffman@33825
|
3422 |
|
huffman@33825
|
3423 |
* The 'new_domain' command is a purely definitional version of the
|
huffman@33825
|
3424 |
domain package, for representable domains. Syntax is identical to the
|
huffman@33825
|
3425 |
old domain package. The 'new_domain' package also supports indirect
|
huffman@33825
|
3426 |
recursion using previously-defined type constructors. See
|
wenzelm@33842
|
3427 |
src/HOLCF/ex/New_Domain.thy for examples.
|
wenzelm@33842
|
3428 |
|
wenzelm@33842
|
3429 |
* Method "fixrec_simp" unfolds one step of a fixrec-defined constant
|
huffman@33825
|
3430 |
on the left-hand side of an equation, and then performs
|
huffman@33825
|
3431 |
simplification. Rewriting is done using rules declared with the
|
wenzelm@33842
|
3432 |
"fixrec_simp" attribute. The "fixrec_simp" method is intended as a
|
wenzelm@33842
|
3433 |
replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
|
huffman@33825
|
3434 |
|
huffman@33825
|
3435 |
* The pattern-match compiler in 'fixrec' can now handle constructors
|
huffman@33825
|
3436 |
with HOL function types. Pattern-match combinators for the Pair
|
huffman@33825
|
3437 |
constructor are pre-configured.
|
huffman@33825
|
3438 |
|
huffman@33825
|
3439 |
* The 'fixrec' package now produces better fixed-point induction rules
|
huffman@33825
|
3440 |
for mutually-recursive definitions: Induction rules have conclusions
|
huffman@33825
|
3441 |
of the form "P foo bar" instead of "P <foo, bar>".
|
huffman@33825
|
3442 |
|
huffman@33825
|
3443 |
* The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
|
huffman@33825
|
3444 |
been renamed to "below". The name "below" now replaces "less" in many
|
wenzelm@33842
|
3445 |
theorem names. (Legacy theorem names using "less" are still supported
|
wenzelm@33842
|
3446 |
as well.)
|
huffman@33825
|
3447 |
|
huffman@33825
|
3448 |
* The 'fixrec' package now supports "bottom patterns". Bottom
|
huffman@33825
|
3449 |
patterns can be used to generate strictness rules, or to make
|
huffman@33825
|
3450 |
functions more strict (much like the bang-patterns supported by the
|
wenzelm@33873
|
3451 |
Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
|
wenzelm@33873
|
3452 |
examples.
|
huffman@33825
|
3453 |
|
huffman@33825
|
3454 |
|
wenzelm@31304
|
3455 |
*** ML ***
|
wenzelm@31304
|
3456 |
|
wenzelm@33843
|
3457 |
* Support for Poly/ML 5.3.0, with improved reporting of compiler
|
wenzelm@33843
|
3458 |
errors and run-time exceptions, including detailed source positions.
|
wenzelm@33843
|
3459 |
|
wenzelm@33843
|
3460 |
* Structure Name_Space (formerly NameSpace) now manages uniquely
|
wenzelm@33843
|
3461 |
identified entries, with some additional information such as source
|
wenzelm@33843
|
3462 |
position, logical grouping etc.
|
wenzelm@33843
|
3463 |
|
wenzelm@33526
|
3464 |
* Theory and context data is now introduced by the simplified and
|
wenzelm@33526
|
3465 |
modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
|
wenzelm@33526
|
3466 |
to be pure, but the old TheoryDataFun for mutable data (with explicit
|
wenzelm@33526
|
3467 |
copy operation) is still available for some time.
|
wenzelm@33526
|
3468 |
|
wenzelm@32742
|
3469 |
* Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
|
wenzelm@32742
|
3470 |
provides a high-level programming interface to synchronized state
|
wenzelm@32742
|
3471 |
variables with atomic update. This works via pure function
|
wenzelm@32742
|
3472 |
application within a critical section -- its runtime should be as
|
wenzelm@32742
|
3473 |
short as possible; beware of deadlocks if critical code is nested,
|
wenzelm@32742
|
3474 |
either directly or indirectly via other synchronized variables!
|
wenzelm@32742
|
3475 |
|
wenzelm@32742
|
3476 |
* Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
|
wenzelm@32742
|
3477 |
wraps raw ML references, explicitly indicating their non-thread-safe
|
wenzelm@32742
|
3478 |
behaviour. The Isar toplevel keeps this structure open, to
|
wenzelm@32742
|
3479 |
accommodate Proof General as well as quick and dirty interactive
|
wenzelm@32742
|
3480 |
experiments with references.
|
wenzelm@32742
|
3481 |
|
wenzelm@32365
|
3482 |
* PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
|
wenzelm@32365
|
3483 |
parallel tactical reasoning.
|
wenzelm@32365
|
3484 |
|
wenzelm@32427
|
3485 |
* Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
|
wenzelm@32427
|
3486 |
are similar to SUBPROOF, but are slightly more flexible: only the
|
wenzelm@32427
|
3487 |
specified parts of the subgoal are imported into the context, and the
|
wenzelm@32427
|
3488 |
body tactic may introduce new subgoals and schematic variables.
|
wenzelm@32427
|
3489 |
|
wenzelm@32427
|
3490 |
* Old tactical METAHYPS, which does not observe the proof context, has
|
wenzelm@32427
|
3491 |
been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
|
wenzelm@32427
|
3492 |
or Subgoal.FOCUS etc.
|
wenzelm@32216
|
3493 |
|
wenzelm@31972
|
3494 |
* Renamed functor TableFun to Table, and GraphFun to Graph. (Since
|
wenzelm@31972
|
3495 |
functors have their own ML name space there is no point to mark them
|
wenzelm@31972
|
3496 |
separately.) Minor INCOMPATIBILITY.
|
wenzelm@31972
|
3497 |
|
wenzelm@31912
|
3498 |
* Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
|
wenzelm@31912
|
3499 |
|
wenzelm@33842
|
3500 |
* Renamed several structures FooBar to Foo_Bar. Occasional,
|
wenzelm@33842
|
3501 |
INCOMPATIBILITY.
|
wenzelm@33842
|
3502 |
|
wenzelm@33843
|
3503 |
* Operations of structure Skip_Proof no longer require quick_and_dirty
|
wenzelm@33843
|
3504 |
mode, which avoids critical setmp.
|
wenzelm@33843
|
3505 |
|
wenzelm@31306
|
3506 |
* Eliminated old Attrib.add_attributes, Method.add_methods and related
|
wenzelm@33842
|
3507 |
combinators for "args". INCOMPATIBILITY, need to use simplified
|
wenzelm@31306
|
3508 |
Attrib/Method.setup introduced in Isabelle2009.
|
wenzelm@31304
|
3509 |
|
wenzelm@32151
|
3510 |
* Proper context for simpset_of, claset_of, clasimpset_of. May fall
|
wenzelm@32151
|
3511 |
back on global_simpset_of, global_claset_of, global_clasimpset_of as
|
wenzelm@32151
|
3512 |
last resort. INCOMPATIBILITY.
|
wenzelm@32151
|
3513 |
|
wenzelm@32112
|
3514 |
* Display.pretty_thm now requires a proper context (cf. former
|
wenzelm@32112
|
3515 |
ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
|
wenzelm@32112
|
3516 |
or even Display.pretty_thm_without_context as last resort.
|
wenzelm@32112
|
3517 |
INCOMPATIBILITY.
|
wenzelm@32112
|
3518 |
|
wenzelm@32446
|
3519 |
* Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
|
wenzelm@32446
|
3520 |
Syntax.pretty_typ/term directly, preferably with proper context
|
wenzelm@32446
|
3521 |
instead of global theory.
|
wenzelm@32446
|
3522 |
|
wenzelm@31304
|
3523 |
|
wenzelm@31308
|
3524 |
*** System ***
|
wenzelm@31308
|
3525 |
|
wenzelm@33842
|
3526 |
* Further fine tuning of parallel proof checking, scales up to 8 cores
|
wenzelm@33842
|
3527 |
(max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
|
wenzelm@33842
|
3528 |
usedir option -q.
|
wenzelm@33842
|
3529 |
|
wenzelm@32326
|
3530 |
* Support for additional "Isabelle components" via etc/components, see
|
wenzelm@32326
|
3531 |
also the system manual.
|
wenzelm@32326
|
3532 |
|
wenzelm@32326
|
3533 |
* The isabelle makeall tool now operates on all components with
|
wenzelm@32326
|
3534 |
IsaMakefile, not just hardwired "logics".
|
wenzelm@32326
|
3535 |
|
wenzelm@31317
|
3536 |
* Removed "compress" option from isabelle-process and isabelle usedir;
|
wenzelm@31317
|
3537 |
this is always enabled.
|
wenzelm@31317
|
3538 |
|
wenzelm@33842
|
3539 |
* Discontinued support for Poly/ML 4.x versions.
|
wenzelm@33842
|
3540 |
|
wenzelm@33842
|
3541 |
* Isabelle tool "wwwfind" provides web interface for 'find_theorems'
|
wenzelm@33842
|
3542 |
on a given logic image. This requires the lighttpd webserver and is
|
wenzelm@33842
|
3543 |
currently supported on Linux only.
|
wenzelm@32077
|
3544 |
|
wenzelm@31308
|
3545 |
|
wenzelm@31304
|
3546 |
|
wenzelm@30845
|
3547 |
New in Isabelle2009 (April 2009)
|
wenzelm@30845
|
3548 |
--------------------------------
|
haftmann@27104
|
3549 |
|
wenzelm@27599
|
3550 |
*** General ***
|
wenzelm@27599
|
3551 |
|
wenzelm@28504
|
3552 |
* Simplified main Isabelle executables, with less surprises on
|
wenzelm@28504
|
3553 |
case-insensitive file-systems (such as Mac OS).
|
wenzelm@28504
|
3554 |
|
wenzelm@28504
|
3555 |
- The main Isabelle tool wrapper is now called "isabelle" instead of
|
wenzelm@28504
|
3556 |
"isatool."
|
wenzelm@28504
|
3557 |
|
wenzelm@28504
|
3558 |
- The former "isabelle" alias for "isabelle-process" has been
|
wenzelm@28504
|
3559 |
removed (should rarely occur to regular users).
|
wenzelm@28504
|
3560 |
|
wenzelm@28915
|
3561 |
- The former "isabelle-interface" and its alias "Isabelle" have been
|
wenzelm@28915
|
3562 |
removed (interfaces are now regular Isabelle tools).
|
wenzelm@28504
|
3563 |
|
wenzelm@28504
|
3564 |
Within scripts and make files, the Isabelle environment variables
|
wenzelm@28504
|
3565 |
ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
|
wenzelm@28504
|
3566 |
respectively. (The latter are still available as legacy feature.)
|
wenzelm@28504
|
3567 |
|
wenzelm@28915
|
3568 |
The old isabelle-interface wrapper could react in confusing ways if
|
wenzelm@28915
|
3569 |
the interface was uninstalled or changed otherwise. Individual
|
wenzelm@28915
|
3570 |
interface tool configuration is now more explicit, see also the
|
wenzelm@28915
|
3571 |
Isabelle system manual. In particular, Proof General is now available
|
wenzelm@28915
|
3572 |
via "isabelle emacs".
|
wenzelm@28504
|
3573 |
|
wenzelm@28504
|
3574 |
INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
|
wenzelm@28504
|
3575 |
purge installed copies of Isabelle executables and re-run "isabelle
|
wenzelm@28504
|
3576 |
install -p ...", or use symlinks.
|
wenzelm@28504
|
3577 |
|
wenzelm@28914
|
3578 |
* The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
|
wenzelm@30845
|
3579 |
old ~/isabelle, which was slightly non-standard and apt to cause
|
wenzelm@30845
|
3580 |
surprises on case-insensitive file-systems (such as Mac OS).
|
wenzelm@28914
|
3581 |
|
wenzelm@28914
|
3582 |
INCOMPATIBILITY, need to move existing ~/isabelle/etc,
|
wenzelm@28914
|
3583 |
~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
|
wenzelm@28914
|
3584 |
care is required when using older releases of Isabelle. Note that
|
wenzelm@28914
|
3585 |
ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
|
wenzelm@30845
|
3586 |
Isabelle distribution, in order to use the new ~/.isabelle uniformly.
|
wenzelm@28914
|
3587 |
|
wenzelm@29161
|
3588 |
* Proofs of fully specified statements are run in parallel on
|
wenzelm@30845
|
3589 |
multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
|
wenzelm@30845
|
3590 |
a regular 4-core machine, if the initial heap space is made reasonably
|
wenzelm@30845
|
3591 |
large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
|
wenzelm@30845
|
3592 |
|
wenzelm@30845
|
3593 |
* The main reference manuals ("isar-ref", "implementation", and
|
wenzelm@30845
|
3594 |
"system") have been updated and extended. Formally checked references
|
wenzelm@30845
|
3595 |
as hyperlinks are now available uniformly.
|
wenzelm@30845
|
3596 |
|
wenzelm@30163
|
3597 |
|
wenzelm@27599
|
3598 |
*** Pure ***
|
wenzelm@27599
|
3599 |
|
wenzelm@30845
|
3600 |
* Complete re-implementation of locales. INCOMPATIBILITY in several
|
wenzelm@30845
|
3601 |
respects. The most important changes are listed below. See the
|
wenzelm@30845
|
3602 |
Tutorial on Locales ("locales" manual) for details.
|
wenzelm@30845
|
3603 |
|
wenzelm@30845
|
3604 |
- In locale expressions, instantiation replaces renaming. Parameters
|
wenzelm@30845
|
3605 |
must be declared in a for clause. To aid compatibility with previous
|
wenzelm@30845
|
3606 |
parameter inheritance, in locale declarations, parameters that are not
|
wenzelm@30845
|
3607 |
'touched' (instantiation position "_" or omitted) are implicitly added
|
wenzelm@30845
|
3608 |
with their syntax at the beginning of the for clause.
|
wenzelm@30845
|
3609 |
|
wenzelm@30845
|
3610 |
- Syntax from abbreviations and definitions in locales is available in
|
wenzelm@30845
|
3611 |
locale expressions and context elements. The latter is particularly
|
wenzelm@30845
|
3612 |
useful in locale declarations.
|
wenzelm@30845
|
3613 |
|
wenzelm@30845
|
3614 |
- More flexible mechanisms to qualify names generated by locale
|
wenzelm@30845
|
3615 |
expressions. Qualifiers (prefixes) may be specified in locale
|
wenzelm@30845
|
3616 |
expressions, and can be marked as mandatory (syntax: "name!:") or
|
wenzelm@30845
|
3617 |
optional (syntax "name?:"). The default depends for plain "name:"
|
wenzelm@30845
|
3618 |
depends on the situation where a locale expression is used: in
|
wenzelm@30845
|
3619 |
commands 'locale' and 'sublocale' prefixes are optional, in
|
wenzelm@30845
|
3620 |
'interpretation' and 'interpret' prefixes are mandatory. The old
|
wenzelm@30845
|
3621 |
implicit qualifiers derived from the parameter names of a locale are
|
wenzelm@30845
|
3622 |
no longer generated.
|
wenzelm@30845
|
3623 |
|
wenzelm@30845
|
3624 |
- Command "sublocale l < e" replaces "interpretation l < e". The
|
wenzelm@30845
|
3625 |
instantiation clause in "interpretation" and "interpret" (square
|
wenzelm@30845
|
3626 |
brackets) is no longer available. Use locale expressions.
|
wenzelm@30845
|
3627 |
|
wenzelm@30845
|
3628 |
- When converting proof scripts, mandatory qualifiers in
|
wenzelm@30845
|
3629 |
'interpretation' and 'interpret' should be retained by default, even
|
wenzelm@30845
|
3630 |
if this is an INCOMPATIBILITY compared to former behavior. In the
|
wenzelm@30845
|
3631 |
worst case, use the "name?:" form for non-mandatory ones. Qualifiers
|
wenzelm@30845
|
3632 |
in locale expressions range over a single locale instance only.
|
wenzelm@30845
|
3633 |
|
wenzelm@30845
|
3634 |
- Dropped locale element "includes". This is a major INCOMPATIBILITY.
|
ballarin@28710
|
3635 |
In existing theorem specifications replace the includes element by the
|
wenzelm@30106
|
3636 |
respective context elements of the included locale, omitting those
|
wenzelm@30106
|
3637 |
that are already present in the theorem specification. Multiple
|
wenzelm@30106
|
3638 |
assume elements of a locale should be replaced by a single one
|
wenzelm@30106
|
3639 |
involving the locale predicate. In the proof body, declarations (most
|
wenzelm@30106
|
3640 |
notably theorems) may be regained by interpreting the respective
|
wenzelm@30106
|
3641 |
locales in the proof context as required (command "interpret").
|
wenzelm@30106
|
3642 |
|
ballarin@28710
|
3643 |
If using "includes" in replacement of a target solely because the
|
ballarin@28710
|
3644 |
parameter types in the theorem are not as general as in the target,
|
wenzelm@30106
|
3645 |
consider declaring a new locale with additional type constraints on
|
wenzelm@30106
|
3646 |
the parameters (context element "constrains").
|
ballarin@28710
|
3647 |
|
wenzelm@30845
|
3648 |
- Discontinued "locale (open)". INCOMPATIBILITY.
|
wenzelm@30845
|
3649 |
|
wenzelm@30845
|
3650 |
- Locale interpretation commands no longer attempt to simplify goal.
|
ballarin@27761
|
3651 |
INCOMPATIBILITY: in rare situations the generated goal differs. Use
|
ballarin@27761
|
3652 |
methods intro_locales and unfold_locales to clarify.
|
haftmann@27681
|
3653 |
|
wenzelm@30845
|
3654 |
- Locale interpretation commands no longer accept interpretation
|
wenzelm@30845
|
3655 |
attributes. INCOMPATIBILITY.
|
wenzelm@30845
|
3656 |
|
wenzelm@30845
|
3657 |
* Class declaration: so-called "base sort" must not be given in import
|
wenzelm@30845
|
3658 |
list any longer, but is inferred from the specification. Particularly
|
wenzelm@30845
|
3659 |
in HOL, write
|
wenzelm@30845
|
3660 |
|
wenzelm@30845
|
3661 |
class foo = ...
|
wenzelm@30845
|
3662 |
|
wenzelm@30845
|
3663 |
instead of
|
wenzelm@30845
|
3664 |
|
wenzelm@30845
|
3665 |
class foo = type + ...
|
wenzelm@30845
|
3666 |
|
wenzelm@30845
|
3667 |
* Class target: global versions of theorems stemming do not carry a
|
wenzelm@30845
|
3668 |
parameter prefix any longer. INCOMPATIBILITY.
|
wenzelm@30845
|
3669 |
|
wenzelm@30845
|
3670 |
* Class 'instance' command no longer accepts attached definitions.
|
wenzelm@30845
|
3671 |
INCOMPATIBILITY, use proper 'instantiation' target instead.
|
wenzelm@30845
|
3672 |
|
wenzelm@30845
|
3673 |
* Recovered hiding of consts, which was accidentally broken in
|
wenzelm@30845
|
3674 |
Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
|
wenzelm@30845
|
3675 |
makes c inaccessible; consider using ``hide (open) const c'' instead.
|
wenzelm@30845
|
3676 |
|
wenzelm@30845
|
3677 |
* Slightly more coherent Pure syntax, with updated documentation in
|
wenzelm@30845
|
3678 |
isar-ref manual. Removed locales meta_term_syntax and
|
wenzelm@30845
|
3679 |
meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
|
wenzelm@30845
|
3680 |
INCOMPATIBILITY in rare situations. Note that &&& should not be used
|
wenzelm@30845
|
3681 |
directly in regular applications.
|
wenzelm@30845
|
3682 |
|
wenzelm@30845
|
3683 |
* There is a new syntactic category "float_const" for signed decimal
|
wenzelm@30845
|
3684 |
fractions (e.g. 123.45 or -123.45).
|
wenzelm@30845
|
3685 |
|
wenzelm@30845
|
3686 |
* Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
|
wenzelm@30845
|
3687 |
interface with 'setup' command instead.
|
wenzelm@30845
|
3688 |
|
wenzelm@30845
|
3689 |
* Command 'local_setup' is similar to 'setup', but operates on a local
|
wenzelm@30845
|
3690 |
theory context.
|
haftmann@27104
|
3691 |
|
wenzelm@28114
|
3692 |
* The 'axiomatization' command now only works within a global theory
|
wenzelm@28114
|
3693 |
context. INCOMPATIBILITY.
|
wenzelm@28114
|
3694 |
|
wenzelm@30845
|
3695 |
* Goal-directed proof now enforces strict proof irrelevance wrt. sort
|
wenzelm@30845
|
3696 |
hypotheses. Sorts required in the course of reasoning need to be
|
wenzelm@30845
|
3697 |
covered by the constraints in the initial statement, completed by the
|
wenzelm@30845
|
3698 |
type instance information of the background theory. Non-trivial sort
|
wenzelm@30845
|
3699 |
hypotheses, which rarely occur in practice, may be specified via
|
wenzelm@30845
|
3700 |
vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
|
wenzelm@30845
|
3701 |
|
wenzelm@30845
|
3702 |
lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
|
wenzelm@30845
|
3703 |
|
wenzelm@30845
|
3704 |
The result contains an implicit sort hypotheses as before --
|
wenzelm@30845
|
3705 |
SORT_CONSTRAINT premises are eliminated as part of the canonical rule
|
wenzelm@30845
|
3706 |
normalization.
|
wenzelm@30845
|
3707 |
|
wenzelm@30845
|
3708 |
* Generalized Isar history, with support for linear undo, direct state
|
wenzelm@30845
|
3709 |
addressing etc.
|
wenzelm@30845
|
3710 |
|
wenzelm@30845
|
3711 |
* Changed defaults for unify configuration options:
|
wenzelm@30845
|
3712 |
|
wenzelm@30845
|
3713 |
unify_trace_bound = 50 (formerly 25)
|
wenzelm@30845
|
3714 |
unify_search_bound = 60 (formerly 30)
|
wenzelm@30845
|
3715 |
|
wenzelm@30845
|
3716 |
* Different bookkeeping for code equations (INCOMPATIBILITY):
|
wenzelm@30845
|
3717 |
|
wenzelm@30845
|
3718 |
a) On theory merge, the last set of code equations for a particular
|
wenzelm@30845
|
3719 |
constant is taken (in accordance with the policy applied by other
|
wenzelm@30845
|
3720 |
parts of the code generator framework).
|
wenzelm@30845
|
3721 |
|
wenzelm@30845
|
3722 |
b) Code equations stemming from explicit declarations (e.g. code
|
wenzelm@30845
|
3723 |
attribute) gain priority over default code equations stemming
|
wenzelm@30845
|
3724 |
from definition, primrec, fun etc.
|
wenzelm@30845
|
3725 |
|
wenzelm@30845
|
3726 |
* Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
|
wenzelm@30845
|
3727 |
|
haftmann@30965
|
3728 |
* Unified theorem tables for both code generators. Thus [code
|
wenzelm@30845
|
3729 |
func] has disappeared and only [code] remains. INCOMPATIBILITY.
|
wenzelm@30580
|
3730 |
|
wenzelm@30580
|
3731 |
* Command 'find_consts' searches for constants based on type and name
|
wenzelm@30580
|
3732 |
patterns, e.g.
|
kleing@29820
|
3733 |
|
kleing@29820
|
3734 |
find_consts "_ => bool"
|
kleing@29820
|
3735 |
|
wenzelm@30106
|
3736 |
By default, matching is against subtypes, but it may be restricted to
|
wenzelm@30731
|
3737 |
the whole type. Searching by name is possible. Multiple queries are
|
wenzelm@30106
|
3738 |
conjunctive and queries may be negated by prefixing them with a
|
wenzelm@30106
|
3739 |
hyphen:
|
kleing@29820
|
3740 |
|
kleing@29820
|
3741 |
find_consts strict: "_ => bool" name: "Int" -"int => int"
|
kleing@29798
|
3742 |
|
wenzelm@30845
|
3743 |
* New 'find_theorems' criterion "solves" matches theorems that
|
wenzelm@30845
|
3744 |
directly solve the current goal (modulo higher-order unification).
|
wenzelm@30845
|
3745 |
|
wenzelm@30845
|
3746 |
* Auto solve feature for main theorem statements: whenever a new goal
|
wenzelm@30845
|
3747 |
is stated, "find_theorems solves" is called; any theorems that could
|
wenzelm@30845
|
3748 |
solve the lemma directly are listed as part of the goal state.
|
wenzelm@30845
|
3749 |
Cf. associated options in Proof General Isabelle settings menu,
|
wenzelm@30845
|
3750 |
enabled by default, with reasonable timeout for pathological cases of
|
wenzelm@30845
|
3751 |
higher-order unification.
|
webertj@30409
|
3752 |
|
haftmann@27651
|
3753 |
|
haftmann@27651
|
3754 |
*** Document preparation ***
|
haftmann@27651
|
3755 |
|
haftmann@27651
|
3756 |
* Antiquotation @{lemma} now imitates a regular terminal proof,
|
haftmann@27651
|
3757 |
demanding keyword 'by' and supporting the full method expression
|
haftmann@27651
|
3758 |
syntax just like the Isar command 'by'.
|
haftmann@27651
|
3759 |
|
haftmann@27651
|
3760 |
|
haftmann@27651
|
3761 |
*** HOL ***
|
haftmann@27651
|
3762 |
|
wenzelm@30845
|
3763 |
* Integrated main parts of former image HOL-Complex with HOL. Entry
|
wenzelm@30845
|
3764 |
points Main and Complex_Main remain as before.
|
wenzelm@30845
|
3765 |
|
wenzelm@30845
|
3766 |
* Logic image HOL-Plain provides a minimal HOL with the most important
|
wenzelm@30845
|
3767 |
tools available (inductive, datatype, primrec, ...). This facilitates
|
wenzelm@30845
|
3768 |
experimentation and tool development. Note that user applications
|
wenzelm@30845
|
3769 |
(and library theories) should never refer to anything below theory
|
wenzelm@30845
|
3770 |
Main, as before.
|
wenzelm@30845
|
3771 |
|
wenzelm@30845
|
3772 |
* Logic image HOL-Main stops at theory Main, and thus facilitates
|
wenzelm@30845
|
3773 |
experimentation due to shorter build times.
|
wenzelm@30845
|
3774 |
|
wenzelm@30845
|
3775 |
* Logic image HOL-NSA contains theories of nonstandard analysis which
|
wenzelm@30845
|
3776 |
were previously part of former HOL-Complex. Entry point Hyperreal
|
wenzelm@30845
|
3777 |
remains valid, but theories formerly using Complex_Main should now use
|
wenzelm@30845
|
3778 |
new entry point Hypercomplex.
|
wenzelm@30845
|
3779 |
|
wenzelm@30845
|
3780 |
* Generic ATP manager for Sledgehammer, based on ML threads instead of
|
wenzelm@30845
|
3781 |
Posix processes. Avoids potentially expensive forking of the ML
|
wenzelm@30845
|
3782 |
process. New thread-based implementation also works on non-Unix
|
wenzelm@30845
|
3783 |
platforms (Cygwin). Provers are no longer hardwired, but defined
|
wenzelm@30845
|
3784 |
within the theory via plain ML wrapper functions. Basic Sledgehammer
|
wenzelm@30845
|
3785 |
commands are covered in the isar-ref manual.
|
wenzelm@30845
|
3786 |
|
wenzelm@30845
|
3787 |
* Wrapper scripts for remote SystemOnTPTP service allows to use
|
wenzelm@30845
|
3788 |
sledgehammer without local ATP installation (Vampire etc.). Other
|
wenzelm@30845
|
3789 |
provers may be included via suitable ML wrappers, see also
|
wenzelm@30845
|
3790 |
src/HOL/ATP_Linkup.thy.
|
wenzelm@30845
|
3791 |
|
wenzelm@30845
|
3792 |
* ATP selection (E/Vampire/Spass) is now via Proof General's settings
|
wenzelm@30845
|
3793 |
menu.
|
wenzelm@30845
|
3794 |
|
wenzelm@30845
|
3795 |
* The metis method no longer fails because the theorem is too trivial
|
wenzelm@30845
|
3796 |
(contains the empty clause).
|
wenzelm@30845
|
3797 |
|
wenzelm@30845
|
3798 |
* The metis method now fails in the usual manner, rather than raising
|
wenzelm@30845
|
3799 |
an exception, if it determines that it cannot prove the theorem.
|
wenzelm@30845
|
3800 |
|
wenzelm@30845
|
3801 |
* Method "coherent" implements a prover for coherent logic (see also
|
wenzelm@30845
|
3802 |
src/Tools/coherent.ML).
|
wenzelm@30845
|
3803 |
|
wenzelm@30845
|
3804 |
* Constants "undefined" and "default" replace "arbitrary". Usually
|
wenzelm@30845
|
3805 |
"undefined" is the right choice to replace "arbitrary", though
|
wenzelm@30845
|
3806 |
logically there is no difference. INCOMPATIBILITY.
|
wenzelm@30845
|
3807 |
|
wenzelm@30845
|
3808 |
* Command "value" now integrates different evaluation mechanisms. The
|
wenzelm@30845
|
3809 |
result of the first successful evaluation mechanism is printed. In
|
wenzelm@30845
|
3810 |
square brackets a particular named evaluation mechanisms may be
|
wenzelm@30845
|
3811 |
specified (currently, [SML], [code] or [nbe]). See further
|
wenzelm@30845
|
3812 |
src/HOL/ex/Eval_Examples.thy.
|
wenzelm@30845
|
3813 |
|
wenzelm@30845
|
3814 |
* Normalization by evaluation now allows non-leftlinear equations.
|
wenzelm@30845
|
3815 |
Declare with attribute [code nbe].
|
wenzelm@30845
|
3816 |
|
wenzelm@30845
|
3817 |
* Methods "case_tac" and "induct_tac" now refer to the very same rules
|
wenzelm@30845
|
3818 |
as the structured Isar versions "cases" and "induct", cf. the
|
wenzelm@30845
|
3819 |
corresponding "cases" and "induct" attributes. Mutual induction rules
|
wenzelm@30845
|
3820 |
are now presented as a list of individual projections
|
wenzelm@30845
|
3821 |
(e.g. foo_bar.inducts for types foo and bar); the old format with
|
wenzelm@30845
|
3822 |
explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
|
wenzelm@30845
|
3823 |
rare situations a different rule is selected --- notably nested tuple
|
wenzelm@30845
|
3824 |
elimination instead of former prod.exhaust: use explicit (case_tac t
|
wenzelm@30845
|
3825 |
rule: prod.exhaust) here.
|
wenzelm@30845
|
3826 |
|
wenzelm@30845
|
3827 |
* Attributes "cases", "induct", "coinduct" support "del" option.
|
wenzelm@30845
|
3828 |
|
wenzelm@30845
|
3829 |
* Removed fact "case_split_thm", which duplicates "case_split".
|
wenzelm@30845
|
3830 |
|
wenzelm@30845
|
3831 |
* The option datatype has been moved to a new theory Option. Renamed
|
wenzelm@30845
|
3832 |
option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
|
wenzelm@30845
|
3833 |
|
wenzelm@30845
|
3834 |
* New predicate "strict_mono" classifies strict functions on partial
|
wenzelm@30845
|
3835 |
orders. With strict functions on linear orders, reasoning about
|
wenzelm@30845
|
3836 |
(in)equalities is facilitated by theorems "strict_mono_eq",
|
wenzelm@30845
|
3837 |
"strict_mono_less_eq" and "strict_mono_less".
|
wenzelm@30845
|
3838 |
|
wenzelm@30845
|
3839 |
* Some set operations are now proper qualified constants with
|
wenzelm@30845
|
3840 |
authentic syntax. INCOMPATIBILITY:
|
haftmann@30304
|
3841 |
|
haftmann@30304
|
3842 |
op Int ~> Set.Int
|
haftmann@30304
|
3843 |
op Un ~> Set.Un
|
haftmann@30304
|
3844 |
INTER ~> Set.INTER
|
haftmann@30304
|
3845 |
UNION ~> Set.UNION
|
haftmann@30304
|
3846 |
Inter ~> Set.Inter
|
haftmann@30304
|
3847 |
Union ~> Set.Union
|
haftmann@30304
|
3848 |
{} ~> Set.empty
|
haftmann@30304
|
3849 |
UNIV ~> Set.UNIV
|
haftmann@30304
|
3850 |
|
wenzelm@30845
|
3851 |
* Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
|
wenzelm@30845
|
3852 |
theory Set.
|
wenzelm@30845
|
3853 |
|
wenzelm@30845
|
3854 |
* Auxiliary class "itself" has disappeared -- classes without any
|
wenzelm@30845
|
3855 |
parameter are treated as expected by the 'class' command.
|
haftmann@29734
|
3856 |
|
haftmann@29760
|
3857 |
* Leibnitz's Series for Pi and the arcus tangens and logarithm series.
|
haftmann@29760
|
3858 |
|
wenzelm@30845
|
3859 |
* Common decision procedures (Cooper, MIR, Ferrack, Approximation,
|
wenzelm@30845
|
3860 |
Dense_Linear_Order) are now in directory HOL/Decision_Procs.
|
wenzelm@30845
|
3861 |
|
wenzelm@30845
|
3862 |
* Theory src/HOL/Decision_Procs/Approximation provides the new proof
|
wenzelm@30845
|
3863 |
method "approximation". It proves formulas on real values by using
|
wenzelm@30845
|
3864 |
interval arithmetic. In the formulas are also the transcendental
|
wenzelm@30845
|
3865 |
functions sin, cos, tan, atan, ln, exp and the constant pi are
|
wenzelm@30845
|
3866 |
allowed. For examples see
|
wenzelm@30845
|
3867 |
src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
|
haftmann@29760
|
3868 |
|
haftmann@29760
|
3869 |
* Theory "Reflection" now resides in HOL/Library.
|
haftmann@29650
|
3870 |
|
wenzelm@30845
|
3871 |
* Entry point to Word library now simply named "Word".
|
wenzelm@30845
|
3872 |
INCOMPATIBILITY.
|
haftmann@29628
|
3873 |
|
haftmann@29197
|
3874 |
* Made source layout more coherent with logical distribution
|
haftmann@29197
|
3875 |
structure:
|
haftmann@28952
|
3876 |
|
haftmann@28952
|
3877 |
src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
|
haftmann@28952
|
3878 |
src/HOL/Library/Code_Message.thy ~> src/HOL/
|
haftmann@28952
|
3879 |
src/HOL/Library/GCD.thy ~> src/HOL/
|
haftmann@28952
|
3880 |
src/HOL/Library/Order_Relation.thy ~> src/HOL/
|
haftmann@28952
|
3881 |
src/HOL/Library/Parity.thy ~> src/HOL/
|
haftmann@28952
|
3882 |
src/HOL/Library/Univ_Poly.thy ~> src/HOL/
|
huffman@30173
|
3883 |
src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
|
haftmann@28952
|
3884 |
src/HOL/Real/Lubs.thy ~> src/HOL/
|
haftmann@28952
|
3885 |
src/HOL/Real/PReal.thy ~> src/HOL/
|
haftmann@28952
|
3886 |
src/HOL/Real/Rational.thy ~> src/HOL/
|
haftmann@28952
|
3887 |
src/HOL/Real/RComplete.thy ~> src/HOL/
|
haftmann@28952
|
3888 |
src/HOL/Real/RealDef.thy ~> src/HOL/
|
haftmann@28952
|
3889 |
src/HOL/Real/RealPow.thy ~> src/HOL/
|
haftmann@28952
|
3890 |
src/HOL/Real/Real.thy ~> src/HOL/
|
haftmann@28952
|
3891 |
src/HOL/Complex/Complex_Main.thy ~> src/HOL/
|
haftmann@28952
|
3892 |
src/HOL/Complex/Complex.thy ~> src/HOL/
|
huffman@30173
|
3893 |
src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
|
huffman@30173
|
3894 |
src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
|
haftmann@28952
|
3895 |
src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
|
haftmann@28952
|
3896 |
src/HOL/Hyperreal/Fact.thy ~> src/HOL/
|
haftmann@28952
|
3897 |
src/HOL/Hyperreal/Integration.thy ~> src/HOL/
|
haftmann@28952
|
3898 |
src/HOL/Hyperreal/Lim.thy ~> src/HOL/
|
haftmann@28952
|
3899 |
src/HOL/Hyperreal/Ln.thy ~> src/HOL/
|
haftmann@28952
|
3900 |
src/HOL/Hyperreal/Log.thy ~> src/HOL/
|
haftmann@28952
|
3901 |
src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
|
haftmann@28952
|
3902 |
src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
|
haftmann@28952
|
3903 |
src/HOL/Hyperreal/Series.thy ~> src/HOL/
|
haftmann@29197
|
3904 |
src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
|
haftmann@28952
|
3905 |
src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
|
haftmann@28952
|
3906 |
src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
|
haftmann@28952
|
3907 |
src/HOL/Real/Float ~> src/HOL/Library/
|
haftmann@29197
|
3908 |
src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
|
haftmann@29197
|
3909 |
src/HOL/Real/RealVector.thy ~> src/HOL/
|
haftmann@28952
|
3910 |
|
haftmann@28952
|
3911 |
src/HOL/arith_data.ML ~> src/HOL/Tools
|
haftmann@28952
|
3912 |
src/HOL/hologic.ML ~> src/HOL/Tools
|
haftmann@28952
|
3913 |
src/HOL/simpdata.ML ~> src/HOL/Tools
|
haftmann@28952
|
3914 |
src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
|
haftmann@28952
|
3915 |
src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
|
haftmann@28952
|
3916 |
src/HOL/nat_simprocs.ML ~> src/HOL/Tools
|
haftmann@28952
|
3917 |
src/HOL/Real/float_arith.ML ~> src/HOL/Tools
|
haftmann@28952
|
3918 |
src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
|
haftmann@28952
|
3919 |
src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
|
haftmann@28952
|
3920 |
src/HOL/Real/real_arith.ML ~> src/HOL/Tools
|
haftmann@28952
|
3921 |
|
haftmann@29395
|
3922 |
src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
|
haftmann@29395
|
3923 |
src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
|
haftmann@29395
|
3924 |
src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
|
haftmann@29395
|
3925 |
src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
|
haftmann@29395
|
3926 |
src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
|
haftmann@29395
|
3927 |
src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
|
haftmann@29395
|
3928 |
|
wenzelm@30845
|
3929 |
* If methods "eval" and "evaluation" encounter a structured proof
|
wenzelm@30845
|
3930 |
state with !!/==>, only the conclusion is evaluated to True (if
|
wenzelm@30845
|
3931 |
possible), avoiding strange error messages.
|
wenzelm@30845
|
3932 |
|
wenzelm@30845
|
3933 |
* Method "sizechange" automates termination proofs using (a
|
wenzelm@30845
|
3934 |
modification of) the size-change principle. Requires SAT solver. See
|
wenzelm@30845
|
3935 |
src/HOL/ex/Termination.thy for examples.
|
wenzelm@30845
|
3936 |
|
wenzelm@30845
|
3937 |
* Simplifier: simproc for let expressions now unfolds if bound
|
wenzelm@30845
|
3938 |
variable occurs at most once in let expression body. INCOMPATIBILITY.
|
wenzelm@30845
|
3939 |
|
wenzelm@30845
|
3940 |
* Method "arith": Linear arithmetic now ignores all inequalities when
|
wenzelm@30845
|
3941 |
fast_arith_neq_limit is exceeded, instead of giving up entirely.
|
wenzelm@30845
|
3942 |
|
wenzelm@30845
|
3943 |
* New attribute "arith" for facts that should always be used
|
wenzelm@30845
|
3944 |
automatically by arithmetic. It is intended to be used locally in
|
wenzelm@30845
|
3945 |
proofs, e.g.
|
wenzelm@30845
|
3946 |
|
wenzelm@30845
|
3947 |
assumes [arith]: "x > 0"
|
wenzelm@30845
|
3948 |
|
nipkow@30702
|
3949 |
Global usage is discouraged because of possible performance impact.
|
nipkow@30702
|
3950 |
|
wenzelm@30845
|
3951 |
* New classes "top" and "bot" with corresponding operations "top" and
|
wenzelm@30845
|
3952 |
"bot" in theory Orderings; instantiation of class "complete_lattice"
|
wenzelm@30845
|
3953 |
requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
|
wenzelm@30845
|
3954 |
|
wenzelm@30845
|
3955 |
* Changed definition lemma "less_fun_def" in order to provide an
|
wenzelm@30845
|
3956 |
instance for preorders on functions; use lemma "less_le" instead.
|
wenzelm@30845
|
3957 |
INCOMPATIBILITY.
|
wenzelm@30845
|
3958 |
|
wenzelm@30845
|
3959 |
* Theory Orderings: class "wellorder" moved here, with explicit
|
wenzelm@30845
|
3960 |
induction rule "less_induct" as assumption. For instantiation of
|
wenzelm@30845
|
3961 |
"wellorder" by means of predicate "wf", use rule wf_wellorderI.
|
wenzelm@30845
|
3962 |
INCOMPATIBILITY.
|
wenzelm@30845
|
3963 |
|
wenzelm@30845
|
3964 |
* Theory Orderings: added class "preorder" as superclass of "order".
|
wenzelm@27793
|
3965 |
INCOMPATIBILITY: Instantiation proofs for order, linorder
|
wenzelm@27793
|
3966 |
etc. slightly changed. Some theorems named order_class.* now named
|
wenzelm@27793
|
3967 |
preorder_class.*.
|
wenzelm@27793
|
3968 |
|
wenzelm@30845
|
3969 |
* Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
|
wenzelm@30845
|
3970 |
"diag" to "Id_on".
|
wenzelm@30845
|
3971 |
|
wenzelm@30845
|
3972 |
* Theory Finite_Set: added a new fold combinator of type
|
wenzelm@30845
|
3973 |
|
nipkow@28855
|
3974 |
('a => 'b => 'b) => 'b => 'a set => 'b
|
wenzelm@30845
|
3975 |
|
wenzelm@30845
|
3976 |
Occasionally this is more convenient than the old fold combinator
|
wenzelm@30845
|
3977 |
which is now defined in terms of the new one and renamed to
|
wenzelm@30845
|
3978 |
fold_image.
|
wenzelm@30845
|
3979 |
|
wenzelm@30845
|
3980 |
* Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
|
wenzelm@30845
|
3981 |
and "ring_simps" have been replaced by "algebra_simps" (which can be
|
wenzelm@30845
|
3982 |
extended with further lemmas!). At the moment both still exist but
|
wenzelm@30845
|
3983 |
the former will disappear at some point.
|
wenzelm@30845
|
3984 |
|
wenzelm@30845
|
3985 |
* Theory Power: Lemma power_Suc is now declared as a simp rule in
|
wenzelm@30845
|
3986 |
class recpower. Type-specific simp rules for various recpower types
|
wenzelm@30845
|
3987 |
have been removed. INCOMPATIBILITY, rename old lemmas as follows:
|
huffman@30269
|
3988 |
|
huffman@30269
|
3989 |
rat_power_0 -> power_0
|
huffman@30269
|
3990 |
rat_power_Suc -> power_Suc
|
huffman@30269
|
3991 |
realpow_0 -> power_0
|
huffman@30269
|
3992 |
realpow_Suc -> power_Suc
|
huffman@30269
|
3993 |
complexpow_0 -> power_0
|
huffman@30269
|
3994 |
complexpow_Suc -> power_Suc
|
huffman@30269
|
3995 |
power_poly_0 -> power_0
|
huffman@30269
|
3996 |
power_poly_Suc -> power_Suc
|
huffman@30269
|
3997 |
|
wenzelm@30845
|
3998 |
* Theories Ring_and_Field and Divides: Definition of "op dvd" has been
|
wenzelm@27793
|
3999 |
moved to separate class dvd in Ring_and_Field; a couple of lemmas on
|
wenzelm@27793
|
4000 |
dvd has been generalized to class comm_semiring_1. Likewise a bunch
|
wenzelm@27793
|
4001 |
of lemmas from Divides has been generalized from nat to class
|
wenzelm@27793
|
4002 |
semiring_div. INCOMPATIBILITY. This involves the following theorem
|
wenzelm@27793
|
4003 |
renames resulting from duplicate elimination:
|
haftmann@27651
|
4004 |
|
haftmann@27651
|
4005 |
dvd_def_mod ~> dvd_eq_mod_eq_0
|
haftmann@27651
|
4006 |
zero_dvd_iff ~> dvd_0_left_iff
|
haftmann@28559
|
4007 |
dvd_0 ~> dvd_0_right
|
haftmann@27651
|
4008 |
DIVISION_BY_ZERO_DIV ~> div_by_0
|
haftmann@27651
|
4009 |
DIVISION_BY_ZERO_MOD ~> mod_by_0
|
haftmann@27651
|
4010 |
mult_div ~> div_mult_self2_is_id
|
haftmann@27651
|
4011 |
mult_mod ~> mod_mult_self2_is_0
|
haftmann@27651
|
4012 |
|
wenzelm@30845
|
4013 |
* Theory IntDiv: removed many lemmas that are instances of class-based
|
wenzelm@30845
|
4014 |
generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
|
wenzelm@30845
|
4015 |
rename old lemmas as follows:
|
nipkow@29981
|
4016 |
|
nipkow@29981
|
4017 |
dvd_diff -> nat_dvd_diff
|
nipkow@29981
|
4018 |
dvd_zminus_iff -> dvd_minus_iff
|
nipkow@30208
|
4019 |
mod_add1_eq -> mod_add_eq
|
nipkow@30208
|
4020 |
mod_mult1_eq -> mod_mult_right_eq
|
nipkow@30208
|
4021 |
mod_mult1_eq' -> mod_mult_left_eq
|
nipkow@30208
|
4022 |
mod_mult_distrib_mod -> mod_mult_eq
|
nipkow@29981
|
4023 |
nat_mod_add_left_eq -> mod_add_left_eq
|
nipkow@29981
|
4024 |
nat_mod_add_right_eq -> mod_add_right_eq
|
nipkow@29981
|
4025 |
nat_mod_div_trivial -> mod_div_trivial
|
nipkow@29981
|
4026 |
nat_mod_mod_trivial -> mod_mod_trivial
|
nipkow@29981
|
4027 |
zdiv_zadd_self1 -> div_add_self1
|
nipkow@29981
|
4028 |
zdiv_zadd_self2 -> div_add_self2
|
nipkow@30181
|
4029 |
zdiv_zmult_self1 -> div_mult_self2_is_id
|
nipkow@29981
|
4030 |
zdiv_zmult_self2 -> div_mult_self1_is_id
|
nipkow@29981
|
4031 |
zdvd_triv_left -> dvd_triv_left
|
nipkow@29981
|
4032 |
zdvd_triv_right -> dvd_triv_right
|
nipkow@29981
|
4033 |
zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
|
nipkow@30022
|
4034 |
zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
|
nipkow@29981
|
4035 |
zmod_zadd_left_eq -> mod_add_left_eq
|
nipkow@29981
|
4036 |
zmod_zadd_right_eq -> mod_add_right_eq
|
nipkow@29981
|
4037 |
zmod_zadd_self1 -> mod_add_self1
|
nipkow@29981
|
4038 |
zmod_zadd_self2 -> mod_add_self2
|
nipkow@30208
|
4039 |
zmod_zadd1_eq -> mod_add_eq
|
nipkow@29981
|
4040 |
zmod_zdiff1_eq -> mod_diff_eq
|
nipkow@29981
|
4041 |
zmod_zdvd_zmod -> mod_mod_cancel
|
nipkow@29981
|
4042 |
zmod_zmod_cancel -> mod_mod_cancel
|
nipkow@29981
|
4043 |
zmod_zmult_self1 -> mod_mult_self2_is_0
|
nipkow@29981
|
4044 |
zmod_zmult_self2 -> mod_mult_self1_is_0
|
nipkow@29981
|
4045 |
zmod_1 -> mod_by_1
|
nipkow@29981
|
4046 |
zdiv_1 -> div_by_1
|
nipkow@29981
|
4047 |
zdvd_abs1 -> abs_dvd_iff
|
nipkow@29981
|
4048 |
zdvd_abs2 -> dvd_abs_iff
|
nipkow@29981
|
4049 |
zdvd_refl -> dvd_refl
|
nipkow@29981
|
4050 |
zdvd_trans -> dvd_trans
|
nipkow@29981
|
4051 |
zdvd_zadd -> dvd_add
|
nipkow@29981
|
4052 |
zdvd_zdiff -> dvd_diff
|
nipkow@29981
|
4053 |
zdvd_zminus_iff -> dvd_minus_iff
|
nipkow@29981
|
4054 |
zdvd_zminus2_iff -> minus_dvd_iff
|
nipkow@29981
|
4055 |
zdvd_zmultD -> dvd_mult_right
|
nipkow@29981
|
4056 |
zdvd_zmultD2 -> dvd_mult_left
|
nipkow@29981
|
4057 |
zdvd_zmult_mono -> mult_dvd_mono
|
nipkow@29981
|
4058 |
zdvd_0_right -> dvd_0_right
|
nipkow@29981
|
4059 |
zdvd_0_left -> dvd_0_left_iff
|
nipkow@29981
|
4060 |
zdvd_1_left -> one_dvd
|
nipkow@29981
|
4061 |
zminus_dvd_iff -> minus_dvd_iff
|
nipkow@29981
|
4062 |
|
wenzelm@30845
|
4063 |
* Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
|
wenzelm@30845
|
4064 |
|
wenzelm@30845
|
4065 |
* The real numbers offer decimal input syntax: 12.34 is translated
|
wenzelm@30845
|
4066 |
into 1234/10^2. This translation is not reversed upon output.
|
wenzelm@30845
|
4067 |
|
wenzelm@30845
|
4068 |
* Theory Library/Polynomial defines an abstract type 'a poly of
|
wenzelm@30845
|
4069 |
univariate polynomials with coefficients of type 'a. In addition to
|
wenzelm@30845
|
4070 |
the standard ring operations, it also supports div and mod. Code
|
wenzelm@30845
|
4071 |
generation is also supported, using list-style constructors.
|
wenzelm@30845
|
4072 |
|
wenzelm@30845
|
4073 |
* Theory Library/Inner_Product defines a class of real_inner for real
|
wenzelm@30845
|
4074 |
inner product spaces, with an overloaded operation inner :: 'a => 'a
|
wenzelm@30845
|
4075 |
=> real. Class real_inner is a subclass of real_normed_vector from
|
wenzelm@30845
|
4076 |
theory RealVector.
|
wenzelm@30845
|
4077 |
|
wenzelm@30845
|
4078 |
* Theory Library/Product_Vector provides instances for the product
|
wenzelm@30845
|
4079 |
type 'a * 'b of several classes from RealVector and Inner_Product.
|
wenzelm@30845
|
4080 |
Definitions of addition, subtraction, scalar multiplication, norms,
|
wenzelm@30845
|
4081 |
and inner products are included.
|
wenzelm@30845
|
4082 |
|
wenzelm@30845
|
4083 |
* Theory Library/Bit defines the field "bit" of integers modulo 2. In
|
wenzelm@30845
|
4084 |
addition to the field operations, numerals and case syntax are also
|
wenzelm@30845
|
4085 |
supported.
|
wenzelm@30845
|
4086 |
|
wenzelm@30845
|
4087 |
* Theory Library/Diagonalize provides constructive version of Cantor's
|
wenzelm@30845
|
4088 |
first diagonalization argument.
|
wenzelm@30845
|
4089 |
|
wenzelm@30845
|
4090 |
* Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
|
haftmann@27651
|
4091 |
zlcm (for int); carried together from various gcd/lcm developements in
|
wenzelm@30845
|
4092 |
the HOL Distribution. Constants zgcd and zlcm replace former igcd and
|
wenzelm@30845
|
4093 |
ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
|
wenzelm@30845
|
4094 |
may recover tupled syntax as follows:
|
haftmann@27651
|
4095 |
|
haftmann@27651
|
4096 |
hide (open) const gcd
|
haftmann@27651
|
4097 |
abbreviation gcd where
|
haftmann@27651
|
4098 |
"gcd == (%(a, b). GCD.gcd a b)"
|
haftmann@27651
|
4099 |
notation (output)
|
haftmann@27651
|
4100 |
GCD.gcd ("gcd '(_, _')")
|
haftmann@27651
|
4101 |
|
wenzelm@30845
|
4102 |
The same works for lcm, zgcd, zlcm.
|
wenzelm@30845
|
4103 |
|
wenzelm@30845
|
4104 |
* Theory Library/Nat_Infinity: added addition, numeral syntax and more
|
wenzelm@30845
|
4105 |
instantiations for algebraic structures. Removed some duplicate
|
wenzelm@30845
|
4106 |
theorems. Changes in simp rules. INCOMPATIBILITY.
|
wenzelm@30845
|
4107 |
|
wenzelm@30845
|
4108 |
* ML antiquotation @{code} takes a constant as argument and generates
|
wenzelm@27519
|
4109 |
corresponding code in background and inserts name of the corresponding
|
wenzelm@27519
|
4110 |
resulting ML value/function/datatype constructor binding in place.
|
wenzelm@27519
|
4111 |
All occurrences of @{code} with a single ML block are generated
|
wenzelm@27519
|
4112 |
simultaneously. Provides a generic and safe interface for
|
wenzelm@30845
|
4113 |
instrumentalizing code generation. See
|
wenzelm@30845
|
4114 |
src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
|
wenzelm@30845
|
4115 |
In future you ought to refrain from ad-hoc compiling generated SML
|
wenzelm@30845
|
4116 |
code on the ML toplevel. Note that (for technical reasons) @{code}
|
wenzelm@30845
|
4117 |
cannot refer to constants for which user-defined serializations are
|
wenzelm@30845
|
4118 |
set. Refer to the corresponding ML counterpart directly in that
|
wenzelm@30845
|
4119 |
cases.
|
wenzelm@27122
|
4120 |
|
wenzelm@27122
|
4121 |
* Command 'rep_datatype': instead of theorem names the command now
|
wenzelm@27122
|
4122 |
takes a list of terms denoting the constructors of the type to be
|
wenzelm@27122
|
4123 |
represented as datatype. The characteristic theorems have to be
|
wenzelm@27122
|
4124 |
proven. INCOMPATIBILITY. Also observe that the following theorems
|
wenzelm@27122
|
4125 |
have disappeared in favour of existing ones:
|
wenzelm@27122
|
4126 |
|
haftmann@27104
|
4127 |
unit_induct ~> unit.induct
|
haftmann@27104
|
4128 |
prod_induct ~> prod.induct
|
haftmann@27104
|
4129 |
sum_induct ~> sum.induct
|
haftmann@27104
|
4130 |
Suc_Suc_eq ~> nat.inject
|
haftmann@27104
|
4131 |
Suc_not_Zero Zero_not_Suc ~> nat.distinct
|
haftmann@27104
|
4132 |
|
haftmann@27104
|
4133 |
|
ballarin@27696
|
4134 |
*** HOL-Algebra ***
|
ballarin@27696
|
4135 |
|
ballarin@27713
|
4136 |
* New locales for orders and lattices where the equivalence relation
|
wenzelm@30106
|
4137 |
is not restricted to equality. INCOMPATIBILITY: all order and lattice
|
wenzelm@30106
|
4138 |
locales use a record structure with field eq for the equivalence.
|
ballarin@27713
|
4139 |
|
ballarin@27713
|
4140 |
* New theory of factorial domains.
|
ballarin@27713
|
4141 |
|
wenzelm@30845
|
4142 |
* Units_l_inv and Units_r_inv are now simp rules by default.
|
ballarin@27696
|
4143 |
INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
|
ballarin@27696
|
4144 |
and/or r_inv will now also require deletion of these lemmas.
|
ballarin@27696
|
4145 |
|
wenzelm@30845
|
4146 |
* Renamed the following theorems, INCOMPATIBILITY:
|
wenzelm@30845
|
4147 |
|
ballarin@27696
|
4148 |
UpperD ~> Upper_memD
|
ballarin@27696
|
4149 |
LowerD ~> Lower_memD
|
ballarin@27696
|
4150 |
least_carrier ~> least_closed
|
ballarin@27696
|
4151 |
greatest_carrier ~> greatest_closed
|
ballarin@27696
|
4152 |
greatest_Lower_above ~> greatest_Lower_below
|
ballarin@27717
|
4153 |
one_zero ~> carrier_one_zero
|
ballarin@27717
|
4154 |
one_not_zero ~> carrier_one_not_zero (collision with assumption)
|
ballarin@27696
|
4155 |
|
wenzelm@27793
|
4156 |
|
wenzelm@30849
|
4157 |
*** HOL-Nominal ***
|
wenzelm@30849
|
4158 |
|
wenzelm@30855
|
4159 |
* Nominal datatypes can now contain type-variables.
|
wenzelm@30855
|
4160 |
|
wenzelm@30855
|
4161 |
* Commands 'nominal_inductive' and 'equivariance' work with local
|
wenzelm@30855
|
4162 |
theory targets.
|
wenzelm@30855
|
4163 |
|
wenzelm@30855
|
4164 |
* Nominal primrec can now works with local theory targets and its
|
wenzelm@30855
|
4165 |
specification syntax now conforms to the general format as seen in
|
wenzelm@30855
|
4166 |
'inductive' etc.
|
wenzelm@30855
|
4167 |
|
wenzelm@30855
|
4168 |
* Method "perm_simp" honours the standard simplifier attributes
|
wenzelm@30855
|
4169 |
(no_asm), (no_asm_use) etc.
|
wenzelm@30855
|
4170 |
|
wenzelm@30855
|
4171 |
* The new predicate #* is defined like freshness, except that on the
|
wenzelm@30855
|
4172 |
left hand side can be a set or list of atoms.
|
wenzelm@30855
|
4173 |
|
wenzelm@30855
|
4174 |
* Experimental command 'nominal_inductive2' derives strong induction
|
wenzelm@30855
|
4175 |
principles for inductive definitions. In contrast to
|
wenzelm@30855
|
4176 |
'nominal_inductive', which can only deal with a fixed number of
|
wenzelm@30855
|
4177 |
binders, it can deal with arbitrary expressions standing for sets of
|
wenzelm@30855
|
4178 |
atoms to be avoided. The only inductive definition we have at the
|
wenzelm@30855
|
4179 |
moment that needs this generalisation is the typing rule for Lets in
|
wenzelm@30855
|
4180 |
the algorithm W:
|
wenzelm@30855
|
4181 |
|
wenzelm@30855
|
4182 |
Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
|
wenzelm@30855
|
4183 |
-----------------------------------------------------------------
|
wenzelm@30855
|
4184 |
Gamma |- Let x be t1 in t2 : T2
|
wenzelm@30855
|
4185 |
|
wenzelm@30855
|
4186 |
In this rule one wants to avoid all the binders that are introduced by
|
wenzelm@30855
|
4187 |
"close Gamma T1". We are looking for other examples where this
|
wenzelm@30855
|
4188 |
feature might be useful. Please let us know.
|
wenzelm@30849
|
4189 |
|
wenzelm@30849
|
4190 |
|
huffman@30173
|
4191 |
*** HOLCF ***
|
huffman@30173
|
4192 |
|
huffman@30173
|
4193 |
* Reimplemented the simplification procedure for proving continuity
|
huffman@30173
|
4194 |
subgoals. The new simproc is extensible; users can declare additional
|
huffman@30173
|
4195 |
continuity introduction rules with the attribute [cont2cont].
|
huffman@30173
|
4196 |
|
huffman@30173
|
4197 |
* The continuity simproc now uses a different introduction rule for
|
huffman@30173
|
4198 |
solving continuity subgoals on terms with lambda abstractions. In
|
huffman@30173
|
4199 |
some rare cases the new simproc may fail to solve subgoals that the
|
huffman@30173
|
4200 |
old one could solve, and "simp add: cont2cont_LAM" may be necessary.
|
huffman@30173
|
4201 |
Potential INCOMPATIBILITY.
|
huffman@30173
|
4202 |
|
wenzelm@30847
|
4203 |
* Command 'fixrec': specification syntax now conforms to the general
|
wenzelm@30855
|
4204 |
format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
|
wenzelm@30855
|
4205 |
examples. INCOMPATIBILITY.
|
wenzelm@30845
|
4206 |
|
wenzelm@30845
|
4207 |
|
wenzelm@30845
|
4208 |
*** ZF ***
|
wenzelm@30845
|
4209 |
|
wenzelm@30845
|
4210 |
* Proof of Zorn's Lemma for partial orders.
|
huffman@30173
|
4211 |
|
huffman@30173
|
4212 |
|
wenzelm@27246
|
4213 |
*** ML ***
|
wenzelm@28088
|
4214 |
|
wenzelm@30845
|
4215 |
* Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
|
wenzelm@30845
|
4216 |
Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
|
wenzelm@30845
|
4217 |
depends on multithreading, so timouts will not work before Poly/ML
|
wenzelm@30845
|
4218 |
5.2.1!
|
wenzelm@30845
|
4219 |
|
wenzelm@29161
|
4220 |
* High-level support for concurrent ML programming, see
|
wenzelm@29161
|
4221 |
src/Pure/Cuncurrent. The data-oriented model of "future values" is
|
wenzelm@29161
|
4222 |
particularly convenient to organize independent functional
|
wenzelm@29161
|
4223 |
computations. The concept of "synchronized variables" provides a
|
wenzelm@29161
|
4224 |
higher-order interface for components with shared state, avoiding the
|
wenzelm@30845
|
4225 |
delicate details of mutexes and condition variables. (Requires
|
wenzelm@30845
|
4226 |
Poly/ML 5.2.1 or later.)
|
wenzelm@30845
|
4227 |
|
wenzelm@30845
|
4228 |
* ML bindings produced via Isar commands are stored within the Isar
|
wenzelm@30845
|
4229 |
context (theory or proof). Consequently, commands like 'use' and 'ML'
|
wenzelm@30845
|
4230 |
become thread-safe and work with undo as expected (concerning
|
wenzelm@30845
|
4231 |
top-level bindings, not side-effects on global references).
|
wenzelm@30845
|
4232 |
INCOMPATIBILITY, need to provide proper Isar context when invoking the
|
wenzelm@30845
|
4233 |
compiler at runtime; really global bindings need to be given outside a
|
wenzelm@30845
|
4234 |
theory. (Requires Poly/ML 5.2 or later.)
|
wenzelm@30845
|
4235 |
|
wenzelm@30845
|
4236 |
* Command 'ML_prf' is analogous to 'ML' but works within a proof
|
wenzelm@30845
|
4237 |
context. Top-level ML bindings are stored within the proof context in
|
wenzelm@30845
|
4238 |
a purely sequential fashion, disregarding the nested proof structure.
|
wenzelm@30845
|
4239 |
ML bindings introduced by 'ML_prf' are discarded at the end of the
|
wenzelm@30845
|
4240 |
proof. (Requires Poly/ML 5.2 or later.)
|
wenzelm@29161
|
4241 |
|
wenzelm@30532
|
4242 |
* Simplified ML attribute and method setup, cf. functions Attrib.setup
|
wenzelm@30845
|
4243 |
and Method.setup, as well as Isar commands 'attribute_setup' and
|
wenzelm@30547
|
4244 |
'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
|
wenzelm@30547
|
4245 |
existing code accordingly, or use plain 'setup' together with old
|
wenzelm@30547
|
4246 |
Method.add_method.
|
wenzelm@30532
|
4247 |
|
wenzelm@28294
|
4248 |
* Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
|
wenzelm@28294
|
4249 |
to 'a -> thm, while results are always tagged with an authentic oracle
|
wenzelm@28294
|
4250 |
name. The Isar command 'oracle' is now polymorphic, no argument type
|
wenzelm@28294
|
4251 |
is specified. INCOMPATIBILITY, need to simplify existing oracle code
|
wenzelm@28294
|
4252 |
accordingly. Note that extra performance may be gained by producing
|
wenzelm@28294
|
4253 |
the cterm carefully, avoiding slow Thm.cterm_of.
|
wenzelm@28294
|
4254 |
|
wenzelm@30845
|
4255 |
* Simplified interface for defining document antiquotations via
|
wenzelm@30845
|
4256 |
ThyOutput.antiquotation, ThyOutput.output, and optionally
|
wenzelm@30845
|
4257 |
ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
|
wenzelm@30845
|
4258 |
antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
|
wenzelm@30845
|
4259 |
examples.
|
wenzelm@28099
|
4260 |
|
wenzelm@30395
|
4261 |
* More systematic treatment of long names, abstract name bindings, and
|
wenzelm@30395
|
4262 |
name space operations. Basic operations on qualified names have been
|
wenzelm@30399
|
4263 |
move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
|
wenzelm@30395
|
4264 |
Long_Name.append. Old type bstring has been mostly replaced by
|
wenzelm@30395
|
4265 |
abstract type binding (see structure Binding), which supports precise
|
wenzelm@30845
|
4266 |
qualification by packages and local theory targets, as well as proper
|
wenzelm@30845
|
4267 |
tracking of source positions. INCOMPATIBILITY, need to wrap old
|
wenzelm@30845
|
4268 |
bstring values into Binding.name, or better pass through abstract
|
wenzelm@30399
|
4269 |
bindings everywhere. See further src/Pure/General/long_name.ML,
|
wenzelm@30395
|
4270 |
src/Pure/General/binding.ML and src/Pure/General/name_space.ML
|
wenzelm@30395
|
4271 |
|
wenzelm@28089
|
4272 |
* Result facts (from PureThy.note_thms, ProofContext.note_thms,
|
wenzelm@28089
|
4273 |
LocalTheory.note etc.) now refer to the *full* internal name, not the
|
wenzelm@28089
|
4274 |
bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
|
wenzelm@28089
|
4275 |
|
wenzelm@27287
|
4276 |
* Disposed old type and term read functions (Sign.read_def_typ,
|
wenzelm@27287
|
4277 |
Sign.read_typ, Sign.read_def_terms, Sign.read_term,
|
wenzelm@27287
|
4278 |
Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
|
wenzelm@27287
|
4279 |
use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
|
wenzelm@27269
|
4280 |
Syntax.read_term_global etc.; see also OldGoals.read_term as last
|
wenzelm@27269
|
4281 |
resort for legacy applications.
|
wenzelm@27269
|
4282 |
|
wenzelm@30609
|
4283 |
* Disposed old declarations, tactics, tactic combinators that refer to
|
wenzelm@30609
|
4284 |
the simpset or claset of an implicit theory (such as Addsimps,
|
wenzelm@30609
|
4285 |
Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
|
wenzelm@30609
|
4286 |
embedded ML text, or local_simpset_of with a proper context passed as
|
wenzelm@30609
|
4287 |
explicit runtime argument.
|
wenzelm@30609
|
4288 |
|
wenzelm@30845
|
4289 |
* Rules and tactics that read instantiations (read_instantiate,
|
wenzelm@30845
|
4290 |
res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
|
wenzelm@30845
|
4291 |
context, which is required for parsing and type-checking. Moreover,
|
wenzelm@30845
|
4292 |
the variables are specified as plain indexnames, not string encodings
|
wenzelm@30845
|
4293 |
thereof. INCOMPATIBILITY.
|
wenzelm@30845
|
4294 |
|
wenzelm@30845
|
4295 |
* Generic Toplevel.add_hook interface allows to analyze the result of
|
wenzelm@30845
|
4296 |
transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
|
wenzelm@30845
|
4297 |
for theorem dependency output of transactions resulting in a new
|
wenzelm@30845
|
4298 |
theory state.
|
wenzelm@30845
|
4299 |
|
wenzelm@30845
|
4300 |
* ML antiquotations: block-structured compilation context indicated by
|
wenzelm@27391
|
4301 |
\<lbrace> ... \<rbrace>; additional antiquotation forms:
|
wenzelm@27391
|
4302 |
|
wenzelm@30845
|
4303 |
@{binding name} - basic name binding
|
wenzelm@27519
|
4304 |
@{let ?pat = term} - term abbreviation (HO matching)
|
wenzelm@27519
|
4305 |
@{note name = fact} - fact abbreviation
|
wenzelm@27519
|
4306 |
@{thm fact} - singleton fact (with attributes)
|
wenzelm@27519
|
4307 |
@{thms fact} - general fact (with attributes)
|
wenzelm@27519
|
4308 |
@{lemma prop by method} - singleton goal
|
wenzelm@27519
|
4309 |
@{lemma prop by meth1 meth2} - singleton goal
|
wenzelm@27519
|
4310 |
@{lemma prop1 ... propN by method} - general goal
|
wenzelm@27519
|
4311 |
@{lemma prop1 ... propN by meth1 meth2} - general goal
|
wenzelm@27519
|
4312 |
@{lemma (open) ...} - open derivation
|
wenzelm@27380
|
4313 |
|
wenzelm@27246
|
4314 |
|
wenzelm@27979
|
4315 |
*** System ***
|
wenzelm@27979
|
4316 |
|
wenzelm@28248
|
4317 |
* The Isabelle "emacs" tool provides a specific interface to invoke
|
wenzelm@28248
|
4318 |
Proof General / Emacs, with more explicit failure if that is not
|
wenzelm@28248
|
4319 |
installed (the old isabelle-interface script silently falls back on
|
wenzelm@28248
|
4320 |
isabelle-process). The PROOFGENERAL_HOME setting determines the
|
wenzelm@28248
|
4321 |
installation location of the Proof General distribution.
|
wenzelm@28248
|
4322 |
|
wenzelm@27979
|
4323 |
* Isabelle/lib/classes/Pure.jar provides basic support to integrate
|
wenzelm@27979
|
4324 |
the Isabelle process into a JVM/Scala application. See
|
wenzelm@27979
|
4325 |
Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
|
wenzelm@27979
|
4326 |
process wrapper has been discontinued.)
|
wenzelm@27979
|
4327 |
|
wenzelm@30845
|
4328 |
* Added homegrown Isabelle font with unicode layout, see lib/fonts.
|
wenzelm@30845
|
4329 |
|
wenzelm@30845
|
4330 |
* Various status messages (with exact source position information) are
|
wenzelm@27979
|
4331 |
emitted, if proper markup print mode is enabled. This allows
|
wenzelm@27979
|
4332 |
user-interface components to provide detailed feedback on internal
|
wenzelm@27979
|
4333 |
prover operations.
|
wenzelm@27979
|
4334 |
|
wenzelm@27979
|
4335 |
|
wenzelm@27143
|
4336 |
|
wenzelm@27008
|
4337 |
New in Isabelle2008 (June 2008)
|
wenzelm@27008
|
4338 |
-------------------------------
|
wenzelm@25464
|
4339 |
|
wenzelm@25522
|
4340 |
*** General ***
|
wenzelm@25522
|
4341 |
|
wenzelm@27061
|
4342 |
* The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
|
wenzelm@27061
|
4343 |
and updated, with formally checked references as hyperlinks.
|
wenzelm@27061
|
4344 |
|
wenzelm@25994
|
4345 |
* Theory loader: use_thy (and similar operations) no longer set the
|
wenzelm@25994
|
4346 |
implicit ML context, which was occasionally hard to predict and in
|
wenzelm@25994
|
4347 |
conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
|
wenzelm@25994
|
4348 |
provides a proper context already.
|
wenzelm@25994
|
4349 |
|
wenzelm@26323
|
4350 |
* Theory loader: old-style ML proof scripts being *attached* to a thy
|
wenzelm@26323
|
4351 |
file are no longer supported. INCOMPATIBILITY, regular 'uses' and
|
wenzelm@26323
|
4352 |
'use' within a theory file will do the job.
|
wenzelm@26323
|
4353 |
|
wenzelm@26650
|
4354 |
* Name space merge now observes canonical order, i.e. the second space
|
wenzelm@26650
|
4355 |
is inserted into the first one, while existing entries in the first
|
wenzelm@26659
|
4356 |
space take precedence. INCOMPATIBILITY in rare situations, may try to
|
wenzelm@26650
|
4357 |
swap theory imports.
|
wenzelm@26650
|
4358 |
|
wenzelm@27067
|
4359 |
* Syntax: symbol \<chi> is now considered a letter. Potential
|
wenzelm@27067
|
4360 |
INCOMPATIBILITY in identifier syntax etc.
|
wenzelm@27067
|
4361 |
|
wenzelm@27067
|
4362 |
* Outer syntax: string tokens no longer admit escaped white space,
|
wenzelm@27067
|
4363 |
which was an accidental (undocumented) feature. INCOMPATIBILITY, use
|
wenzelm@27067
|
4364 |
white space without escapes.
|
wenzelm@27067
|
4365 |
|
wenzelm@27067
|
4366 |
* Outer syntax: string tokens may contain arbitrary character codes
|
wenzelm@27067
|
4367 |
specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
|
wenzelm@27067
|
4368 |
"foo_bar".
|
wenzelm@27067
|
4369 |
|
wenzelm@25522
|
4370 |
|
haftmann@25502
|
4371 |
*** Pure ***
|
haftmann@25502
|
4372 |
|
wenzelm@26718
|
4373 |
* Context-dependent token translations. Default setup reverts locally
|
wenzelm@26718
|
4374 |
fixed variables, and adds hilite markup for undeclared frees.
|
wenzelm@26718
|
4375 |
|
berghofe@26681
|
4376 |
* Unused theorems can be found using the new command 'unused_thms'.
|
berghofe@26681
|
4377 |
There are three ways of invoking it:
|
berghofe@26681
|
4378 |
|
berghofe@26681
|
4379 |
(1) unused_thms
|
berghofe@26681
|
4380 |
Only finds unused theorems in the current theory.
|
berghofe@26681
|
4381 |
|
berghofe@26681
|
4382 |
(2) unused_thms thy_1 ... thy_n -
|
berghofe@26681
|
4383 |
Finds unused theorems in the current theory and all of its ancestors,
|
berghofe@26681
|
4384 |
excluding the theories thy_1 ... thy_n and all of their ancestors.
|
berghofe@26681
|
4385 |
|
berghofe@26681
|
4386 |
(3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
|
berghofe@26681
|
4387 |
Finds unused theorems in the theories thy'_1 ... thy'_m and all of
|
berghofe@26681
|
4388 |
their ancestors, excluding the theories thy_1 ... thy_n and all of
|
berghofe@26681
|
4389 |
their ancestors.
|
berghofe@26681
|
4390 |
|
wenzelm@26718
|
4391 |
In order to increase the readability of the list produced by
|
wenzelm@26718
|
4392 |
unused_thms, theorems that have been created by a particular instance
|
wenzelm@26874
|
4393 |
of a theory command such as 'inductive' or 'function' are considered
|
wenzelm@26874
|
4394 |
to belong to the same "group", meaning that if at least one theorem in
|
wenzelm@26718
|
4395 |
this group is used, the other theorems in the same group are no longer
|
wenzelm@26718
|
4396 |
reported as unused. Moreover, if all theorems in the group are
|
wenzelm@26718
|
4397 |
unused, only one theorem in the group is displayed.
|
wenzelm@26718
|
4398 |
|
wenzelm@26718
|
4399 |
Note that proof objects have to be switched on in order for
|
wenzelm@26718
|
4400 |
unused_thms to work properly (i.e. !proofs must be >= 1, which is
|
wenzelm@26874
|
4401 |
usually the case when using Proof General with the default settings).
|
berghofe@26681
|
4402 |
|
wenzelm@26650
|
4403 |
* Authentic naming of facts disallows ad-hoc overwriting of previous
|
wenzelm@26650
|
4404 |
theorems within the same name space. INCOMPATIBILITY, need to remove
|
wenzelm@26650
|
4405 |
duplicate fact bindings, or even accidental fact duplications. Note
|
wenzelm@26650
|
4406 |
that tools may maintain dynamically scoped facts systematically, using
|
wenzelm@26650
|
4407 |
PureThy.add_thms_dynamic.
|
wenzelm@26650
|
4408 |
|
wenzelm@26660
|
4409 |
* Command 'hide' now allows to hide from "fact" name space as well.
|
wenzelm@26660
|
4410 |
|
wenzelm@26496
|
4411 |
* Eliminated destructive theorem database, simpset, claset, and
|
wenzelm@26496
|
4412 |
clasimpset. Potential INCOMPATIBILITY, really need to observe linear
|
wenzelm@26496
|
4413 |
update of theories within ML code.
|
wenzelm@26479
|
4414 |
|
wenzelm@26955
|
4415 |
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
|
wenzelm@26955
|
4416 |
INCOMPATIBILITY, object-logics depending on former Pure require
|
wenzelm@26955
|
4417 |
additional setup PureThy.old_appl_syntax_setup; object-logics
|
wenzelm@26955
|
4418 |
depending on former CPure need to refer to Pure.
|
wenzelm@26650
|
4419 |
|
wenzelm@26495
|
4420 |
* Commands 'use' and 'ML' are now purely functional, operating on
|
wenzelm@26479
|
4421 |
theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
|
wenzelm@26479
|
4422 |
instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
|
wenzelm@26479
|
4423 |
INCOMPATIBILITY.
|
wenzelm@26479
|
4424 |
|
wenzelm@26874
|
4425 |
* Command 'setup': discontinued implicit version with ML reference.
|
wenzelm@26434
|
4426 |
|
wenzelm@25970
|
4427 |
* Instantiation target allows for simultaneous specification of class
|
wenzelm@25970
|
4428 |
instance operations together with an instantiation proof.
|
wenzelm@25970
|
4429 |
Type-checking phase allows to refer to class operations uniformly.
|
wenzelm@27067
|
4430 |
See src/HOL/Complex/Complex.thy for an Isar example and
|
wenzelm@27067
|
4431 |
src/HOL/Library/Eval.thy for an ML example.
|
haftmann@25502
|
4432 |
|
wenzelm@26201
|
4433 |
* Indexing of literal facts: be more serious about including only
|
wenzelm@26201
|
4434 |
facts from the visible specification/proof context, but not the
|
wenzelm@26201
|
4435 |
background context (locale etc.). Affects `prop` notation and method
|
wenzelm@26201
|
4436 |
"fact". INCOMPATIBILITY: need to name facts explicitly in rare
|
wenzelm@26201
|
4437 |
situations.
|
wenzelm@26201
|
4438 |
|
wenzelm@26925
|
4439 |
* Method "cases", "induct", "coinduct": removed obsolete/undocumented
|
wenzelm@26925
|
4440 |
"(open)" option, which used to expose internal bound variables to the
|
wenzelm@26925
|
4441 |
proof text.
|
wenzelm@26925
|
4442 |
|
wenzelm@26925
|
4443 |
* Isar statements: removed obsolete case "rule_context".
|
wenzelm@26925
|
4444 |
INCOMPATIBILITY, better use explicit fixes/assumes.
|
wenzelm@26925
|
4445 |
|
wenzelm@26874
|
4446 |
* Locale proofs: default proof step now includes 'unfold_locales';
|
wenzelm@26874
|
4447 |
hence 'proof' without argument may be used to unfold locale
|
wenzelm@26874
|
4448 |
predicates.
|
ballarin@26765
|
4449 |
|
ballarin@26765
|
4450 |
|
haftmann@26762
|
4451 |
*** Document preparation ***
|
haftmann@26762
|
4452 |
|
wenzelm@26914
|
4453 |
* Simplified pdfsetup.sty: color/hyperref is used unconditionally for
|
wenzelm@26914
|
4454 |
both pdf and dvi (hyperlinks usually work in xdvi as well); removed
|
wenzelm@26914
|
4455 |
obsolete thumbpdf setup (contemporary PDF viewers do this on the
|
wenzelm@26914
|
4456 |
spot); renamed link color from "darkblue" to "linkcolor" (default
|
wenzelm@26920
|
4457 |
value unchanged, can be redefined via \definecolor); no longer sets
|
wenzelm@26920
|
4458 |
"a4paper" option (unnecessary or even intrusive).
|
wenzelm@26914
|
4459 |
|
wenzelm@27008
|
4460 |
* Antiquotation @{lemma A method} proves proposition A by the given
|
wenzelm@27008
|
4461 |
method (either a method name or a method name plus (optional) method
|
wenzelm@27008
|
4462 |
arguments in parentheses) and prints A just like @{prop A}.
|
haftmann@26762
|
4463 |
|
haftmann@26762
|
4464 |
|
wenzelm@25464
|
4465 |
*** HOL ***
|
wenzelm@25464
|
4466 |
|
wenzelm@27067
|
4467 |
* New primrec package. Specification syntax conforms in style to
|
wenzelm@27067
|
4468 |
definition/function/.... No separate induction rule is provided. The
|
wenzelm@27067
|
4469 |
"primrec" command distinguishes old-style and new-style specifications
|
wenzelm@27067
|
4470 |
by syntax. The former primrec package is now named OldPrimrecPackage.
|
wenzelm@27067
|
4471 |
When adjusting theories, beware: constants stemming from new-style
|
wenzelm@27067
|
4472 |
primrec specifications have authentic syntax.
|
wenzelm@27067
|
4473 |
|
wenzelm@27067
|
4474 |
* Metis prover is now an order of magnitude faster, and also works
|
wenzelm@27067
|
4475 |
with multithreading.
|
wenzelm@27067
|
4476 |
|
wenzelm@27067
|
4477 |
* Metis: the maximum number of clauses that can be produced from a
|
wenzelm@27067
|
4478 |
theorem is now given by the attribute max_clauses. Theorems that
|
wenzelm@27067
|
4479 |
exceed this number are ignored, with a warning printed.
|
wenzelm@27067
|
4480 |
|
wenzelm@27067
|
4481 |
* Sledgehammer no longer produces structured proofs by default. To
|
wenzelm@27067
|
4482 |
enable, declare [[sledgehammer_full = true]]. Attributes
|
wenzelm@27067
|
4483 |
reconstruction_modulus, reconstruction_sorts renamed
|
wenzelm@27067
|
4484 |
sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
|
wenzelm@27067
|
4485 |
|
haftmann@27104
|
4486 |
* Method "induct_scheme" derives user-specified induction rules
|
wenzelm@27067
|
4487 |
from well-founded induction and completeness of patterns. This factors
|
wenzelm@27067
|
4488 |
out some operations that are done internally by the function package
|
wenzelm@27067
|
4489 |
and makes them available separately. See
|
wenzelm@27067
|
4490 |
src/HOL/ex/Induction_Scheme.thy for examples.
|
wenzelm@27067
|
4491 |
|
wenzelm@27067
|
4492 |
* More flexible generation of measure functions for termination
|
wenzelm@27067
|
4493 |
proofs: Measure functions can be declared by proving a rule of the
|
wenzelm@27067
|
4494 |
form "is_measure f" and giving it the [measure_function] attribute.
|
wenzelm@27067
|
4495 |
The "is_measure" predicate is logically meaningless (always true), and
|
wenzelm@27067
|
4496 |
just guides the heuristic. To find suitable measure functions, the
|
wenzelm@27067
|
4497 |
termination prover sets up the goal "is_measure ?f" of the appropriate
|
wenzelm@27067
|
4498 |
type and generates all solutions by prolog-style backwards proof using
|
wenzelm@27067
|
4499 |
the declared rules.
|
wenzelm@27067
|
4500 |
|
wenzelm@27067
|
4501 |
This setup also deals with rules like
|
wenzelm@27067
|
4502 |
|
wenzelm@27067
|
4503 |
"is_measure f ==> is_measure (list_size f)"
|
wenzelm@27067
|
4504 |
|
wenzelm@27067
|
4505 |
which accommodates nested datatypes that recurse through lists.
|
wenzelm@27067
|
4506 |
Similar rules are predeclared for products and option types.
|
wenzelm@27067
|
4507 |
|
berghofe@26964
|
4508 |
* Turned the type of sets "'a set" into an abbreviation for "'a => bool"
|
berghofe@26964
|
4509 |
|
berghofe@26964
|
4510 |
INCOMPATIBILITIES:
|
berghofe@26964
|
4511 |
|
wenzelm@27008
|
4512 |
- Definitions of overloaded constants on sets have to be replaced by
|
wenzelm@27008
|
4513 |
definitions on => and bool.
|
berghofe@26964
|
4514 |
|
berghofe@26964
|
4515 |
- Some definitions of overloaded operators on sets can now be proved
|
wenzelm@27008
|
4516 |
using the definitions of the operators on => and bool. Therefore,
|
wenzelm@27008
|
4517 |
the following theorems have been renamed:
|
berghofe@26964
|
4518 |
|
berghofe@26964
|
4519 |
subset_def -> subset_eq
|
berghofe@26964
|
4520 |
psubset_def -> psubset_eq
|
berghofe@26964
|
4521 |
set_diff_def -> set_diff_eq
|
berghofe@26964
|
4522 |
Compl_def -> Compl_eq
|
berghofe@26964
|
4523 |
Sup_set_def -> Sup_set_eq
|
berghofe@26964
|
4524 |
Inf_set_def -> Inf_set_eq
|
berghofe@26964
|
4525 |
sup_set_def -> sup_set_eq
|
berghofe@26964
|
4526 |
inf_set_def -> inf_set_eq
|
berghofe@26964
|
4527 |
|
berghofe@26964
|
4528 |
- Due to the incompleteness of the HO unification algorithm, some
|
berghofe@26964
|
4529 |
rules such as subst may require manual instantiation, if some of
|
berghofe@26964
|
4530 |
the unknowns in the rule is a set.
|
berghofe@26964
|
4531 |
|
berghofe@26964
|
4532 |
- Higher order unification and forward proofs:
|
berghofe@26964
|
4533 |
The proof pattern
|
berghofe@26964
|
4534 |
|
berghofe@26964
|
4535 |
have "P (S::'a set)" <...>
|
berghofe@26964
|
4536 |
then have "EX S. P S" ..
|
berghofe@26964
|
4537 |
|
wenzelm@27008
|
4538 |
no longer works (due to the incompleteness of the HO unification
|
wenzelm@27008
|
4539 |
algorithm) and must be replaced by the pattern
|
berghofe@26964
|
4540 |
|
berghofe@26964
|
4541 |
have "EX S. P S"
|
berghofe@26964
|
4542 |
proof
|
berghofe@26964
|
4543 |
show "P S" <...>
|
berghofe@26964
|
4544 |
qed
|
berghofe@26964
|
4545 |
|
berghofe@26964
|
4546 |
- Calculational reasoning with subst (or similar rules):
|
berghofe@26964
|
4547 |
The proof pattern
|
berghofe@26964
|
4548 |
|
berghofe@26964
|
4549 |
have "P (S::'a set)" <...>
|
berghofe@26964
|
4550 |
also have "S = T" <...>
|
berghofe@26964
|
4551 |
finally have "P T" .
|
berghofe@26964
|
4552 |
|
wenzelm@27008
|
4553 |
no longer works (for similar reasons as the previous example) and
|
wenzelm@27008
|
4554 |
must be replaced by something like
|
berghofe@26964
|
4555 |
|
berghofe@26964
|
4556 |
have "P (S::'a set)" <...>
|
berghofe@26964
|
4557 |
moreover have "S = T" <...>
|
berghofe@26964
|
4558 |
ultimately have "P T" by simp
|
berghofe@26964
|
4559 |
|
berghofe@26964
|
4560 |
- Tactics or packages written in ML code:
|
berghofe@26964
|
4561 |
Code performing pattern matching on types via
|
berghofe@26964
|
4562 |
|
berghofe@26964
|
4563 |
Type ("set", [T]) => ...
|
berghofe@26964
|
4564 |
|
wenzelm@27008
|
4565 |
must be rewritten. Moreover, functions like strip_type or
|
wenzelm@27008
|
4566 |
binder_types no longer return the right value when applied to a
|
wenzelm@27008
|
4567 |
type of the form
|
berghofe@26964
|
4568 |
|
berghofe@26964
|
4569 |
T1 => ... => Tn => U => bool
|
berghofe@26964
|
4570 |
|
berghofe@26964
|
4571 |
rather than
|
berghofe@26964
|
4572 |
|
berghofe@26964
|
4573 |
T1 => ... => Tn => U set
|
berghofe@26964
|
4574 |
|
wenzelm@26874
|
4575 |
* Merged theories Wellfounded_Recursion, Accessible_Part and
|
wenzelm@27067
|
4576 |
Wellfounded_Relations to theory Wellfounded.
|
krauss@26748
|
4577 |
|
haftmann@26513
|
4578 |
* Explicit class "eq" for executable equality. INCOMPATIBILITY.
|
haftmann@26513
|
4579 |
|
wenzelm@26874
|
4580 |
* Class finite no longer treats UNIV as class parameter. Use class
|
wenzelm@26874
|
4581 |
enum from theory Library/Enum instead to achieve a similar effect.
|
haftmann@26445
|
4582 |
INCOMPATIBILITY.
|
haftmann@26445
|
4583 |
|
wenzelm@26874
|
4584 |
* Theory List: rule list_induct2 now has explicitly named cases "Nil"
|
wenzelm@26874
|
4585 |
and "Cons". INCOMPATIBILITY.
|
wenzelm@26874
|
4586 |
|
wenzelm@26422
|
4587 |
* HOL (and FOL): renamed variables in rules imp_elim and swap.
|
wenzelm@26422
|
4588 |
Potential INCOMPATIBILITY.
|
wenzelm@26422
|
4589 |
|
wenzelm@26874
|
4590 |
* Theory Product_Type: duplicated lemmas split_Pair_apply and
|
wenzelm@26874
|
4591 |
injective_fst_snd removed, use split_eta and prod_eqI instead.
|
wenzelm@26874
|
4592 |
Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
|
haftmann@26355
|
4593 |
|
wenzelm@26335
|
4594 |
* Theory Nat: removed redundant lemmas that merely duplicate lemmas of
|
wenzelm@26335
|
4595 |
the same name in theory Orderings:
|
wenzelm@26335
|
4596 |
|
wenzelm@26335
|
4597 |
less_trans
|
wenzelm@26335
|
4598 |
less_linear
|
wenzelm@26335
|
4599 |
le_imp_less_or_eq
|
wenzelm@26335
|
4600 |
le_less_trans
|
wenzelm@26335
|
4601 |
less_le_trans
|
wenzelm@26335
|
4602 |
less_not_sym
|
wenzelm@26335
|
4603 |
less_asym
|
wenzelm@26335
|
4604 |
|
wenzelm@26335
|
4605 |
Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
|
wenzelm@26335
|
4606 |
less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
|
wenzelm@26335
|
4607 |
and different variable names.
|
wenzelm@26315
|
4608 |
|
haftmann@26231
|
4609 |
* Library/Option_ord.thy: Canonical order on option type.
|
haftmann@26231
|
4610 |
|
wenzelm@27008
|
4611 |
* Library/RBT.thy: Red-black trees, an efficient implementation of
|
wenzelm@27008
|
4612 |
finite maps.
|
krauss@26197
|
4613 |
|
haftmann@26231
|
4614 |
* Library/Countable.thy: Type class for countable types.
|
haftmann@26231
|
4615 |
|
wenzelm@26180
|
4616 |
* Theory Int: The representation of numerals has changed. The infix
|
wenzelm@26180
|
4617 |
operator BIT and the bit datatype with constructors B0 and B1 have
|
wenzelm@26180
|
4618 |
disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
|
wenzelm@26180
|
4619 |
place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
|
wenzelm@26180
|
4620 |
involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
|
wenzelm@26180
|
4621 |
accordingly.
|
wenzelm@26180
|
4622 |
|
wenzelm@26180
|
4623 |
* Theory Nat: definition of <= and < on natural numbers no longer
|
wenzelm@26180
|
4624 |
depend on well-founded relations. INCOMPATIBILITY. Definitions
|
wenzelm@26180
|
4625 |
le_def and less_def have disappeared. Consider lemmas not_less
|
wenzelm@26180
|
4626 |
[symmetric, where ?'a = nat] and less_eq [symmetric] instead.
|
wenzelm@26180
|
4627 |
|
wenzelm@26180
|
4628 |
* Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
|
wenzelm@26180
|
4629 |
(whose purpose mainly is for various fold_set functionals) have been
|
wenzelm@26874
|
4630 |
abandoned in favor of the existing algebraic classes
|
wenzelm@26180
|
4631 |
ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
|
wenzelm@26180
|
4632 |
lower_semilattice (resp. upper_semilattice) and linorder.
|
haftmann@26139
|
4633 |
INCOMPATIBILITY.
|
haftmann@26041
|
4634 |
|
wenzelm@26180
|
4635 |
* Theory Transitive_Closure: induct and cases rules now declare proper
|
wenzelm@26180
|
4636 |
case_names ("base" and "step"). INCOMPATIBILITY.
|
wenzelm@26180
|
4637 |
|
wenzelm@26180
|
4638 |
* Theorem Inductive.lfp_ordinal_induct generalized to complete
|
wenzelm@26180
|
4639 |
lattices. The form set-specific version is available as
|
wenzelm@26180
|
4640 |
Inductive.lfp_ordinal_induct_set.
|
haftmann@26013
|
4641 |
|
wenzelm@26874
|
4642 |
* Renamed theorems "power.simps" to "power_int.simps".
|
wenzelm@27067
|
4643 |
INCOMPATIBILITY.
|
haftmann@25961
|
4644 |
|
wenzelm@26180
|
4645 |
* Class semiring_div provides basic abstract properties of semirings
|
haftmann@25942
|
4646 |
with division and modulo operations. Subsumes former class dvd_mod.
|
haftmann@25942
|
4647 |
|
wenzelm@26180
|
4648 |
* Merged theories IntDef, Numeral and IntArith into unified theory
|
wenzelm@26180
|
4649 |
Int. INCOMPATIBILITY.
|
wenzelm@26180
|
4650 |
|
wenzelm@26180
|
4651 |
* Theory Library/Code_Index: type "index" now represents natural
|
wenzelm@26180
|
4652 |
numbers rather than integers. INCOMPATIBILITY.
|
wenzelm@26180
|
4653 |
|
wenzelm@26180
|
4654 |
* New class "uminus" with operation "uminus" (split of from class
|
wenzelm@26180
|
4655 |
"minus" which now only has operation "minus", binary).
|
haftmann@25919
|
4656 |
INCOMPATIBILITY.
|
haftmann@25919
|
4657 |
|
wenzelm@25522
|
4658 |
* Constants "card", "internal_split", "option_map" now with authentic
|
haftmann@25919
|
4659 |
syntax. INCOMPATIBILITY.
|
wenzelm@25522
|
4660 |
|
wenzelm@25522
|
4661 |
* Definitions subset_def, psubset_def, set_diff_def, Compl_def,
|
wenzelm@25522
|
4662 |
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
|
wenzelm@25522
|
4663 |
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
|
wenzelm@25522
|
4664 |
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
|
wenzelm@25522
|
4665 |
Sup_set_def, le_def, less_def, option_map_def now with object
|
haftmann@25919
|
4666 |
equality. INCOMPATIBILITY.
|
wenzelm@25464
|
4667 |
|
schirmer@25705
|
4668 |
* Records. Removed K_record, and replaced it by pure lambda term
|
wenzelm@25726
|
4669 |
%x. c. The simplifier setup is now more robust against eta expansion.
|
schirmer@25705
|
4670 |
INCOMPATIBILITY: in cases explicitly referring to K_record.
|
wenzelm@25464
|
4671 |
|
wenzelm@27067
|
4672 |
* Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
|
wenzelm@27067
|
4673 |
|
wenzelm@27067
|
4674 |
* Library/ListVector: new theory of arithmetic vector operations.
|
wenzelm@27067
|
4675 |
|
wenzelm@27067
|
4676 |
* Library/Order_Relation: new theory of various orderings as sets of
|
wenzelm@27067
|
4677 |
pairs. Defines preorders, partial orders, linear orders and
|
wenzelm@27067
|
4678 |
well-orders on sets and on types.
|
krauss@26877
|
4679 |
|
wenzelm@25726
|
4680 |
|
krauss@26197
|
4681 |
*** ZF ***
|
krauss@26197
|
4682 |
|
wenzelm@26874
|
4683 |
* Renamed some theories to allow to loading both ZF and HOL in the
|
wenzelm@26874
|
4684 |
same session:
|
wenzelm@26874
|
4685 |
|
wenzelm@26874
|
4686 |
Datatype -> Datatype_ZF
|
wenzelm@26874
|
4687 |
Inductive -> Inductive_ZF
|
wenzelm@26874
|
4688 |
Int -> Int_ZF
|
wenzelm@26874
|
4689 |
IntDiv -> IntDiv_ZF
|
wenzelm@26874
|
4690 |
Nat -> Nat_ZF
|
wenzelm@26874
|
4691 |
List -> List_ZF
|
wenzelm@26874
|
4692 |
Main -> Main_ZF
|
wenzelm@26874
|
4693 |
|
wenzelm@26874
|
4694 |
INCOMPATIBILITY: ZF theories that import individual theories below
|
wenzelm@26874
|
4695 |
Main might need to be adapted. Regular theory Main is still
|
wenzelm@26874
|
4696 |
available, as trivial extension of Main_ZF.
|
krauss@26197
|
4697 |
|
krauss@26197
|
4698 |
|
wenzelm@25737
|
4699 |
*** ML ***
|
wenzelm@25737
|
4700 |
|
wenzelm@27067
|
4701 |
* ML within Isar: antiquotation @{const name} or @{const
|
wenzelm@27067
|
4702 |
name(typargs)} produces statically-checked Const term.
|
wenzelm@27067
|
4703 |
|
wenzelm@26401
|
4704 |
* Functor NamedThmsFun: data is available to the user as dynamic fact
|
wenzelm@26724
|
4705 |
(of the same name). Removed obsolete print command.
|
wenzelm@26401
|
4706 |
|
wenzelm@27067
|
4707 |
* Removed obsolete "use_legacy_bindings" function.
|
wenzelm@26188
|
4708 |
|
wenzelm@25737
|
4709 |
* The ``print mode'' is now a thread-local value derived from a global
|
wenzelm@25737
|
4710 |
template (the former print_mode reference), thus access becomes
|
wenzelm@25737
|
4711 |
non-critical. The global print_mode reference is for session
|
wenzelm@25737
|
4712 |
management only; user-code should use print_mode_value,
|
wenzelm@25737
|
4713 |
print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
|
wenzelm@25737
|
4714 |
|
wenzelm@26874
|
4715 |
* Functions system/system_out provide a robust way to invoke external
|
wenzelm@29161
|
4716 |
shell commands, with propagation of interrupts (requires Poly/ML
|
wenzelm@29161
|
4717 |
5.2.1). Do not use OS.Process.system etc. from the basis library!
|
wenzelm@26222
|
4718 |
|
wenzelm@25737
|
4719 |
|
wenzelm@25626
|
4720 |
*** System ***
|
wenzelm@25626
|
4721 |
|
wenzelm@27067
|
4722 |
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
|
wenzelm@27067
|
4723 |
in accordance with Proof General 3.7, which prefers GNU emacs.
|
wenzelm@27067
|
4724 |
|
wenzelm@27067
|
4725 |
* isatool tty runs Isabelle process with plain tty interaction;
|
wenzelm@27067
|
4726 |
optional line editor may be specified via ISABELLE_LINE_EDITOR
|
wenzelm@27067
|
4727 |
setting, the default settings attempt to locate "ledit" and "rlwrap".
|
wenzelm@27067
|
4728 |
|
wenzelm@27067
|
4729 |
* isatool browser now works with Cygwin as well, using general
|
wenzelm@27067
|
4730 |
"javapath" function defined in Isabelle process environment.
|
wenzelm@27067
|
4731 |
|
wenzelm@26575
|
4732 |
* YXML notation provides a simple and efficient alternative to
|
wenzelm@26575
|
4733 |
standard XML transfer syntax. See src/Pure/General/yxml.ML and
|
wenzelm@26575
|
4734 |
isatool yxml as described in the Isabelle system manual.
|
wenzelm@26575
|
4735 |
|
wenzelm@27067
|
4736 |
* JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
|
wenzelm@27067
|
4737 |
provides general wrapper for managing an Isabelle process in a robust
|
wenzelm@27067
|
4738 |
fashion, with ``cooked'' output from stdin/stderr.
|
wenzelm@27067
|
4739 |
|
wenzelm@27067
|
4740 |
* Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
|
wenzelm@27067
|
4741 |
based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
|
wenzelm@27067
|
4742 |
|
wenzelm@26575
|
4743 |
* Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
|
wenzelm@26575
|
4744 |
way of changing the user's settings is via
|
wenzelm@26218
|
4745 |
ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
|
wenzelm@26218
|
4746 |
script.
|
wenzelm@26218
|
4747 |
|
wenzelm@25776
|
4748 |
* Multithreading.max_threads := 0 refers to the number of actual CPU
|
wenzelm@25776
|
4749 |
cores of the underlying machine, which is a good starting point for
|
wenzelm@25776
|
4750 |
optimal performance tuning. The corresponding usedir option -M allows
|
wenzelm@25778
|
4751 |
"max" as an alias for "0". WARNING: does not work on certain versions
|
wenzelm@25778
|
4752 |
of Mac OS (with Poly/ML 5.1).
|
wenzelm@25776
|
4753 |
|
wenzelm@27067
|
4754 |
* isabelle-process: non-ML sessions are run with "nice", to reduce the
|
wenzelm@27067
|
4755 |
adverse effect of Isabelle flooding interactive front-ends (notably
|
wenzelm@27067
|
4756 |
ProofGeneral / XEmacs).
|
wenzelm@25855
|
4757 |
|
wenzelm@25626
|
4758 |
|
wenzelm@25464
|
4759 |
|
wenzelm@25429
|
4760 |
New in Isabelle2007 (November 2007)
|
wenzelm@25429
|
4761 |
-----------------------------------
|
wenzelm@17754
|
4762 |
|
wenzelm@17754
|
4763 |
*** General ***
|
wenzelm@17754
|
4764 |
|
wenzelm@22826
|
4765 |
* More uniform information about legacy features, notably a
|
wenzelm@22826
|
4766 |
warning/error of "Legacy feature: ...", depending on the state of the
|
wenzelm@23367
|
4767 |
tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
|
wenzelm@23367
|
4768 |
legacy features will disappear eventually.
|
wenzelm@22826
|
4769 |
|
wenzelm@17918
|
4770 |
* Theory syntax: the header format ``theory A = B + C:'' has been
|
wenzelm@17918
|
4771 |
discontinued in favour of ``theory A imports B C begin''. Use isatool
|
wenzelm@17918
|
4772 |
fixheaders to convert existing theory files. INCOMPATIBILITY.
|
wenzelm@17918
|
4773 |
|
wenzelm@17918
|
4774 |
* Theory syntax: the old non-Isar theory file format has been
|
wenzelm@17918
|
4775 |
discontinued altogether. Note that ML proof scripts may still be used
|
wenzelm@17918
|
4776 |
with Isar theories; migration is usually quite simple with the ML
|
wenzelm@17918
|
4777 |
function use_legacy_bindings. INCOMPATIBILITY.
|
wenzelm@17918
|
4778 |
|
wenzelm@22871
|
4779 |
* Theory syntax: some popular names (e.g. 'class', 'declaration',
|
wenzelm@22871
|
4780 |
'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
|
wenzelm@22871
|
4781 |
quotes.
|
wenzelm@19814
|
4782 |
|
wenzelm@23888
|
4783 |
* Theory loader: be more serious about observing the static theory
|
wenzelm@23888
|
4784 |
header specifications (including optional directories), but not the
|
wenzelm@24172
|
4785 |
accidental file locations of previously successful loads. The strict
|
wenzelm@24172
|
4786 |
update policy of former update_thy is now already performed by
|
wenzelm@24172
|
4787 |
use_thy, so the former has been removed; use_thys updates several
|
wenzelm@24172
|
4788 |
theories simultaneously, just as 'imports' within a theory header
|
wenzelm@24172
|
4789 |
specification, but without merging the results. Potential
|
wenzelm@24172
|
4790 |
INCOMPATIBILITY: may need to refine theory headers and commands
|
wenzelm@24172
|
4791 |
ROOT.ML which depend on load order.
|
wenzelm@23888
|
4792 |
|
wenzelm@23888
|
4793 |
* Theory loader: optional support for content-based file
|
wenzelm@23888
|
4794 |
identification, instead of the traditional scheme of full physical
|
wenzelm@23889
|
4795 |
path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
|
wenzelm@23888
|
4796 |
(cf. the system manual). The new scheme allows to work with
|
wenzelm@23888
|
4797 |
non-finished theories in persistent session images, such that source
|
wenzelm@23888
|
4798 |
files may be moved later on without requiring reloads.
|
wenzelm@23888
|
4799 |
|
wenzelm@24187
|
4800 |
* Theory loader: old-style ML proof scripts being *attached* to a thy
|
wenzelm@24187
|
4801 |
file (with the same base name as the theory) are considered a legacy
|
wenzelm@24800
|
4802 |
feature, which will disappear eventually. Even now, the theory loader
|
wenzelm@24800
|
4803 |
no longer maintains dependencies on such files.
|
wenzelm@24800
|
4804 |
|
wenzelm@24800
|
4805 |
* Syntax: the scope for resolving ambiguities via type-inference is
|
wenzelm@24800
|
4806 |
now limited to individual terms, instead of whole simultaneous
|
wenzelm@24234
|
4807 |
specifications as before. This greatly reduces the complexity of the
|
wenzelm@24234
|
4808 |
syntax module and improves flexibility by separating parsing and
|
wenzelm@24234
|
4809 |
type-checking. INCOMPATIBILITY: additional type-constraints (explicit
|
wenzelm@24234
|
4810 |
'fixes' etc.) are required in rare situations.
|
wenzelm@24234
|
4811 |
|
wenzelm@25034
|
4812 |
* Syntax: constants introduced by new-style packages ('definition',
|
wenzelm@25034
|
4813 |
'abbreviation' etc.) are passed through the syntax module in
|
wenzelm@25034
|
4814 |
``authentic mode''. This means that associated mixfix annotations
|
wenzelm@25034
|
4815 |
really stick to such constants, independently of potential name space
|
wenzelm@25034
|
4816 |
ambiguities introduced later on. INCOMPATIBILITY: constants in parse
|
wenzelm@25034
|
4817 |
trees are represented slightly differently, may need to adapt syntax
|
wenzelm@25034
|
4818 |
translations accordingly. Use CONST marker in 'translations' and
|
wenzelm@25034
|
4819 |
@{const_syntax} antiquotation in 'parse_translation' etc.
|
wenzelm@25034
|
4820 |
|
wenzelm@17981
|
4821 |
* Legacy goal package: reduced interface to the bare minimum required
|
wenzelm@17981
|
4822 |
to keep existing proof scripts running. Most other user-level
|
wenzelm@17981
|
4823 |
functions are now part of the OldGoals structure, which is *not* open
|
wenzelm@17981
|
4824 |
by default (consider isatool expandshort before open OldGoals).
|
wenzelm@17981
|
4825 |
Removed top_sg, prin, printyp, pprint_term/typ altogether, because
|
wenzelm@17981
|
4826 |
these tend to cause confusion about the actual goal (!) context being
|
wenzelm@17981
|
4827 |
used here, which is not necessarily the same as the_context().
|
wenzelm@17918
|
4828 |
|
wenzelm@23379
|
4829 |
* Command 'find_theorems': supports "*" wild-card in "name:"
|
wenzelm@23379
|
4830 |
criterion; "with_dups" option. Certain ProofGeneral versions might
|
wenzelm@23379
|
4831 |
support a specific search form (see ProofGeneral/CHANGES).
|
webertj@22965
|
4832 |
|
wenzelm@20370
|
4833 |
* The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
|
wenzelm@20370
|
4834 |
by default, which means that "prems" (and also "fixed variables") are
|
wenzelm@20370
|
4835 |
suppressed from proof state output. Note that the ProofGeneral
|
wenzelm@20370
|
4836 |
settings mechanism allows to change and save options persistently, but
|
wenzelm@20370
|
4837 |
older versions of Isabelle will fail to start up if a negative prems
|
wenzelm@20370
|
4838 |
limit is imposed.
|
wenzelm@20370
|
4839 |
|
wenzelm@21308
|
4840 |
* Local theory targets may be specified by non-nested blocks of
|
wenzelm@21308
|
4841 |
``context/locale/class ... begin'' followed by ``end''. The body may
|
wenzelm@21308
|
4842 |
contain definitions, theorems etc., including any derived mechanism
|
wenzelm@21308
|
4843 |
that has been implemented on top of these primitives. This concept
|
wenzelm@21308
|
4844 |
generalizes the existing ``theorem (in ...)'' towards more versatility
|
wenzelm@21308
|
4845 |
and scalability.
|
wenzelm@21308
|
4846 |
|
wenzelm@21960
|
4847 |
* Proof General interface: proper undo of final 'end' command;
|
wenzelm@21960
|
4848 |
discontinued Isabelle/classic mode (ML proof scripts).
|
wenzelm@21960
|
4849 |
|
wenzelm@17754
|
4850 |
|
wenzelm@17865
|
4851 |
*** Document preparation ***
|
wenzelm@17865
|
4852 |
|
wenzelm@21717
|
4853 |
* Added antiquotation @{theory name} which prints the given name,
|
wenzelm@21717
|
4854 |
after checking that it refers to a valid ancestor theory in the
|
wenzelm@21717
|
4855 |
current context.
|
haftmann@21339
|
4856 |
|
wenzelm@17869
|
4857 |
* Added antiquotations @{ML_type text} and @{ML_struct text} which
|
wenzelm@17869
|
4858 |
check the given source text as ML type/structure, printing verbatim.
|
wenzelm@17865
|
4859 |
|
wenzelm@21717
|
4860 |
* Added antiquotation @{abbrev "c args"} which prints the abbreviation
|
wenzelm@21717
|
4861 |
"c args == rhs" given in the current context. (Any number of
|
wenzelm@21735
|
4862 |
arguments may be given on the LHS.)
|
wenzelm@21717
|
4863 |
|
wenzelm@21717
|
4864 |
|
wenzelm@17779
|
4865 |
*** Pure ***
|
wenzelm@17779
|
4866 |
|
wenzelm@24800
|
4867 |
* The 'class' package offers a combination of axclass and locale to
|
wenzelm@25129
|
4868 |
achieve Haskell-like type classes in Isabelle. Definitions and
|
wenzelm@25129
|
4869 |
theorems within a class context produce both relative results (with
|
wenzelm@25129
|
4870 |
implicit parameters according to the locale context), and polymorphic
|
wenzelm@25129
|
4871 |
constants with qualified polymorphism (according to the class
|
wenzelm@25129
|
4872 |
context). Within the body context of a 'class' target, a separate
|
wenzelm@25129
|
4873 |
syntax layer ("user space type system") takes care of converting
|
wenzelm@25129
|
4874 |
between global polymorphic consts and internal locale representation.
|
wenzelm@25177
|
4875 |
See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
|
haftmann@25184
|
4876 |
"isatool doc classes" provides a tutorial.
|
wenzelm@20807
|
4877 |
|
haftmann@25199
|
4878 |
* Generic code generator framework allows to generate executable
|
wenzelm@24800
|
4879 |
code for ML and Haskell (including Isabelle classes). A short usage
|
wenzelm@24800
|
4880 |
sketch:
|
haftmann@20188
|
4881 |
|
haftmann@20188
|
4882 |
internal compilation:
|
haftmann@25199
|
4883 |
export_code <list of constants (term syntax)> in SML
|
haftmann@20453
|
4884 |
writing SML code to a file:
|
haftmann@25199
|
4885 |
export_code <list of constants (term syntax)> in SML <filename>
|
haftmann@22735
|
4886 |
writing OCaml code to a file:
|
haftmann@25199
|
4887 |
export_code <list of constants (term syntax)> in OCaml <filename>
|
haftmann@20188
|
4888 |
writing Haskell code to a bunch of files:
|
haftmann@25199
|
4889 |
export_code <list of constants (term syntax)> in Haskell <filename>
|
haftmann@25199
|
4890 |
|
haftmann@25199
|
4891 |
evaluating closed propositions to True/False using code generation:
|
haftmann@25184
|
4892 |
method ``eval''
|
haftmann@25184
|
4893 |
|
haftmann@25184
|
4894 |
Reasonable default setup of framework in HOL.
|
haftmann@20453
|
4895 |
|
haftmann@20453
|
4896 |
Theorem attributs for selecting and transforming function equations theorems:
|
haftmann@20453
|
4897 |
|
haftmann@22845
|
4898 |
[code fun]: select a theorem as function equation for a specific constant
|
haftmann@22845
|
4899 |
[code fun del]: deselect a theorem as function equation for a specific constant
|
haftmann@22845
|
4900 |
[code inline]: select an equation theorem for unfolding (inlining) in place
|
haftmann@22845
|
4901 |
[code inline del]: deselect an equation theorem for unfolding (inlining) in place
|
haftmann@20453
|
4902 |
|
haftmann@22735
|
4903 |
User-defined serializations (target in {SML, OCaml, Haskell}):
|
haftmann@20453
|
4904 |
|
haftmann@20453
|
4905 |
code_const <and-list of constants (term syntax)>
|
haftmann@20453
|
4906 |
{(target) <and-list of const target syntax>}+
|
haftmann@20453
|
4907 |
|
haftmann@20453
|
4908 |
code_type <and-list of type constructors>
|
haftmann@20453
|
4909 |
{(target) <and-list of type target syntax>}+
|
haftmann@20453
|
4910 |
|
haftmann@20453
|
4911 |
code_instance <and-list of instances>
|
haftmann@20453
|
4912 |
{(target)}+
|
haftmann@20453
|
4913 |
where instance ::= <type constructor> :: <class>
|
haftmann@20453
|
4914 |
|
haftmann@20453
|
4915 |
code_class <and_list of classes>
|
haftmann@20453
|
4916 |
{(target) <and-list of class target syntax>}+
|
haftmann@20453
|
4917 |
where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
|
haftmann@20453
|
4918 |
|
haftmann@25199
|
4919 |
code_instance and code_class only are effective to target Haskell.
|
haftmann@22735
|
4920 |
|
wenzelm@25177
|
4921 |
For example usage see src/HOL/ex/Codegenerator.thy and
|
wenzelm@25177
|
4922 |
src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
|
wenzelm@24800
|
4923 |
generation from Isabelle/HOL theories is available via "isatool doc
|
wenzelm@24800
|
4924 |
codegen".
|
haftmann@20188
|
4925 |
|
wenzelm@25129
|
4926 |
* Code generator: consts in 'consts_code' Isar commands are now
|
wenzelm@25129
|
4927 |
referred to by usual term syntax (including optional type
|
wenzelm@25129
|
4928 |
annotations).
|
wenzelm@25129
|
4929 |
|
wenzelm@19254
|
4930 |
* Command 'no_translations' removes translation rules from theory
|
wenzelm@19254
|
4931 |
syntax.
|
wenzelm@19254
|
4932 |
|
wenzelm@19625
|
4933 |
* Overloaded definitions are now actually checked for acyclic
|
wenzelm@19714
|
4934 |
dependencies. The overloading scheme is slightly more general than
|
wenzelm@19714
|
4935 |
that of Haskell98, although Isabelle does not demand an exact
|
wenzelm@19714
|
4936 |
correspondence to type class and instance declarations.
|
wenzelm@19714
|
4937 |
INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
|
wenzelm@19714
|
4938 |
exotic versions of overloading -- at the discretion of the user!
|
wenzelm@19711
|
4939 |
|
wenzelm@19711
|
4940 |
Polymorphic constants are represented via type arguments, i.e. the
|
wenzelm@19711
|
4941 |
instantiation that matches an instance against the most general
|
wenzelm@19711
|
4942 |
declaration given in the signature. For example, with the declaration
|
wenzelm@19711
|
4943 |
c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
|
wenzelm@19711
|
4944 |
as c(nat). Overloading is essentially simultaneous structural
|
wenzelm@19711
|
4945 |
recursion over such type arguments. Incomplete specification patterns
|
wenzelm@19714
|
4946 |
impose global constraints on all occurrences, e.g. c('a * 'a) on the
|
wenzelm@19715
|
4947 |
LHS means that more general c('a * 'b) will be disallowed on any RHS.
|
wenzelm@19714
|
4948 |
Command 'print_theory' outputs the normalized system of recursive
|
wenzelm@19714
|
4949 |
equations, see section "definitions".
|
wenzelm@19625
|
4950 |
|
wenzelm@24086
|
4951 |
* Configuration options are maintained within the theory or proof
|
wenzelm@24086
|
4952 |
context (with name and type bool/int/string), providing a very simple
|
wenzelm@24086
|
4953 |
interface to a poor-man's version of general context data. Tools may
|
wenzelm@24110
|
4954 |
declare options in ML (e.g. using Attrib.config_int) and then refer to
|
wenzelm@24110
|
4955 |
these values using Config.get etc. Users may change options via an
|
wenzelm@24110
|
4956 |
associated attribute of the same name. This form of context
|
wenzelm@24110
|
4957 |
declaration works particularly well with commands 'declare' or
|
wenzelm@24110
|
4958 |
'using', for example ``declare [[foo = 42]]''. Thus it has become
|
wenzelm@24110
|
4959 |
very easy to avoid global references, which would not observe Isar
|
wenzelm@24110
|
4960 |
toplevel undo/redo and fail to work with multithreading.
|
wenzelm@24086
|
4961 |
|
wenzelm@24172
|
4962 |
Various global ML references of Pure and HOL have been turned into
|
wenzelm@24172
|
4963 |
configuration options:
|
wenzelm@24172
|
4964 |
|
wenzelm@24172
|
4965 |
Unify.search_bound unify_search_bound
|
wenzelm@24172
|
4966 |
Unify.trace_bound unify_trace_bound
|
wenzelm@24172
|
4967 |
Unify.trace_simp unify_trace_simp
|
wenzelm@24172
|
4968 |
Unify.trace_types unify_trace_types
|
wenzelm@24172
|
4969 |
Simplifier.simp_depth_limit simp_depth_limit
|
wenzelm@24172
|
4970 |
Blast.depth_limit blast_depth_limit
|
wenzelm@24172
|
4971 |
DatatypeProp.dtK datatype_distinctness_limit
|
wenzelm@24172
|
4972 |
fast_arith_neq_limit fast_arith_neq_limit
|
wenzelm@24172
|
4973 |
fast_arith_split_limit fast_arith_split_limit
|
wenzelm@24172
|
4974 |
|
wenzelm@24086
|
4975 |
* Named collections of theorems may be easily installed as context
|
wenzelm@24800
|
4976 |
data using the functor NamedThmsFun (see also
|
wenzelm@24086
|
4977 |
src/Pure/Tools/named_thms.ML). The user may add or delete facts via
|
wenzelm@24110
|
4978 |
attributes; there is also a toplevel print command. This facility is
|
wenzelm@24110
|
4979 |
just a common case of general context data, which is the preferred way
|
wenzelm@24110
|
4980 |
for anything more complex than just a list of facts in canonical
|
wenzelm@24110
|
4981 |
order.
|
wenzelm@24086
|
4982 |
|
wenzelm@24032
|
4983 |
* Isar: command 'declaration' augments a local theory by generic
|
wenzelm@24032
|
4984 |
declaration functions written in ML. This enables arbitrary content
|
wenzelm@24032
|
4985 |
being added to the context, depending on a morphism that tells the
|
wenzelm@24032
|
4986 |
difference of the original declaration context wrt. the application
|
wenzelm@24032
|
4987 |
context encountered later on.
|
wenzelm@24032
|
4988 |
|
wenzelm@24032
|
4989 |
* Isar: proper interfaces for simplification procedures. Command
|
wenzelm@24032
|
4990 |
'simproc_setup' declares named simprocs (with match patterns, and body
|
wenzelm@24032
|
4991 |
text in ML). Attribute "simproc" adds/deletes simprocs in the current
|
wenzelm@24032
|
4992 |
context. ML antiquotation @{simproc name} retrieves named simprocs.
|
wenzelm@24032
|
4993 |
|
wenzelm@24032
|
4994 |
* Isar: an extra pair of brackets around attribute declarations
|
wenzelm@24032
|
4995 |
abbreviates a theorem reference involving an internal dummy fact,
|
wenzelm@24032
|
4996 |
which will be ignored later --- only the effect of the attribute on
|
wenzelm@24032
|
4997 |
the background context will persist. This form of in-place
|
wenzelm@24032
|
4998 |
declarations is particularly useful with commands like 'declare' and
|
wenzelm@24032
|
4999 |
'using', for example ``have A using [[simproc a]] by simp''.
|
wenzelm@24032
|
5000 |
|
wenzelm@23369
|
5001 |
* Isar: method "assumption" (and implicit closing of subproofs) now
|
wenzelm@23369
|
5002 |
takes simple non-atomic goal assumptions into account: after applying
|
wenzelm@23369
|
5003 |
an assumption as a rule the resulting subgoals are solved by atomic
|
wenzelm@23369
|
5004 |
assumption steps. This is particularly useful to finish 'obtain'
|
wenzelm@23369
|
5005 |
goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
|
wenzelm@23369
|
5006 |
without referring to the original premise "!!x. P x ==> thesis" in the
|
wenzelm@23369
|
5007 |
Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
|
wenzelm@23369
|
5008 |
more permissive.
|
wenzelm@23369
|
5009 |
|
wenzelm@23369
|
5010 |
* Isar: implicit use of prems from the Isar proof context is
|
wenzelm@23369
|
5011 |
considered a legacy feature. Common applications like ``have A .''
|
wenzelm@23369
|
5012 |
may be replaced by ``have A by fact'' or ``note `A`''. In general,
|
wenzelm@23369
|
5013 |
referencing facts explicitly here improves readability and
|
wenzelm@23369
|
5014 |
maintainability of proof texts.
|
wenzelm@23369
|
5015 |
|
wenzelm@17865
|
5016 |
* Isar: improper proof element 'guess' is like 'obtain', but derives
|
wenzelm@17865
|
5017 |
the obtained context from the course of reasoning! For example:
|
wenzelm@17865
|
5018 |
|
wenzelm@17865
|
5019 |
assume "EX x y. A x & B y" -- "any previous fact"
|
wenzelm@17865
|
5020 |
then guess x and y by clarify
|
wenzelm@17865
|
5021 |
|
wenzelm@17865
|
5022 |
This technique is potentially adventurous, depending on the facts and
|
wenzelm@17865
|
5023 |
proof tools being involved here.
|
wenzelm@17865
|
5024 |
|
wenzelm@18020
|
5025 |
* Isar: known facts from the proof context may be specified as literal
|
wenzelm@18020
|
5026 |
propositions, using ASCII back-quote syntax. This works wherever
|
wenzelm@18020
|
5027 |
named facts used to be allowed so far, in proof commands, proof
|
wenzelm@18020
|
5028 |
methods, attributes etc. Literal facts are retrieved from the context
|
wenzelm@18020
|
5029 |
according to unification of type and term parameters. For example,
|
wenzelm@18020
|
5030 |
provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
|
wenzelm@18020
|
5031 |
theorems in the current context, then these are valid literal facts:
|
wenzelm@18020
|
5032 |
`A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
|
wenzelm@18020
|
5033 |
|
wenzelm@18020
|
5034 |
There is also a proof method "fact" which does the same composition
|
wenzelm@18044
|
5035 |
for explicit goal states, e.g. the following proof texts coincide with
|
wenzelm@18044
|
5036 |
certain special cases of literal facts:
|
wenzelm@18020
|
5037 |
|
wenzelm@18020
|
5038 |
have "A" by fact == note `A`
|
wenzelm@18020
|
5039 |
have "A ==> B" by fact == note `A ==> B`
|
wenzelm@18020
|
5040 |
have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
|
wenzelm@18020
|
5041 |
have "P a ==> Q a" by fact == note `P a ==> Q a`
|
wenzelm@18020
|
5042 |
|
wenzelm@20118
|
5043 |
* Isar: ":" (colon) is no longer a symbolic identifier character in
|
wenzelm@20118
|
5044 |
outer syntax. Thus symbolic identifiers may be used without
|
wenzelm@20118
|
5045 |
additional white space in declarations like this: ``assume *: A''.
|
wenzelm@20118
|
5046 |
|
wenzelm@20013
|
5047 |
* Isar: 'print_facts' prints all local facts of the current context,
|
wenzelm@20013
|
5048 |
both named and unnamed ones.
|
wenzelm@20013
|
5049 |
|
wenzelm@18308
|
5050 |
* Isar: 'def' now admits simultaneous definitions, e.g.:
|
wenzelm@18308
|
5051 |
|
wenzelm@18308
|
5052 |
def x == "t" and y == "u"
|
wenzelm@18308
|
5053 |
|
wenzelm@18540
|
5054 |
* Isar: added command 'unfolding', which is structurally similar to
|
wenzelm@18540
|
5055 |
'using', but affects both the goal state and facts by unfolding given
|
wenzelm@18815
|
5056 |
rewrite rules. Thus many occurrences of the 'unfold' method or
|
wenzelm@18540
|
5057 |
'unfolded' attribute may be replaced by first-class proof text.
|
wenzelm@18540
|
5058 |
|
wenzelm@18815
|
5059 |
* Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
|
wenzelm@18815
|
5060 |
and command 'unfolding' now all support object-level equalities
|
wenzelm@18815
|
5061 |
(potentially conditional). The underlying notion of rewrite rule is
|
wenzelm@18815
|
5062 |
analogous to the 'rule_format' attribute, but *not* that of the
|
wenzelm@18815
|
5063 |
Simplifier (which is usually more generous).
|
wenzelm@18815
|
5064 |
|
kleing@24238
|
5065 |
* Isar: the new attribute [rotated n] (default n = 1) rotates the
|
kleing@24238
|
5066 |
premises of a theorem by n. Useful in conjunction with drule.
|
kleing@24238
|
5067 |
|
wenzelm@19220
|
5068 |
* Isar: the goal restriction operator [N] (default N = 1) evaluates a
|
wenzelm@19220
|
5069 |
method expression within a sandbox consisting of the first N
|
wenzelm@19240
|
5070 |
sub-goals, which need to exist. For example, ``simp_all [3]''
|
wenzelm@19240
|
5071 |
simplifies the first three sub-goals, while (rule foo, simp_all)[]
|
wenzelm@19240
|
5072 |
simplifies all new goals that emerge from applying rule foo to the
|
wenzelm@19240
|
5073 |
originally first one.
|
wenzelm@19220
|
5074 |
|
wenzelm@19814
|
5075 |
* Isar: schematic goals are no longer restricted to higher-order
|
wenzelm@19814
|
5076 |
patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
|
wenzelm@19814
|
5077 |
expected.
|
wenzelm@19814
|
5078 |
|
wenzelm@18901
|
5079 |
* Isar: the conclusion of a long theorem statement is now either
|
wenzelm@18901
|
5080 |
'shows' (a simultaneous conjunction, as before), or 'obtains'
|
wenzelm@18901
|
5081 |
(essentially a disjunction of cases with local parameters and
|
wenzelm@18901
|
5082 |
assumptions). The latter allows to express general elimination rules
|
wenzelm@18910
|
5083 |
adequately; in this notation common elimination rules look like this:
|
wenzelm@18901
|
5084 |
|
wenzelm@18901
|
5085 |
lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
|
wenzelm@18901
|
5086 |
assumes "EX x. P x"
|
wenzelm@18901
|
5087 |
obtains x where "P x"
|
wenzelm@18901
|
5088 |
|
wenzelm@18901
|
5089 |
lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
|
wenzelm@18901
|
5090 |
assumes "A & B"
|
wenzelm@18901
|
5091 |
obtains A and B
|
wenzelm@18901
|
5092 |
|
wenzelm@18901
|
5093 |
lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
|
wenzelm@18901
|
5094 |
assumes "A | B"
|
wenzelm@18901
|
5095 |
obtains
|
wenzelm@18901
|
5096 |
A
|
wenzelm@18901
|
5097 |
| B
|
wenzelm@18901
|
5098 |
|
wenzelm@18910
|
5099 |
The subsequent classical rules even refer to the formal "thesis"
|
wenzelm@18901
|
5100 |
explicitly:
|
wenzelm@18901
|
5101 |
|
wenzelm@18901
|
5102 |
lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
|
wenzelm@18901
|
5103 |
obtains "~ thesis"
|
wenzelm@18901
|
5104 |
|
wenzelm@18910
|
5105 |
lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
|
wenzelm@18910
|
5106 |
obtains "thesis ==> something"
|
wenzelm@18901
|
5107 |
|
wenzelm@18901
|
5108 |
The actual proof of an 'obtains' statement is analogous to that of the
|
wenzelm@18910
|
5109 |
Isar proof element 'obtain', only that there may be several cases.
|
wenzelm@18910
|
5110 |
Optional case names may be specified in parentheses; these will be
|
wenzelm@18910
|
5111 |
available both in the present proof and as annotations in the
|
wenzelm@18910
|
5112 |
resulting rule, for later use with the 'cases' method (cf. attribute
|
wenzelm@18910
|
5113 |
case_names).
|
wenzelm@18901
|
5114 |
|
wenzelm@21447
|
5115 |
* Isar: the assumptions of a long theorem statement are available as
|
wenzelm@21447
|
5116 |
"assms" fact in the proof context. This is more appropriate than the
|
wenzelm@21447
|
5117 |
(historical) "prems", which refers to all assumptions of the current
|
wenzelm@21447
|
5118 |
context, including those from the target locale, proof body etc.
|
wenzelm@21447
|
5119 |
|
wenzelm@19263
|
5120 |
* Isar: 'print_statement' prints theorems from the current theory or
|
wenzelm@19263
|
5121 |
proof context in long statement form, according to the syntax of a
|
wenzelm@19263
|
5122 |
top-level lemma.
|
wenzelm@19263
|
5123 |
|
wenzelm@18901
|
5124 |
* Isar: 'obtain' takes an optional case name for the local context
|
wenzelm@18901
|
5125 |
introduction rule (default "that").
|
wenzelm@18901
|
5126 |
|
wenzelm@19587
|
5127 |
* Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
|
wenzelm@19587
|
5128 |
explicit (is "_ ==> ?foo") in the rare cases where this still happens
|
wenzelm@19587
|
5129 |
to occur.
|
wenzelm@19587
|
5130 |
|
wenzelm@19682
|
5131 |
* Pure: syntax "CONST name" produces a fully internalized constant
|
wenzelm@19682
|
5132 |
according to the current context. This is particularly useful for
|
wenzelm@19682
|
5133 |
syntax translations that should refer to internal constant
|
wenzelm@19682
|
5134 |
representations independently of name spaces.
|
wenzelm@19682
|
5135 |
|
wenzelm@21537
|
5136 |
* Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
|
wenzelm@21537
|
5137 |
instead of "FOO ". This allows multiple binder declarations to coexist
|
wenzelm@21537
|
5138 |
in the same context. INCOMPATIBILITY.
|
wenzelm@21537
|
5139 |
|
wenzelm@21209
|
5140 |
* Isar/locales: 'notation' provides a robust interface to the 'syntax'
|
wenzelm@21209
|
5141 |
primitive that also works in a locale context (both for constants and
|
wenzelm@24950
|
5142 |
fixed variables). Type declaration and internal syntactic representation
|
wenzelm@24950
|
5143 |
of given constants retrieved from the context. Likewise, the
|
wenzelm@24950
|
5144 |
'no_notation' command allows to remove given syntax annotations from the
|
wenzelm@24950
|
5145 |
current context.
|
wenzelm@19682
|
5146 |
|
wenzelm@19665
|
5147 |
* Isar/locales: new derived specification elements 'axiomatization',
|
wenzelm@19665
|
5148 |
'definition', 'abbreviation', which support type-inference, admit
|
wenzelm@19083
|
5149 |
object-level specifications (equality, equivalence). See also the
|
wenzelm@19083
|
5150 |
isar-ref manual. Examples:
|
wenzelm@19081
|
5151 |
|
wenzelm@19665
|
5152 |
axiomatization
|
wenzelm@21595
|
5153 |
eq (infix "===" 50) where
|
wenzelm@21595
|
5154 |
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
|
wenzelm@21595
|
5155 |
|
wenzelm@21595
|
5156 |
definition "f x y = x + y + 1"
|
wenzelm@21595
|
5157 |
definition g where "g x = f x x"
|
wenzelm@19081
|
5158 |
|
wenzelm@19363
|
5159 |
abbreviation
|
wenzelm@21595
|
5160 |
neq (infix "=!=" 50) where
|
wenzelm@19363
|
5161 |
"x =!= y == ~ (x === y)"
|
wenzelm@19081
|
5162 |
|
wenzelm@19083
|
5163 |
These specifications may be also used in a locale context. Then the
|
wenzelm@19083
|
5164 |
constants being introduced depend on certain fixed parameters, and the
|
wenzelm@19083
|
5165 |
constant name is qualified by the locale base name. An internal
|
wenzelm@19083
|
5166 |
abbreviation takes care for convenient input and output, making the
|
wenzelm@19088
|
5167 |
parameters implicit and using the original short name. See also
|
wenzelm@25177
|
5168 |
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
|
wenzelm@19083
|
5169 |
entities from a monomorphic theory.
|
wenzelm@19083
|
5170 |
|
wenzelm@19083
|
5171 |
Presently, abbreviations are only available 'in' a target locale, but
|
wenzelm@19363
|
5172 |
not inherited by general import expressions. Also note that
|
wenzelm@19363
|
5173 |
'abbreviation' may be used as a type-safe replacement for 'syntax' +
|
wenzelm@24735
|
5174 |
'translations' in common applications. The "no_abbrevs" print mode
|
wenzelm@24735
|
5175 |
prevents folding of abbreviations in term output.
|
wenzelm@19084
|
5176 |
|
wenzelm@19682
|
5177 |
Concrete syntax is attached to specified constants in internal form,
|
wenzelm@19682
|
5178 |
independently of name spaces. The parse tree representation is
|
wenzelm@21209
|
5179 |
slightly different -- use 'notation' instead of raw 'syntax', and
|
wenzelm@19682
|
5180 |
'translations' with explicit "CONST" markup to accommodate this.
|
wenzelm@19665
|
5181 |
|
wenzelm@24800
|
5182 |
* Pure/Isar: unified syntax for new-style specification mechanisms
|
wenzelm@24800
|
5183 |
(e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
|
wenzelm@24800
|
5184 |
full type inference and dummy patterns ("_"). For example:
|
wenzelm@24735
|
5185 |
|
wenzelm@24735
|
5186 |
definition "K x _ = x"
|
wenzelm@24735
|
5187 |
|
wenzelm@24738
|
5188 |
inductive conj for A B
|
wenzelm@24738
|
5189 |
where "A ==> B ==> conj A B"
|
wenzelm@24738
|
5190 |
|
wenzelm@21735
|
5191 |
* Pure: command 'print_abbrevs' prints all constant abbreviations of
|
wenzelm@21735
|
5192 |
the current context. Print mode "no_abbrevs" prevents inversion of
|
wenzelm@21735
|
5193 |
abbreviations on output.
|
wenzelm@21735
|
5194 |
|
wenzelm@24800
|
5195 |
* Isar/locales: improved parameter handling: use of locales "var" and
|
wenzelm@24800
|
5196 |
"struct" no longer necessary; - parameter renamings are no longer
|
wenzelm@24800
|
5197 |
required to be injective. For example, this allows to define
|
wenzelm@24800
|
5198 |
endomorphisms as locale endom = homom mult mult h.
|
ballarin@19783
|
5199 |
|
ballarin@19931
|
5200 |
* Isar/locales: changed the way locales with predicates are defined.
|
ballarin@19931
|
5201 |
Instead of accumulating the specification, the imported expression is
|
wenzelm@22126
|
5202 |
now an interpretation. INCOMPATIBILITY: different normal form of
|
wenzelm@22126
|
5203 |
locale expressions. In particular, in interpretations of locales with
|
wenzelm@22126
|
5204 |
predicates, goals repesenting already interpreted fragments are not
|
wenzelm@22126
|
5205 |
removed automatically. Use methods `intro_locales' and
|
wenzelm@22126
|
5206 |
`unfold_locales'; see below.
|
wenzelm@22126
|
5207 |
|
wenzelm@22126
|
5208 |
* Isar/locales: new methods `intro_locales' and `unfold_locales'
|
wenzelm@22126
|
5209 |
provide backward reasoning on locales predicates. The methods are
|
wenzelm@22126
|
5210 |
aware of interpretations and discharge corresponding goals.
|
wenzelm@22126
|
5211 |
`intro_locales' is less aggressive then `unfold_locales' and does not
|
wenzelm@22126
|
5212 |
unfold predicates to assumptions.
|
ballarin@19931
|
5213 |
|
ballarin@19931
|
5214 |
* Isar/locales: the order in which locale fragments are accumulated
|
wenzelm@22126
|
5215 |
has changed. This enables to override declarations from fragments due
|
wenzelm@22126
|
5216 |
to interpretations -- for example, unwanted simp rules.
|
ballarin@19931
|
5217 |
|
ballarin@23920
|
5218 |
* Isar/locales: interpretation in theories and proof contexts has been
|
ballarin@23920
|
5219 |
extended. One may now specify (and prove) equations, which are
|
ballarin@23920
|
5220 |
unfolded in interpreted theorems. This is useful for replacing
|
ballarin@23920
|
5221 |
defined concepts (constants depending on locale parameters) by
|
ballarin@23920
|
5222 |
concepts already existing in the target context. Example:
|
ballarin@23920
|
5223 |
|
ballarin@23920
|
5224 |
interpretation partial_order ["op <= :: [int, int] => bool"]
|
ballarin@23920
|
5225 |
where "partial_order.less (op <=) (x::int) y = (x < y)"
|
ballarin@23920
|
5226 |
|
wenzelm@24800
|
5227 |
Typically, the constant `partial_order.less' is created by a
|
wenzelm@24800
|
5228 |
definition specification element in the context of locale
|
wenzelm@24800
|
5229 |
partial_order.
|
wenzelm@24800
|
5230 |
|
wenzelm@24859
|
5231 |
* Method "induct": improved internal context management to support
|
wenzelm@24800
|
5232 |
local fixes and defines on-the-fly. Thus explicit meta-level
|
wenzelm@24800
|
5233 |
connectives !! and ==> are rarely required anymore in inductive goals
|
wenzelm@24800
|
5234 |
(using object-logic connectives for this purpose has been long
|
wenzelm@24800
|
5235 |
obsolete anyway). Common proof patterns are explained in
|
wenzelm@25177
|
5236 |
src/HOL/Induct/Common_Patterns.thy, see also
|
wenzelm@25177
|
5237 |
src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
|
wenzelm@25177
|
5238 |
examples.
|
wenzelm@24606
|
5239 |
|
wenzelm@24859
|
5240 |
* Method "induct": improved handling of simultaneous goals. Instead of
|
wenzelm@24606
|
5241 |
introducing object-level conjunction, the statement is now split into
|
wenzelm@24606
|
5242 |
several conclusions, while the corresponding symbolic cases are nested
|
wenzelm@24606
|
5243 |
accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
|
wenzelm@25177
|
5244 |
see src/HOL/Induct/Common_Patterns.thy, for example.
|
wenzelm@24606
|
5245 |
|
wenzelm@24859
|
5246 |
* Method "induct": mutual induction rules are now specified as a list
|
wenzelm@24800
|
5247 |
of rule sharing the same induction cases. HOL packages usually provide
|
wenzelm@24606
|
5248 |
foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
|
wenzelm@24859
|
5249 |
predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
|
wenzelm@24859
|
5250 |
mutual induction rules differently, i.e. like this:
|
wenzelm@18506
|
5251 |
|
wenzelm@18506
|
5252 |
(induct rule: foo_bar.inducts)
|
wenzelm@18506
|
5253 |
(induct set: foo bar)
|
wenzelm@24859
|
5254 |
(induct pred: foo bar)
|
wenzelm@18506
|
5255 |
(induct type: foo bar)
|
wenzelm@18506
|
5256 |
|
wenzelm@18506
|
5257 |
The ML function ProjectRule.projections turns old-style rules into the
|
wenzelm@18506
|
5258 |
new format.
|
wenzelm@18506
|
5259 |
|
wenzelm@24859
|
5260 |
* Method "coinduct": dual of induction, see
|
wenzelm@18399
|
5261 |
src/HOL/Library/Coinductive_List.thy for various examples.
|
wenzelm@18399
|
5262 |
|
wenzelm@24859
|
5263 |
* Method "cases", "induct", "coinduct": the ``(open)'' option is
|
wenzelm@24859
|
5264 |
considered a legacy feature.
|
wenzelm@24859
|
5265 |
|
wenzelm@20919
|
5266 |
* Attribute "symmetric" produces result with standardized schematic
|
wenzelm@20919
|
5267 |
variables (index 0). Potential INCOMPATIBILITY.
|
wenzelm@20919
|
5268 |
|
wenzelm@22126
|
5269 |
* Simplifier: by default the simplifier trace only shows top level
|
wenzelm@22126
|
5270 |
rewrites now. That is, trace_simp_depth_limit is set to 1 by
|
wenzelm@22126
|
5271 |
default. Thus there is less danger of being flooded by the trace. The
|
wenzelm@22126
|
5272 |
trace indicates where parts have been suppressed.
|
nipkow@18674
|
5273 |
|
wenzelm@18536
|
5274 |
* Provers/classical: removed obsolete classical version of elim_format
|
wenzelm@18536
|
5275 |
attribute; classical elim/dest rules are now treated uniformly when
|
wenzelm@18536
|
5276 |
manipulating the claset.
|
wenzelm@18536
|
5277 |
|
wenzelm@18694
|
5278 |
* Provers/classical: stricter checks to ensure that supplied intro,
|
wenzelm@18694
|
5279 |
dest and elim rules are well-formed; dest and elim rules must have at
|
wenzelm@18694
|
5280 |
least one premise.
|
wenzelm@18694
|
5281 |
|
wenzelm@18694
|
5282 |
* Provers/classical: attributes dest/elim/intro take an optional
|
wenzelm@18695
|
5283 |
weight argument for the rule (just as the Pure versions). Weights are
|
wenzelm@18696
|
5284 |
ignored by automated tools, but determine the search order of single
|
wenzelm@18694
|
5285 |
rule steps.
|
paulson@18557
|
5286 |
|
wenzelm@18536
|
5287 |
* Syntax: input syntax now supports dummy variable binding "%_. b",
|
wenzelm@18536
|
5288 |
where the body does not mention the bound variable. Note that dummy
|
wenzelm@18536
|
5289 |
patterns implicitly depend on their context of bounds, which makes
|
wenzelm@18536
|
5290 |
"{_. _}" match any set comprehension as expected. Potential
|
wenzelm@18536
|
5291 |
INCOMPATIBILITY -- parse translations need to cope with syntactic
|
wenzelm@18536
|
5292 |
constant "_idtdummy" in the binding position.
|
wenzelm@18536
|
5293 |
|
wenzelm@18536
|
5294 |
* Syntax: removed obsolete syntactic constant "_K" and its associated
|
wenzelm@18536
|
5295 |
parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
|
wenzelm@18536
|
5296 |
for example "A -> B" => "Pi A (%_. B)".
|
wenzelm@17779
|
5297 |
|
wenzelm@20582
|
5298 |
* Pure: 'class_deps' command visualizes the subclass relation, using
|
wenzelm@20582
|
5299 |
the graph browser tool.
|
wenzelm@20582
|
5300 |
|
wenzelm@24800
|
5301 |
* Pure: 'print_theory' now suppresses certain internal declarations by
|
wenzelm@24800
|
5302 |
default; use '!' option for full details.
|
wenzelm@20620
|
5303 |
|
wenzelm@17865
|
5304 |
|
nipkow@17806
|
5305 |
*** HOL ***
|
nipkow@17806
|
5306 |
|
wenzelm@25129
|
5307 |
* Method "metis" proves goals by applying the Metis general-purpose
|
wenzelm@25129
|
5308 |
resolution prover (see also http://gilith.com/software/metis/).
|
wenzelm@25129
|
5309 |
Examples are in the directory MetisExamples. WARNING: the
|
wenzelm@25129
|
5310 |
Isabelle/HOL-Metis integration does not yet work properly with
|
wenzelm@25129
|
5311 |
multi-threading.
|
wenzelm@25129
|
5312 |
|
wenzelm@25129
|
5313 |
* Command 'sledgehammer' invokes external automatic theorem provers as
|
wenzelm@25129
|
5314 |
background processes. It generates calls to the "metis" method if
|
wenzelm@25129
|
5315 |
successful. These can be pasted into the proof. Users do not have to
|
wenzelm@25129
|
5316 |
wait for the automatic provers to return. WARNING: does not really
|
wenzelm@25129
|
5317 |
work with multi-threading.
|
wenzelm@25129
|
5318 |
|
wenzelm@24804
|
5319 |
* New "auto_quickcheck" feature tests outermost goal statements for
|
wenzelm@24804
|
5320 |
potential counter-examples. Controlled by ML references
|
wenzelm@24804
|
5321 |
auto_quickcheck (default true) and auto_quickcheck_time_limit (default
|
wenzelm@25129
|
5322 |
5000 milliseconds). Fails silently if statements is outside of
|
wenzelm@25129
|
5323 |
executable fragment, or any other codgenerator problem occurs.
|
wenzelm@24804
|
5324 |
|
haftmann@25184
|
5325 |
* New constant "undefined" with axiom "undefined x = undefined".
|
haftmann@25184
|
5326 |
|
haftmann@25184
|
5327 |
* Added class "HOL.eq", allowing for code generation with polymorphic
|
haftmann@25184
|
5328 |
equality.
|
wenzelm@24800
|
5329 |
|
wenzelm@24800
|
5330 |
* Some renaming of class constants due to canonical name prefixing in
|
wenzelm@24800
|
5331 |
the new 'class' package:
|
haftmann@22997
|
5332 |
|
haftmann@25184
|
5333 |
HOL.abs ~> HOL.abs_class.abs
|
haftmann@22997
|
5334 |
HOL.divide ~> HOL.divide_class.divide
|
haftmann@25184
|
5335 |
0 ~> HOL.zero_class.zero
|
haftmann@25184
|
5336 |
1 ~> HOL.one_class.one
|
haftmann@25184
|
5337 |
op + ~> HOL.plus_class.plus
|
haftmann@25184
|
5338 |
op - ~> HOL.minus_class.minus
|
haftmann@25184
|
5339 |
uminus ~> HOL.minus_class.uminus
|
haftmann@25184
|
5340 |
op * ~> HOL.times_class.times
|
haftmann@25184
|
5341 |
op < ~> HOL.ord_class.less
|
haftmann@25184
|
5342 |
op <= > HOL.ord_class.less_eq
|
haftmann@24996
|
5343 |
Nat.power ~> Power.power_class.power
|
haftmann@22997
|
5344 |
Nat.size ~> Nat.size_class.size
|
haftmann@22997
|
5345 |
Numeral.number_of ~> Numeral.number_class.number_of
|
haftmann@24996
|
5346 |
FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
|
haftmann@24996
|
5347 |
FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
|
haftmann@23129
|
5348 |
Orderings.min ~> Orderings.ord_class.min
|
haftmann@23129
|
5349 |
Orderings.max ~> Orderings.ord_class.max
|
haftmann@25184
|
5350 |
Divides.op div ~> Divides.div_class.div
|
haftmann@25184
|
5351 |
Divides.op mod ~> Divides.div_class.mod
|
haftmann@25184
|
5352 |
Divides.op dvd ~> Divides.div_class.dvd
|
haftmann@25184
|
5353 |
|
haftmann@25184
|
5354 |
INCOMPATIBILITY. Adaptions may be required in the following cases:
|
haftmann@25184
|
5355 |
|
haftmann@25184
|
5356 |
a) User-defined constants using any of the names "plus", "minus",
|
haftmann@25184
|
5357 |
"times", "less" or "less_eq". The standard syntax translations for
|
haftmann@25184
|
5358 |
"+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
|
haftmann@25184
|
5359 |
names.
|
haftmann@25184
|
5360 |
|
haftmann@25184
|
5361 |
b) Variables named "plus", "minus", "times", "less", "less_eq"
|
haftmann@25184
|
5362 |
INCOMPATIBILITY: use more specific names.
|
haftmann@25184
|
5363 |
|
haftmann@25184
|
5364 |
c) Permutative equations (e.g. "a + b = b + a")
|
haftmann@25184
|
5365 |
Since the change of names also changes the order of terms, permutative
|
haftmann@25184
|
5366 |
rewrite rules may get applied in a different order. Experience shows
|
haftmann@25184
|
5367 |
that this is rarely the case (only two adaptions in the whole Isabelle
|
haftmann@25184
|
5368 |
distribution). INCOMPATIBILITY: rewrite proofs
|
haftmann@25184
|
5369 |
|
haftmann@25184
|
5370 |
d) ML code directly refering to constant names
|
haftmann@25184
|
5371 |
This in general only affects hand-written proof tactics, simprocs and
|
haftmann@25184
|
5372 |
so on. INCOMPATIBILITY: grep your sourcecode and replace names.
|
haftmann@25184
|
5373 |
Consider using @{const_name} antiquotation.
|
haftmann@24996
|
5374 |
|
wenzelm@24800
|
5375 |
* New class "default" with associated constant "default".
|
wenzelm@24800
|
5376 |
|
wenzelm@24800
|
5377 |
* Function "sgn" is now overloaded and available on int, real, complex
|
wenzelm@24800
|
5378 |
(and other numeric types), using class "sgn". Two possible defs of
|
wenzelm@24800
|
5379 |
sgn are given as equational assumptions in the classes sgn_if and
|
wenzelm@24800
|
5380 |
sgn_div_norm; ordered_idom now also inherits from sgn_if.
|
wenzelm@24800
|
5381 |
INCOMPATIBILITY.
|
wenzelm@24800
|
5382 |
|
haftmann@25184
|
5383 |
* Locale "partial_order" now unified with class "order" (cf. theory
|
haftmann@25184
|
5384 |
Orderings), added parameter "less". INCOMPATIBILITY.
|
haftmann@25184
|
5385 |
|
haftmann@25184
|
5386 |
* Renamings in classes "order" and "linorder": facts "refl", "trans" and
|
haftmann@25184
|
5387 |
"cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
|
haftmann@25184
|
5388 |
clashes with HOL "refl" and "trans". INCOMPATIBILITY.
|
haftmann@25184
|
5389 |
|
haftmann@25184
|
5390 |
* Classes "order" and "linorder": potential INCOMPATIBILITY due to
|
haftmann@25184
|
5391 |
changed order of proof goals in instance proofs.
|
haftmann@25184
|
5392 |
|
haftmann@25184
|
5393 |
* The transitivity reasoner for partial and linear orders is set up
|
haftmann@25184
|
5394 |
for classes "order" and "linorder". Instances of the reasoner are available
|
haftmann@25184
|
5395 |
in all contexts importing or interpreting the corresponding locales.
|
haftmann@25184
|
5396 |
Method "order" invokes the reasoner separately; the reasoner
|
haftmann@25184
|
5397 |
is also integrated with the Simplifier as a solver. Diagnostic
|
haftmann@25184
|
5398 |
command 'print_orders' shows the available instances of the reasoner
|
haftmann@25184
|
5399 |
in the current context.
|
haftmann@25184
|
5400 |
|
haftmann@25184
|
5401 |
* Localized monotonicity predicate in theory "Orderings"; integrated
|
haftmann@25184
|
5402 |
lemmas max_of_mono and min_of_mono with this predicate.
|
haftmann@25184
|
5403 |
INCOMPATIBILITY.
|
haftmann@25184
|
5404 |
|
haftmann@25184
|
5405 |
* Formulation of theorem "dense" changed slightly due to integration
|
haftmann@25184
|
5406 |
with new class dense_linear_order.
|
haftmann@25184
|
5407 |
|
haftmann@25184
|
5408 |
* Uniform lattice theory development in HOL.
|
haftmann@22422
|
5409 |
|
haftmann@22422
|
5410 |
constants "meet" and "join" now named "inf" and "sup"
|
haftmann@22422
|
5411 |
constant "Meet" now named "Inf"
|
haftmann@22422
|
5412 |
|
haftmann@22450
|
5413 |
classes "meet_semilorder" and "join_semilorder" now named
|
haftmann@22450
|
5414 |
"lower_semilattice" and "upper_semilattice"
|
haftmann@22450
|
5415 |
class "lorder" now named "lattice"
|
haftmann@22450
|
5416 |
class "comp_lat" now named "complete_lattice"
|
haftmann@22450
|
5417 |
|
haftmann@22450
|
5418 |
Instantiation of lattice classes allows explicit definitions
|
haftmann@24342
|
5419 |
for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
|
haftmann@22450
|
5420 |
|
haftmann@23129
|
5421 |
INCOMPATIBILITY. Theorem renames:
|
haftmann@22450
|
5422 |
|
haftmann@22422
|
5423 |
meet_left_le ~> inf_le1
|
haftmann@22422
|
5424 |
meet_right_le ~> inf_le2
|
haftmann@22422
|
5425 |
join_left_le ~> sup_ge1
|
haftmann@22422
|
5426 |
join_right_le ~> sup_ge2
|
haftmann@22422
|
5427 |
meet_join_le ~> inf_sup_ord
|
haftmann@22422
|
5428 |
le_meetI ~> le_infI
|
haftmann@22422
|
5429 |
join_leI ~> le_supI
|
haftmann@22422
|
5430 |
le_meet ~> le_inf_iff
|
haftmann@22422
|
5431 |
le_join ~> ge_sup_conv
|
haftmann@22422
|
5432 |
meet_idempotent ~> inf_idem
|
haftmann@22422
|
5433 |
join_idempotent ~> sup_idem
|
haftmann@22422
|
5434 |
meet_comm ~> inf_commute
|
haftmann@22422
|
5435 |
join_comm ~> sup_commute
|
haftmann@22422
|
5436 |
meet_leI1 ~> le_infI1
|
haftmann@22422
|
5437 |
meet_leI2 ~> le_infI2
|
haftmann@22422
|
5438 |
le_joinI1 ~> le_supI1
|
haftmann@22422
|
5439 |
le_joinI2 ~> le_supI2
|
haftmann@22422
|
5440 |
meet_assoc ~> inf_assoc
|
haftmann@22422
|
5441 |
join_assoc ~> sup_assoc
|
haftmann@22422
|
5442 |
meet_left_comm ~> inf_left_commute
|
haftmann@22422
|
5443 |
meet_left_idempotent ~> inf_left_idem
|
haftmann@22422
|
5444 |
join_left_comm ~> sup_left_commute
|
haftmann@22422
|
5445 |
join_left_idempotent ~> sup_left_idem
|
haftmann@22422
|
5446 |
meet_aci ~> inf_aci
|
haftmann@22422
|
5447 |
join_aci ~> sup_aci
|
haftmann@22422
|
5448 |
le_def_meet ~> le_iff_inf
|
haftmann@22422
|
5449 |
le_def_join ~> le_iff_sup
|
haftmann@22422
|
5450 |
join_absorp2 ~> sup_absorb2
|
haftmann@22422
|
5451 |
join_absorp1 ~> sup_absorb1
|
haftmann@22422
|
5452 |
meet_absorp1 ~> inf_absorb1
|
haftmann@22422
|
5453 |
meet_absorp2 ~> inf_absorb2
|
haftmann@22422
|
5454 |
meet_join_absorp ~> inf_sup_absorb
|
haftmann@22422
|
5455 |
join_meet_absorp ~> sup_inf_absorb
|
haftmann@22422
|
5456 |
distrib_join_le ~> distrib_sup_le
|
haftmann@22422
|
5457 |
distrib_meet_le ~> distrib_inf_le
|
haftmann@22422
|
5458 |
|
haftmann@22422
|
5459 |
add_meet_distrib_left ~> add_inf_distrib_left
|
haftmann@22422
|
5460 |
add_join_distrib_left ~> add_sup_distrib_left
|
haftmann@22422
|
5461 |
is_join_neg_meet ~> is_join_neg_inf
|
haftmann@22422
|
5462 |
is_meet_neg_join ~> is_meet_neg_sup
|
haftmann@22422
|
5463 |
add_meet_distrib_right ~> add_inf_distrib_right
|
haftmann@22422
|
5464 |
add_join_distrib_right ~> add_sup_distrib_right
|
haftmann@22422
|
5465 |
add_meet_join_distribs ~> add_sup_inf_distribs
|
haftmann@22422
|
5466 |
join_eq_neg_meet ~> sup_eq_neg_inf
|
haftmann@22422
|
5467 |
meet_eq_neg_join ~> inf_eq_neg_sup
|
haftmann@22422
|
5468 |
add_eq_meet_join ~> add_eq_inf_sup
|
haftmann@22422
|
5469 |
meet_0_imp_0 ~> inf_0_imp_0
|
haftmann@22422
|
5470 |
join_0_imp_0 ~> sup_0_imp_0
|
haftmann@22422
|
5471 |
meet_0_eq_0 ~> inf_0_eq_0
|
haftmann@22422
|
5472 |
join_0_eq_0 ~> sup_0_eq_0
|
haftmann@22422
|
5473 |
neg_meet_eq_join ~> neg_inf_eq_sup
|
haftmann@22422
|
5474 |
neg_join_eq_meet ~> neg_sup_eq_inf
|
haftmann@22422
|
5475 |
join_eq_if ~> sup_eq_if
|
haftmann@22422
|
5476 |
|
haftmann@22422
|
5477 |
mono_meet ~> mono_inf
|
haftmann@22422
|
5478 |
mono_join ~> mono_sup
|
haftmann@22422
|
5479 |
meet_bool_eq ~> inf_bool_eq
|
haftmann@22422
|
5480 |
join_bool_eq ~> sup_bool_eq
|
haftmann@22422
|
5481 |
meet_fun_eq ~> inf_fun_eq
|
haftmann@22422
|
5482 |
join_fun_eq ~> sup_fun_eq
|
haftmann@22422
|
5483 |
meet_set_eq ~> inf_set_eq
|
haftmann@22422
|
5484 |
join_set_eq ~> sup_set_eq
|
haftmann@22422
|
5485 |
meet1_iff ~> inf1_iff
|
haftmann@22422
|
5486 |
meet2_iff ~> inf2_iff
|
haftmann@22422
|
5487 |
meet1I ~> inf1I
|
haftmann@22422
|
5488 |
meet2I ~> inf2I
|
haftmann@22422
|
5489 |
meet1D1 ~> inf1D1
|
haftmann@22422
|
5490 |
meet2D1 ~> inf2D1
|
haftmann@22422
|
5491 |
meet1D2 ~> inf1D2
|
haftmann@22422
|
5492 |
meet2D2 ~> inf2D2
|
haftmann@22422
|
5493 |
meet1E ~> inf1E
|
haftmann@22422
|
5494 |
meet2E ~> inf2E
|
haftmann@22422
|
5495 |
join1_iff ~> sup1_iff
|
haftmann@22422
|
5496 |
join2_iff ~> sup2_iff
|
haftmann@22422
|
5497 |
join1I1 ~> sup1I1
|
haftmann@22422
|
5498 |
join2I1 ~> sup2I1
|
haftmann@22422
|
5499 |
join1I1 ~> sup1I1
|
haftmann@22422
|
5500 |
join2I2 ~> sup1I2
|
haftmann@22422
|
5501 |
join1CI ~> sup1CI
|
haftmann@22422
|
5502 |
join2CI ~> sup2CI
|
haftmann@22422
|
5503 |
join1E ~> sup1E
|
haftmann@22422
|
5504 |
join2E ~> sup2E
|
haftmann@22422
|
5505 |
|
haftmann@22422
|
5506 |
is_meet_Meet ~> is_meet_Inf
|
haftmann@22422
|
5507 |
Meet_bool_def ~> Inf_bool_def
|
haftmann@22422
|
5508 |
Meet_fun_def ~> Inf_fun_def
|
haftmann@22422
|
5509 |
Meet_greatest ~> Inf_greatest
|
haftmann@22422
|
5510 |
Meet_lower ~> Inf_lower
|
haftmann@22422
|
5511 |
Meet_set_def ~> Inf_set_def
|
haftmann@22422
|
5512 |
|
haftmann@24342
|
5513 |
Sup_def ~> Sup_Inf
|
haftmann@24342
|
5514 |
Sup_bool_eq ~> Sup_bool_def
|
haftmann@24342
|
5515 |
Sup_fun_eq ~> Sup_fun_def
|
haftmann@24342
|
5516 |
Sup_set_eq ~> Sup_set_def
|
haftmann@24342
|
5517 |
|
haftmann@22422
|
5518 |
listsp_meetI ~> listsp_infI
|
haftmann@22422
|
5519 |
listsp_meet_eq ~> listsp_inf_eq
|
haftmann@22422
|
5520 |
|
haftmann@22450
|
5521 |
meet_min ~> inf_min
|
haftmann@22450
|
5522 |
join_max ~> sup_max
|
haftmann@22450
|
5523 |
|
haftmann@25184
|
5524 |
* Added syntactic class "size"; overloaded constant "size" now has
|
haftmann@25184
|
5525 |
type "'a::size ==> bool"
|
haftmann@25184
|
5526 |
|
haftmann@25184
|
5527 |
* Internal reorganisation of `size' of datatypes: size theorems
|
haftmann@25184
|
5528 |
"foo.size" are no longer subsumed by "foo.simps" (but are still
|
haftmann@25184
|
5529 |
simplification rules by default!); theorems "prod.size" now named
|
haftmann@25184
|
5530 |
"*.size".
|
haftmann@25184
|
5531 |
|
haftmann@25184
|
5532 |
* Class "div" now inherits from class "times" rather than "type".
|
haftmann@25184
|
5533 |
INCOMPATIBILITY.
|
haftmann@25184
|
5534 |
|
haftmann@25184
|
5535 |
* HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
|
haftmann@25184
|
5536 |
Linorder etc. have disappeared; operations defined in terms of
|
haftmann@25184
|
5537 |
fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
|
haftmann@25184
|
5538 |
|
haftmann@25184
|
5539 |
* HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
|
haftmann@25184
|
5540 |
|
haftmann@25184
|
5541 |
* HOL-Word: New extensive library and type for generic, fixed size
|
blanchet@48537
|
5542 |
machine words, with arithmetic, bit-wise, shifting and rotating
|
haftmann@25184
|
5543 |
operations, reflection into int, nat, and bool lists, automation for
|
haftmann@25184
|
5544 |
linear arithmetic (by automatic reflection into nat or int), including
|
haftmann@25184
|
5545 |
lemmas on overflow and monotonicity. Instantiated to all appropriate
|
haftmann@25184
|
5546 |
arithmetic type classes, supporting automatic simplification of
|
haftmann@25184
|
5547 |
numerals on all operations.
|
haftmann@25184
|
5548 |
|
haftmann@25184
|
5549 |
* Library/Boolean_Algebra: locales for abstract boolean algebras.
|
haftmann@25184
|
5550 |
|
haftmann@25184
|
5551 |
* Library/Numeral_Type: numbers as types, e.g. TYPE(32).
|
haftmann@25184
|
5552 |
|
haftmann@25184
|
5553 |
* Code generator library theories:
|
haftmann@25184
|
5554 |
- Code_Integer represents HOL integers by big integer literals in target
|
haftmann@25184
|
5555 |
languages.
|
haftmann@25184
|
5556 |
- Code_Char represents HOL characters by character literals in target
|
haftmann@25184
|
5557 |
languages.
|
haftmann@25184
|
5558 |
- Code_Char_chr like Code_Char, but also offers treatment of character
|
haftmann@25184
|
5559 |
codes; includes Code_Integer.
|
haftmann@25184
|
5560 |
- Executable_Set allows to generate code for finite sets using lists.
|
haftmann@25184
|
5561 |
- Executable_Rat implements rational numbers as triples (sign, enumerator,
|
haftmann@25184
|
5562 |
denominator).
|
haftmann@25184
|
5563 |
- Executable_Real implements a subset of real numbers, namly those
|
haftmann@25184
|
5564 |
representable by rational numbers.
|
haftmann@25184
|
5565 |
- Efficient_Nat implements natural numbers by integers, which in general will
|
haftmann@25184
|
5566 |
result in higher efficency; pattern matching with 0/Suc is eliminated;
|
haftmann@25184
|
5567 |
includes Code_Integer.
|
haftmann@25184
|
5568 |
- Code_Index provides an additional datatype index which is mapped to
|
haftmann@25184
|
5569 |
target-language built-in integers.
|
haftmann@26355
|
5570 |
- Code_Message provides an additional datatype message_string which is isomorphic to
|
haftmann@25184
|
5571 |
strings; messages are mapped to target-language strings.
|
haftmann@25184
|
5572 |
|
haftmann@25184
|
5573 |
* New package for inductive predicates
|
haftmann@25184
|
5574 |
|
haftmann@25184
|
5575 |
An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
|
haftmann@25184
|
5576 |
|
haftmann@25184
|
5577 |
inductive
|
haftmann@25184
|
5578 |
p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
|
haftmann@25184
|
5579 |
for z_1 :: U_1 and ... and z_n :: U_m
|
haftmann@25184
|
5580 |
where
|
haftmann@25184
|
5581 |
rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
|
haftmann@25184
|
5582 |
| ...
|
haftmann@25184
|
5583 |
|
haftmann@25184
|
5584 |
with full support for type-inference, rather than
|
haftmann@25184
|
5585 |
|
haftmann@25184
|
5586 |
consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
|
haftmann@25184
|
5587 |
|
haftmann@25184
|
5588 |
abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
|
haftmann@25184
|
5589 |
where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
|
haftmann@25184
|
5590 |
|
haftmann@25184
|
5591 |
inductive "s z_1 ... z_m"
|
haftmann@25184
|
5592 |
intros
|
haftmann@25184
|
5593 |
rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
|
haftmann@25184
|
5594 |
...
|
haftmann@25184
|
5595 |
|
haftmann@25184
|
5596 |
For backward compatibility, there is a wrapper allowing inductive
|
haftmann@25184
|
5597 |
sets to be defined with the new package via
|
haftmann@25184
|
5598 |
|
haftmann@25184
|
5599 |
inductive_set
|
haftmann@25184
|
5600 |
s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
|
haftmann@25184
|
5601 |
for z_1 :: U_1 and ... and z_n :: U_m
|
haftmann@25184
|
5602 |
where
|
haftmann@25184
|
5603 |
rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
|
haftmann@25184
|
5604 |
| ...
|
haftmann@25184
|
5605 |
|
haftmann@25184
|
5606 |
or
|
haftmann@25184
|
5607 |
|
haftmann@25184
|
5608 |
inductive_set
|
haftmann@25184
|
5609 |
s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
|
haftmann@25184
|
5610 |
and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
|
haftmann@25184
|
5611 |
for z_1 :: U_1 and ... and z_n :: U_m
|
haftmann@25184
|
5612 |
where
|
haftmann@25184
|
5613 |
"p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
|
haftmann@25184
|
5614 |
| rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
|
haftmann@25184
|
5615 |
| ...
|
haftmann@25184
|
5616 |
|
haftmann@25184
|
5617 |
if the additional syntax "p ..." is required.
|
haftmann@25184
|
5618 |
|
haftmann@25184
|
5619 |
Numerous examples can be found in the subdirectories src/HOL/Auth,
|
haftmann@25184
|
5620 |
src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
|
haftmann@25184
|
5621 |
|
haftmann@25184
|
5622 |
INCOMPATIBILITIES:
|
haftmann@25184
|
5623 |
|
haftmann@25184
|
5624 |
- Since declaration and definition of inductive sets or predicates
|
haftmann@25184
|
5625 |
is no longer separated, abbreviations involving the newly
|
haftmann@25184
|
5626 |
introduced sets or predicates must be specified together with the
|
haftmann@25184
|
5627 |
introduction rules after the 'where' keyword (see above), rather
|
haftmann@25184
|
5628 |
than before the actual inductive definition.
|
haftmann@25184
|
5629 |
|
haftmann@25184
|
5630 |
- The variables in induction and elimination rules are now
|
haftmann@25184
|
5631 |
quantified in the order of their occurrence in the introduction
|
haftmann@25184
|
5632 |
rules, rather than in alphabetical order. Since this may break
|
haftmann@25184
|
5633 |
some proofs, these proofs either have to be repaired, e.g. by
|
haftmann@25184
|
5634 |
reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
|
haftmann@25184
|
5635 |
statements of the form
|
haftmann@25184
|
5636 |
|
haftmann@25184
|
5637 |
case (rule_i a_i_1 ... a_i_{k_i})
|
haftmann@25184
|
5638 |
|
haftmann@25184
|
5639 |
or the old order of quantification has to be restored by explicitly adding
|
haftmann@25184
|
5640 |
meta-level quantifiers in the introduction rules, i.e.
|
haftmann@25184
|
5641 |
|
haftmann@25184
|
5642 |
| rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
|
haftmann@25184
|
5643 |
|
haftmann@25184
|
5644 |
- The format of the elimination rules is now
|
haftmann@25184
|
5645 |
|
haftmann@25184
|
5646 |
p z_1 ... z_m x_1 ... x_n ==>
|
haftmann@25184
|
5647 |
(!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
|
haftmann@25184
|
5648 |
==> ... ==> P
|
haftmann@25184
|
5649 |
|
haftmann@25184
|
5650 |
for predicates and
|
haftmann@25184
|
5651 |
|
haftmann@25184
|
5652 |
(x_1, ..., x_n) : s z_1 ... z_m ==>
|
haftmann@25184
|
5653 |
(!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
|
haftmann@25184
|
5654 |
==> ... ==> P
|
haftmann@25184
|
5655 |
|
haftmann@25184
|
5656 |
for sets rather than
|
haftmann@25184
|
5657 |
|
haftmann@25184
|
5658 |
x : s z_1 ... z_m ==>
|
haftmann@25184
|
5659 |
(!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
|
haftmann@25184
|
5660 |
==> ... ==> P
|
haftmann@25184
|
5661 |
|
haftmann@25184
|
5662 |
This may require terms in goals to be expanded to n-tuples
|
haftmann@25184
|
5663 |
(e.g. using case_tac or simplification with the split_paired_all
|
haftmann@25184
|
5664 |
rule) before the above elimination rule is applicable.
|
haftmann@25184
|
5665 |
|
haftmann@25184
|
5666 |
- The elimination or case analysis rules for (mutually) inductive
|
haftmann@25184
|
5667 |
sets or predicates are now called "p_1.cases" ... "p_k.cases". The
|
haftmann@25184
|
5668 |
list of rules "p_1_..._p_k.elims" is no longer available.
|
haftmann@25184
|
5669 |
|
krauss@25198
|
5670 |
* New package "function"/"fun" for general recursive functions,
|
krauss@25198
|
5671 |
supporting mutual and nested recursion, definitions in local contexts,
|
krauss@25198
|
5672 |
more general pattern matching and partiality. See HOL/ex/Fundefs.thy
|
krauss@25198
|
5673 |
for small examples, and the separate tutorial on the function
|
krauss@25198
|
5674 |
package. The old recdef "package" is still available as before, but
|
krauss@25198
|
5675 |
users are encouraged to use the new package.
|
krauss@25198
|
5676 |
|
krauss@25198
|
5677 |
* Method "lexicographic_order" automatically synthesizes termination
|
krauss@25198
|
5678 |
relations as lexicographic combinations of size measures.
|
krauss@25198
|
5679 |
|
haftmann@25184
|
5680 |
* Case-expressions allow arbitrary constructor-patterns (including
|
haftmann@25184
|
5681 |
"_") and take their order into account, like in functional
|
haftmann@25184
|
5682 |
programming. Internally, this is translated into nested
|
haftmann@25184
|
5683 |
case-expressions; missing cases are added and mapped to the predefined
|
haftmann@25184
|
5684 |
constant "undefined". In complicated cases printing may no longer show
|
haftmann@25184
|
5685 |
the original input but the internal form. Lambda-abstractions allow
|
haftmann@25184
|
5686 |
the same form of pattern matching: "% pat1 => e1 | ..." is an
|
haftmann@25184
|
5687 |
abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
|
haftmann@25184
|
5688 |
variable.
|
haftmann@25184
|
5689 |
|
haftmann@25184
|
5690 |
* IntDef: The constant "int :: nat => int" has been removed; now "int"
|
haftmann@25184
|
5691 |
is an abbreviation for "of_nat :: nat => int". The simplification
|
haftmann@25184
|
5692 |
rules for "of_nat" have been changed to work like "int" did
|
haftmann@25184
|
5693 |
previously. Potential INCOMPATIBILITY:
|
haftmann@25184
|
5694 |
- "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
|
haftmann@25184
|
5695 |
- of_nat_diff and of_nat_mult are no longer default simp rules
|
haftmann@25184
|
5696 |
|
haftmann@25184
|
5697 |
* Method "algebra" solves polynomial equations over (semi)rings using
|
haftmann@25184
|
5698 |
Groebner bases. The (semi)ring structure is defined by locales and the
|
haftmann@25184
|
5699 |
tool setup depends on that generic context. Installing the method for
|
haftmann@25184
|
5700 |
a specific type involves instantiating the locale and possibly adding
|
haftmann@25184
|
5701 |
declarations for computation on the coefficients. The method is
|
haftmann@25184
|
5702 |
already instantiated for natural numbers and for the axiomatic class
|
haftmann@25184
|
5703 |
of idoms with numerals. See also the paper by Chaieb and Wenzel at
|
haftmann@25184
|
5704 |
CALCULEMUS 2007 for the general principles underlying this
|
haftmann@25184
|
5705 |
architecture of context-aware proof-tools.
|
haftmann@25184
|
5706 |
|
haftmann@25184
|
5707 |
* Method "ferrack" implements quantifier elimination over
|
haftmann@25184
|
5708 |
special-purpose dense linear orders using locales (analogous to
|
haftmann@25184
|
5709 |
"algebra"). The method is already installed for class
|
haftmann@25184
|
5710 |
{ordered_field,recpower,number_ring} which subsumes real, hyperreal,
|
haftmann@25184
|
5711 |
rat, etc.
|
haftmann@25184
|
5712 |
|
haftmann@25184
|
5713 |
* Former constant "List.op @" now named "List.append". Use ML
|
haftmann@25184
|
5714 |
antiquotations @{const_name List.append} or @{term " ... @ ... "} to
|
haftmann@25184
|
5715 |
circumvent possible incompatibilities when working on ML level.
|
haftmann@25184
|
5716 |
|
haftmann@25184
|
5717 |
* primrec: missing cases mapped to "undefined" instead of "arbitrary".
|
haftmann@25184
|
5718 |
|
haftmann@25184
|
5719 |
* New function listsum :: 'a list => 'a for arbitrary monoids.
|
haftmann@25184
|
5720 |
Special syntax: "SUM x <- xs. f x" (and latex variants)
|
haftmann@25184
|
5721 |
|
haftmann@25184
|
5722 |
* New syntax for Haskell-like list comprehension (input only), eg.
|
haftmann@25184
|
5723 |
[(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
|
haftmann@25184
|
5724 |
|
haftmann@25184
|
5725 |
* The special syntax for function "filter" has changed from [x :
|
haftmann@25184
|
5726 |
xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
|
haftmann@25184
|
5727 |
comprehension syntax, and for uniformity. INCOMPATIBILITY.
|
haftmann@25184
|
5728 |
|
haftmann@25184
|
5729 |
* [a..b] is now defined for arbitrary linear orders. It used to be
|
haftmann@25184
|
5730 |
defined on nat only, as an abbreviation for [a..<Suc b]
|
haftmann@25184
|
5731 |
INCOMPATIBILITY.
|
haftmann@25184
|
5732 |
|
haftmann@25184
|
5733 |
* Renamed lemma "set_take_whileD" to "set_takeWhileD".
|
haftmann@25184
|
5734 |
|
haftmann@25184
|
5735 |
* New functions "sorted" and "sort" in src/HOL/List.thy.
|
haftmann@25184
|
5736 |
|
haftmann@25184
|
5737 |
* New lemma collection field_simps (an extension of ring_simps) for
|
haftmann@25184
|
5738 |
manipulating (in)equations involving division. Multiplies with all
|
haftmann@25184
|
5739 |
denominators that can be proved to be non-zero (in equations) or
|
haftmann@25184
|
5740 |
positive/negative (in inequations).
|
haftmann@25184
|
5741 |
|
haftmann@25184
|
5742 |
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
|
haftmann@25184
|
5743 |
have been improved and renamed to ring_simps, group_simps and
|
haftmann@25184
|
5744 |
ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
|
haftmann@25184
|
5745 |
because they were subsumed by lemmas xyz. INCOMPATIBILITY.
|
haftmann@25184
|
5746 |
|
haftmann@25184
|
5747 |
* Theory Library/Commutative_Ring: switched from recdef to function
|
haftmann@25184
|
5748 |
package; constants add, mul, pow now curried. Infix syntax for
|
haftmann@25184
|
5749 |
algebraic operations.
|
haftmann@25163
|
5750 |
|
wenzelm@24800
|
5751 |
* Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
|
haftmann@22218
|
5752 |
INCOMPATIBILITY.
|
haftmann@22218
|
5753 |
|
wenzelm@24800
|
5754 |
* Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
|
haftmann@22218
|
5755 |
INCOMPATIBILITY.
|
haftmann@22218
|
5756 |
|
wenzelm@22126
|
5757 |
* HOL/records: generalised field-update to take a function on the
|
wenzelm@22126
|
5758 |
field rather than the new value: r(|A := x|) is translated to A_update
|
wenzelm@22126
|
5759 |
(K x) r The K-combinator that is internally used is called K_record.
|
schirmer@21226
|
5760 |
INCOMPATIBILITY: Usage of the plain update functions has to be
|
schirmer@21226
|
5761 |
adapted.
|
schirmer@21226
|
5762 |
|
wenzelm@24800
|
5763 |
* Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
|
wenzelm@24800
|
5764 |
* x = 0, which are required for a semiring. Richer structures do not
|
wenzelm@24800
|
5765 |
inherit from semiring_0 anymore, because this property is a theorem
|
wenzelm@24800
|
5766 |
there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
|
wenzelm@24800
|
5767 |
there is more to prove, but this is mostly trivial.
|
wenzelm@24800
|
5768 |
|
wenzelm@24800
|
5769 |
* Class "recpower" is generalized to arbitrary monoids, not just
|
wenzelm@24800
|
5770 |
commutative semirings. INCOMPATIBILITY: may need to incorporate
|
haftmann@25163
|
5771 |
commutativity or semiring properties additionally.
|
wenzelm@22126
|
5772 |
|
wenzelm@22126
|
5773 |
* Constant "List.list_all2" in List.thy now uses authentic syntax.
|
wenzelm@24800
|
5774 |
INCOMPATIBILITY: translations containing list_all2 may go wrong,
|
wenzelm@24800
|
5775 |
better use 'abbreviation'.
|
wenzelm@24800
|
5776 |
|
wenzelm@24800
|
5777 |
* Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
|
wenzelm@24800
|
5778 |
|
wenzelm@22126
|
5779 |
* Numeral syntax: type 'bin' which was a mere type copy of 'int' has
|
wenzelm@24800
|
5780 |
been abandoned in favour of plain 'int'. INCOMPATIBILITY --
|
wenzelm@22126
|
5781 |
significant changes for setting up numeral syntax for types:
|
wenzelm@24800
|
5782 |
- New constants Numeral.pred and Numeral.succ instead
|
haftmann@20485
|
5783 |
of former Numeral.bin_pred and Numeral.bin_succ.
|
haftmann@20485
|
5784 |
- Use integer operations instead of bin_add, bin_mult and so on.
|
haftmann@20485
|
5785 |
- Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
|
haftmann@20485
|
5786 |
- ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
|
haftmann@20485
|
5787 |
|
wenzelm@25177
|
5788 |
See src/HOL/Integ/IntArith.thy for an example setup.
|
wenzelm@25177
|
5789 |
|
wenzelm@25177
|
5790 |
* Command 'normal_form' computes the normal form of a term that may
|
wenzelm@25177
|
5791 |
contain free variables. For example ``normal_form "rev [a, b, c]"''
|
wenzelm@25177
|
5792 |
produces ``[b, c, a]'' (without proof). This command is suitable for
|
wenzelm@25177
|
5793 |
heavy-duty computations because the functions are compiled to ML
|
wenzelm@25177
|
5794 |
first. Correspondingly, a method "normalization" is provided. See
|
wenzelm@25177
|
5795 |
further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
|
nipkow@19895
|
5796 |
|
wenzelm@17996
|
5797 |
* Alternative iff syntax "A <-> B" for equality on bool (with priority
|
wenzelm@17996
|
5798 |
25 like -->); output depends on the "iff" print_mode, the default is
|
wenzelm@17996
|
5799 |
"A = B" (with priority 50).
|
wenzelm@17996
|
5800 |
|
wenzelm@21265
|
5801 |
* Relations less (<) and less_eq (<=) are also available on type bool.
|
wenzelm@21265
|
5802 |
Modified syntax to disallow nesting without explicit parentheses,
|
wenzelm@24800
|
5803 |
e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
|
wenzelm@24800
|
5804 |
INCOMPATIBILITY.
|
wenzelm@21265
|
5805 |
|
nipkow@18674
|
5806 |
* "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
|
nipkow@18674
|
5807 |
|
krauss@20716
|
5808 |
* Relation composition operator "op O" now has precedence 75 and binds
|
krauss@20716
|
5809 |
stronger than union and intersection. INCOMPATIBILITY.
|
krauss@20716
|
5810 |
|
wenzelm@22126
|
5811 |
* The old set interval syntax "{m..n(}" (and relatives) has been
|
wenzelm@22126
|
5812 |
removed. Use "{m..<n}" (and relatives) instead.
|
nipkow@19377
|
5813 |
|
wenzelm@17865
|
5814 |
* In the context of the assumption "~(s = t)" the Simplifier rewrites
|
wenzelm@24800
|
5815 |
"t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
|
wenzelm@24800
|
5816 |
``declare [[simproc del: neq]]''.
|
wenzelm@24800
|
5817 |
|
wenzelm@24800
|
5818 |
* Simplifier: "m dvd n" where m and n are numbers is evaluated to
|
wenzelm@24800
|
5819 |
True/False.
|
wenzelm@24800
|
5820 |
|
wenzelm@24800
|
5821 |
* Theorem Cons_eq_map_conv no longer declared as "simp".
|
nipkow@19211
|
5822 |
|
ballarin@19279
|
5823 |
* Theorem setsum_mult renamed to setsum_right_distrib.
|
ballarin@19279
|
5824 |
|
nipkow@19211
|
5825 |
* Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
|
wenzelm@22126
|
5826 |
``rule'' method.
|
wenzelm@22126
|
5827 |
|
wenzelm@24800
|
5828 |
* Reimplemented methods "sat" and "satx", with several improvements:
|
wenzelm@24800
|
5829 |
goals no longer need to be stated as "<prems> ==> False", equivalences
|
wenzelm@24800
|
5830 |
(i.e. "=" on type bool) are handled, variable names of the form
|
wenzelm@24800
|
5831 |
"lit_<n>" are no longer reserved, significant speedup.
|
wenzelm@24800
|
5832 |
|
wenzelm@24800
|
5833 |
* Methods "sat" and "satx" can now replay MiniSat proof traces.
|
wenzelm@22126
|
5834 |
zChaff is still supported as well.
|
wenzelm@22126
|
5835 |
|
wenzelm@22126
|
5836 |
* 'inductive' and 'datatype': provide projections of mutual rules,
|
wenzelm@22126
|
5837 |
bundled as foo_bar.inducts;
|
wenzelm@22126
|
5838 |
|
wenzelm@22126
|
5839 |
* Library: moved theories Parity, GCD, Binomial, Infinite_Set to
|
wenzelm@22126
|
5840 |
Library.
|
wenzelm@21256
|
5841 |
|
wenzelm@21256
|
5842 |
* Library: moved theory Accessible_Part to main HOL.
|
wenzelm@19572
|
5843 |
|
wenzelm@18446
|
5844 |
* Library: added theory Coinductive_List of potentially infinite lists
|
wenzelm@18446
|
5845 |
as greatest fixed-point.
|
wenzelm@18399
|
5846 |
|
wenzelm@19254
|
5847 |
* Library: added theory AssocList which implements (finite) maps as
|
schirmer@19252
|
5848 |
association lists.
|
webertj@17809
|
5849 |
|
wenzelm@24800
|
5850 |
* Method "evaluation" solves goals (i.e. a boolean expression)
|
wenzelm@24800
|
5851 |
efficiently by compiling it to ML. The goal is "proved" (via an
|
wenzelm@24800
|
5852 |
oracle) if it evaluates to True.
|
wenzelm@20807
|
5853 |
|
wenzelm@20807
|
5854 |
* Linear arithmetic now splits certain operators (e.g. min, max, abs)
|
wenzelm@24800
|
5855 |
also when invoked by the simplifier. This results in the Simplifier
|
wenzelm@24800
|
5856 |
being more powerful on arithmetic goals. INCOMPATIBILITY.
|
wenzelm@24800
|
5857 |
Configuration option fast_arith_split_limit=0 recovers the old
|
wenzelm@24800
|
5858 |
behavior.
|
webertj@20217
|
5859 |
|
wenzelm@22126
|
5860 |
* Support for hex (0x20) and binary (0b1001) numerals.
|
wenzelm@19254
|
5861 |
|
wenzelm@20807
|
5862 |
* New method: reify eqs (t), where eqs are equations for an
|
wenzelm@20807
|
5863 |
interpretation I :: 'a list => 'b => 'c and t::'c is an optional
|
wenzelm@20807
|
5864 |
parameter, computes a term s::'b and a list xs::'a list and proves the
|
wenzelm@20807
|
5865 |
theorem I xs s = t. This is also known as reification or quoting. The
|
wenzelm@20807
|
5866 |
resulting theorem is applied to the subgoal to substitute t with I xs
|
wenzelm@20807
|
5867 |
s. If t is omitted, the subgoal itself is reified.
|
wenzelm@20807
|
5868 |
|
wenzelm@20807
|
5869 |
* New method: reflection corr_thm eqs (t). The parameters eqs and (t)
|
wenzelm@20807
|
5870 |
are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
|
wenzelm@20807
|
5871 |
where f is supposed to be a computable function (in the sense of code
|
wenzelm@20807
|
5872 |
generattion). The method uses reify to compute s and xs as above then
|
wenzelm@20807
|
5873 |
applies corr_thm and uses normalization by evaluation to "prove" f s =
|
wenzelm@20807
|
5874 |
r and finally gets the theorem t = r, which is again applied to the
|
wenzelm@25177
|
5875 |
subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
|
wenzelm@25177
|
5876 |
|
wenzelm@25177
|
5877 |
* Reflection: Automatic reification now handels binding, an example is
|
wenzelm@25177
|
5878 |
available in src/HOL/ex/ReflectionEx.thy
|
wenzelm@20807
|
5879 |
|
wenzelm@25397
|
5880 |
* HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
|
schirmer@25409
|
5881 |
command 'statespace' that is similar to 'record', but introduces an
|
wenzelm@25397
|
5882 |
abstract specification based on the locale infrastructure instead of
|
wenzelm@25397
|
5883 |
HOL types. This leads to extra flexibility in composing state spaces,
|
wenzelm@25397
|
5884 |
in particular multiple inheritance and renaming of components.
|
wenzelm@25397
|
5885 |
|
wenzelm@25397
|
5886 |
|
wenzelm@19653
|
5887 |
*** HOL-Complex ***
|
wenzelm@19653
|
5888 |
|
huffman@22971
|
5889 |
* Hyperreal: Functions root and sqrt are now defined on negative real
|
huffman@22971
|
5890 |
inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
|
huffman@22971
|
5891 |
Nonnegativity side conditions have been removed from many lemmas, so
|
huffman@22971
|
5892 |
that more subgoals may now be solved by simplification; potential
|
huffman@22971
|
5893 |
INCOMPATIBILITY.
|
huffman@22971
|
5894 |
|
wenzelm@24800
|
5895 |
* Real: new type classes formalize real normed vector spaces and
|
huffman@21791
|
5896 |
algebras, using new overloaded constants scaleR :: real => 'a => 'a
|
huffman@21791
|
5897 |
and norm :: 'a => real.
|
huffman@21791
|
5898 |
|
wenzelm@24800
|
5899 |
* Real: constant of_real :: real => 'a::real_algebra_1 injects from
|
wenzelm@24800
|
5900 |
reals into other types. The overloaded constant Reals :: 'a set is now
|
wenzelm@24800
|
5901 |
defined as range of_real; potential INCOMPATIBILITY.
|
wenzelm@24800
|
5902 |
|
wenzelm@24800
|
5903 |
* Real: proper support for ML code generation, including 'quickcheck'.
|
nipkow@23013
|
5904 |
Reals are implemented as arbitrary precision rationals.
|
nipkow@23013
|
5905 |
|
wenzelm@22126
|
5906 |
* Hyperreal: Several constants that previously worked only for the
|
wenzelm@22126
|
5907 |
reals have been generalized, so they now work over arbitrary vector
|
wenzelm@22126
|
5908 |
spaces. Type annotations may need to be added in some cases; potential
|
wenzelm@22126
|
5909 |
INCOMPATIBILITY.
|
huffman@21791
|
5910 |
|
huffman@22972
|
5911 |
Infinitesimal :: ('a::real_normed_vector) star set
|
huffman@22972
|
5912 |
HFinite :: ('a::real_normed_vector) star set
|
huffman@22972
|
5913 |
HInfinite :: ('a::real_normed_vector) star set
|
huffman@21791
|
5914 |
approx :: ('a::real_normed_vector) star => 'a star => bool
|
huffman@21791
|
5915 |
monad :: ('a::real_normed_vector) star => 'a star set
|
huffman@21791
|
5916 |
galaxy :: ('a::real_normed_vector) star => 'a star set
|
huffman@22972
|
5917 |
(NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
|
huffman@21791
|
5918 |
(NS)convergent :: (nat => 'a::real_normed_vector) => bool
|
huffman@21791
|
5919 |
(NS)Bseq :: (nat => 'a::real_normed_vector) => bool
|
huffman@21791
|
5920 |
(NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
|
huffman@21791
|
5921 |
(NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
|
huffman@21791
|
5922 |
is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
|
huffman@21791
|
5923 |
deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
|
huffman@22972
|
5924 |
sgn :: 'a::real_normed_vector => 'a
|
huffman@23116
|
5925 |
exp :: 'a::{recpower,real_normed_field,banach} => 'a
|
huffman@21791
|
5926 |
|
huffman@21791
|
5927 |
* Complex: Some complex-specific constants are now abbreviations for
|
wenzelm@22126
|
5928 |
overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
|
wenzelm@22126
|
5929 |
hnorm. Other constants have been entirely removed in favor of the
|
wenzelm@22126
|
5930 |
polymorphic versions (INCOMPATIBILITY):
|
huffman@21791
|
5931 |
|
huffman@21791
|
5932 |
approx <-- capprox
|
huffman@21791
|
5933 |
HFinite <-- CFinite
|
huffman@21791
|
5934 |
HInfinite <-- CInfinite
|
huffman@21791
|
5935 |
Infinitesimal <-- CInfinitesimal
|
huffman@21791
|
5936 |
monad <-- cmonad
|
huffman@21791
|
5937 |
galaxy <-- cgalaxy
|
huffman@21791
|
5938 |
(NS)LIM <-- (NS)CLIM, (NS)CRLIM
|
huffman@21791
|
5939 |
is(NS)Cont <-- is(NS)Contc, is(NS)contCR
|
huffman@21791
|
5940 |
(ns)deriv <-- (ns)cderiv
|
huffman@21791
|
5941 |
|
wenzelm@19653
|
5942 |
|
wenzelm@24801
|
5943 |
*** HOL-Algebra ***
|
wenzelm@24801
|
5944 |
|
wenzelm@24801
|
5945 |
* Formalisation of ideals and the quotient construction over rings.
|
wenzelm@24801
|
5946 |
|
wenzelm@24801
|
5947 |
* Order and lattice theory no longer based on records.
|
wenzelm@24801
|
5948 |
INCOMPATIBILITY.
|
wenzelm@24801
|
5949 |
|
wenzelm@24801
|
5950 |
* Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
|
wenzelm@24801
|
5951 |
greatest_closed. INCOMPATIBILITY.
|
wenzelm@24801
|
5952 |
|
wenzelm@24801
|
5953 |
* Method algebra is now set up via an attribute. For examples see
|
wenzelm@24801
|
5954 |
Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
|
wenzelm@24801
|
5955 |
of algebraic structures.
|
wenzelm@24801
|
5956 |
|
wenzelm@24801
|
5957 |
* Renamed theory CRing to Ring.
|
wenzelm@24801
|
5958 |
|
wenzelm@24801
|
5959 |
|
wenzelm@24801
|
5960 |
*** HOL-Nominal ***
|
wenzelm@24801
|
5961 |
|
wenzelm@25148
|
5962 |
* Substantial, yet incomplete support for nominal datatypes (binding
|
wenzelm@25177
|
5963 |
structures) based on HOL-Nominal logic. See src/HOL/Nominal and
|
wenzelm@25177
|
5964 |
src/HOL/Nominal/Examples. Prospective users should consult
|
wenzelm@25148
|
5965 |
http://isabelle.in.tum.de/nominal/
|
wenzelm@25148
|
5966 |
|
wenzelm@24801
|
5967 |
|
wenzelm@17878
|
5968 |
*** ML ***
|
wenzelm@17878
|
5969 |
|
wenzelm@24643
|
5970 |
* ML basics: just one true type int, which coincides with IntInf.int
|
wenzelm@24643
|
5971 |
(even on SML/NJ).
|
wenzelm@24643
|
5972 |
|
wenzelm@22138
|
5973 |
* ML within Isar: antiquotations allow to embed statically-checked
|
wenzelm@22138
|
5974 |
formal entities in the source, referring to the context available at
|
wenzelm@22138
|
5975 |
compile-time. For example:
|
wenzelm@22138
|
5976 |
|
wenzelm@25142
|
5977 |
ML {* @{sort "{zero,one}"} *}
|
wenzelm@22138
|
5978 |
ML {* @{typ "'a => 'b"} *}
|
wenzelm@22138
|
5979 |
ML {* @{term "%x. x"} *}
|
wenzelm@22138
|
5980 |
ML {* @{prop "x == y"} *}
|
wenzelm@22138
|
5981 |
ML {* @{ctyp "'a => 'b"} *}
|
wenzelm@22138
|
5982 |
ML {* @{cterm "%x. x"} *}
|
wenzelm@22138
|
5983 |
ML {* @{cprop "x == y"} *}
|
wenzelm@22138
|
5984 |
ML {* @{thm asm_rl} *}
|
wenzelm@22138
|
5985 |
ML {* @{thms asm_rl} *}
|
wenzelm@24692
|
5986 |
ML {* @{type_name c} *}
|
wenzelm@25142
|
5987 |
ML {* @{type_syntax c} *}
|
wenzelm@22376
|
5988 |
ML {* @{const_name c} *}
|
wenzelm@22376
|
5989 |
ML {* @{const_syntax c} *}
|
wenzelm@22138
|
5990 |
ML {* @{context} *}
|
wenzelm@22138
|
5991 |
ML {* @{theory} *}
|
wenzelm@22138
|
5992 |
ML {* @{theory Pure} *}
|
wenzelm@24692
|
5993 |
ML {* @{theory_ref} *}
|
wenzelm@24692
|
5994 |
ML {* @{theory_ref Pure} *}
|
wenzelm@22138
|
5995 |
ML {* @{simpset} *}
|
wenzelm@22138
|
5996 |
ML {* @{claset} *}
|
wenzelm@22138
|
5997 |
ML {* @{clasimpset} *}
|
wenzelm@22138
|
5998 |
|
wenzelm@22151
|
5999 |
The same works for sources being ``used'' within an Isar context.
|
wenzelm@22151
|
6000 |
|
wenzelm@22152
|
6001 |
* ML in Isar: improved error reporting; extra verbosity with
|
wenzelm@24706
|
6002 |
ML_Context.trace enabled.
|
wenzelm@22152
|
6003 |
|
wenzelm@19032
|
6004 |
* Pure/General/table.ML: the join operations now works via exceptions
|
wenzelm@24706
|
6005 |
DUP/SAME instead of type option. This is simpler in simple cases, and
|
wenzelm@19081
|
6006 |
admits slightly more efficient complex applications.
|
wenzelm@18446
|
6007 |
|
wenzelm@24800
|
6008 |
* Pure: 'advanced' translation functions (parse_translation etc.) now
|
wenzelm@24800
|
6009 |
use Context.generic instead of just theory.
|
wenzelm@24800
|
6010 |
|
wenzelm@18642
|
6011 |
* Pure: datatype Context.generic joins theory/Proof.context and
|
wenzelm@18644
|
6012 |
provides some facilities for code that works in either kind of
|
wenzelm@18642
|
6013 |
context, notably GenericDataFun for uniform theory and proof data.
|
wenzelm@18642
|
6014 |
|
wenzelm@18737
|
6015 |
* Pure: simplified internal attribute type, which is now always
|
wenzelm@24706
|
6016 |
Context.generic * thm -> Context.generic * thm. Global (theory) vs.
|
wenzelm@24706
|
6017 |
local (Proof.context) attributes have been discontinued, while
|
wenzelm@24706
|
6018 |
minimizing code duplication. Thm.rule_attribute and
|
wenzelm@24706
|
6019 |
Thm.declaration_attribute build canonical attributes; see also structure
|
wenzelm@24706
|
6020 |
Context for further operations on Context.generic, notably
|
wenzelm@24706
|
6021 |
GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
|
wenzelm@19006
|
6022 |
declarations and definitions.
|
wenzelm@19006
|
6023 |
|
wenzelm@24800
|
6024 |
* Context data interfaces (Theory/Proof/GenericDataFun): removed
|
wenzelm@24800
|
6025 |
name/print, uninitialized data defaults to ad-hoc copy of empty value,
|
wenzelm@24800
|
6026 |
init only required for impure data. INCOMPATIBILITY: empty really need
|
wenzelm@24800
|
6027 |
to be empty (no dependencies on theory content!)
|
wenzelm@24800
|
6028 |
|
wenzelm@19508
|
6029 |
* Pure/kernel: consts certification ignores sort constraints given in
|
wenzelm@24800
|
6030 |
signature declarations. (This information is not relevant to the
|
wenzelm@24800
|
6031 |
logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
|
wenzelm@24800
|
6032 |
potential INCOMPATIBILITY.
|
wenzelm@19508
|
6033 |
|
wenzelm@19508
|
6034 |
* Pure: axiomatic type classes are now purely definitional, with
|
wenzelm@19508
|
6035 |
explicit proofs of class axioms and super class relations performed
|
wenzelm@24706
|
6036 |
internally. See Pure/axclass.ML for the main internal interfaces --
|
wenzelm@36856
|
6037 |
notably AxClass.define_class supercedes AxClass.add_axclass, and
|
wenzelm@24706
|
6038 |
AxClass.axiomatize_class/classrel/arity supersede
|
wenzelm@19508
|
6039 |
Sign.add_classes/classrel/arities.
|
wenzelm@19508
|
6040 |
|
wenzelm@19006
|
6041 |
* Pure/Isar: Args/Attrib parsers operate on Context.generic --
|
wenzelm@19006
|
6042 |
global/local versions on theory vs. Proof.context have been
|
wenzelm@19006
|
6043 |
discontinued; Attrib.syntax and Method.syntax have been adapted
|
wenzelm@19006
|
6044 |
accordingly. INCOMPATIBILITY, need to adapt parser expressions for
|
wenzelm@19006
|
6045 |
attributes, methods, etc.
|
wenzelm@18642
|
6046 |
|
wenzelm@18446
|
6047 |
* Pure: several functions of signature "... -> theory -> theory * ..."
|
wenzelm@18446
|
6048 |
have been reoriented to "... -> theory -> ... * theory" in order to
|
wenzelm@18446
|
6049 |
allow natural usage in combination with the ||>, ||>>, |-> and
|
wenzelm@18446
|
6050 |
fold_map combinators.
|
haftmann@18051
|
6051 |
|
wenzelm@21647
|
6052 |
* Pure: official theorem names (closed derivations) and additional
|
wenzelm@21647
|
6053 |
comments (tags) are now strictly separate. Name hints -- which are
|
wenzelm@21647
|
6054 |
maintained as tags -- may be attached any time without affecting the
|
wenzelm@21647
|
6055 |
derivation.
|
wenzelm@21647
|
6056 |
|
wenzelm@18020
|
6057 |
* Pure: primitive rule lift_rule now takes goal cterm instead of an
|
wenzelm@18145
|
6058 |
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
|
wenzelm@18020
|
6059 |
achieve the old behaviour.
|
wenzelm@18020
|
6060 |
|
wenzelm@18020
|
6061 |
* Pure: the "Goal" constant is now called "prop", supporting a
|
wenzelm@18020
|
6062 |
slightly more general idea of ``protecting'' meta-level rule
|
wenzelm@18020
|
6063 |
statements.
|
wenzelm@18020
|
6064 |
|
wenzelm@20040
|
6065 |
* Pure: Logic.(un)varify only works in a global context, which is now
|
wenzelm@20040
|
6066 |
enforced instead of silently assumed. INCOMPATIBILITY, may use
|
wenzelm@20040
|
6067 |
Logic.legacy_(un)varify as temporary workaround.
|
wenzelm@20040
|
6068 |
|
wenzelm@20090
|
6069 |
* Pure: structure Name provides scalable operations for generating
|
wenzelm@20090
|
6070 |
internal variable names, notably Name.variants etc. This replaces
|
wenzelm@20090
|
6071 |
some popular functions from term.ML:
|
wenzelm@20090
|
6072 |
|
wenzelm@20090
|
6073 |
Term.variant -> Name.variant
|
wenzelm@24800
|
6074 |
Term.variantlist -> Name.variant_list
|
wenzelm@20090
|
6075 |
Term.invent_names -> Name.invent_list
|
wenzelm@20090
|
6076 |
|
wenzelm@20090
|
6077 |
Note that low-level renaming rarely occurs in new code -- operations
|
wenzelm@20090
|
6078 |
from structure Variable are used instead (see below).
|
wenzelm@20090
|
6079 |
|
wenzelm@20040
|
6080 |
* Pure: structure Variable provides fundamental operations for proper
|
wenzelm@20040
|
6081 |
treatment of fixed/schematic variables in a context. For example,
|
wenzelm@20040
|
6082 |
Variable.import introduces fixes for schematics of given facts and
|
wenzelm@20040
|
6083 |
Variable.export reverses the effect (up to renaming) -- this replaces
|
wenzelm@20040
|
6084 |
various freeze_thaw operations.
|
wenzelm@20040
|
6085 |
|
wenzelm@18567
|
6086 |
* Pure: structure Goal provides simple interfaces for
|
wenzelm@17981
|
6087 |
init/conclude/finish and tactical prove operations (replacing former
|
wenzelm@20040
|
6088 |
Tactic.prove). Goal.prove is the canonical way to prove results
|
wenzelm@20040
|
6089 |
within a given context; Goal.prove_global is a degraded version for
|
wenzelm@20040
|
6090 |
theory level goals, including a global Drule.standard. Note that
|
wenzelm@20040
|
6091 |
OldGoals.prove_goalw_cterm has long been obsolete, since it is
|
wenzelm@20040
|
6092 |
ill-behaved in a local proof context (e.g. with local fixes/assumes or
|
wenzelm@20040
|
6093 |
in a locale context).
|
wenzelm@17981
|
6094 |
|
wenzelm@24706
|
6095 |
* Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
|
wenzelm@24706
|
6096 |
and type checking (Syntax.check_term etc.), with common combinations
|
wenzelm@24706
|
6097 |
(Syntax.read_term etc.). These supersede former Sign.read_term etc.
|
wenzelm@24706
|
6098 |
which are considered legacy and await removal.
|
wenzelm@24706
|
6099 |
|
wenzelm@24920
|
6100 |
* Pure/Syntax: generic interfaces for type unchecking
|
wenzelm@24920
|
6101 |
(Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
|
wenzelm@24920
|
6102 |
with common combinations (Syntax.pretty_term, Syntax.string_of_term
|
wenzelm@24920
|
6103 |
etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
|
wenzelm@24924
|
6104 |
available for convenience, but refer to the very same operations using
|
wenzelm@24924
|
6105 |
a mere theory instead of a full context.
|
wenzelm@24920
|
6106 |
|
wenzelm@18815
|
6107 |
* Isar: simplified treatment of user-level errors, using exception
|
wenzelm@18687
|
6108 |
ERROR of string uniformly. Function error now merely raises ERROR,
|
wenzelm@18686
|
6109 |
without any side effect on output channels. The Isar toplevel takes
|
wenzelm@18686
|
6110 |
care of proper display of ERROR exceptions. ML code may use plain
|
wenzelm@18686
|
6111 |
handle/can/try; cat_error may be used to concatenate errors like this:
|
wenzelm@18686
|
6112 |
|
wenzelm@18686
|
6113 |
... handle ERROR msg => cat_error msg "..."
|
wenzelm@18686
|
6114 |
|
wenzelm@18686
|
6115 |
Toplevel ML code (run directly or through the Isar toplevel) may be
|
wenzelm@18687
|
6116 |
embedded into the Isar toplevel with exception display/debug like
|
wenzelm@18687
|
6117 |
this:
|
wenzelm@18686
|
6118 |
|
wenzelm@18686
|
6119 |
Isar.toplevel (fn () => ...)
|
wenzelm@18686
|
6120 |
|
wenzelm@18686
|
6121 |
INCOMPATIBILITY, removed special transform_error facilities, removed
|
wenzelm@18686
|
6122 |
obsolete variants of user-level exceptions (ERROR_MESSAGE,
|
wenzelm@18686
|
6123 |
Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
|
wenzelm@18686
|
6124 |
-- use plain ERROR instead.
|
wenzelm@18686
|
6125 |
|
wenzelm@18815
|
6126 |
* Isar: theory setup now has type (theory -> theory), instead of a
|
wenzelm@18722
|
6127 |
list. INCOMPATIBILITY, may use #> to compose setup functions.
|
wenzelm@18722
|
6128 |
|
wenzelm@24706
|
6129 |
* Isar: ML toplevel pretty printer for type Proof.context, subject to
|
wenzelm@24706
|
6130 |
ProofContext.debug/verbose flags.
|
wenzelm@18815
|
6131 |
|
wenzelm@18815
|
6132 |
* Isar: Toplevel.theory_to_proof admits transactions that modify the
|
wenzelm@18815
|
6133 |
theory before entering a proof state. Transactions now always see a
|
wenzelm@18815
|
6134 |
quasi-functional intermediate checkpoint, both in interactive and
|
wenzelm@18590
|
6135 |
batch mode.
|
wenzelm@18567
|
6136 |
|
wenzelm@24867
|
6137 |
* Isar: simplified interfaces for outer syntax. Renamed
|
wenzelm@24867
|
6138 |
OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
|
wenzelm@24867
|
6139 |
OuterSyntax.add_parsers -- this functionality is now included in
|
wenzelm@24867
|
6140 |
OuterSyntax.command etc. INCOMPATIBILITY.
|
wenzelm@24867
|
6141 |
|
wenzelm@17878
|
6142 |
* Simplifier: the simpset of a running simplification process now
|
wenzelm@17878
|
6143 |
contains a proof context (cf. Simplifier.the_context), which is the
|
wenzelm@17878
|
6144 |
very context that the initial simpset has been retrieved from (by
|
wenzelm@17890
|
6145 |
simpset_of/local_simpset_of). Consequently, all plug-in components
|
wenzelm@17878
|
6146 |
(solver, looper etc.) may depend on arbitrary proof data.
|
wenzelm@17878
|
6147 |
|
wenzelm@17878
|
6148 |
* Simplifier.inherit_context inherits the proof context (plus the
|
wenzelm@17878
|
6149 |
local bounds) of the current simplification process; any simproc
|
wenzelm@17878
|
6150 |
etc. that calls the Simplifier recursively should do this! Removed
|
wenzelm@17878
|
6151 |
former Simplifier.inherit_bounds, which is already included here --
|
wenzelm@17890
|
6152 |
INCOMPATIBILITY. Tools based on low-level rewriting may even have to
|
wenzelm@17890
|
6153 |
specify an explicit context using Simplifier.context/theory_context.
|
wenzelm@17878
|
6154 |
|
wenzelm@17878
|
6155 |
* Simplifier/Classical Reasoner: more abstract interfaces
|
wenzelm@17878
|
6156 |
change_simpset/claset for modifying the simpset/claset reference of a
|
wenzelm@17878
|
6157 |
theory; raw versions simpset/claset_ref etc. have been discontinued --
|
wenzelm@17878
|
6158 |
INCOMPATIBILITY.
|
wenzelm@17878
|
6159 |
|
wenzelm@18540
|
6160 |
* Provers: more generic wrt. syntax of object-logics, avoid hardwired
|
wenzelm@18540
|
6161 |
"Trueprop" etc.
|
wenzelm@18540
|
6162 |
|
wenzelm@17878
|
6163 |
|
wenzelm@20988
|
6164 |
*** System ***
|
wenzelm@20988
|
6165 |
|
wenzelm@25433
|
6166 |
* settings: the default heap location within ISABELLE_HOME_USER now
|
wenzelm@25433
|
6167 |
includes ISABELLE_IDENTIFIER. This simplifies use of multiple
|
wenzelm@25433
|
6168 |
Isabelle installations.
|
wenzelm@21471
|
6169 |
|
wenzelm@20988
|
6170 |
* isabelle-process: option -S (secure mode) disables some critical
|
wenzelm@20988
|
6171 |
operations, notably runtime compilation and evaluation of ML source
|
wenzelm@20988
|
6172 |
code.
|
wenzelm@20988
|
6173 |
|
wenzelm@24891
|
6174 |
* Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
|
wenzelm@24891
|
6175 |
|
wenzelm@24801
|
6176 |
* Support for parallel execution, using native multicore support of
|
wenzelm@24800
|
6177 |
Poly/ML 5.1. The theory loader exploits parallelism when processing
|
wenzelm@24800
|
6178 |
independent theories, according to the given theory header
|
wenzelm@24800
|
6179 |
specifications. The maximum number of worker threads is specified via
|
wenzelm@24800
|
6180 |
usedir option -M or the "max-threads" setting in Proof General. A
|
wenzelm@24800
|
6181 |
speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
|
wenzelm@24800
|
6182 |
to 6 on a 8-core machine. User-code needs to observe certain
|
wenzelm@24800
|
6183 |
guidelines for thread-safe programming, see appendix A in the Isar
|
wenzelm@24800
|
6184 |
Implementation manual.
|
wenzelm@24210
|
6185 |
|
wenzelm@17754
|
6186 |
|
wenzelm@25448
|
6187 |
|
wenzelm@17720
|
6188 |
New in Isabelle2005 (October 2005)
|
wenzelm@17720
|
6189 |
----------------------------------
|
wenzelm@14655
|
6190 |
|
wenzelm@14655
|
6191 |
*** General ***
|
wenzelm@14655
|
6192 |
|
nipkow@15130
|
6193 |
* Theory headers: the new header syntax for Isar theories is
|
nipkow@15130
|
6194 |
|
nipkow@15130
|
6195 |
theory <name>
|
wenzelm@16234
|
6196 |
imports <theory1> ... <theoryN>
|
wenzelm@16234
|
6197 |
uses <file1> ... <fileM>
|
nipkow@15130
|
6198 |
begin
|
nipkow@15130
|
6199 |
|
wenzelm@16234
|
6200 |
where the 'uses' part is optional. The previous syntax
|
wenzelm@16234
|
6201 |
|
wenzelm@16234
|
6202 |
theory <name> = <theory1> + ... + <theoryN>:
|
wenzelm@16234
|
6203 |
|
wenzelm@16717
|
6204 |
will disappear in the next release. Use isatool fixheaders to convert
|
wenzelm@16717
|
6205 |
existing theory files. Note that there is no change in ancient
|
wenzelm@17371
|
6206 |
non-Isar theories now, but these will disappear soon.
|
nipkow@15130
|
6207 |
|
berghofe@15475
|
6208 |
* Theory loader: parent theories can now also be referred to via
|
wenzelm@16234
|
6209 |
relative and absolute paths.
|
wenzelm@16234
|
6210 |
|
wenzelm@17408
|
6211 |
* Command 'find_theorems' searches for a list of criteria instead of a
|
wenzelm@17408
|
6212 |
list of constants. Known criteria are: intro, elim, dest, name:string,
|
wenzelm@17408
|
6213 |
simp:term, and any term. Criteria can be preceded by '-' to select
|
wenzelm@17408
|
6214 |
theorems that do not match. Intro, elim, dest select theorems that
|
wenzelm@17408
|
6215 |
match the current goal, name:s selects theorems whose fully qualified
|
wenzelm@17408
|
6216 |
name contain s, and simp:term selects all simplification rules whose
|
wenzelm@17408
|
6217 |
lhs match term. Any other term is interpreted as pattern and selects
|
wenzelm@17408
|
6218 |
all theorems matching the pattern. Available in ProofGeneral under
|
wenzelm@17408
|
6219 |
'ProofGeneral -> Find Theorems' or C-c C-f. Example:
|
wenzelm@16234
|
6220 |
|
wenzelm@17275
|
6221 |
C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
|
wenzelm@16234
|
6222 |
|
wenzelm@16234
|
6223 |
prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
|
wenzelm@16234
|
6224 |
matching the current goal as introduction rule and not having "HOL."
|
wenzelm@16234
|
6225 |
in their name (i.e. not being defined in theory HOL).
|
wenzelm@16234
|
6226 |
|
wenzelm@17408
|
6227 |
* Command 'thms_containing' has been discontinued in favour of
|
wenzelm@17408
|
6228 |
'find_theorems'; INCOMPATIBILITY.
|
wenzelm@17408
|
6229 |
|
wenzelm@17385
|
6230 |
* Communication with Proof General is now 8bit clean, which means that
|
wenzelm@17385
|
6231 |
Unicode text in UTF-8 encoding may be used within theory texts (both
|
wenzelm@17408
|
6232 |
formal and informal parts). Cf. option -U of the Isabelle Proof
|
wenzelm@17538
|
6233 |
General interface. Here are some simple examples (cf. src/HOL/ex):
|
wenzelm@17538
|
6234 |
|
wenzelm@17538
|
6235 |
http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
|
wenzelm@17538
|
6236 |
http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
|
wenzelm@17385
|
6237 |
|
wenzelm@17425
|
6238 |
* Improved efficiency of the Simplifier and, to a lesser degree, the
|
wenzelm@17425
|
6239 |
Classical Reasoner. Typical big applications run around 2 times
|
wenzelm@17425
|
6240 |
faster.
|
wenzelm@17425
|
6241 |
|
wenzelm@16234
|
6242 |
|
wenzelm@16234
|
6243 |
*** Document preparation ***
|
wenzelm@16234
|
6244 |
|
wenzelm@16234
|
6245 |
* Commands 'display_drafts' and 'print_drafts' perform simple output
|
wenzelm@16234
|
6246 |
of raw sources. Only those symbols that do not require additional
|
wenzelm@16234
|
6247 |
LaTeX packages (depending on comments in isabellesym.sty) are
|
wenzelm@16234
|
6248 |
displayed properly, everything else is left verbatim. isatool display
|
wenzelm@16234
|
6249 |
and isatool print are used as front ends (these are subject to the
|
wenzelm@16234
|
6250 |
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
|
wenzelm@16234
|
6251 |
|
wenzelm@17047
|
6252 |
* Command tags control specific markup of certain regions of text,
|
wenzelm@17047
|
6253 |
notably folding and hiding. Predefined tags include "theory" (for
|
wenzelm@17047
|
6254 |
theory begin and end), "proof" for proof commands, and "ML" for
|
wenzelm@17047
|
6255 |
commands involving ML code; the additional tags "visible" and
|
wenzelm@17047
|
6256 |
"invisible" are unused by default. Users may give explicit tag
|
wenzelm@17047
|
6257 |
specifications in the text, e.g. ''by %invisible (auto)''. The
|
wenzelm@17047
|
6258 |
interpretation of tags is determined by the LaTeX job during document
|
wenzelm@17047
|
6259 |
preparation: see option -V of isatool usedir, or options -n and -t of
|
wenzelm@17047
|
6260 |
isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
|
wenzelm@17047
|
6261 |
\isadroptag.
|
wenzelm@17047
|
6262 |
|
wenzelm@17047
|
6263 |
Several document versions may be produced at the same time via isatool
|
wenzelm@17047
|
6264 |
usedir (the generated index.html will link all of them). Typical
|
wenzelm@17047
|
6265 |
specifications include ''-V document=theory,proof,ML'' to present
|
wenzelm@17047
|
6266 |
theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
|
wenzelm@17047
|
6267 |
proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
|
wenzelm@17047
|
6268 |
these parts without any formal replacement text. The Isabelle site
|
wenzelm@17047
|
6269 |
default settings produce ''document'' and ''outline'' versions as
|
wenzelm@17047
|
6270 |
specified above.
|
wenzelm@16234
|
6271 |
|
haftmann@17402
|
6272 |
* Several new antiquotations:
|
wenzelm@16234
|
6273 |
|
wenzelm@16234
|
6274 |
@{term_type term} prints a term with its type annotated;
|
wenzelm@16234
|
6275 |
|
wenzelm@16234
|
6276 |
@{typeof term} prints the type of a term;
|
wenzelm@16234
|
6277 |
|
wenzelm@16234
|
6278 |
@{const const} is the same as @{term const}, but checks that the
|
wenzelm@16234
|
6279 |
argument is a known logical constant;
|
wenzelm@16234
|
6280 |
|
wenzelm@16234
|
6281 |
@{term_style style term} and @{thm_style style thm} print a term or
|
wenzelm@16234
|
6282 |
theorem applying a "style" to it
|
wenzelm@16234
|
6283 |
|
wenzelm@17117
|
6284 |
@{ML text}
|
wenzelm@17117
|
6285 |
|
wenzelm@16234
|
6286 |
Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
|
wenzelm@16234
|
6287 |
definitions, equations, inequations etc., 'concl' printing only the
|
schirmer@17393
|
6288 |
conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
|
wenzelm@16234
|
6289 |
to print the specified premise. TermStyle.add_style provides an ML
|
wenzelm@16234
|
6290 |
interface for introducing further styles. See also the "LaTeX Sugar"
|
wenzelm@17117
|
6291 |
document practical applications. The ML antiquotation prints
|
wenzelm@17117
|
6292 |
type-checked ML expressions verbatim.
|
wenzelm@16234
|
6293 |
|
wenzelm@17259
|
6294 |
* Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
|
wenzelm@17259
|
6295 |
and 'text' support optional locale specification '(in loc)', which
|
wenzelm@17269
|
6296 |
specifies the default context for interpreting antiquotations. For
|
wenzelm@17269
|
6297 |
example: 'text (in lattice) {* @{thm inf_assoc}*}'.
|
wenzelm@17259
|
6298 |
|
wenzelm@17259
|
6299 |
* Option 'locale=NAME' of antiquotations specifies an alternative
|
wenzelm@17259
|
6300 |
context interpreting the subsequent argument. For example: @{thm
|
wenzelm@17269
|
6301 |
[locale=lattice] inf_assoc}.
|
wenzelm@17259
|
6302 |
|
wenzelm@17097
|
6303 |
* Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
|
wenzelm@17097
|
6304 |
a proof context.
|
wenzelm@17097
|
6305 |
|
wenzelm@17097
|
6306 |
* Proper output of antiquotations for theory commands involving a
|
wenzelm@17097
|
6307 |
proof context (such as 'locale' or 'theorem (in loc) ...').
|
wenzelm@17097
|
6308 |
|
wenzelm@17193
|
6309 |
* Delimiters of outer tokens (string etc.) now produce separate LaTeX
|
wenzelm@17193
|
6310 |
macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
|
wenzelm@17193
|
6311 |
|
wenzelm@17193
|
6312 |
* isatool usedir: new option -C (default true) controls whether option
|
wenzelm@17193
|
6313 |
-D should include a copy of the original document directory; -C false
|
wenzelm@17193
|
6314 |
prevents unwanted effects such as copying of administrative CVS data.
|
wenzelm@17193
|
6315 |
|
wenzelm@16234
|
6316 |
|
wenzelm@16234
|
6317 |
*** Pure ***
|
wenzelm@16234
|
6318 |
|
wenzelm@16234
|
6319 |
* Considerably improved version of 'constdefs' command. Now performs
|
wenzelm@16234
|
6320 |
automatic type-inference of declared constants; additional support for
|
wenzelm@16234
|
6321 |
local structure declarations (cf. locales and HOL records), see also
|
wenzelm@16234
|
6322 |
isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
|
wenzelm@16234
|
6323 |
sequential dependencies of definitions within a single 'constdefs'
|
wenzelm@16234
|
6324 |
section; moreover, the declared name needs to be an identifier. If
|
wenzelm@16234
|
6325 |
all fails, consider to fall back on 'consts' and 'defs' separately.
|
wenzelm@16234
|
6326 |
|
wenzelm@16234
|
6327 |
* Improved indexed syntax and implicit structures. First of all,
|
wenzelm@16234
|
6328 |
indexed syntax provides a notational device for subscripted
|
wenzelm@16234
|
6329 |
application, using the new syntax \<^bsub>term\<^esub> for arbitrary
|
wenzelm@16234
|
6330 |
expressions. Secondly, in a local context with structure
|
wenzelm@16234
|
6331 |
declarations, number indexes \<^sub>n or the empty index (default
|
wenzelm@16234
|
6332 |
number 1) refer to a certain fixed variable implicitly; option
|
wenzelm@16234
|
6333 |
show_structs controls printing of implicit structures. Typical
|
wenzelm@16234
|
6334 |
applications of these concepts involve record types and locales.
|
wenzelm@16234
|
6335 |
|
wenzelm@16234
|
6336 |
* New command 'no_syntax' removes grammar declarations (and
|
wenzelm@16234
|
6337 |
translations) resulting from the given syntax specification, which is
|
wenzelm@16234
|
6338 |
interpreted in the same manner as for the 'syntax' command.
|
wenzelm@16234
|
6339 |
|
wenzelm@16234
|
6340 |
* 'Advanced' translation functions (parse_translation etc.) may depend
|
wenzelm@16234
|
6341 |
on the signature of the theory context being presently used for
|
wenzelm@16234
|
6342 |
parsing/printing, see also isar-ref manual.
|
wenzelm@16234
|
6343 |
|
wenzelm@16856
|
6344 |
* Improved 'oracle' command provides a type-safe interface to turn an
|
wenzelm@16856
|
6345 |
ML expression of type theory -> T -> term into a primitive rule of
|
wenzelm@16856
|
6346 |
type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
|
wenzelm@16856
|
6347 |
is already included here); see also FOL/ex/IffExample.thy;
|
wenzelm@16856
|
6348 |
INCOMPATIBILITY.
|
wenzelm@16856
|
6349 |
|
wenzelm@17275
|
6350 |
* axclass: name space prefix for class "c" is now "c_class" (was "c"
|
wenzelm@17275
|
6351 |
before); "cI" is no longer bound, use "c.intro" instead.
|
wenzelm@17275
|
6352 |
INCOMPATIBILITY. This change avoids clashes of fact bindings for
|
wenzelm@17275
|
6353 |
axclasses vs. locales.
|
wenzelm@17275
|
6354 |
|
wenzelm@16234
|
6355 |
* Improved internal renaming of symbolic identifiers -- attach primes
|
wenzelm@16234
|
6356 |
instead of base 26 numbers.
|
wenzelm@16234
|
6357 |
|
wenzelm@16234
|
6358 |
* New flag show_question_marks controls printing of leading question
|
wenzelm@16234
|
6359 |
marks in schematic variable names.
|
wenzelm@16234
|
6360 |
|
wenzelm@16234
|
6361 |
* In schematic variable names, *any* symbol following \<^isub> or
|
wenzelm@16234
|
6362 |
\<^isup> is now treated as part of the base name. For example, the
|
wenzelm@16234
|
6363 |
following works without printing of awkward ".0" indexes:
|
wenzelm@16234
|
6364 |
|
wenzelm@16234
|
6365 |
lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
|
wenzelm@16234
|
6366 |
by simp
|
wenzelm@16234
|
6367 |
|
wenzelm@16234
|
6368 |
* Inner syntax includes (*(*nested*) comments*).
|
wenzelm@16234
|
6369 |
|
wenzelm@17548
|
6370 |
* Pretty printer now supports unbreakable blocks, specified in mixfix
|
wenzelm@16234
|
6371 |
annotations as "(00...)".
|
wenzelm@16234
|
6372 |
|
wenzelm@16234
|
6373 |
* Clear separation of logical types and nonterminals, where the latter
|
wenzelm@16234
|
6374 |
may only occur in 'syntax' specifications or type abbreviations.
|
wenzelm@16234
|
6375 |
Before that distinction was only partially implemented via type class
|
wenzelm@16234
|
6376 |
"logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
|
wenzelm@16234
|
6377 |
use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
|
wenzelm@16234
|
6378 |
exotic syntax specifications may require further adaption
|
wenzelm@17691
|
6379 |
(e.g. Cube/Cube.thy).
|
wenzelm@16234
|
6380 |
|
wenzelm@16234
|
6381 |
* Removed obsolete type class "logic", use the top sort {} instead.
|
wenzelm@16234
|
6382 |
Note that non-logical types should be declared as 'nonterminals'
|
wenzelm@16234
|
6383 |
rather than 'types'. INCOMPATIBILITY for new object-logic
|
wenzelm@16234
|
6384 |
specifications.
|
wenzelm@16234
|
6385 |
|
ballarin@17095
|
6386 |
* Attributes 'induct' and 'cases': type or set names may now be
|
ballarin@17095
|
6387 |
locally fixed variables as well.
|
ballarin@17095
|
6388 |
|
wenzelm@16234
|
6389 |
* Simplifier: can now control the depth to which conditional rewriting
|
wenzelm@16234
|
6390 |
is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
|
wenzelm@16234
|
6391 |
Limit.
|
wenzelm@16234
|
6392 |
|
wenzelm@16234
|
6393 |
* Simplifier: simplification procedures may now take the current
|
wenzelm@16234
|
6394 |
simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
|
wenzelm@16234
|
6395 |
interface), which is very useful for calling the Simplifier
|
wenzelm@16234
|
6396 |
recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
|
wenzelm@16234
|
6397 |
is gone -- use prems_of_ss on the simpset instead. Moreover, the
|
wenzelm@16234
|
6398 |
low-level mk_simproc no longer applies Logic.varify internally, to
|
wenzelm@16234
|
6399 |
allow for use in a context of fixed variables.
|
wenzelm@16234
|
6400 |
|
wenzelm@16234
|
6401 |
* thin_tac now works even if the assumption being deleted contains !!
|
wenzelm@16234
|
6402 |
or ==>. More generally, erule now works even if the major premise of
|
wenzelm@16234
|
6403 |
the elimination rule contains !! or ==>.
|
wenzelm@16234
|
6404 |
|
wenzelm@17597
|
6405 |
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
|
nipkow@17590
|
6406 |
|
wenzelm@16234
|
6407 |
* Reorganized bootstrapping of the Pure theories; CPure is now derived
|
wenzelm@16234
|
6408 |
from Pure, which contains all common declarations already. Both
|
wenzelm@16234
|
6409 |
theories are defined via plain Isabelle/Isar .thy files.
|
wenzelm@16234
|
6410 |
INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
|
wenzelm@16234
|
6411 |
CPure.elim / CPure.dest attributes) now appear in the Pure name space;
|
wenzelm@16234
|
6412 |
use isatool fixcpure to adapt your theory and ML sources.
|
wenzelm@16234
|
6413 |
|
wenzelm@16234
|
6414 |
* New syntax 'name(i-j, i-, i, ...)' for referring to specific
|
wenzelm@16234
|
6415 |
selections of theorems in named facts via index ranges.
|
wenzelm@16234
|
6416 |
|
wenzelm@17097
|
6417 |
* 'print_theorems': in theory mode, really print the difference
|
wenzelm@17097
|
6418 |
wrt. the last state (works for interactive theory development only),
|
wenzelm@17097
|
6419 |
in proof mode print all local facts (cf. 'print_facts');
|
wenzelm@17097
|
6420 |
|
wenzelm@17397
|
6421 |
* 'hide': option '(open)' hides only base names.
|
wenzelm@17397
|
6422 |
|
wenzelm@17275
|
6423 |
* More efficient treatment of intermediate checkpoints in interactive
|
wenzelm@17275
|
6424 |
theory development.
|
wenzelm@17275
|
6425 |
|
berghofe@17663
|
6426 |
* Code generator is now invoked via code_module (incremental code
|
wenzelm@17664
|
6427 |
generation) and code_library (modular code generation, ML structures
|
wenzelm@17664
|
6428 |
for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
|
wenzelm@17664
|
6429 |
must be quoted when used as identifiers.
|
wenzelm@17664
|
6430 |
|
wenzelm@17664
|
6431 |
* New 'value' command for reading, evaluating and printing terms using
|
wenzelm@17664
|
6432 |
the code generator. INCOMPATIBILITY: command keyword 'value' must be
|
wenzelm@17664
|
6433 |
quoted when used as identifier.
|
berghofe@17663
|
6434 |
|
wenzelm@16234
|
6435 |
|
wenzelm@16234
|
6436 |
*** Locales ***
|
ballarin@17095
|
6437 |
|
wenzelm@17385
|
6438 |
* New commands for the interpretation of locale expressions in
|
wenzelm@17385
|
6439 |
theories (1), locales (2) and proof contexts (3). These generate
|
wenzelm@17385
|
6440 |
proof obligations from the expression specification. After the
|
wenzelm@17385
|
6441 |
obligations have been discharged, theorems of the expression are added
|
wenzelm@17385
|
6442 |
to the theory, target locale or proof context. The synopsis of the
|
wenzelm@17385
|
6443 |
commands is a follows:
|
wenzelm@17385
|
6444 |
|
ballarin@17095
|
6445 |
(1) interpretation expr inst
|
ballarin@17095
|
6446 |
(2) interpretation target < expr
|
ballarin@17095
|
6447 |
(3) interpret expr inst
|
wenzelm@17385
|
6448 |
|
ballarin@17095
|
6449 |
Interpretation in theories and proof contexts require a parameter
|
ballarin@17095
|
6450 |
instantiation of terms from the current context. This is applied to
|
wenzelm@17385
|
6451 |
specifications and theorems of the interpreted expression.
|
wenzelm@17385
|
6452 |
Interpretation in locales only permits parameter renaming through the
|
wenzelm@17385
|
6453 |
locale expression. Interpretation is smart in that interpretations
|
wenzelm@17385
|
6454 |
that are active already do not occur in proof obligations, neither are
|
wenzelm@17385
|
6455 |
instantiated theorems stored in duplicate. Use 'print_interps' to
|
wenzelm@17385
|
6456 |
inspect active interpretations of a particular locale. For details,
|
ballarin@17436
|
6457 |
see the Isar Reference manual. Examples can be found in
|
ballarin@17436
|
6458 |
HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
|
wenzelm@16234
|
6459 |
|
wenzelm@16234
|
6460 |
INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
|
wenzelm@16234
|
6461 |
'interpret' instead.
|
wenzelm@16234
|
6462 |
|
wenzelm@17385
|
6463 |
* New context element 'constrains' for adding type constraints to
|
wenzelm@17385
|
6464 |
parameters.
|
wenzelm@17385
|
6465 |
|
wenzelm@17385
|
6466 |
* Context expressions: renaming of parameters with syntax
|
wenzelm@17385
|
6467 |
redeclaration.
|
ballarin@17095
|
6468 |
|
ballarin@17095
|
6469 |
* Locale declaration: 'includes' disallowed.
|
ballarin@17095
|
6470 |
|
wenzelm@16234
|
6471 |
* Proper static binding of attribute syntax -- i.e. types / terms /
|
wenzelm@16234
|
6472 |
facts mentioned as arguments are always those of the locale definition
|
wenzelm@16234
|
6473 |
context, independently of the context of later invocations. Moreover,
|
wenzelm@16234
|
6474 |
locale operations (renaming and type / term instantiation) are applied
|
wenzelm@16234
|
6475 |
to attribute arguments as expected.
|
wenzelm@16234
|
6476 |
|
wenzelm@16234
|
6477 |
INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
|
wenzelm@16234
|
6478 |
actual attributes; rare situations may require Attrib.attribute to
|
wenzelm@16234
|
6479 |
embed those attributes into Attrib.src that lack concrete syntax.
|
wenzelm@16234
|
6480 |
Attribute implementations need to cooperate properly with the static
|
wenzelm@16234
|
6481 |
binding mechanism. Basic parsers Args.XXX_typ/term/prop and
|
wenzelm@16234
|
6482 |
Attrib.XXX_thm etc. already do the right thing without further
|
wenzelm@16234
|
6483 |
intervention. Only unusual applications -- such as "where" or "of"
|
wenzelm@16234
|
6484 |
(cf. src/Pure/Isar/attrib.ML), which process arguments depending both
|
wenzelm@16234
|
6485 |
on the context and the facts involved -- may have to assign parsed
|
wenzelm@16234
|
6486 |
values to argument tokens explicitly.
|
wenzelm@16234
|
6487 |
|
wenzelm@16234
|
6488 |
* Changed parameter management in theorem generation for long goal
|
wenzelm@16234
|
6489 |
statements with 'includes'. INCOMPATIBILITY: produces a different
|
wenzelm@16234
|
6490 |
theorem statement in rare situations.
|
wenzelm@16234
|
6491 |
|
ballarin@17228
|
6492 |
* Locale inspection command 'print_locale' omits notes elements. Use
|
ballarin@17228
|
6493 |
'print_locale!' to have them included in the output.
|
ballarin@17228
|
6494 |
|
wenzelm@16234
|
6495 |
|
wenzelm@16234
|
6496 |
*** Provers ***
|
wenzelm@16234
|
6497 |
|
wenzelm@16234
|
6498 |
* Provers/hypsubst.ML: improved version of the subst method, for
|
wenzelm@16234
|
6499 |
single-step rewriting: it now works in bound variable contexts. New is
|
wenzelm@16234
|
6500 |
'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
|
wenzelm@16234
|
6501 |
rewrite a different subterm than the original subst method, which is
|
wenzelm@16234
|
6502 |
still available as 'simplesubst'.
|
berghofe@15475
|
6503 |
|
wenzelm@16013
|
6504 |
* Provers/quasi.ML: new transitivity reasoners for transitivity only
|
wenzelm@16234
|
6505 |
and quasi orders.
|
ballarin@15103
|
6506 |
|
wenzelm@16013
|
6507 |
* Provers/trancl.ML: new transitivity reasoner for transitive and
|
wenzelm@16234
|
6508 |
reflexive-transitive closure of relations.
|
ballarin@15076
|
6509 |
|
wenzelm@16013
|
6510 |
* Provers/blast.ML: new reference depth_limit to make blast's depth
|
wenzelm@16234
|
6511 |
limit (previously hard-coded with a value of 20) user-definable.
|
wenzelm@15801
|
6512 |
|
wenzelm@16013
|
6513 |
* Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
|
wenzelm@16234
|
6514 |
is peformed already. Object-logics merely need to finish their
|
wenzelm@16234
|
6515 |
initial simpset configuration as before. INCOMPATIBILITY.
|
berghofe@15436
|
6516 |
|
wenzelm@15703
|
6517 |
|
wenzelm@15703
|
6518 |
*** HOL ***
|
wenzelm@15703
|
6519 |
|
wenzelm@16234
|
6520 |
* Symbolic syntax of Hilbert Choice Operator is now as follows:
|
wenzelm@15703
|
6521 |
|
wenzelm@15703
|
6522 |
syntax (epsilon)
|
wenzelm@15703
|
6523 |
"_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
|
wenzelm@15703
|
6524 |
|
wenzelm@16234
|
6525 |
The symbol \<some> is displayed as the alternative epsilon of LaTeX
|
wenzelm@16234
|
6526 |
and x-symbol; use option '-m epsilon' to get it actually printed.
|
wenzelm@16234
|
6527 |
Moreover, the mathematically important symbolic identifier \<epsilon>
|
wenzelm@16234
|
6528 |
becomes available as variable, constant etc. INCOMPATIBILITY,
|
wenzelm@16234
|
6529 |
|
wenzelm@16234
|
6530 |
* "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
|
wenzelm@16234
|
6531 |
Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
|
wenzelm@17371
|
6532 |
is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
|
avigad@17016
|
6533 |
support corresponding Isar calculations.
|
wenzelm@16234
|
6534 |
|
wenzelm@16234
|
6535 |
* "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
|
wenzelm@16234
|
6536 |
instead of ":".
|
wenzelm@16234
|
6537 |
|
wenzelm@16234
|
6538 |
* theory SetInterval: changed the syntax for open intervals:
|
wenzelm@16234
|
6539 |
|
wenzelm@16234
|
6540 |
Old New
|
wenzelm@16234
|
6541 |
{..n(} {..<n}
|
wenzelm@16234
|
6542 |
{)n..} {n<..}
|
wenzelm@16234
|
6543 |
{m..n(} {m..<n}
|
wenzelm@16234
|
6544 |
{)m..n} {m<..n}
|
wenzelm@16234
|
6545 |
{)m..n(} {m<..<n}
|
wenzelm@16234
|
6546 |
|
wenzelm@16234
|
6547 |
The old syntax is still supported but will disappear in the next
|
wenzelm@16234
|
6548 |
release. For conversion use the following Emacs search and replace
|
wenzelm@16234
|
6549 |
patterns (these are not perfect but work quite well):
|
wenzelm@15703
|
6550 |
|
wenzelm@15703
|
6551 |
{)\([^\.]*\)\.\. -> {\1<\.\.}
|
wenzelm@15703
|
6552 |
\.\.\([^(}]*\)(} -> \.\.<\1}
|
wenzelm@15703
|
6553 |
|
wenzelm@17533
|
6554 |
* Theory Commutative_Ring (in Library): method comm_ring for proving
|
wenzelm@17533
|
6555 |
equalities in commutative rings; method 'algebra' provides a generic
|
wenzelm@17533
|
6556 |
interface.
|
wenzelm@17389
|
6557 |
|
wenzelm@17389
|
6558 |
* Theory Finite_Set: changed the syntax for 'setsum', summation over
|
wenzelm@16234
|
6559 |
finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
|
wenzelm@17371
|
6560 |
now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
|
paulson@17189
|
6561 |
be a tuple pattern.
|
wenzelm@16234
|
6562 |
|
wenzelm@16234
|
6563 |
Some new syntax forms are available:
|
wenzelm@16234
|
6564 |
|
wenzelm@16234
|
6565 |
"\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
|
wenzelm@16234
|
6566 |
"\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
|
wenzelm@16234
|
6567 |
"\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
|
wenzelm@16234
|
6568 |
"\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
|
wenzelm@16234
|
6569 |
|
wenzelm@16234
|
6570 |
The latter form "\<Sum>x < k. e" used to be based on a separate
|
wenzelm@16234
|
6571 |
function "Summation", which has been discontinued.
|
wenzelm@16234
|
6572 |
|
wenzelm@16234
|
6573 |
* theory Finite_Set: in structured induction proofs, the insert case
|
wenzelm@16234
|
6574 |
is now 'case (insert x F)' instead of the old counterintuitive 'case
|
wenzelm@16234
|
6575 |
(insert F x)'.
|
wenzelm@16234
|
6576 |
|
wenzelm@16234
|
6577 |
* The 'refute' command has been extended to support a much larger
|
wenzelm@16234
|
6578 |
fragment of HOL, including axiomatic type classes, constdefs and
|
wenzelm@16234
|
6579 |
typedefs, inductive datatypes and recursion.
|
wenzelm@16234
|
6580 |
|
webertj@17700
|
6581 |
* New tactics 'sat' and 'satx' to prove propositional tautologies.
|
webertj@17700
|
6582 |
Requires zChaff with proof generation to be installed. See
|
webertj@17700
|
6583 |
HOL/ex/SAT_Examples.thy for examples.
|
webertj@17619
|
6584 |
|
wenzelm@16234
|
6585 |
* Datatype induction via method 'induct' now preserves the name of the
|
wenzelm@16234
|
6586 |
induction variable. For example, when proving P(xs::'a list) by
|
wenzelm@16234
|
6587 |
induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
|
wenzelm@16234
|
6588 |
than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
|
wenzelm@16234
|
6589 |
in unstructured proof scripts.
|
wenzelm@16234
|
6590 |
|
wenzelm@16234
|
6591 |
* Reworked implementation of records. Improved scalability for
|
wenzelm@16234
|
6592 |
records with many fields, avoiding performance problems for type
|
wenzelm@16234
|
6593 |
inference. Records are no longer composed of nested field types, but
|
wenzelm@16234
|
6594 |
of nested extension types. Therefore the record type only grows linear
|
wenzelm@16234
|
6595 |
in the number of extensions and not in the number of fields. The
|
wenzelm@16234
|
6596 |
top-level (users) view on records is preserved. Potential
|
wenzelm@16234
|
6597 |
INCOMPATIBILITY only in strange cases, where the theory depends on the
|
wenzelm@16234
|
6598 |
old record representation. The type generated for a record is called
|
wenzelm@16234
|
6599 |
<record_name>_ext_type.
|
wenzelm@16234
|
6600 |
|
wenzelm@16234
|
6601 |
Flag record_quick_and_dirty_sensitive can be enabled to skip the
|
wenzelm@16234
|
6602 |
proofs triggered by a record definition or a simproc (if
|
wenzelm@16234
|
6603 |
quick_and_dirty is enabled). Definitions of large records can take
|
wenzelm@16234
|
6604 |
quite long.
|
wenzelm@16234
|
6605 |
|
wenzelm@16234
|
6606 |
New simproc record_upd_simproc for simplification of multiple record
|
wenzelm@16234
|
6607 |
updates enabled by default. Moreover, trivial updates are also
|
wenzelm@16234
|
6608 |
removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
|
wenzelm@16234
|
6609 |
occasionally, since simplification is more powerful by default.
|
wenzelm@16234
|
6610 |
|
wenzelm@17275
|
6611 |
* typedef: proper support for polymorphic sets, which contain extra
|
wenzelm@17275
|
6612 |
type-variables in the term.
|
wenzelm@17275
|
6613 |
|
wenzelm@16234
|
6614 |
* Simplifier: automatically reasons about transitivity chains
|
wenzelm@16234
|
6615 |
involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
|
wenzelm@16234
|
6616 |
provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
|
wenzelm@16234
|
6617 |
old proofs break occasionally as simplification may now solve more
|
wenzelm@16234
|
6618 |
goals than previously.
|
wenzelm@16234
|
6619 |
|
wenzelm@16234
|
6620 |
* Simplifier: converts x <= y into x = y if assumption y <= x is
|
wenzelm@16234
|
6621 |
present. Works for all partial orders (class "order"), in particular
|
wenzelm@16234
|
6622 |
numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
|
wenzelm@16234
|
6623 |
just like y <= x.
|
wenzelm@16234
|
6624 |
|
wenzelm@16234
|
6625 |
* Simplifier: new simproc for "let x = a in f x". If a is a free or
|
wenzelm@16234
|
6626 |
bound variable or a constant then the let is unfolded. Otherwise
|
wenzelm@16234
|
6627 |
first a is simplified to b, and then f b is simplified to g. If
|
wenzelm@16234
|
6628 |
possible we abstract b from g arriving at "let x = b in h x",
|
wenzelm@16234
|
6629 |
otherwise we unfold the let and arrive at g. The simproc can be
|
wenzelm@16234
|
6630 |
enabled/disabled by the reference use_let_simproc. Potential
|
wenzelm@16234
|
6631 |
INCOMPATIBILITY since simplification is more powerful by default.
|
webertj@15776
|
6632 |
|
paulson@16563
|
6633 |
* Classical reasoning: the meson method now accepts theorems as arguments.
|
paulson@16563
|
6634 |
|
paulson@17595
|
6635 |
* Prover support: pre-release of the Isabelle-ATP linkup, which runs background
|
paulson@17595
|
6636 |
jobs to provide advice on the provability of subgoals.
|
paulson@17595
|
6637 |
|
wenzelm@16891
|
6638 |
* Theory OrderedGroup and Ring_and_Field: various additions and
|
wenzelm@16891
|
6639 |
improvements to faciliate calculations involving equalities and
|
wenzelm@16891
|
6640 |
inequalities.
|
wenzelm@16891
|
6641 |
|
wenzelm@16891
|
6642 |
The following theorems have been eliminated or modified
|
wenzelm@16891
|
6643 |
(INCOMPATIBILITY):
|
avigad@16888
|
6644 |
|
avigad@16888
|
6645 |
abs_eq now named abs_of_nonneg
|
wenzelm@17371
|
6646 |
abs_of_ge_0 now named abs_of_nonneg
|
wenzelm@17371
|
6647 |
abs_minus_eq now named abs_of_nonpos
|
avigad@16888
|
6648 |
imp_abs_id now named abs_of_nonneg
|
avigad@16888
|
6649 |
imp_abs_neg_id now named abs_of_nonpos
|
avigad@16888
|
6650 |
mult_pos now named mult_pos_pos
|
avigad@16888
|
6651 |
mult_pos_le now named mult_nonneg_nonneg
|
avigad@16888
|
6652 |
mult_pos_neg_le now named mult_nonneg_nonpos
|
avigad@16888
|
6653 |
mult_pos_neg2_le now named mult_nonneg_nonpos2
|
avigad@16888
|
6654 |
mult_neg now named mult_neg_neg
|
avigad@16888
|
6655 |
mult_neg_le now named mult_nonpos_nonpos
|
avigad@16888
|
6656 |
|
obua@23495
|
6657 |
* The following lemmas in Ring_and_Field have been added to the simplifier:
|
obua@23495
|
6658 |
|
obua@23495
|
6659 |
zero_le_square
|
obua@23495
|
6660 |
not_square_less_zero
|
obua@23495
|
6661 |
|
obua@23495
|
6662 |
The following lemmas have been deleted from Real/RealPow:
|
obua@23495
|
6663 |
|
obua@23495
|
6664 |
realpow_zero_zero
|
obua@23495
|
6665 |
realpow_two
|
obua@23495
|
6666 |
realpow_less
|
obua@23495
|
6667 |
zero_le_power
|
obua@23495
|
6668 |
realpow_two_le
|
obua@23495
|
6669 |
abs_realpow_two
|
obua@23495
|
6670 |
realpow_two_abs
|
obua@23495
|
6671 |
|
wenzelm@16891
|
6672 |
* Theory Parity: added rules for simplifying exponents.
|
wenzelm@16891
|
6673 |
|
nipkow@17092
|
6674 |
* Theory List:
|
nipkow@17092
|
6675 |
|
nipkow@17092
|
6676 |
The following theorems have been eliminated or modified
|
nipkow@17092
|
6677 |
(INCOMPATIBILITY):
|
nipkow@17092
|
6678 |
|
nipkow@17092
|
6679 |
list_all_Nil now named list_all.simps(1)
|
nipkow@17092
|
6680 |
list_all_Cons now named list_all.simps(2)
|
nipkow@17092
|
6681 |
list_all_conv now named list_all_iff
|
nipkow@17092
|
6682 |
set_mem_eq now named mem_iff
|
nipkow@17092
|
6683 |
|
wenzelm@16929
|
6684 |
* Theories SetsAndFunctions and BigO (see HOL/Library) support
|
wenzelm@16929
|
6685 |
asymptotic "big O" calculations. See the notes in BigO.thy.
|
wenzelm@16929
|
6686 |
|
avigad@16888
|
6687 |
|
avigad@16888
|
6688 |
*** HOL-Complex ***
|
avigad@16888
|
6689 |
|
wenzelm@16891
|
6690 |
* Theory RealDef: better support for embedding natural numbers and
|
wenzelm@16891
|
6691 |
integers in the reals.
|
wenzelm@16891
|
6692 |
|
wenzelm@16891
|
6693 |
The following theorems have been eliminated or modified
|
wenzelm@16891
|
6694 |
(INCOMPATIBILITY):
|
wenzelm@16891
|
6695 |
|
avigad@17016
|
6696 |
exp_ge_add_one_self now requires no hypotheses
|
avigad@17016
|
6697 |
real_of_int_add reversed direction of equality (use [symmetric])
|
avigad@17016
|
6698 |
real_of_int_minus reversed direction of equality (use [symmetric])
|
avigad@17016
|
6699 |
real_of_int_diff reversed direction of equality (use [symmetric])
|
avigad@17016
|
6700 |
real_of_int_mult reversed direction of equality (use [symmetric])
|
wenzelm@16891
|
6701 |
|
wenzelm@16891
|
6702 |
* Theory RComplete: expanded support for floor and ceiling functions.
|
avigad@16888
|
6703 |
|
avigad@16962
|
6704 |
* Theory Ln is new, with properties of the natural logarithm
|
avigad@16962
|
6705 |
|
wenzelm@17423
|
6706 |
* Hyperreal: There is a new type constructor "star" for making
|
wenzelm@17423
|
6707 |
nonstandard types. The old type names are now type synonyms:
|
wenzelm@17423
|
6708 |
|
wenzelm@17423
|
6709 |
hypreal = real star
|
wenzelm@17423
|
6710 |
hypnat = nat star
|
wenzelm@17423
|
6711 |
hcomplex = complex star
|
wenzelm@17423
|
6712 |
|
wenzelm@17423
|
6713 |
* Hyperreal: Many groups of similarly-defined constants have been
|
huffman@17442
|
6714 |
replaced by polymorphic versions (INCOMPATIBILITY):
|
wenzelm@17423
|
6715 |
|
wenzelm@17423
|
6716 |
star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
|
wenzelm@17423
|
6717 |
|
wenzelm@17423
|
6718 |
starset <-- starsetNat, starsetC
|
wenzelm@17423
|
6719 |
*s* <-- *sNat*, *sc*
|
wenzelm@17423
|
6720 |
starset_n <-- starsetNat_n, starsetC_n
|
wenzelm@17423
|
6721 |
*sn* <-- *sNatn*, *scn*
|
wenzelm@17423
|
6722 |
InternalSets <-- InternalNatSets, InternalCSets
|
wenzelm@17423
|
6723 |
|
huffman@17442
|
6724 |
starfun <-- starfun{Nat,Nat2,C,RC,CR}
|
wenzelm@17423
|
6725 |
*f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
|
huffman@17442
|
6726 |
starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
|
wenzelm@17423
|
6727 |
*fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
|
huffman@17442
|
6728 |
InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
|
wenzelm@17423
|
6729 |
|
wenzelm@17423
|
6730 |
* Hyperreal: Many type-specific theorems have been removed in favor of
|
huffman@17442
|
6731 |
theorems specific to various axiomatic type classes (INCOMPATIBILITY):
|
huffman@17442
|
6732 |
|
huffman@17442
|
6733 |
add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
|
huffman@17442
|
6734 |
add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
|
huffman@17442
|
6735 |
OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
|
huffman@17442
|
6736 |
OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
|
wenzelm@17423
|
6737 |
right_minus <-- hypreal_add_minus
|
huffman@17442
|
6738 |
left_minus <-- {hypreal,hcomplex}_add_minus_left
|
huffman@17442
|
6739 |
mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
|
huffman@17442
|
6740 |
mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
|
huffman@17442
|
6741 |
mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
|
wenzelm@17423
|
6742 |
mult_1_right <-- hcomplex_mult_one_right
|
wenzelm@17423
|
6743 |
mult_zero_left <-- hcomplex_mult_zero_left
|
huffman@17442
|
6744 |
left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
|
wenzelm@17423
|
6745 |
right_distrib <-- hypnat_add_mult_distrib2
|
huffman@17442
|
6746 |
zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
|
wenzelm@17423
|
6747 |
right_inverse <-- hypreal_mult_inverse
|
wenzelm@17423
|
6748 |
left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
|
huffman@17442
|
6749 |
order_refl <-- {hypreal,hypnat}_le_refl
|
huffman@17442
|
6750 |
order_trans <-- {hypreal,hypnat}_le_trans
|
huffman@17442
|
6751 |
order_antisym <-- {hypreal,hypnat}_le_anti_sym
|
huffman@17442
|
6752 |
order_less_le <-- {hypreal,hypnat}_less_le
|
huffman@17442
|
6753 |
linorder_linear <-- {hypreal,hypnat}_le_linear
|
huffman@17442
|
6754 |
add_left_mono <-- {hypreal,hypnat}_add_left_mono
|
huffman@17442
|
6755 |
mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
|
wenzelm@17423
|
6756 |
add_nonneg_nonneg <-- hypreal_le_add_order
|
wenzelm@17423
|
6757 |
|
wenzelm@17423
|
6758 |
* Hyperreal: Separate theorems having to do with type-specific
|
wenzelm@17423
|
6759 |
versions of constants have been merged into theorems that apply to the
|
huffman@17442
|
6760 |
new polymorphic constants (INCOMPATIBILITY):
|
huffman@17442
|
6761 |
|
huffman@17442
|
6762 |
STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
|
huffman@17442
|
6763 |
STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
|
huffman@17442
|
6764 |
STAR_Un <-- {STAR,NatStar,STARC}_Un
|
huffman@17442
|
6765 |
STAR_Int <-- {STAR,NatStar,STARC}_Int
|
huffman@17442
|
6766 |
STAR_Compl <-- {STAR,NatStar,STARC}_Compl
|
huffman@17442
|
6767 |
STAR_subset <-- {STAR,NatStar,STARC}_subset
|
huffman@17442
|
6768 |
STAR_mem <-- {STAR,NatStar,STARC}_mem
|
huffman@17442
|
6769 |
STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
|
huffman@17442
|
6770 |
STAR_diff <-- {STAR,STARC}_diff
|
huffman@17442
|
6771 |
STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
|
huffman@17442
|
6772 |
STARC_hcomplex_of_complex}_image_subset
|
huffman@17442
|
6773 |
starset_n_Un <-- starset{Nat,C}_n_Un
|
huffman@17442
|
6774 |
starset_n_Int <-- starset{Nat,C}_n_Int
|
huffman@17442
|
6775 |
starset_n_Compl <-- starset{Nat,C}_n_Compl
|
huffman@17442
|
6776 |
starset_n_diff <-- starset{Nat,C}_n_diff
|
huffman@17442
|
6777 |
InternalSets_Un <-- Internal{Nat,C}Sets_Un
|
huffman@17442
|
6778 |
InternalSets_Int <-- Internal{Nat,C}Sets_Int
|
huffman@17442
|
6779 |
InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
|
huffman@17442
|
6780 |
InternalSets_diff <-- Internal{Nat,C}Sets_diff
|
huffman@17442
|
6781 |
InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
|
huffman@17442
|
6782 |
InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
|
huffman@17442
|
6783 |
starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
|
huffman@17442
|
6784 |
starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
|
huffman@17442
|
6785 |
starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
|
huffman@17442
|
6786 |
starfun <-- starfun{Nat,Nat2,C,RC,CR}
|
huffman@17442
|
6787 |
starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
|
huffman@17442
|
6788 |
starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
|
huffman@17442
|
6789 |
starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
|
huffman@17442
|
6790 |
starfun_diff <-- starfun{C,RC,CR}_diff
|
huffman@17442
|
6791 |
starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
|
huffman@17442
|
6792 |
starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
|
huffman@17442
|
6793 |
starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
|
huffman@17442
|
6794 |
starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
|
huffman@17442
|
6795 |
starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
|
huffman@17442
|
6796 |
starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
|
wenzelm@17423
|
6797 |
starfun_Id <-- starfunC_Id
|
huffman@17442
|
6798 |
starfun_approx <-- starfun{Nat,CR}_approx
|
huffman@17442
|
6799 |
starfun_capprox <-- starfun{C,RC}_capprox
|
wenzelm@17423
|
6800 |
starfun_abs <-- starfunNat_rabs
|
huffman@17442
|
6801 |
starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
|
huffman@17442
|
6802 |
starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
|
wenzelm@17423
|
6803 |
starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
|
huffman@17442
|
6804 |
starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
|
huffman@17442
|
6805 |
starfun_add_capprox <-- starfun{C,RC}_add_capprox
|
wenzelm@17423
|
6806 |
starfun_add_approx <-- starfunCR_add_approx
|
wenzelm@17423
|
6807 |
starfun_inverse_inverse <-- starfunC_inverse_inverse
|
huffman@17442
|
6808 |
starfun_divide <-- starfun{C,CR,RC}_divide
|
huffman@17442
|
6809 |
starfun_n <-- starfun{Nat,C}_n
|
huffman@17442
|
6810 |
starfun_n_mult <-- starfun{Nat,C}_n_mult
|
huffman@17442
|
6811 |
starfun_n_add <-- starfun{Nat,C}_n_add
|
wenzelm@17423
|
6812 |
starfun_n_add_minus <-- starfunNat_n_add_minus
|
huffman@17442
|
6813 |
starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
|
huffman@17442
|
6814 |
starfun_n_minus <-- starfun{Nat,C}_n_minus
|
huffman@17442
|
6815 |
starfun_n_eq <-- starfun{Nat,C}_n_eq
|
huffman@17442
|
6816 |
|
huffman@17442
|
6817 |
star_n_add <-- {hypreal,hypnat,hcomplex}_add
|
huffman@17442
|
6818 |
star_n_minus <-- {hypreal,hcomplex}_minus
|
huffman@17442
|
6819 |
star_n_diff <-- {hypreal,hcomplex}_diff
|
huffman@17442
|
6820 |
star_n_mult <-- {hypreal,hcomplex}_mult
|
huffman@17442
|
6821 |
star_n_inverse <-- {hypreal,hcomplex}_inverse
|
huffman@17442
|
6822 |
star_n_le <-- {hypreal,hypnat}_le
|
huffman@17442
|
6823 |
star_n_less <-- {hypreal,hypnat}_less
|
huffman@17442
|
6824 |
star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
|
huffman@17442
|
6825 |
star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
|
wenzelm@17423
|
6826 |
star_n_abs <-- hypreal_hrabs
|
wenzelm@17423
|
6827 |
star_n_divide <-- hcomplex_divide
|
wenzelm@17423
|
6828 |
|
huffman@17442
|
6829 |
star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
|
huffman@17442
|
6830 |
star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
|
wenzelm@17423
|
6831 |
star_of_diff <-- hypreal_of_real_diff
|
huffman@17442
|
6832 |
star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
|
huffman@17442
|
6833 |
star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
|
huffman@17442
|
6834 |
star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
|
huffman@17442
|
6835 |
star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
|
huffman@17442
|
6836 |
star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
|
huffman@17442
|
6837 |
star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
|
huffman@17442
|
6838 |
star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
|
huffman@17442
|
6839 |
star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
|
huffman@17442
|
6840 |
star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
|
huffman@17442
|
6841 |
star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
|
huffman@17442
|
6842 |
star_of_number_of <-- {hypreal,hcomplex}_number_of
|
wenzelm@17423
|
6843 |
star_of_number_less <-- number_of_less_hypreal_of_real_iff
|
wenzelm@17423
|
6844 |
star_of_number_le <-- number_of_le_hypreal_of_real_iff
|
wenzelm@17423
|
6845 |
star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
|
wenzelm@17423
|
6846 |
star_of_less_number <-- hypreal_of_real_less_number_of_iff
|
wenzelm@17423
|
6847 |
star_of_le_number <-- hypreal_of_real_le_number_of_iff
|
wenzelm@17423
|
6848 |
star_of_power <-- hypreal_of_real_power
|
wenzelm@17423
|
6849 |
star_of_eq_0 <-- hcomplex_of_complex_zero_iff
|
wenzelm@17423
|
6850 |
|
huffman@17442
|
6851 |
* Hyperreal: new method "transfer" that implements the transfer
|
huffman@17442
|
6852 |
principle of nonstandard analysis. With a subgoal that mentions
|
huffman@17442
|
6853 |
nonstandard types like "'a star", the command "apply transfer"
|
huffman@17442
|
6854 |
replaces it with an equivalent one that mentions only standard types.
|
huffman@17442
|
6855 |
To be successful, all free variables must have standard types; non-
|
huffman@17442
|
6856 |
standard variables must have explicit universal quantifiers.
|
huffman@17442
|
6857 |
|
wenzelm@17641
|
6858 |
* Hyperreal: A theory of Taylor series.
|
wenzelm@17641
|
6859 |
|
wenzelm@15703
|
6860 |
|
wenzelm@15703
|
6861 |
*** HOLCF ***
|
wenzelm@15703
|
6862 |
|
wenzelm@17533
|
6863 |
* Discontinued special version of 'constdefs' (which used to support
|
wenzelm@17533
|
6864 |
continuous functions) in favor of the general Pure one with full
|
wenzelm@17533
|
6865 |
type-inference.
|
wenzelm@17533
|
6866 |
|
wenzelm@17533
|
6867 |
* New simplification procedure for solving continuity conditions; it
|
wenzelm@17533
|
6868 |
is much faster on terms with many nested lambda abstractions (cubic
|
huffman@17442
|
6869 |
instead of exponential time).
|
huffman@17442
|
6870 |
|
wenzelm@17533
|
6871 |
* New syntax for domain package: selector names are now optional.
|
huffman@17442
|
6872 |
Parentheses should be omitted unless argument is lazy, for example:
|
huffman@17442
|
6873 |
|
huffman@17442
|
6874 |
domain 'a stream = cons "'a" (lazy "'a stream")
|
huffman@17442
|
6875 |
|
wenzelm@17533
|
6876 |
* New command 'fixrec' for defining recursive functions with pattern
|
wenzelm@17533
|
6877 |
matching; defining multiple functions with mutual recursion is also
|
wenzelm@17533
|
6878 |
supported. Patterns may include the constants cpair, spair, up, sinl,
|
wenzelm@17533
|
6879 |
sinr, or any data constructor defined by the domain package. The given
|
wenzelm@17533
|
6880 |
equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
|
wenzelm@17533
|
6881 |
syntax and examples.
|
wenzelm@17533
|
6882 |
|
wenzelm@17533
|
6883 |
* New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
|
wenzelm@17533
|
6884 |
of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
|
wenzelm@17533
|
6885 |
but the proof obligation additionally includes an admissibility
|
wenzelm@17533
|
6886 |
requirement. The packages generate instances of class cpo or pcpo,
|
wenzelm@17533
|
6887 |
with continuity and strictness theorems for Rep and Abs.
|
huffman@17442
|
6888 |
|
huffman@17584
|
6889 |
* HOLCF: Many theorems have been renamed according to a more standard naming
|
huffman@17584
|
6890 |
scheme (INCOMPATIBILITY):
|
huffman@17584
|
6891 |
|
huffman@17584
|
6892 |
foo_inject: "foo$x = foo$y ==> x = y"
|
huffman@17584
|
6893 |
foo_eq: "(foo$x = foo$y) = (x = y)"
|
huffman@17584
|
6894 |
foo_less: "(foo$x << foo$y) = (x << y)"
|
huffman@17584
|
6895 |
foo_strict: "foo$UU = UU"
|
huffman@17584
|
6896 |
foo_defined: "... ==> foo$x ~= UU"
|
huffman@17584
|
6897 |
foo_defined_iff: "(foo$x = UU) = (x = UU)"
|
huffman@17584
|
6898 |
|
wenzelm@15703
|
6899 |
|
wenzelm@15703
|
6900 |
*** ZF ***
|
wenzelm@15703
|
6901 |
|
wenzelm@16234
|
6902 |
* ZF/ex: theories Group and Ring provide examples in abstract algebra,
|
wenzelm@16234
|
6903 |
including the First Isomorphism Theorem (on quotienting by the kernel
|
wenzelm@16234
|
6904 |
of a homomorphism).
|
wenzelm@15703
|
6905 |
|
wenzelm@15703
|
6906 |
* ZF/Simplifier: install second copy of type solver that actually
|
wenzelm@16234
|
6907 |
makes use of TC rules declared to Isar proof contexts (or locales);
|
wenzelm@16234
|
6908 |
the old version is still required for ML proof scripts.
|
wenzelm@15703
|
6909 |
|
wenzelm@15703
|
6910 |
|
wenzelm@17445
|
6911 |
*** Cube ***
|
wenzelm@17445
|
6912 |
|
wenzelm@17445
|
6913 |
* Converted to Isar theory format; use locales instead of axiomatic
|
wenzelm@17445
|
6914 |
theories.
|
wenzelm@17445
|
6915 |
|
wenzelm@17445
|
6916 |
|
wenzelm@15703
|
6917 |
*** ML ***
|
wenzelm@15703
|
6918 |
|
haftmann@21339
|
6919 |
* Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
|
haftmann@21339
|
6920 |
for ||>, ||>>, |>>,
|
haftmann@21339
|
6921 |
|
wenzelm@15973
|
6922 |
* Pure/library.ML no longer defines its own option datatype, but uses
|
wenzelm@16234
|
6923 |
that of the SML basis, which has constructors NONE and SOME instead of
|
wenzelm@16234
|
6924 |
None and Some, as well as exception Option.Option instead of OPTION.
|
wenzelm@16234
|
6925 |
The functions the, if_none, is_some, is_none have been adapted
|
wenzelm@16234
|
6926 |
accordingly, while Option.map replaces apsome.
|
wenzelm@15973
|
6927 |
|
wenzelm@16860
|
6928 |
* Pure/library.ML: the exception LIST has been given up in favour of
|
wenzelm@16860
|
6929 |
the standard exceptions Empty and Subscript, as well as
|
wenzelm@16860
|
6930 |
Library.UnequalLengths. Function like Library.hd and Library.tl are
|
wenzelm@36856
|
6931 |
superceded by the standard hd and tl functions etc.
|
wenzelm@16860
|
6932 |
|
wenzelm@16860
|
6933 |
A number of basic list functions are no longer exported to the ML
|
wenzelm@16860
|
6934 |
toplevel, as they are variants of predefined functions. The following
|
wenzelm@16234
|
6935 |
suggests how one can translate existing code:
|
wenzelm@15973
|
6936 |
|
wenzelm@15973
|
6937 |
rev_append xs ys = List.revAppend (xs, ys)
|
wenzelm@15973
|
6938 |
nth_elem (i, xs) = List.nth (xs, i)
|
wenzelm@15973
|
6939 |
last_elem xs = List.last xs
|
wenzelm@15973
|
6940 |
flat xss = List.concat xss
|
wenzelm@16234
|
6941 |
seq fs = List.app fs
|
wenzelm@15973
|
6942 |
partition P xs = List.partition P xs
|
wenzelm@15973
|
6943 |
mapfilter f xs = List.mapPartial f xs
|
wenzelm@15973
|
6944 |
|
wenzelm@16860
|
6945 |
* Pure/library.ML: several combinators for linear functional
|
wenzelm@16860
|
6946 |
transformations, notably reverse application and composition:
|
wenzelm@16860
|
6947 |
|
wenzelm@17371
|
6948 |
x |> f f #> g
|
wenzelm@17371
|
6949 |
(x, y) |-> f f #-> g
|
wenzelm@16860
|
6950 |
|
haftmann@17495
|
6951 |
* Pure/library.ML: introduced/changed precedence of infix operators:
|
haftmann@17495
|
6952 |
|
haftmann@17495
|
6953 |
infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
|
haftmann@17495
|
6954 |
infix 2 ?;
|
haftmann@17495
|
6955 |
infix 3 o oo ooo oooo;
|
haftmann@17495
|
6956 |
infix 4 ~~ upto downto;
|
haftmann@17495
|
6957 |
|
haftmann@17495
|
6958 |
Maybe INCOMPATIBILITY when any of those is used in conjunction with other
|
haftmann@17495
|
6959 |
infix operators.
|
haftmann@17495
|
6960 |
|
wenzelm@17408
|
6961 |
* Pure/library.ML: natural list combinators fold, fold_rev, and
|
haftmann@16869
|
6962 |
fold_map support linear functional transformations and nesting. For
|
wenzelm@16860
|
6963 |
example:
|
wenzelm@16860
|
6964 |
|
wenzelm@16860
|
6965 |
fold f [x1, ..., xN] y =
|
wenzelm@16860
|
6966 |
y |> f x1 |> ... |> f xN
|
wenzelm@16860
|
6967 |
|
wenzelm@16860
|
6968 |
(fold o fold) f [xs1, ..., xsN] y =
|
wenzelm@16860
|
6969 |
y |> fold f xs1 |> ... |> fold f xsN
|
wenzelm@16860
|
6970 |
|
wenzelm@16860
|
6971 |
fold f [x1, ..., xN] =
|
wenzelm@16860
|
6972 |
f x1 #> ... #> f xN
|
wenzelm@16860
|
6973 |
|
wenzelm@16860
|
6974 |
(fold o fold) f [xs1, ..., xsN] =
|
wenzelm@16860
|
6975 |
fold f xs1 #> ... #> fold f xsN
|
wenzelm@16860
|
6976 |
|
wenzelm@17408
|
6977 |
* Pure/library.ML: the following selectors on type 'a option are
|
wenzelm@17408
|
6978 |
available:
|
wenzelm@17408
|
6979 |
|
wenzelm@17408
|
6980 |
the: 'a option -> 'a (*partial*)
|
wenzelm@17408
|
6981 |
these: 'a option -> 'a where 'a = 'b list
|
haftmann@17402
|
6982 |
the_default: 'a -> 'a option -> 'a
|
haftmann@17402
|
6983 |
the_list: 'a option -> 'a list
|
haftmann@17402
|
6984 |
|
wenzelm@17408
|
6985 |
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides
|
wenzelm@17408
|
6986 |
basic operations for association lists, following natural argument
|
haftmann@17564
|
6987 |
order; moreover the explicit equality predicate passed here avoids
|
haftmann@17495
|
6988 |
potentially expensive polymorphic runtime equality checks.
|
haftmann@17495
|
6989 |
The old functions may be expressed as follows:
|
wenzelm@17408
|
6990 |
|
wenzelm@17408
|
6991 |
assoc = uncurry (AList.lookup (op =))
|
wenzelm@17408
|
6992 |
assocs = these oo AList.lookup (op =)
|
wenzelm@17408
|
6993 |
overwrite = uncurry (AList.update (op =)) o swap
|
wenzelm@17408
|
6994 |
|
haftmann@17564
|
6995 |
* Pure/General: structure AList (cf. Pure/General/alist.ML) provides
|
haftmann@17564
|
6996 |
|
haftmann@17564
|
6997 |
val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
|
haftmann@17564
|
6998 |
val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
|
haftmann@17564
|
6999 |
|
haftmann@17564
|
7000 |
replacing make_keylist and keyfilter (occassionally used)
|
haftmann@17564
|
7001 |
Naive rewrites:
|
haftmann@17564
|
7002 |
|
haftmann@17564
|
7003 |
make_keylist = AList.make
|
haftmann@17564
|
7004 |
keyfilter = AList.find (op =)
|
haftmann@17564
|
7005 |
|
haftmann@17564
|
7006 |
* eq_fst and eq_snd now take explicit equality parameter, thus
|
haftmann@17564
|
7007 |
avoiding eqtypes. Naive rewrites:
|
haftmann@17564
|
7008 |
|
haftmann@17564
|
7009 |
eq_fst = eq_fst (op =)
|
haftmann@17564
|
7010 |
eq_snd = eq_snd (op =)
|
haftmann@17564
|
7011 |
|
haftmann@17564
|
7012 |
* Removed deprecated apl and apr (rarely used).
|
haftmann@17564
|
7013 |
Naive rewrites:
|
haftmann@17564
|
7014 |
|
haftmann@17564
|
7015 |
apl (n, op) =>>= curry op n
|
haftmann@17564
|
7016 |
apr (op, m) =>>= fn n => op (n, m)
|
haftmann@17564
|
7017 |
|
wenzelm@17408
|
7018 |
* Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
|
wenzelm@17408
|
7019 |
provides a reasonably efficient light-weight implementation of sets as
|
wenzelm@17408
|
7020 |
lists.
|
wenzelm@17408
|
7021 |
|
wenzelm@17408
|
7022 |
* Pure/General: generic tables (cf. Pure/General/table.ML) provide a
|
wenzelm@17408
|
7023 |
few new operations; existing lookup and update are now curried to
|
wenzelm@17408
|
7024 |
follow natural argument order (for use with fold etc.);
|
wenzelm@17408
|
7025 |
INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
|
wenzelm@17408
|
7026 |
|
wenzelm@17408
|
7027 |
* Pure/General: output via the Isabelle channels of
|
wenzelm@17408
|
7028 |
writeln/warning/error etc. is now passed through Output.output, with a
|
wenzelm@17408
|
7029 |
hook for arbitrary transformations depending on the print_mode
|
wenzelm@17408
|
7030 |
(cf. Output.add_mode -- the first active mode that provides a output
|
wenzelm@17408
|
7031 |
function wins). Already formatted output may be embedded into further
|
wenzelm@17408
|
7032 |
text via Output.raw; the result of Pretty.string_of/str_of and derived
|
wenzelm@17408
|
7033 |
functions (string_of_term/cterm/thm etc.) is already marked raw to
|
wenzelm@17408
|
7034 |
accommodate easy composition of diagnostic messages etc. Programmers
|
wenzelm@17408
|
7035 |
rarely need to care about Output.output or Output.raw at all, with
|
wenzelm@17408
|
7036 |
some notable exceptions: Output.output is required when bypassing the
|
wenzelm@17408
|
7037 |
standard channels (writeln etc.), or in token translations to produce
|
wenzelm@17408
|
7038 |
properly formatted results; Output.raw is required when capturing
|
wenzelm@17408
|
7039 |
already output material that will eventually be presented to the user
|
wenzelm@17408
|
7040 |
a second time. For the default print mode, both Output.output and
|
wenzelm@17408
|
7041 |
Output.raw have no effect.
|
wenzelm@17408
|
7042 |
|
wenzelm@17408
|
7043 |
* Pure/General: Output.time_accumulator NAME creates an operator ('a
|
wenzelm@17408
|
7044 |
-> 'b) -> 'a -> 'b to measure runtime and count invocations; the
|
wenzelm@17408
|
7045 |
cumulative results are displayed at the end of a batch session.
|
wenzelm@17408
|
7046 |
|
wenzelm@17408
|
7047 |
* Pure/General: File.sysify_path and File.quote_sysify path have been
|
wenzelm@17408
|
7048 |
replaced by File.platform_path and File.shell_path (with appropriate
|
wenzelm@17408
|
7049 |
hooks). This provides a clean interface for unusual systems where the
|
wenzelm@17408
|
7050 |
internal and external process view of file names are different.
|
wenzelm@17408
|
7051 |
|
wenzelm@16689
|
7052 |
* Pure: more efficient orders for basic syntactic entities: added
|
wenzelm@16689
|
7053 |
fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
|
wenzelm@16689
|
7054 |
and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
|
wenzelm@16689
|
7055 |
NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
|
wenzelm@16689
|
7056 |
orders now -- potential INCOMPATIBILITY for code that depends on a
|
wenzelm@16689
|
7057 |
particular order for Symtab.keys, Symtab.dest, etc. (consider using
|
wenzelm@16689
|
7058 |
Library.sort_strings on result).
|
wenzelm@16689
|
7059 |
|
wenzelm@17408
|
7060 |
* Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
|
wenzelm@17408
|
7061 |
fold_types traverse types/terms from left to right, observing natural
|
wenzelm@36856
|
7062 |
argument order. Supercedes previous foldl_XXX versions, add_frees,
|
wenzelm@17408
|
7063 |
add_vars etc. have been adapted as well: INCOMPATIBILITY.
|
wenzelm@17408
|
7064 |
|
wenzelm@16151
|
7065 |
* Pure: name spaces have been refined, with significant changes of the
|
wenzelm@16234
|
7066 |
internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
|
wenzelm@36856
|
7067 |
to extern(_table). The plain name entry path is superceded by a
|
wenzelm@16234
|
7068 |
general 'naming' context, which also includes the 'policy' to produce
|
wenzelm@16234
|
7069 |
a fully qualified name and external accesses of a fully qualified
|
wenzelm@36856
|
7070 |
name; NameSpace.extend is superceded by context dependent
|
wenzelm@16234
|
7071 |
Sign.declare_name. Several theory and proof context operations modify
|
wenzelm@16234
|
7072 |
the naming context. Especially note Theory.restore_naming and
|
wenzelm@16234
|
7073 |
ProofContext.restore_naming to get back to a sane state; note that
|
wenzelm@16234
|
7074 |
Theory.add_path is no longer sufficient to recover from
|
wenzelm@16234
|
7075 |
Theory.absolute_path in particular.
|
wenzelm@16234
|
7076 |
|
wenzelm@16234
|
7077 |
* Pure: new flags short_names (default false) and unique_names
|
wenzelm@16234
|
7078 |
(default true) for controlling output of qualified names. If
|
wenzelm@16234
|
7079 |
short_names is set, names are printed unqualified. If unique_names is
|
wenzelm@16234
|
7080 |
reset, the name prefix is reduced to the minimum required to achieve
|
wenzelm@16234
|
7081 |
the original result when interning again, even if there is an overlap
|
wenzelm@16234
|
7082 |
with earlier declarations.
|
wenzelm@16151
|
7083 |
|
wenzelm@16456
|
7084 |
* Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
|
wenzelm@16456
|
7085 |
now 'extend', and 'merge' gets an additional Pretty.pp argument
|
wenzelm@16456
|
7086 |
(useful for printing error messages). INCOMPATIBILITY.
|
wenzelm@16456
|
7087 |
|
wenzelm@16456
|
7088 |
* Pure: major reorganization of the theory context. Type Sign.sg and
|
wenzelm@16456
|
7089 |
Theory.theory are now identified, referring to the universal
|
wenzelm@16456
|
7090 |
Context.theory (see Pure/context.ML). Actual signature and theory
|
wenzelm@16456
|
7091 |
content is managed as theory data. The old code and interfaces were
|
wenzelm@16456
|
7092 |
spread over many files and structures; the new arrangement introduces
|
wenzelm@16456
|
7093 |
considerable INCOMPATIBILITY to gain more clarity:
|
wenzelm@16456
|
7094 |
|
wenzelm@16456
|
7095 |
Context -- theory management operations (name, identity, inclusion,
|
wenzelm@16456
|
7096 |
parents, ancestors, merge, etc.), plus generic theory data;
|
wenzelm@16456
|
7097 |
|
wenzelm@16456
|
7098 |
Sign -- logical signature and syntax operations (declaring consts,
|
wenzelm@16456
|
7099 |
types, etc.), plus certify/read for common entities;
|
wenzelm@16456
|
7100 |
|
wenzelm@16456
|
7101 |
Theory -- logical theory operations (stating axioms, definitions,
|
wenzelm@16456
|
7102 |
oracles), plus a copy of logical signature operations (consts,
|
wenzelm@16456
|
7103 |
types, etc.); also a few basic management operations (Theory.copy,
|
wenzelm@16456
|
7104 |
Theory.merge, etc.)
|
wenzelm@16456
|
7105 |
|
wenzelm@16456
|
7106 |
The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
|
wenzelm@16456
|
7107 |
etc.) as well as the sign field in Thm.rep_thm etc. have been retained
|
wenzelm@16456
|
7108 |
for convenience -- they merely return the theory.
|
wenzelm@16456
|
7109 |
|
wenzelm@36856
|
7110 |
* Pure: type Type.tsig is superceded by theory in most interfaces.
|
wenzelm@17193
|
7111 |
|
wenzelm@16547
|
7112 |
* Pure: the Isar proof context type is already defined early in Pure
|
wenzelm@16547
|
7113 |
as Context.proof (note that ProofContext.context and Proof.context are
|
wenzelm@16547
|
7114 |
aliases, where the latter is the preferred name). This enables other
|
wenzelm@16547
|
7115 |
Isabelle components to refer to that type even before Isar is present.
|
wenzelm@16547
|
7116 |
|
wenzelm@16373
|
7117 |
* Pure/sign/theory: discontinued named name spaces (i.e. classK,
|
wenzelm@16373
|
7118 |
typeK, constK, axiomK, oracleK), but provide explicit operations for
|
wenzelm@16373
|
7119 |
any of these kinds. For example, Sign.intern typeK is now
|
wenzelm@16373
|
7120 |
Sign.intern_type, Theory.hide_space Sign.typeK is now
|
wenzelm@16373
|
7121 |
Theory.hide_types. Also note that former
|
wenzelm@16373
|
7122 |
Theory.hide_classes/types/consts are now
|
wenzelm@16373
|
7123 |
Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
|
wenzelm@16373
|
7124 |
internalize their arguments! INCOMPATIBILITY.
|
wenzelm@16373
|
7125 |
|
wenzelm@16506
|
7126 |
* Pure: get_thm interface (of PureThy and ProofContext) expects
|
wenzelm@16506
|
7127 |
datatype thmref (with constructors Name and NameSelection) instead of
|
wenzelm@16506
|
7128 |
plain string -- INCOMPATIBILITY;
|
wenzelm@16506
|
7129 |
|
wenzelm@16151
|
7130 |
* Pure: cases produced by proof methods specify options, where NONE
|
wenzelm@16234
|
7131 |
means to remove case bindings -- INCOMPATIBILITY in
|
wenzelm@16234
|
7132 |
(RAW_)METHOD_CASES.
|
wenzelm@16151
|
7133 |
|
wenzelm@16373
|
7134 |
* Pure: the following operations retrieve axioms or theorems from a
|
wenzelm@16373
|
7135 |
theory node or theory hierarchy, respectively:
|
wenzelm@16373
|
7136 |
|
wenzelm@16373
|
7137 |
Theory.axioms_of: theory -> (string * term) list
|
wenzelm@16373
|
7138 |
Theory.all_axioms_of: theory -> (string * term) list
|
wenzelm@16373
|
7139 |
PureThy.thms_of: theory -> (string * thm) list
|
wenzelm@16373
|
7140 |
PureThy.all_thms_of: theory -> (string * thm) list
|
wenzelm@16373
|
7141 |
|
wenzelm@16718
|
7142 |
* Pure: print_tac now outputs the goal through the trace channel.
|
wenzelm@16718
|
7143 |
|
wenzelm@17408
|
7144 |
* Isar toplevel: improved diagnostics, mostly for Poly/ML only.
|
wenzelm@17408
|
7145 |
Reference Toplevel.debug (default false) controls detailed printing
|
wenzelm@17408
|
7146 |
and tracing of low-level exceptions; Toplevel.profiling (default 0)
|
wenzelm@17408
|
7147 |
controls execution profiling -- set to 1 for time and 2 for space
|
wenzelm@17408
|
7148 |
(both increase the runtime).
|
wenzelm@17408
|
7149 |
|
wenzelm@17408
|
7150 |
* Isar session: The initial use of ROOT.ML is now always timed,
|
wenzelm@17408
|
7151 |
i.e. the log will show the actual process times, in contrast to the
|
wenzelm@17408
|
7152 |
elapsed wall-clock time that the outer shell wrapper produces.
|
wenzelm@17408
|
7153 |
|
wenzelm@17408
|
7154 |
* Simplifier: improved handling of bound variables (nameless
|
wenzelm@16997
|
7155 |
representation, avoid allocating new strings). Simprocs that invoke
|
wenzelm@16997
|
7156 |
the Simplifier recursively should use Simplifier.inherit_bounds to
|
wenzelm@17720
|
7157 |
avoid local name clashes. Failure to do so produces warnings
|
wenzelm@17720
|
7158 |
"Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
|
wenzelm@17720
|
7159 |
for further details.
|
wenzelm@16234
|
7160 |
|
wenzelm@17166
|
7161 |
* ML functions legacy_bindings and use_legacy_bindings produce ML fact
|
wenzelm@17166
|
7162 |
bindings for all theorems stored within a given theory; this may help
|
wenzelm@17166
|
7163 |
in porting non-Isar theories to Isar ones, while keeping ML proof
|
wenzelm@17166
|
7164 |
scripts for the time being.
|
wenzelm@17166
|
7165 |
|
wenzelm@17457
|
7166 |
* ML operator HTML.with_charset specifies the charset begin used for
|
wenzelm@17457
|
7167 |
generated HTML files. For example:
|
wenzelm@17457
|
7168 |
|
wenzelm@17457
|
7169 |
HTML.with_charset "utf-8" use_thy "Hebrew";
|
wenzelm@17538
|
7170 |
HTML.with_charset "utf-8" use_thy "Chinese";
|
wenzelm@17457
|
7171 |
|
wenzelm@16234
|
7172 |
|
wenzelm@16234
|
7173 |
*** System ***
|
wenzelm@16234
|
7174 |
|
wenzelm@16234
|
7175 |
* Allow symlinks to all proper Isabelle executables (Isabelle,
|
wenzelm@16234
|
7176 |
isabelle, isatool etc.).
|
wenzelm@16234
|
7177 |
|
wenzelm@16234
|
7178 |
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for
|
wenzelm@16234
|
7179 |
isatool doc, isatool mkdir, display_drafts etc.).
|
wenzelm@16234
|
7180 |
|
wenzelm@16234
|
7181 |
* isatool usedir: option -f allows specification of the ML file to be
|
wenzelm@16234
|
7182 |
used by Isabelle; default is ROOT.ML.
|
wenzelm@16234
|
7183 |
|
wenzelm@16251
|
7184 |
* New isatool version outputs the version identifier of the Isabelle
|
wenzelm@16251
|
7185 |
distribution being used.
|
wenzelm@16251
|
7186 |
|
wenzelm@16251
|
7187 |
* HOL: new isatool dimacs2hol converts files in DIMACS CNF format
|
wenzelm@16234
|
7188 |
(containing Boolean satisfiability problems) into Isabelle/HOL
|
wenzelm@16234
|
7189 |
theories.
|
paulson@14885
|
7190 |
|
paulson@14885
|
7191 |
|
wenzelm@14655
|
7192 |
|
wenzelm@14606
|
7193 |
New in Isabelle2004 (April 2004)
|
wenzelm@14606
|
7194 |
--------------------------------
|
wenzelm@13280
|
7195 |
|
skalberg@14171
|
7196 |
*** General ***
|
skalberg@14171
|
7197 |
|
ballarin@14398
|
7198 |
* Provers/order.ML: new efficient reasoner for partial and linear orders.
|
ballarin@14398
|
7199 |
Replaces linorder.ML.
|
ballarin@14398
|
7200 |
|
wenzelm@14606
|
7201 |
* Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
|
wenzelm@14606
|
7202 |
(\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
|
skalberg@14173
|
7203 |
(\<a>...\<z>), are now considered normal letters, and can therefore
|
skalberg@14173
|
7204 |
be used anywhere where an ASCII letter (a...zA...Z) has until
|
skalberg@14173
|
7205 |
now. COMPATIBILITY: This obviously changes the parsing of some
|
skalberg@14173
|
7206 |
terms, especially where a symbol has been used as a binder, say
|
skalberg@14173
|
7207 |
'\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
|
skalberg@14173
|
7208 |
as an identifier. Fix it by inserting a space around former
|
skalberg@14173
|
7209 |
symbols. Call 'isatool fixgreek' to try to fix parsing errors in
|
skalberg@14173
|
7210 |
existing theory and ML files.
|
skalberg@14171
|
7211 |
|
paulson@14237
|
7212 |
* Pure: Macintosh and Windows line-breaks are now allowed in theory files.
|
paulson@14237
|
7213 |
|
wenzelm@14731
|
7214 |
* Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
|
wenzelm@14731
|
7215 |
allowed in identifiers. Similar to Greek letters \<^isub> is now considered
|
wenzelm@14731
|
7216 |
a normal (but invisible) letter. For multiple letter subscripts repeat
|
wenzelm@14731
|
7217 |
\<^isub> like this: x\<^isub>1\<^isub>2.
|
kleing@14233
|
7218 |
|
kleing@14333
|
7219 |
* Pure: There are now sub-/superscripts that can span more than one
|
kleing@14333
|
7220 |
character. Text between \<^bsub> and \<^esub> is set in subscript in
|
wenzelm@14606
|
7221 |
ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
|
wenzelm@14606
|
7222 |
superscript. The new control characters are not identifier parts.
|
kleing@14333
|
7223 |
|
schirmer@14561
|
7224 |
* Pure: Control-symbols of the form \<^raw:...> will literally print the
|
wenzelm@14606
|
7225 |
content of "..." to the latex file instead of \isacntrl... . The "..."
|
wenzelm@14606
|
7226 |
may consist of any printable characters excluding the end bracket >.
|
schirmer@14361
|
7227 |
|
paulson@14237
|
7228 |
* Pure: Using new Isar command "finalconsts" (or the ML functions
|
paulson@14237
|
7229 |
Theory.add_finals or Theory.add_finals_i) it is now possible to
|
paulson@14237
|
7230 |
declare constants "final", which prevents their being given a definition
|
paulson@14237
|
7231 |
later. It is useful for constants whose behaviour is fixed axiomatically
|
skalberg@14224
|
7232 |
rather than definitionally, such as the meta-logic connectives.
|
skalberg@14224
|
7233 |
|
wenzelm@14606
|
7234 |
* Pure: 'instance' now handles general arities with general sorts
|
wenzelm@14606
|
7235 |
(i.e. intersections of classes),
|
skalberg@14503
|
7236 |
|
kleing@14547
|
7237 |
* Presentation: generated HTML now uses a CSS style sheet to make layout
|
wenzelm@14731
|
7238 |
(somewhat) independent of content. It is copied from lib/html/isabelle.css.
|
kleing@14547
|
7239 |
It can be changed to alter the colors/layout of generated pages.
|
kleing@14547
|
7240 |
|
wenzelm@14556
|
7241 |
|
ballarin@14175
|
7242 |
*** Isar ***
|
ballarin@14175
|
7243 |
|
ballarin@14508
|
7244 |
* Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
|
ballarin@14508
|
7245 |
cut_tac, subgoal_tac and thin_tac:
|
ballarin@14175
|
7246 |
- Now understand static (Isar) contexts. As a consequence, users of Isar
|
ballarin@14175
|
7247 |
locales are no longer forced to write Isar proof scripts.
|
ballarin@14175
|
7248 |
For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
|
ballarin@14175
|
7249 |
emulations.
|
ballarin@14175
|
7250 |
- INCOMPATIBILITY: names of variables to be instantiated may no
|
ballarin@14211
|
7251 |
longer be enclosed in quotes. Instead, precede variable name with `?'.
|
ballarin@14211
|
7252 |
This is consistent with the instantiation attribute "where".
|
ballarin@14211
|
7253 |
|
ballarin@14257
|
7254 |
* Attributes "where" and "of":
|
ballarin@14285
|
7255 |
- Now take type variables of instantiated theorem into account when reading
|
ballarin@14285
|
7256 |
the instantiation string. This fixes a bug that caused instantiated
|
ballarin@14285
|
7257 |
theorems to have too special types in some circumstances.
|
ballarin@14285
|
7258 |
- "where" permits explicit instantiations of type variables.
|
ballarin@14257
|
7259 |
|
wenzelm@14556
|
7260 |
* Calculation commands "moreover" and "also" no longer interfere with
|
wenzelm@14556
|
7261 |
current facts ("this"), admitting arbitrary combinations with "then"
|
wenzelm@14556
|
7262 |
and derived forms.
|
kleing@14283
|
7263 |
|
ballarin@14211
|
7264 |
* Locales:
|
ballarin@14211
|
7265 |
- Goal statements involving the context element "includes" no longer
|
ballarin@14211
|
7266 |
generate theorems with internal delta predicates (those ending on
|
ballarin@14211
|
7267 |
"_axioms") in the premise.
|
ballarin@14211
|
7268 |
Resolve particular premise with <locale>.intro to obtain old form.
|
ballarin@14211
|
7269 |
- Fixed bug in type inference ("unify_frozen") that prevented mix of target
|
ballarin@14211
|
7270 |
specification and "includes" elements in goal statement.
|
ballarin@14254
|
7271 |
- Rule sets <locale>.intro and <locale>.axioms no longer declared as
|
ballarin@14254
|
7272 |
[intro?] and [elim?] (respectively) by default.
|
ballarin@14508
|
7273 |
- Experimental command for instantiation of locales in proof contexts:
|
ballarin@14551
|
7274 |
instantiate <label>[<attrs>]: <loc>
|
ballarin@14508
|
7275 |
Instantiates locale <loc> and adds all its theorems to the current context
|
ballarin@14551
|
7276 |
taking into account their attributes. Label and attrs are optional
|
ballarin@14551
|
7277 |
modifiers, like in theorem declarations. If present, names of
|
ballarin@14551
|
7278 |
instantiated theorems are qualified with <label>, and the attributes
|
ballarin@14551
|
7279 |
<attrs> are applied after any attributes these theorems might have already.
|
ballarin@14551
|
7280 |
If the locale has assumptions, a chained fact of the form
|
ballarin@14508
|
7281 |
"<loc> t1 ... tn" is expected from which instantiations of the parameters
|
ballarin@14551
|
7282 |
are derived. The command does not support old-style locales declared
|
ballarin@14551
|
7283 |
with "locale (open)".
|
ballarin@14551
|
7284 |
A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
|
ballarin@14175
|
7285 |
|
ballarin@14175
|
7286 |
* HOL: Tactic emulation methods induct_tac and case_tac understand static
|
ballarin@14175
|
7287 |
(Isar) contexts.
|
ballarin@14175
|
7288 |
|
wenzelm@14556
|
7289 |
|
kleing@14136
|
7290 |
*** HOL ***
|
kleing@14136
|
7291 |
|
kleing@14624
|
7292 |
* Proof import: new image HOL4 contains the imported library from
|
kleing@14624
|
7293 |
the HOL4 system with about 2500 theorems. It is imported by
|
kleing@14624
|
7294 |
replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
|
kleing@14624
|
7295 |
can be used like any other Isabelle image. See
|
kleing@14624
|
7296 |
HOL/Import/HOL/README for more information.
|
kleing@14624
|
7297 |
|
ballarin@14398
|
7298 |
* Simplifier:
|
ballarin@14398
|
7299 |
- Much improved handling of linear and partial orders.
|
ballarin@14398
|
7300 |
Reasoners for linear and partial orders are set up for type classes
|
ballarin@14398
|
7301 |
"linorder" and "order" respectively, and are added to the default simpset
|
ballarin@14398
|
7302 |
as solvers. This means that the simplifier can build transitivity chains
|
ballarin@14398
|
7303 |
to solve goals from the assumptions.
|
ballarin@14398
|
7304 |
- INCOMPATIBILITY: old proofs break occasionally. Typically, applications
|
ballarin@14398
|
7305 |
of blast or auto after simplification become unnecessary because the goal
|
ballarin@14398
|
7306 |
is solved by simplification already.
|
ballarin@14398
|
7307 |
|
wenzelm@14731
|
7308 |
* Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
|
paulson@14389
|
7309 |
all proved in axiomatic type classes for semirings, rings and fields.
|
paulson@14389
|
7310 |
|
paulson@14389
|
7311 |
* Numerics:
|
paulson@14389
|
7312 |
- Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
|
wenzelm@14731
|
7313 |
now formalized using the Ring_and_Field theory mentioned above.
|
paulson@14389
|
7314 |
- INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
|
paulson@14389
|
7315 |
than before, because now they are set up once in a generic manner.
|
wenzelm@14731
|
7316 |
- INCOMPATIBILITY: many type-specific arithmetic laws have gone.
|
paulson@14480
|
7317 |
Look for the general versions in Ring_and_Field (and Power if they concern
|
paulson@14480
|
7318 |
exponentiation).
|
paulson@14389
|
7319 |
|
paulson@14401
|
7320 |
* Type "rat" of the rational numbers is now available in HOL-Complex.
|
paulson@14389
|
7321 |
|
schirmer@14255
|
7322 |
* Records:
|
schirmer@14255
|
7323 |
- Record types are now by default printed with their type abbreviation
|
schirmer@14255
|
7324 |
instead of the list of all field types. This can be configured via
|
schirmer@14255
|
7325 |
the reference "print_record_type_abbr".
|
wenzelm@14731
|
7326 |
- Simproc "record_upd_simproc" for simplification of multiple updates added
|
schirmer@14255
|
7327 |
(not enabled by default).
|
schirmer@14427
|
7328 |
- Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
|
schirmer@14427
|
7329 |
EX x. x = sel r to True (not enabled by default).
|
schirmer@14255
|
7330 |
- Tactic "record_split_simp_tac" to split and simplify records added.
|
wenzelm@14731
|
7331 |
|
kleing@14136
|
7332 |
* 'specification' command added, allowing for definition by
|
skalberg@14224
|
7333 |
specification. There is also an 'ax_specification' command that
|
skalberg@14224
|
7334 |
introduces the new constants axiomatically.
|
kleing@14136
|
7335 |
|
nipkow@14375
|
7336 |
* arith(_tac) is now able to generate counterexamples for reals as well.
|
nipkow@14375
|
7337 |
|
ballarin@14399
|
7338 |
* HOL-Algebra: new locale "ring" for non-commutative rings.
|
ballarin@14399
|
7339 |
|
paulson@14243
|
7340 |
* HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
|
kleing@14610
|
7341 |
definitions, thanks to Sava Krsti\'{c} and John Matthews.
|
kleing@14610
|
7342 |
|
wenzelm@14731
|
7343 |
* HOL-Matrix: a first theory for matrices in HOL with an application of
|
kleing@14610
|
7344 |
matrix theory to linear programming.
|
kleing@14136
|
7345 |
|
nipkow@14380
|
7346 |
* Unions and Intersections:
|
nipkow@15119
|
7347 |
The latex output syntax of UN and INT has been changed
|
nipkow@15119
|
7348 |
from "\Union x \in A. B" to "\Union_{x \in A} B"
|
nipkow@15119
|
7349 |
i.e. the index formulae has become a subscript.
|
nipkow@15119
|
7350 |
Similarly for "\Union x. B", and for \Inter instead of \Union.
|
nipkow@14380
|
7351 |
|
kleing@14418
|
7352 |
* Unions and Intersections over Intervals:
|
wenzelm@14731
|
7353 |
There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
|
wenzelm@14731
|
7354 |
also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
|
kleing@14418
|
7355 |
like in normal math, and corresponding versions for < and for intersection.
|
kleing@14418
|
7356 |
|
nipkow@15677
|
7357 |
* HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
|
nipkow@15677
|
7358 |
lexicographic dictonary ordering has been added as "lexord".
|
nipkow@15677
|
7359 |
|
paulson@14401
|
7360 |
* ML: the legacy theory structures Int and List have been removed. They had
|
paulson@14401
|
7361 |
conflicted with ML Basis Library structures having the same names.
|
nipkow@14380
|
7362 |
|
webertj@14464
|
7363 |
* 'refute' command added to search for (finite) countermodels. Only works
|
webertj@14464
|
7364 |
for a fragment of HOL. The installation of an external SAT solver is
|
webertj@14464
|
7365 |
highly recommended. See "HOL/Refute.thy" for details.
|
webertj@14464
|
7366 |
|
berghofe@14602
|
7367 |
* 'quickcheck' command: Allows to find counterexamples by evaluating
|
berghofe@14602
|
7368 |
formulae under an assignment of free variables to random values.
|
berghofe@14602
|
7369 |
In contrast to 'refute', it can deal with inductive datatypes,
|
berghofe@14602
|
7370 |
but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
|
berghofe@14602
|
7371 |
for examples.
|
webertj@14464
|
7372 |
|
wenzelm@14606
|
7373 |
|
oheimb@14536
|
7374 |
*** HOLCF ***
|
oheimb@14536
|
7375 |
|
oheimb@14536
|
7376 |
* Streams now come with concatenation and are part of the HOLCF image
|
oheimb@14536
|
7377 |
|
wenzelm@14572
|
7378 |
|
wenzelm@14572
|
7379 |
|
kleing@14136
|
7380 |
New in Isabelle2003 (May 2003)
|
wenzelm@14606
|
7381 |
------------------------------
|
kleing@14136
|
7382 |
|
wenzelm@13280
|
7383 |
*** General ***
|
wenzelm@13280
|
7384 |
|
berghofe@13618
|
7385 |
* Provers/simplifier:
|
berghofe@13618
|
7386 |
|
nipkow@13781
|
7387 |
- Completely reimplemented method simp (ML: Asm_full_simp_tac):
|
berghofe@13618
|
7388 |
Assumptions are now subject to complete mutual simplification,
|
berghofe@13618
|
7389 |
not just from left to right. The simplifier now preserves
|
berghofe@13618
|
7390 |
the order of assumptions.
|
berghofe@13618
|
7391 |
|
berghofe@13618
|
7392 |
Potential INCOMPATIBILITY:
|
berghofe@13618
|
7393 |
|
nipkow@13781
|
7394 |
-- simp sometimes diverges where the old version did
|
nipkow@13781
|
7395 |
not, e.g. invoking simp on the goal
|
berghofe@13618
|
7396 |
|
berghofe@13618
|
7397 |
[| P (f x); y = x; f x = f y |] ==> Q
|
berghofe@13618
|
7398 |
|
nipkow@13781
|
7399 |
now gives rise to the infinite reduction sequence
|
nipkow@13781
|
7400 |
|
nipkow@13781
|
7401 |
P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
|
nipkow@13781
|
7402 |
|
nipkow@13781
|
7403 |
Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
|
nipkow@13781
|
7404 |
kind of problem.
|
nipkow@13781
|
7405 |
|
nipkow@13781
|
7406 |
-- Tactics combining classical reasoner and simplification (such as auto)
|
nipkow@13781
|
7407 |
are also affected by this change, because many of them rely on
|
nipkow@13781
|
7408 |
simp. They may sometimes diverge as well or yield a different numbers
|
nipkow@13781
|
7409 |
of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
|
nipkow@13781
|
7410 |
in case of problems. Sometimes subsequent calls to the classical
|
nipkow@13781
|
7411 |
reasoner will fail because a preceeding call to the simplifier too
|
nipkow@13781
|
7412 |
eagerly simplified the goal, e.g. deleted redundant premises.
|
berghofe@13618
|
7413 |
|
berghofe@13618
|
7414 |
- The simplifier trace now shows the names of the applied rewrite rules
|
berghofe@13618
|
7415 |
|
nipkow@13829
|
7416 |
- You can limit the number of recursive invocations of the simplifier
|
nipkow@13829
|
7417 |
during conditional rewriting (where the simplifie tries to solve the
|
nipkow@13829
|
7418 |
conditions before applying the rewrite rule):
|
nipkow@13829
|
7419 |
ML "simp_depth_limit := n"
|
nipkow@13829
|
7420 |
where n is an integer. Thus you can force termination where previously
|
nipkow@13829
|
7421 |
the simplifier would diverge.
|
nipkow@13829
|
7422 |
|
ballarin@13835
|
7423 |
- Accepts free variables as head terms in congruence rules. Useful in Isar.
|
nipkow@13829
|
7424 |
|
ballarin@13938
|
7425 |
- No longer aborts on failed congruence proof. Instead, the
|
ballarin@13938
|
7426 |
congruence is ignored.
|
ballarin@13938
|
7427 |
|
berghofe@14008
|
7428 |
* Pure: New generic framework for extracting programs from constructive
|
berghofe@14008
|
7429 |
proofs. See HOL/Extraction.thy for an example instantiation, as well
|
berghofe@14008
|
7430 |
as HOL/Extraction for some case studies.
|
berghofe@14008
|
7431 |
|
nipkow@13868
|
7432 |
* Pure: The main goal of the proof state is no longer shown by default, only
|
nipkow@13868
|
7433 |
the subgoals. This behaviour is controlled by a new flag.
|
ballarin@13835
|
7434 |
PG menu: Isabelle/Isar -> Settings -> Show Main Goal
|
nipkow@13815
|
7435 |
(ML: Proof.show_main_goal).
|
nipkow@13815
|
7436 |
|
nipkow@13815
|
7437 |
* Pure: You can find all matching introduction rules for subgoal 1, i.e. all
|
nipkow@13815
|
7438 |
rules whose conclusion matches subgoal 1:
|
nipkow@13815
|
7439 |
PG menu: Isabelle/Isar -> Show me -> matching rules
|
nipkow@13815
|
7440 |
The rules are ordered by how closely they match the subgoal.
|
nipkow@13815
|
7441 |
In particular, rules that solve a subgoal outright are displayed first
|
nipkow@13815
|
7442 |
(or rather last, the way they are printed).
|
nipkow@13815
|
7443 |
(ML: ProofGeneral.print_intros())
|
nipkow@13815
|
7444 |
|
nipkow@13815
|
7445 |
* Pure: New flag trace_unify_fail causes unification to print
|
nipkow@13781
|
7446 |
diagnostic information (PG: in trace buffer) when it fails. This is
|
nipkow@13781
|
7447 |
useful for figuring out why single step proofs like rule, erule or
|
nipkow@13781
|
7448 |
assumption failed.
|
nipkow@13781
|
7449 |
|
nipkow@13815
|
7450 |
* Pure: Locale specifications now produce predicate definitions
|
wenzelm@13410
|
7451 |
according to the body of text (covering assumptions modulo local
|
wenzelm@13410
|
7452 |
definitions); predicate "loc_axioms" covers newly introduced text,
|
wenzelm@13410
|
7453 |
while "loc" is cumulative wrt. all included locale expressions; the
|
wenzelm@13410
|
7454 |
latter view is presented only on export into the global theory
|
wenzelm@13410
|
7455 |
context; potential INCOMPATIBILITY, use "(open)" option to fall back
|
wenzelm@13410
|
7456 |
on the old view without predicates;
|
wenzelm@13410
|
7457 |
|
wenzelm@13459
|
7458 |
* Pure: predefined locales "var" and "struct" are useful for sharing
|
wenzelm@13459
|
7459 |
parameters (as in CASL, for example); just specify something like
|
wenzelm@13459
|
7460 |
``var x + var y + struct M'' as import;
|
wenzelm@13459
|
7461 |
|
wenzelm@13463
|
7462 |
* Pure: improved thms_containing: proper indexing of facts instead of
|
wenzelm@13463
|
7463 |
raw theorems; check validity of results wrt. current name space;
|
wenzelm@13463
|
7464 |
include local facts of proof configuration (also covers active
|
wenzelm@13541
|
7465 |
locales), cover fixed variables in index; may use "_" in term
|
wenzelm@13541
|
7466 |
specification; an optional limit for the number of printed facts may
|
wenzelm@13541
|
7467 |
be given (the default is 40);
|
wenzelm@13541
|
7468 |
|
wenzelm@13541
|
7469 |
* Pure: disallow duplicate fact bindings within new-style theory files
|
wenzelm@13541
|
7470 |
(batch-mode only);
|
wenzelm@13540
|
7471 |
|
wenzelm@13463
|
7472 |
* Provers: improved induct method: assumptions introduced by case
|
wenzelm@13463
|
7473 |
"foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
|
wenzelm@13463
|
7474 |
the goal statement); "foo" still refers to all facts collectively;
|
wenzelm@13463
|
7475 |
|
paulson@13550
|
7476 |
* Provers: the function blast.overloaded has been removed: all constants
|
paulson@13550
|
7477 |
are regarded as potentially overloaded, which improves robustness in exchange
|
paulson@13550
|
7478 |
for slight decrease in efficiency;
|
paulson@13550
|
7479 |
|
nipkow@13781
|
7480 |
* Provers/linorder: New generic prover for transitivity reasoning over
|
nipkow@13781
|
7481 |
linear orders. Note: this prover is not efficient!
|
nipkow@13781
|
7482 |
|
wenzelm@13522
|
7483 |
* Isar: preview of problems to finish 'show' now produce an error
|
wenzelm@13522
|
7484 |
rather than just a warning (in interactive mode);
|
wenzelm@13522
|
7485 |
|
wenzelm@13280
|
7486 |
|
nipkow@13158
|
7487 |
*** HOL ***
|
nipkow@13158
|
7488 |
|
nipkow@13899
|
7489 |
* arith(_tac)
|
nipkow@13899
|
7490 |
|
nipkow@13899
|
7491 |
- Produces a counter example if it cannot prove a goal.
|
nipkow@13899
|
7492 |
Note that the counter example may be spurious if the goal is not a formula
|
nipkow@13899
|
7493 |
of quantifier-free linear arithmetic.
|
nipkow@13899
|
7494 |
In ProofGeneral the counter example appears in the trace buffer.
|
nipkow@13899
|
7495 |
|
nipkow@13899
|
7496 |
- Knows about div k and mod k where k is a numeral of type nat or int.
|
nipkow@13899
|
7497 |
|
nipkow@13899
|
7498 |
- Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
|
nipkow@13899
|
7499 |
linear arithmetic fails. This takes account of quantifiers and divisibility.
|
wenzelm@14731
|
7500 |
Presburger arithmetic can also be called explicitly via presburger(_tac).
|
nipkow@13899
|
7501 |
|
nipkow@13899
|
7502 |
* simp's arithmetic capabilities have been enhanced a bit: it now
|
nipkow@13899
|
7503 |
takes ~= in premises into account (by performing a case split);
|
nipkow@13899
|
7504 |
|
nipkow@13899
|
7505 |
* simp reduces "m*(n div m) + n mod m" to n, even if the two summands
|
nipkow@13899
|
7506 |
are distributed over a sum of terms;
|
nipkow@13899
|
7507 |
|
ballarin@13735
|
7508 |
* New tactic "trans_tac" and method "trans" instantiate
|
ballarin@13735
|
7509 |
Provers/linorder.ML for axclasses "order" and "linorder" (predicates
|
wenzelm@14731
|
7510 |
"<=", "<" and "=").
|
wenzelm@14731
|
7511 |
|
wenzelm@14731
|
7512 |
* function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
|
paulson@13587
|
7513 |
HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
|
paulson@13587
|
7514 |
|
wenzelm@13443
|
7515 |
* 'typedef' command has new option "open" to suppress the set
|
wenzelm@13443
|
7516 |
definition;
|
wenzelm@13443
|
7517 |
|
wenzelm@13522
|
7518 |
* functions Min and Max on finite sets have been introduced (theory
|
wenzelm@13522
|
7519 |
Finite_Set);
|
nipkow@13492
|
7520 |
|
wenzelm@13443
|
7521 |
* attribute [symmetric] now works for relations as well; it turns
|
wenzelm@13443
|
7522 |
(x,y) : R^-1 into (y,x) : R, and vice versa;
|
wenzelm@13443
|
7523 |
|
nipkow@13613
|
7524 |
* induct over a !!-quantified statement (say !!x1..xn):
|
nipkow@13613
|
7525 |
each "case" automatically performs "fix x1 .. xn" with exactly those names.
|
nipkow@13613
|
7526 |
|
nipkow@13899
|
7527 |
* Map: `empty' is no longer a constant but a syntactic abbreviation for
|
nipkow@13899
|
7528 |
%x. None. Warning: empty_def now refers to the previously hidden definition
|
nipkow@13899
|
7529 |
of the empty set.
|
nipkow@13899
|
7530 |
|
ballarin@14018
|
7531 |
* Algebra: formalization of classical algebra. Intended as base for
|
ballarin@14018
|
7532 |
any algebraic development in Isabelle. Currently covers group theory
|
ballarin@14018
|
7533 |
(up to Sylow's theorem) and ring theory (Universal Property of
|
ballarin@14018
|
7534 |
Univariate Polynomials). Contributions welcome;
|
paulson@13960
|
7535 |
|
paulson@13960
|
7536 |
* GroupTheory: deleted, since its material has been moved to Algebra;
|
paulson@13960
|
7537 |
|
wenzelm@14731
|
7538 |
* Complex: new directory of the complex numbers with numeric constants,
|
wenzelm@14731
|
7539 |
nonstandard complex numbers, and some complex analysis, standard and
|
paulson@13966
|
7540 |
nonstandard (Jacques Fleuriot);
|
paulson@13966
|
7541 |
|
paulson@13966
|
7542 |
* HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
|
paulson@13966
|
7543 |
|
wenzelm@14731
|
7544 |
* Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
|
paulson@13966
|
7545 |
Fleuriot);
|
paulson@13960
|
7546 |
|
wenzelm@13549
|
7547 |
* Real/HahnBanach: updated and adapted to locales;
|
wenzelm@13549
|
7548 |
|
ballarin@13995
|
7549 |
* NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
|
ballarin@13995
|
7550 |
Gray and Kramer);
|
paulson@13872
|
7551 |
|
paulson@13872
|
7552 |
* UNITY: added the Meier-Sanders theory of progress sets;
|
paulson@13872
|
7553 |
|
kleing@14011
|
7554 |
* MicroJava: bytecode verifier and lightweight bytecode verifier
|
kleing@14011
|
7555 |
as abstract algorithms, instantiated to the JVM;
|
kleing@14011
|
7556 |
|
schirmer@14010
|
7557 |
* Bali: Java source language formalization. Type system, operational
|
schirmer@14010
|
7558 |
semantics, axiomatic semantics. Supported language features:
|
schirmer@14010
|
7559 |
classes, interfaces, objects,virtual methods, static methods,
|
schirmer@14010
|
7560 |
static/instance fields, arrays, access modifiers, definite
|
schirmer@14010
|
7561 |
assignment, exceptions.
|
wenzelm@13549
|
7562 |
|
kleing@14011
|
7563 |
|
wenzelm@13549
|
7564 |
*** ZF ***
|
wenzelm@13549
|
7565 |
|
webertj@15154
|
7566 |
* ZF/Constructible: consistency proof for AC (Gdel's constructible
|
wenzelm@13549
|
7567 |
universe, etc.);
|
wenzelm@13549
|
7568 |
|
paulson@13872
|
7569 |
* Main ZF: virtually all theories converted to new-style format;
|
nipkow@13518
|
7570 |
|
wenzelm@13280
|
7571 |
|
wenzelm@13478
|
7572 |
*** ML ***
|
wenzelm@13478
|
7573 |
|
wenzelm@13478
|
7574 |
* Pure: Tactic.prove provides sane interface for internal proofs;
|
wenzelm@13478
|
7575 |
omits the infamous "standard" operation, so this is more appropriate
|
wenzelm@13478
|
7576 |
than prove_goalw_cterm in many situations (e.g. in simprocs);
|
wenzelm@13478
|
7577 |
|
wenzelm@13478
|
7578 |
* Pure: improved error reporting of simprocs;
|
wenzelm@13478
|
7579 |
|
wenzelm@13478
|
7580 |
* Provers: Simplifier.simproc(_i) provides sane interface for setting
|
wenzelm@13478
|
7581 |
up simprocs;
|
wenzelm@13478
|
7582 |
|
wenzelm@13478
|
7583 |
|
kleing@13953
|
7584 |
*** Document preparation ***
|
kleing@13953
|
7585 |
|
kleing@13953
|
7586 |
* uses \par instead of \\ for line breaks in theory text. This may
|
kleing@13953
|
7587 |
shift some page breaks in large documents. To get the old behaviour
|
kleing@13953
|
7588 |
use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
|
kleing@13953
|
7589 |
|
wenzelm@14731
|
7590 |
* minimized dependencies of isabelle.sty and isabellesym.sty on
|
kleing@13953
|
7591 |
other packages
|
kleing@13953
|
7592 |
|
kleing@13953
|
7593 |
* \<euro> now needs package babel/greek instead of marvosym (which
|
kleing@13953
|
7594 |
broke \Rightarrow)
|
kleing@13953
|
7595 |
|
wenzelm@14731
|
7596 |
* normal size for \<zero>...\<nine> (uses \mathbf instead of
|
kleing@13954
|
7597 |
textcomp package)
|
kleing@13953
|
7598 |
|
wenzelm@13280
|
7599 |
|
wenzelm@14572
|
7600 |
|
wenzelm@12984
|
7601 |
New in Isabelle2002 (March 2002)
|
wenzelm@12984
|
7602 |
--------------------------------
|
wenzelm@11474
|
7603 |
|
wenzelm@11572
|
7604 |
*** Document preparation ***
|
wenzelm@11572
|
7605 |
|
wenzelm@11842
|
7606 |
* greatly simplified document preparation setup, including more
|
wenzelm@11842
|
7607 |
graceful interpretation of isatool usedir -i/-d/-D options, and more
|
wenzelm@11842
|
7608 |
instructive isatool mkdir; users should basically be able to get
|
wenzelm@12899
|
7609 |
started with "isatool mkdir HOL Test && isatool make"; alternatively,
|
wenzelm@12899
|
7610 |
users may run a separate document processing stage manually like this:
|
wenzelm@12899
|
7611 |
"isatool usedir -D output HOL Test && isatool document Test/output";
|
wenzelm@11842
|
7612 |
|
wenzelm@11842
|
7613 |
* theory dependency graph may now be incorporated into documents;
|
wenzelm@11842
|
7614 |
isatool usedir -g true will produce session_graph.eps/.pdf for use
|
wenzelm@11842
|
7615 |
with \includegraphics of LaTeX;
|
wenzelm@11842
|
7616 |
|
wenzelm@11864
|
7617 |
* proper spacing of consecutive markup elements, especially text
|
wenzelm@11864
|
7618 |
blocks after section headings;
|
wenzelm@11864
|
7619 |
|
wenzelm@11572
|
7620 |
* support bold style (for single symbols only), input syntax is like
|
wenzelm@11572
|
7621 |
this: "\<^bold>\<alpha>" or "\<^bold>A";
|
wenzelm@11572
|
7622 |
|
wenzelm@11814
|
7623 |
* \<bullet> is now output as bold \cdot by default, which looks much
|
wenzelm@11572
|
7624 |
better in printed text;
|
wenzelm@11572
|
7625 |
|
wenzelm@11712
|
7626 |
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
|
wenzelm@11712
|
7627 |
note that these symbols are currently unavailable in Proof General /
|
wenzelm@12769
|
7628 |
X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
|
wenzelm@12690
|
7629 |
|
wenzelm@12690
|
7630 |
* isatool latex no longer depends on changed TEXINPUTS, instead
|
wenzelm@12690
|
7631 |
isatool document copies the Isabelle style files to the target
|
wenzelm@12690
|
7632 |
location;
|
wenzelm@11712
|
7633 |
|
wenzelm@11572
|
7634 |
|
wenzelm@11633
|
7635 |
*** Isar ***
|
wenzelm@11633
|
7636 |
|
wenzelm@12312
|
7637 |
* Pure/Provers: improved proof by cases and induction;
|
wenzelm@12280
|
7638 |
- 'case' command admits impromptu naming of parameters (such as
|
wenzelm@12280
|
7639 |
"case (Suc n)");
|
wenzelm@12280
|
7640 |
- 'induct' method divinates rule instantiation from the inductive
|
wenzelm@12280
|
7641 |
claim; no longer requires excessive ?P bindings for proper
|
wenzelm@12280
|
7642 |
instantiation of cases;
|
wenzelm@12280
|
7643 |
- 'induct' method properly enumerates all possibilities of set/type
|
wenzelm@12280
|
7644 |
rules; as a consequence facts may be also passed through *type*
|
wenzelm@12280
|
7645 |
rules without further ado;
|
wenzelm@12280
|
7646 |
- 'induct' method now derives symbolic cases from the *rulified*
|
wenzelm@12280
|
7647 |
rule (before it used to rulify cases stemming from the internal
|
wenzelm@12280
|
7648 |
atomized version); this means that the context of a non-atomic
|
wenzelm@12280
|
7649 |
statement becomes is included in the hypothesis, avoiding the
|
wenzelm@12280
|
7650 |
slightly cumbersome show "PROP ?case" form;
|
wenzelm@12280
|
7651 |
- 'induct' may now use elim-style induction rules without chaining
|
wenzelm@12280
|
7652 |
facts, using ``missing'' premises from the goal state; this allows
|
wenzelm@12280
|
7653 |
rules stemming from inductive sets to be applied in unstructured
|
wenzelm@12280
|
7654 |
scripts, while still benefitting from proper handling of non-atomic
|
wenzelm@12280
|
7655 |
statements; NB: major inductive premises need to be put first, all
|
wenzelm@12280
|
7656 |
the rest of the goal is passed through the induction;
|
wenzelm@12280
|
7657 |
- 'induct' proper support for mutual induction involving non-atomic
|
wenzelm@12280
|
7658 |
rule statements (uses the new concept of simultaneous goals, see
|
wenzelm@12280
|
7659 |
below);
|
wenzelm@12853
|
7660 |
- append all possible rule selections, but only use the first
|
wenzelm@12853
|
7661 |
success (no backtracking);
|
wenzelm@11995
|
7662 |
- removed obsolete "(simplified)" and "(stripped)" options of methods;
|
wenzelm@12754
|
7663 |
- undeclared rule case names default to numbers 1, 2, 3, ...;
|
wenzelm@12754
|
7664 |
- added 'print_induct_rules' (covered by help item in recent Proof
|
wenzelm@12754
|
7665 |
General versions);
|
wenzelm@11995
|
7666 |
- moved induct/cases attributes to Pure, methods to Provers;
|
wenzelm@11995
|
7667 |
- generic method setup instantiated for FOL and HOL;
|
wenzelm@11986
|
7668 |
|
wenzelm@12163
|
7669 |
* Pure: support multiple simultaneous goal statements, for example
|
wenzelm@12163
|
7670 |
"have a: A and b: B" (same for 'theorem' etc.); being a pure
|
wenzelm@12163
|
7671 |
meta-level mechanism, this acts as if several individual goals had
|
wenzelm@12163
|
7672 |
been stated separately; in particular common proof methods need to be
|
wenzelm@12163
|
7673 |
repeated in order to cover all claims; note that a single elimination
|
wenzelm@12163
|
7674 |
step is *not* sufficient to establish the two conjunctions, so this
|
wenzelm@12163
|
7675 |
fails:
|
wenzelm@12163
|
7676 |
|
wenzelm@12163
|
7677 |
assume "A & B" then have A and B .. (*".." fails*)
|
wenzelm@12163
|
7678 |
|
wenzelm@12163
|
7679 |
better use "obtain" in situations as above; alternative refer to
|
wenzelm@12163
|
7680 |
multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
|
wenzelm@12163
|
7681 |
|
wenzelm@12078
|
7682 |
* Pure: proper integration with ``locales''; unlike the original
|
webertj@15154
|
7683 |
version by Florian Kammller, Isar locales package high-level proof
|
wenzelm@12078
|
7684 |
contexts rather than raw logical ones (e.g. we admit to include
|
wenzelm@12280
|
7685 |
attributes everywhere); operations on locales include merge and
|
wenzelm@12964
|
7686 |
rename; support for implicit arguments (``structures''); simultaneous
|
wenzelm@12964
|
7687 |
type-inference over imports and text; see also HOL/ex/Locales.thy for
|
wenzelm@12964
|
7688 |
some examples;
|
wenzelm@12078
|
7689 |
|
wenzelm@12707
|
7690 |
* Pure: the following commands have been ``localized'', supporting a
|
wenzelm@12707
|
7691 |
target locale specification "(in name)": 'lemma', 'theorem',
|
wenzelm@12707
|
7692 |
'corollary', 'lemmas', 'theorems', 'declare'; the results will be
|
wenzelm@12707
|
7693 |
stored both within the locale and at the theory level (exported and
|
wenzelm@12707
|
7694 |
qualified by the locale name);
|
wenzelm@12707
|
7695 |
|
wenzelm@12964
|
7696 |
* Pure: theory goals may now be specified in ``long'' form, with
|
wenzelm@12964
|
7697 |
ad-hoc contexts consisting of arbitrary locale elements. for example
|
wenzelm@12964
|
7698 |
``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
|
wenzelm@12964
|
7699 |
definitions may be given, too); the result is a meta-level rule with
|
wenzelm@12964
|
7700 |
the context elements being discharged in the obvious way;
|
wenzelm@12964
|
7701 |
|
wenzelm@12964
|
7702 |
* Pure: new proof command 'using' allows to augment currently used
|
wenzelm@12964
|
7703 |
facts after a goal statement ('using' is syntactically analogous to
|
wenzelm@12964
|
7704 |
'apply', but acts on the goal's facts only); this allows chained facts
|
wenzelm@12964
|
7705 |
to be separated into parts given before and after a claim, as in
|
wenzelm@12964
|
7706 |
``from a and b have C using d and e <proof>'';
|
wenzelm@12078
|
7707 |
|
wenzelm@11722
|
7708 |
* Pure: renamed "antecedent" case to "rule_context";
|
wenzelm@11722
|
7709 |
|
wenzelm@12964
|
7710 |
* Pure: new 'judgment' command records explicit information about the
|
wenzelm@12964
|
7711 |
object-logic embedding (used by several tools internally); no longer
|
wenzelm@12964
|
7712 |
use hard-wired "Trueprop";
|
wenzelm@12964
|
7713 |
|
wenzelm@11738
|
7714 |
* Pure: added 'corollary' command;
|
wenzelm@11738
|
7715 |
|
wenzelm@11722
|
7716 |
* Pure: fixed 'token_translation' command;
|
wenzelm@11722
|
7717 |
|
wenzelm@11899
|
7718 |
* Pure: removed obsolete 'exported' attribute;
|
wenzelm@11899
|
7719 |
|
wenzelm@11933
|
7720 |
* Pure: dummy pattern "_" in is/let is now automatically lifted over
|
wenzelm@11933
|
7721 |
bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
|
wenzelm@11899
|
7722 |
supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
|
wenzelm@11899
|
7723 |
|
wenzelm@11952
|
7724 |
* Pure: method 'atomize' presents local goal premises as object-level
|
wenzelm@11952
|
7725 |
statements (atomic meta-level propositions); setup controlled via
|
wenzelm@11952
|
7726 |
rewrite rules declarations of 'atomize' attribute; example
|
wenzelm@11952
|
7727 |
application: 'induct' method with proper rule statements in improper
|
wenzelm@11952
|
7728 |
proof *scripts*;
|
wenzelm@11952
|
7729 |
|
wenzelm@12106
|
7730 |
* Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
|
wenzelm@12106
|
7731 |
now consider the syntactic context of assumptions, giving a better
|
wenzelm@12106
|
7732 |
chance to get type-inference of the arguments right (this is
|
wenzelm@12106
|
7733 |
especially important for locales);
|
wenzelm@12106
|
7734 |
|
wenzelm@12312
|
7735 |
* Pure: "sorry" no longer requires quick_and_dirty in interactive
|
wenzelm@12312
|
7736 |
mode;
|
wenzelm@12312
|
7737 |
|
wenzelm@12405
|
7738 |
* Pure/obtain: the formal conclusion "thesis", being marked as
|
wenzelm@12405
|
7739 |
``internal'', may no longer be reference directly in the text;
|
wenzelm@12405
|
7740 |
potential INCOMPATIBILITY, may need to use "?thesis" in rare
|
wenzelm@12405
|
7741 |
situations;
|
wenzelm@12405
|
7742 |
|
wenzelm@12405
|
7743 |
* Pure: generic 'sym' attribute which declares a rule both as pure
|
wenzelm@12405
|
7744 |
'elim?' and for the 'symmetric' operation;
|
wenzelm@12405
|
7745 |
|
wenzelm@12877
|
7746 |
* Pure: marginal comments ``--'' may now occur just anywhere in the
|
wenzelm@12877
|
7747 |
text; the fixed correlation with particular command syntax has been
|
wenzelm@12877
|
7748 |
discontinued;
|
wenzelm@12877
|
7749 |
|
berghofe@13023
|
7750 |
* Pure: new method 'rules' is particularly well-suited for proof
|
berghofe@13023
|
7751 |
search in intuitionistic logic; a bit slower than 'blast' or 'fast',
|
berghofe@13023
|
7752 |
but often produces more compact proof terms with less detours;
|
berghofe@13023
|
7753 |
|
wenzelm@12364
|
7754 |
* Pure/Provers/classical: simplified integration with pure rule
|
wenzelm@12364
|
7755 |
attributes and methods; the classical "intro?/elim?/dest?"
|
wenzelm@12364
|
7756 |
declarations coincide with the pure ones; the "rule" method no longer
|
wenzelm@12364
|
7757 |
includes classically swapped intros; "intro" and "elim" methods no
|
wenzelm@12364
|
7758 |
longer pick rules from the context; also got rid of ML declarations
|
wenzelm@12364
|
7759 |
AddXIs/AddXEs/AddXDs; all of this has some potential for
|
wenzelm@12364
|
7760 |
INCOMPATIBILITY;
|
wenzelm@12364
|
7761 |
|
wenzelm@12405
|
7762 |
* Provers/classical: attribute 'swapped' produces classical inversions
|
wenzelm@12405
|
7763 |
of introduction rules;
|
wenzelm@12405
|
7764 |
|
wenzelm@12364
|
7765 |
* Provers/simplifier: 'simplified' attribute may refer to explicit
|
wenzelm@12364
|
7766 |
rules instead of full simplifier context; 'iff' attribute handles
|
wenzelm@12364
|
7767 |
conditional rules;
|
wenzelm@11936
|
7768 |
|
wenzelm@11745
|
7769 |
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
|
wenzelm@11745
|
7770 |
|
wenzelm@11690
|
7771 |
* HOL: 'recdef' now fails on unfinished automated proofs, use
|
wenzelm@11633
|
7772 |
"(permissive)" option to recover old behavior;
|
wenzelm@11633
|
7773 |
|
wenzelm@11933
|
7774 |
* HOL: 'inductive' no longer features separate (collective) attributes
|
wenzelm@11933
|
7775 |
for 'intros' (was found too confusing);
|
wenzelm@11933
|
7776 |
|
wenzelm@12405
|
7777 |
* HOL: properly declared induction rules less_induct and
|
wenzelm@12405
|
7778 |
wf_induct_rule;
|
wenzelm@12405
|
7779 |
|
kleing@11788
|
7780 |
|
wenzelm@11474
|
7781 |
*** HOL ***
|
wenzelm@11474
|
7782 |
|
wenzelm@11702
|
7783 |
* HOL: moved over to sane numeral syntax; the new policy is as
|
wenzelm@11702
|
7784 |
follows:
|
wenzelm@11702
|
7785 |
|
wenzelm@11702
|
7786 |
- 0 and 1 are polymorphic constants, which are defined on any
|
wenzelm@11702
|
7787 |
numeric type (nat, int, real etc.);
|
wenzelm@11702
|
7788 |
|
wenzelm@11702
|
7789 |
- 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
|
wenzelm@11702
|
7790 |
binary representation internally;
|
wenzelm@11702
|
7791 |
|
wenzelm@11702
|
7792 |
- type nat has special constructor Suc, and generally prefers Suc 0
|
wenzelm@11702
|
7793 |
over 1::nat and Suc (Suc 0) over 2::nat;
|
wenzelm@11702
|
7794 |
|
wenzelm@12364
|
7795 |
This change may cause significant problems of INCOMPATIBILITY; here
|
wenzelm@12364
|
7796 |
are some hints on converting existing sources:
|
wenzelm@11702
|
7797 |
|
wenzelm@11702
|
7798 |
- due to the new "num" token, "-0" and "-1" etc. are now atomic
|
wenzelm@11702
|
7799 |
entities, so expressions involving "-" (unary or binary minus) need
|
wenzelm@11702
|
7800 |
to be spaced properly;
|
wenzelm@11702
|
7801 |
|
wenzelm@11702
|
7802 |
- existing occurrences of "1" may need to be constraint "1::nat" or
|
wenzelm@11702
|
7803 |
even replaced by Suc 0; similar for old "2";
|
wenzelm@11702
|
7804 |
|
wenzelm@11702
|
7805 |
- replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
|
wenzelm@11702
|
7806 |
|
wenzelm@11702
|
7807 |
- remove all special provisions on numerals in proofs;
|
wenzelm@11702
|
7808 |
|
wenzelm@13042
|
7809 |
* HOL: simp rules nat_number expand numerals on nat to Suc/0
|
wenzelm@12837
|
7810 |
representation (depends on bin_arith_simps in the default context);
|
wenzelm@12837
|
7811 |
|
wenzelm@12736
|
7812 |
* HOL: symbolic syntax for x^2 (numeral 2);
|
wenzelm@12736
|
7813 |
|
wenzelm@12335
|
7814 |
* HOL: the class of all HOL types is now called "type" rather than
|
wenzelm@12335
|
7815 |
"term"; INCOMPATIBILITY, need to adapt references to this type class
|
wenzelm@12335
|
7816 |
in axclass/classes, instance/arities, and (usually rare) occurrences
|
wenzelm@12335
|
7817 |
in typings (of consts etc.); internally the class is called
|
wenzelm@12335
|
7818 |
"HOL.type", ML programs should refer to HOLogic.typeS;
|
wenzelm@12335
|
7819 |
|
wenzelm@12280
|
7820 |
* HOL/record package improvements:
|
wenzelm@12280
|
7821 |
- new derived operations "fields" to build a partial record section,
|
wenzelm@12280
|
7822 |
"extend" to promote a fixed record to a record scheme, and
|
wenzelm@12280
|
7823 |
"truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
|
wenzelm@12280
|
7824 |
declared as simp by default;
|
wenzelm@12587
|
7825 |
- shared operations ("more", "fields", etc.) now need to be always
|
wenzelm@12587
|
7826 |
qualified) --- potential INCOMPATIBILITY;
|
wenzelm@12280
|
7827 |
- removed "make_scheme" operations (use "make" with "extend") --
|
wenzelm@12280
|
7828 |
INCOMPATIBILITY;
|
wenzelm@11937
|
7829 |
- removed "more" class (simply use "term") -- INCOMPATIBILITY;
|
wenzelm@12253
|
7830 |
- provides cases/induct rules for use with corresponding Isar
|
wenzelm@12253
|
7831 |
methods (for concrete records, record schemes, concrete more
|
wenzelm@12280
|
7832 |
parts, and schematic more parts -- in that order);
|
wenzelm@11930
|
7833 |
- internal definitions directly based on a light-weight abstract
|
wenzelm@11930
|
7834 |
theory of product types over typedef rather than datatype;
|
wenzelm@11930
|
7835 |
|
berghofe@13023
|
7836 |
* HOL: generic code generator for generating executable ML code from
|
berghofe@13023
|
7837 |
specifications; specific support for HOL constructs such as inductive
|
berghofe@13023
|
7838 |
datatypes and sets, as well as recursive functions; can be invoked
|
berghofe@13023
|
7839 |
via 'generate_code' theory section;
|
berghofe@13023
|
7840 |
|
wenzelm@11933
|
7841 |
* HOL: canonical cases/induct rules for n-tuples (n = 3..7);
|
wenzelm@11933
|
7842 |
|
paulson@13824
|
7843 |
* HOL: consolidated and renamed several theories. In particular:
|
wenzelm@14731
|
7844 |
Ord.thy has been absorbed into HOL.thy
|
wenzelm@14731
|
7845 |
String.thy has been absorbed into List.thy
|
wenzelm@14731
|
7846 |
|
wenzelm@11802
|
7847 |
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
|
wenzelm@11802
|
7848 |
(beware of argument permutation!);
|
wenzelm@11802
|
7849 |
|
wenzelm@11657
|
7850 |
* HOL: linorder_less_split superseded by linorder_cases;
|
wenzelm@11657
|
7851 |
|
wenzelm@12917
|
7852 |
* HOL/List: "nodups" renamed to "distinct";
|
nipkow@12889
|
7853 |
|
wenzelm@11633
|
7854 |
* HOL: added "The" definite description operator; move Hilbert's "Eps"
|
paulson@13824
|
7855 |
to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
|
paulson@13824
|
7856 |
- Ex_def has changed, now need to use some_eq_ex
|
wenzelm@11437
|
7857 |
|
wenzelm@11572
|
7858 |
* HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
|
wenzelm@11572
|
7859 |
in this (rare) case use:
|
wenzelm@11572
|
7860 |
|
wenzelm@11572
|
7861 |
delSWrapper "split_all_tac"
|
wenzelm@11572
|
7862 |
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
|
wenzelm@11572
|
7863 |
|
wenzelm@11572
|
7864 |
* HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
|
wenzelm@11474
|
7865 |
MAY FAIL;
|
nipkow@11361
|
7866 |
|
wenzelm@11572
|
7867 |
* HOL: introduced f^n = f o ... o f; warning: due to the limits of
|
wenzelm@11572
|
7868 |
Isabelle's type classes, ^ on functions and relations has too general
|
wenzelm@11572
|
7869 |
a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
|
wenzelm@11572
|
7870 |
necessary to attach explicit type constraints;
|
nipkow@11307
|
7871 |
|
wenzelm@12917
|
7872 |
* HOL/Relation: the prefix name of the infix "O" has been changed from
|
wenzelm@12917
|
7873 |
"comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
|
wenzelm@12917
|
7874 |
renamed accordingly (eg "compI" -> "rel_compI").
|
nipkow@12489
|
7875 |
|
wenzelm@11487
|
7876 |
* HOL: syntax translations now work properly with numerals and records
|
wenzelm@11487
|
7877 |
expressions;
|
wenzelm@11474
|
7878 |
|
wenzelm@12457
|
7879 |
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
|
wenzelm@12457
|
7880 |
of "lam" -- INCOMPATIBILITY;
|
wenzelm@11474
|
7881 |
|
wenzelm@11933
|
7882 |
* HOL: got rid of some global declarations (potential INCOMPATIBILITY
|
wenzelm@11933
|
7883 |
for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
|
wenzelm@11933
|
7884 |
renamed "Product_Type.unit";
|
wenzelm@11611
|
7885 |
|
nipkow@12564
|
7886 |
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
|
nipkow@12564
|
7887 |
|
wenzelm@12924
|
7888 |
* HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
|
wenzelm@12924
|
7889 |
the "cases" method);
|
wenzelm@12924
|
7890 |
|
wenzelm@12597
|
7891 |
* HOL/GroupTheory: group theory examples including Sylow's theorem (by
|
webertj@15154
|
7892 |
Florian Kammller);
|
wenzelm@12597
|
7893 |
|
wenzelm@12608
|
7894 |
* HOL/IMP: updated and converted to new-style theory format; several
|
wenzelm@12608
|
7895 |
parts turned into readable document, with proper Isar proof texts and
|
wenzelm@12608
|
7896 |
some explanations (by Gerwin Klein);
|
wenzelm@12597
|
7897 |
|
wenzelm@12734
|
7898 |
* HOL-Real: added Complex_Numbers (by Gertrud Bauer);
|
wenzelm@12734
|
7899 |
|
wenzelm@12690
|
7900 |
* HOL-Hyperreal is now a logic image;
|
wenzelm@12690
|
7901 |
|
wenzelm@11611
|
7902 |
|
wenzelm@12022
|
7903 |
*** HOLCF ***
|
wenzelm@12022
|
7904 |
|
wenzelm@12622
|
7905 |
* Isar: consts/constdefs supports mixfix syntax for continuous
|
wenzelm@12622
|
7906 |
operations;
|
wenzelm@12622
|
7907 |
|
wenzelm@12622
|
7908 |
* Isar: domain package adapted to new-style theory format, e.g. see
|
wenzelm@12622
|
7909 |
HOLCF/ex/Dnat.thy;
|
wenzelm@12622
|
7910 |
|
wenzelm@12622
|
7911 |
* theory Lift: proper use of rep_datatype lift instead of ML hacks --
|
wenzelm@12280
|
7912 |
potential INCOMPATIBILITY; now use plain induct_tac instead of former
|
wenzelm@12280
|
7913 |
lift.induct_tac, always use UU instead of Undef;
|
wenzelm@12022
|
7914 |
|
wenzelm@12597
|
7915 |
* HOLCF/IMP: updated and converted to new-style theory;
|
wenzelm@12597
|
7916 |
|
wenzelm@12022
|
7917 |
|
wenzelm@11474
|
7918 |
*** ZF ***
|
wenzelm@11474
|
7919 |
|
wenzelm@12622
|
7920 |
* Isar: proper integration of logic-specific tools and packages,
|
wenzelm@12622
|
7921 |
including theory commands '(co)inductive', '(co)datatype',
|
wenzelm@12622
|
7922 |
'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
|
wenzelm@12622
|
7923 |
'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
|
wenzelm@12622
|
7924 |
|
wenzelm@12622
|
7925 |
* theory Main no longer includes AC; for the Axiom of Choice, base
|
wenzelm@12622
|
7926 |
your theory on Main_ZFC;
|
wenzelm@12622
|
7927 |
|
wenzelm@12622
|
7928 |
* the integer library now covers quotients and remainders, with many
|
wenzelm@12622
|
7929 |
laws relating division to addition, multiplication, etc.;
|
paulson@12563
|
7930 |
|
wenzelm@12280
|
7931 |
* ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
|
wenzelm@12280
|
7932 |
typeless version of the formalism;
|
wenzelm@12280
|
7933 |
|
wenzelm@13025
|
7934 |
* ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
|
wenzelm@13025
|
7935 |
format;
|
wenzelm@12608
|
7936 |
|
wenzelm@12280
|
7937 |
* ZF/Induct: new directory for examples of inductive definitions,
|
wenzelm@12608
|
7938 |
including theory Multiset for multiset orderings; converted to
|
wenzelm@12608
|
7939 |
new-style theory format;
|
wenzelm@12177
|
7940 |
|
wenzelm@13025
|
7941 |
* ZF: many new theorems about lists, ordinals, etc.;
|
paulson@12850
|
7942 |
|
wenzelm@11474
|
7943 |
|
wenzelm@11474
|
7944 |
*** General ***
|
wenzelm@11474
|
7945 |
|
wenzelm@12280
|
7946 |
* Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
|
wenzelm@12280
|
7947 |
variable proof controls level of detail: 0 = no proofs (only oracle
|
wenzelm@12280
|
7948 |
dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
|
wenzelm@12280
|
7949 |
also ref manual for further ML interfaces;
|
wenzelm@12280
|
7950 |
|
wenzelm@12280
|
7951 |
* Pure/axclass: removed obsolete ML interface
|
wenzelm@12280
|
7952 |
goal_subclass/goal_arity;
|
wenzelm@12280
|
7953 |
|
wenzelm@12280
|
7954 |
* Pure/syntax: new token syntax "num" for plain numerals (without "#"
|
wenzelm@12280
|
7955 |
of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
|
wenzelm@12280
|
7956 |
separate tokens, so expressions involving minus need to be spaced
|
wenzelm@12280
|
7957 |
properly;
|
wenzelm@12280
|
7958 |
|
wenzelm@12312
|
7959 |
* Pure/syntax: support non-oriented infixes, using keyword "infix"
|
wenzelm@12312
|
7960 |
rather than "infixl" or "infixr";
|
wenzelm@12312
|
7961 |
|
wenzelm@12312
|
7962 |
* Pure/syntax: concrete syntax for dummy type variables admits genuine
|
wenzelm@12312
|
7963 |
sort constraint specifications in type inference; e.g. "x::_::foo"
|
wenzelm@12312
|
7964 |
ensures that the type of "x" is of sort "foo" (but not necessarily a
|
wenzelm@12312
|
7965 |
type variable);
|
wenzelm@12280
|
7966 |
|
wenzelm@12280
|
7967 |
* Pure/syntax: print modes "type_brackets" and "no_type_brackets"
|
wenzelm@12280
|
7968 |
control output of nested => (types); the default behavior is
|
wenzelm@12280
|
7969 |
"type_brackets";
|
wenzelm@12280
|
7970 |
|
wenzelm@12280
|
7971 |
* Pure/syntax: builtin parse translation for "_constify" turns valued
|
wenzelm@11817
|
7972 |
tokens into AST constants;
|
wenzelm@11474
|
7973 |
|
wenzelm@12280
|
7974 |
* Pure/syntax: prefer later declarations of translations and print
|
wenzelm@12280
|
7975 |
translation functions; potential INCOMPATIBILITY: need to reverse
|
wenzelm@12280
|
7976 |
multiple declarations for same syntax element constant;
|
wenzelm@12280
|
7977 |
|
wenzelm@12832
|
7978 |
* Pure/show_hyps reset by default (in accordance to existing Isar
|
wenzelm@12832
|
7979 |
practice);
|
wenzelm@12832
|
7980 |
|
wenzelm@12280
|
7981 |
* Provers/classical: renamed addaltern to addafter, addSaltern to
|
wenzelm@12280
|
7982 |
addSafter;
|
wenzelm@12280
|
7983 |
|
wenzelm@12280
|
7984 |
* Provers/clasimp: ``iff'' declarations now handle conditional rules
|
wenzelm@12280
|
7985 |
as well;
|
wenzelm@12253
|
7986 |
|
wenzelm@12538
|
7987 |
* system: tested support for MacOS X; should be able to get Isabelle +
|
wenzelm@12538
|
7988 |
Proof General to work in a plain Terminal after installing Poly/ML
|
wenzelm@12538
|
7989 |
(e.g. from the Isabelle distribution area) and GNU bash alone
|
wenzelm@12538
|
7990 |
(e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
|
wenzelm@12538
|
7991 |
support requires further installations, e.g. from
|
wenzelm@12538
|
7992 |
http://fink.sourceforge.net/);
|
wenzelm@12538
|
7993 |
|
wenzelm@12280
|
7994 |
* system: support Poly/ML 4.1.1 (able to manage larger heaps);
|
wenzelm@11551
|
7995 |
|
wenzelm@12753
|
7996 |
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
|
wenzelm@12753
|
7997 |
of 40 MB), cf. ML_OPTIONS;
|
wenzelm@12753
|
7998 |
|
wenzelm@11633
|
7999 |
* system: Proof General keywords specification is now part of the
|
wenzelm@11633
|
8000 |
Isabelle distribution (see etc/isar-keywords.el);
|
wenzelm@11633
|
8001 |
|
wenzelm@12728
|
8002 |
* system: support for persistent Proof General sessions (refrain from
|
wenzelm@12728
|
8003 |
outdating all loaded theories on startup); user may create writable
|
wenzelm@12728
|
8004 |
logic images like this: ``isabelle -q HOL Test'';
|
wenzelm@12597
|
8005 |
|
wenzelm@11551
|
8006 |
* system: smart selection of Isabelle process versus Isabelle
|
wenzelm@11572
|
8007 |
interface, accommodates case-insensitive file systems (e.g. HFS+); may
|
wenzelm@11572
|
8008 |
run both "isabelle" and "Isabelle" even if file names are badly
|
wenzelm@11572
|
8009 |
damaged (executable inspects the case of the first letter of its own
|
wenzelm@11572
|
8010 |
name); added separate "isabelle-process" and "isabelle-interface";
|
wenzelm@11551
|
8011 |
|
wenzelm@12472
|
8012 |
* system: refrain from any attempt at filtering input streams; no
|
wenzelm@12472
|
8013 |
longer support ``8bit'' encoding of old isabelle font, instead proper
|
wenzelm@12472
|
8014 |
iso-latin characters may now be used; the related isatools
|
wenzelm@12472
|
8015 |
"symbolinput" and "nonascii" have disappeared as well;
|
wenzelm@12472
|
8016 |
|
wenzelm@12472
|
8017 |
* system: removed old "xterm" interface (the print modes "xterm" and
|
wenzelm@12472
|
8018 |
"xterm_color" are still available for direct use in a suitable
|
wenzelm@12472
|
8019 |
terminal);
|
wenzelm@12472
|
8020 |
|
paulson@11314
|
8021 |
|
oheimb@11169
|
8022 |
|
wenzelm@11062
|
8023 |
New in Isabelle99-2 (February 2001)
|
wenzelm@11062
|
8024 |
-----------------------------------
|
wenzelm@11062
|
8025 |
|
nipkow@10224
|
8026 |
*** Overview of INCOMPATIBILITIES ***
|
nipkow@10224
|
8027 |
|
paulson@11241
|
8028 |
* HOL: please note that theories in the Library and elsewhere often use the
|
paulson@11241
|
8029 |
new-style (Isar) format; to refer to their theorems in an ML script you must
|
wenzelm@12622
|
8030 |
bind them to ML identifers by e.g. val thm_name = thm "thm_name";
|
paulson@11241
|
8031 |
|
wenzelm@11043
|
8032 |
* HOL: inductive package no longer splits induction rule aggressively,
|
wenzelm@11043
|
8033 |
but only as far as specified by the introductions given; the old
|
oheimb@11130
|
8034 |
format may be recovered via ML function complete_split_rule or attribute
|
wenzelm@11043
|
8035 |
'split_rule (complete)';
|
wenzelm@11043
|
8036 |
|
wenzelm@10998
|
8037 |
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
|
wenzelm@10998
|
8038 |
gfp_Tarski to gfp_unfold;
|
nipkow@10224
|
8039 |
|
paulson@10288
|
8040 |
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
|
paulson@10288
|
8041 |
|
wenzelm@10858
|
8042 |
* HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
|
wenzelm@10858
|
8043 |
relation); infix "^^" has been renamed "``"; infix "``" has been
|
wenzelm@10858
|
8044 |
renamed "`"; "univalent" has been renamed "single_valued";
|
nipkow@10793
|
8045 |
|
wenzelm@10998
|
8046 |
* HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
|
wenzelm@10998
|
8047 |
operation;
|
wenzelm@10998
|
8048 |
|
nipkow@10868
|
8049 |
* HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
|
nipkow@10856
|
8050 |
|
wenzelm@10391
|
8051 |
* Isar: 'obtain' no longer declares "that" fact as simp/intro;
|
wenzelm@10391
|
8052 |
|
wenzelm@10401
|
8053 |
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
|
wenzelm@10401
|
8054 |
consequence, it is no longer monotonic wrt. the local goal context
|
wenzelm@10401
|
8055 |
(which is now passed through the inductive cases);
|
wenzelm@10401
|
8056 |
|
wenzelm@10976
|
8057 |
* Document preparation: renamed standard symbols \<ll> to \<lless> and
|
wenzelm@10976
|
8058 |
\<gg> to \<ggreater>;
|
wenzelm@10976
|
8059 |
|
nipkow@10224
|
8060 |
|
wenzelm@10245
|
8061 |
*** Document preparation ***
|
wenzelm@10245
|
8062 |
|
wenzelm@10858
|
8063 |
* \isabellestyle{NAME} selects version of Isabelle output (currently
|
wenzelm@10858
|
8064 |
available: are "it" for near math-mode best-style output, "sl" for
|
wenzelm@10858
|
8065 |
slanted text style, and "tt" for plain type-writer; if no
|
wenzelm@10858
|
8066 |
\isabellestyle command is given, output is according to slanted
|
wenzelm@10858
|
8067 |
type-writer);
|
wenzelm@10858
|
8068 |
|
wenzelm@10322
|
8069 |
* support sub/super scripts (for single symbols only), input syntax is
|
wenzelm@10322
|
8070 |
like this: "A\<^sup>*" or "A\<^sup>\<star>";
|
wenzelm@10322
|
8071 |
|
wenzelm@10858
|
8072 |
* some more standard symbols; see Appendix A of the system manual for
|
wenzelm@11062
|
8073 |
the complete list of symbols defined in isabellesym.sty;
|
wenzelm@10858
|
8074 |
|
wenzelm@10998
|
8075 |
* improved isabelle style files; more abstract symbol implementation
|
wenzelm@10998
|
8076 |
(should now use \isamath{...} and \isatext{...} in custom symbol
|
wenzelm@10998
|
8077 |
definitions);
|
wenzelm@10998
|
8078 |
|
wenzelm@10634
|
8079 |
* antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
|
wenzelm@10634
|
8080 |
state; Note that presentation of goal states does not conform to
|
wenzelm@10634
|
8081 |
actual human-readable proof documents. Please do not include goal
|
wenzelm@10634
|
8082 |
states into document output unless you really know what you are doing!
|
wenzelm@10322
|
8083 |
|
wenzelm@11062
|
8084 |
* proper indentation of antiquoted output with proportional LaTeX
|
wenzelm@11062
|
8085 |
fonts;
|
wenzelm@10862
|
8086 |
|
wenzelm@11050
|
8087 |
* no_document ML operator temporarily disables LaTeX document
|
wenzelm@11050
|
8088 |
generation;
|
wenzelm@11050
|
8089 |
|
wenzelm@11062
|
8090 |
* isatool unsymbolize tunes sources for plain ASCII communication;
|
wenzelm@11062
|
8091 |
|
wenzelm@10322
|
8092 |
|
wenzelm@10306
|
8093 |
*** Isar ***
|
wenzelm@10306
|
8094 |
|
wenzelm@10547
|
8095 |
* Pure: Isar now suffers initial goal statements to contain unbound
|
wenzelm@10547
|
8096 |
schematic variables (this does not conform to actual readable proof
|
wenzelm@10547
|
8097 |
documents, due to unpredictable outcome and non-compositional proof
|
wenzelm@10547
|
8098 |
checking); users who know what they are doing may use schematic goals
|
wenzelm@10547
|
8099 |
for Prolog-style synthesis of proven results;
|
wenzelm@10547
|
8100 |
|
wenzelm@10391
|
8101 |
* Pure: assumption method (an implicit finishing) now handles actual
|
wenzelm@10391
|
8102 |
rules as well;
|
wenzelm@10391
|
8103 |
|
wenzelm@10391
|
8104 |
* Pure: improved 'obtain' --- moved to Pure, insert "that" into
|
wenzelm@10391
|
8105 |
initial goal, declare "that" only as Pure intro (only for single
|
wenzelm@10391
|
8106 |
steps); the "that" rule assumption may now be involved in implicit
|
wenzelm@10391
|
8107 |
finishing, thus ".." becomes a feasible for trivial obtains;
|
wenzelm@10391
|
8108 |
|
wenzelm@10391
|
8109 |
* Pure: default proof step now includes 'intro_classes'; thus trivial
|
wenzelm@10391
|
8110 |
instance proofs may be performed by "..";
|
wenzelm@10391
|
8111 |
|
wenzelm@10391
|
8112 |
* Pure: ?thesis / ?this / "..." now work for pure meta-level
|
wenzelm@10391
|
8113 |
statements as well;
|
wenzelm@10306
|
8114 |
|
wenzelm@11097
|
8115 |
* Pure: more robust selection of calculational rules;
|
wenzelm@11097
|
8116 |
|
wenzelm@10858
|
8117 |
* Pure: the builtin notion of 'finished' goal now includes the ==-refl
|
wenzelm@10858
|
8118 |
rule (as well as the assumption rule);
|
wenzelm@10858
|
8119 |
|
wenzelm@10858
|
8120 |
* Pure: 'thm_deps' command visualizes dependencies of theorems and
|
wenzelm@10858
|
8121 |
lemmas, using the graph browser tool;
|
wenzelm@10858
|
8122 |
|
wenzelm@10944
|
8123 |
* Pure: predict failure of "show" in interactive mode;
|
wenzelm@10944
|
8124 |
|
wenzelm@11016
|
8125 |
* Pure: 'thms_containing' now takes actual terms as arguments;
|
wenzelm@11016
|
8126 |
|
wenzelm@10401
|
8127 |
* HOL: improved method 'induct' --- now handles non-atomic goals
|
wenzelm@10401
|
8128 |
(potential INCOMPATIBILITY); tuned error handling;
|
wenzelm@10401
|
8129 |
|
wenzelm@10557
|
8130 |
* HOL: cases and induct rules now provide explicit hints about the
|
wenzelm@10547
|
8131 |
number of facts to be consumed (0 for "type" and 1 for "set" rules);
|
wenzelm@10547
|
8132 |
any remaining facts are inserted into the goal verbatim;
|
wenzelm@10547
|
8133 |
|
wenzelm@10858
|
8134 |
* HOL: local contexts (aka cases) may now contain term bindings as
|
wenzelm@10858
|
8135 |
well; the 'cases' and 'induct' methods new provide a ?case binding for
|
wenzelm@10858
|
8136 |
the result to be shown in each case;
|
wenzelm@10858
|
8137 |
|
wenzelm@10770
|
8138 |
* HOL: added 'recdef_tc' command;
|
wenzelm@10770
|
8139 |
|
wenzelm@11016
|
8140 |
* isatool convert assists in eliminating legacy ML scripts;
|
wenzelm@11016
|
8141 |
|
wenzelm@10306
|
8142 |
|
wenzelm@10245
|
8143 |
*** HOL ***
|
wenzelm@10245
|
8144 |
|
wenzelm@10245
|
8145 |
* HOL/Library: a collection of generic theories to be used together
|
wenzelm@10245
|
8146 |
with main HOL; the theory loader path already includes this directory
|
wenzelm@10245
|
8147 |
by default; the following existing theories have been moved here:
|
wenzelm@10245
|
8148 |
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
|
wenzelm@10337
|
8149 |
(as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
|
wenzelm@10245
|
8150 |
|
wenzelm@10966
|
8151 |
* HOL/Unix: "Some aspects of Unix file-system security", a typical
|
wenzelm@10966
|
8152 |
modelling and verification task performed in Isabelle/HOL +
|
wenzelm@10966
|
8153 |
Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
|
wenzelm@10966
|
8154 |
|
wenzelm@11094
|
8155 |
* HOL/Algebra: special summation operator SUM no longer exists, it has
|
wenzelm@11094
|
8156 |
been replaced by setsum; infix 'assoc' now has priority 50 (like
|
wenzelm@11094
|
8157 |
'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
|
wenzelm@11094
|
8158 |
'domain', this makes the theory consistent with mathematical
|
wenzelm@11094
|
8159 |
literature;
|
wenzelm@11094
|
8160 |
|
wenzelm@10514
|
8161 |
* HOL basics: added overloaded operations "inverse" and "divide"
|
wenzelm@10726
|
8162 |
(infix "/"), syntax for generic "abs" operation, generic summation
|
wenzelm@11094
|
8163 |
operator \<Sum>;
|
wenzelm@10452
|
8164 |
|
wenzelm@10391
|
8165 |
* HOL/typedef: simplified package, provide more useful rules (see also
|
wenzelm@10391
|
8166 |
HOL/subset.thy);
|
wenzelm@10391
|
8167 |
|
wenzelm@10915
|
8168 |
* HOL/datatype: induction rule for arbitrarily branching datatypes is
|
wenzelm@10915
|
8169 |
now expressed as a proper nested rule (old-style tactic scripts may
|
wenzelm@10915
|
8170 |
require atomize_strip_tac to cope with non-atomic premises);
|
wenzelm@10915
|
8171 |
|
wenzelm@10915
|
8172 |
* HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
|
wenzelm@10915
|
8173 |
to "split_conv" (old name still available for compatibility);
|
wenzelm@10915
|
8174 |
|
wenzelm@10915
|
8175 |
* HOL: improved concrete syntax for strings (e.g. allows translation
|
wenzelm@10915
|
8176 |
rules with string literals);
|
wenzelm@10915
|
8177 |
|
paulson@12245
|
8178 |
* HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
|
paulson@12245
|
8179 |
and Fleuriot's mechanization of analysis, including the transcendental
|
paulson@12245
|
8180 |
functions for the reals;
|
paulson@10756
|
8181 |
|
wenzelm@11094
|
8182 |
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
|
wenzelm@10391
|
8183 |
|
wenzelm@10858
|
8184 |
|
paulson@10474
|
8185 |
*** CTT ***
|
paulson@10474
|
8186 |
|
wenzelm@10547
|
8187 |
* CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
|
wenzelm@10547
|
8188 |
"lam" is displayed as TWO lambda-symbols
|
paulson@10474
|
8189 |
|
wenzelm@10547
|
8190 |
* CTT: theory Main now available, containing everything (that is, Bool
|
wenzelm@10547
|
8191 |
and Arith);
|
wenzelm@10547
|
8192 |
|
paulson@10474
|
8193 |
|
wenzelm@10391
|
8194 |
*** General ***
|
wenzelm@10391
|
8195 |
|
wenzelm@10547
|
8196 |
* Pure: the Simplifier has been implemented properly as a derived rule
|
wenzelm@10547
|
8197 |
outside of the actual kernel (at last!); the overall performance
|
wenzelm@10547
|
8198 |
penalty in practical applications is about 50%, while reliability of
|
wenzelm@10547
|
8199 |
the Isabelle inference kernel has been greatly improved;
|
wenzelm@10547
|
8200 |
|
wenzelm@11112
|
8201 |
* print modes "brackets" and "no_brackets" control output of nested =>
|
wenzelm@11112
|
8202 |
(types) and ==> (props); the default behaviour is "brackets";
|
wenzelm@11112
|
8203 |
|
wenzelm@10391
|
8204 |
* Provers: fast_tac (and friends) now handle actual object-logic rules
|
wenzelm@10391
|
8205 |
as assumptions as well;
|
wenzelm@10391
|
8206 |
|
wenzelm@11124
|
8207 |
* system: support Poly/ML 4.0;
|
wenzelm@11124
|
8208 |
|
wenzelm@11124
|
8209 |
* system: isatool install handles KDE version 1 or 2;
|
wenzelm@11124
|
8210 |
|
wenzelm@10391
|
8211 |
|
wenzelm@10245
|
8212 |
|
wenzelm@10103
|
8213 |
New in Isabelle99-1 (October 2000)
|
wenzelm@10103
|
8214 |
----------------------------------
|
wenzelm@8015
|
8215 |
|
wenzelm@10003
|
8216 |
*** Overview of INCOMPATIBILITIES ***
|
paulson@8014
|
8217 |
|
wenzelm@8848
|
8218 |
* HOL: simplification of natural numbers is much changed; to partly
|
wenzelm@8848
|
8219 |
recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
|
wenzelm@8848
|
8220 |
issue the following ML commands:
|
wenzelm@8848
|
8221 |
|
wenzelm@8848
|
8222 |
Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
|
wenzelm@8848
|
8223 |
Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
|
paulson@8788
|
8224 |
|
wenzelm@10129
|
8225 |
* HOL: simplification no longer dives into case-expressions; this is
|
wenzelm@10129
|
8226 |
controlled by "t.weak_case_cong" for each datatype t;
|
paulson@8967
|
8227 |
|
wenzelm@10003
|
8228 |
* HOL: nat_less_induct renamed to less_induct;
|
wenzelm@10003
|
8229 |
|
wenzelm@10003
|
8230 |
* HOL: systematic renaming of the SOME (Eps) rules, may use isatool
|
wenzelm@10003
|
8231 |
fixsome to patch .thy and .ML sources automatically;
|
wenzelm@10003
|
8232 |
|
wenzelm@10003
|
8233 |
select_equality -> some_equality
|
wenzelm@10003
|
8234 |
select_eq_Ex -> some_eq_ex
|
wenzelm@10003
|
8235 |
selectI2EX -> someI2_ex
|
wenzelm@10003
|
8236 |
selectI2 -> someI2
|
wenzelm@10003
|
8237 |
selectI -> someI
|
wenzelm@10003
|
8238 |
select1_equality -> some1_equality
|
wenzelm@10003
|
8239 |
Eps_sym_eq -> some_sym_eq_trivial
|
wenzelm@10003
|
8240 |
Eps_eq -> some_eq_trivial
|
wenzelm@10003
|
8241 |
|
wenzelm@36856
|
8242 |
* HOL: exhaust_tac on datatypes superceded by new generic case_tac;
|
wenzelm@10003
|
8243 |
|
wenzelm@10003
|
8244 |
* HOL: removed obsolete theorem binding expand_if (refer to split_if
|
wenzelm@10003
|
8245 |
instead);
|
wenzelm@10003
|
8246 |
|
wenzelm@10003
|
8247 |
* HOL: the recursion equations generated by 'recdef' are now called
|
wenzelm@10003
|
8248 |
f.simps instead of f.rules;
|
wenzelm@10003
|
8249 |
|
wenzelm@10003
|
8250 |
* HOL: qed_spec_mp now also handles bounded ALL as well;
|
wenzelm@10003
|
8251 |
|
wenzelm@10003
|
8252 |
* HOL: 0 is now overloaded, so the type constraint ":: nat" may
|
wenzelm@10003
|
8253 |
sometimes be needed;
|
wenzelm@10003
|
8254 |
|
wenzelm@10003
|
8255 |
* HOL: the constant for "f``x" is now "image" rather than "op ``";
|
paulson@8014
|
8256 |
|
paulson@10065
|
8257 |
* HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
|
paulson@10065
|
8258 |
|
wenzelm@9330
|
8259 |
* HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
|
wenzelm@9330
|
8260 |
product is now "<*>" instead of "Times"; the lexicographic product is
|
wenzelm@9330
|
8261 |
now "<*lex*>" instead of "**";
|
nipkow@8705
|
8262 |
|
wenzelm@10003
|
8263 |
* HOL: theory Sexp is now in HOL/Induct examples (it used to be part
|
wenzelm@10003
|
8264 |
of main HOL, but was unused); better use HOL's datatype package;
|
paulson@9971
|
8265 |
|
wenzelm@10137
|
8266 |
* HOL: removed "symbols" syntax for constant "override" of theory Map;
|
wenzelm@10137
|
8267 |
the old syntax may be recovered as follows:
|
wenzelm@10137
|
8268 |
|
wenzelm@10137
|
8269 |
syntax (symbols)
|
wenzelm@10137
|
8270 |
override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
|
wenzelm@10137
|
8271 |
(infixl "\\<oplus>" 100)
|
wenzelm@10137
|
8272 |
|
wenzelm@8848
|
8273 |
* HOL/Real: "rabs" replaced by overloaded "abs" function;
|
wenzelm@8848
|
8274 |
|
wenzelm@8887
|
8275 |
* HOL/ML: even fewer consts are declared as global (see theories Ord,
|
wenzelm@8887
|
8276 |
Lfp, Gfp, WF); this only affects ML packages that refer to const names
|
wenzelm@8887
|
8277 |
internally;
|
wenzelm@8887
|
8278 |
|
wenzelm@10003
|
8279 |
* HOL and ZF: syntax for quotienting wrt an equivalence relation
|
wenzelm@10003
|
8280 |
changed from A/r to A//r;
|
wenzelm@9908
|
8281 |
|
wenzelm@10003
|
8282 |
* ZF: new treatment of arithmetic (nat & int) may break some old
|
wenzelm@10003
|
8283 |
proofs;
|
paulson@9388
|
8284 |
|
wenzelm@10003
|
8285 |
* Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
|
wenzelm@10003
|
8286 |
rulify -> rule_format, elimify -> elim_format, ...);
|
paulson@9542
|
8287 |
|
wenzelm@9941
|
8288 |
* Isar/Provers: intro/elim/dest attributes changed; renamed
|
wenzelm@9941
|
8289 |
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
|
wenzelm@9937
|
8290 |
should have to change intro!! to intro? only); replaced "delrule" by
|
wenzelm@9937
|
8291 |
"rule del";
|
wenzelm@9437
|
8292 |
|
wenzelm@9612
|
8293 |
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
|
wenzelm@9612
|
8294 |
|
wenzelm@9437
|
8295 |
* Provers: strengthened force_tac by using new first_best_tac;
|
oheimb@9402
|
8296 |
|
wenzelm@10003
|
8297 |
* LaTeX document preparation: several changes of isabelle.sty (see
|
wenzelm@10003
|
8298 |
lib/texinputs);
|
wenzelm@8729
|
8299 |
|
paulson@8014
|
8300 |
|
wenzelm@8487
|
8301 |
*** Document preparation ***
|
wenzelm@8358
|
8302 |
|
wenzelm@9198
|
8303 |
* formal comments (text blocks etc.) in new-style theories may now
|
wenzelm@9753
|
8304 |
contain antiquotations of thm/prop/term/typ/text to be presented
|
wenzelm@9753
|
8305 |
according to latex print mode; concrete syntax is like this:
|
wenzelm@9753
|
8306 |
@{term[show_types] "f(x) = a + x"};
|
wenzelm@9198
|
8307 |
|
wenzelm@8358
|
8308 |
* isatool mkdir provides easy setup of Isabelle session directories,
|
wenzelm@8518
|
8309 |
including proper document sources;
|
wenzelm@8358
|
8310 |
|
wenzelm@8358
|
8311 |
* generated LaTeX sources are now deleted after successful run
|
wenzelm@8358
|
8312 |
(isatool document -c); may retain a copy somewhere else via -D option
|
wenzelm@8358
|
8313 |
of isatool usedir;
|
wenzelm@8358
|
8314 |
|
wenzelm@8566
|
8315 |
* isatool usedir -D now lets isatool latex -o sty update the Isabelle
|
wenzelm@10003
|
8316 |
style files, achieving self-contained LaTeX sources and simplifying
|
wenzelm@10003
|
8317 |
LaTeX debugging;
|
wenzelm@8566
|
8318 |
|
wenzelm@8518
|
8319 |
* old-style theories now produce (crude) LaTeX output as well;
|
wenzelm@8358
|
8320 |
|
wenzelm@9057
|
8321 |
* browser info session directories are now self-contained (may be put
|
wenzelm@9437
|
8322 |
on WWW server seperately); improved graphs of nested sessions; removed
|
wenzelm@9437
|
8323 |
graph for 'all sessions';
|
wenzelm@9057
|
8324 |
|
wenzelm@10003
|
8325 |
* several improvements in isabelle style files; \isabellestyle{it}
|
wenzelm@10003
|
8326 |
produces fake math mode output; \isamarkupheader is now \section by
|
wenzelm@10003
|
8327 |
default; see lib/texinputs/isabelle.sty etc.;
|
wenzelm@9489
|
8328 |
|
wenzelm@8358
|
8329 |
|
wenzelm@8184
|
8330 |
*** Isar ***
|
wenzelm@8184
|
8331 |
|
wenzelm@10003
|
8332 |
* Isar/Pure: local results and corresponding term bindings are now
|
wenzelm@10003
|
8333 |
subject to Hindley-Milner polymorphism (similar to ML); this
|
wenzelm@10003
|
8334 |
accommodates incremental type-inference very nicely;
|
wenzelm@8283
|
8335 |
|
wenzelm@10003
|
8336 |
* Isar/Pure: new derived language element 'obtain' supports
|
wenzelm@10003
|
8337 |
generalized existence reasoning;
|
wenzelm@8621
|
8338 |
|
wenzelm@10003
|
8339 |
* Isar/Pure: new calculational elements 'moreover' and 'ultimately'
|
wenzelm@10003
|
8340 |
support accumulation of results, without applying any rules yet;
|
wenzelm@10003
|
8341 |
useful to collect intermediate results without explicit name
|
wenzelm@10003
|
8342 |
references, and for use with transitivity rules with more than 2
|
wenzelm@10003
|
8343 |
premises;
|
wenzelm@8184
|
8344 |
|
wenzelm@10003
|
8345 |
* Isar/Pure: scalable support for case-analysis type proofs: new
|
wenzelm@10003
|
8346 |
'case' language element refers to local contexts symbolically, as
|
wenzelm@10003
|
8347 |
produced by certain proof methods; internally, case names are attached
|
wenzelm@10003
|
8348 |
to theorems as "tags";
|
wenzelm@8440
|
8349 |
|
wenzelm@10003
|
8350 |
* Isar/Pure: theory command 'hide' removes declarations from
|
wenzelm@9330
|
8351 |
class/type/const name spaces;
|
wenzelm@9330
|
8352 |
|
wenzelm@10003
|
8353 |
* Isar/Pure: theory command 'defs' supports option "(overloaded)" to
|
wenzelm@9330
|
8354 |
indicate potential overloading;
|
wenzelm@9330
|
8355 |
|
wenzelm@10003
|
8356 |
* Isar/Pure: changed syntax of local blocks from {{ }} to { };
|
wenzelm@8921
|
8357 |
|
wenzelm@10003
|
8358 |
* Isar/Pure: syntax of sorts made 'inner', i.e. have to write
|
wenzelm@10003
|
8359 |
"{a,b,c}" instead of {a,b,c};
|
wenzelm@9612
|
8360 |
|
wenzelm@10003
|
8361 |
* Isar/Pure now provides its own version of intro/elim/dest
|
wenzelm@10003
|
8362 |
attributes; useful for building new logics, but beware of confusion
|
wenzelm@10003
|
8363 |
with the version in Provers/classical;
|
wenzelm@8921
|
8364 |
|
wenzelm@10003
|
8365 |
* Isar/Pure: the local context of (non-atomic) goals is provided via
|
wenzelm@10003
|
8366 |
case name 'antecedent';
|
wenzelm@8621
|
8367 |
|
wenzelm@10003
|
8368 |
* Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
|
wenzelm@10003
|
8369 |
to the current context is now done automatically);
|
wenzelm@8991
|
8370 |
|
wenzelm@10003
|
8371 |
* Isar/Pure: theory command 'method_setup' provides a simple interface
|
wenzelm@10003
|
8372 |
for definining proof methods in ML;
|
wenzelm@9011
|
8373 |
|
wenzelm@10003
|
8374 |
* Isar/Provers: intro/elim/dest attributes changed; renamed
|
wenzelm@9941
|
8375 |
intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
|
wenzelm@9941
|
8376 |
most cases, one should have to change intro!! to intro? only);
|
wenzelm@9941
|
8377 |
replaced "delrule" by "rule del";
|
wenzelm@8283
|
8378 |
|
wenzelm@10003
|
8379 |
* Isar/Provers: new 'hypsubst' method, plain 'subst' method and
|
wenzelm@36856
|
8380 |
'symmetric' attribute (the latter supercedes [RS sym]);
|
wenzelm@9612
|
8381 |
|
wenzelm@10003
|
8382 |
* Isar/Provers: splitter support (via 'split' attribute and 'simp'
|
wenzelm@10003
|
8383 |
method modifier); 'simp' method: 'only:' modifier removes loopers as
|
wenzelm@10003
|
8384 |
well (including splits);
|
wenzelm@10003
|
8385 |
|
wenzelm@10003
|
8386 |
* Isar/Provers: Simplifier and Classical methods now support all kind
|
wenzelm@10003
|
8387 |
of modifiers used in the past, including 'cong', 'iff', etc.
|
wenzelm@10003
|
8388 |
|
wenzelm@10003
|
8389 |
* Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
|
wenzelm@10003
|
8390 |
of Simplifier and Classical reasoner);
|
wenzelm@10003
|
8391 |
|
wenzelm@10003
|
8392 |
* Isar/HOL: new proof method 'cases' and improved version of 'induct'
|
wenzelm@10003
|
8393 |
now support named cases; major packages (inductive, datatype, primrec,
|
wenzelm@10003
|
8394 |
recdef) support case names and properly name parameters;
|
wenzelm@10003
|
8395 |
|
wenzelm@10003
|
8396 |
* Isar/HOL: new transitivity rules for substitution in inequalities --
|
wenzelm@10003
|
8397 |
monotonicity conditions are extracted to be proven at end of
|
wenzelm@10003
|
8398 |
calculations;
|
wenzelm@10003
|
8399 |
|
wenzelm@10003
|
8400 |
* Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
|
wenzelm@10003
|
8401 |
method anyway;
|
wenzelm@10003
|
8402 |
|
wenzelm@10003
|
8403 |
* Isar/HOL: removed old expand_if = split_if; theorems if_splits =
|
wenzelm@10003
|
8404 |
split_if split_if_asm; datatype package provides theorems foo.splits =
|
wenzelm@10003
|
8405 |
foo.split foo.split_asm for each datatype;
|
wenzelm@10003
|
8406 |
|
wenzelm@10003
|
8407 |
* Isar/HOL: tuned inductive package, rename "intrs" to "intros"
|
wenzelm@10003
|
8408 |
(potential INCOMPATIBILITY), emulation of mk_cases feature for proof
|
wenzelm@10003
|
8409 |
scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
|
wenzelm@10003
|
8410 |
use "(cases (simplified))" method in proper proof texts);
|
wenzelm@10003
|
8411 |
|
wenzelm@10003
|
8412 |
* Isar/HOL: added global 'arith_split' attribute for 'arith' method;
|
wenzelm@10003
|
8413 |
|
wenzelm@10003
|
8414 |
* Isar: names of theorems etc. may be natural numbers as well;
|
wenzelm@10003
|
8415 |
|
wenzelm@10003
|
8416 |
* Isar: 'pr' command: optional arguments for goals_limit and
|
wenzelm@9724
|
8417 |
ProofContext.prems_limit; no longer prints theory contexts, but only
|
wenzelm@9724
|
8418 |
proof states;
|
wenzelm@8487
|
8419 |
|
wenzelm@10003
|
8420 |
* Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
|
wenzelm@8518
|
8421 |
additional print modes to be specified; e.g. "pr(latex)" will print
|
wenzelm@8518
|
8422 |
proof state according to the Isabelle LaTeX style;
|
wenzelm@8487
|
8423 |
|
wenzelm@10003
|
8424 |
* Isar: improved support for emulating tactic scripts, including proof
|
wenzelm@9612
|
8425 |
methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
|
wenzelm@9612
|
8426 |
'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
|
wenzelm@9612
|
8427 |
(for HOL datatypes);
|
wenzelm@8534
|
8428 |
|
wenzelm@10003
|
8429 |
* Isar: simplified (more robust) goal selection of proof methods: 1st
|
wenzelm@10003
|
8430 |
goal, all goals, or explicit goal specifier (tactic emulation); thus
|
wenzelm@10003
|
8431 |
'proof method scripts' have to be in depth-first order;
|
wenzelm@8673
|
8432 |
|
wenzelm@10003
|
8433 |
* Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
|
wenzelm@8729
|
8434 |
|
wenzelm@10003
|
8435 |
* Isar: removed 'help' command, which hasn't been too helpful anyway;
|
wenzelm@10003
|
8436 |
should instead use individual commands for printing items
|
wenzelm@10003
|
8437 |
(print_commands, print_methods etc.);
|
wenzelm@9224
|
8438 |
|
wenzelm@10003
|
8439 |
* Isar: added 'nothing' --- the empty list of theorems;
|
wenzelm@9239
|
8440 |
|
wenzelm@8184
|
8441 |
|
paulson@8014
|
8442 |
*** HOL ***
|
paulson@8014
|
8443 |
|
wenzelm@10080
|
8444 |
* HOL/MicroJava: formalization of a fragment of Java, together with a
|
wenzelm@10080
|
8445 |
corresponding virtual machine and a specification of its bytecode
|
wenzelm@10080
|
8446 |
verifier and a lightweight bytecode verifier, including proofs of
|
wenzelm@10080
|
8447 |
type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
|
wenzelm@10080
|
8448 |
Cornelia Pusch (see also the homepage of project Bali at
|
wenzelm@10080
|
8449 |
http://isabelle.in.tum.de/Bali/);
|
wenzelm@10080
|
8450 |
|
wenzelm@8518
|
8451 |
* HOL/Algebra: new theory of rings and univariate polynomials, by
|
wenzelm@8518
|
8452 |
Clemens Ballarin;
|
paulson@8014
|
8453 |
|
wenzelm@10157
|
8454 |
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
|
wenzelm@10003
|
8455 |
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
|
wenzelm@10003
|
8456 |
Rasmussen;
|
wenzelm@8007
|
8457 |
|
wenzelm@10157
|
8458 |
* HOL/Lattice: fundamental concepts of lattice theory and order
|
wenzelm@10157
|
8459 |
structures, including duals, properties of bounds versus algebraic
|
wenzelm@10157
|
8460 |
laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
|
wenzelm@10157
|
8461 |
Theorem for complete lattices etc.; may also serve as a demonstration
|
wenzelm@10157
|
8462 |
for abstract algebraic reasoning using axiomatic type classes, and
|
wenzelm@10157
|
8463 |
mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
|
wenzelm@10157
|
8464 |
|
wenzelm@10003
|
8465 |
* HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
|
wenzelm@10003
|
8466 |
von Oheimb;
|
wenzelm@8570
|
8467 |
|
wenzelm@10164
|
8468 |
* HOL/IMPP: extension of IMP with local variables and mutually
|
wenzelm@10164
|
8469 |
recursive procedures, by David von Oheimb;
|
wenzelm@10164
|
8470 |
|
wenzelm@10003
|
8471 |
* HOL/Lambda: converted into new-style theory and document;
|
paulson@9542
|
8472 |
|
wenzelm@10003
|
8473 |
* HOL/ex/Multiquote: example of multiple nested quotations and
|
wenzelm@10003
|
8474 |
anti-quotations -- basically a generalized version of de-Bruijn
|
wenzelm@10003
|
8475 |
representation; very useful in avoiding lifting of operations;
|
wenzelm@8848
|
8476 |
|
wenzelm@9612
|
8477 |
* HOL/record: added general record equality rule to simpset; fixed
|
wenzelm@9612
|
8478 |
select-update simplification procedure to handle extended records as
|
wenzelm@9612
|
8479 |
well; admit "r" as field name;
|
paulson@9542
|
8480 |
|
paulson@8967
|
8481 |
* HOL: 0 is now overloaded over the new sort "zero", allowing its use with
|
paulson@8967
|
8482 |
other numeric types and also as the identity of groups, rings, etc.;
|
paulson@8967
|
8483 |
|
paulson@8967
|
8484 |
* HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
|
paulson@8967
|
8485 |
Types nat and int belong to this axclass;
|
paulson@8967
|
8486 |
|
wenzelm@10003
|
8487 |
* HOL: greatly improved simplification involving numerals of type nat, int, real:
|
paulson@8788
|
8488 |
(i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
|
paulson@8832
|
8489 |
i*j + k + j*#3*i simplifies to #4*(i*j) + k
|
paulson@8832
|
8490 |
two terms #m*u and #n*u are replaced by #(m+n)*u
|
paulson@8832
|
8491 |
(where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
|
paulson@8832
|
8492 |
and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
|
paulson@8832
|
8493 |
or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
|
paulson@8736
|
8494 |
|
wenzelm@10003
|
8495 |
* HOL: meson_tac is available (previously in ex/meson.ML); it is a
|
wenzelm@10003
|
8496 |
powerful prover for predicate logic but knows nothing of clasets; see
|
wenzelm@10003
|
8497 |
ex/mesontest.ML and ex/mesontest2.ML for example applications;
|
paulson@9835
|
8498 |
|
wenzelm@8848
|
8499 |
* HOL: new version of "case_tac" subsumes both boolean case split and
|
wenzelm@8440
|
8500 |
"exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
|
wenzelm@8518
|
8501 |
exists, may define val exhaust_tac = case_tac for ad-hoc portability;
|
wenzelm@8440
|
8502 |
|
wenzelm@8848
|
8503 |
* HOL: simplification no longer dives into case-expressions: only the
|
wenzelm@10129
|
8504 |
selector expression is simplified, but not the remaining arms; to
|
wenzelm@10129
|
8505 |
enable full simplification of case-expressions for datatype t, you may
|
wenzelm@10129
|
8506 |
remove t.weak_case_cong from the simpset, either globally (Delcongs
|
wenzelm@10129
|
8507 |
[thm"t.weak_case_cong"];) or locally (delcongs [...]).
|
nipkow@8603
|
8508 |
|
wenzelm@8848
|
8509 |
* HOL/recdef: the recursion equations generated by 'recdef' for
|
wenzelm@8848
|
8510 |
function 'f' are now called f.simps instead of f.rules; if all
|
wenzelm@8848
|
8511 |
termination conditions are proved automatically, these simplification
|
wenzelm@8848
|
8512 |
rules are added to the simpset, as in primrec; rules may be named
|
wenzelm@8848
|
8513 |
individually as well, resulting in a separate list of theorems for
|
wenzelm@8848
|
8514 |
each equation;
|
wenzelm@8848
|
8515 |
|
wenzelm@9489
|
8516 |
* HOL/While is a new theory that provides a while-combinator. It
|
wenzelm@9489
|
8517 |
permits the definition of tail-recursive functions without the
|
wenzelm@9489
|
8518 |
provision of a termination measure. The latter is necessary once the
|
wenzelm@9489
|
8519 |
invariant proof rule for while is applied.
|
nipkow@9457
|
8520 |
|
wenzelm@10003
|
8521 |
* HOL: new (overloaded) notation for the set of elements below/above
|
wenzelm@10003
|
8522 |
some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
|
nipkow@8925
|
8523 |
|
wenzelm@8848
|
8524 |
* HOL: theorems impI, allI, ballI bound as "strip";
|
wenzelm@8848
|
8525 |
|
wenzelm@10003
|
8526 |
* HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
|
nipkow@9746
|
8527 |
induct_tac th "x1 ... xn" expects th to have a conclusion of the form
|
nipkow@9746
|
8528 |
P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
|
nipkow@9746
|
8529 |
|
wenzelm@10003
|
8530 |
* HOL/Real: "rabs" replaced by overloaded "abs" function;
|
nipkow@9737
|
8531 |
|
wenzelm@10003
|
8532 |
* HOL: theory Sexp now in HOL/Induct examples (it used to be part of
|
wenzelm@10003
|
8533 |
main HOL, but was unused);
|
nipkow@8626
|
8534 |
|
wenzelm@10003
|
8535 |
* HOL: fewer consts declared as global (e.g. have to refer to
|
wenzelm@10003
|
8536 |
"Lfp.lfp" instead of "lfp" internally; affects ML packages only);
|
wenzelm@8887
|
8537 |
|
wenzelm@10003
|
8538 |
* HOL: tuned AST representation of nested pairs, avoiding bogus output
|
wenzelm@10003
|
8539 |
in case of overlap with user translations (e.g. judgements over
|
wenzelm@10003
|
8540 |
tuples); (note that the underlying logical represenation is still
|
wenzelm@10003
|
8541 |
bogus);
|
wenzelm@9349
|
8542 |
|
nipkow@8412
|
8543 |
|
paulson@9542
|
8544 |
*** ZF ***
|
paulson@9542
|
8545 |
|
wenzelm@10003
|
8546 |
* ZF: simplification automatically cancels common terms in arithmetic
|
wenzelm@10003
|
8547 |
expressions over nat and int;
|
paulson@9542
|
8548 |
|
wenzelm@10003
|
8549 |
* ZF: new treatment of nat to minimize type-checking: all operators
|
wenzelm@10003
|
8550 |
coerce their operands to a natural number using the function natify,
|
wenzelm@10003
|
8551 |
making the algebraic laws unconditional;
|
paulson@9542
|
8552 |
|
wenzelm@10003
|
8553 |
* ZF: as above, for int: operators coerce their operands to an integer
|
wenzelm@10003
|
8554 |
using the function intify;
|
paulson@9542
|
8555 |
|
wenzelm@10003
|
8556 |
* ZF: the integer library now contains many of the usual laws for the
|
wenzelm@10003
|
8557 |
orderings, including $<=, and monotonicity laws for $+ and $*;
|
paulson@9542
|
8558 |
|
wenzelm@10003
|
8559 |
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
|
wenzelm@10003
|
8560 |
simplification;
|
paulson@9542
|
8561 |
|
wenzelm@10003
|
8562 |
* FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
|
wenzelm@10003
|
8563 |
to the simplifier and classical reasoner simultaneously;
|
paulson@9388
|
8564 |
|
paulson@9388
|
8565 |
|
wenzelm@8358
|
8566 |
*** General ***
|
wenzelm@8358
|
8567 |
|
wenzelm@10003
|
8568 |
* Provers: blast_tac now handles actual object-logic rules as
|
wenzelm@10003
|
8569 |
assumptions; note that auto_tac uses blast_tac internally as well;
|
wenzelm@10003
|
8570 |
|
wenzelm@10003
|
8571 |
* Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
|
wenzelm@10003
|
8572 |
outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
|
wenzelm@10003
|
8573 |
|
wenzelm@9941
|
8574 |
* Provers: delrules now handles destruct rules as well (no longer need
|
wenzelm@9941
|
8575 |
explicit make_elim);
|
wenzelm@9941
|
8576 |
|
wenzelm@10003
|
8577 |
* Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
|
wenzelm@10003
|
8578 |
[| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
|
wenzelm@10003
|
8579 |
use instead the strong form,
|
wenzelm@10003
|
8580 |
[| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
|
wenzelm@10003
|
8581 |
in HOL, FOL and ZF the function cla_make_elim will create such rules
|
wenzelm@10003
|
8582 |
from destruct-rules;
|
wenzelm@9489
|
8583 |
|
wenzelm@9709
|
8584 |
* Provers: Simplifier.easy_setup provides a fast path to basic
|
wenzelm@9709
|
8585 |
Simplifier setup for new object-logics;
|
wenzelm@9349
|
8586 |
|
wenzelm@9709
|
8587 |
* Pure: AST translation rules no longer require constant head on LHS;
|
wenzelm@8729
|
8588 |
|
wenzelm@9709
|
8589 |
* Pure: improved name spaces: ambiguous output is qualified; support
|
wenzelm@9709
|
8590 |
for hiding of names;
|
wenzelm@8358
|
8591 |
|
wenzelm@10003
|
8592 |
* system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
|
wenzelm@10003
|
8593 |
XSYMBOL_HOME; no longer need to do manual configuration in most
|
wenzelm@10003
|
8594 |
situations;
|
wenzelm@10003
|
8595 |
|
wenzelm@9709
|
8596 |
* system: compression of ML heaps images may now be controlled via -c
|
wenzelm@9709
|
8597 |
option of isabelle and isatool usedir (currently only observed by
|
wenzelm@9709
|
8598 |
Poly/ML);
|
wenzelm@9709
|
8599 |
|
wenzelm@9981
|
8600 |
* system: isatool installfonts may handle X-Symbol fonts as well (very
|
wenzelm@9981
|
8601 |
useful for remote X11);
|
wenzelm@9981
|
8602 |
|
wenzelm@9709
|
8603 |
* system: provide TAGS file for Isabelle sources;
|
wenzelm@9052
|
8604 |
|
wenzelm@9288
|
8605 |
* ML: infix 'OF' is a version of 'MRS' with more appropriate argument
|
wenzelm@9288
|
8606 |
order;
|
wenzelm@9288
|
8607 |
|
wenzelm@8994
|
8608 |
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
|
wenzelm@8994
|
8609 |
timing flag supersedes proof_timing and Toplevel.trace;
|
wenzelm@8994
|
8610 |
|
wenzelm@10003
|
8611 |
* ML: new combinators |>> and |>>> for incremental transformations
|
wenzelm@10003
|
8612 |
with secondary results (e.g. certain theory extensions):
|
wenzelm@10003
|
8613 |
|
wenzelm@9330
|
8614 |
* ML: PureThy.add_defs gets additional argument to indicate potential
|
wenzelm@9330
|
8615 |
overloading (usually false);
|
wenzelm@9330
|
8616 |
|
wenzelm@10003
|
8617 |
* ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
|
wenzelm@10003
|
8618 |
results;
|
wenzelm@8440
|
8619 |
|
wenzelm@8358
|
8620 |
|
wenzelm@8015
|
8621 |
|
wenzelm@7986
|
8622 |
New in Isabelle99 (October 1999)
|
wenzelm@7986
|
8623 |
--------------------------------
|
oheimb@4649
|
8624 |
|
paulson@5931
|
8625 |
*** Overview of INCOMPATIBILITIES (see below for more details) ***
|
paulson@5931
|
8626 |
|
paulson@6922
|
8627 |
* HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
|
paulson@6922
|
8628 |
are no longer simplified. (This allows the simplifier to unfold recursive
|
paulson@6922
|
8629 |
functional programs.) To restore the old behaviour, declare
|
wenzelm@7215
|
8630 |
|
wenzelm@7215
|
8631 |
Delcongs [if_weak_cong];
|
paulson@6922
|
8632 |
|
wenzelm@6269
|
8633 |
* HOL: Removed the obsolete syntax "Compl A"; use -A for set
|
wenzelm@6269
|
8634 |
complement;
|
paulson@5931
|
8635 |
|
wenzelm@6269
|
8636 |
* HOL: the predicate "inj" is now defined by translation to "inj_on";
|
paulson@6174
|
8637 |
|
berghofe@7847
|
8638 |
* HOL/datatype: mutual_induct_tac no longer exists --
|
berghofe@7847
|
8639 |
use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
|
berghofe@7847
|
8640 |
|
wenzelm@6386
|
8641 |
* HOL/typedef: fixed type inference for representing set; type
|
wenzelm@6386
|
8642 |
arguments now have to occur explicitly on the rhs as type constraints;
|
wenzelm@6386
|
8643 |
|
wenzelm@6269
|
8644 |
* ZF: The con_defs part of an inductive definition may no longer refer
|
wenzelm@6269
|
8645 |
to constants declared in the same theory;
|
nipkow@6057
|
8646 |
|
wenzelm@6269
|
8647 |
* HOL, ZF: the function mk_cases, generated by the inductive
|
wenzelm@6269
|
8648 |
definition package, has lost an argument. To simplify its result, it
|
wenzelm@6269
|
8649 |
uses the default simpset instead of a supplied list of theorems.
|
paulson@6141
|
8650 |
|
wenzelm@7215
|
8651 |
* HOL/List: the constructors of type list are now Nil and Cons;
|
wenzelm@7215
|
8652 |
|
nipkow@7619
|
8653 |
* Simplifier: the type of the infix ML functions
|
wenzelm@8729
|
8654 |
setSSolver addSSolver setSolver addSolver
|
nipkow@7619
|
8655 |
is now simpset * solver -> simpset where `solver' is a new abstract type
|
nipkow@7619
|
8656 |
for packaging solvers. A solver is created via
|
wenzelm@8729
|
8657 |
mk_solver: string -> (thm list -> int -> tactic) -> solver
|
nipkow@7619
|
8658 |
where the string argument is only a comment.
|
nipkow@6057
|
8659 |
|
wenzelm@7647
|
8660 |
|
paulson@6069
|
8661 |
*** Proof tools ***
|
paulson@6069
|
8662 |
|
wenzelm@6343
|
8663 |
* Provers/Arith/fast_lin_arith.ML contains a functor for creating a
|
wenzelm@6343
|
8664 |
decision procedure for linear arithmetic. Currently it is used for
|
wenzelm@7593
|
8665 |
types `nat', `int', and `real' in HOL (see below); it can, should and
|
wenzelm@7593
|
8666 |
will be instantiated for other types and logics as well.
|
paulson@6069
|
8667 |
|
nipkow@7324
|
8668 |
* The simplifier now accepts rewrite rules with flexible heads, eg
|
nipkow@7324
|
8669 |
hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
|
nipkow@7324
|
8670 |
They are applied like any rule with a non-pattern lhs, i.e. by first-order
|
nipkow@7324
|
8671 |
matching.
|
paulson@6069
|
8672 |
|
wenzelm@7593
|
8673 |
|
paulson@6014
|
8674 |
*** General ***
|
paulson@6014
|
8675 |
|
wenzelm@7986
|
8676 |
* New Isabelle/Isar subsystem provides an alternative to traditional
|
wenzelm@7215
|
8677 |
tactical theorem proving; together with the ProofGeneral/isar user
|
wenzelm@7215
|
8678 |
interface it offers an interactive environment for developing human
|
wenzelm@7215
|
8679 |
readable proof documents (Isar == Intelligible semi-automated
|
wenzelm@7886
|
8680 |
reasoning); for further information see isatool doc isar-ref,
|
wenzelm@7986
|
8681 |
src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
|
wenzelm@7886
|
8682 |
|
wenzelm@9612
|
8683 |
* improved and simplified presentation of theories: better HTML markup
|
wenzelm@9612
|
8684 |
(including colors), graph views in several sizes; isatool usedir now
|
wenzelm@9612
|
8685 |
provides a proper interface for user theories (via -P option); actual
|
wenzelm@9612
|
8686 |
document preparation based on (PDF)LaTeX is available as well (for
|
wenzelm@9612
|
8687 |
new-style theories only); see isatool doc system for more information;
|
wenzelm@7215
|
8688 |
|
wenzelm@7252
|
8689 |
* native support for Proof General, both for classic Isabelle and
|
wenzelm@7986
|
8690 |
Isabelle/Isar;
|
wenzelm@7215
|
8691 |
|
wenzelm@7791
|
8692 |
* ML function thm_deps visualizes dependencies of theorems and lemmas,
|
wenzelm@7791
|
8693 |
using the graph browser tool;
|
wenzelm@7791
|
8694 |
|
wenzelm@6751
|
8695 |
* Isabelle manuals now also available as PDF;
|
wenzelm@6751
|
8696 |
|
wenzelm@6449
|
8697 |
* theory loader rewritten from scratch (may not be fully
|
wenzelm@6449
|
8698 |
bug-compatible); old loadpath variable has been replaced by show_path,
|
wenzelm@6671
|
8699 |
add_path, del_path, reset_path functions; new operations such as
|
wenzelm@7593
|
8700 |
update_thy, touch_thy, remove_thy, use/update_thy_only (see also
|
wenzelm@7593
|
8701 |
isatool doc ref);
|
wenzelm@6449
|
8702 |
|
wenzelm@7215
|
8703 |
* improved isatool install: option -k creates KDE application icon,
|
wenzelm@7215
|
8704 |
option -p DIR installs standalone binaries;
|
wenzelm@7215
|
8705 |
|
wenzelm@7215
|
8706 |
* added ML_PLATFORM setting (useful for cross-platform installations);
|
wenzelm@7215
|
8707 |
more robust handling of platform specific ML images for SML/NJ;
|
wenzelm@7215
|
8708 |
|
wenzelm@7886
|
8709 |
* the settings environment is now statically scoped, i.e. it is never
|
wenzelm@7986
|
8710 |
created again in sub-processes invoked from isabelle, isatool, or
|
wenzelm@7886
|
8711 |
Isabelle;
|
wenzelm@7886
|
8712 |
|
wenzelm@7215
|
8713 |
* path element specification '~~' refers to '$ISABELLE_HOME';
|
wenzelm@7215
|
8714 |
|
wenzelm@6343
|
8715 |
* in locales, the "assumes" and "defines" parts may be omitted if
|
wenzelm@6343
|
8716 |
empty;
|
wenzelm@5973
|
8717 |
|
wenzelm@6269
|
8718 |
* new print_mode "xsymbols" for extended symbol support (e.g. genuine
|
wenzelm@6269
|
8719 |
long arrows);
|
wenzelm@6259
|
8720 |
|
wenzelm@6343
|
8721 |
* new print_mode "HTML";
|
wenzelm@6343
|
8722 |
|
wenzelm@6343
|
8723 |
* new flag show_tags controls display of tags of theorems (which are
|
wenzelm@6343
|
8724 |
basically just comments that may be attached by some tools);
|
wenzelm@6343
|
8725 |
|
wenzelm@6461
|
8726 |
* Isamode 2.6 requires patch to accomodate change of Isabelle font
|
wenzelm@6461
|
8727 |
mode and goal output format:
|
wenzelm@6461
|
8728 |
|
wenzelm@6461
|
8729 |
diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
|
wenzelm@6461
|
8730 |
244c244
|
wenzelm@6461
|
8731 |
< (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
|
wenzelm@6461
|
8732 |
---
|
wenzelm@6533
|
8733 |
> (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
|
wenzelm@6461
|
8734 |
diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
|
wenzelm@6461
|
8735 |
181c181
|
wenzelm@6461
|
8736 |
< (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
|
wenzelm@6461
|
8737 |
---
|
wenzelm@6461
|
8738 |
> (defconst proofstate-proofstart-regexp "^Level [0-9]+"
|
wenzelm@6461
|
8739 |
|
wenzelm@7450
|
8740 |
* function bind_thms stores lists of theorems (cf. bind_thm);
|
wenzelm@7450
|
8741 |
|
wenzelm@7593
|
8742 |
* new shorthand tactics ftac, eatac, datac, fatac;
|
wenzelm@7593
|
8743 |
|
wenzelm@7593
|
8744 |
* qed (and friends) now accept "" as result name; in that case the
|
wenzelm@7986
|
8745 |
theorem is not stored, but proper checks and presentation of the
|
wenzelm@7986
|
8746 |
result still apply;
|
wenzelm@7593
|
8747 |
|
wenzelm@7805
|
8748 |
* theorem database now also indexes constants "Trueprop", "all",
|
wenzelm@7805
|
8749 |
"==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
|
wenzelm@7805
|
8750 |
|
oheimb@6028
|
8751 |
|
nipkow@6057
|
8752 |
*** HOL ***
|
nipkow@6057
|
8753 |
|
wenzelm@7215
|
8754 |
** HOL arithmetic **
|
wenzelm@7215
|
8755 |
|
wenzelm@6343
|
8756 |
* There are now decision procedures for linear arithmetic over nat and
|
wenzelm@6343
|
8757 |
int:
|
nipkow@6131
|
8758 |
|
wenzelm@6343
|
8759 |
1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
|
wenzelm@6343
|
8760 |
`+', `-', `Suc', `min', `max' and numerical constants; other subterms
|
wenzelm@6343
|
8761 |
are treated as atomic; subformulae not involving type `nat' or `int'
|
wenzelm@6343
|
8762 |
are ignored; quantified subformulae are ignored unless they are
|
wenzelm@6343
|
8763 |
positive universal or negative existential. The tactic has to be
|
wenzelm@6343
|
8764 |
invoked by hand and can be a little bit slow. In particular, the
|
wenzelm@6343
|
8765 |
running time is exponential in the number of occurrences of `min' and
|
wenzelm@6343
|
8766 |
`max', and `-' on `nat'.
|
nipkow@6131
|
8767 |
|
wenzelm@6343
|
8768 |
2. fast_arith_tac is a cut-down version of arith_tac: it only takes
|
wenzelm@6343
|
8769 |
(negated) (in)equalities among the premises and the conclusion into
|
wenzelm@6343
|
8770 |
account (i.e. no compound formulae) and does not know about `min' and
|
wenzelm@6343
|
8771 |
`max', and `-' on `nat'. It is fast and is used automatically by the
|
wenzelm@6343
|
8772 |
simplifier.
|
nipkow@6131
|
8773 |
|
wenzelm@6343
|
8774 |
NB: At the moment, these decision procedures do not cope with mixed
|
wenzelm@6343
|
8775 |
nat/int formulae where the two parts interact, such as `m < n ==>
|
wenzelm@6343
|
8776 |
int(m) < int(n)'.
|
oheimb@6028
|
8777 |
|
wenzelm@7215
|
8778 |
* HOL/Numeral provides a generic theory of numerals (encoded
|
wenzelm@7313
|
8779 |
efficiently as bit strings); setup for types nat/int/real is in place;
|
wenzelm@7215
|
8780 |
INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
|
wenzelm@7215
|
8781 |
int, existing theories and proof scripts may require a few additional
|
wenzelm@7215
|
8782 |
type constraints;
|
paulson@7157
|
8783 |
|
wenzelm@7215
|
8784 |
* integer division and remainder can now be performed on constant
|
wenzelm@7215
|
8785 |
arguments;
|
paulson@6922
|
8786 |
|
wenzelm@7215
|
8787 |
* many properties of integer multiplication, division and remainder
|
wenzelm@7215
|
8788 |
are now available;
|
wenzelm@7215
|
8789 |
|
paulson@7287
|
8790 |
* An interface to the Stanford Validity Checker (SVC) is available through the
|
paulson@7287
|
8791 |
tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
|
paulson@7287
|
8792 |
are proved automatically. SVC must be installed separately, and its results
|
paulson@7287
|
8793 |
must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
|
paulson@7287
|
8794 |
invocation of the underlying oracle). For SVC see
|
paulson@7444
|
8795 |
http://verify.stanford.edu/SVC
|
paulson@6922
|
8796 |
|
wenzelm@7125
|
8797 |
* IsaMakefile: the HOL-Real target now builds an actual image;
|
wenzelm@7125
|
8798 |
|
wenzelm@7215
|
8799 |
|
wenzelm@7215
|
8800 |
** HOL misc **
|
wenzelm@7215
|
8801 |
|
wenzelm@7595
|
8802 |
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
|
wenzelm@7595
|
8803 |
(in Isabelle/Isar) -- by Gertrud Bauer;
|
wenzelm@7595
|
8804 |
|
wenzelm@7691
|
8805 |
* HOL/BCV: generic model of bytecode verification, i.e. data-flow
|
wenzelm@7691
|
8806 |
analysis for assembly languages with subtypes;
|
wenzelm@7691
|
8807 |
|
wenzelm@6278
|
8808 |
* HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
|
wenzelm@6278
|
8809 |
-- avoids syntactic ambiguities and treats state, transition, and
|
wenzelm@6278
|
8810 |
temporal levels more uniformly; introduces INCOMPATIBILITIES due to
|
wenzelm@6278
|
8811 |
changed syntax and (many) tactics;
|
wenzelm@6278
|
8812 |
|
wenzelm@7791
|
8813 |
* HOL/inductive: Now also handles more general introduction rules such
|
wenzelm@7791
|
8814 |
as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
|
wenzelm@7791
|
8815 |
theorems are now maintained within the theory (maintained via the
|
wenzelm@7791
|
8816 |
"mono" attribute);
|
berghofe@7780
|
8817 |
|
wenzelm@7238
|
8818 |
* HOL/datatype: Now also handles arbitrarily branching datatypes
|
wenzelm@7238
|
8819 |
(using function types) such as
|
wenzelm@7238
|
8820 |
|
wenzelm@7238
|
8821 |
datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
|
berghofe@7047
|
8822 |
|
wenzelm@7326
|
8823 |
* HOL/record: record_simproc (part of the default simpset) takes care
|
wenzelm@7326
|
8824 |
of selectors applied to updated records; record_split_tac is no longer
|
wenzelm@7327
|
8825 |
part of the default claset; update_defs may now be removed from the
|
wenzelm@7327
|
8826 |
simpset in many cases; COMPATIBILITY: old behavior achieved by
|
wenzelm@7326
|
8827 |
|
wenzelm@7326
|
8828 |
claset_ref () := claset() addSWrapper record_split_wrapper;
|
wenzelm@7326
|
8829 |
Delsimprocs [record_simproc]
|
wenzelm@7326
|
8830 |
|
wenzelm@6386
|
8831 |
* HOL/typedef: fixed type inference for representing set; type
|
wenzelm@6386
|
8832 |
arguments now have to occur explicitly on the rhs as type constraints;
|
wenzelm@6386
|
8833 |
|
paulson@7287
|
8834 |
* HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
|
paulson@7287
|
8835 |
names rather than an ML expression;
|
paulson@7287
|
8836 |
|
paulson@7287
|
8837 |
* HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
|
paulson@7287
|
8838 |
supplied later. Program schemes can be defined, such as
|
paulson@7287
|
8839 |
"While B C s = (if B s then While B C (C s) else s)"
|
paulson@7287
|
8840 |
where the well-founded relation can be chosen after B and C have been given.
|
wenzelm@6563
|
8841 |
|
wenzelm@7215
|
8842 |
* HOL/List: the constructors of type list are now Nil and Cons;
|
wenzelm@7215
|
8843 |
INCOMPATIBILITY: while [] and infix # syntax is still there, of
|
wenzelm@7215
|
8844 |
course, ML tools referring to List.list.op # etc. have to be adapted;
|
wenzelm@7215
|
8845 |
|
wenzelm@7238
|
8846 |
* HOL_quantifiers flag superseded by "HOL" print mode, which is
|
wenzelm@7238
|
8847 |
disabled by default; run isabelle with option -m HOL to get back to
|
wenzelm@7238
|
8848 |
the original Gordon/HOL-style output;
|
wenzelm@7238
|
8849 |
|
wenzelm@7238
|
8850 |
* HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
|
wenzelm@7238
|
8851 |
ALL x<=y. P, EX x<y. P, EX x<=y. P;
|
wenzelm@7238
|
8852 |
|
wenzelm@7238
|
8853 |
* HOL basic syntax simplified (more orthogonal): all variants of
|
wenzelm@7238
|
8854 |
All/Ex now support plain / symbolic / HOL notation; plain syntax for
|
wenzelm@7238
|
8855 |
Eps operator is provided as well: "SOME x. P[x]";
|
wenzelm@7238
|
8856 |
|
berghofe@7320
|
8857 |
* HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
|
wenzelm@7261
|
8858 |
|
wenzelm@7280
|
8859 |
* HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
|
wenzelm@7280
|
8860 |
thus available for user theories;
|
wenzelm@7280
|
8861 |
|
wenzelm@7300
|
8862 |
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
|
wenzelm@7300
|
8863 |
HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
|
wenzelm@7300
|
8864 |
time;
|
wenzelm@7300
|
8865 |
|
wenzelm@7986
|
8866 |
* HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
|
wenzelm@7986
|
8867 |
several times and then mp;
|
oheimb@7492
|
8868 |
|
wenzelm@7215
|
8869 |
|
paulson@7113
|
8870 |
*** LK ***
|
paulson@7113
|
8871 |
|
wenzelm@7215
|
8872 |
* the notation <<...>> is now available as a notation for sequences of
|
wenzelm@7215
|
8873 |
formulas;
|
paulson@7113
|
8874 |
|
paulson@7113
|
8875 |
* the simplifier is now installed
|
paulson@7113
|
8876 |
|
wenzelm@8729
|
8877 |
* the axiom system has been generalized (thanks to Soren Heilmann)
|
paulson@7113
|
8878 |
|
paulson@7113
|
8879 |
* the classical reasoner now has a default rule database
|
paulson@7113
|
8880 |
|
paulson@7113
|
8881 |
|
paulson@6064
|
8882 |
*** ZF ***
|
paulson@6064
|
8883 |
|
paulson@6064
|
8884 |
* new primrec section allows primitive recursive functions to be given
|
wenzelm@6269
|
8885 |
directly (as in HOL) over datatypes and the natural numbers;
|
paulson@6064
|
8886 |
|
wenzelm@6269
|
8887 |
* new tactics induct_tac and exhaust_tac for induction (or case
|
wenzelm@6269
|
8888 |
analysis) over datatypes and the natural numbers;
|
paulson@6064
|
8889 |
|
paulson@6064
|
8890 |
* the datatype declaration of type T now defines the recursor T_rec;
|
paulson@6064
|
8891 |
|
paulson@6141
|
8892 |
* simplification automatically does freeness reasoning for datatype
|
wenzelm@6269
|
8893 |
constructors;
|
paulson@6141
|
8894 |
|
wenzelm@6269
|
8895 |
* automatic type-inference, with AddTCs command to insert new
|
wenzelm@6269
|
8896 |
type-checking rules;
|
paulson@6155
|
8897 |
|
wenzelm@6269
|
8898 |
* datatype introduction rules are now added as Safe Introduction rules
|
wenzelm@6269
|
8899 |
to the claset;
|
paulson@6155
|
8900 |
|
wenzelm@6269
|
8901 |
* the syntax "if P then x else y" is now available in addition to
|
wenzelm@6269
|
8902 |
if(P,x,y);
|
wenzelm@6269
|
8903 |
|
paulson@6069
|
8904 |
|
wenzelm@6343
|
8905 |
*** Internal programming interfaces ***
|
wenzelm@6343
|
8906 |
|
wenzelm@7919
|
8907 |
* tuned simplifier trace output; new flag debug_simp;
|
wenzelm@7919
|
8908 |
|
wenzelm@7420
|
8909 |
* structures Vartab / Termtab (instances of TableFun) offer efficient
|
wenzelm@7420
|
8910 |
tables indexed by indexname_ord / term_ord (compatible with aconv);
|
wenzelm@7420
|
8911 |
|
wenzelm@6386
|
8912 |
* AxClass.axclass_tac lost the theory argument;
|
wenzelm@6386
|
8913 |
|
wenzelm@6343
|
8914 |
* tuned current_goals_markers semantics: begin / end goal avoids
|
wenzelm@6343
|
8915 |
printing empty lines;
|
wenzelm@6343
|
8916 |
|
wenzelm@6343
|
8917 |
* removed prs and prs_fn hook, which was broken because it did not
|
wenzelm@6343
|
8918 |
include \n in its semantics, forcing writeln to add one
|
wenzelm@6343
|
8919 |
uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
|
wenzelm@6343
|
8920 |
string -> unit if you really want to output text without newline;
|
wenzelm@6343
|
8921 |
|
wenzelm@6343
|
8922 |
* Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
|
wenzelm@6343
|
8923 |
plain output, interface builders may have to enable 'isabelle_font'
|
wenzelm@6343
|
8924 |
mode to get Isabelle font glyphs as before;
|
wenzelm@6343
|
8925 |
|
wenzelm@6343
|
8926 |
* refined token_translation interface; INCOMPATIBILITY: output length
|
wenzelm@6343
|
8927 |
now of type real instead of int;
|
wenzelm@6343
|
8928 |
|
wenzelm@7196
|
8929 |
* theory loader actions may be traced via new ThyInfo.add_hook
|
wenzelm@7196
|
8930 |
interface (see src/Pure/Thy/thy_info.ML); example application: keep
|
wenzelm@7196
|
8931 |
your own database of information attached to *whole* theories -- as
|
wenzelm@7196
|
8932 |
opposed to intra-theory data slots offered via TheoryDataFun;
|
wenzelm@7196
|
8933 |
|
wenzelm@7647
|
8934 |
* proper handling of dangling sort hypotheses (at last!);
|
wenzelm@7647
|
8935 |
Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
|
wenzelm@7647
|
8936 |
extra sort hypotheses that can be witnessed from the type signature;
|
wenzelm@7986
|
8937 |
the force_strip_shyps flag is gone, any remaining shyps are simply
|
wenzelm@7986
|
8938 |
left in the theorem (with a warning issued by strip_shyps_warning);
|
wenzelm@7647
|
8939 |
|
wenzelm@6343
|
8940 |
|
paulson@6064
|
8941 |
|
wenzelm@5781
|
8942 |
New in Isabelle98-1 (October 1998)
|
wenzelm@5781
|
8943 |
----------------------------------
|
wenzelm@5781
|
8944 |
|
wenzelm@5127
|
8945 |
*** Overview of INCOMPATIBILITIES (see below for more details) ***
|
wenzelm@4842
|
8946 |
|
wenzelm@5726
|
8947 |
* several changes of automated proof tools;
|
wenzelm@5207
|
8948 |
|
wenzelm@5726
|
8949 |
* HOL: major changes to the inductive and datatype packages, including
|
wenzelm@5726
|
8950 |
some minor incompatibilities of theory syntax;
|
wenzelm@5373
|
8951 |
|
wenzelm@5726
|
8952 |
* HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
|
wenzelm@5217
|
8953 |
called `inj_on';
|
paulson@5160
|
8954 |
|
nipkow@5275
|
8955 |
* HOL: removed duplicate thms in Arith:
|
nipkow@5275
|
8956 |
less_imp_add_less should be replaced by trans_less_add1
|
nipkow@5275
|
8957 |
le_imp_add_le should be replaced by trans_le_add1
|
paulson@5160
|
8958 |
|
wenzelm@5726
|
8959 |
* HOL: unary minus is now overloaded (new type constraints may be
|
wenzelm@5726
|
8960 |
required);
|
paulson@5490
|
8961 |
|
wenzelm@5726
|
8962 |
* HOL and ZF: unary minus for integers is now #- instead of #~. In
|
wenzelm@5726
|
8963 |
ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
|
wenzelm@5726
|
8964 |
now taken as an integer constant.
|
paulson@5541
|
8965 |
|
wenzelm@5726
|
8966 |
* Pure: ML function 'theory_of' renamed to 'theory';
|
wenzelm@5397
|
8967 |
|
wenzelm@5363
|
8968 |
|
wenzelm@5127
|
8969 |
*** Proof tools ***
|
nipkow@4880
|
8970 |
|
nipkow@5657
|
8971 |
* Simplifier:
|
nipkow@5657
|
8972 |
1. Asm_full_simp_tac is now more aggressive.
|
nipkow@5657
|
8973 |
1. It will sometimes reorient premises if that increases their power to
|
nipkow@5657
|
8974 |
simplify.
|
nipkow@5657
|
8975 |
2. It does no longer proceed strictly from left to right but may also
|
nipkow@5657
|
8976 |
rotate premises to achieve further simplification.
|
nipkow@5657
|
8977 |
For compatibility reasons there is now Asm_lr_simp_tac which is like the
|
nipkow@5657
|
8978 |
old Asm_full_simp_tac in that it does not rotate premises.
|
nipkow@5657
|
8979 |
2. The simplifier now knows a little bit about nat-arithmetic.
|
nipkow@4880
|
8980 |
|
wenzelm@5127
|
8981 |
* Classical reasoner: wrapper mechanism for the classical reasoner now
|
wenzelm@5127
|
8982 |
allows for selected deletion of wrappers, by introduction of names for
|
wenzelm@5127
|
8983 |
wrapper functionals. This implies that addbefore, addSbefore,
|
wenzelm@5127
|
8984 |
addaltern, and addSaltern now take a pair (name, tactic) as argument,
|
wenzelm@5127
|
8985 |
and that adding two tactics with the same name overwrites the first
|
wenzelm@5127
|
8986 |
one (emitting a warning).
|
oheimb@4824
|
8987 |
type wrapper = (int -> tactic) -> (int -> tactic)
|
oheimb@4649
|
8988 |
setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
|
oheimb@4824
|
8989 |
addWrapper, addSWrapper: claset * (string * wrapper) -> claset
|
oheimb@4824
|
8990 |
delWrapper, delSWrapper: claset * string -> claset
|
oheimb@4649
|
8991 |
getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
|
oheimb@4649
|
8992 |
|
wenzelm@5705
|
8993 |
* Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
|
wenzelm@5726
|
8994 |
semantics; addbefore now affects only the unsafe part of step_tac
|
wenzelm@5726
|
8995 |
etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
|
wenzelm@5726
|
8996 |
FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
|
wenzelm@5726
|
8997 |
by Force_tac;
|
oheimb@5524
|
8998 |
|
wenzelm@5726
|
8999 |
* Classical reasoner: setwrapper to setWrapper and compwrapper to
|
wenzelm@5726
|
9000 |
compWrapper; added safe wrapper (and access functions for it);
|
oheimb@5524
|
9001 |
|
wenzelm@5127
|
9002 |
* HOL/split_all_tac is now much faster and fails if there is nothing
|
wenzelm@5726
|
9003 |
to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
|
wenzelm@5726
|
9004 |
and the names of the automatically generated variables have changed.
|
wenzelm@5726
|
9005 |
split_all_tac has moved within claset() from unsafe wrappers to safe
|
wenzelm@5726
|
9006 |
wrappers, which means that !!-bound variables are split much more
|
wenzelm@5726
|
9007 |
aggressively, and safe_tac and clarify_tac now split such variables.
|
wenzelm@5726
|
9008 |
If this splitting is not appropriate, use delSWrapper "split_all_tac".
|
wenzelm@5726
|
9009 |
Note: the same holds for record_split_tac, which does the job of
|
wenzelm@5726
|
9010 |
split_all_tac for record fields.
|
wenzelm@5127
|
9011 |
|
wenzelm@5726
|
9012 |
* HOL/Simplifier: Rewrite rules for case distinctions can now be added
|
wenzelm@5726
|
9013 |
permanently to the default simpset using Addsplits just like
|
wenzelm@5726
|
9014 |
Addsimps. They can be removed via Delsplits just like
|
wenzelm@5726
|
9015 |
Delsimps. Lower-case versions are also available.
|
wenzelm@5127
|
9016 |
|
wenzelm@5726
|
9017 |
* HOL/Simplifier: The rule split_if is now part of the default
|
wenzelm@5726
|
9018 |
simpset. This means that the simplifier will eliminate all occurrences
|
wenzelm@5726
|
9019 |
of if-then-else in the conclusion of a goal. To prevent this, you can
|
wenzelm@5726
|
9020 |
either remove split_if completely from the default simpset by
|
wenzelm@5726
|
9021 |
`Delsplits [split_if]' or remove it in a specific call of the
|
wenzelm@5726
|
9022 |
simplifier using `... delsplits [split_if]'. You can also add/delete
|
wenzelm@5726
|
9023 |
other case splitting rules to/from the default simpset: every datatype
|
wenzelm@5726
|
9024 |
generates suitable rules `split_t_case' and `split_t_case_asm' (where
|
wenzelm@5726
|
9025 |
t is the name of the datatype).
|
wenzelm@5127
|
9026 |
|
wenzelm@5726
|
9027 |
* Classical reasoner / Simplifier combination: new force_tac (and
|
wenzelm@5127
|
9028 |
derivatives Force_tac, force) combines rewriting and classical
|
wenzelm@5127
|
9029 |
reasoning (and whatever other tools) similarly to auto_tac, but is
|
wenzelm@5726
|
9030 |
aimed to solve the given subgoal completely.
|
wenzelm@5127
|
9031 |
|
wenzelm@5127
|
9032 |
|
wenzelm@5127
|
9033 |
*** General ***
|
wenzelm@5127
|
9034 |
|
wenzelm@5217
|
9035 |
* new top-level commands `Goal' and `Goalw' that improve upon `goal'
|
wenzelm@5127
|
9036 |
and `goalw': the theory is no longer needed as an explicit argument -
|
wenzelm@5127
|
9037 |
the current theory context is used; assumptions are no longer returned
|
wenzelm@5127
|
9038 |
at the ML-level unless one of them starts with ==> or !!; it is
|
wenzelm@5217
|
9039 |
recommended to convert to these new commands using isatool fixgoal
|
wenzelm@5217
|
9040 |
(backup your sources first!);
|
wenzelm@4842
|
9041 |
|
wenzelm@5217
|
9042 |
* new top-level commands 'thm' and 'thms' for retrieving theorems from
|
wenzelm@5207
|
9043 |
the current theory context, and 'theory' to lookup stored theories;
|
paulson@4806
|
9044 |
|
paulson@5722
|
9045 |
* new theory section 'locale' for declaring constants, assumptions and
|
paulson@5722
|
9046 |
definitions that have local scope;
|
paulson@5722
|
9047 |
|
wenzelm@5127
|
9048 |
* new theory section 'nonterminals' for purely syntactic types;
|
wenzelm@4858
|
9049 |
|
wenzelm@5127
|
9050 |
* new theory section 'setup' for generic ML setup functions
|
wenzelm@5127
|
9051 |
(e.g. package initialization);
|
wenzelm@4869
|
9052 |
|
wenzelm@5131
|
9053 |
* the distribution now includes Isabelle icons: see
|
wenzelm@5131
|
9054 |
lib/logo/isabelle-{small,tiny}.xpm;
|
wenzelm@5131
|
9055 |
|
wenzelm@5363
|
9056 |
* isatool install - install binaries with absolute references to
|
wenzelm@5363
|
9057 |
ISABELLE_HOME/bin;
|
wenzelm@5363
|
9058 |
|
wenzelm@5572
|
9059 |
* isatool logo -- create instances of the Isabelle logo (as EPS);
|
wenzelm@5572
|
9060 |
|
wenzelm@5407
|
9061 |
* print mode 'emacs' reserved for Isamode;
|
wenzelm@5407
|
9062 |
|
wenzelm@5726
|
9063 |
* support multiple print (ast) translations per constant name;
|
wenzelm@5726
|
9064 |
|
wenzelm@6925
|
9065 |
* theorems involving oracles are now printed with a suffixed [!];
|
wenzelm@6925
|
9066 |
|
wenzelm@4711
|
9067 |
|
paulson@4661
|
9068 |
*** HOL ***
|
paulson@4661
|
9069 |
|
wenzelm@5710
|
9070 |
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
|
nipkow@5709
|
9071 |
|
wenzelm@5217
|
9072 |
* HOL/inductive package reorganized and improved: now supports mutual
|
paulson@5267
|
9073 |
definitions such as
|
berghofe@5214
|
9074 |
|
wenzelm@5217
|
9075 |
inductive EVEN ODD
|
wenzelm@5217
|
9076 |
intrs
|
wenzelm@5217
|
9077 |
null "0 : EVEN"
|
wenzelm@5217
|
9078 |
oddI "n : EVEN ==> Suc n : ODD"
|
wenzelm@5217
|
9079 |
evenI "n : ODD ==> Suc n : EVEN"
|
berghofe@5214
|
9080 |
|
wenzelm@5217
|
9081 |
new theorem list "elims" contains an elimination rule for each of the
|
wenzelm@5217
|
9082 |
recursive sets; inductive definitions now handle disjunctive premises
|
wenzelm@5217
|
9083 |
correctly (also ZF);
|
berghofe@5214
|
9084 |
|
wenzelm@5217
|
9085 |
INCOMPATIBILITIES: requires Inductive as an ancestor; component
|
wenzelm@5217
|
9086 |
"mutual_induct" no longer exists - the induction rule is always
|
wenzelm@5217
|
9087 |
contained in "induct";
|
berghofe@5214
|
9088 |
|
berghofe@5214
|
9089 |
|
wenzelm@5217
|
9090 |
* HOL/datatype package re-implemented and greatly improved: now
|
paulson@5267
|
9091 |
supports mutually recursive datatypes such as
|
berghofe@5214
|
9092 |
|
wenzelm@5217
|
9093 |
datatype
|
wenzelm@5217
|
9094 |
'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
|
wenzelm@5217
|
9095 |
| SUM ('a aexp) ('a aexp)
|
wenzelm@5217
|
9096 |
| DIFF ('a aexp) ('a aexp)
|
wenzelm@5217
|
9097 |
| NUM 'a
|
wenzelm@5217
|
9098 |
and
|
wenzelm@5217
|
9099 |
'a bexp = LESS ('a aexp) ('a aexp)
|
wenzelm@5217
|
9100 |
| AND ('a bexp) ('a bexp)
|
wenzelm@5217
|
9101 |
| OR ('a bexp) ('a bexp)
|
wenzelm@5217
|
9102 |
|
paulson@5267
|
9103 |
as well as indirectly recursive datatypes such as
|
wenzelm@5217
|
9104 |
|
wenzelm@5217
|
9105 |
datatype
|
wenzelm@5217
|
9106 |
('a, 'b) term = Var 'a
|
wenzelm@5217
|
9107 |
| App 'b ((('a, 'b) term) list)
|
wenzelm@5217
|
9108 |
|
wenzelm@5217
|
9109 |
The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
|
wenzelm@5217
|
9110 |
induction on mutually / indirectly recursive datatypes.
|
wenzelm@5217
|
9111 |
|
wenzelm@5217
|
9112 |
Primrec equations are now stored in theory and can be accessed via
|
wenzelm@5217
|
9113 |
<function_name>.simps.
|
wenzelm@5217
|
9114 |
|
wenzelm@5217
|
9115 |
INCOMPATIBILITIES:
|
wenzelm@5217
|
9116 |
|
wenzelm@5217
|
9117 |
- Theories using datatypes must now have theory Datatype as an
|
wenzelm@5217
|
9118 |
ancestor.
|
wenzelm@5217
|
9119 |
- The specific <typename>.induct_tac no longer exists - use the
|
wenzelm@5217
|
9120 |
generic induct_tac instead.
|
berghofe@5226
|
9121 |
- natE has been renamed to nat.exhaust - use exhaust_tac
|
wenzelm@5217
|
9122 |
instead of res_inst_tac ... natE. Note that the variable
|
berghofe@5226
|
9123 |
names in nat.exhaust differ from the names in natE, this
|
wenzelm@5217
|
9124 |
may cause some "fragile" proofs to fail.
|
wenzelm@5217
|
9125 |
- The theorems split_<typename>_case and split_<typename>_case_asm
|
wenzelm@5217
|
9126 |
have been renamed to <typename>.split and <typename>.split_asm.
|
wenzelm@5217
|
9127 |
- Since default sorts of type variables are now handled correctly,
|
wenzelm@5217
|
9128 |
some datatype definitions may have to be annotated with explicit
|
wenzelm@5217
|
9129 |
sort constraints.
|
wenzelm@5217
|
9130 |
- Primrec definitions no longer require function name and type
|
wenzelm@5217
|
9131 |
of recursive argument.
|
wenzelm@5217
|
9132 |
|
wenzelm@5217
|
9133 |
Consider using isatool fixdatatype to adapt your theories and proof
|
wenzelm@5217
|
9134 |
scripts to the new package (backup your sources first!).
|
wenzelm@5217
|
9135 |
|
wenzelm@5217
|
9136 |
|
wenzelm@5726
|
9137 |
* HOL/record package: considerably improved implementation; now
|
wenzelm@5726
|
9138 |
includes concrete syntax for record types, terms, updates; theorems
|
wenzelm@5726
|
9139 |
for surjective pairing and splitting !!-bound record variables; proof
|
wenzelm@5726
|
9140 |
support is as follows:
|
wenzelm@5726
|
9141 |
|
wenzelm@5726
|
9142 |
1) standard conversions (selectors or updates applied to record
|
wenzelm@5726
|
9143 |
constructor terms) are part of the standard simpset;
|
wenzelm@5726
|
9144 |
|
wenzelm@5726
|
9145 |
2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
|
wenzelm@5726
|
9146 |
made part of standard simpset and claset via addIffs;
|
wenzelm@5726
|
9147 |
|
wenzelm@5726
|
9148 |
3) a tactic for record field splitting (record_split_tac) is part of
|
wenzelm@5726
|
9149 |
the standard claset (addSWrapper);
|
wenzelm@5726
|
9150 |
|
wenzelm@5726
|
9151 |
To get a better idea about these rules you may retrieve them via
|
wenzelm@5726
|
9152 |
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
|
wenzelm@5726
|
9153 |
the name of your record type.
|
wenzelm@5726
|
9154 |
|
wenzelm@5726
|
9155 |
The split tactic 3) conceptually simplifies by the following rule:
|
wenzelm@5726
|
9156 |
|
wenzelm@5726
|
9157 |
"(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
|
wenzelm@5726
|
9158 |
|
wenzelm@5726
|
9159 |
Thus any record variable that is bound by meta-all will automatically
|
wenzelm@5726
|
9160 |
blow up into some record constructor term, consequently the
|
wenzelm@5726
|
9161 |
simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
|
wenzelm@5726
|
9162 |
solve record problems automatically.
|
wenzelm@5726
|
9163 |
|
berghofe@5214
|
9164 |
|
wenzelm@5125
|
9165 |
* reorganized the main HOL image: HOL/Integ and String loaded by
|
wenzelm@5125
|
9166 |
default; theory Main includes everything;
|
wenzelm@5125
|
9167 |
|
paulson@5650
|
9168 |
* automatic simplification of integer sums and comparisons, using cancellation;
|
paulson@5650
|
9169 |
|
oheimb@5526
|
9170 |
* added option_map_eq_Some and not_Some_eq to the default simpset and claset;
|
wenzelm@5125
|
9171 |
|
wenzelm@5127
|
9172 |
* added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
|
wenzelm@5125
|
9173 |
|
wenzelm@5127
|
9174 |
* many new identities for unions, intersections, set difference, etc.;
|
wenzelm@5127
|
9175 |
|
wenzelm@5127
|
9176 |
* expand_if, expand_split, expand_sum_case and expand_nat_case are now
|
wenzelm@5127
|
9177 |
called split_if, split_split, split_sum_case and split_nat_case (to go
|
wenzelm@5127
|
9178 |
with add/delsplits);
|
wenzelm@5127
|
9179 |
|
wenzelm@5127
|
9180 |
* HOL/Prod introduces simplification procedure unit_eq_proc rewriting
|
wenzelm@5127
|
9181 |
(?x::unit) = (); this is made part of the default simpset, which COULD
|
wenzelm@5127
|
9182 |
MAKE EXISTING PROOFS FAIL under rare circumstances (consider
|
wenzelm@5207
|
9183 |
'Delsimprocs [unit_eq_proc];' as last resort); also note that
|
wenzelm@5207
|
9184 |
unit_abs_eta_conv is added in order to counter the effect of
|
wenzelm@5207
|
9185 |
unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
|
wenzelm@5207
|
9186 |
%u.f();
|
wenzelm@5127
|
9187 |
|
wenzelm@5217
|
9188 |
* HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
|
wenzelm@5217
|
9189 |
makes more sense);
|
wenzelm@5127
|
9190 |
|
paulson@5475
|
9191 |
* HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
|
paulson@5475
|
9192 |
It and 'sym RS equals0D' are now in the default claset, giving automatic
|
paulson@5475
|
9193 |
disjointness reasoning but breaking a few old proofs.
|
paulson@5267
|
9194 |
|
wenzelm@5217
|
9195 |
* HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
|
wenzelm@5217
|
9196 |
to 'converse' from 'inverse' (for compatibility with ZF and some
|
wenzelm@5217
|
9197 |
literature);
|
berghofe@5109
|
9198 |
|
wenzelm@5127
|
9199 |
* HOL/recdef can now declare non-recursive functions, with {} supplied as
|
wenzelm@5127
|
9200 |
the well-founded relation;
|
wenzelm@5085
|
9201 |
|
paulson@5490
|
9202 |
* HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
|
paulson@5490
|
9203 |
Compl A. The "Compl" syntax remains available as input syntax for this
|
paulson@5490
|
9204 |
release ONLY.
|
paulson@5490
|
9205 |
|
wenzelm@5127
|
9206 |
* HOL/Update: new theory of function updates:
|
wenzelm@5127
|
9207 |
f(a:=b) == %x. if x=a then b else f x
|
wenzelm@5127
|
9208 |
may also be iterated as in f(a:=b,c:=d,...);
|
oheimb@4824
|
9209 |
|
wenzelm@5127
|
9210 |
* HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
|
paulson@4899
|
9211 |
|
nipkow@5282
|
9212 |
* HOL/List:
|
nipkow@5282
|
9213 |
- new function list_update written xs[i:=v] that updates the i-th
|
nipkow@5282
|
9214 |
list position. May also be iterated as in xs[i:=a,j:=b,...].
|
nipkow@5428
|
9215 |
- new function `upt' written [i..j(] which generates the list
|
nipkow@5428
|
9216 |
[i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
|
nipkow@5428
|
9217 |
bound write [i..j], which is a shorthand for [i..j+1(].
|
nipkow@5282
|
9218 |
- new lexicographic orderings and corresponding wellfoundedness theorems.
|
paulson@4779
|
9219 |
|
wenzelm@5127
|
9220 |
* HOL/Arith:
|
wenzelm@5127
|
9221 |
- removed 'pred' (predecessor) function;
|
wenzelm@5127
|
9222 |
- generalized some theorems about n-1;
|
wenzelm@5127
|
9223 |
- many new laws about "div" and "mod";
|
wenzelm@5127
|
9224 |
- new laws about greatest common divisors (see theory ex/Primes);
|
oheimb@4766
|
9225 |
|
wenzelm@5127
|
9226 |
* HOL/Relation: renamed the relational operator r^-1 "converse"
|
wenzelm@4842
|
9227 |
instead of "inverse";
|
wenzelm@4711
|
9228 |
|
nipkow@5651
|
9229 |
* HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
|
nipkow@5651
|
9230 |
of the multiset ordering;
|
nipkow@5651
|
9231 |
|
wenzelm@5127
|
9232 |
* directory HOL/Real: a construction of the reals using Dedekind cuts
|
nipkow@5651
|
9233 |
(not included by default);
|
paulson@4806
|
9234 |
|
wenzelm@5127
|
9235 |
* directory HOL/UNITY: Chandy and Misra's UNITY formalism;
|
wenzelm@4711
|
9236 |
|
nipkow@5651
|
9237 |
* directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
|
nipkow@5651
|
9238 |
programs, i.e. different program variables may have different types.
|
nipkow@5651
|
9239 |
|
paulson@5142
|
9240 |
* calling (stac rew i) now fails if "rew" has no effect on the goal
|
paulson@5142
|
9241 |
[previously, this check worked only if the rewrite rule was unconditional]
|
paulson@5308
|
9242 |
Now rew can involve either definitions or equalities (either == or =).
|
wenzelm@5002
|
9243 |
|
wenzelm@5363
|
9244 |
|
paulson@4879
|
9245 |
*** ZF ***
|
paulson@4879
|
9246 |
|
paulson@5332
|
9247 |
* theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
|
paulson@5332
|
9248 |
only the theorems proved on ZF.ML;
|
paulson@5160
|
9249 |
|
paulson@5475
|
9250 |
* ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
|
paulson@5475
|
9251 |
It and 'sym RS equals0D' are now in the default claset, giving automatic
|
paulson@5475
|
9252 |
disjointness reasoning but breaking a few old proofs.
|
paulson@5267
|
9253 |
|
paulson@5160
|
9254 |
* ZF/Update: new theory of function updates
|
paulson@5160
|
9255 |
with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
|
paulson@5160
|
9256 |
may also be iterated as in f(a:=b,c:=d,...);
|
paulson@5160
|
9257 |
|
paulson@4879
|
9258 |
* in let x=t in u(x), neither t nor u(x) has to be an FOL term.
|
oheimb@4649
|
9259 |
|
paulson@5142
|
9260 |
* calling (stac rew i) now fails if "rew" has no effect on the goal
|
paulson@5142
|
9261 |
[previously, this check worked only if the rewrite rule was unconditional]
|
paulson@5308
|
9262 |
Now rew can involve either definitions or equalities (either == or =).
|
paulson@5142
|
9263 |
|
paulson@5160
|
9264 |
* case_tac provided for compatibility with HOL
|
paulson@5160
|
9265 |
(like the old excluded_middle_tac, but with subgoals swapped)
|
paulson@5160
|
9266 |
|
wenzelm@4842
|
9267 |
|
wenzelm@5127
|
9268 |
*** Internal programming interfaces ***
|
wenzelm@5002
|
9269 |
|
wenzelm@5251
|
9270 |
* Pure: several new basic modules made available for general use, see
|
wenzelm@5251
|
9271 |
also src/Pure/README;
|
wenzelm@5207
|
9272 |
|
wenzelm@5008
|
9273 |
* improved the theory data mechanism to support encapsulation (data
|
wenzelm@5008
|
9274 |
kind name replaced by private Object.kind, acting as authorization
|
wenzelm@5373
|
9275 |
key); new type-safe user interface via functor TheoryDataFun; generic
|
wenzelm@5373
|
9276 |
print_data function becomes basically useless;
|
wenzelm@5002
|
9277 |
|
wenzelm@5251
|
9278 |
* removed global_names compatibility flag -- all theory declarations
|
wenzelm@5251
|
9279 |
are qualified by default;
|
wenzelm@5251
|
9280 |
|
wenzelm@5085
|
9281 |
* module Pure/Syntax now offers quote / antiquote translation
|
wenzelm@5085
|
9282 |
functions (useful for Hoare logic etc. with implicit dependencies);
|
wenzelm@5373
|
9283 |
see HOL/ex/Antiquote for an example use;
|
wenzelm@5085
|
9284 |
|
wenzelm@5127
|
9285 |
* Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
|
wenzelm@5127
|
9286 |
cterm -> thm;
|
wenzelm@5127
|
9287 |
|
wenzelm@5207
|
9288 |
* new tactical CHANGED_GOAL for checking that a tactic modifies a
|
wenzelm@5207
|
9289 |
subgoal;
|
paulson@5142
|
9290 |
|
wenzelm@5251
|
9291 |
* Display.print_goals function moved to Locale.print_goals;
|
wenzelm@5251
|
9292 |
|
wenzelm@5731
|
9293 |
* standard print function for goals supports current_goals_markers
|
wenzelm@5731
|
9294 |
variable for marking begin of proof, end of proof, start of goal; the
|
wenzelm@5731
|
9295 |
default is ("", "", ""); setting current_goals_markers := ("<proof>",
|
wenzelm@5731
|
9296 |
"</proof>", "<goal>") causes SGML like tagged proof state printing,
|
wenzelm@5731
|
9297 |
for example;
|
wenzelm@5731
|
9298 |
|
wenzelm@5002
|
9299 |
|
wenzelm@5002
|
9300 |
|
wenzelm@4410
|
9301 |
New in Isabelle98 (January 1998)
|
wenzelm@4410
|
9302 |
--------------------------------
|
wenzelm@4410
|
9303 |
|
wenzelm@4410
|
9304 |
*** Overview of INCOMPATIBILITIES (see below for more details) ***
|
wenzelm@4410
|
9305 |
|
wenzelm@4410
|
9306 |
* changed lexical syntax of terms / types: dots made part of long
|
wenzelm@4410
|
9307 |
identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
|
wenzelm@4410
|
9308 |
|
wenzelm@4410
|
9309 |
* simpset (and claset) reference variable replaced by functions
|
wenzelm@4410
|
9310 |
simpset / simpset_ref;
|
wenzelm@4410
|
9311 |
|
wenzelm@4410
|
9312 |
* no longer supports theory aliases (via merge) and non-trivial
|
wenzelm@4410
|
9313 |
implicit merge of thms' signatures;
|
wenzelm@4410
|
9314 |
|
wenzelm@4410
|
9315 |
* most internal names of constants changed due to qualified names;
|
wenzelm@4410
|
9316 |
|
wenzelm@4410
|
9317 |
* changed Pure/Sequence interface (see Pure/seq.ML);
|
wenzelm@4410
|
9318 |
|
wenzelm@3454
|
9319 |
|
paulson@3715
|
9320 |
*** General Changes ***
|
wenzelm@3697
|
9321 |
|
wenzelm@4174
|
9322 |
* hierachically structured name spaces (for consts, types, axms, thms
|
wenzelm@3943
|
9323 |
etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
|
wenzelm@4108
|
9324 |
old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
|
wenzelm@4108
|
9325 |
isatool fixdots ensures space after dots (e.g. "%x. x"); set
|
wenzelm@4174
|
9326 |
long_names for fully qualified output names; NOTE: ML programs
|
wenzelm@4174
|
9327 |
(special tactics, packages etc.) referring to internal names may have
|
wenzelm@4174
|
9328 |
to be adapted to cope with fully qualified names; in case of severe
|
wenzelm@4174
|
9329 |
backward campatibility problems try setting 'global_names' at compile
|
wenzelm@4174
|
9330 |
time to have enrything declared within a flat name space; one may also
|
wenzelm@4174
|
9331 |
fine tune name declarations in theories via the 'global' and 'local'
|
wenzelm@4174
|
9332 |
section;
|
wenzelm@4108
|
9333 |
|
wenzelm@4108
|
9334 |
* reimplemented the implicit simpset and claset using the new anytype
|
wenzelm@4108
|
9335 |
data filed in signatures; references simpset:simpset ref etc. are
|
wenzelm@4108
|
9336 |
replaced by functions simpset:unit->simpset and
|
wenzelm@4108
|
9337 |
simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
|
wenzelm@4108
|
9338 |
to patch your ML files accordingly;
|
paulson@3856
|
9339 |
|
wenzelm@3857
|
9340 |
* HTML output now includes theory graph data for display with Java
|
wenzelm@3857
|
9341 |
applet or isatool browser; data generated automatically via isatool
|
wenzelm@3901
|
9342 |
usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
|
wenzelm@3857
|
9343 |
|
paulson@3856
|
9344 |
* defs may now be conditional; improved rewrite_goals_tac to handle
|
paulson@3856
|
9345 |
conditional equations;
|
paulson@3856
|
9346 |
|
wenzelm@4174
|
9347 |
* defs now admits additional type arguments, using TYPE('a) syntax;
|
wenzelm@4174
|
9348 |
|
wenzelm@3901
|
9349 |
* theory aliases via merge (e.g. M=A+B+C) no longer supported, always
|
wenzelm@3901
|
9350 |
creates a new theory node; implicit merge of thms' signatures is
|
wenzelm@4112
|
9351 |
restricted to 'trivial' ones; COMPATIBILITY: one may have to use
|
wenzelm@3901
|
9352 |
transfer:theory->thm->thm in (rare) cases;
|
wenzelm@3901
|
9353 |
|
wenzelm@3968
|
9354 |
* improved handling of draft signatures / theories; draft thms (and
|
wenzelm@3968
|
9355 |
ctyps, cterms) are automatically promoted to real ones;
|
wenzelm@3968
|
9356 |
|
wenzelm@3901
|
9357 |
* slightly changed interfaces for oracles: admit many per theory, named
|
wenzelm@3901
|
9358 |
(e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
|
wenzelm@3901
|
9359 |
|
wenzelm@3901
|
9360 |
* print_goals: optional output of const types (set show_consts and
|
wenzelm@3901
|
9361 |
show_types);
|
wenzelm@3851
|
9362 |
|
wenzelm@4388
|
9363 |
* improved output of warnings (###) and errors (***);
|
wenzelm@3697
|
9364 |
|
paulson@4178
|
9365 |
* subgoal_tac displays a warning if the new subgoal has type variables;
|
paulson@4178
|
9366 |
|
paulson@3715
|
9367 |
* removed old README and Makefiles;
|
paulson@3715
|
9368 |
|
paulson@3856
|
9369 |
* replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
|
wenzelm@3670
|
9370 |
|
paulson@3715
|
9371 |
* removed obsolete init_pps and init_database;
|
paulson@3715
|
9372 |
|
paulson@3715
|
9373 |
* deleted the obsolete tactical STATE, which was declared by
|
paulson@3715
|
9374 |
fun STATE tacfun st = tacfun st st;
|
paulson@3715
|
9375 |
|
wenzelm@4388
|
9376 |
* cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
|
wenzelm@4388
|
9377 |
(which abbreviates $HOME);
|
wenzelm@4269
|
9378 |
|
wenzelm@4269
|
9379 |
* changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
|
wenzelm@4269
|
9380 |
use isatool fixseq to adapt your ML programs (this works for fully
|
wenzelm@4269
|
9381 |
qualified references to the Sequence structure only!);
|
wenzelm@4269
|
9382 |
|
wenzelm@4381
|
9383 |
* use_thy no longer requires writable current directory; it always
|
wenzelm@4381
|
9384 |
reloads .ML *and* .thy file, if either one is out of date;
|
wenzelm@4269
|
9385 |
|
paulson@3715
|
9386 |
|
paulson@3715
|
9387 |
*** Classical Reasoner ***
|
paulson@3715
|
9388 |
|
wenzelm@3744
|
9389 |
* Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
|
wenzelm@3744
|
9390 |
tactics that use classical reasoning to simplify a subgoal without
|
wenzelm@3744
|
9391 |
splitting it into several subgoals;
|
paulson@3715
|
9392 |
|
paulson@3719
|
9393 |
* Safe_tac: like safe_tac but uses the default claset;
|
paulson@3719
|
9394 |
|
paulson@3715
|
9395 |
|
paulson@3715
|
9396 |
*** Simplifier ***
|
paulson@3715
|
9397 |
|
paulson@3715
|
9398 |
* added simplification meta rules:
|
paulson@3715
|
9399 |
(asm_)(full_)simplify: simpset -> thm -> thm;
|
paulson@3715
|
9400 |
|
paulson@3715
|
9401 |
* simplifier.ML no longer part of Pure -- has to be loaded by object
|
paulson@3715
|
9402 |
logics (again);
|
paulson@3715
|
9403 |
|
paulson@3715
|
9404 |
* added prems argument to simplification procedures;
|
paulson@3715
|
9405 |
|
paulson@4325
|
9406 |
* HOL, FOL, ZF: added infix function `addsplits':
|
paulson@4325
|
9407 |
instead of `<simpset> setloop (split_tac <thms>)'
|
paulson@4325
|
9408 |
you can simply write `<simpset> addsplits <thms>'
|
paulson@4325
|
9409 |
|
paulson@3715
|
9410 |
|
paulson@3715
|
9411 |
*** Syntax ***
|
paulson@3715
|
9412 |
|
wenzelm@4174
|
9413 |
* TYPE('a) syntax for type reflection terms;
|
wenzelm@4174
|
9414 |
|
wenzelm@3985
|
9415 |
* no longer handles consts with name "" -- declare as 'syntax' instead;
|
paulson@3856
|
9416 |
|
paulson@3856
|
9417 |
* pretty printer: changed order of mixfix annotation preference (again!);
|
wenzelm@3846
|
9418 |
|
paulson@3715
|
9419 |
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
|
paulson@3715
|
9420 |
|
paulson@3715
|
9421 |
|
paulson@3715
|
9422 |
*** HOL ***
|
paulson@3715
|
9423 |
|
wenzelm@5726
|
9424 |
* HOL: there is a new splitter `split_asm_tac' that can be used e.g.
|
oheimb@4189
|
9425 |
with `addloop' of the simplifier to faciliate case splitting in premises.
|
oheimb@4189
|
9426 |
|
nipkow@4035
|
9427 |
* HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
|
wenzelm@3985
|
9428 |
|
wenzelm@3985
|
9429 |
* HOL/Auth: new protocol proofs including some for the Internet
|
nipkow@4035
|
9430 |
protocol TLS;
|
wenzelm@3985
|
9431 |
|
wenzelm@4125
|
9432 |
* HOL/Map: new theory of `maps' a la VDM;
|
nipkow@3982
|
9433 |
|
wenzelm@4335
|
9434 |
* HOL/simplifier: simplification procedures nat_cancel_sums for
|
wenzelm@4335
|
9435 |
cancelling out common nat summands from =, <, <= (in)equalities, or
|
wenzelm@4335
|
9436 |
differences; simplification procedures nat_cancel_factor for
|
wenzelm@4335
|
9437 |
cancelling common factor from =, <, <= (in)equalities over natural
|
wenzelm@4373
|
9438 |
sums; nat_cancel contains both kinds of procedures, it is installed by
|
wenzelm@4373
|
9439 |
default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
|
wenzelm@4335
|
9440 |
|
nipkow@3580
|
9441 |
* HOL/simplifier: terms of the form
|
paulson@4325
|
9442 |
`? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
|
nipkow@3580
|
9443 |
are rewritten to
|
nipkow@4035
|
9444 |
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
|
nipkow@4035
|
9445 |
and those of the form
|
paulson@4325
|
9446 |
`! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
|
nipkow@4035
|
9447 |
are rewritten to
|
nipkow@4035
|
9448 |
`P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
|
nipkow@3580
|
9449 |
|
nipkow@4035
|
9450 |
* HOL/datatype
|
nipkow@4035
|
9451 |
Each datatype `t' now comes with a theorem `split_t_case' of the form
|
nipkow@4035
|
9452 |
|
nipkow@4035
|
9453 |
P(t_case f1 ... fn x) =
|
nipkow@4035
|
9454 |
( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
|
nipkow@4035
|
9455 |
...
|
oheimb@4189
|
9456 |
(!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
|
nipkow@4035
|
9457 |
)
|
nipkow@4035
|
9458 |
|
oheimb@4930
|
9459 |
and a theorem `split_t_case_asm' of the form
|
oheimb@4189
|
9460 |
|
oheimb@4189
|
9461 |
P(t_case f1 ... fn x) =
|
oheimb@4189
|
9462 |
~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
|
oheimb@4189
|
9463 |
...
|
oheimb@4189
|
9464 |
(? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
|
oheimb@4189
|
9465 |
)
|
oheimb@4930
|
9466 |
which can be added to a simpset via `addsplits'. The existing theorems
|
oheimb@4930
|
9467 |
expand_list_case and expand_option_case have been renamed to
|
oheimb@4930
|
9468 |
split_list_case and split_option_case.
|
oheimb@4189
|
9469 |
|
nipkow@4361
|
9470 |
* HOL/Arithmetic:
|
nipkow@4361
|
9471 |
- `pred n' is automatically converted to `n-1'.
|
nipkow@4361
|
9472 |
Users are strongly encouraged not to use `pred' any longer,
|
nipkow@4361
|
9473 |
because it will disappear altogether at some point.
|
nipkow@4361
|
9474 |
- Users are strongly encouraged to write "0 < n" rather than
|
nipkow@4361
|
9475 |
"n ~= 0". Theorems and proof tools have been modified towards this
|
nipkow@4361
|
9476 |
`standard'.
|
nipkow@4357
|
9477 |
|
nipkow@4502
|
9478 |
* HOL/Lists:
|
nipkow@4502
|
9479 |
the function "set_of_list" has been renamed "set" (and its theorems too);
|
nipkow@4502
|
9480 |
the function "nth" now takes its arguments in the reverse order and
|
nipkow@4502
|
9481 |
has acquired the infix notation "!" as in "xs!n".
|
paulson@3570
|
9482 |
|
paulson@4154
|
9483 |
* HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
|
paulson@4154
|
9484 |
|
paulson@4154
|
9485 |
* HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
|
paulson@4154
|
9486 |
specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
|
paulson@4154
|
9487 |
|
wenzelm@4575
|
9488 |
* HOL/record: extensible records with schematic structural subtyping
|
wenzelm@4575
|
9489 |
(single inheritance); EXPERIMENTAL version demonstrating the encoding,
|
wenzelm@4575
|
9490 |
still lacks various theorems and concrete record syntax;
|
wenzelm@4575
|
9491 |
|
wenzelm@4125
|
9492 |
|
paulson@3715
|
9493 |
*** HOLCF ***
|
wenzelm@3511
|
9494 |
|
wenzelm@4125
|
9495 |
* removed "axioms" and "generated by" sections;
|
wenzelm@4125
|
9496 |
|
oheimb@4123
|
9497 |
* replaced "ops" section by extended "consts" section, which is capable of
|
wenzelm@4125
|
9498 |
handling the continuous function space "->" directly;
|
wenzelm@4125
|
9499 |
|
wenzelm@4125
|
9500 |
* domain package:
|
wenzelm@4125
|
9501 |
. proves theorems immediately and stores them in the theory,
|
wenzelm@4125
|
9502 |
. creates hierachical name space,
|
wenzelm@4125
|
9503 |
. now uses normal mixfix annotations (instead of cinfix...),
|
wenzelm@4125
|
9504 |
. minor changes to some names and values (for consistency),
|
wenzelm@4125
|
9505 |
. e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
|
wenzelm@4125
|
9506 |
. separator between mutual domain defs: changed "," to "and",
|
wenzelm@4125
|
9507 |
. improved handling of sort constraints; now they have to
|
wenzelm@4125
|
9508 |
appear on the left-hand side of the equations only;
|
oheimb@4123
|
9509 |
|
oheimb@4123
|
9510 |
* fixed LAM <x,y,zs>.b syntax;
|
wenzelm@3535
|
9511 |
|
wenzelm@3744
|
9512 |
* added extended adm_tac to simplifier in HOLCF -- can now discharge
|
wenzelm@3744
|
9513 |
adm (%x. P (t x)), where P is chainfinite and t continuous;
|
wenzelm@3579
|
9514 |
|
wenzelm@3579
|
9515 |
|
paulson@3719
|
9516 |
*** FOL and ZF ***
|
paulson@3719
|
9517 |
|
wenzelm@5726
|
9518 |
* FOL: there is a new splitter `split_asm_tac' that can be used e.g.
|
oheimb@4189
|
9519 |
with `addloop' of the simplifier to faciliate case splitting in premises.
|
oheimb@4189
|
9520 |
|
wenzelm@3744
|
9521 |
* qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
|
wenzelm@3744
|
9522 |
in HOL, they strip ALL and --> from proved theorems;
|
wenzelm@3744
|
9523 |
|
paulson@3719
|
9524 |
|
wenzelm@3579
|
9525 |
|
wenzelm@3006
|
9526 |
New in Isabelle94-8 (May 1997)
|
wenzelm@3006
|
9527 |
------------------------------
|
wenzelm@2654
|
9528 |
|
paulson@3002
|
9529 |
*** General Changes ***
|
paulson@3002
|
9530 |
|
paulson@3002
|
9531 |
* new utilities to build / run / maintain Isabelle etc. (in parts
|
paulson@3002
|
9532 |
still somewhat experimental); old Makefiles etc. still functional;
|
wenzelm@2971
|
9533 |
|
wenzelm@3205
|
9534 |
* new 'Isabelle System Manual';
|
wenzelm@3205
|
9535 |
|
wenzelm@2825
|
9536 |
* INSTALL text, together with ./configure and ./build scripts;
|
wenzelm@2773
|
9537 |
|
wenzelm@3006
|
9538 |
* reimplemented type inference for greater efficiency, better error
|
wenzelm@3006
|
9539 |
messages and clean internal interface;
|
paulson@3002
|
9540 |
|
paulson@3002
|
9541 |
* prlim command for dealing with lots of subgoals (an easier way of
|
paulson@3002
|
9542 |
setting goals_limit);
|
paulson@3002
|
9543 |
|
wenzelm@3006
|
9544 |
|
wenzelm@3006
|
9545 |
*** Syntax ***
|
paulson@3002
|
9546 |
|
wenzelm@3116
|
9547 |
* supports alternative (named) syntax tables (parser and pretty
|
wenzelm@3116
|
9548 |
printer); internal interface is provided by add_modesyntax(_i);
|
wenzelm@3116
|
9549 |
|
paulson@3002
|
9550 |
* Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
|
paulson@3002
|
9551 |
be used in conjunction with the Isabelle symbol font; uses the
|
paulson@3002
|
9552 |
"symbols" syntax table;
|
paulson@3002
|
9553 |
|
wenzelm@2705
|
9554 |
* added token_translation interface (may translate name tokens in
|
wenzelm@2756
|
9555 |
arbitrary ways, dependent on their type (free, bound, tfree, ...) and
|
wenzelm@3116
|
9556 |
the current print_mode); IMPORTANT: user print translation functions
|
wenzelm@3116
|
9557 |
are responsible for marking newly introduced bounds
|
wenzelm@3116
|
9558 |
(Syntax.mark_boundT);
|
wenzelm@2705
|
9559 |
|
wenzelm@2730
|
9560 |
* token translations for modes "xterm" and "xterm_color" that display
|
wenzelm@3006
|
9561 |
names in bold, underline etc. or colors (which requires a color
|
wenzelm@3006
|
9562 |
version of xterm);
|
wenzelm@2730
|
9563 |
|
paulson@3002
|
9564 |
* infixes may now be declared with names independent of their syntax;
|
paulson@3002
|
9565 |
|
paulson@3002
|
9566 |
* added typed_print_translation (like print_translation, but may
|
paulson@3002
|
9567 |
access type of constant);
|
paulson@3002
|
9568 |
|
wenzelm@3006
|
9569 |
|
paulson@3002
|
9570 |
*** Classical Reasoner ***
|
paulson@3002
|
9571 |
|
paulson@3002
|
9572 |
Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
|
paulson@3002
|
9573 |
some limitations. Blast_tac...
|
paulson@3002
|
9574 |
+ ignores addss, addbefore, addafter; this restriction is intrinsic
|
paulson@3002
|
9575 |
+ ignores elimination rules that don't have the correct format
|
wenzelm@5726
|
9576 |
(the conclusion MUST be a formula variable)
|
paulson@3002
|
9577 |
+ ignores types, which can make HOL proofs fail
|
paulson@3002
|
9578 |
+ rules must not require higher-order unification, e.g. apply_type in ZF
|
paulson@3002
|
9579 |
[message "Function Var's argument not a bound variable" relates to this]
|
paulson@3002
|
9580 |
+ its proof strategy is more general but can actually be slower
|
paulson@3002
|
9581 |
|
wenzelm@3107
|
9582 |
* substitution with equality assumptions no longer permutes other
|
wenzelm@3107
|
9583 |
assumptions;
|
paulson@3002
|
9584 |
|
paulson@3002
|
9585 |
* minor changes in semantics of addafter (now called addaltern); renamed
|
paulson@3002
|
9586 |
setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
|
wenzelm@3107
|
9587 |
(and access functions for it);
|
paulson@3002
|
9588 |
|
wenzelm@5726
|
9589 |
* improved combination of classical reasoner and simplifier:
|
oheimb@3317
|
9590 |
+ functions for handling clasimpsets
|
oheimb@3317
|
9591 |
+ improvement of addss: now the simplifier is called _after_ the
|
oheimb@3317
|
9592 |
safe steps.
|
oheimb@3317
|
9593 |
+ safe variant of addss called addSss: uses safe simplifications
|
wenzelm@5726
|
9594 |
_during_ the safe steps. It is more complete as it allows multiple
|
oheimb@3317
|
9595 |
instantiations of unknowns (e.g. with slow_tac).
|
wenzelm@3006
|
9596 |
|
paulson@3002
|
9597 |
*** Simplifier ***
|
paulson@3002
|
9598 |
|
wenzelm@3006
|
9599 |
* added interface for simplification procedures (functions that
|
wenzelm@3006
|
9600 |
produce *proven* rewrite rules on the fly, depending on current
|
wenzelm@3006
|
9601 |
redex);
|
wenzelm@3006
|
9602 |
|
wenzelm@3006
|
9603 |
* ordering on terms as parameter (used for ordered rewriting);
|
wenzelm@3006
|
9604 |
|
wenzelm@3107
|
9605 |
* new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
|
paulson@3002
|
9606 |
|
paulson@3002
|
9607 |
* the solver is now split into a safe and an unsafe part.
|
paulson@3002
|
9608 |
This should be invisible for the normal user, except that the
|
paulson@3002
|
9609 |
functions setsolver and addsolver have been renamed to setSolver and
|
wenzelm@3107
|
9610 |
addSolver; added safe_asm_full_simp_tac;
|
paulson@3002
|
9611 |
|
paulson@3002
|
9612 |
|
paulson@3002
|
9613 |
*** HOL ***
|
paulson@3002
|
9614 |
|
nipkow@3042
|
9615 |
* a generic induction tactic `induct_tac' which works for all datatypes and
|
wenzelm@3107
|
9616 |
also for type `nat';
|
nipkow@3042
|
9617 |
|
nipkow@3316
|
9618 |
* a generic case distinction tactic `exhaust_tac' which works for all
|
nipkow@3316
|
9619 |
datatypes and also for type `nat';
|
nipkow@3316
|
9620 |
|
nipkow@3316
|
9621 |
* each datatype comes with a function `size';
|
nipkow@3316
|
9622 |
|
paulson@3002
|
9623 |
* patterns in case expressions allow tuple patterns as arguments to
|
wenzelm@3107
|
9624 |
constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
|
paulson@3002
|
9625 |
|
paulson@3002
|
9626 |
* primrec now also works with type nat;
|
paulson@3002
|
9627 |
|
paulson@3338
|
9628 |
* recdef: a new declaration form, allows general recursive functions to be
|
paulson@3338
|
9629 |
defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
|
paulson@3338
|
9630 |
|
paulson@3002
|
9631 |
* the constant for negation has been renamed from "not" to "Not" to
|
wenzelm@3107
|
9632 |
harmonize with FOL, ZF, LK, etc.;
|
paulson@3002
|
9633 |
|
wenzelm@3107
|
9634 |
* HOL/ex/LFilter theory of a corecursive "filter" functional for
|
wenzelm@3107
|
9635 |
infinite lists;
|
paulson@3002
|
9636 |
|
wenzelm@3227
|
9637 |
* HOL/Modelcheck demonstrates invocation of model checker oracle;
|
wenzelm@3227
|
9638 |
|
paulson@3002
|
9639 |
* HOL/ex/Ring.thy declares cring_simp, which solves equational
|
paulson@3002
|
9640 |
problems in commutative rings, using axiomatic type classes for + and *;
|
paulson@3002
|
9641 |
|
paulson@3002
|
9642 |
* more examples in HOL/MiniML and HOL/Auth;
|
paulson@3002
|
9643 |
|
paulson@3002
|
9644 |
* more default rewrite rules for quantifiers, union/intersection;
|
paulson@3002
|
9645 |
|
nipkow@3321
|
9646 |
* a new constant `arbitrary == @x.False';
|
nipkow@3321
|
9647 |
|
wenzelm@3107
|
9648 |
* HOLCF/IOA replaces old HOL/IOA;
|
wenzelm@3107
|
9649 |
|
wenzelm@5726
|
9650 |
* HOLCF changes: derived all rules and arities
|
wenzelm@5726
|
9651 |
+ axiomatic type classes instead of classes
|
slotosch@2653
|
9652 |
+ typedef instead of faking type definitions
|
paulson@2747
|
9653 |
+ eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
|
wenzelm@2730
|
9654 |
+ new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
|
slotosch@2653
|
9655 |
+ eliminated the types void, one, tr
|
slotosch@2653
|
9656 |
+ use unit lift and bool lift (with translations) instead of one and tr
|
slotosch@2653
|
9657 |
+ eliminated blift from Lift3.thy (use Def instead of blift)
|
wenzelm@3107
|
9658 |
all eliminated rules are derived as theorems --> no visible changes ;
|
oheimb@2649
|
9659 |
|
wenzelm@3006
|
9660 |
|
paulson@3002
|
9661 |
*** ZF ***
|
wenzelm@2553
|
9662 |
|
paulson@2865
|
9663 |
* ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
|
paulson@2865
|
9664 |
rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
|
paulson@2865
|
9665 |
as ZF_cs addSIs [equalityI];
|
wenzelm@2553
|
9666 |
|
wenzelm@2554
|
9667 |
|
wenzelm@2732
|
9668 |
|
wenzelm@2553
|
9669 |
New in Isabelle94-7 (November 96)
|
wenzelm@2553
|
9670 |
---------------------------------
|
wenzelm@2553
|
9671 |
|
wenzelm@2553
|
9672 |
* allowing negative levels (as offsets) in prlev and choplev;
|
wenzelm@2553
|
9673 |
|
wenzelm@2554
|
9674 |
* super-linear speedup for large simplifications;
|
wenzelm@2554
|
9675 |
|
wenzelm@2554
|
9676 |
* FOL, ZF and HOL now use miniscoping: rewriting pushes
|
wenzelm@2554
|
9677 |
quantifications in as far as possible (COULD MAKE EXISTING PROOFS
|
wenzelm@2554
|
9678 |
FAIL); can suppress it using the command Delsimps (ex_simps @
|
wenzelm@2554
|
9679 |
all_simps); De Morgan laws are also now included, by default;
|
wenzelm@2554
|
9680 |
|
wenzelm@2554
|
9681 |
* improved printing of ==> : ~:
|
wenzelm@2554
|
9682 |
|
wenzelm@2554
|
9683 |
* new object-logic "Sequents" adds linear logic, while replacing LK
|
wenzelm@2554
|
9684 |
and Modal (thanks to Sara Kalvala);
|
wenzelm@2554
|
9685 |
|
wenzelm@2554
|
9686 |
* HOL/Auth: correctness proofs for authentication protocols;
|
wenzelm@2554
|
9687 |
|
wenzelm@2554
|
9688 |
* HOL: new auto_tac combines rewriting and classical reasoning (many
|
wenzelm@2554
|
9689 |
examples on HOL/Auth);
|
wenzelm@2554
|
9690 |
|
wenzelm@2554
|
9691 |
* HOL: new command AddIffs for declaring theorems of the form P=Q to
|
wenzelm@2554
|
9692 |
the rewriter and classical reasoner simultaneously;
|
wenzelm@2554
|
9693 |
|
wenzelm@2554
|
9694 |
* function uresult no longer returns theorems in "standard" format;
|
wenzelm@2554
|
9695 |
regain previous version by: val uresult = standard o uresult;
|
wenzelm@2554
|
9696 |
|
wenzelm@2554
|
9697 |
|
wenzelm@2554
|
9698 |
|
wenzelm@2554
|
9699 |
New in Isabelle94-6
|
wenzelm@2554
|
9700 |
-------------------
|
wenzelm@2554
|
9701 |
|
wenzelm@2554
|
9702 |
* oracles -- these establish an interface between Isabelle and trusted
|
wenzelm@2554
|
9703 |
external reasoners, which may deliver results as theorems;
|
wenzelm@2554
|
9704 |
|
wenzelm@2554
|
9705 |
* proof objects (in particular record all uses of oracles);
|
wenzelm@2554
|
9706 |
|
wenzelm@2554
|
9707 |
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
|
wenzelm@2554
|
9708 |
|
wenzelm@2554
|
9709 |
* "constdefs" section in theory files;
|
wenzelm@2554
|
9710 |
|
wenzelm@2554
|
9711 |
* "primrec" section (HOL) no longer requires names;
|
wenzelm@2554
|
9712 |
|
wenzelm@2554
|
9713 |
* internal type "tactic" now simply "thm -> thm Sequence.seq";
|
wenzelm@2554
|
9714 |
|
wenzelm@2554
|
9715 |
|
wenzelm@2554
|
9716 |
|
wenzelm@2554
|
9717 |
New in Isabelle94-5
|
wenzelm@2554
|
9718 |
-------------------
|
wenzelm@2554
|
9719 |
|
wenzelm@2554
|
9720 |
* reduced space requirements;
|
wenzelm@2554
|
9721 |
|
wenzelm@2554
|
9722 |
* automatic HTML generation from theories;
|
wenzelm@2554
|
9723 |
|
wenzelm@2554
|
9724 |
* theory files no longer require "..." (quotes) around most types;
|
wenzelm@2554
|
9725 |
|
wenzelm@2554
|
9726 |
* new examples, including two proofs of the Church-Rosser theorem;
|
wenzelm@2554
|
9727 |
|
wenzelm@2554
|
9728 |
* non-curried (1994) version of HOL is no longer distributed;
|
wenzelm@2554
|
9729 |
|
wenzelm@2553
|
9730 |
|
paulson@2557
|
9731 |
|
paulson@2557
|
9732 |
New in Isabelle94-4
|
paulson@2557
|
9733 |
-------------------
|
paulson@2557
|
9734 |
|
paulson@2747
|
9735 |
* greatly reduced space requirements;
|
paulson@2557
|
9736 |
|
paulson@2557
|
9737 |
* theory files (.thy) no longer require \...\ escapes at line breaks;
|
paulson@2557
|
9738 |
|
wenzelm@5726
|
9739 |
* searchable theorem database (see the section "Retrieving theorems" on
|
paulson@2557
|
9740 |
page 8 of the Reference Manual);
|
paulson@2557
|
9741 |
|
paulson@2557
|
9742 |
* new examples, including Grabczewski's monumental case study of the
|
paulson@2557
|
9743 |
Axiom of Choice;
|
paulson@2557
|
9744 |
|
paulson@2557
|
9745 |
* The previous version of HOL renamed to Old_HOL;
|
paulson@2557
|
9746 |
|
wenzelm@5726
|
9747 |
* The new version of HOL (previously called CHOL) uses a curried syntax
|
paulson@2557
|
9748 |
for functions. Application looks like f a b instead of f(a,b);
|
paulson@2557
|
9749 |
|
paulson@2557
|
9750 |
* Mutually recursive inductive definitions finally work in HOL;
|
paulson@2557
|
9751 |
|
paulson@2557
|
9752 |
* In ZF, pattern-matching on tuples is now available in all abstractions and
|
paulson@2557
|
9753 |
translates to the operator "split";
|
paulson@2557
|
9754 |
|
paulson@2557
|
9755 |
|
paulson@2557
|
9756 |
|
paulson@2557
|
9757 |
New in Isabelle94-3
|
paulson@2557
|
9758 |
-------------------
|
paulson@2557
|
9759 |
|
wenzelm@5726
|
9760 |
* new infix operator, addss, allowing the classical reasoner to
|
paulson@2557
|
9761 |
perform simplification at each step of its search. Example:
|
wenzelm@5726
|
9762 |
fast_tac (cs addss ss)
|
paulson@2557
|
9763 |
|
wenzelm@5726
|
9764 |
* a new logic, CHOL, the same as HOL, but with a curried syntax
|
wenzelm@5726
|
9765 |
for functions. Application looks like f a b instead of f(a,b). Also pairs
|
paulson@2557
|
9766 |
look like (a,b) instead of <a,b>;
|
paulson@2557
|
9767 |
|
paulson@2557
|
9768 |
* PLEASE NOTE: CHOL will eventually replace HOL!
|
paulson@2557
|
9769 |
|
paulson@2557
|
9770 |
* In CHOL, pattern-matching on tuples is now available in all abstractions.
|
paulson@2557
|
9771 |
It translates to the operator "split". A new theory of integers is available;
|
paulson@2557
|
9772 |
|
paulson@2557
|
9773 |
* In ZF, integer numerals now denote two's-complement binary integers.
|
paulson@2557
|
9774 |
Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
|
paulson@2557
|
9775 |
|
wenzelm@5726
|
9776 |
* Many new examples: I/O automata, Church-Rosser theorem, equivalents
|
paulson@2557
|
9777 |
of the Axiom of Choice;
|
paulson@2557
|
9778 |
|
paulson@2557
|
9779 |
|
paulson@2557
|
9780 |
|
paulson@2557
|
9781 |
New in Isabelle94-2
|
paulson@2557
|
9782 |
-------------------
|
paulson@2557
|
9783 |
|
wenzelm@5726
|
9784 |
* Significantly faster resolution;
|
paulson@2557
|
9785 |
|
paulson@2557
|
9786 |
* the different sections in a .thy file can now be mixed and repeated
|
paulson@2557
|
9787 |
freely;
|
paulson@2557
|
9788 |
|
paulson@2557
|
9789 |
* Database of theorems for FOL, HOL and ZF. New
|
paulson@2557
|
9790 |
commands including qed, qed_goal and bind_thm store theorems in the database.
|
paulson@2557
|
9791 |
|
paulson@2557
|
9792 |
* Simple database queries: return a named theorem (get_thm) or all theorems of
|
paulson@2557
|
9793 |
a given theory (thms_of), or find out what theory a theorem was proved in
|
paulson@2557
|
9794 |
(theory_of_thm);
|
paulson@2557
|
9795 |
|
paulson@2557
|
9796 |
* Bugs fixed in the inductive definition and datatype packages;
|
paulson@2557
|
9797 |
|
paulson@2557
|
9798 |
* The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
|
paulson@2557
|
9799 |
and HOL_dup_cs obsolete;
|
paulson@2557
|
9800 |
|
paulson@2557
|
9801 |
* Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
|
paulson@2557
|
9802 |
have been removed;
|
paulson@2557
|
9803 |
|
paulson@2557
|
9804 |
* Simpler definition of function space in ZF;
|
paulson@2557
|
9805 |
|
paulson@2557
|
9806 |
* new results about cardinal and ordinal arithmetic in ZF;
|
paulson@2557
|
9807 |
|
paulson@2557
|
9808 |
* 'subtype' facility in HOL for introducing new types as subsets of existing
|
paulson@2557
|
9809 |
types;
|
paulson@2557
|
9810 |
|
wenzelm@24213
|
9811 |
:mode=text:wrap=hard:maxLineLen=72:
|