author  wenzelm 
Wed, 15 Oct 2008 21:45:02 +0200  
changeset 28605  12d6087ec18c 
parent 28604  f36496b73227 
child 28606  e5f0f1dd2592 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

27122  4 
New in this Isabelle version 
5 
 

27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

6 

27599  7 
*** General *** 
8 

28504
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

9 
* Simplified main Isabelle executables, with less surprises on 
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

10 
caseinsensitive filesystems (such as Mac OS). 
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

11 

7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

12 
 The main Isabelle tool wrapper is now called "isabelle" instead of 
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

13 
"isatool." 
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

14 

7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

15 
 The former "isabelle" alias for "isabelleprocess" has been 
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

16 
removed (should rarely occur to regular users). 
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

17 

7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

18 
 The "Isabelle" alias for "isabelleinterface" has been removed. 
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

19 

7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

20 
Within scripts and make files, the Isabelle environment variables 
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

21 
ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE, 
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

22 
respectively. (The latter are still available as legacy feature.) 
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

23 

7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

24 
Also note that user interfaces are now better wrapped as regular 
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

25 
Isabelle tools instead of using the special isabelleinterface wrapper 
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

26 
(which can be confusing if the interface is uninstalled or changed 
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

27 
otherwise). See "isabelle tty" and "isabelle emacs" for contemporary 
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

28 
examples. 
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

29 

7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

30 
INCOMPATIBILITY, need to adapt derivative scripts. Users may need to 
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

31 
purge installed copies of Isabelle executables and rerun "isabelle 
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

32 
install p ...", or use symlinks. 
7ad7d7d6df47
simplified main Isabelle executables: removed Isabelle and isabelle (replaced by isabelleprocess), renamed isatool to isabelle;
wenzelm
parents:
28475
diff
changeset

33 

28252  34 
* The Isabelle System Manual (system) has been updated, with formally 
35 
checked references as hyperlinks. 

36 

27599  37 
* Generalized Isar history, with support for linear undo, direct state 
38 
addressing etc. 

27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

39 

27191  40 
* Recovered hiding of consts, which was accidentally broken in 
41 
Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really 

42 
makes c inaccessible; consider using ``hide (open) const c'' instead. 

43 

27599  44 
* Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML 
45 
interface instead. 

46 

47 

48 
*** Pure *** 

49 

28178
e56b8b044bef
* Changed defaults for unify configuration options;
wenzelm
parents:
28143
diff
changeset

50 
* Changed defaults for unify configuration options: 
e56b8b044bef
* Changed defaults for unify configuration options;
wenzelm
parents:
28143
diff
changeset

51 

e56b8b044bef
* Changed defaults for unify configuration options;
wenzelm
parents:
28143
diff
changeset

52 
unify_trace_bound = 50 (formerly 25) 
e56b8b044bef
* Changed defaults for unify configuration options;
wenzelm
parents:
28143
diff
changeset

53 
unify_search_bound = 60 (formerly 30) 
e56b8b044bef
* Changed defaults for unify configuration options;
wenzelm
parents:
28143
diff
changeset

54 

28143  55 
* Different bookkeeping for code equations: 
56 
a) On theory merge, the last set of code equations for a particular constant 

57 
is taken (in accordance with the policy applied by other parts of the 

58 
code generator framework). 

59 
b) Code equations stemming from explicit declarations (e.g. code attribute) 

60 
gain priority over default code equations stemming from definition, primrec, 

61 
fun etc. 

62 
INCOMPATIBILITY. 

63 

28058  64 
* Global versions of theorems stemming from classes do not carry 
65 
a parameter prefix any longer. INCOMPATIBILITY. 

66 

27761
b95e9ba0ca1d
Interpretation command (theory/proof context) no longer simplifies goal.
ballarin
parents:
27717
diff
changeset

67 
* Dropped "locale (open)". INCOMPATBILITY. 
b95e9ba0ca1d
Interpretation command (theory/proof context) no longer simplifies goal.
ballarin
parents:
27717
diff
changeset

68 

28085
914183e229e9
Interpretation commands no longer accept interpretation attributes.
ballarin
parents:
28067
diff
changeset

69 
* Interpretation commands no longer attempt to simplify goal. 
27761
b95e9ba0ca1d
Interpretation command (theory/proof context) no longer simplifies goal.
ballarin
parents:
27717
diff
changeset

70 
INCOMPATIBILITY: in rare situations the generated goal differs. Use 
b95e9ba0ca1d
Interpretation command (theory/proof context) no longer simplifies goal.
ballarin
parents:
27717
diff
changeset

71 
methods intro_locales and unfold_locales to clarify. 
27681  72 

28085
914183e229e9
Interpretation commands no longer accept interpretation attributes.
ballarin
parents:
28067
diff
changeset

73 
* Interpretation commands no longer accept interpretation attributes. 
914183e229e9
Interpretation commands no longer accept interpretation attributes.
ballarin
parents:
28067
diff
changeset

74 
INCOMPATBILITY. 
914183e229e9
Interpretation commands no longer accept interpretation attributes.
ballarin
parents:
28067
diff
changeset

75 

27651
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

76 
* Command 'instance': attached definitions no longer accepted. 
27141
9bfcdb1905e1
* Attributes cases, induct, coinduct support del option.
wenzelm
parents:
27122
diff
changeset

77 
INCOMPATIBILITY, use proper 'instantiation' target. 
27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

78 

791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

79 
* Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY. 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

80 

28114  81 
* The 'axiomatization' command now only works within a global theory 
82 
context. INCOMPATIBILITY. 

83 

27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

84 

27381  85 
*** Document preparation *** 
86 

87 
* Antiquotation @{lemma} now imitates a regular terminal proof, 

27392  88 
demanding keyword 'by' and supporting the full method expression 
27519
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

89 
syntax just like the Isar command 'by'. 
27381  90 

91 

27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

92 
*** HOL *** 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

93 

28604
f36496b73227
generic ATP manager based on threads (by Fabian Immler);
wenzelm
parents:
28563
diff
changeset

94 
* Unified theorem tables for both code code generators. Thus 
f36496b73227
generic ATP manager based on threads (by Fabian Immler);
wenzelm
parents:
28563
diff
changeset

95 
[code func] has disappeared and only [code] remains. INCOMPATIBILITY. 
f36496b73227
generic ATP manager based on threads (by Fabian Immler);
wenzelm
parents:
28563
diff
changeset

96 

f36496b73227
generic ATP manager based on threads (by Fabian Immler);
wenzelm
parents:
28563
diff
changeset

97 
* Constant "undefined" replaces "arbitrary" in most occurences. 
f36496b73227
generic ATP manager based on threads (by Fabian Immler);
wenzelm
parents:
28563
diff
changeset

98 

f36496b73227
generic ATP manager based on threads (by Fabian Immler);
wenzelm
parents:
28563
diff
changeset

99 
* Generic ATP manager for Sledgehammer, based on ML threads instead of 
28605  100 
Posix processes. Avoids potentially expensive forking of the ML 
101 
process. New threadbased implementation also works on nonUnix 

102 
platforms (Cygwin). Provers are no longer hardwired, but defined 

103 
within the theory via plain ML wrapper functions. 

28604
f36496b73227
generic ATP manager based on threads (by Fabian Immler);
wenzelm
parents:
28563
diff
changeset

104 

f36496b73227
generic ATP manager based on threads (by Fabian Immler);
wenzelm
parents:
28563
diff
changeset

105 
* Wrapper scripts for remote SystemOnTPTP service allows to use 
28475  106 
sledgehammer without local ATP installation (Vampire etc.). See also 
107 
ISABELLE_HOME/contrib/SystemOnTPTP and the VAMPIRE_HOME setting 

28604
f36496b73227
generic ATP manager based on threads (by Fabian Immler);
wenzelm
parents:
28563
diff
changeset

108 
variable. Other provers may be included via suitable ML wrappers, see 
f36496b73227
generic ATP manager based on threads (by Fabian Immler);
wenzelm
parents:
28563
diff
changeset

109 
also src/HOL/ATP_Linkup.thy. 
28474
d0b8b0a1fca5
Vampire wrapper script for remote SystemOnTPTP service (by Fabian Immler);
wenzelm
parents:
28350
diff
changeset

110 

28350  111 
* Normalization by evaluation now allows nonleftlinear equations. 
112 
Declare with attribute [code nbe]. 

113 

114 
* Command "value" now integrates different evaluation 

28248  115 
mechanisms. The result of the first successful evaluation mechanism 
116 
is printed. In square brackets a particular named evaluation 

117 
mechanisms may be specified (currently, [SML], [code] or [nbe]). See 

118 
further src/HOL/ex/Eval_Examples.thy. 

28227  119 

28088
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset

120 
* HOL/Orderings: class "wellorder" moved here, with explicit induction 
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset

121 
rule "less_induct" as assumption. For instantiation of "wellorder" by 
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset

122 
means of predicate "wf", use rule wf_wellorderI. INCOMPATIBILITY. 
27823  123 

27793  124 
* HOL/Orderings: added class "preorder" as superclass of "order". 
125 
INCOMPATIBILITY: Instantiation proofs for order, linorder 

126 
etc. slightly changed. Some theorems named order_class.* now named 

127 
preorder_class.*. 

128 

129 
* HOL/Ring_and_Field and HOL/Divides: Definition of "op dvd" has been 

130 
moved to separate class dvd in Ring_and_Field; a couple of lemmas on 

131 
dvd has been generalized to class comm_semiring_1. Likewise a bunch 

132 
of lemmas from Divides has been generalized from nat to class 

133 
semiring_div. INCOMPATIBILITY. This involves the following theorem 

134 
renames resulting from duplicate elimination: 

27651
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

135 

16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

136 
dvd_def_mod ~> dvd_eq_mod_eq_0 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

137 
zero_dvd_iff ~> dvd_0_left_iff 
28559  138 
dvd_0 ~> dvd_0_right 
27651
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

139 
DIVISION_BY_ZERO_DIV ~> div_by_0 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

140 
DIVISION_BY_ZERO_MOD ~> mod_by_0 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

141 
mult_div ~> div_mult_self2_is_id 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

142 
mult_mod ~> mod_mult_self2_is_0 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

143 

27599  144 
* HOL/Library/GCD: Curried operations gcd, lcm (for nat) and zgcd, 
145 
zlcm (for int); carried together from various gcd/lcm developements in 

146 
the HOL Distribution. zgcd and zlcm replace former igcd and ilcm; 

