author | wenzelm |
Thu, 04 Oct 2012 13:56:32 +0200 | |
changeset 49699 | 1301ed115729 |
parent 49647 | 21ae8500d261 |
child 49738 | 1e1611fd32df |
permissions | -rw-r--r-- |
5363 | 1 |
Isabelle NEWS -- history user-relevant changes |
2 |
============================================== |
|
2553 | 3 |
|
47887 | 4 |
New in this Isabelle version |
5 |
---------------------------- |
|
6 |
||
47967
c422128d3889
discontinued obsolete method fastsimp / tactic fast_simp_tac;
wenzelm
parents:
47958
diff
changeset
|
7 |
*** General *** |
c422128d3889
discontinued obsolete method fastsimp / tactic fast_simp_tac;
wenzelm
parents:
47958
diff
changeset
|
8 |
|
49532 | 9 |
* Prover IDE (PIDE) improvements: |
10 |
. parallel terminal proofs ('by'); |
|
11 |
. improved output panel with tooltips, hyperlinks etc.; |
|
12 |
. more efficient painting, improved reactivity; |
|
13 |
. more robust incremental parsing of outer syntax (partial |
|
14 |
comments, malformed symbols); |
|
49647 | 15 |
. smarter handling of tracing messages (via tracing_limit); |
49532 | 16 |
. more plugin options and preferences, based on Isabelle/Scala; |
17 |
. uniform Java 7 platform on Linux, Mac OS X, Windows; |
|
18 |
||
49699 | 19 |
* Configuration option show_markup controls direct inlining of markup |
20 |
into the printed representation of formal entities --- notably type |
|
21 |
and sort constraints. This enables Prover IDE users to retrieve that |
|
22 |
information via tooltips in the output window, for example. |
|
23 |
||
48890
d72ca5742f80
'ML_file' evaluates ML text from a file directly within the theory, without predeclaration via 'uses';
wenzelm
parents:
48844
diff
changeset
|
24 |
* Command 'ML_file' evaluates ML text from a file directly within the |
d72ca5742f80
'ML_file' evaluates ML text from a file directly within the theory, without predeclaration via 'uses';
wenzelm
parents:
48844
diff
changeset
|
25 |
theory, without any predeclaration via 'uses' in the theory header. |
d72ca5742f80
'ML_file' evaluates ML text from a file directly within the theory, without predeclaration via 'uses';
wenzelm
parents:
48844
diff
changeset
|
26 |
|
49243 | 27 |
* Old command 'use' command and corresponding keyword 'uses' in the |
28 |
theory header are legacy features and will be discontinued soon. |
|
29 |
Tools that load their additional source files may imitate the |
|
30 |
'ML_file' implementation, such that the system can take care of |
|
31 |
dependencies properly. |
|
32 |
||
47967
c422128d3889
discontinued obsolete method fastsimp / tactic fast_simp_tac;
wenzelm
parents:
47958
diff
changeset
|
33 |
* Discontinued obsolete method fastsimp / tactic fast_simp_tac, which |
c422128d3889
discontinued obsolete method fastsimp / tactic fast_simp_tac;
wenzelm
parents:
47958
diff
changeset
|
34 |
is called fastforce / fast_force_tac already since Isabelle2011-1. |
c422128d3889
discontinued obsolete method fastsimp / tactic fast_simp_tac;
wenzelm
parents:
47958
diff
changeset
|
35 |
|
48120
9fe0e71052a0
updated "isar-ref" manual, reduced remaining material in "ref" manual.
wenzelm
parents:
48111
diff
changeset
|
36 |
* Updated and extended "isar-ref" manual, reduced remaining material |
9fe0e71052a0
updated "isar-ref" manual, reduced remaining material in "ref" manual.
wenzelm
parents:
48111
diff
changeset
|
37 |
in old "ref" manual. |
9fe0e71052a0
updated "isar-ref" manual, reduced remaining material in "ref" manual.
wenzelm
parents:
48111
diff
changeset
|
38 |
|
47967
c422128d3889
discontinued obsolete method fastsimp / tactic fast_simp_tac;
wenzelm
parents:
47958
diff
changeset
|
39 |
|
48205 | 40 |
*** Pure *** |
41 |
||
48431
6efff142bb54
restrict unqualified imports from Haskell Prelude to a small set of fundamental operations
haftmann
parents:
48428
diff
changeset
|
42 |
* Code generation for Haskell: restrict unqualified imports from |
6efff142bb54
restrict unqualified imports from Haskell Prelude to a small set of fundamental operations
haftmann
parents:
48428
diff
changeset
|
43 |
Haskell Prelude to a small set of fundamental operations. |
6efff142bb54
restrict unqualified imports from Haskell Prelude to a small set of fundamental operations
haftmann
parents:
48428
diff
changeset
|
44 |
|
48371 | 45 |
* Command "export_code": relative file names are interpreted |
46 |
relatively to master directory of current theory rather than |
|
47 |
the rather arbitrary current working directory. |
|
48 |
INCOMPATIBILITY. |
|
49 |
||
48205 | 50 |
* Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY, |
51 |
use regular rule composition via "OF" / "THEN", or explicit proof |
|
52 |
structure instead. Note that Isabelle/ML provides a variety of |
|
53 |
operators like COMP, INCR_COMP, COMP_INCR, which need to be applied |
|
54 |
with some care where this is really required. |
|
55 |
||
48792 | 56 |
* Command 'typ' supports an additional variant with explicit sort |
57 |
constraint, to infer and check the most general type conforming to a |
|
58 |
given given sort. Example (in HOL): |
|
59 |
||
60 |
typ "_ * _ * bool * unit" :: finite |
|
61 |
||
48205 | 62 |
|
48013
44de84112a67
added optimisation for equational premises in Quickcheck; added some Quickcheck examples; NEWS
bulwahn
parents:
47979
diff
changeset
|
63 |
*** HOL *** |
44de84112a67
added optimisation for equational premises in Quickcheck; added some Quickcheck examples; NEWS
bulwahn
parents:
47979
diff
changeset
|
64 |
|
49388 | 65 |
* Class "comm_monoid_diff" formalised properties of bounded |
66 |
subtraction, with natural numbers and multisets as typical instances. |
|
67 |
||
49190 | 68 |
* Theory "Library/Option_ord" provides instantiation of option type |
69 |
to lattice type classes. |
|
70 |
||
49189 | 71 |
* New combinator "Option.these" with type "'a option set => 'a option". |
72 |
||
49145 | 73 |
* Renamed theory Library/List_Prefix to Library/Sublist. |
74 |
INCOMPATIBILITY. Related changes are: |
|
75 |
||
76 |
- Renamed constants: |
|
77 |
||
78 |
prefix ~> prefixeq |
|
79 |
strict_prefix ~> prefix |
|
80 |
||
81 |
Renamed lemmas accordingly, INCOMPATIBILITY. |
|
82 |
||
83 |
- Replaced constant "postfix" by "suffixeq" with swapped argument order |
|
84 |
(i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped old infix |
|
85 |
syntax "xs >>= ys"; use "suffixeq ys xs" instead. Renamed lemmas |
|
86 |
accordingly. INCOMPATIBILITY. |
|
87 |
||
88 |
- New constant "emb" for homeomorphic embedding on lists. New |
|
89 |
abbreviation "sub" for special case "emb (op =)". |
|
90 |
||
91 |
- Library/Sublist does no longer provide "order" and "bot" type class |
|
92 |
instances for the prefix order (merely corresponding locale |
|
93 |
interpretations). The type class instances are to be found in |
|
94 |
Library/Prefix_Order. INCOMPATIBILITY. |
|
95 |
||
96 |
- The sublist relation from Library/Sublist_Order is now based on |
|
97 |
"Sublist.sub". Replaced lemmas: |
|
98 |
||
99 |
le_list_append_le_same_iff ~> Sublist.sub_append_le_same_iff |
|
100 |
le_list_append_mono ~> Sublist.emb_append_mono |
|
101 |
le_list_below_empty ~> Sublist.emb_Nil, Sublist.emb_Nil2 |
|
102 |
le_list_Cons_EX ~> Sublist.emb_ConsD |
|
103 |
le_list_drop_Cons2 ~> Sublist.sub_Cons2' |
|
104 |
le_list_drop_Cons_neq ~> Sublist.sub_Cons2_neq |
|
105 |
le_list_drop_Cons ~> Sublist.sub_Cons' |
|
106 |
le_list_drop_many ~> Sublist.sub_drop_many |
|
107 |
le_list_filter_left ~> Sublist.sub_filter_left |
|
108 |
le_list_rev_drop_many ~> Sublist.sub_rev_drop_many |
|
109 |
le_list_rev_take_iff ~> Sublist.sub_append |
|
110 |
le_list_same_length ~> Sublist.sub_same_length |
|
111 |
le_list_take_many_iff ~> Sublist.sub_append' |
|
112 |
less_eq_list.drop ~> less_eq_list_drop |
|
113 |
less_eq_list.induct ~> less_eq_list_induct |
|
114 |
not_le_list_length ~> Sublist.not_sub_length |
|
115 |
||
116 |
INCOMPATIBILITY. |
|
117 |
||
49510
ba50d204095e
renamed "Codatatype" directory "BNF" (and corresponding session) -- this opens the door to no-nonsense session names like "HOL-BNF-LFP"
blanchet
parents:
49481
diff
changeset
|
118 |
* HOL/BNF: New (co)datatype package based on bounded natural |
ba50d204095e
renamed "Codatatype" directory "BNF" (and corresponding session) -- this opens the door to no-nonsense session names like "HOL-BNF-LFP"
blanchet
parents:
49481
diff
changeset
|
119 |
functors with support for mixed, nested recursion and interesting |
ba50d204095e
renamed "Codatatype" directory "BNF" (and corresponding session) -- this opens the door to no-nonsense session names like "HOL-BNF-LFP"
blanchet
parents:
49481
diff
changeset
|
120 |
non-free datatypes. |
48977 | 121 |
|
49310 | 122 |
* HOL/Cardinals: Theories of ordinals and cardinals |
123 |
(supersedes the AFP entry "Ordinals_and_Cardinals"). |
|
48977 | 124 |
|
48428 | 125 |
* Library/Debug.thy and Library/Parallel.thy: debugging and parallel |
126 |
execution for code generated towards Isabelle/ML. |
|
127 |
||
49481
818bf31759e7
NEWS and CONTRIBUTORS for a5377f6d9f14 and f0ecc1550998
Andreas Lochbihler
parents:
49388
diff
changeset
|
128 |
* Library/FinFun.thy: theory of almost everywhere constant functions |
818bf31759e7
NEWS and CONTRIBUTORS for a5377f6d9f14 and f0ecc1550998
Andreas Lochbihler
parents:
49388
diff
changeset
|
129 |
(supersedes the AFP entry "Code Generation for Functions as Data"). |
818bf31759e7
NEWS and CONTRIBUTORS for a5377f6d9f14 and f0ecc1550998
Andreas Lochbihler
parents:
49388
diff
changeset
|
130 |
|
818bf31759e7
NEWS and CONTRIBUTORS for a5377f6d9f14 and f0ecc1550998
Andreas Lochbihler
parents:
49388
diff
changeset
|
131 |
* Library/Phantom.thy: generic phantom type to make a type parameter |
818bf31759e7
NEWS and CONTRIBUTORS for a5377f6d9f14 and f0ecc1550998
Andreas Lochbihler
parents:
49388
diff
changeset
|
132 |
appear in a constant's type. This alternative to adding TYPE('a) as |
818bf31759e7
NEWS and CONTRIBUTORS for a5377f6d9f14 and f0ecc1550998
Andreas Lochbihler
parents:
49388
diff
changeset
|
133 |
another parameter avoids unnecessary closures in generated code. |
818bf31759e7
NEWS and CONTRIBUTORS for a5377f6d9f14 and f0ecc1550998
Andreas Lochbihler
parents:
49388
diff
changeset
|
134 |
|
48206 | 135 |
* Simproc "finite_Collect" rewrites set comprehensions into pointfree |
136 |
expressions. |
|
48111 | 137 |
|
48013
44de84112a67
added optimisation for equational premises in Quickcheck; added some Quickcheck examples; NEWS
bulwahn
parents:
47979
diff
changeset
|
138 |
* Quickcheck: |
44de84112a67
added optimisation for equational premises in Quickcheck; added some Quickcheck examples; NEWS
bulwahn
parents:
47979
diff
changeset
|
139 |
|
44de84112a67
added optimisation for equational premises in Quickcheck; added some Quickcheck examples; NEWS
bulwahn
parents:
47979
diff
changeset
|
140 |
- added an optimisation for equality premises. |
44de84112a67
added optimisation for equational premises in Quickcheck; added some Quickcheck examples; NEWS
bulwahn
parents:
47979
diff
changeset
|
141 |
It is switched on by default, and can be switched off by setting |
48977 | 142 |
the configuration quickcheck_optimise_equality to false. |
47887 | 143 |
|
48069
e9b2782c4f99
restricted Z3 by default to a fragment where proof reconstruction should not fail (for better integration with Sledgehammer) -- the full set of supported Z3 features can still be used by enabling the configuration option "z3_with_extensions"
boehmes
parents:
48013
diff
changeset
|
144 |
* The SMT solver Z3 has now by default a restricted set of directly |
e9b2782c4f99
restricted Z3 by default to a fragment where proof reconstruction should not fail (for better integration with Sledgehammer) -- the full set of supported Z3 features can still be used by enabling the configuration option "z3_with_extensions"
boehmes
parents:
48013
diff
changeset
|
145 |
supported features. For the full set of features (div/mod, nonlinear |
e9b2782c4f99
restricted Z3 by default to a fragment where proof reconstruction should not fail (for better integration with Sledgehammer) -- the full set of supported Z3 features can still be used by enabling the configuration option "z3_with_extensions"
boehmes
parents:
48013
diff
changeset
|
146 |
arithmetic, datatypes/records) with potential proof reconstruction |
e9b2782c4f99
restricted Z3 by default to a fragment where proof reconstruction should not fail (for better integration with Sledgehammer) -- the full set of supported Z3 features can still be used by enabling the configuration option "z3_with_extensions"
boehmes
parents:
48013
diff
changeset
|
147 |
failures, enable the configuration option "z3_with_extensions". |
e9b2782c4f99
restricted Z3 by default to a fragment where proof reconstruction should not fail (for better integration with Sledgehammer) -- the full set of supported Z3 features can still be used by enabling the configuration option "z3_with_extensions"
boehmes
parents:
48013
diff
changeset
|
148 |
Minor INCOMPATIBILITY. |
e9b2782c4f99
restricted Z3 by default to a fragment where proof reconstruction should not fail (for better integration with Sledgehammer) -- the full set of supported Z3 features can still be used by enabling the configuration option "z3_with_extensions"
boehmes
parents:
48013
diff
changeset
|
149 |
|
48094 | 150 |
* Sledgehammer: |
151 |
||
48402 | 152 |
- Added MaSh relevance filter based on machine-learning; see the |
153 |
Sledgehammer manual for details. |
|
48094 | 154 |
- Rationalized type encodings ("type_enc" option). |
49365 | 155 |
- Renamed "kill_provers" subcommand to "kill" |
48294 | 156 |
- Renamed options: |
157 |
max_relevant ~> max_facts |
|
158 |
relevance_thresholds ~> fact_thresholds |
|
48094 | 159 |
|
48120
9fe0e71052a0
updated "isar-ref" manual, reduced remaining material in "ref" manual.
wenzelm
parents:
48111
diff
changeset
|
160 |
|
48206 | 161 |
*** Document preparation *** |
162 |
||
163 |
* Default for \<euro> is now based on eurosym package, instead of |
|
164 |
slightly exotic babel/greek. |
|
165 |
||
48616
be8002ee43d8
document variant NAME may use different LaTeX entry point document/root_NAME.tex if that file exists;
wenzelm
parents:
48586
diff
changeset
|
166 |
* Document variant NAME may use different LaTeX entry point |
be8002ee43d8
document variant NAME may use different LaTeX entry point document/root_NAME.tex if that file exists;
wenzelm
parents:
48586
diff
changeset
|
167 |
document/root_NAME.tex if that file exists, instead of the common |
be8002ee43d8
document variant NAME may use different LaTeX entry point document/root_NAME.tex if that file exists;
wenzelm
parents:
48586
diff
changeset
|
168 |
document/root.tex. |
be8002ee43d8
document variant NAME may use different LaTeX entry point document/root_NAME.tex if that file exists;
wenzelm
parents:
48586
diff
changeset
|
169 |
|
48657
63ef2f0cf8bb
simplified custom document/build script, instead of old-style document/IsaMakefile;
wenzelm
parents:
48616
diff
changeset
|
170 |
* Simplified custom document/build script, instead of old-style |
63ef2f0cf8bb
simplified custom document/build script, instead of old-style document/IsaMakefile;
wenzelm
parents:
48616
diff
changeset
|
171 |
document/IsaMakefile. Minor INCOMPATIBILITY. |
63ef2f0cf8bb
simplified custom document/build script, instead of old-style document/IsaMakefile;
wenzelm
parents:
48616
diff
changeset
|
172 |
|
48206 | 173 |
|
48992 | 174 |
*** ML *** |
175 |
||
176 |
* Renamed Position.str_of to Position.here to emphasize that this is a |
|
177 |
formal device to inline positions into message text, but not |
|
178 |
necessarily printing visible text. |
|
179 |
||
180 |
||
48206 | 181 |
*** System *** |
182 |
||
49000 | 183 |
* The ML system is configured as regular component, and no longer |
184 |
picked up from some surrounding directory. Potential INCOMPATIBILITY |
|
185 |
for home-made configurations. |
|
186 |
||
49072
747835eb2782
"isabelle logo" produces EPS and PDF format simultaneously;
wenzelm
parents:
49000
diff
changeset
|
187 |
* The "isabelle logo" tool produces EPS and PDF format simultaneously. |
747835eb2782
"isabelle logo" produces EPS and PDF format simultaneously;
wenzelm
parents:
49000
diff
changeset
|
188 |
Minor INCOMPATIBILITY in command-line options. |
48936 | 189 |
|
48585
a82910dd2270
announce advanced support for Isabelle sessions and build management;
wenzelm
parents:
48574
diff
changeset
|
190 |
* Advanced support for Isabelle sessions and build management, see |
a82910dd2270
announce advanced support for Isabelle sessions and build management;
wenzelm
parents:
48574
diff
changeset
|
191 |
"system" manual for the chapter of that name, especially the "isabelle |
48736 | 192 |
build" tool and its examples. INCOMPATIBILITY, isabelle usedir / |
193 |
mkdir / make are rendered obsolete. |
|
194 |
||
195 |
* Discontinued obsolete "isabelle makeall". |
|
48585
a82910dd2270
announce advanced support for Isabelle sessions and build management;
wenzelm
parents:
48574
diff
changeset
|
196 |
|
48722
a5e3ba7cbb2a
discontinued obsolete IsaMakefile and ROOT.ML files from the Isabelle distribution;
wenzelm
parents:
48693
diff
changeset
|
197 |
* Discontinued obsolete IsaMakefile and ROOT.ML files from the |
a5e3ba7cbb2a
discontinued obsolete IsaMakefile and ROOT.ML files from the Isabelle distribution;
wenzelm
parents:
48693
diff
changeset
|
198 |
Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that |
a5e3ba7cbb2a
discontinued obsolete IsaMakefile and ROOT.ML files from the Isabelle distribution;
wenzelm
parents:
48693
diff
changeset
|
199 |
provides some traditional targets that invoke "isabelle build". Note |
a5e3ba7cbb2a
discontinued obsolete IsaMakefile and ROOT.ML files from the Isabelle distribution;
wenzelm
parents:
48693
diff
changeset
|
200 |
that this is inefficient! Applications of Isabelle/HOL involving |
a5e3ba7cbb2a
discontinued obsolete IsaMakefile and ROOT.ML files from the Isabelle distribution;
wenzelm
parents:
48693
diff
changeset
|
201 |
"isabelle make" should be upgraded to use "isabelle build" directly. |
a5e3ba7cbb2a
discontinued obsolete IsaMakefile and ROOT.ML files from the Isabelle distribution;
wenzelm
parents:
48693
diff
changeset
|
202 |
|
48586 | 203 |
* Discontinued obsolete Isabelle/build script, it is superseded by the |
204 |
regular isabelle build tool. For example: |
|
205 |
||
206 |
isabelle build -s -b HOLCF |
|
207 |
||
48693
ceeea46bdeba
"isabelle options" prints Isabelle system options;
wenzelm
parents:
48683
diff
changeset
|
208 |
* The "isabelle options" tool prints Isabelle system options, as |
ceeea46bdeba
"isabelle options" prints Isabelle system options;
wenzelm
parents:
48683
diff
changeset
|
209 |
required for "isabelle build", for example. |
ceeea46bdeba
"isabelle options" prints Isabelle system options;
wenzelm
parents:
48683
diff
changeset
|
210 |
|
48683 | 211 |
* The "isabelle mkroot" tool prepares session root directories for use |
212 |
with "isabelle build", similar to former "isabelle mkdir" for |
|
213 |
"isabelle usedir". |
|
214 |
||
48844 | 215 |
* The "isabelle components" tool helps to resolve add-on components |
216 |
that are not bundled, or referenced from a bare-bones repository |
|
217 |
version of Isabelle. |
|
218 |
||
48206 | 219 |
* Discontinued support for Poly/ML 5.2.1, which was the last version |
220 |
without exception positions and advanced ML compiler/toplevel |
|
221 |
configuration. |
|
222 |
||
48574 | 223 |
* Discontinued special treatment of Proof General -- no longer guess |
224 |
PROOFGENERAL_HOME based on accidental file-system layout. Minor |
|
225 |
INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS |
|
226 |
settings manually, or use a Proof General version that has been |
|
227 |
bundled as Isabelle component. |
|
48206 | 228 |
|
48120
9fe0e71052a0
updated "isar-ref" manual, reduced remaining material in "ref" manual.
wenzelm
parents:
48111
diff
changeset
|
229 |
|
47462 | 230 |
New in Isabelle2012 (May 2012) |
231 |
------------------------------ |
|
45109 | 232 |
|
45593 | 233 |
*** General *** |
234 |
||
45614 | 235 |
* Prover IDE (PIDE) improvements: |
236 |
||
47585 | 237 |
- more robust Sledgehammer integration (as before the sledgehammer |
47806 | 238 |
command-line needs to be typed into the source buffer) |
45614 | 239 |
- markup for bound variables |
47806 | 240 |
- markup for types of term variables (displayed as tooltips) |
46956
9ff441f295c2
Isabelle/jEdit supports user-defined Isar commands within the running session;
wenzelm
parents:
46948
diff
changeset
|
241 |
- support for user-defined Isar commands within the running session |
47158 | 242 |
- improved support for Unicode outside original 16bit range |
243 |
e.g. glyph for \<A> (thanks to jEdit 4.5.1) |
|
45614 | 244 |
|
47806 | 245 |
* Forward declaration of outer syntax keywords within the theory |
246 |
header -- minor INCOMPATIBILITY for user-defined commands. Allow new |
|
247 |
commands to be used in the same theory where defined. |
|
46485 | 248 |
|
47482
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
249 |
* Auxiliary contexts indicate block structure for specifications with |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
250 |
additional parameters and assumptions. Such unnamed contexts may be |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
251 |
nested within other targets, like 'theory', 'locale', 'class', |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
252 |
'instantiation' etc. Results from the local context are generalized |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
253 |
accordingly and applied to the enclosing target context. Example: |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
254 |
|
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
255 |
context |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
256 |
fixes x y z :: 'a |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
257 |
assumes xy: "x = y" and yz: "y = z" |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
258 |
begin |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
259 |
|
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
260 |
lemma my_trans: "x = z" using xy yz by simp |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
261 |
|
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
262 |
end |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
263 |
|
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
264 |
thm my_trans |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
265 |
|
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
266 |
The most basic application is to factor-out context elements of |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
267 |
several fixes/assumes/shows theorem statements, e.g. see |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
268 |
~~/src/HOL/Isar_Examples/Group_Context.thy |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
269 |
|
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
270 |
Any other local theory specification element works within the "context |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
271 |
... begin ... end" block as well. |
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset
|
272 |
|
47484 | 273 |
* Bundled declarations associate attributed fact expressions with a |
274 |
given name in the context. These may be later included in other |
|
275 |
contexts. This allows to manage context extensions casually, without |
|
47855 | 276 |
the logical dependencies of locales and locale interpretation. See |
277 |
commands 'bundle', 'include', 'including' etc. in the isar-ref manual. |
|
47484 | 278 |
|
47829 | 279 |
* Commands 'lemmas' and 'theorems' allow local variables using 'for' |
280 |
declaration, and results are standardized before being stored. Thus |
|
281 |
old-style "standard" after instantiation or composition of facts |
|
282 |
becomes obsolete. Minor INCOMPATIBILITY, due to potential change of |
|
283 |
indices of schematic variables. |
|
284 |
||
285 |
* Rule attributes in local theory declarations (e.g. locale or class) |
|
286 |
are now statically evaluated: the resulting theorem is stored instead |
|
287 |
of the original expression. INCOMPATIBILITY in rare situations, where |
|
288 |
the historic accident of dynamic re-evaluation in interpretations |
|
289 |
etc. was exploited. |
|
290 |
||
291 |
* New tutorial "Programming and Proving in Isabelle/HOL" |
|
292 |
("prog-prove"). It completely supersedes "A Tutorial Introduction to |
|
293 |
Structured Isar Proofs" ("isar-overview"), which has been removed. It |
|
294 |
also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order |
|
295 |
Logic" as the recommended beginners tutorial, but does not cover all |
|
296 |
of the material of that old tutorial. |
|
297 |
||
298 |
* Updated and extended reference manuals: "isar-ref", |
|
299 |
"implementation", "system"; reduced remaining material in old "ref" |
|
300 |
manual. |
|
301 |
||
302 |
||
303 |
*** Pure *** |
|
304 |
||
46976
80123a220219
'definition' no longer exports the foundational "raw_def";
wenzelm
parents:
46966
diff
changeset
|
305 |
* Command 'definition' no longer exports the foundational "raw_def" |
80123a220219
'definition' no longer exports the foundational "raw_def";
wenzelm
parents:
46966
diff
changeset
|
306 |
into the user context. Minor INCOMPATIBILITY, may use the regular |
80123a220219
'definition' no longer exports the foundational "raw_def";
wenzelm
parents:
46966
diff
changeset
|
307 |
"def" result with attribute "abs_def" to imitate the old version. |
80123a220219
'definition' no longer exports the foundational "raw_def";
wenzelm
parents:
46966
diff
changeset
|
308 |
|
47855 | 309 |
* Attribute "abs_def" turns an equation of the form "f x y == t" into |
310 |
"f == %x y. t", which ensures that "simp" or "unfold" steps always |
|
311 |
expand it. This also works for object-logic equality. (Formerly |
|
312 |
undocumented feature.) |
|
313 |
||
47856 | 314 |
* Sort constraints are now propagated in simultaneous statements, just |
315 |
like type constraints. INCOMPATIBILITY in rare situations, where |
|
316 |
distinct sorts used to be assigned accidentally. For example: |
|
317 |
||
318 |
lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal" |
|
319 |
||
320 |
lemma "P (x::'a)" and "Q (y::'a::bar)" |
|
321 |
-- "now uniform 'a::bar instead of default sort for first occurrence (!)" |
|
322 |
||
323 |
* Rule composition via attribute "OF" (or ML functions OF/MRS) is more |
|
324 |
tolerant against multiple unifiers, as long as the final result is |
|
325 |
unique. (As before, rules are composed in canonical right-to-left |
|
326 |
order to accommodate newly introduced premises.) |
|
327 |
||
47806 | 328 |
* Renamed some inner syntax categories: |
329 |
||
330 |
num ~> num_token |
|
331 |
xnum ~> xnum_token |
|
332 |
xstr ~> str_token |
|
333 |
||
334 |
Minor INCOMPATIBILITY. Note that in practice "num_const" or |
|
335 |
"num_position" etc. are mainly used instead (which also include |
|
336 |
position information via constraints). |
|
337 |
||
47829 | 338 |
* Simplified configuration options for syntax ambiguity: see |
339 |
"syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref |
|
340 |
manual. Minor INCOMPATIBILITY. |
|
341 |
||
47856 | 342 |
* Discontinued configuration option "syntax_positions": atomic terms |
343 |
in parse trees are always annotated by position constraints. |
|
45134 | 344 |
|
47464 | 345 |
* Old code generator for SML and its commands 'code_module', |
45383 | 346 |
'code_library', 'consts_code', 'types_code' have been discontinued. |
46028
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset
|
347 |
Use commands of the generic code generator instead. INCOMPATIBILITY. |
45383 | 348 |
|
47464 | 349 |
* Redundant attribute "code_inline" has been discontinued. Use |
350 |
"code_unfold" instead. INCOMPATIBILITY. |
|
351 |
||
352 |
* Dropped attribute "code_unfold_post" in favor of the its dual |
|
353 |
"code_abbrev", which yields a common pattern in definitions like |
|
46028
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset
|
354 |
|
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset
|
355 |
definition [code_abbrev]: "f = t" |
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset
|
356 |
|
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset
|
357 |
INCOMPATIBILITY. |
45383 | 358 |
|
47856 | 359 |
* Obsolete 'types' command has been discontinued. Use 'type_synonym' |
360 |
instead. INCOMPATIBILITY. |
|
361 |
||
362 |
* Discontinued old "prems" fact, which used to refer to the accidental |
|
363 |
collection of foundational premises in the context (already marked as |
|
364 |
legacy since Isabelle2011). |
|
47855 | 365 |
|
45427
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset
|
366 |
|
45122 | 367 |
*** HOL *** |
368 |
||
47464 | 369 |
* Type 'a set is now a proper type constructor (just as before |
370 |
Isabelle2008). Definitions mem_def and Collect_def have disappeared. |
|
371 |
Non-trivial INCOMPATIBILITY. For developments keeping predicates and |
|
47855 | 372 |
sets separate, it is often sufficient to rephrase some set S that has |
373 |
been accidentally used as predicates by "%x. x : S", and some |
|
374 |
predicate P that has been accidentally used as set by "{x. P x}". |
|
375 |
Corresponding proofs in a first step should be pruned from any |
|
376 |
tinkering with former theorems mem_def and Collect_def as far as |
|
377 |
possible. |
|
378 |
||
379 |
For developments which deliberately mix predicates and sets, a |
|
47464 | 380 |
planning step is necessary to determine what should become a predicate |
381 |
and what a set. It can be helpful to carry out that step in |
|
382 |
Isabelle2011-1 before jumping right into the current release. |
|
383 |
||
47855 | 384 |
* Code generation by default implements sets as container type rather |
385 |
than predicates. INCOMPATIBILITY. |
|
386 |
||
387 |
* New type synonym 'a rel = ('a * 'a) set |
|
388 |
||
47464 | 389 |
* The representation of numerals has changed. Datatype "num" |
390 |
represents strictly positive binary numerals, along with functions |
|
391 |
"numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent |
|
47855 | 392 |
positive and negated numeric literals, respectively. See also |
393 |
definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some |
|
394 |
user theories may require adaptations as follows: |
|
47108
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
395 |
|
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
396 |
- Theorems with number_ring or number_semiring constraints: These |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
397 |
classes are gone; use comm_ring_1 or comm_semiring_1 instead. |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
398 |
|
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
399 |
- Theories defining numeric types: Remove number, number_semiring, |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
400 |
and number_ring instances. Defer all theorems about numerals until |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
401 |
after classes one and semigroup_add have been instantiated. |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
402 |
|
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
403 |
- Numeral-only simp rules: Replace each rule having a "number_of v" |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
404 |
pattern with two copies, one for numeral and one for neg_numeral. |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
405 |
|
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
406 |
- Theorems about subclasses of semiring_1 or ring_1: These classes |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
407 |
automatically support numerals now, so more simp rules and |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
408 |
simprocs may now apply within the proof. |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
409 |
|
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
410 |
- Definitions and theorems using old constructors Pls/Min/Bit0/Bit1: |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
411 |
Redefine using other integer operations. |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset
|
412 |
|
47855 | 413 |
* Transfer: New package intended to generalize the existing |
414 |
"descending" method and related theorem attributes from the Quotient |
|
415 |
package. (Not all functionality is implemented yet, but future |
|
416 |
development will focus on Transfer as an eventual replacement for the |
|
417 |
corresponding parts of the Quotient package.) |
|
47809 | 418 |
|
419 |
- transfer_rule attribute: Maintains a collection of transfer rules, |
|
420 |
which relate constants at two different types. Transfer rules may |
|
421 |
relate different type instances of the same polymorphic constant, |
|
422 |
or they may relate an operation on a raw type to a corresponding |
|
423 |
operation on an abstract type (quotient or subtype). For example: |
|
424 |
||
425 |
((A ===> B) ===> list_all2 A ===> list_all2 B) map map |
|
426 |
(cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int |
|
427 |
||
428 |
- transfer method: Replaces a subgoal on abstract types with an |
|
429 |
equivalent subgoal on the corresponding raw types. Constants are |
|
430 |
replaced with corresponding ones according to the transfer rules. |
|
431 |
Goals are generalized over all free variables by default; this is |
|
47851 | 432 |
necessary for variables whose types change, but can be overridden |
47855 | 433 |
for specific variables with e.g. "transfer fixing: x y z". The |
47809 | 434 |
variant transfer' method allows replacing a subgoal with one that |
435 |
is logically stronger (rather than equivalent). |
|
436 |
||
437 |
- relator_eq attribute: Collects identity laws for relators of |
|
438 |
various type constructors, e.g. "list_all2 (op =) = (op =)". The |
|
439 |
transfer method uses these lemmas to infer transfer rules for |
|
440 |
non-polymorphic constants on the fly. |
|
441 |
||
442 |
- transfer_prover method: Assists with proving a transfer rule for a |
|
443 |
new constant, provided the constant is defined in terms of other |
|
444 |
constants that already have transfer rules. It should be applied |
|
445 |
after unfolding the constant definitions. |
|
446 |
||
447 |
- HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer |
|
448 |
from type nat to type int. |
|
449 |
||
47851 | 450 |
* Lifting: New package intended to generalize the quotient_definition |
451 |
facility of the Quotient package; designed to work with Transfer. |
|
47809 | 452 |
|
453 |
- lift_definition command: Defines operations on an abstract type in |
|
454 |
terms of a corresponding operation on a representation |
|
455 |
type. Example syntax: |
|
456 |
||
457 |
lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist" |
|
458 |
is List.insert |
|
459 |
||
460 |
Users must discharge a respectfulness proof obligation when each |
|
461 |
constant is defined. (For a type copy, i.e. a typedef with UNIV, |
|
462 |
the proof is discharged automatically.) The obligation is |
|
463 |
presented in a user-friendly, readable form; a respectfulness |
|
464 |
theorem in the standard format and a transfer rule are generated |
|
465 |
by the package. |
|
466 |
||
467 |
- Integration with code_abstype: For typedefs (e.g. subtypes |
|
468 |
corresponding to a datatype invariant, such as dlist), |
|
469 |
lift_definition generates a code certificate theorem and sets up |
|
470 |
code generation for each constant. |
|
471 |
||
472 |
- setup_lifting command: Sets up the Lifting package to work with a |
|
473 |
user-defined type. The user must provide either a quotient theorem |
|
474 |
or a type_definition theorem. The package configures transfer |
|
475 |
rules for equality and quantifiers on the type, and sets up the |
|
476 |
lift_definition command to work with the type. |
|
477 |
||
478 |
- Usage examples: See Quotient_Examples/Lift_DList.thy, |
|
47851 | 479 |
Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy, |
480 |
Word/Word.thy and Library/Float.thy. |
|
47809 | 481 |
|
482 |
* Quotient package: |
|
483 |
||
484 |
- The 'quotient_type' command now supports a 'morphisms' option with |
|
485 |
rep and abs functions, similar to typedef. |
|
486 |
||
487 |
- 'quotient_type' sets up new types to work with the Lifting and |
|
488 |
Transfer packages, as with 'setup_lifting'. |
|
489 |
||
490 |
- The 'quotient_definition' command now requires the user to prove a |
|
491 |
respectfulness property at the point where the constant is |
|
492 |
defined, similar to lift_definition; INCOMPATIBILITY. |
|
493 |
||
494 |
- Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems |
|
495 |
accordingly, INCOMPATIBILITY. |
|
496 |
||
497 |
* New diagnostic command 'find_unused_assms' to find potentially |
|
498 |
superfluous assumptions in theorems using Quickcheck. |
|
499 |
||
500 |
* Quickcheck: |
|
501 |
||
502 |
- Quickcheck returns variable assignments as counterexamples, which |
|
503 |
allows to reveal the underspecification of functions under test. |
|
504 |
For example, refuting "hd xs = x", it presents the variable |
|
505 |
assignment xs = [] and x = a1 as a counterexample, assuming that |
|
506 |
any property is false whenever "hd []" occurs in it. |
|
507 |
||
508 |
These counterexample are marked as potentially spurious, as |
|
509 |
Quickcheck also returns "xs = []" as a counterexample to the |
|
510 |
obvious theorem "hd xs = hd xs". |
|
511 |
||
512 |
After finding a potentially spurious counterexample, Quickcheck |
|
513 |
continues searching for genuine ones. |
|
514 |
||
515 |
By default, Quickcheck shows potentially spurious and genuine |
|
516 |
counterexamples. The option "genuine_only" sets quickcheck to only |
|
517 |
show genuine counterexamples. |
|
518 |
||
519 |
- The command 'quickcheck_generator' creates random and exhaustive |
|
520 |
value generators for a given type and operations. |
|
521 |
||
522 |
It generates values by using the operations as if they were |
|
523 |
constructors of that type. |
|
524 |
||
525 |
- Support for multisets. |
|
526 |
||
527 |
- Added "use_subtype" options. |
|
528 |
||
529 |
- Added "quickcheck_locale" configuration to specify how to process |
|
530 |
conjectures in a locale context. |
|
531 |
||
47855 | 532 |
* Nitpick: Fixed infinite loop caused by the 'peephole_optim' option |
533 |
and affecting 'rat' and 'real'. |
|
47809 | 534 |
|
535 |
* Sledgehammer: |
|
536 |
- Integrated more tightly with SPASS, as described in the ITP 2012 |
|
537 |
paper "More SPASS with Isabelle". |
|
538 |
- Made it try "smt" as a fallback if "metis" fails or times out. |
|
539 |
- Added support for the following provers: Alt-Ergo (via Why3 and |
|
540 |
TFF1), iProver, iProver-Eq. |
|
541 |
- Sped up the minimizer. |
|
542 |
- Added "lam_trans", "uncurry_aliases", and "minimize" options. |
|
543 |
- Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice"). |
|
544 |
- Renamed "sound" option to "strict". |
|
545 |
||
47855 | 546 |
* Metis: Added possibility to specify lambda translations scheme as a |
547 |
parenthesized argument (e.g., "by (metis (lifting) ...)"). |
|
548 |
||
549 |
* SMT: Renamed "smt_fixed" option to "smt_read_only_certificates". |
|
550 |
||
551 |
* Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY. |
|
47809 | 552 |
|
47856 | 553 |
* New "case_product" attribute to generate a case rule doing multiple |
554 |
case distinctions at the same time. E.g. |
|
555 |
||
556 |
list.exhaust [case_product nat.exhaust] |
|
557 |
||
558 |
produces a rule which can be used to perform case distinction on both |
|
559 |
a list and a nat. |
|
560 |
||
47809 | 561 |
* New "eventually_elim" method as a generalized variant of the |
47855 | 562 |
eventually_elim* rules. Supports structured proofs. |
563 |
||
47702
5f9ce06f281e
typedef with implicit set definition is considered legacy;
wenzelm
parents:
47694
diff
changeset
|
564 |
* Typedef with implicit set definition is considered legacy. Use |
5f9ce06f281e
typedef with implicit set definition is considered legacy;
wenzelm
parents:
47694
diff
changeset
|
565 |
"typedef (open)" form instead, which will eventually become the |
5f9ce06f281e
typedef with implicit set definition is considered legacy;
wenzelm
parents:
47694
diff
changeset
|
566 |
default. |
5f9ce06f281e
typedef with implicit set definition is considered legacy;
wenzelm
parents:
47694
diff
changeset
|
567 |
|
47856 | 568 |
* Record: code generation can be switched off manually with |
569 |
||
570 |
declare [[record_coden = false]] -- "default true" |
|
571 |
||
572 |
* Datatype: type parameters allow explicit sort constraints. |
|
573 |
||
47855 | 574 |
* Concrete syntax for case expressions includes constraints for source |
575 |
positions, and thus produces Prover IDE markup for its bindings. |
|
576 |
INCOMPATIBILITY for old-style syntax translations that augment the |
|
577 |
pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of |
|
578 |
one_case. |
|
579 |
||
580 |
* Clarified attribute "mono_set": pure declaration without modifying |
|
581 |
the result of the fact expression. |
|
582 |
||
46752
e9e7209eb375
more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset
|
583 |
* More default pred/set conversions on a couple of relation operations |
47464 | 584 |
and predicates. Added powers of predicate relations. Consolidation |
585 |
of some relation theorems: |
|
46752
e9e7209eb375
more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset
|
586 |
|
e9e7209eb375
more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset
|
587 |
converse_def ~> converse_unfold |
47549 | 588 |
rel_comp_def ~> relcomp_unfold |
47820 | 589 |
symp_def ~> (modified, use symp_def and sym_def instead) |
46752
e9e7209eb375
more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset
|
590 |
transp_def ~> transp_trans |
e9e7209eb375
more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset
|
591 |
Domain_def ~> Domain_unfold |
e9e7209eb375
more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset
|
592 |
Range_def ~> Domain_converse [symmetric] |
e9e7209eb375
more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset
|
593 |
|
46981 | 594 |
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. |
595 |
||
47464 | 596 |
See theory "Relation" for examples for making use of pred/set |
597 |
conversions by means of attributes "to_set" and "to_pred". |
|
47086 | 598 |
|
46752
e9e7209eb375
more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset
|
599 |
INCOMPATIBILITY. |
e9e7209eb375
more fundamental pred-to-set conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset
|
600 |
|
46363 | 601 |
* Renamed facts about the power operation on relations, i.e., relpow |
47464 | 602 |
to match the constant's name: |
47463 | 603 |
|
46458 | 604 |
rel_pow_1 ~> relpow_1 |
46363 | 605 |
rel_pow_0_I ~> relpow_0_I |
606 |
rel_pow_Suc_I ~> relpow_Suc_I |
|
607 |
rel_pow_Suc_I2 ~> relpow_Suc_I2 |
|
608 |
rel_pow_0_E ~> relpow_0_E |
|
609 |
rel_pow_Suc_E ~> relpow_Suc_E |
|
610 |
rel_pow_E ~> relpow_E |
|
46458 | 611 |
rel_pow_Suc_D2 ~> relpow_Suc_D2 |
47463 | 612 |
rel_pow_Suc_E2 ~> relpow_Suc_E2 |
46363 | 613 |
rel_pow_Suc_D2' ~> relpow_Suc_D2' |
614 |
rel_pow_E2 ~> relpow_E2 |
|
615 |
rel_pow_add ~> relpow_add |
|
616 |
rel_pow_commute ~> relpow |
|
617 |
rel_pow_empty ~> relpow_empty: |
|
618 |
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow |
|
619 |
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl |
|
620 |
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow |
|
621 |
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow |
|
622 |
rel_pow_fun_conv ~> relpow_fun_conv |
|
623 |
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 |
|
624 |
rel_pow_finite_bounded ~> relpow_finite_bounded |
|
625 |
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow |
|
626 |
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow |
|
627 |
single_valued_rel_pow ~> single_valued_relpow |
|
47463 | 628 |
|
46363 | 629 |
INCOMPATIBILITY. |
630 |
||
47448 | 631 |
* Theory Relation: Consolidated constant name for relation composition |
47464 | 632 |
and corresponding theorem names: |
633 |
||
47549 | 634 |
- Renamed constant rel_comp to relcomp. |
47464 | 635 |
|
47448 | 636 |
- Dropped abbreviation pred_comp. Use relcompp instead. |
47464 | 637 |
|
47448 | 638 |
- Renamed theorems: |
47464 | 639 |
|
47448 | 640 |
rel_compI ~> relcompI |
641 |
rel_compEpair ~> relcompEpair |
|
642 |
rel_compE ~> relcompE |
|
643 |
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq |
|
644 |
rel_comp_empty1 ~> relcomp_empty1 |
|
645 |
rel_comp_mono ~> relcomp_mono |
|
646 |
rel_comp_subset_Sigma ~> relcomp_subset_Sigma |
|
647 |
rel_comp_distrib ~> relcomp_distrib |
|
648 |
rel_comp_distrib2 ~> relcomp_distrib2 |
|
649 |
rel_comp_UNION_distrib ~> relcomp_UNION_distrib |
|
650 |
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 |
|
651 |
single_valued_rel_comp ~> single_valued_relcomp |
|
47549 | 652 |
rel_comp_def ~> relcomp_unfold |
47448 | 653 |
converse_rel_comp ~> converse_relcomp |
654 |
pred_compI ~> relcomppI |
|
655 |
pred_compE ~> relcomppE |
|
656 |
pred_comp_bot1 ~> relcompp_bot1 |
|
657 |
pred_comp_bot2 ~> relcompp_bot2 |
|
658 |
transp_pred_comp_less_eq ~> transp_relcompp_less_eq |
|
659 |
pred_comp_mono ~> relcompp_mono |
|
660 |
pred_comp_distrib ~> relcompp_distrib |
|
661 |
pred_comp_distrib2 ~> relcompp_distrib2 |
|
662 |
converse_pred_comp ~> converse_relcompp |
|
47464 | 663 |
|
47448 | 664 |
finite_rel_comp ~> finite_relcomp |
47464 | 665 |
|
47448 | 666 |
set_rel_comp ~> set_relcomp |
667 |
||
668 |
INCOMPATIBILITY. |
|
669 |
||
47550 | 670 |
* Theory Divides: Discontinued redundant theorems about div and mod. |
671 |
INCOMPATIBILITY, use the corresponding generic theorems instead. |
|
672 |
||
673 |
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 |
|
674 |
zdiv_self ~> div_self |
|
675 |
zmod_self ~> mod_self |
|
676 |
zdiv_zero ~> div_0 |
|
677 |
zmod_zero ~> mod_0 |
|
678 |
zdiv_zmod_equality ~> div_mod_equality2 |
|
679 |
zdiv_zmod_equality2 ~> div_mod_equality |
|
680 |
zmod_zdiv_trivial ~> mod_div_trivial |
|
681 |
zdiv_zminus_zminus ~> div_minus_minus |
|
682 |
zmod_zminus_zminus ~> mod_minus_minus |
|
683 |
zdiv_zminus2 ~> div_minus_right |
|
684 |
zmod_zminus2 ~> mod_minus_right |
|
685 |
zdiv_minus1_right ~> div_minus1_right |
|
686 |
zmod_minus1_right ~> mod_minus1_right |
|
687 |
zdvd_mult_div_cancel ~> dvd_mult_div_cancel |
|
688 |
zmod_zmult1_eq ~> mod_mult_right_eq |
|
689 |
zpower_zmod ~> power_mod |
|
690 |
zdvd_zmod ~> dvd_mod |
|
691 |
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd |
|
692 |
mod_mult_distrib ~> mult_mod_left |
|
693 |
mod_mult_distrib2 ~> mult_mod_right |
|
694 |
||
695 |
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use |
|
696 |
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. |
|
697 |
||
47551 | 698 |
* Finite_Set.fold now qualified. INCOMPATIBILITY. |
699 |
||
47552 | 700 |
* Consolidated theorem names concerning fold combinators: |
47550 | 701 |
|
702 |
inf_INFI_fold_inf ~> inf_INF_fold_inf |
|
703 |
sup_SUPR_fold_sup ~> sup_SUP_fold_sup |
|
704 |
INFI_fold_inf ~> INF_fold_inf |
|
705 |
SUPR_fold_sup ~> SUP_fold_sup |
|
706 |
union_set ~> union_set_fold |
|
707 |
minus_set ~> minus_set_fold |
|
708 |
INFI_set_fold ~> INF_set_fold |
|
709 |
SUPR_set_fold ~> SUP_set_fold |
|
710 |
INF_code ~> INF_set_foldr |
|
711 |
SUP_code ~> SUP_set_foldr |
|
712 |
foldr.simps ~> foldr.simps (in point-free formulation) |
|
713 |
foldr_fold_rev ~> foldr_conv_fold |
|
714 |
foldl_fold ~> foldl_conv_fold |
|
715 |
foldr_foldr ~> foldr_conv_foldl |
|
716 |
foldl_foldr ~> foldl_conv_foldr |
|
47552 | 717 |
fold_set_remdups ~> fold_set_fold_remdups |
718 |
fold_set ~> fold_set_fold |
|
719 |
fold1_set ~> fold1_set_fold |
|
47550 | 720 |
|
721 |
INCOMPATIBILITY. |
|
722 |
||
723 |
* Dropped rarely useful theorems concerning fold combinators: |
|
724 |
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, |
|
725 |
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, |
|
726 |
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, |
|
727 |
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, |
|
728 |
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, |
|
729 |
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. |
|
730 |
INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0" |
|
731 |
and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be |
|
732 |
useful to boil down "List.foldr" and "List.foldl" to "List.fold" by |
|
733 |
unfolding "foldr_conv_fold" and "foldl_conv_fold". |
|
734 |
||
735 |
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, |
|
736 |
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, |
|
737 |
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, |
|
738 |
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding |
|
739 |
lemmas over fold rather than foldr, or make use of lemmas |
|
740 |
fold_conv_foldr and fold_rev. |
|
741 |
||
742 |
* Congruence rules Option.map_cong and Option.bind_cong for recursion |
|
743 |
through option types. |
|
744 |
||
47856 | 745 |
* "Transitive_Closure.ntrancl": bounded transitive closure on |
746 |
relations. |
|
747 |
||
748 |
* Constant "Set.not_member" now qualified. INCOMPATIBILITY. |
|
749 |
||
750 |
* Theory Int: Discontinued many legacy theorems specific to type int. |
|
751 |
INCOMPATIBILITY, use the corresponding generic theorems instead. |
|
752 |
||
753 |
zminus_zminus ~> minus_minus |
|
754 |
zminus_0 ~> minus_zero |
|
755 |
zminus_zadd_distrib ~> minus_add_distrib |
|
756 |
zadd_commute ~> add_commute |
|
757 |
zadd_assoc ~> add_assoc |
|
758 |
zadd_left_commute ~> add_left_commute |
|
759 |
zadd_ac ~> add_ac |
|
760 |
zmult_ac ~> mult_ac |
|
761 |
zadd_0 ~> add_0_left |
|
762 |
zadd_0_right ~> add_0_right |
|
763 |
zadd_zminus_inverse2 ~> left_minus |
|
764 |
zmult_zminus ~> mult_minus_left |
|
765 |
zmult_commute ~> mult_commute |
|
766 |
zmult_assoc ~> mult_assoc |
|
767 |
zadd_zmult_distrib ~> left_distrib |
|
768 |
zadd_zmult_distrib2 ~> right_distrib |
|
769 |
zdiff_zmult_distrib ~> left_diff_distrib |
|
770 |
zdiff_zmult_distrib2 ~> right_diff_distrib |
|
771 |
zmult_1 ~> mult_1_left |
|
772 |
zmult_1_right ~> mult_1_right |
|
773 |
zle_refl ~> order_refl |
|
774 |
zle_trans ~> order_trans |
|
775 |
zle_antisym ~> order_antisym |
|
776 |
zle_linear ~> linorder_linear |
|
777 |
zless_linear ~> linorder_less_linear |
|
778 |
zadd_left_mono ~> add_left_mono |
|
779 |
zadd_strict_right_mono ~> add_strict_right_mono |
|
780 |
zadd_zless_mono ~> add_less_le_mono |
|
781 |
int_0_less_1 ~> zero_less_one |
|
782 |
int_0_neq_1 ~> zero_neq_one |
|
783 |
zless_le ~> less_le |
|
784 |
zpower_zadd_distrib ~> power_add |
|
785 |
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff |
|
786 |
zero_le_zpower_abs ~> zero_le_power_abs |
|
787 |
||
788 |
* Theory Deriv: Renamed |
|
789 |
||
790 |
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing |
|
791 |
||
792 |
* Theory Library/Multiset: Improved code generation of multisets. |
|
793 |
||
47855 | 794 |
* Theory HOL/Library/Set_Algebras: Addition and multiplication on sets |
47703 | 795 |
are expressed via type classes again. The special syntax |
796 |
\<oplus>/\<otimes> has been replaced by plain +/*. Removed constant |
|
797 |
setsum_set, which is now subsumed by Big_Operators.setsum. |
|
798 |
INCOMPATIBILITY. |
|
799 |
||
46160 | 800 |
* Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY, |
801 |
use theory HOL/Library/Nat_Bijection instead. |
|
802 |
||
47464 | 803 |
* Theory HOL/Library/RBT_Impl: Backing implementation of red-black |
804 |
trees is now inside a type class context. Names of affected |
|
805 |
operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for |
|
806 |
theories working directly with raw red-black trees, adapt the names as |
|
807 |
follows: |
|
47452 | 808 |
|
809 |
Operations: |
|
810 |
bulkload -> rbt_bulkload |
|
811 |
del_from_left -> rbt_del_from_left |
|
812 |
del_from_right -> rbt_del_from_right |
|
813 |
del -> rbt_del |
|
814 |
delete -> rbt_delete |
|
815 |
ins -> rbt_ins |
|
816 |
insert -> rbt_insert |
|
817 |
insertw -> rbt_insert_with |
|
818 |
insert_with_key -> rbt_insert_with_key |
|
819 |
map_entry -> rbt_map_entry |
|
820 |
lookup -> rbt_lookup |
|
821 |
sorted -> rbt_sorted |
|
822 |
tree_greater -> rbt_greater |
|
823 |
tree_less -> rbt_less |
|
824 |
tree_less_symbol -> rbt_less_symbol |
|
825 |
union -> rbt_union |
|
826 |
union_with -> rbt_union_with |
|
827 |
union_with_key -> rbt_union_with_key |
|
828 |
||
829 |
Lemmas: |
|
830 |
balance_left_sorted -> balance_left_rbt_sorted |
|
831 |
balance_left_tree_greater -> balance_left_rbt_greater |
|
832 |
balance_left_tree_less -> balance_left_rbt_less |
|
833 |
balance_right_sorted -> balance_right_rbt_sorted |
|
834 |
balance_right_tree_greater -> balance_right_rbt_greater |
|
835 |
balance_right_tree_less -> balance_right_rbt_less |
|
836 |
balance_sorted -> balance_rbt_sorted |
|
837 |
balance_tree_greater -> balance_rbt_greater |
|
838 |
balance_tree_less -> balance_rbt_less |
|
839 |
bulkload_is_rbt -> rbt_bulkload_is_rbt |
|
840 |
combine_sorted -> combine_rbt_sorted |
|
841 |
combine_tree_greater -> combine_rbt_greater |
|
842 |
combine_tree_less -> combine_rbt_less |
|
843 |
delete_in_tree -> rbt_delete_in_tree |
|
844 |
delete_is_rbt -> rbt_delete_is_rbt |
|
845 |
del_from_left_tree_greater -> rbt_del_from_left_rbt_greater |
|
846 |
del_from_left_tree_less -> rbt_del_from_left_rbt_less |
|
847 |
del_from_right_tree_greater -> rbt_del_from_right_rbt_greater |
|
848 |
del_from_right_tree_less -> rbt_del_from_right_rbt_less |
|
849 |
del_in_tree -> rbt_del_in_tree |
|
850 |
del_inv1_inv2 -> rbt_del_inv1_inv2 |
|
851 |
del_sorted -> rbt_del_rbt_sorted |
|
852 |
del_tree_greater -> rbt_del_rbt_greater |
|
853 |
del_tree_less -> rbt_del_rbt_less |
|
854 |
dom_lookup_Branch -> dom_rbt_lookup_Branch |
|
855 |
entries_lookup -> entries_rbt_lookup |
|
856 |
finite_dom_lookup -> finite_dom_rbt_lookup |
|
857 |
insert_sorted -> rbt_insert_rbt_sorted |
|
858 |
insertw_is_rbt -> rbt_insertw_is_rbt |
|
859 |
insertwk_is_rbt -> rbt_insertwk_is_rbt |
|
860 |
insertwk_sorted -> rbt_insertwk_rbt_sorted |
|
861 |
insertw_sorted -> rbt_insertw_rbt_sorted |
|
862 |
ins_sorted -> ins_rbt_sorted |
|
863 |
ins_tree_greater -> ins_rbt_greater |
|
864 |
ins_tree_less -> ins_rbt_less |
|
865 |
is_rbt_sorted -> is_rbt_rbt_sorted |
|
866 |
lookup_balance -> rbt_lookup_balance |
|
867 |
lookup_bulkload -> rbt_lookup_rbt_bulkload |
|
868 |
lookup_delete -> rbt_lookup_rbt_delete |
|
869 |
lookup_Empty -> rbt_lookup_Empty |
|
870 |
lookup_from_in_tree -> rbt_lookup_from_in_tree |
|
871 |
lookup_in_tree -> rbt_lookup_in_tree |
|
872 |
lookup_ins -> rbt_lookup_ins |
|
873 |
lookup_insert -> rbt_lookup_rbt_insert |
|
874 |
lookup_insertw -> rbt_lookup_rbt_insertw |
|
875 |
lookup_insertwk -> rbt_lookup_rbt_insertwk |
|
876 |
lookup_keys -> rbt_lookup_keys |
|
877 |
lookup_map -> rbt_lookup_map |
|
878 |
lookup_map_entry -> rbt_lookup_rbt_map_entry |
|
879 |
lookup_tree_greater -> rbt_lookup_rbt_greater |
|
880 |
lookup_tree_less -> rbt_lookup_rbt_less |
|
881 |
lookup_union -> rbt_lookup_rbt_union |
|
882 |
map_entry_color_of -> rbt_map_entry_color_of |
|
883 |
map_entry_inv1 -> rbt_map_entry_inv1 |
|
884 |
map_entry_inv2 -> rbt_map_entry_inv2 |
|
885 |
map_entry_is_rbt -> rbt_map_entry_is_rbt |
|
886 |
map_entry_sorted -> rbt_map_entry_rbt_sorted |
|
887 |
map_entry_tree_greater -> rbt_map_entry_rbt_greater |
|
888 |
map_entry_tree_less -> rbt_map_entry_rbt_less |
|
889 |
map_tree_greater -> map_rbt_greater |
|
890 |
map_tree_less -> map_rbt_less |
|
891 |
map_sorted -> map_rbt_sorted |
|
892 |
paint_sorted -> paint_rbt_sorted |
|
893 |
paint_lookup -> paint_rbt_lookup |
|
894 |
paint_tree_greater -> paint_rbt_greater |
|
895 |
paint_tree_less -> paint_rbt_less |
|
896 |
sorted_entries -> rbt_sorted_entries |
|
897 |
tree_greater_eq_trans -> rbt_greater_eq_trans |
|
898 |
tree_greater_nit -> rbt_greater_nit |
|
899 |
tree_greater_prop -> rbt_greater_prop |
|
900 |
tree_greater_simps -> rbt_greater_simps |
|
901 |
tree_greater_trans -> rbt_greater_trans |
|
902 |
tree_less_eq_trans -> rbt_less_eq_trans |
|
903 |
tree_less_nit -> rbt_less_nit |
|
904 |
tree_less_prop -> rbt_less_prop |
|
905 |
tree_less_simps -> rbt_less_simps |
|
906 |
tree_less_trans -> rbt_less_trans |
|
907 |
tree_ord_props -> rbt_ord_props |
|
908 |
union_Branch -> rbt_union_Branch |
|
909 |
union_is_rbt -> rbt_union_is_rbt |
|
910 |
unionw_is_rbt -> rbt_unionw_is_rbt |
|
911 |
unionwk_is_rbt -> rbt_unionwk_is_rbt |
|
912 |
unionwk_sorted -> rbt_unionwk_rbt_sorted |
|
913 |
||
47807 | 914 |
* Theory HOL/Library/Float: Floating point numbers are now defined as |
915 |
a subset of the real numbers. All operations are defined using the |
|
916 |
lifing-framework and proofs use the transfer method. INCOMPATIBILITY. |
|
47616 | 917 |
|
918 |
Changed Operations: |
|
47622 | 919 |
float_abs -> abs |
920 |
float_nprt -> nprt |
|
921 |
float_pprt -> pprt |
|
922 |
pow2 -> use powr |
|
923 |
round_down -> float_round_down |
|
924 |
round_up -> float_round_up |
|
925 |
scale -> exponent |
|
926 |
||
927 |
Removed Operations: |
|
928 |
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod |
|
929 |
||
930 |
Renamed Lemmas: |
|
931 |
abs_float_def -> Float.compute_float_abs |
|
932 |
bitlen_ge0 -> bitlen_nonneg |
|
933 |
bitlen.simps -> Float.compute_bitlen |
|
934 |
float_components -> Float_mantissa_exponent |
|
935 |
float_divl.simps -> Float.compute_float_divl |
|
936 |
float_divr.simps -> Float.compute_float_divr |
|
937 |
float_eq_odd -> mult_powr_eq_mult_powr_iff |
|
938 |
float_power -> real_of_float_power |
|
939 |
lapprox_posrat_def -> Float.compute_lapprox_posrat |
|
940 |
lapprox_rat.simps -> Float.compute_lapprox_rat |
|
941 |
le_float_def' -> Float.compute_float_le |
|
942 |
le_float_def -> less_eq_float.rep_eq |
|
943 |
less_float_def' -> Float.compute_float_less |
|
944 |
less_float_def -> less_float.rep_eq |
|
945 |
normfloat_def -> Float.compute_normfloat |
|
946 |
normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0 |
|
947 |
normfloat -> normfloat_def |
|
948 |
normfloat_unique -> use normfloat_def |
|
949 |
number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral |
|
950 |
one_float_def -> Float.compute_float_one |
|
951 |
plus_float_def -> Float.compute_float_plus |
|
952 |
rapprox_posrat_def -> Float.compute_rapprox_posrat |
|
953 |
rapprox_rat.simps -> Float.compute_rapprox_rat |
|
954 |
real_of_float_0 -> zero_float.rep_eq |
|
955 |
real_of_float_1 -> one_float.rep_eq |
|
956 |
real_of_float_abs -> abs_float.rep_eq |
|
957 |
real_of_float_add -> plus_float.rep_eq |
|
958 |
real_of_float_minus -> uminus_float.rep_eq |
|
959 |
real_of_float_mult -> times_float.rep_eq |
|
960 |
real_of_float_simp -> Float.rep_eq |
|
961 |
real_of_float_sub -> minus_float.rep_eq |
|
962 |
round_down.simps -> Float.compute_float_round_down |
|
963 |
round_up.simps -> Float.compute_float_round_up |
|
964 |
times_float_def -> Float.compute_float_times |
|
965 |
uminus_float_def -> Float.compute_float_uminus |
|
966 |
zero_float_def -> Float.compute_float_zero |
|
967 |
||
968 |
Lemmas not necessary anymore, use the transfer method: |
|
969 |
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, |
|
970 |
float_divr, float_le_simp, float_less1_mantissa_bound, |
|
971 |
float_less_simp, float_less_zero, float_le_zero, |
|
972 |
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, |
|
973 |
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, |
|
974 |
lapprox_rat_bottom, normalized_float, rapprox_posrat, |
|
975 |
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, |
|
976 |
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, |
|
977 |
round_up, zero_le_float, zero_less_float |
|
47616 | 978 |
|
47856 | 979 |
* New theory HOL/Library/DAList provides an abstract type for |
980 |
association lists with distinct keys. |
|
45791 | 981 |
|
47866 | 982 |
* Session HOL/IMP: Added new theory of abstract interpretation of |
983 |
annotated commands. |
|
984 |
||
47855 | 985 |
* Session HOL-Import: Re-implementation from scratch is faster, |
986 |
simpler, and more scalable. Requires a proof bundle, which is |
|
987 |
available as an external component. Discontinued old (and mostly |
|
988 |
dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY. |
|
989 |
||
990 |
* Session HOL-Word: Discontinued many redundant theorems specific to |
|
991 |
type 'a word. INCOMPATIBILITY, use the corresponding generic theorems |
|
992 |
instead. |
|
993 |
||
994 |
word_sub_alt ~> word_sub_wi |
|
995 |
word_add_alt ~> word_add_def |
|
996 |
word_mult_alt ~> word_mult_def |
|
997 |
word_minus_alt ~> word_minus_def |
|
998 |
word_0_alt ~> word_0_wi |
|
999 |
word_1_alt ~> word_1_wi |
|
1000 |
word_add_0 ~> add_0_left |
|
1001 |
word_add_0_right ~> add_0_right |
|
1002 |
word_mult_1 ~> mult_1_left |
|
1003 |
word_mult_1_right ~> mult_1_right |
|
1004 |
word_add_commute ~> add_commute |
|
1005 |
word_add_assoc ~> add_assoc |
|
1006 |
word_add_left_commute ~> add_left_commute |
|
1007 |
word_mult_commute ~> mult_commute |
|
1008 |
word_mult_assoc ~> mult_assoc |
|
1009 |
word_mult_left_commute ~> mult_left_commute |
|
1010 |
word_left_distrib ~> left_distrib |
|
1011 |
word_right_distrib ~> right_distrib |
|
1012 |
word_left_minus ~> left_minus |
|
1013 |
word_diff_0_right ~> diff_0_right |
|
1014 |
word_diff_self ~> diff_self |
|
1015 |
word_sub_def ~> diff_minus |
|
1016 |
word_diff_minus ~> diff_minus |
|
1017 |
word_add_ac ~> add_ac |
|
1018 |
word_mult_ac ~> mult_ac |
|
1019 |
word_plus_ac0 ~> add_0_left add_0_right add_ac |
|
1020 |
word_times_ac1 ~> mult_1_left mult_1_right mult_ac |
|
1021 |
word_order_trans ~> order_trans |
|
1022 |
word_order_refl ~> order_refl |
|
1023 |
word_order_antisym ~> order_antisym |
|
1024 |
word_order_linear ~> linorder_linear |
|
1025 |
lenw1_zero_neq_one ~> zero_neq_one |
|
1026 |
word_number_of_eq ~> number_of_eq |
|
1027 |
word_of_int_add_hom ~> wi_hom_add |
|
1028 |
word_of_int_sub_hom ~> wi_hom_sub |
|
1029 |
word_of_int_mult_hom ~> wi_hom_mult |
|
1030 |
word_of_int_minus_hom ~> wi_hom_neg |
|
1031 |
word_of_int_succ_hom ~> wi_hom_succ |
|
1032 |
word_of_int_pred_hom ~> wi_hom_pred |
|
1033 |
word_of_int_0_hom ~> word_0_wi |
|
1034 |
word_of_int_1_hom ~> word_1_wi |
|
1035 |
||
47809 | 1036 |
* Session HOL-Word: New proof method "word_bitwise" for splitting |
1037 |
machine word equalities and inequalities into logical circuits, |
|
1038 |
defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction, |
|
1039 |
multiplication, shifting by constants, bitwise operators and numeric |
|
1040 |
constants. Requires fixed-length word types, not 'a word. Solves |
|
47854 | 1041 |
many standard word identities outright and converts more into first |
47809 | 1042 |
order problems amenable to blast or similar. See also examples in |
1043 |
HOL/Word/Examples/WordExamples.thy. |
|
1044 |
||
47807 | 1045 |
* Session HOL-Probability: Introduced the type "'a measure" to |
1046 |
represent measures, this replaces the records 'a algebra and 'a |
|
1047 |
measure_space. The locales based on subset_class now have two |
|
47856 | 1048 |
locale-parameters the space \<Omega> and the set of measurable sets M. |
1049 |
The product of probability spaces uses now the same constant as the |
|
1050 |
finite product of sigma-finite measure spaces "PiM :: ('i => 'a) |
|
47807 | 1051 |
measure". Most constants are defined now outside of locales and gain |
1052 |
an additional parameter, like null_sets, almost_eventually or \<mu>'. |
|
1053 |
Measure space constructions for distributions and densities now got |
|
1054 |
their own constants distr and density. Instead of using locales to |
|
1055 |
describe measure spaces with a finite space, the measure count_space |
|
1056 |
and point_measure is introduced. INCOMPATIBILITY. |
|
47694 | 1057 |
|
1058 |
Renamed constants: |
|
1059 |
measure -> emeasure |
|
1060 |
finite_measure.\<mu>' -> measure |
|
1061 |
product_algebra_generator -> prod_algebra |
|
1062 |
product_prob_space.emb -> prod_emb |
|
1063 |
product_prob_space.infprod_algebra -> PiM |
|
1064 |
||
1065 |
Removed locales: |
|
1066 |
completeable_measure_space |
|
1067 |
finite_measure_space |
|
1068 |
finite_prob_space |
|
1069 |
finite_product_finite_prob_space |
|
1070 |
finite_product_sigma_algebra |
|
1071 |
finite_sigma_algebra |
|
1072 |
measure_space |
|
1073 |
pair_finite_prob_space |
|
1074 |
pair_finite_sigma_algebra |
|
1075 |
pair_finite_space |
|
1076 |
pair_sigma_algebra |
|
1077 |
product_sigma_algebra |
|
1078 |
||
1079 |
Removed constants: |
|
47751 | 1080 |
conditional_space |
47694 | 1081 |
distribution -> use distr measure, or distributed predicate |
47751 | 1082 |
image_space |
47694 | 1083 |
joint_distribution -> use distr measure, or distributed predicate |
47751 | 1084 |
pair_measure_generator |
47694 | 1085 |
product_prob_space.infprod_algebra -> use PiM |
1086 |
subvimage |
|
1087 |
||
1088 |
Replacement theorems: |
|
47751 | 1089 |
finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite |
1090 |
finite_measure.empty_measure -> measure_empty |
|
1091 |
finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq |
|
1092 |
finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq |
|
1093 |
finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably |
|
1094 |
finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure |
|
1095 |
finite_measure.finite_measure -> finite_measure.emeasure_finite |
|
1096 |
finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton |
|
1097 |
finite_measure.positive_measure' -> measure_nonneg |
|
1098 |
finite_measure.real_measure -> finite_measure.emeasure_real |
|
1099 |
finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb |
|
1100 |
finite_product_sigma_algebra.in_P -> sets_PiM_I_finite |
|
1101 |
finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty |
|
1102 |
information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed |
|
1103 |
information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple |
|
1104 |
information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple |
|
1105 |
information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple |
|
1106 |
information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple |
|
1107 |
information_space.entropy_commute -> information_space.entropy_commute_simple |
|
1108 |
information_space.entropy_eq -> information_space.entropy_simple_distributed |
|
1109 |
information_space.entropy_generic_eq -> information_space.entropy_simple_distributed |
|
1110 |
information_space.entropy_positive -> information_space.entropy_nonneg_simple |
|
1111 |
information_space.entropy_uniform_max -> information_space.entropy_uniform |
|
1112 |
information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq |
|
1113 |
information_space.KL_eq_0 -> information_space.KL_same_eq_0 |
|
1114 |
information_space.KL_ge_0 -> information_space.KL_nonneg |
|
1115 |
information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed |
|
1116 |
information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple |
|
1117 |
Int_stable_cuboids -> Int_stable_atLeastAtMost |
|
1118 |
Int_stable_product_algebra_generator -> positive_integral |
|
1119 |
measure_preserving -> equality "distr M N f = N" "f : measurable M N" |
|
47694 | 1120 |
measure_space.additive -> emeasure_additive |
47751 | 1121 |
measure_space.AE_iff_null_set -> AE_iff_null |
1122 |
measure_space.almost_everywhere_def -> eventually_ae_filter |
|
1123 |
measure_space.almost_everywhere_vimage -> AE_distrD |
|
1124 |
measure_space.continuity_from_above -> INF_emeasure_decseq |
|
1125 |
measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq |
|
1126 |
measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq |
|
47694 | 1127 |
measure_space.continuity_from_below -> SUP_emeasure_incseq |
47751 | 1128 |
measure_space_density -> emeasure_density |
1129 |
measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density |
|
1130 |
measure_space.integrable_vimage -> integrable_distr |
|
1131 |
measure_space.integral_translated_density -> integral_density |
|
1132 |
measure_space.integral_vimage -> integral_distr |
|
1133 |
measure_space.measure_additive -> plus_emeasure |
|
1134 |
measure_space.measure_compl -> emeasure_compl |
|
1135 |
measure_space.measure_countable_increasing -> emeasure_countable_increasing |
|
1136 |
measure_space.measure_countably_subadditive -> emeasure_subadditive_countably |
|
47694 | 1137 |
measure_space.measure_decseq -> decseq_emeasure |
47751 | 1138 |
measure_space.measure_Diff -> emeasure_Diff |
1139 |
measure_space.measure_Diff_null_set -> emeasure_Diff_null_set |
|
47694 | 1140 |
measure_space.measure_eq_0 -> emeasure_eq_0 |
1141 |
measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite |
|
47751 | 1142 |
measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton |
1143 |
measure_space.measure_incseq -> incseq_emeasure |
|
1144 |
measure_space.measure_insert -> emeasure_insert |
|
1145 |
measure_space.measure_mono -> emeasure_mono |
|
1146 |
measure_space.measure_not_negative -> emeasure_not_MInf |
|
1147 |
measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq |
|
1148 |
measure_space.measure_setsum -> setsum_emeasure |
|
1149 |
measure_space.measure_setsum_split -> setsum_emeasure_cover |
|
47694 | 1150 |
measure_space.measure_space_vimage -> emeasure_distr |
47751 | 1151 |
measure_space.measure_subadditive_finite -> emeasure_subadditive_finite |
1152 |
measure_space.measure_subadditive -> subadditive |
|
1153 |
measure_space.measure_top -> emeasure_space |
|
1154 |
measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0 |
|
1155 |
measure_space.measure_Un_null_set -> emeasure_Un_null_set |
|
1156 |
measure_space.positive_integral_translated_density -> positive_integral_density |
|
1157 |
measure_space.positive_integral_vimage -> positive_integral_distr |
|
47694 | 1158 |
measure_space.real_continuity_from_above -> Lim_measure_decseq |
47751 | 1159 |
measure_space.real_continuity_from_below -> Lim_measure_incseq |
47694 | 1160 |
measure_space.real_measure_countably_subadditive -> measure_subadditive_countably |
47751 | 1161 |
measure_space.real_measure_Diff -> measure_Diff |
1162 |
measure_space.real_measure_finite_Union -> measure_finite_Union |
|
1163 |
measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton |
|
1164 |
measure_space.real_measure_subadditive -> measure_subadditive |
|
1165 |
measure_space.real_measure_Union -> measure_Union |
|
1166 |
measure_space.real_measure_UNION -> measure_UNION |
|
47694 | 1167 |
measure_space.simple_function_vimage -> simple_function_comp |
1168 |
measure_space.simple_integral_vimage -> simple_integral_distr |
|
47751 | 1169 |
measure_space.simple_integral_vimage -> simple_integral_distr |
1170 |
measure_unique_Int_stable -> measure_eqI_generator_eq |
|
1171 |
measure_unique_Int_stable_vimage -> measure_eqI_generator_eq |
|
47694 | 1172 |
pair_sigma_algebra.measurable_cut_fst -> sets_Pair1 |
1173 |
pair_sigma_algebra.measurable_cut_snd -> sets_Pair2 |
|
1174 |
pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1 |
|
1175 |
pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2 |
|
1176 |
pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff |
|
1177 |
pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap |
|
1178 |
pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap' |
|
1179 |
pair_sigma_algebra.sets_swap -> sets_pair_swap |
|
47751 | 1180 |
pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1 |
1181 |
pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2 |
|
1182 |
pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap |
|
1183 |
pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2 |
|
1184 |
pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt |
|
1185 |
pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times |
|
1186 |
prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM |
|
1187 |
prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq |
|
47694 | 1188 |
prob_space.measure_space_1 -> prob_space.emeasure_space_1 |
1189 |
prob_space.prob_space_vimage -> prob_space_distr |
|
1190 |
prob_space.random_variable_restrict -> measurable_restrict |
|
47751 | 1191 |
prob_space_unique_Int_stable -> measure_eqI_prob_space |
1192 |
product_algebraE -> prod_algebraE_all |
|
1193 |
product_algebra_generator_der -> prod_algebra_eq_finite |
|
1194 |
product_algebra_generator_into_space -> prod_algebra_sets_into_space |
|
1195 |
product_algebraI -> sets_PiM_I_finite |
|
1196 |
product_measure_exists -> product_sigma_finite.sigma_finite |
|
47694 | 1197 |
product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator |
1198 |
product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb |
|
1199 |
product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty |
|
1200 |
product_prob_space.measurable_component -> measurable_component_singleton |
|
1201 |
product_prob_space.measurable_emb -> measurable_prod_emb |
|
1202 |
product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single |
|
1203 |
product_prob_space.measurable_singleton_infprod -> measurable_component_singleton |
|
1204 |
product_prob_space.measure_emb -> emeasure_prod_emb |
|
47751 | 1205 |
product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict |
1206 |
product_sigma_algebra.product_algebra_into_space -> space_closed |
|
1207 |
product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge |
|
1208 |
product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton |
|
1209 |
product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge |
|
47694 | 1210 |
sequence_space.measure_infprod -> sequence_space.measure_PiM_countable |
47751 | 1211 |
sets_product_algebra -> sets_PiM |
1212 |
sigma_algebra.measurable_sigma -> measurable_measure_of |
|
1213 |
sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint |
|
1214 |
sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr |
|
1215 |
sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq |
|
1216 |
space_product_algebra -> space_PiM |
|
47694 | 1217 |
|
47855 | 1218 |
* Session HOL-TPTP: support to parse and import TPTP problems (all |
1219 |
languages) into Isabelle/HOL. |
|
47413 | 1220 |
|
45398
7dbb7b044a11
avoid infinite recursion in peephole optimizer function -- this had a debilitating effect on rationals and reals
blanchet
parents:
45384
diff
changeset
|
1221 |
|
45160 | 1222 |
*** FOL *** |
1223 |
||
45383 | 1224 |
* New "case_product" attribute (see HOL). |
45160 | 1225 |
|
45109 | 1226 |
|
47463 | 1227 |
*** ZF *** |
1228 |
||
1229 |
* Greater support for structured proofs involving induction or case |
|
1230 |
analysis. |
|
1231 |
||
1232 |
* Much greater use of mathematical symbols. |
|
1233 |
||
1234 |
* Removal of many ML theorem bindings. INCOMPATIBILITY. |
|
1235 |
||
1236 |
||
45128
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset
|
1237 |
*** ML *** |
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset
|
1238 |
|
46948 | 1239 |
* Antiquotation @{keyword "name"} produces a parser for outer syntax |
1240 |
from a minor keyword introduced via theory header declaration. |
|
1241 |
||
46961
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46959
diff
changeset
|
1242 |
* Antiquotation @{command_spec "name"} produces the |
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46959
diff
changeset
|
1243 |
Outer_Syntax.command_spec from a major keyword introduced via theory |
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46959
diff
changeset
|
1244 |
header declaration; it can be passed to Outer_Syntax.command etc. |
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46959
diff
changeset
|
1245 |
|
46916
e7ea35b41e2d
Local_Theory.define no longer hard-wires default theorem name -- targets/packages need to take care of it;
wenzelm
parents:
46903
diff
changeset
|
1246 |
* Local_Theory.define no longer hard-wires default theorem name |
46992
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom -- expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset
|
1247 |
"foo_def", but retains the binding as given. If that is Binding.empty |
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom -- expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset
|
1248 |
/ Attrib.empty_binding, the result is not registered as user-level |
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom -- expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset
|
1249 |
fact. The Local_Theory.define_internal variant allows to specify a |
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom -- expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset
|
1250 |
non-empty name (used for the foundation in the background theory), |
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom -- expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset
|
1251 |
while omitting the fact binding in the user-context. Potential |
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom -- expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset
|
1252 |
INCOMPATIBILITY for derived definitional packages: need to specify |
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom -- expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset
|
1253 |
naming policy for primitive definitions more explicitly. |
46916
e7ea35b41e2d
Local_Theory.define no longer hard-wires default theorem name -- targets/packages need to take care of it;
wenzelm
parents:
46903
diff
changeset
|
1254 |
|
46497
89ccf66aa73d
renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in conformance with similar operations in structure Term and Logic;
wenzelm
parents:
46493
diff
changeset
|
1255 |
* Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in |
89ccf66aa73d
renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in conformance with similar operations in structure Term and Logic;
wenzelm
parents:
46493
diff
changeset
|
1256 |
conformance with similar operations in structure Term and Logic. |
89ccf66aa73d
renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in conformance with similar operations in structure Term and Logic;
wenzelm
parents:
46493
diff
changeset
|
1257 |
|
45592 | 1258 |
* Antiquotation @{attributes [...]} embeds attribute source |
1259 |
representation into the ML text, which is particularly useful with |
|
1260 |
declarations like Local_Theory.note. |
|
1261 |
||
45128
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset
|
1262 |
* Structure Proof_Context follows standard naming scheme. Old |
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset
|
1263 |
ProofContext has been discontinued. INCOMPATIBILITY. |
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset
|
1264 |
|
45293
57def0b39696
refined Local_Theory.declaration {syntax = false, pervasive} semantics: update is applied to auxiliary context as well;
wenzelm
parents:
45233
diff
changeset
|
1265 |
* Refined Local_Theory.declaration {syntax, pervasive}, with subtle |
45298
aa35859c8741
uniform treatment of syntax declaration wrt. aux. context (NB: notation avoids duplicate mixfix internally);
wenzelm
parents:
45293
diff
changeset
|
1266 |
change of semantics: update is applied to auxiliary local theory |
45293
57def0b39696
refined Local_Theory.declaration {syntax = false, pervasive} semantics: update is applied to auxiliary context as well;
wenzelm
parents:
45233
diff
changeset
|
1267 |
context as well. |
57def0b39696
refined Local_Theory.declaration {syntax = false, pervasive} semantics: update is applied to auxiliary context as well;
wenzelm
parents:
45233
diff
changeset
|
1268 |
|
45620
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset
|
1269 |
* Modernized some old-style infix operations: |
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset
|
1270 |
|
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset
|
1271 |
addeqcongs ~> Simplifier.add_eqcong |
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset
|
1272 |
deleqcongs ~> Simplifier.del_eqcong |
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset
|
1273 |
addcongs ~> Simplifier.add_cong |
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset
|
1274 |
delcongs ~> Simplifier.del_cong |
45625
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset
|
1275 |
setmksimps ~> Simplifier.set_mksimps |
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset
|
1276 |
setmkcong ~> Simplifier.set_mkcong |
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset
|
1277 |
setmksym ~> Simplifier.set_mksym |
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset
|
1278 |
setmkeqTrue ~> Simplifier.set_mkeqTrue |
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset
|
1279 |
settermless ~> Simplifier.set_termless |
750c5a47400b
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset
|
1280 |
setsubgoaler ~> Simplifier.set_subgoaler |
45620
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset
|
1281 |
addsplits ~> Splitter.add_split |
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset
|
1282 |
delsplits ~> Splitter.del_split |
f2a587696afb
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset
|
1283 |
|
45128
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset
|
1284 |
|
47461
5a7903ba2dac
more robust treatment of ISABELLE_HOME on windows: eliminate spaces and funny unicode characters in directory name via DOS~1 notation;
wenzelm
parents:
47453
diff
changeset
|
1285 |
*** System *** |
5a7903ba2dac
more robust treatment of ISABELLE_HOME on windows: eliminate spaces and funny unicode characters in directory name via DOS~1 notation;
wenzelm
parents:
47453
diff
changeset
|
1286 |
|
47661
012a887997f3
USER_HOME settings variable points to cross-platform user home directory;
wenzelm
parents:
47659
diff
changeset
|
1287 |
* USER_HOME settings variable points to cross-platform user home |
012a887997f3
USER_HOME settings variable points to cross-platform user home directory;
wenzelm
parents:
47659
diff
changeset
|
1288 |
directory, which coincides with HOME on POSIX systems only. Likewise, |
012a887997f3
USER_HOME settings variable points to cross-platform user home directory;
wenzelm
parents:
47659
diff
changeset
|
1289 |
the Isabelle path specification "~" now expands to $USER_HOME, instead |
012a887997f3
USER_HOME settings variable points to cross-platform user home directory;
wenzelm
parents:
47659
diff
changeset
|
1290 |
of former $HOME. A different default for USER_HOME may be set |
012a887997f3
USER_HOME settings variable points to cross-platform user home directory;
wenzelm
parents:
47659
diff
changeset
|
1291 |
explicitly in shell environment, before Isabelle settings are |
012a887997f3
USER_HOME settings variable points to cross-platform user home directory;
wenzelm
parents:
47659
diff
changeset
|
1292 |
evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where |
012a887997f3
USER_HOME settings variable points to cross-platform user home directory;
wenzelm
parents:
47659
diff
changeset
|
1293 |
the generic user home was intended. |
012a887997f3
USER_HOME settings variable points to cross-platform user home directory;
wenzelm
parents:
47659
diff
changeset
|
1294 |
|
47807 | 1295 |
* ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name |
1296 |
notation, which is useful for the jEdit file browser, for example. |
|
1297 |
||
47464 | 1298 |
* ISABELLE_JDK_HOME settings variable points to JDK with javac and jar |
1299 |
(not just JRE). |
|
1300 |
||
47461
5a7903ba2dac
more robust treatment of ISABELLE_HOME on windows: eliminate spaces and funny unicode characters in directory name via DOS~1 notation;
wenzelm
parents:
47453
diff
changeset
|
1301 |
|
45109 | 1302 |
|
44801 | 1303 |
New in Isabelle2011-1 (October 2011) |
1304 |
------------------------------------ |
|
41651 | 1305 |
|
41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset
|
1306 |
*** General *** |
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset
|
1307 |
|
44760 | 1308 |
* Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as |
44968 | 1309 |
"isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line. |
44760 | 1310 |
|
44777 | 1311 |
- Management of multiple theory files directly from the editor |
44760 | 1312 |
buffer store -- bypassing the file-system (no requirement to save |
1313 |
files for checking). |
|
1314 |
||
44777 | 1315 |
- Markup of formal entities within the text buffer, with semantic |
44760 | 1316 |
highlighting, tooltips and hyperlinks to jump to defining source |
1317 |
positions. |
|
1318 |
||
44777 | 1319 |
- Improved text rendering, with sub/superscripts in the source |
1320 |
buffer (including support for copy/paste wrt. output panel, HTML |
|
1321 |
theory output and other non-Isabelle text boxes). |
|
1322 |
||
1323 |
- Refined scheduling of proof checking and printing of results, |
|
44760 | 1324 |
based on interactive editor view. (Note: jEdit folding and |
1325 |
narrowing allows to restrict buffer perspectives explicitly.) |
|
1326 |
||
44777 | 1327 |
- Reduced CPU performance requirements, usable on machines with few |
44760 | 1328 |
cores. |
1329 |
||
44777 | 1330 |
- Reduced memory requirements due to pruning of unused document |
44760 | 1331 |
versions (garbage collection). |
1332 |
||
1333 |
See also ~~/src/Tools/jEdit/README.html for further information, |
|
1334 |
including some remaining limitations. |
|
1335 |
||
44800 | 1336 |
* Theory loader: source files are exclusively located via the master |
1337 |
directory of each theory node (where the .thy file itself resides). |
|
1338 |
The global load path (such as src/HOL/Library) has been discontinued. |
|
1339 |
Note that the path element ~~ may be used to reference theories in the |
|
1340 |
Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet". |
|
1341 |
INCOMPATIBILITY. |
|
1342 |
||
41955
703ea96b13c6
files are identified via SHA1 digests -- discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset
|
1343 |
* Theory loader: source files are identified by content via SHA1 |
703ea96b13c6
files are identified via SHA1 digests -- discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset
|
1344 |
digests. Discontinued former path/modtime identification and optional |
703ea96b13c6
files are identified via SHA1 digests -- discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset
|
1345 |
ISABELLE_FILE_IDENT plugin scripts. |
703ea96b13c6
files are identified via SHA1 digests -- discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset
|
1346 |
|
41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset
|
1347 |
* Parallelization of nested Isar proofs is subject to |
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset
|
1348 |
Goal.parallel_proofs_threshold (default 100). See also isabelle |
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset
|
1349 |
usedir option -Q. |
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset
|
1350 |
|
42669
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset
|
1351 |
* Name space: former unsynchronized references are now proper |
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset
|
1352 |
configuration options, with more conventional names: |
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset
|
1353 |
|
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset
|
1354 |
long_names ~> names_long |
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset
|
1355 |
short_names ~> names_short |
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset
|
1356 |
unique_names ~> names_unique |
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset
|
1357 |
|
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset
|
1358 |
Minor INCOMPATIBILITY, need to declare options in context like this: |
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset
|
1359 |
|
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset
|
1360 |
declare [[names_unique = false]] |
42358
b47d41d9f4b5
Name_Space: proper configuration options long_names, short_names, unique_names instead of former unsynchronized references;
wenzelm
parents:
42290
diff
changeset
|
1361 |
|
42502 | 1362 |
* Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note |
1363 |
that the result needs to be unique, which means fact specifications |
|
1364 |
may have to be refined after enriching a proof context. |
|
1365 |
||
44800 | 1366 |
* Attribute "case_names" has been refined: the assumptions in each case |
1367 |
can be named now by following the case name with [name1 name2 ...]. |
|
1368 |
||
44968 | 1369 |
* Isabelle/Isar reference manual has been updated and extended: |
1370 |
- "Synopsis" provides a catalog of main Isar language concepts. |
|
1371 |
- Formal references in syntax diagrams, via @{rail} antiquotation. |
|
1372 |
- Updated material from classic "ref" manual, notably about |
|
1373 |
"Classical Reasoner". |
|
42633 | 1374 |
|
41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset
|
1375 |
|
41727
ab3f6d76fb23
available_provers ~> supported_provers (for clarity)
blanchet
parents:
41703
diff
changeset
|
1376 |
*** HOL *** |
ab3f6d76fb23
available_provers ~> supported_provers (for clarity)
blanchet
parents:
41703
diff
changeset
|
1377 |
|
44968 | 1378 |
* Class bot and top require underlying partial order rather than |
44800 | 1379 |
preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY. |
43815
4f6e2965d821
adjusted to tightened specification of classes bot and top
haftmann
parents:
43752
diff
changeset
|
1380 |
|
43940 | 1381 |
* Class complete_lattice: generalized a couple of lemmas from sets; |
44800 | 1382 |
generalized theorems INF_cong and SUP_cong. New type classes for |
1383 |
complete boolean algebras and complete linear orders. Lemmas |
|
1384 |
Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in |
|
1385 |
class complete_linorder. |
|
1386 |
||
1387 |
Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def, |
|
1388 |
Sup_fun_def, Inf_apply, Sup_apply. |
|
1389 |
||
45088 | 1390 |
Removed redundant lemmas (the right hand side gives hints how to |
1391 |
replace them for (metis ...), or (simp only: ...) proofs): |
|
45041
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
1392 |
|
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
1393 |
Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right] |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
1394 |
Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right] |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
1395 |
Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
1396 |
Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
1397 |
Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
1398 |
Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
1399 |
Inter_def ~> INF_def, image_def |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
1400 |
Union_def ~> SUP_def, image_def |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
1401 |
INT_eq ~> INF_def, and image_def |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
1402 |
UN_eq ~> SUP_def, and image_def |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
1403 |
INF_subset ~> INF_superset_mono [OF _ order_refl] |
44800 | 1404 |
|
1405 |
More consistent and comprehensive names: |
|
1406 |
||
45041
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
1407 |
INTER_eq_Inter_image ~> INF_def |
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset
|
1408 |
UNION_eq_Union_image ~> SUP_def |
43872 | 1409 |
INFI_def ~> INF_def |
1410 |
SUPR_def ~> SUP_def |
|
44103
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset
|
1411 |
INF_leI ~> INF_lower |
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset
|
1412 |
INF_leI2 ~> INF_lower2 |
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset
|
1413 |
le_INFI ~> INF_greatest |
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset
|
1414 |
le_SUPI ~> SUP_upper |
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset
|
1415 |
le_SUPI2 ~> SUP_upper2 |
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset
|
1416 |
SUP_leI ~> SUP_least |
43873 | 1417 |
INFI_bool_eq ~> INF_bool_eq |
1418 |
SUPR_bool_eq ~> SUP_bool_eq |
|
1419 |
INFI_apply ~> INF_apply |
|
1420 |
SUPR_apply ~> SUP_apply |
|
44103 |