author | wenzelm |
Tue, 08 Sep 2015 17:34:46 +0200 | |
changeset 61135 | 8f7d802b7a71 |
parent 61134 | 80ac5e17772d |
child 61143 | 5f898411ce87 |
permissions | -rw-r--r-- |
57491 | 1 |
Isabelle NEWS -- history of user-relevant changes |
2 |
================================================= |
|
2553 | 3 |
|
60006 | 4 |
(Note: Isabelle/jEdit shows a tree-view of this file in Sidekick.) |
5 |
||
60331 | 6 |
|
60138 | 7 |
New in this Isabelle version |
8 |
---------------------------- |
|
9 |
||
60610
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
60595
diff
changeset
|
10 |
*** Prover IDE -- Isabelle/Scala/jEdit *** |
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
60595
diff
changeset
|
11 |
|
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
60595
diff
changeset
|
12 |
* Improved scheduling for urgent print tasks (e.g. command state output, |
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
60595
diff
changeset
|
13 |
interactive queries) wrt. long-running background tasks. |
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
60595
diff
changeset
|
14 |
|
60986 | 15 |
* IDE support for the source-level debugger of Poly/ML, to work with |
60984 | 16 |
Isabelle/ML and official Standard ML. Configuration option "ML_debugger" |
17 |
and commands 'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug', |
|
18 |
'SML_file_no_debug' control compilation of sources with debugging |
|
19 |
information. The Debugger panel allows to set breakpoints (via context |
|
20 |
menu), step through stopped threads, evaluate local ML expressions etc. |
|
21 |
At least one Debugger view needs to be active to have any effect on the |
|
22 |
running ML program. |
|
23 |
||
60610
f52b4b0c10c4
improved scheduling for urgent tasks, using farm of replacement threads (may lead to factor 2 overloading, but CPUs are usually hyperthreaded);
wenzelm
parents:
60595
diff
changeset
|
24 |
|
60406 | 25 |
*** Isar *** |
26 |
||
27 |
* Command 'obtain' binds term abbreviations (via 'is' patterns) in the |
|
28 |
proof body as well, abstracted over relevant parameters. |
|
29 |
||
60477
051b200f7578
improved treatment of Element.Obtains via Expression.prepare_stmt;
wenzelm
parents:
60460
diff
changeset
|
30 |
* Improved type-inference for theorem statement 'obtains': separate |
051b200f7578
improved treatment of Element.Obtains via Expression.prepare_stmt;
wenzelm
parents:
60460
diff
changeset
|
31 |
parameter scope for of each clause. |
051b200f7578
improved treatment of Element.Obtains via Expression.prepare_stmt;
wenzelm
parents:
60460
diff
changeset
|
32 |
|
60408
1fd46ced2fa8
more uniform treatment of auto bindings vs. explicit user bindings;
wenzelm
parents:
60406
diff
changeset
|
33 |
* Term abbreviations via 'is' patterns also work for schematic |
1fd46ced2fa8
more uniform treatment of auto bindings vs. explicit user bindings;
wenzelm
parents:
60406
diff
changeset
|
34 |
statements: result is abstracted over unknowns. |
1fd46ced2fa8
more uniform treatment of auto bindings vs. explicit user bindings;
wenzelm
parents:
60406
diff
changeset
|
35 |
|
60414 | 36 |
* Local goals ('have', 'show', 'hence', 'thus') allow structured |
37 |
statements like fixes/assumes/shows in theorem specifications, but the |
|
60555
51a6997b1384
support 'when' statement, which corresponds to 'presume';
wenzelm
parents:
60554
diff
changeset
|
38 |
notation is postfix with keywords 'if' (or 'when') and 'for'. For |
51a6997b1384
support 'when' statement, which corresponds to 'presume';
wenzelm
parents:
60554
diff
changeset
|
39 |
example: |
60414 | 40 |
|
41 |
have result: "C x y" |
|
42 |
if "A x" and "B y" |
|
43 |
for x :: 'a and y :: 'a |
|
44 |
<proof> |
|
45 |
||
60449 | 46 |
The local assumptions are bound to the name "that". The result is |
47 |
exported from context of the statement as usual. The above roughly |
|
60414 | 48 |
corresponds to a raw proof block like this: |
49 |
||
50 |
{ |
|
51 |
fix x :: 'a and y :: 'a |
|
60449 | 52 |
assume that: "A x" "B y" |
60414 | 53 |
have "C x y" <proof> |
54 |
} |
|
55 |
note result = this |
|
60406 | 56 |
|
60555
51a6997b1384
support 'when' statement, which corresponds to 'presume';
wenzelm
parents:
60554
diff
changeset
|
57 |
The keyword 'when' may be used instead of 'if', to indicate 'presume' |
51a6997b1384
support 'when' statement, which corresponds to 'presume';
wenzelm
parents:
60554
diff
changeset
|
58 |
instead of 'assume' above. |
51a6997b1384
support 'when' statement, which corresponds to 'presume';
wenzelm
parents:
60554
diff
changeset
|
59 |
|
60595 | 60 |
* The meaning of 'show' with Pure rule statements has changed: premises |
61 |
are treated in the sense of 'assume', instead of 'presume'. This means, |
|
62 |
a goal like "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x" can be solved completely as follows: |
|
63 |
||
64 |
show "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x" |
|
65 |
||
66 |
or: |
|
67 |
||
68 |
show "C x" if "A x" "B x" for x |
|
69 |
||
70 |
Rare INCOMPATIBILITY, the old behaviour may be recovered as follows: |
|
71 |
||
72 |
show "C x" when "A x" "B x" for x |
|
73 |
||
60406 | 74 |
* New command 'supply' supports fact definitions during goal refinement |
75 |
('apply' scripts). |
|
76 |
||
60459 | 77 |
* New command 'consider' states rules for generalized elimination and |
78 |
case splitting. This is like a toplevel statement "theorem obtains" used |
|
79 |
within a proof body; or like a multi-branch 'obtain' without activation |
|
80 |
of the local context elements yet. |
|
81 |
||
60455 | 82 |
* Proof method "cases" allows to specify the rule as first entry of |
83 |
chained facts. This is particularly useful with 'consider': |
|
84 |
||
85 |
consider (a) A | (b) B | (c) C <proof> |
|
86 |
then have something |
|
87 |
proof cases |
|
88 |
case a |
|
89 |
then show ?thesis <proof> |
|
90 |
next |
|
91 |
case b |
|
92 |
then show ?thesis <proof> |
|
93 |
next |
|
94 |
case c |
|
95 |
then show ?thesis <proof> |
|
96 |
qed |
|
97 |
||
60565 | 98 |
* Command 'case' allows fact name and attribute specification like this: |
99 |
||
100 |
case a: (c xs) |
|
101 |
case a [attributes]: (c xs) |
|
102 |
||
103 |
Facts that are introduced by invoking the case context are uniformly |
|
104 |
qualified by "a"; the same name is used for the cumulative fact. The old |
|
105 |
form "case (c xs) [attributes]" is no longer supported. Rare |
|
106 |
INCOMPATIBILITY, need to adapt uses of case facts in exotic situations, |
|
107 |
and always put attributes in front. |
|
108 |
||
60618
4c79543cc376
renamed "default" to "standard", to make semantically clear what it is;
wenzelm
parents:
60617
diff
changeset
|
109 |
* The standard proof method of commands 'proof' and '..' is now called |
4c79543cc376
renamed "default" to "standard", to make semantically clear what it is;
wenzelm
parents:
60617
diff
changeset
|
110 |
"standard" to make semantically clear what it is; the old name "default" |
4c79543cc376
renamed "default" to "standard", to make semantically clear what it is;
wenzelm
parents:
60617
diff
changeset
|
111 |
is still available as legacy for some time. Documentation now explains |
4c79543cc376
renamed "default" to "standard", to make semantically clear what it is;
wenzelm
parents:
60617
diff
changeset
|
112 |
'..' more accurately as "by standard" instead of "by rule". |
4c79543cc376
renamed "default" to "standard", to make semantically clear what it is;
wenzelm
parents:
60617
diff
changeset
|
113 |
|
60631 | 114 |
* Command 'subgoal' allows to impose some structure on backward |
115 |
refinements, to avoid proof scripts degenerating into long of 'apply' |
|
116 |
sequences. Further explanations and examples are given in the isar-ref |
|
117 |
manual. |
|
118 |
||
60578 | 119 |
* Proof method "goals" turns the current subgoals into cases within the |
120 |
context; the conclusion is bound to variable ?case in each case. |
|
60617 | 121 |
For example: |
122 |
||
123 |
lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x" |
|
60622 | 124 |
and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z" |
125 |
proof goals |
|
126 |
case (1 x) |
|
127 |
then show ?case using \<open>A x\<close> \<open>B x\<close> sorry |
|
128 |
next |
|
129 |
case (2 y z) |
|
130 |
then show ?case using \<open>U y\<close> \<open>V z\<close> sorry |
|
131 |
qed |
|
132 |
||
133 |
lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x" |
|
134 |
and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z" |
|
60617 | 135 |
proof goals |
136 |
case prems: 1 |
|
137 |
then show ?case using prems sorry |
|
138 |
next |
|
139 |
case prems: 2 |
|
140 |
then show ?case using prems sorry |
|
141 |
qed |
|
60578 | 142 |
|
60581 | 143 |
* The undocumented feature of implicit cases goal1, goal2, goal3, etc. |
60617 | 144 |
is marked as legacy, and will be removed eventually. The proof method |
145 |
"goals" achieves a similar effect within regular Isar; often it can be |
|
146 |
done more adequately by other means (e.g. 'consider'). |
|
60581 | 147 |
|
60551 | 148 |
* Nesting of Isar goal structure has been clarified: the context after |
149 |
the initial backwards refinement is retained for the whole proof, within |
|
150 |
all its context sections (as indicated via 'next'). This is e.g. |
|
151 |
relevant for 'using', 'including', 'supply': |
|
152 |
||
153 |
have "A \<and> A" if a: A for A |
|
154 |
supply [simp] = a |
|
155 |
proof |
|
156 |
show A by simp |
|
157 |
next |
|
158 |
show A by simp |
|
159 |
qed |
|
160 |
||
60554 | 161 |
* Method "sleep" succeeds after a real-time delay (in seconds). This is |
162 |
occasionally useful for demonstration and testing purposes. |
|
163 |
||
60406 | 164 |
|
60331 | 165 |
*** Pure *** |
166 |
||
60489 | 167 |
* The vacuous fact "TERM x" may be established "by fact" or as `TERM x` |
168 |
as well, not just "by this" or "." as before. |
|
169 |
||
60331 | 170 |
* Configuration option rule_insts_schematic has been discontinued |
171 |
(intermediate legacy feature in Isabelle2015). INCOMPATIBILITY. |
|
172 |
||
60347 | 173 |
* Abbreviations in type classes now carry proper sort constraint. |
174 |
Rare INCOMPATIBILITY in situations where the previous misbehaviour |
|
175 |
has been exploited previously. |
|
176 |
||
177 |
* Refinement of user-space type system in type classes: pseudo-local |
|
178 |
operations behave more similar to abbreviations. Potential |
|
179 |
INCOMPATIBILITY in exotic situations. |
|
180 |
||
181 |
||
60171 | 182 |
*** HOL *** |
183 |
||
61118 | 184 |
* Qualification of various formal entities in the libraries is done more |
185 |
uniformly via "context begin qualified definition ... end" instead of |
|
186 |
old-style "hide_const (open) ...". Consequently, both the defined |
|
187 |
constant and its defining fact become qualified, e.g. Option.is_none and |
|
188 |
Option.is_none_def. Occasional INCOMPATIBILITY in applications. |
|
189 |
||
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61121
diff
changeset
|
190 |
* Combinator to represent case distinction on products is named "uncurry", |
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61121
diff
changeset
|
191 |
with "split" and "prod_case" retained as input abbreviations. |
61126
e6b1236f9b3d
obsolete: if case_prod is fully applied, it is printed as proper case expression;
haftmann
parents:
61125
diff
changeset
|
192 |
Partially applied occurences of "uncurry" with eta-contracted body |
e6b1236f9b3d
obsolete: if case_prod is fully applied, it is printed as proper case expression;
haftmann
parents:
61125
diff
changeset
|
193 |
terms are not printed with special syntax, to provide a compact |
e6b1236f9b3d
obsolete: if case_prod is fully applied, it is printed as proper case expression;
haftmann
parents:
61125
diff
changeset
|
194 |
notation and getting rid of a special-case print translation. |
e6b1236f9b3d
obsolete: if case_prod is fully applied, it is printed as proper case expression;
haftmann
parents:
61125
diff
changeset
|
195 |
Hence, the "uncurry"-expressions are printed the following way: |
e6b1236f9b3d
obsolete: if case_prod is fully applied, it is printed as proper case expression;
haftmann
parents:
61125
diff
changeset
|
196 |
a) fully applied "uncurry f p": explicit case-expression; |
e6b1236f9b3d
obsolete: if case_prod is fully applied, it is printed as proper case expression;
haftmann
parents:
61125
diff
changeset
|
197 |
b) partially applied with explicit double lambda abstraction in |
e6b1236f9b3d
obsolete: if case_prod is fully applied, it is printed as proper case expression;
haftmann
parents:
61125
diff
changeset
|
198 |
the body term "uncurry (%a b. t [a, b])": explicit paired abstraction; |
e6b1236f9b3d
obsolete: if case_prod is fully applied, it is printed as proper case expression;
haftmann
parents:
61125
diff
changeset
|
199 |
c) partially applied with eta-contracted body term "uncurry f": |
e6b1236f9b3d
obsolete: if case_prod is fully applied, it is printed as proper case expression;
haftmann
parents:
61125
diff
changeset
|
200 |
no special syntax, plain "uncurry" combinator. |
e6b1236f9b3d
obsolete: if case_prod is fully applied, it is printed as proper case expression;
haftmann
parents:
61125
diff
changeset
|
201 |
This aims for maximum readability in a given subterm. |
61125
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61121
diff
changeset
|
202 |
INCOMPATIBILITY. |
4c68426800de
prefer "uncurry" as canonical name for case distinction on products in combinatorial view
haftmann
parents:
61121
diff
changeset
|
203 |
|
61069 | 204 |
* Some old and rarely used ASCII replacement syntax has been removed. |
205 |
INCOMPATIBILITY, standard syntax with symbols should be used instead. |
|
206 |
The subsequent commands help to reproduce the old forms, e.g. to |
|
207 |
simplify porting old theories: |
|
208 |
||
209 |
type_notation Map.map (infixr "~=>" 0) |
|
210 |
notation Map.map_comp (infixl "o'_m" 55) |
|
211 |
||
61126
e6b1236f9b3d
obsolete: if case_prod is fully applied, it is printed as proper case expression;
haftmann
parents:
61125
diff
changeset
|
212 |
* Case combinator "prod_case" with eta-contracted body functions |
e6b1236f9b3d
obsolete: if case_prod is fully applied, it is printed as proper case expression;
haftmann
parents:
61125
diff
changeset
|
213 |
has explicit "uncurry" notation, to provide a compact notation while |
e6b1236f9b3d
obsolete: if case_prod is fully applied, it is printed as proper case expression;
haftmann
parents:
61125
diff
changeset
|
214 |
getting ride of a special case translation. Slight syntactic |
e6b1236f9b3d
obsolete: if case_prod is fully applied, it is printed as proper case expression;
haftmann
parents:
61125
diff
changeset
|
215 |
INCOMPATIBILITY. |
e6b1236f9b3d
obsolete: if case_prod is fully applied, it is printed as proper case expression;
haftmann
parents:
61125
diff
changeset
|
216 |
|
60841 | 217 |
* Theory Map: lemma map_of_is_SomeD was a clone of map_of_SomeD and has |
218 |
been removed. INCOMPATIBILITY. |
|
219 |
||
60712
3ba16d28449d
Quickcheck setup for finite sets
Lars Hupel <lars.hupel@mytum.de>
parents:
60707
diff
changeset
|
220 |
* Quickcheck setup for finite sets. |
3ba16d28449d
Quickcheck setup for finite sets
Lars Hupel <lars.hupel@mytum.de>
parents:
60707
diff
changeset
|
221 |
|
60171 | 222 |
* Discontinued simp_legacy_precond. Potential INCOMPATIBILITY. |
60138 | 223 |
|
60306
6b7c64ab8bd2
made Auto Sledgehammer behave more like the real thing
blanchet
parents:
60301
diff
changeset
|
224 |
* Sledgehammer: |
6b7c64ab8bd2
made Auto Sledgehammer behave more like the real thing
blanchet
parents:
60301
diff
changeset
|
225 |
- Proof reconstruction has been improved, to minimize the incidence of |
6b7c64ab8bd2
made Auto Sledgehammer behave more like the real thing
blanchet
parents:
60301
diff
changeset
|
226 |
cases where Sledgehammer gives a proof that does not work. |
6b7c64ab8bd2
made Auto Sledgehammer behave more like the real thing
blanchet
parents:
60301
diff
changeset
|
227 |
- Auto Sledgehammer now minimizes and preplays the results. |
61030 | 228 |
- Handle Vampire 4.0 proof output without raising exception. |
61043 | 229 |
- Eliminated "MASH" environment variable. Use the "MaSh" option in |
230 |
Isabelle/jEdit instead. INCOMPATIBILITY. |
|
60306
6b7c64ab8bd2
made Auto Sledgehammer behave more like the real thing
blanchet
parents:
60301
diff
changeset
|
231 |
|
60310 | 232 |
* Nitpick: |
233 |
- Removed "check_potential" and "check_genuine" options. |
|
234 |
||
60922 | 235 |
* New commands lift_bnf and copy_bnf for lifting (copying) a BNF structure |
236 |
on the raw type to an abstract type defined using typedef. |
|
60920 | 237 |
|
60868
dd18c33c001e
direct bootstrap of integer division from natural division
haftmann
parents:
60841
diff
changeset
|
238 |
* Division on integers is bootstrapped directly from division on |
dd18c33c001e
direct bootstrap of integer division from natural division
haftmann
parents:
60841
diff
changeset
|
239 |
naturals and uses generic numeral algorithm for computations. |
dd18c33c001e
direct bootstrap of integer division from natural division
haftmann
parents:
60841
diff
changeset
|
240 |
Slight INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes |
dd18c33c001e
direct bootstrap of integer division from natural division
haftmann
parents:
60841
diff
changeset
|
241 |
former simprocs binary_int_div and binary_int_mod |
dd18c33c001e
direct bootstrap of integer division from natural division
haftmann
parents:
60841
diff
changeset
|
242 |
|
60516
0826b7025d07
generalized some theorems about integral domains and moved to HOL theories
haftmann
parents:
60515
diff
changeset
|
243 |
* Tightened specification of class semiring_no_zero_divisors. Slight |
0826b7025d07
generalized some theorems about integral domains and moved to HOL theories
haftmann
parents:
60515
diff
changeset
|
244 |
INCOMPATIBILITY. |
0826b7025d07
generalized some theorems about integral domains and moved to HOL theories
haftmann
parents:
60515
diff
changeset
|
245 |
|
60688
01488b559910
avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents:
60642
diff
changeset
|
246 |
* Class algebraic_semidom introduces common algebraic notions of |
01488b559910
avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents:
60642
diff
changeset
|
247 |
integral (semi)domains, particularly units. Although |
60517
f16e4fb20652
separate class for notions specific for integral (semi)domains, in contrast to fields where these are trivial
haftmann
parents:
60516
diff
changeset
|
248 |
logically subsumed by fields, is is not a super class of these |
f16e4fb20652
separate class for notions specific for integral (semi)domains, in contrast to fields where these are trivial
haftmann
parents:
60516
diff
changeset
|
249 |
in order not to burden fields with notions that are trivial there. |
60688
01488b559910
avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents:
60642
diff
changeset
|
250 |
|
01488b559910
avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents:
60642
diff
changeset
|
251 |
* Class normalization_semidom specifies canonical representants |
01488b559910
avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents:
60642
diff
changeset
|
252 |
for equivalence classes of associated elements in an integral |
01488b559910
avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents:
60642
diff
changeset
|
253 |
(semi)domain. This formalizes associated elements as well. |
01488b559910
avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents:
60642
diff
changeset
|
254 |
|
01488b559910
avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents:
60642
diff
changeset
|
255 |
* Abstract specification of gcd/lcm operations in classes semiring_gcd, |
01488b559910
avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents:
60642
diff
changeset
|
256 |
semiring_Gcd, semiring_Lcd. Minor INCOMPATIBILITY: facts gcd_nat.commute |
01488b559910
avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents:
60642
diff
changeset
|
257 |
and gcd_int.commute are subsumed by gcd.commute, as well as gcd_nat.assoc |
01488b559910
avoid explicit definition of the relation of associated elements in a ring -- prefer explicit normalization instead
haftmann
parents:
60642
diff
changeset
|
258 |
and gcd_int.assoc by gcd.assoc. |
60517
f16e4fb20652
separate class for notions specific for integral (semi)domains, in contrast to fields where these are trivial
haftmann
parents:
60516
diff
changeset
|
259 |
|
60429
d3d1e185cd63
uniform _ div _ as infix syntax for ring division
haftmann
parents:
60418
diff
changeset
|
260 |
* Former constants Fields.divide (_ / _) and Divides.div (_ div _) |
60352
d46de31a50c4
separate class for division operator, with particular syntax added in more specific classes
haftmann
parents:
60347
diff
changeset
|
261 |
are logically unified to Rings.divide in syntactic type class |
60429
d3d1e185cd63
uniform _ div _ as infix syntax for ring division
haftmann
parents:
60418
diff
changeset
|
262 |
Rings.divide, with infix syntax (_ div _). Infix syntax (_ / _) |
d3d1e185cd63
uniform _ div _ as infix syntax for ring division
haftmann
parents:
60418
diff
changeset
|
263 |
for field division is added later as abbreviation in class Fields.inverse. |
60516
0826b7025d07
generalized some theorems about integral domains and moved to HOL theories
haftmann
parents:
60515
diff
changeset
|
264 |
INCOMPATIBILITY, instantiations must refer to Rings.divide rather |
60429
d3d1e185cd63
uniform _ div _ as infix syntax for ring division
haftmann
parents:
60418
diff
changeset
|
265 |
than the former separate constants, hence infix syntax (_ / _) is usually |
d3d1e185cd63
uniform _ div _ as infix syntax for ring division
haftmann
parents:
60418
diff
changeset
|
266 |
not available during instantiation. |
60352
d46de31a50c4
separate class for division operator, with particular syntax added in more specific classes
haftmann
parents:
60347
diff
changeset
|
267 |
|
60397
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpi-inf.mpg.de>
parents:
60390
diff
changeset
|
268 |
* Library/Multiset: |
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpi-inf.mpg.de>
parents:
60390
diff
changeset
|
269 |
- Renamed multiset inclusion operators: |
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpi-inf.mpg.de>
parents:
60390
diff
changeset
|
270 |
< ~> <# |
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpi-inf.mpg.de>
parents:
60390
diff
changeset
|
271 |
\<subset> ~> \<subset># |
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpi-inf.mpg.de>
parents:
60390
diff
changeset
|
272 |
<= ~> <=# |
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpi-inf.mpg.de>
parents:
60390
diff
changeset
|
273 |
\<le> ~> \<le># |
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpi-inf.mpg.de>
parents:
60390
diff
changeset
|
274 |
\<subseteq> ~> \<subseteq># |
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpi-inf.mpg.de>
parents:
60390
diff
changeset
|
275 |
INCOMPATIBILITY. |
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpi-inf.mpg.de>
parents:
60390
diff
changeset
|
276 |
- "'a multiset" is no longer an instance of the "order", |
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpi-inf.mpg.de>
parents:
60390
diff
changeset
|
277 |
"ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff", |
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpi-inf.mpg.de>
parents:
60390
diff
changeset
|
278 |
"semilattice_inf", and "semilattice_sup" type classes. The theorems |
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpi-inf.mpg.de>
parents:
60390
diff
changeset
|
279 |
previously provided by these type classes (directly or indirectly) |
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpi-inf.mpg.de>
parents:
60390
diff
changeset
|
280 |
are now available through the "subset_mset" interpretation |
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpi-inf.mpg.de>
parents:
60390
diff
changeset
|
281 |
(e.g. add_mono ~> subset_mset.add_mono). |
f8a513fedb31
Renaming multiset operators < ~> <#,...
Mathias Fleury <Mathias.Fleury@mpi-inf.mpg.de>
parents:
60390
diff
changeset
|
282 |
INCOMPATIBILITY. |
60497 | 283 |
- Renamed conversions: |
60515 | 284 |
multiset_of ~> mset |
285 |
multiset_of_set ~> mset_set |
|
60497 | 286 |
set_of ~> set_mset |
287 |
INCOMPATIBILITY |
|
60398 | 288 |
- Renamed lemmas: |
289 |
mset_le_def ~> subseteq_mset_def |
|
290 |
mset_less_def ~> subset_mset_def |
|
60400 | 291 |
less_eq_multiset.rep_eq ~> subseteq_mset_def |
292 |
INCOMPATIBILITY |
|
293 |
- Removed lemmas generated by lift_definition: |
|
294 |
less_eq_multiset.abs_eq, less_eq_multiset.rsp less_eq_multiset.transfer |
|
295 |
less_eq_multiset_def |
|
296 |
INCOMPATIBILITY |
|
60006 | 297 |
|
60809
457abb82fb9e
the Cauchy integral theorem and related material
paulson <lp15@cam.ac.uk>
parents:
60802
diff
changeset
|
298 |
* Multivariate_Analysis/Cauchy_Integral_Thm: Complex path integrals and Cauchy's integral theorem, |
457abb82fb9e
the Cauchy integral theorem and related material
paulson <lp15@cam.ac.uk>
parents:
60802
diff
changeset
|
299 |
ported from HOL Light |
457abb82fb9e
the Cauchy integral theorem and related material
paulson <lp15@cam.ac.uk>
parents:
60802
diff
changeset
|
300 |
|
60523 | 301 |
* Theory Library/Old_Recdef: discontinued obsolete 'defer_recdef' |
302 |
command. Minor INCOMPATIBILITY, use 'function' instead. |
|
303 |
||
61121
efe8b18306b7
do not expose low-level "_def" facts of 'function' definitions, to avoid potential confusion with the situation of plain 'definition';
wenzelm
parents:
61119
diff
changeset
|
304 |
* Recursive function definitions ('fun', 'function', 'partial_function') |
efe8b18306b7
do not expose low-level "_def" facts of 'function' definitions, to avoid potential confusion with the situation of plain 'definition';
wenzelm
parents:
61119
diff
changeset
|
305 |
no longer expose the low-level "_def" facts of the internal |
efe8b18306b7
do not expose low-level "_def" facts of 'function' definitions, to avoid potential confusion with the situation of plain 'definition';
wenzelm
parents:
61119
diff
changeset
|
306 |
construction. INCOMPATIBILITY, enable option "function_defs" in the |
efe8b18306b7
do not expose low-level "_def" facts of 'function' definitions, to avoid potential confusion with the situation of plain 'definition';
wenzelm
parents:
61119
diff
changeset
|
307 |
context for rare situations where these facts are really needed. |
efe8b18306b7
do not expose low-level "_def" facts of 'function' definitions, to avoid potential confusion with the situation of plain 'definition';
wenzelm
parents:
61119
diff
changeset
|
308 |
|
61119 | 309 |
* Imperative_HOL: obsolete theory Legacy_Mrec has been removed. |
310 |
||
60479 | 311 |
|
60793 | 312 |
*** ML *** |
313 |
||
60802 | 314 |
* Instantiation rules have been re-organized as follows: |
315 |
||
316 |
Thm.instantiate (*low-level instantiation with named arguments*) |
|
317 |
Thm.instantiate' (*version with positional arguments*) |
|
318 |
||
319 |
Drule.infer_instantiate (*instantiation with type inference*) |
|
320 |
Drule.infer_instantiate' (*version with positional arguments*) |
|
321 |
||
322 |
The LHS only requires variable specifications, instead of full terms. |
|
323 |
Old cterm_instantiate is superseded by infer_instantiate. |
|
324 |
INCOMPATIBILITY, need to re-adjust some ML names and types accordingly. |
|
325 |
||
60793 | 326 |
* Old tactic shorthands atac, rtac, etac, dtac, ftac have been |
327 |
discontinued. INCOMPATIBILITY, use regular assume_tac, resolve_tac etc. |
|
328 |
instead (with proper context). |
|
60642
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60631
diff
changeset
|
329 |
|
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60631
diff
changeset
|
330 |
* Thm.instantiate (and derivatives) no longer require the LHS of the |
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60631
diff
changeset
|
331 |
instantiation to be certified: plain variables are given directly. |
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60631
diff
changeset
|
332 |
|
60707
e96b7be56d44
SUBPROOF and Subgoal.FOCUS combinators use anonymous quasi-bound variables (like the Simplifier);
wenzelm
parents:
60688
diff
changeset
|
333 |
* Subgoal.SUBPROOF and Subgoal.FOCUS combinators use anonymous |
e96b7be56d44
SUBPROOF and Subgoal.FOCUS combinators use anonymous quasi-bound variables (like the Simplifier);
wenzelm
parents:
60688
diff
changeset
|
334 |
quasi-bound variables (like the Simplifier), instead of accidentally |
e96b7be56d44
SUBPROOF and Subgoal.FOCUS combinators use anonymous quasi-bound variables (like the Simplifier);
wenzelm
parents:
60688
diff
changeset
|
335 |
named local fixes. This has the potential to improve stability of proof |
e96b7be56d44
SUBPROOF and Subgoal.FOCUS combinators use anonymous quasi-bound variables (like the Simplifier);
wenzelm
parents:
60688
diff
changeset
|
336 |
tools, but can also cause INCOMPATIBILITY for tools that don't observe |
e96b7be56d44
SUBPROOF and Subgoal.FOCUS combinators use anonymous quasi-bound variables (like the Simplifier);
wenzelm
parents:
60688
diff
changeset
|
337 |
the proof context discipline. |
e96b7be56d44
SUBPROOF and Subgoal.FOCUS combinators use anonymous quasi-bound variables (like the Simplifier);
wenzelm
parents:
60688
diff
changeset
|
338 |
|
60642
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60631
diff
changeset
|
339 |
|
60983
ff4a67c65084
updated to polyml-5.5.3-20150820, with native x86-windows support;
wenzelm
parents:
60922
diff
changeset
|
340 |
*** System *** |
ff4a67c65084
updated to polyml-5.5.3-20150820, with native x86-windows support;
wenzelm
parents:
60922
diff
changeset
|
341 |
|
61074 | 342 |
* Poly/ML 5.5.3 runs natively on x86-windows and x86_64-windows, |
343 |
which both allow larger heap space than former x86-cygwin. |
|
60983
ff4a67c65084
updated to polyml-5.5.3-20150820, with native x86-windows support;
wenzelm
parents:
60922
diff
changeset
|
344 |
|
60995
5176de8f90db
updated to jdk-8u60, with support for x86_64-windows;
wenzelm
parents:
60986
diff
changeset
|
345 |
* Java runtime environment for x86_64-windows allows to use larger heap |
5176de8f90db
updated to jdk-8u60, with support for x86_64-windows;
wenzelm
parents:
60986
diff
changeset
|
346 |
space. |
5176de8f90db
updated to jdk-8u60, with support for x86_64-windows;
wenzelm
parents:
60986
diff
changeset
|
347 |
|
61135
8f7d802b7a71
clarified Java runtime options (NB: ISABELLE_JAVA_PLATFORM is determined later via component);
wenzelm
parents:
61134
diff
changeset
|
348 |
* Java runtime options are determined separately for 32bit vs. 64bit |
8f7d802b7a71
clarified Java runtime options (NB: ISABELLE_JAVA_PLATFORM is determined later via component);
wenzelm
parents:
61134
diff
changeset
|
349 |
platforms as follows. |
8f7d802b7a71
clarified Java runtime options (NB: ISABELLE_JAVA_PLATFORM is determined later via component);
wenzelm
parents:
61134
diff
changeset
|
350 |
|
8f7d802b7a71
clarified Java runtime options (NB: ISABELLE_JAVA_PLATFORM is determined later via component);
wenzelm
parents:
61134
diff
changeset
|
351 |
- Isabelle desktop application: platform-specific files that are |
8f7d802b7a71
clarified Java runtime options (NB: ISABELLE_JAVA_PLATFORM is determined later via component);
wenzelm
parents:
61134
diff
changeset
|
352 |
associated with the main app bundle |
8f7d802b7a71
clarified Java runtime options (NB: ISABELLE_JAVA_PLATFORM is determined later via component);
wenzelm
parents:
61134
diff
changeset
|
353 |
|
8f7d802b7a71
clarified Java runtime options (NB: ISABELLE_JAVA_PLATFORM is determined later via component);
wenzelm
parents:
61134
diff
changeset
|
354 |
- isabelle jedit: settings |
8f7d802b7a71
clarified Java runtime options (NB: ISABELLE_JAVA_PLATFORM is determined later via component);
wenzelm
parents:
61134
diff
changeset
|
355 |
JEDIT_JAVA_SYSTEM_OPTIONS |
8f7d802b7a71
clarified Java runtime options (NB: ISABELLE_JAVA_PLATFORM is determined later via component);
wenzelm
parents:
61134
diff
changeset
|
356 |
JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64 |
8f7d802b7a71
clarified Java runtime options (NB: ISABELLE_JAVA_PLATFORM is determined later via component);
wenzelm
parents:
61134
diff
changeset
|
357 |
|
8f7d802b7a71
clarified Java runtime options (NB: ISABELLE_JAVA_PLATFORM is determined later via component);
wenzelm
parents:
61134
diff
changeset
|
358 |
- isabelle build: settings |
8f7d802b7a71
clarified Java runtime options (NB: ISABELLE_JAVA_PLATFORM is determined later via component);
wenzelm
parents:
61134
diff
changeset
|
359 |
ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64 |
8f7d802b7a71
clarified Java runtime options (NB: ISABELLE_JAVA_PLATFORM is determined later via component);
wenzelm
parents:
61134
diff
changeset
|
360 |
|
60983
ff4a67c65084
updated to polyml-5.5.3-20150820, with native x86-windows support;
wenzelm
parents:
60922
diff
changeset
|
361 |
|
60479 | 362 |
|
60009 | 363 |
New in Isabelle2015 (May 2015) |
364 |
------------------------------ |
|
57695 | 365 |
|
57941
57200bdc2aa7
localized command 'method_setup' and 'attribute_setup';
wenzelm
parents:
57882
diff
changeset
|
366 |
*** General *** |
57200bdc2aa7
localized command 'method_setup' and 'attribute_setup';
wenzelm
parents:
57882
diff
changeset
|
367 |
|
59939
7d46aa03696e
support for 'restricted' modifier: only qualified accesses outside the local scope;
wenzelm
parents:
59936
diff
changeset
|
368 |
* Local theory specification commands may have a 'private' or |
59990
a81dc82ecba3
clarified keyword 'qualified' in accordance to a similar keyword from Haskell (despite unrelated Binding.qualified in Isabelle/ML);
wenzelm
parents:
59967
diff
changeset
|
369 |
'qualified' modifier to restrict name space accesses to the local scope, |
59939
7d46aa03696e
support for 'restricted' modifier: only qualified accesses outside the local scope;
wenzelm
parents:
59936
diff
changeset
|
370 |
as provided by some "context begin ... end" block. For example: |
59926 | 371 |
|
372 |
context |
|
373 |
begin |
|
374 |
||
375 |
private definition ... |
|
376 |
private lemma ... |
|
377 |
||
59990
a81dc82ecba3
clarified keyword 'qualified' in accordance to a similar keyword from Haskell (despite unrelated Binding.qualified in Isabelle/ML);
wenzelm
parents:
59967
diff
changeset
|
378 |
qualified definition ... |
a81dc82ecba3
clarified keyword 'qualified' in accordance to a similar keyword from Haskell (despite unrelated Binding.qualified in Isabelle/ML);
wenzelm
parents:
59967
diff
changeset
|
379 |
qualified lemma ... |
a81dc82ecba3
clarified keyword 'qualified' in accordance to a similar keyword from Haskell (despite unrelated Binding.qualified in Isabelle/ML);
wenzelm
parents:
59967
diff
changeset
|
380 |
|
59926 | 381 |
lemma ... |
382 |
theorem ... |
|
383 |
||
384 |
end |
|
385 |
||
59901 | 386 |
* Command 'experiment' opens an anonymous locale context with private |
387 |
naming policy. |
|
388 |
||
59951 | 389 |
* Command 'notepad' requires proper nesting of begin/end and its proof |
390 |
structure in the body: 'oops' is no longer supported here. Minor |
|
391 |
INCOMPATIBILITY, use 'sorry' instead. |
|
392 |
||
393 |
* Command 'named_theorems' declares a dynamic fact within the context, |
|
394 |
together with an attribute to maintain the content incrementally. This |
|
395 |
supersedes functor Named_Thms in Isabelle/ML, but with a subtle change |
|
396 |
of semantics due to external visual order vs. internal reverse order. |
|
397 |
||
398 |
* 'find_theorems': search patterns which are abstractions are |
|
399 |
schematically expanded before search. Search results match the naive |
|
400 |
expectation more closely, particularly wrt. abbreviations. |
|
401 |
INCOMPATIBILITY. |
|
59648 | 402 |
|
59569 | 403 |
* Commands 'method_setup' and 'attribute_setup' now work within a local |
404 |
theory context. |
|
57941
57200bdc2aa7
localized command 'method_setup' and 'attribute_setup';
wenzelm
parents:
57882
diff
changeset
|
405 |
|
58928
23d0ffd48006
plain value Keywords.keywords, which might be used outside theory for bootstrap purposes;
wenzelm
parents:
58872
diff
changeset
|
406 |
* Outer syntax commands are managed authentically within the theory |
59569 | 407 |
context, without implicit global state. Potential for accidental |
58928
23d0ffd48006
plain value Keywords.keywords, which might be used outside theory for bootstrap purposes;
wenzelm
parents:
58872
diff
changeset
|
408 |
INCOMPATIBILITY, make sure that required theories are really imported. |
23d0ffd48006
plain value Keywords.keywords, which might be used outside theory for bootstrap purposes;
wenzelm
parents:
58872
diff
changeset
|
409 |
|
60115 | 410 |
* Historical command-line terminator ";" is no longer accepted (and |
411 |
already used differently in Isar). Minor INCOMPATIBILITY, use "isabelle |
|
412 |
update_semicolons" to remove obsolete semicolons from old theory |
|
413 |
sources. |
|
414 |
||
59951 | 415 |
* Structural composition of proof methods (meth1; meth2) in Isar |
416 |
corresponds to (tac1 THEN_ALL_NEW tac2) in ML. |
|
59105 | 417 |
|
60119
54bea620e54f
added Eisbach, using version 3752768caa17 of its Bitbucket repository;
wenzelm
parents:
60115
diff
changeset
|
418 |
* The Eisbach proof method language allows to define new proof methods |
54bea620e54f
added Eisbach, using version 3752768caa17 of its Bitbucket repository;
wenzelm
parents:
60115
diff
changeset
|
419 |
by combining existing ones with their usual syntax. The "match" proof |
54bea620e54f
added Eisbach, using version 3752768caa17 of its Bitbucket repository;
wenzelm
parents:
60115
diff
changeset
|
420 |
method provides basic fact/term matching in addition to |
54bea620e54f
added Eisbach, using version 3752768caa17 of its Bitbucket repository;
wenzelm
parents:
60115
diff
changeset
|
421 |
premise/conclusion matching through Subgoal.focus, and binds fact names |
60288
d7f636331176
added Eisbach manual, using version 8845c4cb28b6 of its Bitbucket repository;
wenzelm
parents:
60273
diff
changeset
|
422 |
from matches as well as term patterns within matches. The Isabelle |
d7f636331176
added Eisbach manual, using version 8845c4cb28b6 of its Bitbucket repository;
wenzelm
parents:
60273
diff
changeset
|
423 |
documentation provides an entry "eisbach" for the Eisbach User Manual. |
d7f636331176
added Eisbach manual, using version 8845c4cb28b6 of its Bitbucket repository;
wenzelm
parents:
60273
diff
changeset
|
424 |
Sources and various examples are in ~~/src/HOL/Eisbach/. |
60119
54bea620e54f
added Eisbach, using version 3752768caa17 of its Bitbucket repository;
wenzelm
parents:
60115
diff
changeset
|
425 |
|
57941
57200bdc2aa7
localized command 'method_setup' and 'attribute_setup';
wenzelm
parents:
57882
diff
changeset
|
426 |
|
58524 | 427 |
*** Prover IDE -- Isabelle/Scala/jEdit *** |
428 |
||
59569 | 429 |
* Improved folding mode "isabelle" based on Isar syntax. Alternatively, |
430 |
the "sidekick" mode may be used for document structure. |
|
431 |
||
432 |
* Extended bracket matching based on Isar language structure. System |
|
433 |
option jedit_structure_limit determines maximum number of lines to scan |
|
434 |
in the buffer. |
|
58758 | 435 |
|
58540 | 436 |
* Support for BibTeX files: context menu, context-sensitive token |
437 |
marker, SideKick parser. |
|
58524 | 438 |
|
58551 | 439 |
* Document antiquotation @{cite} provides formal markup, which is |
60265 | 440 |
interpreted semi-formally based on .bib files that happen to be open in |
441 |
the editor (hyperlinks, completion etc.). |
|
58551 | 442 |
|
58785 | 443 |
* Less waste of vertical space via negative line spacing (see Global |
444 |
Options / Text Area). |
|
445 |
||
60089
8bd5999133d4
let the system choose Graph_Display.display_graph_old: thm_deps needs tree hierarchy, code_deps needs cycles (!?);
wenzelm
parents:
60085
diff
changeset
|
446 |
* Improved graphview panel with optional output of PNG or PDF, for |
60273
83de10e27007
use display_graph_old for locale_deps, to show a bit more than nothing for cyclic graphs;
wenzelm
parents:
60265
diff
changeset
|
447 |
display of 'thy_deps', 'class_deps' etc. |
60009 | 448 |
|
60115 | 449 |
* The commands 'thy_deps' and 'class_deps' allow optional bounds to |
450 |
restrict the visualized hierarchy. |
|
60093 | 451 |
|
60072 | 452 |
* Improved scheduling for asynchronous print commands (e.g. provers |
453 |
managed by the Sledgehammer panel) wrt. ongoing document processing. |
|
454 |
||
58524 | 455 |
|
59951 | 456 |
*** Document preparation *** |
457 |
||
458 |
* Document markup commands 'chapter', 'section', 'subsection', |
|
459 |
'subsubsection', 'text', 'txt', 'text_raw' work uniformly in any |
|
460 |
context, even before the initial 'theory' command. Obsolete proof |
|
461 |
commands 'sect', 'subsect', 'subsubsect', 'txt_raw' have been |
|
462 |
discontinued, use 'section', 'subsection', 'subsubsection', 'text_raw' |
|
463 |
instead. The old 'header' command is still retained for some time, but |
|
464 |
should be replaced by 'chapter', 'section' etc. (using "isabelle |
|
465 |
update_header"). Minor INCOMPATIBILITY. |
|
466 |
||
60009 | 467 |
* Official support for "tt" style variants, via \isatt{...} or |
468 |
\begin{isabellett}...\end{isabellett}. The somewhat fragile \verb or |
|
469 |
verbatim environment of LaTeX is no longer used. This allows @{ML} etc. |
|
470 |
as argument to other macros (such as footnotes). |
|
471 |
||
472 |
* Document antiquotation @{verbatim} prints ASCII text literally in "tt" |
|
473 |
style. |
|
474 |
||
475 |
* Discontinued obsolete option "document_graph": session_graph.pdf is |
|
476 |
produced unconditionally for HTML browser_info and PDF-LaTeX document. |
|
477 |
||
59951 | 478 |
* Diagnostic commands and document markup commands within a proof do not |
479 |
affect the command tag for output. Thus commands like 'thm' are subject |
|
480 |
to proof document structure, and no longer "stick out" accidentally. |
|
481 |
Commands 'text' and 'txt' merely differ in the LaTeX style, not their |
|
482 |
tags. Potential INCOMPATIBILITY in exotic situations. |
|
483 |
||
484 |
* System option "pretty_margin" is superseded by "thy_output_margin", |
|
485 |
which is also accessible via document antiquotation option "margin". |
|
486 |
Only the margin for document output may be changed, but not the global |
|
487 |
pretty printing: that is 76 for plain console output, and adapted |
|
488 |
dynamically in GUI front-ends. Implementations of document |
|
489 |
antiquotations need to observe the margin explicitly according to |
|
490 |
Thy_Output.string_of_margin. Minor INCOMPATIBILITY. |
|
491 |
||
60299
5ae2a2e74c93
clarified NEWS: document_files are officially required since Isabelle2014, but the absence was tolerated as legacy feature;
wenzelm
parents:
60288
diff
changeset
|
492 |
* Specification of 'document_files' in the session ROOT file is |
5ae2a2e74c93
clarified NEWS: document_files are officially required since Isabelle2014, but the absence was tolerated as legacy feature;
wenzelm
parents:
60288
diff
changeset
|
493 |
mandatory for document preparation. The legacy mode with implicit |
5ae2a2e74c93
clarified NEWS: document_files are officially required since Isabelle2014, but the absence was tolerated as legacy feature;
wenzelm
parents:
60288
diff
changeset
|
494 |
copying of the document/ directory is no longer supported. Minor |
5ae2a2e74c93
clarified NEWS: document_files are officially required since Isabelle2014, but the absence was tolerated as legacy feature;
wenzelm
parents:
60288
diff
changeset
|
495 |
INCOMPATIBILITY. |
5ae2a2e74c93
clarified NEWS: document_files are officially required since Isabelle2014, but the absence was tolerated as legacy feature;
wenzelm
parents:
60288
diff
changeset
|
496 |
|
59951 | 497 |
|
58202 | 498 |
*** Pure *** |
499 |
||
59835
97872c658a44
rule_insts_schematic is considered legacy and false by default;
wenzelm
parents:
59815
diff
changeset
|
500 |
* Proof methods with explicit instantiation ("rule_tac", "subgoal_tac" |
97872c658a44
rule_insts_schematic is considered legacy and false by default;
wenzelm
parents:
59815
diff
changeset
|
501 |
etc.) allow an optional context of local variables ('for' declaration): |
97872c658a44
rule_insts_schematic is considered legacy and false by default;
wenzelm
parents:
59815
diff
changeset
|
502 |
these variables become schematic in the instantiated theorem; this |
97872c658a44
rule_insts_schematic is considered legacy and false by default;
wenzelm
parents:
59815
diff
changeset
|
503 |
behaviour is analogous to 'for' in attributes "where" and "of". |
97872c658a44
rule_insts_schematic is considered legacy and false by default;
wenzelm
parents:
59815
diff
changeset
|
504 |
Configuration option rule_insts_schematic (default false) controls use |
97872c658a44
rule_insts_schematic is considered legacy and false by default;
wenzelm
parents:
59815
diff
changeset
|
505 |
of schematic variables outside the context. Minor INCOMPATIBILITY, |
97872c658a44
rule_insts_schematic is considered legacy and false by default;
wenzelm
parents:
59815
diff
changeset
|
506 |
declare rule_insts_schematic = true temporarily and update to use local |
97872c658a44
rule_insts_schematic is considered legacy and false by default;
wenzelm
parents:
59815
diff
changeset
|
507 |
variable declarations or dummy patterns instead. |
97872c658a44
rule_insts_schematic is considered legacy and false by default;
wenzelm
parents:
59815
diff
changeset
|
508 |
|
60009 | 509 |
* Explicit instantiation via attributes "where", "of", and proof methods |
510 |
"rule_tac" with derivatives like "subgoal_tac" etc. admit dummy patterns |
|
511 |
("_") that stand for anonymous local variables. |
|
512 |
||
59951 | 513 |
* Generated schematic variables in standard format of exported facts are |
514 |
incremented to avoid material in the proof context. Rare |
|
515 |
INCOMPATIBILITY, explicit instantiation sometimes needs to refer to |
|
516 |
different index. |
|
517 |
||
60010 | 518 |
* Lexical separation of signed and unsigned numerals: categories "num" |
519 |
and "float" are unsigned. INCOMPATIBILITY: subtle change in precedence |
|
520 |
of numeral signs, particularly in expressions involving infix syntax |
|
521 |
like "(- 1) ^ n". |
|
58410
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
58373
diff
changeset
|
522 |
|
58421 | 523 |
* Old inner token category "xnum" has been discontinued. Potential |
524 |
INCOMPATIBILITY for exotic syntax: may use mixfix grammar with "num" |
|
525 |
token category instead. |
|
526 |
||
58202 | 527 |
|
57737 | 528 |
*** HOL *** |
529 |
||
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
530 |
* New (co)datatype package: |
58373 | 531 |
- The 'datatype_new' command has been renamed 'datatype'. The old |
532 |
command of that name is now called 'old_datatype' and is provided |
|
533 |
by "~~/src/HOL/Library/Old_Datatype.thy". See |
|
534 |
'isabelle doc datatypes' for information on porting. |
|
535 |
INCOMPATIBILITY. |
|
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
536 |
- Renamed theorems: |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
537 |
disc_corec ~> corec_disc |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
538 |
disc_corec_iff ~> corec_disc_iff |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
539 |
disc_exclude ~> distinct_disc |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
540 |
disc_exhaust ~> exhaust_disc |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
541 |
disc_map_iff ~> map_disc_iff |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
542 |
sel_corec ~> corec_sel |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
543 |
sel_exhaust ~> exhaust_sel |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
544 |
sel_map ~> map_sel |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
545 |
sel_set ~> set_sel |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
546 |
sel_split ~> split_sel |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
547 |
sel_split_asm ~> split_sel_asm |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
548 |
strong_coinduct ~> coinduct_strong |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
549 |
weak_case_cong ~> case_cong_weak |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
550 |
INCOMPATIBILITY. |
58192 | 551 |
- The "no_code" option to "free_constructors", "datatype_new", and |
552 |
"codatatype" has been renamed "plugins del: code". |
|
553 |
INCOMPATIBILITY. |
|
58044 | 554 |
- The rules "set_empty" have been removed. They are easy |
555 |
consequences of other set rules "by auto". |
|
556 |
INCOMPATIBILITY. |
|
557 |
- The rule "set_cases" is now registered with the "[cases set]" |
|
57990 | 558 |
attribute. This can influence the behavior of the "cases" proof |
559 |
method when more than one case rule is applicable (e.g., an |
|
560 |
assumption is of the form "w : set ws" and the method "cases w" |
|
561 |
is invoked). The solution is to specify the case rule explicitly |
|
562 |
(e.g. "cases w rule: widget.exhaust"). |
|
563 |
INCOMPATIBILITY. |
|
59675 | 564 |
- Renamed theories: |
565 |
BNF_Comp ~> BNF_Composition |
|
566 |
BNF_FP_Base ~> BNF_Fixpoint_Base |
|
567 |
BNF_GFP ~> BNF_Greatest_Fixpoint |
|
568 |
BNF_LFP ~> BNF_Least_Fixpoint |
|
569 |
BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions |
|
570 |
Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions |
|
571 |
INCOMPATIBILITY. |
|
60114 | 572 |
- Lifting and Transfer setup for basic HOL types sum and prod (also |
573 |
option) is now performed by the BNF package. Theories Lifting_Sum, |
|
574 |
Lifting_Product and Lifting_Option from Main became obsolete and |
|
575 |
were removed. Changed definitions of the relators rel_prod and |
|
576 |
rel_sum (using inductive). |
|
60111 | 577 |
INCOMPATIBILITY: use rel_prod.simps and rel_sum.simps instead |
60114 | 578 |
of rel_prod_def and rel_sum_def. |
579 |
Minor INCOMPATIBILITY: (rarely used by name) transfer theorem names |
|
580 |
changed (e.g. map_prod_transfer ~> prod.map_transfer). |
|
60261 | 581 |
- Parametricity theorems for map functions, relators, set functions, |
582 |
constructors, case combinators, discriminators, selectors and |
|
583 |
(co)recursors are automatically proved and registered as transfer |
|
584 |
rules. |
|
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
585 |
|
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
586 |
* Old datatype package: |
58310 | 587 |
- The old 'datatype' command has been renamed 'old_datatype', and |
58373 | 588 |
'rep_datatype' has been renamed 'old_rep_datatype'. They are |
589 |
provided by "~~/src/HOL/Library/Old_Datatype.thy". See |
|
58310 | 590 |
'isabelle doc datatypes' for information on porting. |
58373 | 591 |
INCOMPATIBILITY. |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
592 |
- Renamed theorems: |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
593 |
weak_case_cong ~> case_cong_weak |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
594 |
INCOMPATIBILITY. |
58373 | 595 |
- Renamed theory: |
596 |
~~/src/HOL/Datatype.thy ~> ~~/src/HOL/Library/Old_Datatype.thy |
|
597 |
INCOMPATIBILITY. |
|
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57946
diff
changeset
|
598 |
|
59039 | 599 |
* Nitpick: |
60010 | 600 |
- Fixed soundness bug related to the strict and non-strict subset |
59039 | 601 |
operations. |
602 |
||
57737 | 603 |
* Sledgehammer: |
59511 | 604 |
- CVC4 is now included with Isabelle instead of CVC3 and run by |
605 |
default. |
|
59965 | 606 |
- Z3 is now always enabled by default, now that it is fully open |
607 |
source. The "z3_non_commercial" option is discontinued. |
|
57737 | 608 |
- Minimization is now always enabled by default. |
60010 | 609 |
Removed sub-command: |
57737 | 610 |
min |
59967 | 611 |
- Proof reconstruction, both one-liners and Isar, has been |
59039 | 612 |
dramatically improved. |
613 |
- Improved support for CVC4 and veriT. |
|
57737 | 614 |
|
58062 | 615 |
* Old and new SMT modules: |
58067 | 616 |
- The old 'smt' method has been renamed 'old_smt' and moved to |
59569 | 617 |
'src/HOL/Library/Old_SMT.thy'. It is provided for compatibility, |
618 |
until applications have been ported to use the new 'smt' method. For |
|
619 |
the method to work, an older version of Z3 (e.g. Z3 3.2 or 4.0) must |
|
620 |
be installed, and the environment variable "OLD_Z3_SOLVER" must |
|
621 |
point to it. |
|
58062 | 622 |
INCOMPATIBILITY. |
58067 | 623 |
- The 'smt2' method has been renamed 'smt'. |
58060 | 624 |
INCOMPATIBILITY. |
59569 | 625 |
- New option 'smt_reconstruction_step_timeout' to limit the |
626 |
reconstruction time of Z3 proof steps in the new 'smt' method. |
|
59216 | 627 |
- New option 'smt_statistics' to display statistics of the new 'smt' |
628 |
method, especially runtime statistics of Z3 proof reconstruction. |
|
58060 | 629 |
|
60261 | 630 |
* Lifting: command 'lift_definition' allows to execute lifted constants |
631 |
that have as a return type a datatype containing a subtype. This |
|
632 |
overcomes long-time limitations in the area of code generation and |
|
633 |
lifting, and avoids tedious workarounds. |
|
60258 | 634 |
|
60009 | 635 |
* Command and antiquotation "value" provide different evaluation slots |
636 |
(again), where the previous strategy (NBE after ML) serves as default. |
|
637 |
Minor INCOMPATIBILITY. |
|
638 |
||
639 |
* Add NO_MATCH-simproc, allows to check for syntactic non-equality. |
|
640 |
||
641 |
* field_simps: Use NO_MATCH-simproc for distribution rules, to avoid |
|
642 |
non-termination in case of distributing a division. With this change |
|
643 |
field_simps is in some cases slightly less powerful, if it fails try to |
|
644 |
add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY. |
|
645 |
||
646 |
* Separate class no_zero_divisors has been given up in favour of fully |
|
647 |
algebraic semiring_no_zero_divisors. INCOMPATIBILITY. |
|
648 |
||
649 |
* Class linordered_semidom really requires no zero divisors. |
|
650 |
INCOMPATIBILITY. |
|
651 |
||
652 |
* Classes division_ring, field and linordered_field always demand |
|
653 |
"inverse 0 = 0". Given up separate classes division_ring_inverse_zero, |
|
654 |
field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY. |
|
655 |
||
656 |
* Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit |
|
657 |
additive inverse operation. INCOMPATIBILITY. |
|
658 |
||
60020
065ecea354d0
Complex roots of unity. Better definition of ln for complex numbers. Used [code del] to stop code generation for powr.
paulson <lp15@cam.ac.uk>
parents:
60010
diff
changeset
|
659 |
* Complex powers and square roots. The functions "ln" and "powr" are now |
60025 | 660 |
overloaded for types real and complex, and 0 powr y = 0 by definition. |
661 |
INCOMPATIBILITY: type constraints may be necessary. |
|
60020
065ecea354d0
Complex roots of unity. Better definition of ln for complex numbers. Used [code del] to stop code generation for powr.
paulson <lp15@cam.ac.uk>
parents:
60010
diff
changeset
|
662 |
|
60009 | 663 |
* The functions "sin" and "cos" are now defined for any type of sort |
664 |
"{real_normed_algebra_1,banach}" type, so in particular on "real" and |
|
665 |
"complex" uniformly. Minor INCOMPATIBILITY: type constraints may be |
|
666 |
needed. |
|
667 |
||
668 |
* New library of properties of the complex transcendental functions sin, |
|
669 |
cos, tan, exp, Ln, Arctan, Arcsin, Arccos. Ported from HOL Light. |
|
670 |
||
671 |
* The factorial function, "fact", now has type "nat => 'a" (of a sort |
|
672 |
that admits numeric types including nat, int, real and complex. |
|
673 |
INCOMPATIBILITY: an expression such as "fact 3 = 6" may require a type |
|
674 |
constraint, and the combination "real (fact k)" is likely to be |
|
675 |
unsatisfactory. If a type conversion is still necessary, then use |
|
676 |
"of_nat (fact k)" or "real_of_nat (fact k)". |
|
677 |
||
678 |
* Removed functions "natfloor" and "natceiling", use "nat o floor" and |
|
679 |
"nat o ceiling" instead. A few of the lemmas have been retained and |
|
680 |
adapted: in their names "natfloor"/"natceiling" has been replaced by |
|
681 |
"nat_floor"/"nat_ceiling". |
|
682 |
||
683 |
* Qualified some duplicated fact names required for boostrapping the |
|
684 |
type class hierarchy: |
|
685 |
ab_add_uminus_conv_diff ~> diff_conv_add_uminus |
|
686 |
field_inverse_zero ~> inverse_zero |
|
687 |
field_divide_inverse ~> divide_inverse |
|
688 |
field_inverse ~> left_inverse |
|
689 |
Minor INCOMPATIBILITY. |
|
690 |
||
691 |
* Eliminated fact duplicates: |
|
692 |
mult_less_imp_less_right ~> mult_right_less_imp_less |
|
693 |
mult_less_imp_less_left ~> mult_left_less_imp_less |
|
694 |
Minor INCOMPATIBILITY. |
|
695 |
||
696 |
* Fact consolidation: even_less_0_iff is subsumed by |
|
697 |
double_add_less_zero_iff_single_add_less_zero (simp by default anyway). |
|
698 |
||
699 |
* Generalized and consolidated some theorems concerning divsibility: |
|
700 |
dvd_reduce ~> dvd_add_triv_right_iff |
|
701 |
dvd_plus_eq_right ~> dvd_add_right_iff |
|
702 |
dvd_plus_eq_left ~> dvd_add_left_iff |
|
703 |
Minor INCOMPATIBILITY. |
|
704 |
||
705 |
* "even" and "odd" are mere abbreviations for "2 dvd _" and "~ 2 dvd _" |
|
706 |
and part of theory Main. |
|
707 |
even_def ~> even_iff_mod_2_eq_zero |
|
708 |
INCOMPATIBILITY. |
|
709 |
||
710 |
* Lemma name consolidation: divide_Numeral1 ~> divide_numeral_1. Minor |
|
711 |
INCOMPATIBILITY. |
|
712 |
||
713 |
* Bootstrap of listsum as special case of abstract product over lists. |
|
714 |
Fact rename: |
|
715 |
listsum_def ~> listsum.eq_foldr |
|
716 |
INCOMPATIBILITY. |
|
717 |
||
718 |
* Product over lists via constant "listprod". |
|
719 |
||
720 |
* Theory List: renamed drop_Suc_conv_tl and nth_drop' to |
|
721 |
Cons_nth_drop_Suc. |
|
58247
98d0f85d247f
enamed drop_Suc_conv_tl and nth_drop' to Cons_nth_drop_Suc
nipkow
parents:
58202
diff
changeset
|
722 |
|
58626 | 723 |
* New infrastructure for compiling, running, evaluating and testing |
59569 | 724 |
generated code in target languages in HOL/Library/Code_Test. See |
725 |
HOL/Codegenerator_Test/Code_Test* for examples. |
|
58008 | 726 |
|
60009 | 727 |
* Library/Multiset: |
59813 | 728 |
- Introduced "replicate_mset" operation. |
729 |
- Introduced alternative characterizations of the multiset ordering in |
|
730 |
"Library/Multiset_Order". |
|
59958
4538d41e8e54
renamed multiset ordering to free up nice <# etc. symbols for the standard subset
blanchet
parents:
59951
diff
changeset
|
731 |
- Renamed multiset ordering: |
4538d41e8e54
renamed multiset ordering to free up nice <# etc. symbols for the standard subset
blanchet
parents:
59951
diff
changeset
|
732 |
<# ~> #<# |
4538d41e8e54
renamed multiset ordering to free up nice <# etc. symbols for the standard subset
blanchet
parents:
59951
diff
changeset
|
733 |
<=# ~> #<=# |
4538d41e8e54
renamed multiset ordering to free up nice <# etc. symbols for the standard subset
blanchet
parents:
59951
diff
changeset
|
734 |
\<subset># ~> #\<subset># |
4538d41e8e54
renamed multiset ordering to free up nice <# etc. symbols for the standard subset
blanchet
parents:
59951
diff
changeset
|
735 |
\<subseteq># ~> #\<subseteq># |
4538d41e8e54
renamed multiset ordering to free up nice <# etc. symbols for the standard subset
blanchet
parents:
59951
diff
changeset
|
736 |
INCOMPATIBILITY. |
59986
f38b94549dc8
introduced new abbreviations for multiset operations (in the hope of getting rid of the old names <, <=, etc.)
blanchet
parents:
59967
diff
changeset
|
737 |
- Introduced abbreviations for ill-named multiset operations: |
f38b94549dc8
introduced new abbreviations for multiset operations (in the hope of getting rid of the old names <, <=, etc.)
blanchet
parents:
59967
diff
changeset
|
738 |
<#, \<subset># abbreviate < (strict subset) |
f38b94549dc8
introduced new abbreviations for multiset operations (in the hope of getting rid of the old names <, <=, etc.)
blanchet
parents:
59967
diff
changeset
|
739 |
<=#, \<le>#, \<subseteq># abbreviate <= (subset or equal) |
f38b94549dc8
introduced new abbreviations for multiset operations (in the hope of getting rid of the old names <, <=, etc.)
blanchet
parents:
59967
diff
changeset
|
740 |
INCOMPATIBILITY. |
59813 | 741 |
- Renamed |
742 |
in_multiset_of ~> in_multiset_in_set |
|
59998
c54d36be22ef
renamed Multiset.fold -> fold_mset, Multiset.filter -> filter_mset
nipkow
parents:
59991
diff
changeset
|
743 |
Multiset.fold ~> fold_mset |
c54d36be22ef
renamed Multiset.fold -> fold_mset, Multiset.filter -> filter_mset
nipkow
parents:
59991
diff
changeset
|
744 |
Multiset.filter ~> filter_mset |
59813 | 745 |
INCOMPATIBILITY. |
59949 | 746 |
- Removed mcard, is equal to size. |
59813 | 747 |
- Added attributes: |
748 |
image_mset.id [simp] |
|
749 |
image_mset_id [simp] |
|
750 |
elem_multiset_of_set [simp, intro] |
|
751 |
comp_fun_commute_plus_mset [simp] |
|
752 |
comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp] |
|
753 |
in_mset_fold_plus_iff [iff] |
|
754 |
set_of_Union_mset [simp] |
|
755 |
in_Union_mset_iff [iff] |
|
756 |
INCOMPATIBILITY. |
|
757 |
||
60009 | 758 |
* Library/Sum_of_Squares: simplified and improved "sos" method. Always |
759 |
use local CSDP executable, which is much faster than the NEOS server. |
|
760 |
The "sos_cert" functionality is invoked as "sos" with additional |
|
761 |
argument. Minor INCOMPATIBILITY. |
|
762 |
||
763 |
* HOL-Decision_Procs: New counterexample generator quickcheck |
|
764 |
[approximation] for inequalities of transcendental functions. Uses |
|
765 |
hardware floating point arithmetic to randomly discover potential |
|
60010 | 766 |
counterexamples. Counterexamples are certified with the "approximation" |
60009 | 767 |
method. See HOL/Decision_Procs/ex/Approximation_Quickcheck_Ex.thy for |
768 |
examples. |
|
58990 | 769 |
|
59354 | 770 |
* HOL-Probability: Reworked measurability prover |
60010 | 771 |
- applies destructor rules repeatedly |
59354 | 772 |
- removed application splitting (replaced by destructor rule) |
59569 | 773 |
- added congruence rules to rewrite measure spaces under the sets |
774 |
projection |
|
775 |
||
60009 | 776 |
* New proof method "rewrite" (in theory ~~/src/HOL/Library/Rewrite) for |
777 |
single-step rewriting with subterm selection based on patterns. |
|
778 |
||
58630 | 779 |
|
58066 | 780 |
*** ML *** |
781 |
||
60009 | 782 |
* Subtle change of name space policy: undeclared entries are now |
783 |
considered inaccessible, instead of accessible via the fully-qualified |
|
784 |
internal name. This mainly affects Name_Space.intern (and derivatives), |
|
785 |
which may produce an unexpected Long_Name.hidden prefix. Note that |
|
60010 | 786 |
contemporary applications use the strict Name_Space.check (and |
60009 | 787 |
derivatives) instead, which is not affected by the change. Potential |
788 |
INCOMPATIBILITY in rare applications of Name_Space.intern. |
|
59951 | 789 |
|
60094 | 790 |
* Subtle change of error semantics of Toplevel.proof_of: regular user |
791 |
ERROR instead of internal Toplevel.UNDEF. |
|
792 |
||
59951 | 793 |
* Basic combinators map, fold, fold_map, split_list, apply are available |
794 |
as parameterized antiquotations, e.g. @{map 4} for lists of quadruples. |
|
795 |
||
796 |
* Renamed "pairself" to "apply2", in accordance to @{apply 2}. |
|
797 |
INCOMPATIBILITY. |
|
798 |
||
799 |
* Former combinators NAMED_CRITICAL and CRITICAL for central critical |
|
800 |
sections have been discontinued, in favour of the more elementary |
|
801 |
Multithreading.synchronized and its high-level derivative |
|
802 |
Synchronized.var (which is usually sufficient in applications). Subtle |
|
803 |
INCOMPATIBILITY: synchronized access needs to be atomic and cannot be |
|
804 |
nested. |
|
805 |
||
60009 | 806 |
* Synchronized.value (ML) is actually synchronized (as in Scala): subtle |
807 |
change of semantics with minimal potential for INCOMPATIBILITY. |
|
59899 | 808 |
|
59621
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59588
diff
changeset
|
809 |
* The main operations to certify logical entities are Thm.ctyp_of and |
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59588
diff
changeset
|
810 |
Thm.cterm_of with a local context; old-style global theory variants are |
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59588
diff
changeset
|
811 |
available as Thm.global_ctyp_of and Thm.global_cterm_of. |
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59588
diff
changeset
|
812 |
INCOMPATIBILITY. |
291934bac95e
Thm.cterm_of and Thm.ctyp_of operate on local context;
wenzelm
parents:
59588
diff
changeset
|
813 |
|
59582 | 814 |
* Elementary operations in module Thm are no longer pervasive. |
815 |
INCOMPATIBILITY, need to use qualified Thm.prop_of, Thm.cterm_of, |
|
816 |
Thm.term_of etc. |
|
817 |
||
58963
26bf09b95dda
proper context for assume_tac (atac remains as fall-back without context);
wenzelm
parents:
58957
diff
changeset
|
818 |
* Proper context for various elementary tactics: assume_tac, |
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59480
diff
changeset
|
819 |
resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac, |
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59480
diff
changeset
|
820 |
compose_tac, Splitter.split_tac etc. INCOMPATIBILITY. |
58956
a816aa3ff391
proper context for compose_tac, Splitter.split_tac (relevant for unify trace options);
wenzelm
parents:
58928
diff
changeset
|
821 |
|
58066 | 822 |
* Tactical PARALLEL_ALLGOALS is the most common way to refer to |
823 |
PARALLEL_GOALS. |
|
824 |
||
59564
fdc03c8daacc
Goal.prove_multi is superseded by the fully general Goal.prove_common;
wenzelm
parents:
59557
diff
changeset
|
825 |
* Goal.prove_multi is superseded by the fully general Goal.prove_common, |
fdc03c8daacc
Goal.prove_multi is superseded by the fully general Goal.prove_common;
wenzelm
parents:
59557
diff
changeset
|
826 |
which also allows to specify a fork priority. |
fdc03c8daacc
Goal.prove_multi is superseded by the fully general Goal.prove_common;
wenzelm
parents:
59557
diff
changeset
|
827 |
|
59936
b8ffc3dc9e24
@{command_spec} is superseded by @{command_keyword};
wenzelm
parents:
59926
diff
changeset
|
828 |
* Antiquotation @{command_spec "COMMAND"} is superseded by |
b8ffc3dc9e24
@{command_spec} is superseded by @{command_keyword};
wenzelm
parents:
59926
diff
changeset
|
829 |
@{command_keyword COMMAND} (usually without quotes and with PIDE |
b8ffc3dc9e24
@{command_spec} is superseded by @{command_keyword};
wenzelm
parents:
59926
diff
changeset
|
830 |
markup). Minor INCOMPATIBILITY. |
b8ffc3dc9e24
@{command_spec} is superseded by @{command_keyword};
wenzelm
parents:
59926
diff
changeset
|
831 |
|
60009 | 832 |
* Cartouches within ML sources are turned into values of type |
833 |
Input.source (with formal position information). |
|
834 |
||
58066 | 835 |
|
58610 | 836 |
*** System *** |
837 |
||
59951 | 838 |
* The Isabelle tool "update_cartouches" changes theory files to use |
839 |
cartouches instead of old-style {* verbatim *} or `alt_string` tokens. |
|
840 |
||
60106 | 841 |
* The Isabelle tool "build" provides new options -X, -k, -x. |
59951 | 842 |
|
843 |
* Discontinued old-fashioned "codegen" tool. Code generation can always |
|
844 |
be externally triggered using an appropriate ROOT file plus a |
|
845 |
corresponding theory. Parametrization is possible using environment |
|
846 |
variables, or ML snippets in the most extreme cases. Minor |
|
847 |
INCOMPATIBILITY. |
|
58842 | 848 |
|
59200 | 849 |
* JVM system property "isabelle.threads" determines size of Scala thread |
850 |
pool, like Isabelle system option "threads" for ML. |
|
851 |
||
59201
702e0971d617
added system property isabelle.laf, notably for initial system dialog;
wenzelm
parents:
59200
diff
changeset
|
852 |
* JVM system property "isabelle.laf" determines the default Swing |
702e0971d617
added system property isabelle.laf, notably for initial system dialog;
wenzelm
parents:
59200
diff
changeset
|
853 |
look-and-feel, via internal class name or symbolic name as in the jEdit |
702e0971d617
added system property isabelle.laf, notably for initial system dialog;
wenzelm
parents:
59200
diff
changeset
|
854 |
menu Global Options / Appearance. |
702e0971d617
added system property isabelle.laf, notably for initial system dialog;
wenzelm
parents:
59200
diff
changeset
|
855 |
|
59951 | 856 |
* Support for Proof General and Isar TTY loop has been discontinued. |
60009 | 857 |
Minor INCOMPATIBILITY, use standard PIDE infrastructure instead. |
59891
9ce697050455
added isabelle build option -k, for fast off-line checking of theory sources;
wenzelm
parents:
59849
diff
changeset
|
858 |
|
58610 | 859 |
|
57695 | 860 |
|
57452 | 861 |
New in Isabelle2014 (August 2014) |
862 |
--------------------------------- |
|
54055 | 863 |
|
54702
3daeba5130f0
added document antiquotation @{url}, which produces formal markup for LaTeX and PIDE;
wenzelm
parents:
54688
diff
changeset
|
864 |
*** General *** |
3daeba5130f0
added document antiquotation @{url}, which produces formal markup for LaTeX and PIDE;
wenzelm
parents:
54688
diff
changeset
|
865 |
|
57452 | 866 |
* Support for official Standard ML within the Isabelle context. |
867 |
Command 'SML_file' reads and evaluates the given Standard ML file. |
|
868 |
Toplevel bindings are stored within the theory context; the initial |
|
869 |
environment is restricted to the Standard ML implementation of |
|
870 |
Poly/ML, without the add-ons of Isabelle/ML. Commands 'SML_import' |
|
871 |
and 'SML_export' allow to exchange toplevel bindings between the two |
|
872 |
separate environments. See also ~~/src/Tools/SML/Examples.thy for |
|
873 |
some examples. |
|
56499
7e0178c84994
allow text cartouches in regular outer syntax categories "text" and "altstring";
wenzelm
parents:
56450
diff
changeset
|
874 |
|
57504 | 875 |
* Standard tactics and proof methods such as "clarsimp", "auto" and |
876 |
"safe" now preserve equality hypotheses "x = expr" where x is a free |
|
877 |
variable. Locale assumptions and chained facts containing "x" |
|
878 |
continue to be useful. The new method "hypsubst_thin" and the |
|
879 |
configuration option "hypsubst_thin" (within the attribute name space) |
|
880 |
restore the previous behavior. INCOMPATIBILITY, especially where |
|
881 |
induction is done after these methods or when the names of free and |
|
882 |
bound variables clash. As first approximation, old proofs may be |
|
883 |
repaired by "using [[hypsubst_thin = true]]" in the critical spot. |
|
884 |
||
56232 | 885 |
* More static checking of proof methods, which allows the system to |
886 |
form a closure over the concrete syntax. Method arguments should be |
|
887 |
processed in the original proof context as far as possible, before |
|
888 |
operating on the goal state. In any case, the standard discipline for |
|
889 |
subgoal-addressing needs to be observed: no subgoals or a subgoal |
|
890 |
number that is out of range produces an empty result sequence, not an |
|
891 |
exception. Potential INCOMPATIBILITY for non-conformant tactical |
|
892 |
proof tools. |
|
893 |
||
57452 | 894 |
* Lexical syntax (inner and outer) supports text cartouches with |
895 |
arbitrary nesting, and without escapes of quotes etc. The Prover IDE |
|
896 |
supports input via ` (backquote). |
|
897 |
||
898 |
* The outer syntax categories "text" (for formal comments and document |
|
899 |
markup commands) and "altstring" (for literal fact references) allow |
|
900 |
cartouches as well, in addition to the traditional mix of quotations. |
|
901 |
||
902 |
* Syntax of document antiquotation @{rail} now uses \<newline> instead |
|
903 |
of "\\", to avoid the optical illusion of escaped backslash within |
|
57491 | 904 |
string token. General renovation of its syntax using text cartouches. |
57452 | 905 |
Minor INCOMPATIBILITY. |
906 |
||
907 |
* Discontinued legacy_isub_isup, which was a temporary workaround for |
|
908 |
Isabelle/ML in Isabelle2013-1. The prover process no longer accepts |
|
909 |
old identifier syntax with \<^isub> or \<^isup>. Potential |
|
910 |
INCOMPATIBILITY. |
|
911 |
||
912 |
* Document antiquotation @{url} produces markup for the given URL, |
|
913 |
which results in an active hyperlink within the text. |
|
914 |
||
915 |
* Document antiquotation @{file_unchecked} is like @{file}, but does |
|
916 |
not check existence within the file-system. |
|
917 |
||
918 |
* Updated and extended manuals: codegen, datatypes, implementation, |
|
919 |
isar-ref, jedit, system. |
|
57423
96f970d1522b
updated NEWS -- removed material that is already in the manual;
wenzelm
parents:
57418
diff
changeset
|
920 |
|
54702
3daeba5130f0
added document antiquotation @{url}, which produces formal markup for LaTeX and PIDE;
wenzelm
parents:
54688
diff
changeset
|
921 |
|
54533 | 922 |
*** Prover IDE -- Isabelle/Scala/jEdit *** |
923 |
||
57650 | 924 |
* Improved Document panel: simplified interaction where every single |
57452 | 925 |
mouse click (re)opens document via desktop environment or as jEdit |
926 |
buffer. |
|
927 |
||
928 |
* Support for Navigator plugin (with toolbar buttons), with connection |
|
929 |
to PIDE hyperlinks. |
|
930 |
||
931 |
* Auxiliary files ('ML_file' etc.) are managed by the Prover IDE. |
|
932 |
Open text buffers take precedence over copies within the file-system. |
|
933 |
||
934 |
* Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for |
|
935 |
auxiliary ML files. |
|
57423
96f970d1522b
updated NEWS -- removed material that is already in the manual;
wenzelm
parents:
57418
diff
changeset
|
936 |
|
96f970d1522b
updated NEWS -- removed material that is already in the manual;
wenzelm
parents:
57418
diff
changeset
|
937 |
* Improved syntactic and semantic completion mechanism, with simple |
96f970d1522b
updated NEWS -- removed material that is already in the manual;
wenzelm
parents:
57418
diff
changeset
|
938 |
templates, completion language context, name-space completion, |
96f970d1522b
updated NEWS -- removed material that is already in the manual;
wenzelm
parents:
57418
diff
changeset
|
939 |
file-name completion, spell-checker completion. |
96f970d1522b
updated NEWS -- removed material that is already in the manual;
wenzelm
parents:
57418
diff
changeset
|
940 |
|
96f970d1522b
updated NEWS -- removed material that is already in the manual;
wenzelm
parents:
57418
diff
changeset
|
941 |
* Refined GUI popup for completion: more robust key/mouse event |
96f970d1522b
updated NEWS -- removed material that is already in the manual;
wenzelm
parents:
57418
diff
changeset
|
942 |
handling and propagation to enclosing text area -- avoid loosing |
96f970d1522b
updated NEWS -- removed material that is already in the manual;
wenzelm
parents:
57418
diff
changeset
|
943 |
keystrokes with slow / remote graphics displays. |
96f970d1522b
updated NEWS -- removed material that is already in the manual;
wenzelm
parents:
57418
diff
changeset
|
944 |
|
57833
2c2bae3da1c2
completion popup supports both ENTER and TAB (default);
wenzelm
parents:
57826
diff
changeset
|
945 |
* Completion popup supports both ENTER and TAB (default) to select an |
2c2bae3da1c2
completion popup supports both ENTER and TAB (default);
wenzelm
parents:
57826
diff
changeset
|
946 |
item, depending on Isabelle options. |
2c2bae3da1c2
completion popup supports both ENTER and TAB (default);
wenzelm
parents:
57826
diff
changeset
|
947 |
|
57423
96f970d1522b
updated NEWS -- removed material that is already in the manual;
wenzelm
parents:
57418
diff
changeset
|
948 |
* Refined insertion of completion items wrt. jEdit text: multiple |
96f970d1522b
updated NEWS -- removed material that is already in the manual;
wenzelm
parents:
57418
diff
changeset
|
949 |
selections, rectangular selections, rectangular selection as "tall |
96f970d1522b
updated NEWS -- removed material that is already in the manual;
wenzelm
parents:
57418
diff
changeset
|
950 |
caret". |
56342 | 951 |
|
56580 | 952 |
* Integrated spell-checker for document text, comments etc. with |
57423
96f970d1522b
updated NEWS -- removed material that is already in the manual;
wenzelm
parents:
57418
diff
changeset
|
953 |
completion popup and context-menu. |
56554 | 954 |
|
56879
ee2b61f37ad9
renamed "Find" to "Query", with more general operations;
wenzelm
parents:
56851
diff
changeset
|
955 |
* More general "Query" panel supersedes "Find" panel, with GUI access |
ee2b61f37ad9
renamed "Find" to "Query", with more general operations;
wenzelm
parents:
56851
diff
changeset
|
956 |
to commands 'find_theorems' and 'find_consts', as well as print |
ee2b61f37ad9
renamed "Find" to "Query", with more general operations;
wenzelm
parents:
56851
diff
changeset
|
957 |
operations for the context. Minor incompatibility in keyboard |
ee2b61f37ad9
renamed "Find" to "Query", with more general operations;
wenzelm
parents:
56851
diff
changeset
|
958 |
shortcuts etc.: replace action isabelle-find by isabelle-query. |
56761 | 959 |
|
56901 | 960 |
* Search field for all output panels ("Output", "Query", "Info" etc.) |
961 |
to highlight text via regular expression. |
|
962 |
||
54881 | 963 |
* Option "jedit_print_mode" (see also "Plugin Options / Isabelle / |
964 |
General") allows to specify additional print modes for the prover |
|
965 |
process, without requiring old-fashioned command-line invocation of |
|
966 |
"isabelle jedit -m MODE". |
|
967 |
||
56505 | 968 |
* More support for remote files (e.g. http) using standard Java |
969 |
networking operations instead of jEdit virtual file-systems. |
|
970 |
||
57822 | 971 |
* Empty editors buffers that are no longer required (e.g.\ via theory |
972 |
imports) are automatically removed from the document model. |
|
973 |
||
57869 | 974 |
* Improved monitor panel. |
975 |
||
56838 | 976 |
* Improved Console/Scala plugin: more uniform scala.Console output, |
977 |
more robust treatment of threads and interrupts. |
|
978 |
||
56939 | 979 |
* Improved management of dockable windows: clarified keyboard focus |
980 |
and window placement wrt. main editor view; optional menu item to |
|
981 |
"Detach" a copy where this makes sense. |
|
982 |
||
57452 | 983 |
* New Simplifier Trace panel provides an interactive view of the |
57591
8c095aef6769
clarified "simp_trace_new" and corresponding isar-ref section;
wenzelm
parents:
57532
diff
changeset
|
984 |
simplification process, enabled by the "simp_trace_new" attribute |
57452 | 985 |
within the context. |
986 |
||
987 |
||
55001 | 988 |
*** Pure *** |
989 |
||
57504 | 990 |
* Low-level type-class commands 'classes', 'classrel', 'arities' have |
991 |
been discontinued to avoid the danger of non-trivial axiomatization |
|
992 |
that is not immediately visible. INCOMPATIBILITY, use regular |
|
993 |
'instance' command with proof. The required OFCLASS(...) theorem |
|
994 |
might be postulated via 'axiomatization' beforehand, or the proof |
|
995 |
finished trivially if the underlying class definition is made vacuous |
|
996 |
(without any assumptions). See also Isabelle/ML operations |
|
997 |
Axclass.class_axiomatization, Axclass.classrel_axiomatization, |
|
998 |
Axclass.arity_axiomatization. |
|
999 |
||
56245 | 1000 |
* Basic constants of Pure use more conventional names and are always |
1001 |
qualified. Rare INCOMPATIBILITY, but with potentially serious |
|
1002 |
consequences, notably for tools in Isabelle/ML. The following |
|
1003 |
renaming needs to be applied: |
|
1004 |
||
1005 |
== ~> Pure.eq |
|
1006 |
==> ~> Pure.imp |
|
1007 |
all ~> Pure.all |
|
1008 |
TYPE ~> Pure.type |
|
1009 |
dummy_pattern ~> Pure.dummy_pattern |
|
1010 |
||
1011 |
Systematic porting works by using the following theory setup on a |
|
1012 |
*previous* Isabelle version to introduce the new name accesses for the |
|
1013 |
old constants: |
|
1014 |
||
1015 |
setup {* |
|
1016 |
fn thy => thy |
|
1017 |
|> Sign.root_path |
|
1018 |
|> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "==" |
|
1019 |
|> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>" |
|
1020 |
|> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all" |
|
1021 |
|> Sign.restore_naming thy |
|
1022 |
*} |
|
1023 |
||
1024 |
Thus ML antiquotations like @{const_name Pure.eq} may be used already. |
|
1025 |
Later the application is moved to the current Isabelle version, and |
|
1026 |
the auxiliary aliases are deleted. |
|
1027 |
||
55143
04448228381d
explicit eigen-context for attributes "where", "of", and corresponding read_instantiate, instantiate_tac;
wenzelm
parents:
55139
diff
changeset
|
1028 |
* Attributes "where" and "of" allow an optional context of local |
04448228381d
explicit eigen-context for attributes "where", "of", and corresponding read_instantiate, instantiate_tac;
wenzelm
parents:
55139
diff
changeset
|
1029 |
variables ('for' declaration): these variables become schematic in the |
04448228381d
explicit eigen-context for attributes "where", "of", and corresponding read_instantiate, instantiate_tac;
wenzelm
parents:
55139
diff
changeset
|
1030 |
instantiated theorem. |
04448228381d
explicit eigen-context for attributes "where", "of", and corresponding read_instantiate, instantiate_tac;
wenzelm
parents:
55139
diff
changeset
|
1031 |
|
55152 | 1032 |
* Obsolete attribute "standard" has been discontinued (legacy since |
1033 |
Isabelle2012). Potential INCOMPATIBILITY, use explicit 'for' context |
|
1034 |
where instantiations with schematic variables are intended (for |
|
1035 |
declaration commands like 'lemmas' or attributes like "of"). The |
|
1036 |
following temporary definition may help to port old applications: |
|
1037 |
||
1038 |
attribute_setup standard = |
|
1039 |
"Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))" |
|
1040 |
||
55001 | 1041 |
* More thorough check of proof context for goal statements and |
55006 | 1042 |
attributed fact expressions (concerning background theory, declared |
1043 |
hyps). Potential INCOMPATIBILITY, tools need to observe standard |
|
1044 |
context discipline. See also Assumption.add_assumes and the more |
|
1045 |
primitive Thm.assume_hyps. |
|
55001 | 1046 |
|
55108
0b7a0c1fdf7e
inner syntax token language allows regular quoted strings;
wenzelm
parents:
55049
diff
changeset
|
1047 |
* Inner syntax token language allows regular quoted strings "..." |
0b7a0c1fdf7e
inner syntax token language allows regular quoted strings;
wenzelm
parents:
55049
diff
changeset
|
1048 |
(only makes sense in practice, if outer syntax is delimited |
57452 | 1049 |
differently, e.g. via cartouches). |
1050 |
||
57504 | 1051 |
* Command 'print_term_bindings' supersedes 'print_binds' for clarity, |
1052 |
but the latter is retained some time as Proof General legacy. |
|
1053 |
||
57452 | 1054 |
* Code generator preprocessor: explicit control of simp tracing on a |
1055 |
per-constant basis. See attribute "code_preproc". |
|
57430
020cea57eaa4
tracing facilities for the code generator preprocessor
haftmann
parents:
57423
diff
changeset
|
1056 |
|
55001 | 1057 |
|
54227
63b441f49645
moving generic lemmas out of theory parity, disregarding some unused auxiliary lemmas;
haftmann
parents:
54055
diff
changeset
|
1058 |
*** HOL *** |
63b441f49645
moving generic lemmas out of theory parity, disregarding some unused auxiliary lemmas;
haftmann
parents:
54055
diff
changeset
|
1059 |
|
57504 | 1060 |
* Code generator: enforce case of identifiers only for strict target |
1061 |
language requirements. INCOMPATIBILITY. |
|
1062 |
||
1063 |
* Code generator: explicit proof contexts in many ML interfaces. |
|
1064 |
INCOMPATIBILITY. |
|
1065 |
||
1066 |
* Code generator: minimize exported identifiers by default. Minor |
|
1067 |
INCOMPATIBILITY. |
|
1068 |
||
1069 |
* Code generation for SML and OCaml: dropped arcane "no_signatures" |
|
1070 |
option. Minor INCOMPATIBILITY. |
|
1071 |
||
1072 |
* "declare [[code abort: ...]]" replaces "code_abort ...". |
|
1073 |
INCOMPATIBILITY. |
|
1074 |
||
1075 |
* "declare [[code drop: ...]]" drops all code equations associated |
|
1076 |
with the given constants. |
|
1077 |
||
1078 |
* Code generations are provided for make, fields, extend and truncate |
|
1079 |
operations on records. |
|
57437 | 1080 |
|
57452 | 1081 |
* Command and antiquotation "value" are now hardcoded against nbe and |
1082 |
ML. Minor INCOMPATIBILITY. |
|
1083 |
||
57504 | 1084 |
* Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY. |
1085 |
||
1086 |
* The symbol "\<newline>" may be used within char or string literals |
|
1087 |
to represent (Char Nibble0 NibbleA), i.e. ASCII newline. |
|
1088 |
||
1089 |
* Qualified String.implode and String.explode. INCOMPATIBILITY. |
|
56923 | 1090 |
|
57452 | 1091 |
* Simplifier: Enhanced solver of preconditions of rewrite rules can |
1092 |
now deal with conjunctions. For help with converting proofs, the old |
|
1093 |
behaviour of the simplifier can be restored like this: declare/using |
|
1094 |
[[simp_legacy_precond]]. This configuration option will disappear |
|
1095 |
again in the future. INCOMPATIBILITY. |
|
56073
29e308b56d23
enhanced simplifier solver for preconditions of rewrite rule, can now deal with conjunctions
nipkow
parents:
56072
diff
changeset
|
1096 |
|
55139 | 1097 |
* Simproc "finite_Collect" is no longer enabled by default, due to |
1098 |
spurious crashes and other surprises. Potential INCOMPATIBILITY. |
|
1099 |
||
57452 | 1100 |
* Moved new (co)datatype package and its dependencies from session |
1101 |
"HOL-BNF" to "HOL". The commands 'bnf', 'wrap_free_constructors', |
|
1102 |
'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now |
|
1103 |
part of theory "Main". |
|
1104 |
||
55098 | 1105 |
Theory renamings: |
1106 |
FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy) |
|
1107 |
Library/Wfrec.thy ~> Wfrec.thy |
|
1108 |
Library/Zorn.thy ~> Zorn.thy |
|
1109 |
Cardinals/Order_Relation.thy ~> Order_Relation.thy |
|
1110 |
Library/Order_Union.thy ~> Cardinals/Order_Union.thy |
|
1111 |
Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy |
|
1112 |
Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy |
|
1113 |
Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy |
|
1114 |
Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy |
|
1115 |
Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy |
|
1116 |
BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy |
|
1117 |
BNF/Basic_BNFs.thy ~> Basic_BNFs.thy |
|
1118 |
BNF/BNF_Comp.thy ~> BNF_Comp.thy |
|
1119 |
BNF/BNF_Def.thy ~> BNF_Def.thy |
|
1120 |
BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy |
|
1121 |
BNF/BNF_GFP.thy ~> BNF_GFP.thy |
|
1122 |
BNF/BNF_LFP.thy ~> BNF_LFP.thy |
|
1123 |
BNF/BNF_Util.thy ~> BNF_Util.thy |
|
1124 |
BNF/Coinduction.thy ~> Coinduction.thy |
|
1125 |
BNF/More_BNFs.thy ~> Library/More_BNFs.thy |
|
1126 |
BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy |
|
1127 |
BNF/Examples/* ~> BNF_Examples/* |
|
57452 | 1128 |
|
55098 | 1129 |
New theories: |
1130 |
Wellorder_Extension.thy (split from Zorn.thy) |
|
1131 |
Library/Cardinal_Notations.thy |
|
56942 | 1132 |
Library/BNF_Axomatization.thy |
55098 | 1133 |
BNF_Examples/Misc_Primcorec.thy |
1134 |
BNF_Examples/Stream_Processor.thy |
|
57452 | 1135 |
|
55519 | 1136 |
Discontinued theories: |
55098 | 1137 |
BNF/BNF.thy |
1138 |
BNF/Equiv_Relations_More.thy |
|
57452 | 1139 |
|
1140 |
INCOMPATIBILITY. |
|
55098 | 1141 |
|
56118
d3967fdc800a
updated NEWS and CONTRIBUTORS (BNF, SMT2, Sledgehammer)
blanchet
parents:
56076
diff
changeset
|
1142 |
* New (co)datatype package: |
57452 | 1143 |
- Command 'primcorec' is fully implemented. |
1144 |
- Command 'datatype_new' generates size functions ("size_xxx" and |
|
1145 |
"size") as required by 'fun'. |
|
1146 |
- BNFs are integrated with the Lifting tool and new-style |
|
1147 |
(co)datatypes with Transfer. |
|
1148 |
- Renamed commands: |
|
55875 | 1149 |
datatype_new_compat ~> datatype_compat |
1150 |
primrec_new ~> primrec |
|
1151 |
wrap_free_constructors ~> free_constructors |
|
1152 |
INCOMPATIBILITY. |
|
57452 | 1153 |
- The generated constants "xxx_case" and "xxx_rec" have been renamed |
55875 | 1154 |
"case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod"). |
1155 |
INCOMPATIBILITY. |
|
57452 | 1156 |
- The constant "xxx_(un)fold" and related theorems are no longer |
1157 |
generated. Use "xxx_(co)rec" or define "xxx_(un)fold" manually |
|
1158 |
using "prim(co)rec". |
|
55875 | 1159 |
INCOMPATIBILITY. |
57452 | 1160 |
- No discriminators are generated for nullary constructors by |
1161 |
default, eliminating the need for the odd "=:" syntax. |
|
57091 | 1162 |
INCOMPATIBILITY. |
57452 | 1163 |
- No discriminators or selectors are generated by default by |
57094
589ec121ce1a
don't generate discriminators and selectors for 'datatype_new' unless the user asked for it
blanchet
parents:
57091
diff
changeset
|
1164 |
"datatype_new", unless custom names are specified or the new |
589ec121ce1a
don't generate discriminators and selectors for 'datatype_new' unless the user asked for it
blanchet
parents:
57091
diff
changeset
|
1165 |
"discs_sels" option is passed. |
589ec121ce1a
don't generate discriminators and selectors for 'datatype_new' unless the user asked for it
blanchet
parents:
57091
diff
changeset
|
1166 |
INCOMPATIBILITY. |
55875 | 1167 |
|
55643 | 1168 |
* Old datatype package: |
57452 | 1169 |
- The generated theorems "xxx.cases" and "xxx.recs" have been |
1170 |
renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" -> |
|
1171 |
"sum.case"). INCOMPATIBILITY. |
|
1172 |
- The generated constants "xxx_case", "xxx_rec", and "xxx_size" have |
|
1173 |
been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g., |
|
1174 |
"prod_case" ~> "case_prod"). INCOMPATIBILITY. |
|
1175 |
||
1176 |
* The types "'a list" and "'a option", their set and map functions, |
|
1177 |
their relators, and their selectors are now produced using the new |
|
1178 |
BNF-based datatype package. |
|
1179 |
||
55519 | 1180 |
Renamed constants: |
1181 |
Option.set ~> set_option |
|
1182 |
Option.map ~> map_option |
|
55525 | 1183 |
option_rel ~> rel_option |
57452 | 1184 |
|
55519 | 1185 |
Renamed theorems: |
55585 | 1186 |
set_def ~> set_rec[abs_def] |
55519 | 1187 |
map_def ~> map_rec[abs_def] |
1188 |
Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option") |
|
56652 | 1189 |
option.recs ~> option.rec |
55524
f41ef840f09d
folded 'list_all2' with the relator generated by 'datatype_new'
blanchet
parents:
55519
diff
changeset
|
1190 |
list_all2_def ~> list_all2_iff |
55585 | 1191 |
set.simps ~> set_simps (or the slightly different "list.set") |
55519 | 1192 |
map.simps ~> list.map |
1193 |
hd.simps ~> list.sel(1) |
|
1194 |
tl.simps ~> list.sel(2-3) |
|
1195 |
the.simps ~> option.sel |
|
57452 | 1196 |
|
1197 |
INCOMPATIBILITY. |
|
55519 | 1198 |
|
55933 | 1199 |
* The following map functions and relators have been renamed: |
55939 | 1200 |
sum_map ~> map_sum |
1201 |
map_pair ~> map_prod |
|
55944 | 1202 |
prod_rel ~> rel_prod |
55943 | 1203 |
sum_rel ~> rel_sum |
55945 | 1204 |
fun_rel ~> rel_fun |
55942 | 1205 |
set_rel ~> rel_set |
1206 |
filter_rel ~> rel_filter |
|
57452 | 1207 |
fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy") |
1208 |
cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy") |
|
1209 |
vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy") |
|
1210 |
||
1211 |
INCOMPATIBILITY. |
|
1212 |
||
57826 | 1213 |
* Lifting and Transfer: |
1214 |
- a type variable as a raw type is supported |
|
1215 |
- stronger reflexivity prover |
|
1216 |
- rep_eq is always generated by lift_definition |
|
57856 | 1217 |
- setup for Lifting/Transfer is now automated for BNFs |
57826 | 1218 |
+ holds for BNFs that do not contain a dead variable |
57856 | 1219 |
+ relator_eq, relator_mono, relator_distr, relator_domain, |
57826 | 1220 |
relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total, |
1221 |
right_unique, right_total, left_unique, left_total are proved |
|
1222 |
automatically |
|
1223 |
+ definition of a predicator is generated automatically |
|
1224 |
+ simplification rules for a predicator definition are proved |
|
1225 |
automatically for datatypes |
|
1226 |
- consolidation of the setup of Lifting/Transfer |
|
57856 | 1227 |
+ property that a relator preservers reflexivity is not needed any |
57826 | 1228 |
more |
1229 |
Minor INCOMPATIBILITY. |
|
57856 | 1230 |
+ left_total and left_unique rules are now transfer rules |
57826 | 1231 |
(reflexivity_rule attribute not needed anymore) |
1232 |
INCOMPATIBILITY. |
|
57856 | 1233 |
+ Domainp does not have to be a separate assumption in |
57826 | 1234 |
relator_domain theorems (=> more natural statement) |
1235 |
INCOMPATIBILITY. |
|
1236 |
- registration of code equations is more robust |
|
1237 |
Potential INCOMPATIBILITY. |
|
1238 |
- respectfulness proof obligation is preprocessed to a more readable |
|
1239 |
form |
|
1240 |
Potential INCOMPATIBILITY. |
|
1241 |
- eq_onp is always unfolded in respectfulness proof obligation |
|
1242 |
Potential INCOMPATIBILITY. |
|
57856 | 1243 |
- unregister lifting setup for Code_Numeral.integer and |
57826 | 1244 |
Code_Numeral.natural |
1245 |
Potential INCOMPATIBILITY. |
|
1246 |
- Lifting.invariant -> eq_onp |
|
1247 |
INCOMPATIBILITY. |
|
57856 | 1248 |
|
57508 | 1249 |
* New internal SAT solver "cdclite" that produces models and proof |
1250 |
traces. This solver replaces the internal SAT solvers "enumerate" and |
|
1251 |
"dpll". Applications that explicitly used one of these two SAT |
|
1252 |
solvers should use "cdclite" instead. In addition, "cdclite" is now |
|
1253 |
the default SAT solver for the "sat" and "satx" proof methods and |
|
1254 |
corresponding tactics; the old default can be restored using "declare |
|
1255 |
[[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY. |
|
1256 |
||
1257 |
* SMT module: A new version of the SMT module, temporarily called |
|
1258 |
"SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g., |
|
1259 |
4.3). The new proof method is called "smt2". CVC3 and CVC4 are also |
|
1260 |
supported as oracles. Yices is no longer supported, because no version |
|
1261 |
of the solver can handle both SMT-LIB 2 and quantifiers. |
|
1262 |
||
1263 |
* Activation of Z3 now works via "z3_non_commercial" system option |
|
1264 |
(without requiring restart), instead of former settings variable |
|
1265 |
"Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu |
|
1266 |
Plugin Options / Isabelle / General. |
|
1267 |
||
1268 |
* Sledgehammer: |
|
1269 |
- Z3 can now produce Isar proofs. |
|
1270 |
- MaSh overhaul: |
|
57532 | 1271 |
. New SML-based learning algorithms eliminate the dependency on |
57508 | 1272 |
Python and increase performance and reliability. |
1273 |
. MaSh and MeSh are now used by default together with the |
|
1274 |
traditional MePo (Meng-Paulson) relevance filter. To disable |
|
1275 |
MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin |
|
1276 |
Options / Isabelle / General to "none". |
|
1277 |
- New option: |
|
1278 |
smt_proofs |
|
1279 |
- Renamed options: |
|
1280 |
isar_compress ~> compress |
|
1281 |
isar_try0 ~> try0 |
|
1282 |
||
1283 |
INCOMPATIBILITY. |
|
1284 |
||
1285 |
* Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead. |
|
1286 |
||
1287 |
* Nitpick: |
|
1288 |
- Fixed soundness bug whereby mutually recursive datatypes could |
|
1289 |
take infinite values. |
|
1290 |
- Fixed soundness bug with low-level number functions such as |
|
1291 |
"Abs_Integ" and "Rep_Integ". |
|
1292 |
- Removed "std" option. |
|
1293 |
- Renamed "show_datatypes" to "show_types" and "hide_datatypes" to |
|
1294 |
"hide_types". |
|
1295 |
||
1296 |
* Metis: Removed legacy proof method 'metisFT'. Use 'metis |
|
1297 |
(full_types)' instead. INCOMPATIBILITY. |
|
1298 |
||
1299 |
* Try0: Added 'algebra' and 'meson' to the set of proof methods. |
|
1300 |
||
1301 |
* Adjustion of INF and SUP operations: |
|
1302 |
- Elongated constants INFI and SUPR to INFIMUM and SUPREMUM. |
|
1303 |
- Consolidated theorem names containing INFI and SUPR: have INF and |
|
1304 |
SUP instead uniformly. |
|
1305 |
- More aggressive normalization of expressions involving INF and Inf |
|
1306 |
or SUP and Sup. |
|
1307 |
- INF_image and SUP_image do not unfold composition. |
|
1308 |
- Dropped facts INF_comp, SUP_comp. |
|
1309 |
- Default congruence rules strong_INF_cong and strong_SUP_cong, with |
|
1310 |
simplifier implication in premises. Generalize and replace former |
|
1311 |
INT_cong, SUP_cong |
|
1312 |
||
1313 |
INCOMPATIBILITY. |
|
1314 |
||
1315 |
* SUP and INF generalized to conditionally_complete_lattice. |
|
1316 |
||
1317 |
* Swapped orientation of facts image_comp and vimage_comp: |
|
1318 |
||
1319 |
image_compose ~> image_comp [symmetric] |
|
1320 |
image_comp ~> image_comp [symmetric] |
|
1321 |
vimage_compose ~> vimage_comp [symmetric] |
|
1322 |
vimage_comp ~> vimage_comp [symmetric] |
|
1323 |
||
1324 |
INCOMPATIBILITY. |
|
1325 |
||
57504 | 1326 |
* Theory reorganization: split of Big_Operators.thy into |
1327 |
Groups_Big.thy and Lattices_Big.thy. |
|
55098 | 1328 |
|
57418 | 1329 |
* Consolidated some facts about big group operators: |
1330 |
||
1331 |
setsum_0' ~> setsum.neutral |
|
1332 |
setsum_0 ~> setsum.neutral_const |
|
1333 |
setsum_addf ~> setsum.distrib |
|
1334 |
setsum_cartesian_product ~> setsum.cartesian_product |
|
1335 |
setsum_cases ~> setsum.If_cases |
|
1336 |
setsum_commute ~> setsum.commute |
|
1337 |
setsum_cong ~> setsum.cong |
|
1338 |
setsum_delta ~> setsum.delta |
|
1339 |
setsum_delta' ~> setsum.delta' |
|
1340 |
setsum_diff1' ~> setsum.remove |
|
1341 |
setsum_empty ~> setsum.empty |
|
1342 |
setsum_infinite ~> setsum.infinite |
|
1343 |
setsum_insert ~> setsum.insert |
|
1344 |
setsum_inter_restrict'' ~> setsum.inter_filter |
|
1345 |
setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left |
|
1346 |
setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right |
|
1347 |
setsum_mono_zero_left ~> setsum.mono_neutral_left |
|
1348 |
setsum_mono_zero_right ~> setsum.mono_neutral_right |
|
1349 |
setsum_reindex ~> setsum.reindex |
|
1350 |
setsum_reindex_cong ~> setsum.reindex_cong |
|
1351 |
setsum_reindex_nonzero ~> setsum.reindex_nontrivial |
|
1352 |
setsum_restrict_set ~> setsum.inter_restrict |
|
1353 |
setsum_Plus ~> setsum.Plus |
|
1354 |
setsum_setsum_restrict ~> setsum.commute_restrict |
|
1355 |
setsum_Sigma ~> setsum.Sigma |
|
1356 |
setsum_subset_diff ~> setsum.subset_diff |
|
1357 |
setsum_Un_disjoint ~> setsum.union_disjoint |
|
1358 |
setsum_UN_disjoint ~> setsum.UNION_disjoint |
|
1359 |
setsum_Un_Int ~> setsum.union_inter |
|
1360 |
setsum_Union_disjoint ~> setsum.Union_disjoint |
|
1361 |
setsum_UNION_zero ~> setsum.Union_comp |
|
1362 |
setsum_Un_zero ~> setsum.union_inter_neutral |
|
1363 |
strong_setprod_cong ~> setprod.strong_cong |
|
1364 |
strong_setsum_cong ~> setsum.strong_cong |
|
1365 |
setprod_1' ~> setprod.neutral |
|
1366 |
setprod_1 ~> setprod.neutral_const |
|
1367 |
setprod_cartesian_product ~> setprod.cartesian_product |
|
1368 |
setprod_cong ~> setprod.cong |
|
1369 |
setprod_delta ~> setprod.delta |
|
1370 |
setprod_delta' ~> setprod.delta' |
|
1371 |
setprod_empty ~> setprod.empty |
|
1372 |
setprod_infinite ~> setprod.infinite |
|
1373 |
setprod_insert ~> setprod.insert |
|
1374 |
setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left |
|
1375 |
setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right |
|
1376 |
setprod_mono_one_left ~> setprod.mono_neutral_left |
|
1377 |
setprod_mono_one_right ~> setprod.mono_neutral_right |
|
1378 |
setprod_reindex ~> setprod.reindex |
|
1379 |
setprod_reindex_cong ~> setprod.reindex_cong |
|
1380 |
setprod_reindex_nonzero ~> setprod.reindex_nontrivial |
|
1381 |
setprod_Sigma ~> setprod.Sigma |
|
1382 |
setprod_subset_diff ~> setprod.subset_diff |
|
1383 |
setprod_timesf ~> setprod.distrib |
|
1384 |
setprod_Un2 ~> setprod.union_diff2 |
|
1385 |
setprod_Un_disjoint ~> setprod.union_disjoint |
|
1386 |
setprod_UN_disjoint ~> setprod.UNION_disjoint |
|
1387 |
setprod_Un_Int ~> setprod.union_inter |
|
1388 |
setprod_Union_disjoint ~> setprod.Union_disjoint |
|
1389 |
setprod_Un_one ~> setprod.union_inter_neutral |
|
1390 |
||
1391 |
Dropped setsum_cong2 (simple variant of setsum.cong). |
|
1392 |
Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict) |
|
1393 |
Dropped setsum_reindex_id, setprod_reindex_id |
|
1394 |
(simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]). |
|
1395 |
||
57452 | 1396 |
INCOMPATIBILITY. |
1397 |
||
54864
a064732223ad
abolished slightly odd global lattice interpretation for min/max
haftmann
parents:
54850
diff
changeset
|
1398 |
* Abolished slightly odd global lattice interpretation for min/max. |
a064732223ad
abolished slightly odd global lattice interpretation for min/max
haftmann
parents:
54850
diff
changeset
|
1399 |
|
57452 | 1400 |
Fact consolidations: |
54864
a064732223ad
abolished slightly odd global lattice interpretation for min/max
haftmann
parents:
54850
diff
changeset
|
1401 |
min_max.inf_assoc ~> min.assoc |
a064732223ad
abolished slightly odd global lattice interpretation for min/max
haftmann
parents:
54850
diff
changeset
|
1402 |
min_max.inf_commute ~> min.commute |
a064732223ad
abolished slightly odd global lattice interpretation for min/max
haftmann
parents:
54850
diff
changeset
|
1403 |
min_max.inf_left_commute ~> min.left_commute |
a064732223ad
abolished slightly odd global lattice interpretation for min/max
haftmann
parents:
54850
diff
changeset
|
1404 |
min_max.inf_idem ~> min.idem |
a064732223ad
abolished slightly odd global lattice interpretation for min/max
haftmann
parents:
54850
diff
changeset
|
1405 |
min_max.inf_left_idem ~> min.left_idem |
a064732223ad
abolished slightly odd global lattice interpretation for min/max
haftmann
parents:
54850
diff
changeset
|
1406 |
min_max.inf_right_idem ~> min.right_idem |
a064732223ad
abolished slightly odd global lattice interpretation for min/max
haftmann
parents:
54850
diff
changeset
|
1407 |
min_max.sup_assoc ~> max.assoc |
a064732223ad
abolished slightly odd global lattice interpretation for min/max
haftmann
parents:
54850
diff
changeset
|
1408 |
min_max.sup_commute ~> max.commute |
a064732223ad
abolished slightly odd global lattice interpretation for min/max
haftmann
parents:
54850
diff
changeset
|
1409 |
min_max.sup_left_commute ~> max.left_commute |
a064732223ad
abolished slightly odd global lattice interpretation for min/max
haftmann
parents:
54850
diff
changeset
|
1410 |
min_max.sup_idem ~> max.idem |
a064732223ad
abolished slightly odd global lattice interpretation for min/max
haftmann
parents:
54850
diff
changeset
|
1411 |
min_max.sup_left_idem ~> max.left_idem |
a064732223ad
abolished slightly odd global lattice interpretation for min/max
haftmann
parents:
54850
diff
changeset
|
1412 |
min_max.sup_inf_distrib1 ~> max_min_distrib2 |
a064732223ad
abolished slightly odd global lattice interpretation for min/max
haftmann
parents:
54850
diff
changeset
|
1413 |
min_max.sup_inf_distrib2 ~> max_min_distrib1 |
a064732223ad
abolished slightly odd global lattice interpretation for min/max
haftmann
parents:
54850
diff
changeset
|
1414 |
min_max.inf_sup_distrib1 ~> min_max_distrib2 |
a064732223ad
abolished slightly odd global lattice interpretation for min/max
haftmann
parents:
54850
diff
changeset
|