147 
corresponding theorems renamed accordingly. INCOMPATIBILY. To 

148 
recover tupled syntax, use syntax declarations like: 

27556  149 

150 
hide (open) const gcd 

151 
abbreviation gcd where 

152 
"gcd == (%(a, b). GCD.gcd a b)" 

153 
notation (output) 

154 
GCD.gcd ("gcd '(_, _')") 

155 

156 
(analogously for lcm, zgcd, zlcm). 

157 

158 
* HOL/Real/Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY. 

27551  159 

27651
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

160 
* New ML antiquotation @{code}: takes constant as argument, generates 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

161 
corresponding code in background and inserts name of the corresponding 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

162 
resulting ML value/function/datatype constructor binding in place. 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

163 
All occurrences of @{code} with a single ML block are generated 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

164 
simultaneously. Provides a generic and safe interface for 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

165 
instrumentalizing code generation. See HOL/ex/Code_Antiq for a toy 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

166 
example, or HOL/Complex/ex/ReflectedFerrack for a more ambitious 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

167 
application. In future you ought refrain from adhoc compiling 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

168 
generated SML code on the ML toplevel. Note that (for technical 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

169 
reasons) @{code} cannot refer to constants for which userdefined 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

170 
serializations are set. Refer to the corresponding ML counterpart 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

171 
directly in that cases. 
16a26996c30e
moved op dvd to theory Ring_and_Field; generalized a couple of lemmas
haftmann
parents:
27599
diff
changeset

172 

27424  173 
* Integrated image HOLComplex with HOL. Entry points Main.thy and 
174 
Complex_Main.thy remain as they are. 

175 

27599  176 
* New image HOLPlain provides a minimal HOL with the most important 
177 
tools available (inductive, datatype, primrec, ...). By convention 

178 
the corresponding theory Plain should be ancestor of every further 

179 
(library) theory. Some library theories now have ancestor Plain 

180 
(instead of Main), thus theory Main occasionally has to be imported 

181 
explicitly. 

27421  182 

28248  183 
* The metis method now fails in the usual manner, rather than raising 
184 
an exception, if it determines that it cannot prove the theorem. 

28233
f14f34194f63
The metis method now fails in the usual manner, rather than raising an exception,
paulson
parents:
28227
diff
changeset

185 

27324
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset

186 
* Methods "case_tac" and "induct_tac" now refer to the very same rules 
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset

187 
as the structured Isar versions "cases" and "induct", cf. the 
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset

188 
corresponding "cases" and "induct" attributes. Mutual induction rules 
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset

189 
are now presented as a list of individual projections 
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset

190 
(e.g. foo_bar.inducts for types foo and bar); the old format with 
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset

191 
explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in 
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset

192 
rare situations a different rule is selected  notably nested tuple 
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset

193 
elimination instead of former prod.exhaust: use explicit (case_tac t 
904acdaf4299
induct_tac: mutual rules work as for method "induct";
wenzelm
parents:
27305
diff
changeset

194 
rule: prod.exhaust) here. 
27122  195 

27141
9bfcdb1905e1
* Attributes cases, induct, coinduct support del option.
wenzelm
parents:
27122
diff
changeset

196 
* Attributes "cases", "induct", "coinduct" support "del" option. 
9bfcdb1905e1
* Attributes cases, induct, coinduct support del option.
wenzelm
parents:
27122
diff
changeset

197 

27122  198 
* Removed fact "case_split_thm", which duplicates "case_split". 
199 

200 
* Command 'rep_datatype': instead of theorem names the command now 

201 
takes a list of terms denoting the constructors of the type to be 

202 
represented as datatype. The characteristic theorems have to be 

203 
proven. INCOMPATIBILITY. Also observe that the following theorems 

204 
have disappeared in favour of existing ones: 

205 

27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

206 
unit_induct ~> unit.induct 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

207 
prod_induct ~> prod.induct 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

208 
sum_induct ~> sum.induct 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

209 
Suc_Suc_eq ~> nat.inject 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

210 
Suc_not_Zero Zero_not_Suc ~> nat.distinct 
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

211 

27122  212 
* Library/Nat_Infinity: added addition, numeral syntax and more 
213 
instantiations for algebraic structures. Removed some duplicate 

214 
theorems. Changes in simp rules. INCOMPATIBILITY. 

27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

215 

28088
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset

216 
* ATP selection (E/Vampire/Spass) is now via Proof General's settings 
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset

217 
menu. 
28067  218 

27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

219 

27696  220 
*** HOLAlgebra *** 
221 

27713
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset

222 
* New locales for orders and lattices where the equivalence relation 
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset

223 
is not restricted to equality. INCOMPATIBILITY: all order and 
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset

224 
lattice locales use a record structure with field eq for the 
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset

225 
equivalence. 
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset

226 

95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset

227 
* New theory of factorial domains. 
95b36bfe7fc4
New locales for orders and lattices where the equivalence relation is not restricted to equality.
ballarin
parents:
27704
diff
changeset

228 

27696  229 
* Units_l_inv and Units_r_inv are now simprules by default. 
230 
INCOMPATIBILITY. Simplifier proof that require deletion of l_inv 

231 
and/or r_inv will now also require deletion of these lemmas. 

232 

233 
* Renamed the following theorems. INCOMPATIBILITY. 

234 
UpperD ~> Upper_memD 

235 
LowerD ~> Lower_memD 

236 
least_carrier ~> least_closed 

237 
greatest_carrier ~> greatest_closed 

238 
greatest_Lower_above ~> greatest_Lower_below 

27717
21bbd410ba04
Generalised polynomial lemmas from cring to ring.
ballarin
parents:
27713
diff
changeset

239 
one_zero ~> carrier_one_zero 
21bbd410ba04
Generalised polynomial lemmas from cring to ring.
ballarin
parents:
27713
diff
changeset

240 
one_not_zero ~> carrier_one_not_zero (collision with assumption) 
27696  241 

27793  242 

27485  243 
*** HOLNSA *** 
244 

245 
* Created new image HOLNSA, containing theories of nonstandard 

246 
analysis which were previously part of HOLComplex. Entry point 

247 
Hyperreal.thy remains valid, but theories formerly using 

248 
Complex_Main.thy should now use new entry point Hypercomplex.thy. 

249 

250 

27704  251 
*** ZF *** 
252 

253 
* Proof of Zorn's Lemma for partial orders. 

254 

255 

27246
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset

256 
*** ML *** 
28088
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset

257 

28294  258 
* Simplified ML oracle interface Thm.add_oracle promotes 'a > cterm 
259 
to 'a > thm, while results are always tagged with an authentic oracle 

260 
name. The Isar command 'oracle' is now polymorphic, no argument type 

261 
is specified. INCOMPATIBILITY, need to simplify existing oracle code 

262 
accordingly. Note that extra performance may be gained by producing 

263 
the cterm carefully, avoiding slow Thm.cterm_of. 

264 

28282
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset

265 
* ML bindings produced via Isar commands are stored within the Isar 
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset

266 
context (theory or proof). Consequently, commands like 'use' and 'ML' 
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset

267 
become threadsafe and work with undo as expected (concerning 
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset

268 
toplevel bindings, not sideeffects on global references). 
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset

269 
INCOMPATIBILITY, need to provide proper Isar context when invoking the 
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset

270 
compiler at runtime; really global bindings need to be given outside a 
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset

271 
theory. [Poly/ML 5.2 or later] 
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset

272 

44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset

273 
* Command 'ML_prf' is analogous to 'ML' but works within a proof 
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset

274 
context. Toplevel ML bindings are stored within the proof context in 
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset

275 
a purely sequential fashion, disregarding the nested proof structure. 
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset

276 
ML bindings introduced by 'ML_prf' are discarded at the end of the 
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset

277 
proof. [Poly/ML 5.2 or later] 
44664ffc9725
* ML bindings produced via Isar commands are stored within the Isar context.
wenzelm
parents:
28254
diff
changeset

278 

28099
fb16a07d6580
* Generic Toplevel.add_hook interface allows to analyze the result of
wenzelm
parents:
28089
diff
changeset

279 
* Generic Toplevel.add_hook interface allows to analyze the result of 
28103
b79e61861f0f
simplified Toplevel.add_hook: cover successful transactions only;
wenzelm
parents:
28099
diff
changeset

280 
transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML 
b79e61861f0f
simplified Toplevel.add_hook: cover successful transactions only;
wenzelm
parents:
28099
diff
changeset

281 
for theorem dependency output of transactions resulting in a new 
b79e61861f0f
simplified Toplevel.add_hook: cover successful transactions only;
wenzelm
parents:
28099
diff
changeset

282 
theory state. 
28099
fb16a07d6580
* Generic Toplevel.add_hook interface allows to analyze the result of
wenzelm
parents:
28089
diff
changeset

283 

28088
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset

284 
* Name bindings in higher specification mechanisms (notably 
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset

285 
LocalTheory.define, LocalTheory.note, and derived packages) are now 
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset

286 
formalized as type Name.binding, replacing old bstring. 
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset

287 
INCOMPATIBILITY, need to wrap strings via Name.binding function, see 
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset

288 
also Name.name_of. Packages should pass name bindings given by the 
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset

289 
user to underlying specification mechanisms; this enables precise 
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset

290 
tracking of source positions, for example. 
723735f2d73a
* Name bindings in higher specification mechanisms;
wenzelm
parents:
28085
diff
changeset

291 

28089
66ae1926482a
* Result facts now refer to the *full* internal name;
wenzelm
parents:
28088
diff
changeset

292 
* Result facts (from PureThy.note_thms, ProofContext.note_thms, 
66ae1926482a
* Result facts now refer to the *full* internal name;
wenzelm
parents:
28088
diff
changeset

293 
LocalTheory.note etc.) now refer to the *full* internal name, not the 
66ae1926482a
* Result facts now refer to the *full* internal name;
wenzelm
parents:
28088
diff
changeset

294 
bstring as before. INCOMPATIBILITY, not detected by ML typechecking! 
66ae1926482a
* Result facts now refer to the *full* internal name;
wenzelm
parents:
28088
diff
changeset

295 

27246
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset

296 
* Rules and tactics that read instantiations (read_instantiate, 
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset

297 
res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof 
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset

298 
context, which is required for parsing and typechecking. Moreover, 
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset

299 
the variables are specified as plain indexnames, not string encodings 
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset

300 
thereof. INCOMPATIBILITY. 
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset

301 

27287  302 
* Disposed old type and term read functions (Sign.read_def_typ, 
303 
Sign.read_typ, Sign.read_def_terms, Sign.read_term, 

304 
Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should 

305 
use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global, 

27269  306 
Syntax.read_term_global etc.; see also OldGoals.read_term as last 
307 
resort for legacy applications. 

308 

27380  309 
* Antiquotations: blockstructured compilation context indicated by 
27391  310 
\<lbrace> ... \<rbrace>; additional antiquotation forms: 
311 

27519
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

312 
@{let ?pat = term}  term abbreviation (HO matching) 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

313 
@{note name = fact}  fact abbreviation 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

314 
@{thm fact}  singleton fact (with attributes) 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

315 
@{thms fact}  general fact (with attributes) 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

316 
@{lemma prop by method}  singleton goal 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

317 
@{lemma prop by meth1 meth2}  singleton goal 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

318 
@{lemma prop1 ... propN by method}  general goal 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

319 
@{lemma prop1 ... propN by meth1 meth2}  general goal 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

320 
@{lemma (open) ...}  open derivation 
27380  321 

27246
df85326af57c
* Rules and tactics that read instantiations now demand a proper context;
wenzelm
parents:
27200
diff
changeset

322 

27979  323 
*** System *** 
324 

28254
d67ba23e0277
multithreading for Poly/ML 5.1 is no longer supported;
wenzelm
parents:
28252
diff
changeset

325 
* Multithreading for Poly/ML 5.1 is no longer supported, only for 
d67ba23e0277
multithreading for Poly/ML 5.1 is no longer supported;
wenzelm
parents:
28252
diff
changeset

326 
Poly/ML 5.2 or later. 
d67ba23e0277
multithreading for Poly/ML 5.1 is no longer supported;
wenzelm
parents:
28252
diff
changeset

327 

28248  328 
* The Isabelle "emacs" tool provides a specific interface to invoke 
329 
Proof General / Emacs, with more explicit failure if that is not 

330 
installed (the old isabelleinterface script silently falls back on 

331 
isabelleprocess). The PROOFGENERAL_HOME setting determines the 

332 
installation location of the Proof General distribution. 

333 

27979  334 
* Isabelle/lib/classes/Pure.jar provides basic support to integrate 
335 
the Isabelle process into a JVM/Scala application. See 

336 
Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java 

337 
process wrapper has been discontinued.) 

338 

339 
* Status messages (with exact source position information) are 

340 
emitted, if proper markup print mode is enabled. This allows 

341 
userinterface components to provide detailed feedback on internal 

342 
prover operations. 

343 

344 
* Homegrown Isabelle font with unicode layout, see Isabelle/lib/fonts. 

345 

346 

27143  347 

27008  348 
New in Isabelle2008 (June 2008) 
349 
 

25464
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset

350 

25522  351 
*** General *** 
352 

27061  353 
* The Isabelle/Isar Reference Manual (isarref) has been reorganized 
354 
and updated, with formally checked references as hyperlinks. 

355 

25994  356 
* Theory loader: use_thy (and similar operations) no longer set the 
357 
implicit ML context, which was occasionally hard to predict and in 

358 
conflict with concurrency. INCOMPATIBILITY, use ML within Isar which 

359 
provides a proper context already. 

360 

26323
73efc70edeef
theory loader: discontinued *attached* ML scripts;
wenzelm
parents:
26315
diff
changeset

361 
* Theory loader: oldstyle ML proof scripts being *attached* to a thy 
73efc70edeef
theory loader: discontinued *attached* ML scripts;
wenzelm
parents:
26315
diff
changeset

362 
file are no longer supported. INCOMPATIBILITY, regular 'uses' and 
73efc70edeef
theory loader: discontinued *attached* ML scripts;
wenzelm
parents:
26315
diff
changeset

363 
'use' within a theory file will do the job. 
73efc70edeef
theory loader: discontinued *attached* ML scripts;
wenzelm
parents:
26315
diff
changeset

364 

26650  365 
* Name space merge now observes canonical order, i.e. the second space 
366 
is inserted into the first one, while existing entries in the first 

26659  367 
space take precedence. INCOMPATIBILITY in rare situations, may try to 
26650  368 
swap theory imports. 
369 

27067  370 
* Syntax: symbol \<chi> is now considered a letter. Potential 
371 
INCOMPATIBILITY in identifier syntax etc. 

372 

373 
* Outer syntax: string tokens no longer admit escaped white space, 

374 
which was an accidental (undocumented) feature. INCOMPATIBILITY, use 

375 
white space without escapes. 

376 

377 
* Outer syntax: string tokens may contain arbitrary character codes 

378 
specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for 

379 
"foo_bar". 

380 

25522  381 

25502  382 
*** Pure *** 
383 

26718  384 
* Contextdependent token translations. Default setup reverts locally 
385 
fixed variables, and adds hilite markup for undeclared frees. 

386 

26681  387 
* Unused theorems can be found using the new command 'unused_thms'. 
388 
There are three ways of invoking it: 

389 

390 
(1) unused_thms 

391 
Only finds unused theorems in the current theory. 

392 

393 
(2) unused_thms thy_1 ... thy_n  

394 
Finds unused theorems in the current theory and all of its ancestors, 

395 
excluding the theories thy_1 ... thy_n and all of their ancestors. 

396 

397 
(3) unused_thms thy_1 ... thy_n  thy'_1 ... thy'_m 

398 
Finds unused theorems in the theories thy'_1 ... thy'_m and all of 

399 
their ancestors, excluding the theories thy_1 ... thy_n and all of 

400 
their ancestors. 

401 

26718  402 
In order to increase the readability of the list produced by 
403 
unused_thms, theorems that have been created by a particular instance 

26874  404 
of a theory command such as 'inductive' or 'function' are considered 
405 
to belong to the same "group", meaning that if at least one theorem in 

26718  406 
this group is used, the other theorems in the same group are no longer 
407 
reported as unused. Moreover, if all theorems in the group are 

408 
unused, only one theorem in the group is displayed. 

409 

410 
Note that proof objects have to be switched on in order for 

411 
unused_thms to work properly (i.e. !proofs must be >= 1, which is 

26874  412 
usually the case when using Proof General with the default settings). 
26681  413 

26650  414 
* Authentic naming of facts disallows adhoc overwriting of previous 
415 
theorems within the same name space. INCOMPATIBILITY, need to remove 

416 
duplicate fact bindings, or even accidental fact duplications. Note 

417 
that tools may maintain dynamically scoped facts systematically, using 

418 
PureThy.add_thms_dynamic. 

419 

26660  420 
* Command 'hide' now allows to hide from "fact" name space as well. 
421 

26496
49ae9456eba9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26495
diff
changeset

422 
* Eliminated destructive theorem database, simpset, claset, and 
49ae9456eba9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26495
diff
changeset

423 
clasimpset. Potential INCOMPATIBILITY, really need to observe linear 
49ae9456eba9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26495
diff
changeset

424 
update of theories within ML code. 
26479  425 

26955
ebbaa935eae0
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm
parents:
26925
diff
changeset

426 
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory. 
ebbaa935eae0
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm
parents:
26925
diff
changeset

427 
INCOMPATIBILITY, objectlogics depending on former Pure require 
ebbaa935eae0
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm
parents:
26925
diff
changeset

428 
additional setup PureThy.old_appl_syntax_setup; objectlogics 
ebbaa935eae0
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm
parents:
26925
diff
changeset

429 
depending on former CPure need to refer to Pure. 
26650  430 

26495  431 
* Commands 'use' and 'ML' are now purely functional, operating on 
26479  432 
theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML' 
433 
instead. Added 'ML_val' as mere diagnostic replacement for 'ML'. 

434 
INCOMPATIBILITY. 

435 

26874  436 
* Command 'setup': discontinued implicit version with ML reference. 
26434  437 

25970
9053fd546501
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs here;
wenzelm
parents:
25961
diff
changeset

438 
* Instantiation target allows for simultaneous specification of class 
9053fd546501
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs here;
wenzelm
parents:
25961
diff
changeset

439 
instance operations together with an instantiation proof. 
9053fd546501
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs here;
wenzelm
parents:
25961
diff
changeset

440 
Typechecking phase allows to refer to class operations uniformly. 
27067  441 
See src/HOL/Complex/Complex.thy for an Isar example and 
442 
src/HOL/Library/Eval.thy for an ML example. 

25502  443 

26201
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset

444 
* Indexing of literal facts: be more serious about including only 
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset

445 
facts from the visible specification/proof context, but not the 
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset

446 
background context (locale etc.). Affects `prop` notation and method 
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset

447 
"fact". INCOMPATIBILITY: need to name facts explicitly in rare 
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset

448 
situations. 
d3363a854708
indexing literal facts: exclude background context;
wenzelm
parents:
26197
diff
changeset

449 

26925
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset

450 
* Method "cases", "induct", "coinduct": removed obsolete/undocumented 
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset

451 
"(open)" option, which used to expose internal bound variables to the 
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset

452 
proof text. 
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset

453 

ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset

454 
* Isar statements: removed obsolete case "rule_context". 
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset

455 
INCOMPATIBILITY, better use explicit fixes/assumes. 
ce964f0df281
* Method "cases", "induct", "coinduct": removed obsolete "(open)" option;
wenzelm
parents:
26920
diff
changeset

456 

26874  457 
* Locale proofs: default proof step now includes 'unfold_locales'; 
458 
hence 'proof' without argument may be used to unfold locale 

459 
predicates. 

26765  460 

461 

26762  462 
*** Document preparation *** 
463 

26914  464 
* Simplified pdfsetup.sty: color/hyperref is used unconditionally for 
465 
both pdf and dvi (hyperlinks usually work in xdvi as well); removed 

466 
obsolete thumbpdf setup (contemporary PDF viewers do this on the 

467 
spot); renamed link color from "darkblue" to "linkcolor" (default 

26920  468 
value unchanged, can be redefined via \definecolor); no longer sets 
469 
"a4paper" option (unnecessary or even intrusive). 

26914  470 

27008  471 
* Antiquotation @{lemma A method} proves proposition A by the given 
472 
method (either a method name or a method name plus (optional) method 

473 
arguments in parentheses) and prints A just like @{prop A}. 

26762  474 

475 

25464
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset

476 
*** HOL *** 
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset

477 

27067  478 
* New primrec package. Specification syntax conforms in style to 
479 
definition/function/.... No separate induction rule is provided. The 

480 
"primrec" command distinguishes oldstyle and newstyle specifications 

481 
by syntax. The former primrec package is now named OldPrimrecPackage. 

482 
When adjusting theories, beware: constants stemming from newstyle 

483 
primrec specifications have authentic syntax. 

484 

485 
* Metis prover is now an order of magnitude faster, and also works 

486 
with multithreading. 

487 

488 
* Metis: the maximum number of clauses that can be produced from a 

489 
theorem is now given by the attribute max_clauses. Theorems that 

490 
exceed this number are ignored, with a warning printed. 

491 

492 
* Sledgehammer no longer produces structured proofs by default. To 

493 
enable, declare [[sledgehammer_full = true]]. Attributes 

494 
reconstruction_modulus, reconstruction_sorts renamed 

495 
sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY. 

496 

27104
791607529f6d
rep_datatype command now takes list of constructors as input arguments
haftmann
parents:
27067
diff
changeset

497 
* Method "induct_scheme" derives userspecified induction rules 
27067  498 
from wellfounded induction and completeness of patterns. This factors 
499 
out some operations that are done internally by the function package 

500 
and makes them available separately. See 

501 
src/HOL/ex/Induction_Scheme.thy for examples. 

502 

503 
* More flexible generation of measure functions for termination 

504 
proofs: Measure functions can be declared by proving a rule of the 

505 
form "is_measure f" and giving it the [measure_function] attribute. 

506 
The "is_measure" predicate is logically meaningless (always true), and 

507 
just guides the heuristic. To find suitable measure functions, the 

508 
termination prover sets up the goal "is_measure ?f" of the appropriate 

509 
type and generates all solutions by prologstyle backwards proof using 

510 
the declared rules. 

511 

512 
This setup also deals with rules like 

513 

514 
"is_measure f ==> is_measure (list_size f)" 

515 

516 
which accommodates nested datatypes that recurse through lists. 

517 
Similar rules are predeclared for products and option types. 

518 

26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

519 
* Turned the type of sets "'a set" into an abbreviation for "'a => bool" 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

520 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

521 
INCOMPATIBILITIES: 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

522 

27008  523 
 Definitions of overloaded constants on sets have to be replaced by 
524 
definitions on => and bool. 

26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

525 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

526 
 Some definitions of overloaded operators on sets can now be proved 
27008  527 
using the definitions of the operators on => and bool. Therefore, 
528 
the following theorems have been renamed: 

26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

529 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

530 
subset_def > subset_eq 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

531 
psubset_def > psubset_eq 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

532 
set_diff_def > set_diff_eq 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

533 
Compl_def > Compl_eq 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

534 
Sup_set_def > Sup_set_eq 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

535 
Inf_set_def > Inf_set_eq 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

536 
sup_set_def > sup_set_eq 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

537 
inf_set_def > inf_set_eq 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

538 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

539 
 Due to the incompleteness of the HO unification algorithm, some 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

540 
rules such as subst may require manual instantiation, if some of 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

541 
the unknowns in the rule is a set. 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

542 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

543 
 Higher order unification and forward proofs: 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

544 
The proof pattern 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

545 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

546 
have "P (S::'a set)" <...> 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

547 
then have "EX S. P S" .. 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

548 

27008  549 
no longer works (due to the incompleteness of the HO unification 
550 
algorithm) and must be replaced by the pattern 

26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

551 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

552 
have "EX S. P S" 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

553 
proof 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

554 
show "P S" <...> 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

555 
qed 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

556 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

557 
 Calculational reasoning with subst (or similar rules): 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

558 
The proof pattern 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

559 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

560 
have "P (S::'a set)" <...> 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

561 
also have "S = T" <...> 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

562 
finally have "P T" . 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

563 

27008  564 
no longer works (for similar reasons as the previous example) and 
565 
must be replaced by something like 

26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

566 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

567 
have "P (S::'a set)" <...> 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

568 
moreover have "S = T" <...> 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

569 
ultimately have "P T" by simp 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

570 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

571 
 Tactics or packages written in ML code: 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

572 
Code performing pattern matching on types via 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

573 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

574 
Type ("set", [T]) => ... 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

575 

27008  576 
must be rewritten. Moreover, functions like strip_type or 
577 
binder_types no longer return the right value when applied to a 

578 
type of the form 

26964
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

579 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

580 
T1 => ... => Tn => U => bool 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

581 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

582 
rather than 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

583 

df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

584 
T1 => ... => Tn => U set 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

585 

26874  586 
* Merged theories Wellfounded_Recursion, Accessible_Part and 
27067  587 
Wellfounded_Relations to theory Wellfounded. 
26748
4d51ddd6aa5c
Merged theories about wellfoundedness into one: Wellfounded.thy
krauss
parents:
26724
diff
changeset

588 

26513  589 
* Explicit class "eq" for executable equality. INCOMPATIBILITY. 
590 

26874  591 
* Class finite no longer treats UNIV as class parameter. Use class 
592 
enum from theory Library/Enum instead to achieve a similar effect. 

26445  593 
INCOMPATIBILITY. 
594 

26874  595 
* Theory List: rule list_induct2 now has explicitly named cases "Nil" 
596 
and "Cons". INCOMPATIBILITY. 

597 

26422
d5883907c514
HOL (and FOL): renamed variables in rules imp_elim and swap;
wenzelm
parents:
26401
diff
changeset

598 
* HOL (and FOL): renamed variables in rules imp_elim and swap. 
d5883907c514
HOL (and FOL): renamed variables in rules imp_elim and swap;
wenzelm
parents:
26401
diff
changeset

599 
Potential INCOMPATIBILITY. 
d5883907c514
HOL (and FOL): renamed variables in rules imp_elim and swap;
wenzelm
parents:
26401
diff
changeset

600 

26874  601 
* Theory Product_Type: duplicated lemmas split_Pair_apply and 
602 
injective_fst_snd removed, use split_eta and prod_eqI instead. 

603 
Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY. 

26355  604 

26335
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

605 
* Theory Nat: removed redundant lemmas that merely duplicate lemmas of 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

606 
the same name in theory Orderings: 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

607 

961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

608 
less_trans 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

609 
less_linear 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

610 
le_imp_less_or_eq 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

611 
le_less_trans 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

612 
less_le_trans 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

613 
less_not_sym 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

614 
less_asym 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

615 

961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

616 
Renamed less_imp_le to less_imp_le_nat, and less_irrefl to 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

617 
less_irrefl_nat. Potential INCOMPATIBILITY due to more general types 
961bbcc9d85b
removed redundant Nat.less_not_sym, Nat.less_asym;
wenzelm
parents:
26333
diff
changeset

618 
and different variable names. 
26315
cb3badaa192e
removed redundant less_trans, less_linear, le_imp_less_or_eq, le_less_trans, less_le_trans (cf. Orderings.thy);
wenzelm
parents:
26231
diff
changeset

619 

26231  620 
* Library/Option_ord.thy: Canonical order on option type. 
621 

27008  622 
* Library/RBT.thy: Redblack trees, an efficient implementation of 
623 
finite maps. 

26197  624 

26231  625 
* Library/Countable.thy: Type class for countable types. 
626 

26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

627 
* Theory Int: The representation of numerals has changed. The infix 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

628 
operator BIT and the bit datatype with constructors B0 and B1 have 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

629 
disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

630 
place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

631 
involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1" 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

632 
accordingly. 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

633 

cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

634 
* Theory Nat: definition of <= and < on natural numbers no longer 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

635 
depend on wellfounded relations. INCOMPATIBILITY. Definitions 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

636 
le_def and less_def have disappeared. Consider lemmas not_less 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

637 
[symmetric, where ?'a = nat] and less_eq [symmetric] instead. 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

638 

cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

639 
* Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

640 
(whose purpose mainly is for various fold_set functionals) have been 
26874  641 
abandoned in favor of the existing algebraic classes 
26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

642 
ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult, 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

643 
lower_semilattice (resp. upper_semilattice) and linorder. 
26139  644 
INCOMPATIBILITY. 
26041
c2e15e65165f
locales ACf, ACIf, ACIfSL and ACIfSLlin have been abandoned in favour of the existing algebraic classes ab_semigroup_mult, ab_semigroup_idem_mult, lower_semilattice (resp. uper_semilattice) and linorder
haftmann
parents:
26013
diff
changeset

645 

26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

646 
* Theory Transitive_Closure: induct and cases rules now declare proper 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

647 
case_names ("base" and "step"). INCOMPATIBILITY. 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

648 

cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

649 
* Theorem Inductive.lfp_ordinal_induct generalized to complete 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

650 
lattices. The form setspecific version is available as 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

651 
Inductive.lfp_ordinal_induct_set. 
26013
8764a1f1253b
Theorem Inductive.lfp_ordinal_induct generalized to complete lattices
haftmann
parents:
26006
diff
changeset

652 

26874  653 
* Renamed theorems "power.simps" to "power_int.simps". 
27067  654 
INCOMPATIBILITY. 
25961  655 

26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

656 
* Class semiring_div provides basic abstract properties of semirings 
25942  657 
with division and modulo operations. Subsumes former class dvd_mod. 
658 

26180
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

659 
* Merged theories IntDef, Numeral and IntArith into unified theory 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

660 
Int. INCOMPATIBILITY. 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

661 

cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

662 
* Theory Library/Code_Index: type "index" now represents natural 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

663 
numbers rather than integers. INCOMPATIBILITY. 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

664 

cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

665 
* New class "uminus" with operation "uminus" (split of from class 
cc85eaab20f6
Transitive_Closure: induct and cases rules now declare proper case_names;
wenzelm
parents:
26139
diff
changeset

666 
"minus" which now only has operation "minus", binary). 
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25900
diff
changeset

667 
INCOMPATIBILITY. 
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25900
diff
changeset

668 

25522  669 
* Constants "card", "internal_split", "option_map" now with authentic 
25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25900
diff
changeset

670 
syntax. INCOMPATIBILITY. 
25522  671 

672 
* Definitions subset_def, psubset_def, set_diff_def, Compl_def, 

673 
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def, 

674 
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def, 

675 
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def, 

676 
Sup_set_def, le_def, less_def, option_map_def now with object 

25919
8b1c0d434824
joined theories IntDef, Numeral, IntArith to theory Int
haftmann
parents:
25900
diff
changeset

677 
equality. INCOMPATIBILITY. 
25464
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset

678 

25705  679 
* Records. Removed K_record, and replaced it by pure lambda term 
25726
9728f319ffc6
* Metis prover an order of magnitude faster, works with multithreading.
wenzelm
parents:
25712
diff
changeset

680 
%x. c. The simplifier setup is now more robust against eta expansion. 
25705  681 
INCOMPATIBILITY: in cases explicitly referring to K_record. 
25464
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset

682 

27067  683 
* Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}. 
684 

685 
* Library/ListVector: new theory of arithmetic vector operations. 

686 

687 
* Library/Order_Relation: new theory of various orderings as sets of 

688 
pairs. Defines preorders, partial orders, linear orders and 

689 
wellorders on sets and on types. 

26877  690 

25726
9728f319ffc6
* Metis prover an order of magnitude faster, works with multithreading.
wenzelm
parents:
25712
diff
changeset

691 

26197  692 
*** ZF *** 
693 

26874  694 
* Renamed some theories to allow to loading both ZF and HOL in the 
695 
same session: 

696 

697 
Datatype > Datatype_ZF 

698 
Inductive > Inductive_ZF 

699 
Int > Int_ZF 

700 
IntDiv > IntDiv_ZF 

701 
Nat > Nat_ZF 

702 
List > List_ZF 

703 
Main > Main_ZF 

704 

705 
INCOMPATIBILITY: ZF theories that import individual theories below 

706 
Main might need to be adapted. Regular theory Main is still 

707 
available, as trivial extension of Main_ZF. 

26197  708 

709 

25737
84c92fc48e36
``print mode'' is now a threadlocal value derived from a global template;
wenzelm
parents:
25726
diff
changeset

710 
*** ML *** 
84c92fc48e36
``print mode'' is now a threadlocal value derived from a global template;
wenzelm
parents:
25726
diff
changeset

711 

27067  712 
* ML within Isar: antiquotation @{const name} or @{const 
713 
name(typargs)} produces staticallychecked Const term. 

714 

26401
e7a94081dce7
Functor NamedThmsFun: data is available to the user as dynamic fact;
wenzelm
parents:
26387
diff
changeset

715 
* Functor NamedThmsFun: data is available to the user as dynamic fact 
26724
ff6ff3a9010e
NamedThmsFun: removed obsolete print command  facts are accesible via dynamic name;
wenzelm
parents:
26718
diff
changeset

716 
(of the same name). Removed obsolete print command. 
26401
e7a94081dce7
Functor NamedThmsFun: data is available to the user as dynamic fact;
wenzelm
parents:
26387
diff
changeset

717 

27067  718 
* Removed obsolete "use_legacy_bindings" function. 
26188  719 

25737
84c92fc48e36
``print mode'' is now a threadlocal value derived from a global template;
wenzelm
parents:
25726
diff
changeset

720 
* The ``print mode'' is now a threadlocal value derived from a global 
84c92fc48e36
``print mode'' is now a threadlocal value derived from a global template;
wenzelm
parents:
25726
diff
changeset

721 
template (the former print_mode reference), thus access becomes 
84c92fc48e36
``print mode'' is now a threadlocal value derived from a global template;
wenzelm
parents:
25726
diff
changeset

722 
noncritical. The global print_mode reference is for session 
84c92fc48e36
``print mode'' is now a threadlocal value derived from a global template;
wenzelm
parents:
25726
diff
changeset

723 
management only; usercode should use print_mode_value, 
84c92fc48e36
``print mode'' is now a threadlocal value derived from a global template;
wenzelm
parents:
25726
diff
changeset

724 
print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY. 
84c92fc48e36
``print mode'' is now a threadlocal value derived from a global template;
wenzelm
parents:
25726
diff
changeset

725 

26874  726 
* Functions system/system_out provide a robust way to invoke external 
27008  727 
shell commands, with propagation of interrupts (requires Poly/ML 5.2). 
26874  728 
Do not use OS.Process.system etc. from the basis library! 
26222
edf6473ac9e9
* system/system_out provides a robust way to invoke external shell
wenzelm
parents:
26218
diff
changeset

729 

25737
84c92fc48e36
``print mode'' is now a threadlocal value derived from a global template;
wenzelm
parents:
25726
diff
changeset

730 

25626
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset

731 
*** System *** 
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset

732 

25971  733 
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs  
734 
in accordance with Proof General 3.7, which prefers GNU emacs. 

25970
9053fd546501
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs here;
wenzelm
parents:
25961
diff
changeset

735 

25626
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset

736 
* isatool tty runs Isabelle process with plain tty interaction; 
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset

737 
optional line editor may be specified via ISABELLE_LINE_EDITOR 
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset

738 
setting, the default settings attempt to locate "ledit" and "rlwrap". 
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset

739 

25651  740 
* isatool browser now works with Cygwin as well, using general 
741 
"javapath" function defined in Isabelle process environment. 

742 

27067  743 
* YXML notation provides a simple and efficient alternative to 
744 
standard XML transfer syntax. See src/Pure/General/yxml.ML and 

745 
isatool yxml as described in the Isabelle system manual. 

25651  746 

25652  747 
* JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes) 
25651  748 
provides general wrapper for managing an Isabelle process in a robust 
749 
fashion, with ``cooked'' output from stdin/stderr. 

750 

25855  751 
* Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit), 
752 
based on Isabelle/JVM process wrapper (see Isabelle/lib/classes). 

753 

27067  754 
* Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented 
755 
way of changing the user's settings is via 

756 
ISABELLE_HOME_USER/etc/settings, which is a fully featured bash 

757 
script. 

758 

759 
* Multithreading.max_threads := 0 refers to the number of actual CPU 

760 
cores of the underlying machine, which is a good starting point for 

761 
optimal performance tuning. The corresponding usedir option M allows 

762 
"max" as an alias for "0". WARNING: does not work on certain versions 

763 
of Mac OS (with Poly/ML 5.1). 

764 

765 
* isabelleprocess: nonML sessions are run with "nice", to reduce the 

766 
adverse effect of Isabelle flooding interactive frontends (notably 

767 
ProofGeneral / XEmacs). 

768 

25626
3000965b1fdf
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm
parents:
25609
diff
changeset

769 

25464
0ca80ce89001
moved new NEWS from Isabelle2007 to this Isabelle version'';
wenzelm
parents:
25459
diff
changeset

770 

25429  771 
New in Isabelle2007 (November 2007) 
772 
 

17754
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

773 

58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

774 
*** General *** 
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

775 

22826  776 
* More uniform information about legacy features, notably a 
777 
warning/error of "Legacy feature: ...", depending on the state of the 

23367  778 
tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY: 
779 
legacy features will disappear eventually. 

22826  780 

17918
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

781 
* Theory syntax: the header format ``theory A = B + C:'' has been 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

782 
discontinued in favour of ``theory A imports B C begin''. Use isatool 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

783 
fixheaders to convert existing theory files. INCOMPATIBILITY. 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

784 

93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

785 
* Theory syntax: the old nonIsar theory file format has been 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

786 
discontinued altogether. Note that ML proof scripts may still be used 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

787 
with Isar theories; migration is usually quite simple with the ML 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

788 
function use_legacy_bindings. INCOMPATIBILITY. 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

789 

22871  790 
* Theory syntax: some popular names (e.g. 'class', 'declaration', 
791 
'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double 

792 
quotes. 

19814
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

793 

23888
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

794 
* Theory loader: be more serious about observing the static theory 
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

795 
header specifications (including optional directories), but not the 
24172
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

796 
accidental file locations of previously successful loads. The strict 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

797 
update policy of former update_thy is now already performed by 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

798 
use_thy, so the former has been removed; use_thys updates several 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

799 
theories simultaneously, just as 'imports' within a theory header 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

800 
specification, but without merging the results. Potential 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

801 
INCOMPATIBILITY: may need to refine theory headers and commands 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

802 
ROOT.ML which depend on load order. 
23888
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

803 

babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

804 
* Theory loader: optional support for contentbased file 
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

805 
identification, instead of the traditional scheme of full physical 
23889  806 
path plus date stamp; configured by the ISABELLE_FILE_IDENT setting 
23888
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

807 
(cf. the system manual). The new scheme allows to work with 
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

808 
nonfinished theories in persistent session images, such that source 
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

809 
files may be moved later on without requiring reloads. 
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

810 

24187
8bdf5ca5871f
* Theory loader: oldstyle ML proof scripts are considered a legacy feature;
wenzelm
parents:
24172
diff
changeset

811 
* Theory loader: oldstyle ML proof scripts being *attached* to a thy 
8bdf5ca5871f
* Theory loader: oldstyle ML proof scripts are considered a legacy feature;
wenzelm
parents:
24172
diff
changeset

812 
file (with the same base name as the theory) are considered a legacy 
24800  813 
feature, which will disappear eventually. Even now, the theory loader 
814 
no longer maintains dependencies on such files. 

815 

816 
* Syntax: the scope for resolving ambiguities via typeinference is 

817 
now limited to individual terms, instead of whole simultaneous 

24234
4714e04fb8e9
* Syntax: scope for resolving ambiguities via typeinference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset

818 
specifications as before. This greatly reduces the complexity of the 
4714e04fb8e9
* Syntax: scope for resolving ambiguities via typeinference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset

819 
syntax module and improves flexibility by separating parsing and 
4714e04fb8e9
* Syntax: scope for resolving ambiguities via typeinference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset

820 
typechecking. INCOMPATIBILITY: additional typeconstraints (explicit 
4714e04fb8e9
* Syntax: scope for resolving ambiguities via typeinference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset

821 
'fixes' etc.) are required in rare situations. 
4714e04fb8e9
* Syntax: scope for resolving ambiguities via typeinference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset

822 

25034  823 
* Syntax: constants introduced by newstyle packages ('definition', 
824 
'abbreviation' etc.) are passed through the syntax module in 

825 
``authentic mode''. This means that associated mixfix annotations 

826 
really stick to such constants, independently of potential name space 

827 
ambiguities introduced later on. INCOMPATIBILITY: constants in parse 

828 
trees are represented slightly differently, may need to adapt syntax 

829 
translations accordingly. Use CONST marker in 'translations' and 

830 
@{const_syntax} antiquotation in 'parse_translation' etc. 

831 

17981
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

832 
* Legacy goal package: reduced interface to the bare minimum required 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

833 
to keep existing proof scripts running. Most other userlevel 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

834 
functions are now part of the OldGoals structure, which is *not* open 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

835 
by default (consider isatool expandshort before open OldGoals). 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

836 
Removed top_sg, prin, printyp, pprint_term/typ altogether, because 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

837 
these tend to cause confusion about the actual goal (!) context being 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

838 
used here, which is not necessarily the same as the_context(). 
17918
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

839 

23379
d0e3f790bd73
updated 'find_theorems'  moved ProofGeneral specifics to ProofGeneral/CHANGES;
wenzelm
parents:
23377
diff
changeset

840 
* Command 'find_theorems': supports "*" wildcard in "name:" 
d0e3f790bd73
updated 'find_theorems'  moved ProofGeneral specifics to ProofGeneral/CHANGES;
wenzelm
parents:
23377
diff
changeset

841 
criterion; "with_dups" option. Certain ProofGeneral versions might 
d0e3f790bd73
updated 'find_theorems'  moved ProofGeneral specifics to ProofGeneral/CHANGES;
wenzelm
parents:
23377
diff
changeset

842 
support a specific search form (see ProofGeneral/CHANGES). 
22965  843 

20370  844 
* The ``prems limit'' option (cf. ProofContext.prems_limit) is now 1 
845 
by default, which means that "prems" (and also "fixed variables") are 

846 
suppressed from proof state output. Note that the ProofGeneral 

847 
settings mechanism allows to change and save options persistently, but 

848 
older versions of Isabelle will fail to start up if a negative prems 

849 
limit is imposed. 

850 

21308
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset

851 
* Local theory targets may be specified by nonnested blocks of 
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset

852 
``context/locale/class ... begin'' followed by ``end''. The body may 
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset

853 
contain definitions, theorems etc., including any derived mechanism 
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset

854 
that has been implemented on top of these primitives. This concept 
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset

855 
generalizes the existing ``theorem (in ...)'' towards more versatility 
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset

856 
and scalability. 
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset

857 

21960
0574f192b78a
* Proof General: proper undo of final 'end'; discontinued Isabelle/classic;
wenzelm
parents:
21896
diff
changeset

858 
* Proof General interface: proper undo of final 'end' command; 
0574f192b78a
* Proof General: proper undo of final 'end'; discontinued Isabelle/classic;
wenzelm
parents:
21896
diff
changeset

859 
discontinued Isabelle/classic mode (ML proof scripts). 
0574f192b78a
* Proof General: proper undo of final 'end'; discontinued Isabelle/classic;
wenzelm
parents:
21896
diff
changeset

860 

17754
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

861 

17865  862 
*** Document preparation *** 
863 

21717  864 
* Added antiquotation @{theory name} which prints the given name, 
865 
after checking that it refers to a valid ancestor theory in the 

866 
current context. 

21339  867 

17869  868 
* Added antiquotations @{ML_type text} and @{ML_struct text} which 
869 
check the given source text as ML type/structure, printing verbatim. 

17865  870 

21717  871 
* Added antiquotation @{abbrev "c args"} which prints the abbreviation 
872 
"c args == rhs" given in the current context. (Any number of 

21735  873 
arguments may be given on the LHS.) 
21717  874 

875 

17779  876 
*** Pure *** 
877 

24800  878 
* The 'class' package offers a combination of axclass and locale to 
25129  879 
achieve Haskelllike type classes in Isabelle. Definitions and 
880 
theorems within a class context produce both relative results (with 

881 
implicit parameters according to the locale context), and polymorphic 

882 
constants with qualified polymorphism (according to the class 

883 
context). Within the body context of a 'class' target, a separate 

884 
syntax layer ("user space type system") takes care of converting 

885 
between global polymorphic consts and internal locale representation. 

25177  886 
See src/HOL/ex/Classpackage.thy for examples (as well as main HOL). 
25184  887 
"isatool doc classes" provides a tutorial. 
20807  888 

25199  889 
* Generic code generator framework allows to generate executable 
24800  890 
code for ML and Haskell (including Isabelle classes). A short usage 
891 
sketch: 

20188
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset

892 

8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset

893 
internal compilation: 
25199  894 
export_code <list of constants (term syntax)> in SML 
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

895 
writing SML code to a file: 
25199  896 
export_code <list of constants (term syntax)> in SML <filename> 
22735  897 
writing OCaml code to a file: 
25199  898 
export_code <list of constants (term syntax)> in OCaml <filename> 
20188
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset

899 
writing Haskell code to a bunch of files: 
25199  900 
export_code <list of constants (term syntax)> in Haskell <filename> 
901 

902 
evaluating closed propositions to True/False using code generation: 

25184  903 
method ``eval'' 
904 

905 
Reasonable default setup of framework in HOL. 

20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

906 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

907 
Theorem attributs for selecting and transforming function equations theorems: 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

908 

22845  909 
[code fun]: select a theorem as function equation for a specific constant 
910 
[code fun del]: deselect a theorem as function equation for a specific constant 

911 
[code inline]: select an equation theorem for unfolding (inlining) in place 

912 
[code inline del]: deselect an equation theorem for unfolding (inlining) in place 

20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

913 

22735  914 
Userdefined serializations (target in {SML, OCaml, Haskell}): 
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

915 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

916 
code_const <andlist of constants (term syntax)> 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

917 
{(target) <andlist of const target syntax>}+ 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

918 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

919 
code_type <andlist of type constructors> 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

920 
{(target) <andlist of type target syntax>}+ 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

921 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

922 
code_instance <andlist of instances> 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

923 
{(target)}+ 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

924 
where instance ::= <type constructor> :: <class> 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

925 

855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

926 
code_class <and_list of classes> 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

927 
{(target) <andlist of class target syntax>}+ 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

928 
where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}? 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

929 

25199  930 
code_instance and code_class only are effective to target Haskell. 
22735  931 

25177  932 
For example usage see src/HOL/ex/Codegenerator.thy and 
933 
src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code 

24800  934 
generation from Isabelle/HOL theories is available via "isatool doc 
935 
codegen". 

20188
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset

936 

25129  937 
* Code generator: consts in 'consts_code' Isar commands are now 
938 
referred to by usual term syntax (including optional type 

939 
annotations). 

940 

19254  941 
* Command 'no_translations' removes translation rules from theory 
942 
syntax. 

943 

19625
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

944 
* Overloaded definitions are now actually checked for acyclic 
19714  945 
dependencies. The overloading scheme is slightly more general than 
946 
that of Haskell98, although Isabelle does not demand an exact 

947 
correspondence to type class and instance declarations. 

948 
INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more 

949 
exotic versions of overloading  at the discretion of the user! 

19711  950 

951 
Polymorphic constants are represented via type arguments, i.e. the 

952 
instantiation that matches an instance against the most general 

953 
declaration given in the signature. For example, with the declaration 

954 
c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented 

955 
as c(nat). Overloading is essentially simultaneous structural 

956 
recursion over such type arguments. Incomplete specification patterns 

19714  957 
impose global constraints on all occurrences, e.g. c('a * 'a) on the 
19715  958 
LHS means that more general c('a * 'b) will be disallowed on any RHS. 
19714  959 
Command 'print_theory' outputs the normalized system of recursive 
960 
equations, see section "definitions". 

19625
285771cec083
* Pure: overloaded definitions are now actually checked for acyclic dependencies;
wenzelm
parents:
19587
diff
changeset

961 

24086  962 
* Configuration options are maintained within the theory or proof 
963 
context (with name and type bool/int/string), providing a very simple 

964 
interface to a poorman's version of general context data. Tools may 

24110
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

965 
declare options in ML (e.g. using Attrib.config_int) and then refer to 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

966 
these values using Config.get etc. Users may change options via an 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

967 
associated attribute of the same name. This form of context 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

968 
declaration works particularly well with commands 'declare' or 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

969 
'using', for example ``declare [[foo = 42]]''. Thus it has become 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

970 
very easy to avoid global references, which would not observe Isar 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

971 
toplevel undo/redo and fail to work with multithreading. 
24086  972 

24172
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

973 
Various global ML references of Pure and HOL have been turned into 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

974 
configuration options: 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

975 

06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

976 
Unify.search_bound unify_search_bound 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

977 
Unify.trace_bound unify_trace_bound 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

978 
Unify.trace_simp unify_trace_simp 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

979 
Unify.trace_types unify_trace_types 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

980 
Simplifier.simp_depth_limit simp_depth_limit 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

981 
Blast.depth_limit blast_depth_limit 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

982 
DatatypeProp.dtK datatype_distinctness_limit 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

983 
fast_arith_neq_limit fast_arith_neq_limit 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

984 
fast_arith_split_limit fast_arith_split_limit 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

985 

24086  986 
* Named collections of theorems may be easily installed as context 
24800  987 
data using the functor NamedThmsFun (see also 
24086  988 
src/Pure/Tools/named_thms.ML). The user may add or delete facts via 
24110
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

989 
attributes; there is also a toplevel print command. This facility is 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

990 
just a common case of general context data, which is the preferred way 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

991 
for anything more complex than just a list of facts in canonical 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

992 
order. 
24086  993 

24032  994 
* Isar: command 'declaration' augments a local theory by generic 
995 
declaration functions written in ML. This enables arbitrary content 

996 
being added to the context, depending on a morphism that tells the 

997 
difference of the original declaration context wrt. the application 

998 
context encountered later on. 

999 

1000 
* Isar: proper interfaces for simplification procedures. Command 

1001 
'simproc_setup' declares named simprocs (with match patterns, and body 

1002 
text in ML). Attribute "simproc" adds/deletes simprocs in the current 

1003 
context. ML antiquotation @{simproc name} retrieves named simprocs. 

1004 

1005 
* Isar: an extra pair of brackets around attribute declarations 

1006 
abbreviates a theorem reference involving an internal dummy fact, 

1007 
which will be ignored later  only the effect of the attribute on 

1008 
the background context will persist. This form of inplace 

1009 
declarations is particularly useful with commands like 'declare' and 

1010 
'using', for example ``have A using [[simproc a]] by simp''. 

1011 

23369
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

1012 
* Isar: method "assumption" (and implicit closing of subproofs) now 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

1013 
takes simple nonatomic goal assumptions into account: after applying 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

1014 
an assumption as a rule the resulting subgoals are solved by atomic 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

1015 
assumption steps. This is particularly useful to finish 'obtain' 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

1016 
goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis", 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

1017 
without referring to the original premise "!!x. P x ==> thesis" in the 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

1018 
Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

1019 
more permissive. 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

1020 

227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

1021 
* Isar: implicit use of prems from the Isar proof context is 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

1022 
considered a legacy feature. Common applications like ``have A .'' 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

1023 
may be replaced by ``have A by fact'' or ``note `A`''. In general, 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

1024 
referencing facts explicitly here improves readability and 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

1025 
maintainability of proof texts. 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

1026 

17865  1027 
* Isar: improper proof element 'guess' is like 'obtain', but derives 
1028 
the obtained context from the course of reasoning! For example: 

1029 

1030 
assume "EX x y. A x & B y"  "any previous fact" 

1031 
then guess x and y by clarify 

1032 

1033 
This technique is potentially adventurous, depending on the facts and 

1034 
proof tools being involved here. 

1035 

18020  1036 
* Isar: known facts from the proof context may be specified as literal 
1037 
propositions, using ASCII backquote syntax. This works wherever 

1038 
named facts used to be allowed so far, in proof commands, proof 

1039 
methods, attributes etc. Literal facts are retrieved from the context 

1040 
according to unification of type and term parameters. For example, 

1041 
provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known 

1042 
theorems in the current context, then these are valid literal facts: 

1043 
`A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc. 

1044 

1045 
There is also a proof method "fact" which does the same composition 

18044  1046 
for explicit goal states, e.g. the following proof texts coincide with 
1047 
certain special cases of literal facts: 

18020  1048 

1049 
have "A" by fact == note `A` 

1050 
have "A ==> B" by fact == note `A ==> B` 

1051 
have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x` 

1052 
have "P a ==> Q a" by fact == note `P a ==> Q a` 

1053 

20118
0c1ec587a5a8
* Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents:
20090
diff
changeset

1054 
* Isar: ":" (colon) is no longer a symbolic identifier character in 
0c1ec587a5a8
* Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents:
20090
diff
changeset

1055 
outer syntax. Thus symbolic identifiers may be used without 
0c1ec587a5a8
* Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents:
20090
diff
changeset

1056 
additional white space in declarations like this: ``assume *: A''. 
0c1ec587a5a8
* Isar: ":" (colon) is no longer a symbolic identifier character;
wenzelm
parents:
20090
diff
changeset

1057 

20013  1058 
* Isar: 'print_facts' prints all local facts of the current context, 
1059 
both named and unnamed ones. 

1060 

18308  1061 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
1062 

1063 
def x == "t" and y == "u" 

1064 

18540  1065 
* Isar: added command 'unfolding', which is structurally similar to 
1066 
'using', but affects both the goal state and facts by unfolding given 

18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

1067 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  1068 
'unfolded' attribute may be replaced by firstclass proof text. 
1069 

18815
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

1070 
* Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded', 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

1071 
and command 'unfolding' now all support objectlevel equalities 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

1072 
(potentially conditional). The underlying notion of rewrite rule is 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

1073 
analogous to the 'rule_format' attribute, but *not* that of the 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

1074 
Simplifier (which is usually more generous). 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

1075 

24238  1076 
* Isar: the new attribute [rotated n] (default n = 1) rotates the 
1077 
premises of a theorem by n. Useful in conjunction with drule. 

1078 

19220  1079 
* Isar: the goal restriction operator [N] (default N = 1) evaluates a 
1080 
method expression within a sandbox consisting of the first N 

19240  1081 
subgoals, which need to exist. For example, ``simp_all [3]'' 
1082 
simplifies the first three subgoals, while (rule foo, simp_all)[] 

1083 
simplifies all new goals that emerge from applying rule foo to the 

1084 
originally first one. 

19220  1085 

19814
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

1086 
* Isar: schematic goals are no longer restricted to higherorder 
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

1087 
patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as 
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

1088 
expected. 
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

1089 

18901  1090 
* Isar: the conclusion of a long theorem statement is now either 
1091 
'shows' (a simultaneous conjunction, as before), or 'obtains' 

1092 
(essentially a disjunction of cases with local parameters and 

1093 
assumptions). The latter allows to express general elimination rules 

18910  1094 
adequately; in this notation common elimination rules look like this: 
18901  1095 

1096 
lemma exE:  "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis" 

1097 
assumes "EX x. P x" 

1098 
obtains x where "P x" 

1099 

1100 
lemma conjE:  "A & B ==> (A ==> B ==> thesis) ==> thesis" 

1101 
assumes "A & B" 

1102 
obtains A and B 

1103 

1104 
lemma disjE:  "A  B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis" 

1105 
assumes "A  B" 

1106 
obtains 

1107 
A 

1108 
 B 

1109 

18910  1110 
The subsequent classical rules even refer to the formal "thesis" 
18901  1111 
explicitly: 
1112 

1113 
lemma classical:  "(~ thesis ==> thesis) ==> thesis" 

1114 
obtains "~ thesis" 

1115 

18910  1116 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
1117 
obtains "thesis ==> something" 

18901  1118 

1119 
The actual proof of an 'obtains' statement is analogous to that of the 

18910  1120 
Isar proof element 'obtain', only that there may be several cases. 
1121 
Optional case names may be specified in parentheses; these will be 

1122 
available both in the present proof and as annotations in the 

1123 
resulting rule, for later use with the 'cases' method (cf. attribute 

1124 
case_names). 

18901  1125 

21447
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset

1126 
* Isar: the assumptions of a long theorem statement are available as 
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset

1127 
"assms" fact in the proof context. This is more appropriate than the 
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset

1128 
(historical) "prems", which refers to all assumptions of the current 
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset

1129 
context, including those from the target locale, proof body etc. 
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset

1130 

19263  1131 
* Isar: 'print_statement' prints theorems from the current theory or 
1132 
proof context in long statement form, according to the syntax of a 

1133 
toplevel lemma. 

1134 

18901  1135 
* Isar: 'obtain' takes an optional case name for the local context 
1136 
introduction rule (default "that"). 

1137 

19587  1138 
* Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use 
1139 
explicit (is "_ ==> ?foo") in the rare cases where this still happens 

1140 
to occur. 

1141 

19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

1142 
* Pure: syntax "CONST name" produces a fully internalized constant 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

1143 
according to the current context. This is particularly useful for 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

1144 
syntax translations that should refer to internal constant 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

1145 
representations independently of name spaces. 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

1146 

21537
45b3a85ee548
* Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents:
21471
diff
changeset

1147 
* Pure: syntax constant for foo (binder "FOO ") is called "foo_binder" 
45b3a85ee548
* Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents:
21471
diff
changeset

1148 
instead of "FOO ". This allows multiple binder declarations to coexist 
45b3a85ee548
* Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents:
21471
diff
changeset

1149 
in the same context. INCOMPATIBILITY. 
45b3a85ee548
* Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents:
21471
diff
changeset

1150 

21209
dbb8decc36bc
'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents:
21200
diff
changeset

1151 
* Isar/locales: 'notation' provides a robust interface to the 'syntax' 
dbb8decc36bc
'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents:
21200
diff
changeset

1152 
primitive that also works in a locale context (both for constants and 
24950  1153 
fixed variables). Type declaration and internal syntactic representation 
1154 
of given constants retrieved from the context. Likewise, the 

1155 
'no_notation' command allows to remove given syntax annotations from the 

1156 
current context. 

19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

1157 

19665  1158 
* Isar/locales: new derived specification elements 'axiomatization', 
1159 
'definition', 'abbreviation', which support typeinference, admit 

19083  1160 
objectlevel specifications (equality, equivalence). See also the 
1161 
isarref manual. Examples: 

19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

1162 

19665  1163 
axiomatization 
21595  1164 
eq (infix "===" 50) where 
1165 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

1166 

1167 
definition "f x y = x + y + 1" 

1168 
definition g where "g x = f x x" 

19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

1169 

19363  1170 
abbreviation 
21595  1171 
neq (infix "=!=" 50) where 
19363  1172 
"x =!= y == ~ (x === y)" 
19081
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

1173 

19083  1174 
These specifications may be also used in a locale context. Then the 
1175 
constants being introduced depend on certain fixed parameters, and the 

1176 
constant name is qualified by the locale base name. An internal 

1177 
abbreviation takes care for convenient input and output, making the 

19088  1178 
parameters implicit and using the original short name. See also 
25177  1179 
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic 
19083  1180 
entities from a monomorphic theory. 
1181 

1182 
Presently, abbreviations are only available 'in' a target locale, but 

19363  1183 
not inherited by general import expressions. Also note that 
1184 
'abbreviation' may be used as a typesafe replacement for 'syntax' + 

24735
3a55ee2cae70
* Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm
parents:
24706
diff
changeset

1185 
'translations' in common applications. The "no_abbrevs" print mode 
3a55ee2cae70
* Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm
parents:
24706
diff
changeset

1186 
prevents folding of abbreviations in term output. 
19084  1187 

19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

1188 
Concrete syntax is attached to specified constants in internal form, 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

1189 
independently of name spaces. The parse tree representation is 
21209
dbb8decc36bc
'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents:
21200
diff
changeset

1190 
slightly different  use 'notation' instead of raw 'syntax', and 
19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

1191 
'translations' with explicit "CONST" markup to accommodate this. 
19665  1192 

24800  1193 
* Pure/Isar: unified syntax for newstyle specification mechanisms 
1194 
(e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits 

1195 
full type inference and dummy patterns ("_"). For example: 

24735
3a55ee2cae70
* Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm
parents:
24706
diff
changeset

1196 

3a55ee2cae70
* Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm
parents:
24706
diff
changeset

1197 
definition "K x _ = x" 
3a55ee2cae70
* Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm
parents:
24706
diff
changeset

1198 

24738  1199 
inductive conj for A B 
1200 
where "A ==> B ==> conj A B" 

1201 

21735  1202 
* Pure: command 'print_abbrevs' prints all constant abbreviations of 
1203 
the current context. Print mode "no_abbrevs" prevents inversion of 

1204 
abbreviations on output. 

1205 

24800  1206 
* Isar/locales: improved parameter handling: use of locales "var" and 
1207 
"struct" no longer necessary;  parameter renamings are no longer 

1208 
required to be injective. For example, this allows to define 

1209 
endomorphisms as locale endom = homom mult mult h. 

19783  1210 

19931
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

1211 
* Isar/locales: changed the way locales with predicates are defined. 
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

1212 
Instead of accumulating the specification, the imported expression is 
22126  1213 
now an interpretation. INCOMPATIBILITY: different normal form of 
1214 
locale expressions. In particular, in interpretations of locales with 

1215 
predicates, goals repesenting already interpreted fragments are not 

1216 
removed automatically. Use methods `intro_locales' and 

1217 
`unfold_locales'; see below. 

1218 

1219 
* Isar/locales: new methods `intro_locales' and `unfold_locales' 

1220 
provide backward reasoning on locales predicates. The methods are 

1221 
aware of interpretations and discharge corresponding goals. 

1222 
`intro_locales' is less aggressive then `unfold_locales' and does not 

1223 
unfold predicates to assumptions. 

19931
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

1224 

fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

1225 
* Isar/locales: the order in which locale fragments are accumulated 
22126  1226 
has changed. This enables to override declarations from fragments due 
1227 
to interpretations  for example, unwanted simp rules. 

19931
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

1228 

23920  1229 
* Isar/locales: interpretation in theories and proof contexts has been 
1230 
extended. One may now specify (and prove) equations, which are 

1231 
unfolded in interpreted theorems. This is useful for replacing 

1232 
defined concepts (constants depending on locale parameters) by 

1233 
concepts already existing in the target context. Example: 

1234 

1235 
interpretation partial_order ["op <= :: [int, int] => bool"] 

1236 
where "partial_order.less (op <=) (x::int) y = (x < y)" 

1237 

24800  1238 
Typically, the constant `partial_order.less' is created by a 
1239 
definition specification element in the context of locale 

1240 
partial_order. 

1241 

24859  1242 
* Method "induct": improved internal context management to support 
24800  1243 
local fixes and defines onthefly. Thus explicit metalevel 
1244 
connectives !! and ==> are rarely required anymore in inductive goals 

1245 
(using objectlogic connectives for this purpose has been long 

1246 
obsolete anyway). Common proof patterns are explained in 

25177  1247 
src/HOL/Induct/Common_Patterns.thy, see also 
1248 
src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic 

1249 
examples. 

24606
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

1250 

24859  1251 
* Method "induct": improved handling of simultaneous goals. Instead of 
24606
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

1252 
introducing objectlevel conjunction, the statement is now split into 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

1253 
several conclusions, while the corresponding symbolic cases are nested 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

1254 
accordingly. INCOMPATIBILITY, proofs need to be structured explicitly, 
25177  1255 
see src/HOL/Induct/Common_Patterns.thy, for example. 
24606
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

1256 

24859  1257 
* Method "induct": mutual induction rules are now specified as a list 
24800  1258 
of rule sharing the same induction cases. HOL packages usually provide 
24606
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

1259 
foo_bar.inducts for mutually defined items foo and bar (e.g. inductive 
24859  1260 
predicates/sets or datatypes). INCOMPATIBILITY, users need to specify 
1261 
mutual induction rules differently, i.e. like this: 

18506
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

1262 

96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

1263 
(induct rule: foo_bar.inducts) 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

1264 
(induct set: foo bar) 
24859  1265 
(induct pred: foo bar) 
18506
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

1266 
(induct type: foo bar) 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

1267 

96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

1268 
The ML function ProjectRule.projections turns oldstyle rules into the 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

1269 
new format. 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

1270 

24859  1271 
* Method "coinduct": dual of induction, see 
18399  1272 
src/HOL/Library/Coinductive_List.thy for various examples. 
1273 

24859  1274 
* Method "cases", "induct", "coinduct": the ``(open)'' option is 
1275 
considered a legacy feature. 

1276 

20919
dab803075c62
attribute "symmetric": standardized schematic variables;
wenzelm
parents:
20857
diff
changeset

1277 
* Attribute "symmetric" produces result with standardized schematic 
dab803075c62
attribute "symmetric": standardized schematic variables;
wenzelm
parents:
20857
diff
changeset

1278 
variables (index 0). Potential INCOMPATIBILITY. 
dab803075c62
attribute "symmetric": standardized schematic variables;
wenzelm
parents:
20857
diff
changeset

1279 

22126  1280 
* Simplifier: by default the simplifier trace only shows top level 
1281 
rewrites now. That is, trace_simp_depth_limit is set to 1 by 

1282 
default. Thus there is less danger of being flooded by the trace. The 

1283 
trace indicates where parts have been suppressed. 

18674  1284 

18536
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1285 
* Provers/classical: removed obsolete classical version of elim_format 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1286 
attribute; classical elim/dest rules are now treated uniformly when 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1287 
manipulating the claset. 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1288 

18694  1289 
* Provers/classical: stricter checks to ensure that supplied intro, 
1290 
dest and elim rules are wellformed; dest and elim rules must have at 

1291 
least one premise. 

1292 

1293 
* Provers/classical: attributes dest/elim/intro take an optional 

18695  1294 
weight argument for the rule (just as the Pure versions). Weights are 
18696  1295 
ignored by automated tools, but determine the search order of single 
18694  1296 
rule steps. 
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18549
diff
changeset

1297 

18536
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1298 
* Syntax: input syntax now supports dummy variable binding "%_. b", 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1299 
where the body does not mention the bound variable. Note that dummy 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1300 
patterns implicitly depend on their context of bounds, which makes 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1301 
"{_. _}" match any set comprehension as expected. Potential 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1302 
INCOMPATIBILITY  parse translations need to cope with syntactic 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1303 
constant "_idtdummy" in the binding position. 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1304 

ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1305 
* Syntax: removed obsolete syntactic constant "_K" and its associated 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1306 
parse translation. INCOMPATIBILITY  use dummy abstraction instead, 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1307 
for example "A > B" => "Pi A (%_. B)". 
17779  1308 

20582
ebd0e03c6a9b
* Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents:
20503
diff
changeset

1309 
* Pure: 'class_deps' command visualizes the subclass relation, using 
ebd0e03c6a9b
* Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents:
20503
diff
changeset

1310 
the graph browser tool. 
ebd0e03c6a9b
* Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents:
20503
diff
changeset

1311 

24800  1312 
* Pure: 'print_theory' now suppresses certain internal declarations by 
1313 
default; use '!' option for full details. 

20620
8b26f58c5646
* Pure: 'print_theory' now suppresses entities with internal name;
wenzelm
parents:
20607
diff
changeset

1314 

17865  1315 

17806  1316 
*** HOL *** 
1317 

25129  1318 
* Method "metis" proves goals by applying the Metis generalpurpose 
1319 
resolution prover (see also http://gilith.com/software/metis/). 

1320 
Examples are in the directory MetisExamples. WARNING: the 

1321 
Isabelle/HOLMetis integration does not yet work properly with 

1322 
multithreading. 

1323 

1324 
* Command 'sledgehammer' invokes external automatic theorem provers as 

1325 
background processes. It generates calls to the "metis" method if 

1326 
successful. These can be pasted into the proof. Users do not have to 

1327 
wait for the automatic provers to return. WARNING: does not really 

1328 
work with multithreading. 

1329 

24804  1330 
* New "auto_quickcheck" feature tests outermost goal statements for 
1331 
potential counterexamples. Controlled by ML references 

1332 
auto_quickcheck (default true) and auto_quickcheck_time_limit (default 

25129  1333 
5000 milliseconds). Fails silently if statements is outside of 
1334 
executable fragment, or any other codgenerator problem occurs. 

24804  1335 

25184  1336 
* New constant "undefined" with axiom "undefined x = undefined". 
1337 

1338 
* Added class "HOL.eq", allowing for code generation with polymorphic 

1339 
equality. 

1340 

1341 
* Some renaming of class constants due to canonical name prefixing in 

1342 
the new 'class' package: 

1343 

1344 
HOL.abs ~> HOL.abs_class.abs 

1345 
HOL.divide ~> HOL.divide_class.divide 

1346 
0 ~> HOL.zero_class.zero 

1347 
1 ~> HOL.one_class.one 

1348 
op + ~> HOL.plus_class.plus 

1349 
op  ~> HOL.minus_class.minus 

1350 
uminus ~> HOL.minus_class.uminus 

1351 
op * ~> HOL.times_class.times 

1352 
op < ~> HOL.ord_class.less 

1353 
op <= > HOL.ord_class.less_eq 

1354 
Nat.power ~> Power.power_class.power 

1355 
Nat.size ~> Nat.size_class.size 

1356 
Numeral.number_of ~> Numeral.number_class.number_of 

1357 
FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf 

1358 
FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup 

1359 
Orderings.min ~> Orderings.ord_class.min 

1360 
Orderings.max ~> Orderings.ord_class.max 

1361 
Divides.op div ~> Divides.div_class.div 

1362 
Divides.op mod ~> Divides.div_class.mod 

1363 
Divides.op dvd ~> Divides.div_class.dvd 

1364 

1365 
INCOMPATIBILITY. Adaptions may be required in the following cases: 

1366 

1367 
a) Userdefined constants using any of the names "plus", "minus", 

1368 
"times", "less" or "less_eq". The standard syntax translations for 

1369 
"+", "" and "*" may go wrong. INCOMPATIBILITY: use more specific 

1370 
names. 

1371 

1372 
b) Variables named "plus", "minus", "times", "less", "less_eq" 

1373 
INCOMPATIBILITY: use more specific names. 

1374 

1375 
c) Permutative equations (e.g. "a + b = b + a") 

1376 
Since the change of names also changes the order of terms, permutative 

1377 
rewrite rules may get applied in a different order. Experience shows 

1378 
that this is rarely the case (only two adaptions in the whole Isabelle 

1379 
distribution). INCOMPATIBILITY: rewrite proofs 

1380 

1381 
d) ML code directly refering to constant names 

1382 
This in general only affects handwritten proof tactics, simprocs and 

1383 
so on. INCOMPATIBILITY: grep your sourcecode and replace names. 

1384 
Consider using @{const_name} antiquotation. 

1385 

1386 
* New class "default" with associated constant "default". 

1387 

1388 
* Function "sgn" is now overloaded and available on int, real, complex 

1389 
(and other numeric types), using class "sgn". Two possible defs of 

1390 
sgn are given as equational assumptions in the classes sgn_if and 

1391 
sgn_div_norm; ordered_idom now also inherits from sgn_if. 

1392 
INCOMPATIBILITY. 

1393 

1394 
* Locale "partial_order" now unified with class "order" (cf. theory 

1395 
Orderings), added parameter "less". INCOMPATIBILITY. 

1396 

1397 
* Renamings in classes "order" and "linorder": facts "refl", "trans" and 

1398 
"cases" to "order_refl", "order_trans" 